{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":76,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":76,"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","author_layer_release":"2026-06-26"},"query_hash":"bbdce79d7f7b","filters":{"venue":"SIAM Journal on Discrete Mathematics"}},"results":[{"id":"W2093347633","doi":"10.1137/s0895480100376022","title":"The Wakeup Problem in Synchronous Broadcast Systems","year":2001,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Synchronization (alternating current); Computer science; Asynchronous communication; Clock synchronization; Parallel computing; Channel (broadcasting); Distributed computing; Computer network","authors":[{"name":"Leszek Gąsieniec","is_ca":false},{"name":"Andrzej Pelc","is_ca":true},{"name":"David Peleg","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01245770845899721,"gpt":0.2471855765119259,"spread":0.2347278680529287,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00299985,0.000797973,0.001347839,0.0006660437,0.001708146,0.001780308,0.001713469,0.001464742,0.003471144],"category_scores_gemma":[0.01263347,0.0007415719,0.0005461461,0.000888176,0.002014326,0.00554116,0.002628473,0.002021701,0.0005595525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001027132,"about_ca_system_score_gemma":0.001300669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00160301,"about_ca_topic_score_gemma":0.001299976,"domain_scores_codex":[0.9971821,0.001114704,0.0001500884,0.0004446576,0.0005477752,0.000560651],"domain_scores_gemma":[0.9889121,0.008038743,0.001021351,0.0009294997,0.0005208425,0.000577428],"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.001728531,0.0002946508,0.002927597,0.0007605679,0.0001170175,0.0007097302,0.001680256,0.4509344,0.01279915,0.4142537,0.009495741,0.1042987],"study_design_scores_gemma":[0.0002451331,0.0002125786,0.0004757103,0.00003680314,0.00005366466,0.0001800247,0.0003895779,0.73904,0.003457887,0.2505208,0.005352364,0.00003551949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1608662,0.001416461,0.8263732,0.001169069,0.000191895,0.0002021717,0.0001713954,0.0009473175,0.008662314],"genre_scores_gemma":[0.9319667,0.0007673177,0.05896215,0.0002666245,0.0002220481,0.0002635079,0.0002630544,0.0001772452,0.007111236],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003471144,"threshold_uncertainty_score":0.01586497,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1813313303","doi":"10.1137/100793529","title":"A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs","year":2012,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Longest path problem; Combinatorics; Mathematics; Lexicographical order; Discrete mathematics; Time complexity; Induced path; Hamiltonian path; Graph; Shortest path problem","authors":[{"name":"George B. Mertzios","is_ca":false},{"name":"Derek G. Corneil","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03762119088775073,"gpt":0.3278538762090636,"spread":0.2902326853213129,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005622272,0.00147012,0.001345924,0.001197294,0.001220319,0.001728583,0.002408461,0.001813473,0.01574604],"category_scores_gemma":[0.003715264,0.0006251137,0.001537883,0.002639159,0.0009695769,0.00408162,0.002596783,0.002663677,0.003707059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002436363,"about_ca_system_score_gemma":0.00271336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007254195,"about_ca_topic_score_gemma":0.008621378,"domain_scores_codex":[0.9986203,0.0001731971,0.00006962575,0.0005848096,0.0002557313,0.0002963988],"domain_scores_gemma":[0.9983441,0.0009254245,0.0001266761,0.0003583375,0.0001614144,0.00008411998],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006067408,0.0006807811,0.00150064,0.0009760326,0.0001458361,0.0003240012,0.0007199144,0.1304825,0.01783871,0.1538407,0.06121568,0.6316684],"study_design_scores_gemma":[0.0003665446,0.0002448063,0.00068859,0.00006800418,0.00008922287,0.0004794775,0.000298894,0.6788419,0.008714265,0.2791166,0.03103041,0.00006133772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03347819,0.000573075,0.9370495,0.001417399,0.0001318478,0.0005030171,0.0008922553,0.006658675,0.01929592],"genre_scores_gemma":[0.209528,0.0004546735,0.7742388,0.0003823388,0.0001335816,0.0005079497,0.003298484,0.0009484551,0.0105077],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01574604,"threshold_uncertainty_score":0.05267572,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046684958","doi":"10.1137/100803870","title":"Gallai's Theorem for List Coloring of Digraphs","year":2011,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Complete coloring; Fractional coloring; Greedy coloring; Vertex (graph theory); List coloring; Discrete mathematics; Generalization; Brooks' theorem; Graph; Graph coloring; Graph power; Line graph","authors":[{"name":"Ararat Harutyunyan","is_ca":false},{"name":"Bojan Mohar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05820909347208875,"gpt":0.311648151051908,"spread":0.2534390575798193,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001648754,0.001355627,0.001421027,0.003014504,0.003638614,0.004500574,0.002218113,0.002185196,0.01254666],"category_scores_gemma":[0.008651676,0.001041101,0.002863664,0.004094388,0.003390326,0.007580003,0.003671146,0.005364449,0.003407404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003758166,"about_ca_system_score_gemma":0.001614443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005006943,"about_ca_topic_score_gemma":0.004516492,"domain_scores_codex":[0.9985783,0.0002327339,0.00009187715,0.0004593976,0.000369292,0.0002683949],"domain_scores_gemma":[0.9959624,0.00231661,0.0002035952,0.00067785,0.0004727983,0.0003667168],"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.00005380747,0.00002484534,0.0002766109,0.0001760299,0.00002970259,0.0001382079,0.0003376176,0.004668648,0.001184906,0.9540148,0.01764134,0.02145358],"study_design_scores_gemma":[0.00003581617,0.00001985806,0.000201756,0.00004619027,0.00003440458,0.0002323303,0.00006050332,0.01379972,0.001133489,0.9506444,0.03376314,0.00002848179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0378347,0.004147639,0.7891356,0.007491629,0.001428246,0.000280343,0.002275729,0.002126825,0.1552794],"genre_scores_gemma":[0.5564198,0.008243797,0.3219968,0.008526322,0.00205316,0.001249195,0.003656503,0.001517333,0.09633708],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01254666,"threshold_uncertainty_score":0.04197276,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963663369","doi":"10.1137/16m108080x","title":"Planar Digraphs of Digirth Four are 2-Colorable","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Digraph; Combinatorics; Mathematics; Conjecture; Monochromatic color; Planar; Planar graph; Colored; Discrete mathematics; Computer science; Graph; Physics","authors":[{"name":"Zhentao Li","is_ca":false},{"name":"Bojan Mohar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04470984151357586,"gpt":0.3163314232194713,"spread":0.2716215817058955,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004050303,0.0007787384,0.0008192588,0.000771273,0.001814535,0.002396347,0.001104593,0.0009554601,0.009400611],"category_scores_gemma":[0.003646694,0.0009454033,0.001188991,0.001033328,0.002008976,0.002963701,0.001778179,0.002260237,0.001242122],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00179285,"about_ca_system_score_gemma":0.0009558771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003914363,"about_ca_topic_score_gemma":0.00618617,"domain_scores_codex":[0.9992884,0.0001045216,0.00004659654,0.0002428547,0.0001065697,0.0002111287],"domain_scores_gemma":[0.995693,0.002578196,0.0004514461,0.0004944944,0.000431575,0.0003512977],"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.001645231,0.0003421279,0.00951616,0.001514292,0.0002601789,0.001337748,0.001924419,0.0393121,0.0316871,0.8053744,0.02375762,0.0833285],"study_design_scores_gemma":[0.0002892904,0.0001981383,0.004299453,0.0001398429,0.0002493404,0.001109611,0.001024554,0.02632716,0.0185379,0.8946941,0.05299226,0.0001383136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7567475,0.001265336,0.123105,0.004215265,0.0003853624,0.0003732248,0.004236457,0.001522544,0.1081493],"genre_scores_gemma":[0.944126,0.0009167076,0.03282784,0.001242109,0.0001011057,0.0001954178,0.003321063,0.0001204988,0.01714925],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009400611,"threshold_uncertainty_score":0.03144819,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064062633","doi":"10.1137/100801044","title":"Isostatic Block and Hole Frameworks","year":2013,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; York University","keywords":"Rigidity (electromagnetism); Vertex (graph theory); Mathematics; Regular polygon; Combinatorics; Digraph; Graph; Geometry; Physics","authors":[{"name":"Wendy Finbow-Singh","is_ca":false},{"name":"Walter Whiteley","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005130116889062898,"gpt":0.2039752871299425,"spread":0.1988451702408796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004663279,0.0004370962,0.0004931634,0.0007345119,0.001233027,0.0009579983,0.0009347809,0.001101177,0.008997003],"category_scores_gemma":[0.001258932,0.0002084031,0.0005826909,0.0003504401,0.002127014,0.002466001,0.002025462,0.0008942624,0.0007725275],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007234915,"about_ca_system_score_gemma":0.0005986026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00267911,"about_ca_topic_score_gemma":0.002846933,"domain_scores_codex":[0.9996045,0.00006919357,0.00001167684,0.00007987223,0.0001248408,0.000109836],"domain_scores_gemma":[0.9995738,0.00008167794,0.00006263958,0.0001068255,0.00005293538,0.0001220983],"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.00001074021,0.000005072058,0.00005851384,0.00000882456,0.000001560698,0.00002600015,0.00004331009,0.003417497,0.0004646404,0.9940299,0.0004892557,0.00144481],"study_design_scores_gemma":[0.000009635323,0.00001957562,0.0001500645,0.00000848728,0.000003068872,0.0000553428,0.00005328029,0.02905551,0.0003353078,0.9658643,0.004435264,0.00001015628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4443059,0.001940969,0.3601265,0.002015981,0.0002515467,0.00009049734,0.0006125292,0.0006479129,0.1900081],"genre_scores_gemma":[0.9513026,0.0004828192,0.02609102,0.0002574083,0.0001019693,0.00006845501,0.0003092003,0.0001692287,0.0212174],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008997003,"threshold_uncertainty_score":0.03009796,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049572715","doi":"10.1137/13090465x","title":"On List Coloring and List Homomorphism of Permutation and Interval Graphs","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Combinatorics; Mathematics; Permutation graph; Discrete mathematics; Indifference graph; Chordal graph; Bipartite graph; Graph coloring; Interval graph; Pathwidth; 1-planar graph; Homomorphism; Cograph; Maximal independent set; Interval (graph theory); Edge coloring; Time complexity; Graph; Line graph; Graph power","authors":[{"name":"Jessica Enright","is_ca":false},{"name":"Lorna Stewart","is_ca":true},{"name":"Gábor Tardos","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01830399331218107,"gpt":0.2873615626007403,"spread":0.2690575692885592,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001332727,0.001143573,0.0009773741,0.0007427764,0.001402512,0.002605189,0.002128575,0.001259184,0.008791491],"category_scores_gemma":[0.007133938,0.000601113,0.001410309,0.002181721,0.001996745,0.007553354,0.002541286,0.00322136,0.001457288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001829246,"about_ca_system_score_gemma":0.002014008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002790704,"about_ca_topic_score_gemma":0.002702996,"domain_scores_codex":[0.9984874,0.0004592217,0.0000661091,0.0004109449,0.0002634429,0.0003129641],"domain_scores_gemma":[0.9922209,0.005816622,0.000436182,0.0008586582,0.0002997633,0.0003678281],"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.001275942,0.001320909,0.003217866,0.001004971,0.0001292336,0.0006630488,0.0007774311,0.27727,0.01517304,0.384978,0.02853897,0.2856507],"study_design_scores_gemma":[0.0001889331,0.0002114877,0.0007658989,0.0000505009,0.00006457187,0.0005037683,0.0002991395,0.3665526,0.01013528,0.6118752,0.009281942,0.00007078683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1059649,0.0009650487,0.8718886,0.00193888,0.0001729323,0.0003220344,0.0008298844,0.001835465,0.01608238],"genre_scores_gemma":[0.5628833,0.001904639,0.4189162,0.0007357,0.000534762,0.000442997,0.003092355,0.0006631563,0.01082689],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008791491,"threshold_uncertainty_score":0.02941042,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2040969474","doi":"10.1137/s0895480103421397","title":"On the Behavior of a Family of Meta-Fibonacci Sequences","year":2005,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Fibonacci number; Mathematics; Combinatorics; Recursion (computer science); Sequence (biology); Palindrome; Term (time); Discrete mathematics; Algorithm; Physics","authors":[{"name":"Joseph H. Callaghan","is_ca":true},{"name":"John J. Chew","is_ca":true},{"name":"Stephen M. Tanny","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04635252515277444,"gpt":0.3245307035768404,"spread":0.2781781784240659,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009260433,0.0004886918,0.0003807204,0.002296692,0.001454807,0.001367272,0.0008411454,0.0008947137,0.002476298],"category_scores_gemma":[0.005217915,0.0003905968,0.0005663707,0.0009477627,0.001697636,0.001719009,0.0005376977,0.0006614629,0.0004391439],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001145046,"about_ca_system_score_gemma":0.0005596538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00113615,"about_ca_topic_score_gemma":0.0007666467,"domain_scores_codex":[0.9995279,0.0001309906,0.00002674205,0.00009763913,0.0001442005,0.0000725935],"domain_scores_gemma":[0.9977367,0.001268142,0.0002964632,0.000163167,0.0003247145,0.000210784],"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.0001007974,0.00002442936,0.004251009,0.0000780987,0.000020766,0.0005999793,0.0007566746,0.01872738,0.01057445,0.9511273,0.001039399,0.01269976],"study_design_scores_gemma":[0.00002861946,0.0001165847,0.003207213,0.00008794085,0.00002438883,0.00183645,0.0003126145,0.3157757,0.005703485,0.6653755,0.007450302,0.00008114141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7644927,0.002278809,0.1990995,0.0005367636,0.00007501106,0.00006866368,0.0003392944,0.0004191811,0.0326901],"genre_scores_gemma":[0.9550194,0.0006984908,0.03909726,0.00009810919,0.00007230331,0.0001495412,0.0002893448,0.00008569199,0.004489873],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002476298,"threshold_uncertainty_score":0.008307934,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2009791993","doi":"10.1137/13094075x","title":"An Erdös--Ko--Rado Theorem for the Derangement Graph of ${PGL}_3(q)$ Acting on the Projective Plane","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Combinatorics; Mathematics; Projective plane; Derangement; Coset; Conjecture; Projective space; Projective line; Discrete mathematics; Projective linear group; Collineation; Projective test; Pure mathematics","authors":[{"name":"Karen Meagher","is_ca":true},{"name":"Pablo Spiga","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01686300571492455,"gpt":0.2435795193572941,"spread":0.2267165136423696,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001159469,0.0006401217,0.0009465502,0.001542466,0.002440269,0.002275308,0.0008771472,0.0009250001,0.008276837],"category_scores_gemma":[0.003077657,0.0004185451,0.001143199,0.001259139,0.003127269,0.004963907,0.003058371,0.002523824,0.001187412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00118083,"about_ca_system_score_gemma":0.0004629711,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008495476,"about_ca_topic_score_gemma":0.0005645859,"domain_scores_codex":[0.9988208,0.0002521146,0.00007444766,0.0003801102,0.0002830752,0.0001895109],"domain_scores_gemma":[0.9971728,0.001399934,0.0004697462,0.0004045627,0.0002857785,0.0002670425],"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.00005491175,0.00001146605,0.0007803295,0.00004412161,0.00001468543,0.0000964041,0.0002398803,0.001598174,0.001489778,0.9897946,0.001439826,0.004435915],"study_design_scores_gemma":[0.0000316778,0.00005225217,0.0007416754,0.00002286509,0.00003396491,0.0003108292,0.0002643832,0.009396901,0.002844313,0.9734662,0.01280576,0.00002934707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5180965,0.001303378,0.3337479,0.004832765,0.0004047833,0.0001849421,0.001185261,0.0004385199,0.1398059],"genre_scores_gemma":[0.9474848,0.001073171,0.03464716,0.0008523618,0.0002733356,0.0002545996,0.0007995359,0.0001081855,0.01450685],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008276837,"threshold_uncertainty_score":0.0276888,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2611857909","doi":"10.1137/16m1086819","title":"A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fondo Nacional de Desarrollo Científico y Tecnológico; National Science Foundation","keywords":"Knapsack problem; Mathematics; Approximation algorithm; Combinatorics; Polynomial-time approximation scheme; Scheduling (production processes); Algorithm; Time complexity; Cover (algebra); Discrete mathematics; Job shop scheduling; Schedule; Mathematical optimization; Computer science","authors":[{"name":"Maurice Cheung","is_ca":false},{"name":"Julián Mestre","is_ca":false},{"name":"David B. Shmoys","is_ca":false},{"name":"José Verschae","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02842515982407755,"gpt":0.263090745202883,"spread":0.2346655853788054,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002168259,0.001748214,0.001869789,0.0008904935,0.0007963182,0.001830626,0.002421746,0.001570883,0.005743754],"category_scores_gemma":[0.003444915,0.0008183113,0.001001742,0.001784357,0.0007936935,0.001679275,0.001709491,0.002919823,0.00166814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001742806,"about_ca_system_score_gemma":0.002158641,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00289674,"about_ca_topic_score_gemma":0.003012369,"domain_scores_codex":[0.9989581,0.0003623567,0.00003897051,0.0001918276,0.0002545057,0.0001943064],"domain_scores_gemma":[0.9990327,0.0005582549,0.00007697158,0.000112999,0.0001279009,0.00009114495],"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.0004231753,0.0003203175,0.0005601022,0.0002926463,0.0000813638,0.000101261,0.0001044947,0.840496,0.001464249,0.04423094,0.009650574,0.1022749],"study_design_scores_gemma":[0.00004270663,0.00002971959,0.00003972587,0.000009977683,0.000007393022,0.00002645519,0.00001433671,0.9844288,0.0003029094,0.01388305,0.001210497,0.000004483017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01272504,0.0006878936,0.9773935,0.0006398694,0.0001621067,0.0001285595,0.0002036849,0.0007508023,0.007308559],"genre_scores_gemma":[0.1930695,0.0004817194,0.7995178,0.0004021097,0.0001489094,0.0003534814,0.0005958775,0.0003067775,0.005123896],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005743754,"threshold_uncertainty_score":0.01921475,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2039117743","doi":"10.1137/s0895480103437651","title":"Alternative Digit Sets for Nonadjacent Representations","year":2005,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Integer (computer science); Mathematics; Set (abstract data type); Representation (politics); Combinatorics; Discrete mathematics; Numerical digit; Arithmetic; Computer science","authors":[{"name":"James A. Muir","is_ca":false},{"name":"Douglas R. Stinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02785605016917992,"gpt":0.3162148602328879,"spread":0.288358810063708,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001207654,0.0005186212,0.0006782092,0.001783674,0.001333917,0.003363373,0.001354238,0.0009843047,0.008141418],"category_scores_gemma":[0.008083756,0.0003649369,0.0007617424,0.001544824,0.001591644,0.003587631,0.002339291,0.001148512,0.001737656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000837267,"about_ca_system_score_gemma":0.000723868,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002438412,"about_ca_topic_score_gemma":0.0004194565,"domain_scores_codex":[0.9980373,0.000323613,0.0002585156,0.0004625206,0.0007023987,0.0002156714],"domain_scores_gemma":[0.9961696,0.001657199,0.000362699,0.001226835,0.0003980671,0.0001855978],"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.000877191,0.0001747577,0.003282483,0.0002136811,0.00002841874,0.0009785409,0.0006361863,0.01638538,0.0208003,0.7438064,0.002448559,0.2103682],"study_design_scores_gemma":[0.0001063208,0.0003285577,0.0009638684,0.0001446678,0.00005037124,0.001925694,0.0004101859,0.1163655,0.0546611,0.7914164,0.03350281,0.0001245179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4199552,0.0008590602,0.5436783,0.0005026421,0.0002761487,0.0001440837,0.0004709962,0.001377575,0.03273604],"genre_scores_gemma":[0.7162679,0.0002302226,0.2737987,0.0001713361,0.00008575497,0.00008630112,0.0005502539,0.0001210452,0.008688415],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008141418,"threshold_uncertainty_score":0.02723581,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1974452921","doi":"10.1137/120891265","title":"Lower Bounds for the Isoperimetric Numbers of Random Regular Graphs","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Isoperimetric inequality; Combinatorics; Mathematics; Upper and lower bounds; Vertex (graph theory); Graph; Discrete mathematics; Mathematical analysis","authors":[{"name":"Brett Kolesnik","is_ca":true},{"name":"Nick Wormald","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0264843269633047,"gpt":0.3057508159746372,"spread":0.2792664890113325,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00745567,0.003345337,0.002609754,0.005807304,0.002396658,0.004631918,0.006585085,0.003228219,0.008183946],"category_scores_gemma":[0.08264665,0.001866844,0.002787194,0.003571252,0.006083485,0.01355808,0.006765168,0.01034687,0.001752956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005961682,"about_ca_system_score_gemma":0.001487552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001349026,"about_ca_topic_score_gemma":0.001290123,"domain_scores_codex":[0.9911376,0.002891371,0.0003563081,0.002218214,0.002350952,0.001045499],"domain_scores_gemma":[0.9159346,0.0656515,0.004246933,0.007575786,0.003529501,0.003061645],"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.0007939625,0.0003211912,0.00481527,0.0009381588,0.0002741492,0.0003994255,0.0005974987,0.1952095,0.01350708,0.7161911,0.01243798,0.05451475],"study_design_scores_gemma":[0.00005366463,0.0001426952,0.00230656,0.0001780814,0.00009104673,0.0005861253,0.0001134818,0.5191662,0.006188976,0.4642635,0.006791076,0.0001185641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1592685,0.008701988,0.7560831,0.007396044,0.0004548116,0.0003007288,0.002384106,0.001772889,0.06363782],"genre_scores_gemma":[0.7897412,0.007098495,0.1781184,0.002220385,0.001601811,0.001388495,0.002903234,0.001462624,0.01546547],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008183946,"threshold_uncertainty_score":0.04325527,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2131975287","doi":"10.1137/100795425","title":"Nested Recurrence Relations with Conolly-like Solutions","year":2012,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Fibonacci number; Sequence (biology); BETA (programming language); Integer (computer science); Discrete mathematics","authors":[{"name":"Alejandro Erickson","is_ca":false},{"name":"Abraham Isgur","is_ca":false},{"name":"Bradley W. Jackson","is_ca":false},{"name":"Frank Ruskey","is_ca":false},{"name":"Stephen M. Tanny","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02611174129951032,"gpt":0.2522767201504192,"spread":0.2261649788509089,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006250464,0.0005365591,0.0004925782,0.0009774622,0.001669966,0.001885019,0.0008083947,0.001071762,0.01020898],"category_scores_gemma":[0.006964986,0.0004060454,0.0007804567,0.001091347,0.001684233,0.002316534,0.001356253,0.00172965,0.001567915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00152738,"about_ca_system_score_gemma":0.0009285623,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00264795,"about_ca_topic_score_gemma":0.005468728,"domain_scores_codex":[0.9988444,0.0002403412,0.0001287598,0.0002811021,0.0002520299,0.0002533754],"domain_scores_gemma":[0.9980428,0.000875975,0.0003241318,0.0001918203,0.0004095859,0.0001556003],"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.00004605476,0.00003708249,0.0007956802,0.00009769935,0.000009647233,0.0005749694,0.00100104,0.003822725,0.00569328,0.9669531,0.002876961,0.01809168],"study_design_scores_gemma":[0.00004856263,0.00007415383,0.0005493937,0.00008986187,0.00003582728,0.0009295259,0.0006219091,0.03629652,0.00946623,0.9262189,0.02559269,0.00007632918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3948889,0.00129823,0.4679482,0.001579958,0.0004882143,0.0003393314,0.0006690329,0.001256434,0.1315317],"genre_scores_gemma":[0.8155422,0.0004625263,0.1417001,0.0006941547,0.0001710248,0.0003974265,0.0007394836,0.0003059687,0.03998715],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01020898,"threshold_uncertainty_score":0.03415239,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2600683609","doi":"10.1137/16m1057486","title":"Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Minimum degree spanning tree; Vertex connectivity; Enhanced Data Rates for GSM Evolution; Induced subgraph isomorphism problem; Upper and lower bounds; Spanning tree; Subgraph isomorphism problem; Connected dominating set; Discrete mathematics; Graph; Computer science; Line graph; Vertex (graph theory); Voltage graph; Artificial intelligence","authors":[{"name":"Sylvia Boyd","is_ca":false},{"name":"Philippe Legault","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08980382657351924,"gpt":0.325023209135156,"spread":0.2352193825616367,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005374163,0.003145976,0.002482229,0.002750862,0.002176618,0.005745469,0.005139528,0.004099493,0.01783732],"category_scores_gemma":[0.02279148,0.0016147,0.002291841,0.003400986,0.003828095,0.01108035,0.00591897,0.01151295,0.004910459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004655106,"about_ca_system_score_gemma":0.002551838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002446718,"about_ca_topic_score_gemma":0.003176067,"domain_scores_codex":[0.9965652,0.0008368953,0.000106498,0.0007573868,0.001037532,0.0006966051],"domain_scores_gemma":[0.9876467,0.008928653,0.0007465581,0.001137957,0.0006149209,0.0009251164],"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.002384625,0.0007408661,0.002690506,0.001491804,0.0002236944,0.0003891767,0.0008159676,0.1783799,0.01463271,0.6378477,0.06700499,0.09339814],"study_design_scores_gemma":[0.0001506555,0.0002105095,0.001108792,0.0003556417,0.0001179808,0.0003061914,0.0002159725,0.3272094,0.00561213,0.6442412,0.02040585,0.00006569375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2351898,0.01249267,0.5110703,0.02507923,0.001222789,0.0004163855,0.005233581,0.002490874,0.2068045],"genre_scores_gemma":[0.6235845,0.006228426,0.33069,0.008367185,0.001569131,0.000973934,0.005494136,0.001862206,0.02123051],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01783732,"threshold_uncertainty_score":0.05967176,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999315130","doi":"10.1137/080716931","title":"Paths with No Small Angles","year":2009,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Conjecture; Travelling salesman problem; Path (computing); Constant (computer programming); Plane (geometry); Set (abstract data type); Discrete mathematics; Geometry; Algorithm; Graph; Computer science","authors":[{"name":"Imre Bárány","is_ca":false},{"name":"Attila Pór","is_ca":false},{"name":"Pável Valtr","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01561867068542233,"gpt":0.2381191567294982,"spread":0.2225004860440759,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003988705,0.0008340537,0.0007545002,0.0008214368,0.001636206,0.002209044,0.00103093,0.001423341,0.01701162],"category_scores_gemma":[0.008010171,0.0008459968,0.0008636584,0.001179288,0.001577583,0.003531804,0.003785578,0.002820513,0.003384991],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006355289,"about_ca_system_score_gemma":0.0006139337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009589362,"about_ca_topic_score_gemma":0.001152458,"domain_scores_codex":[0.9988405,0.0002228964,0.00008098226,0.0003217317,0.0002843557,0.0002495333],"domain_scores_gemma":[0.9970813,0.001386462,0.0003886292,0.0005875879,0.0002516384,0.0003043152],"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.001029318,0.0001378998,0.002580544,0.0005252807,0.00006927442,0.0006192389,0.0005984828,0.05627043,0.01174291,0.7904828,0.01385053,0.1220934],"study_design_scores_gemma":[0.0002596903,0.00027532,0.001102989,0.0002319877,0.00007107973,0.0009129854,0.0006155235,0.08545265,0.008420899,0.8257356,0.07685272,0.00006850708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3354442,0.002797442,0.5132806,0.002402694,0.0009763939,0.0002696581,0.001849237,0.0009447163,0.1420351],"genre_scores_gemma":[0.7271004,0.002779564,0.2261319,0.0006786947,0.0002754134,0.0004987016,0.002945999,0.0004887807,0.03910045],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01701162,"threshold_uncertainty_score":0.0569095,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2569664619","doi":"10.1137/15m100866x","title":"Lower Bounds on the Probability of a Finite Union of Events","year":2016,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Event (particle physics); Discrete mathematics; Pairwise comparison; Finite set; Class (philosophy); Statistics; Mathematical analysis","authors":[{"name":"Jun Yang","is_ca":false},{"name":"Fady Alajaji","is_ca":false},{"name":"Glen Takahara","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07988994126648957,"gpt":0.3476467137898471,"spread":0.2677567725233576,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01652594,0.003148867,0.0041356,0.003738067,0.001816749,0.007638916,0.005461157,0.002936349,0.01199176],"category_scores_gemma":[0.08347221,0.001615787,0.002627105,0.004161157,0.004824103,0.0143304,0.004439427,0.008575019,0.001938933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004247768,"about_ca_system_score_gemma":0.00232372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001784679,"about_ca_topic_score_gemma":0.001518023,"domain_scores_codex":[0.9864427,0.004235877,0.0007492292,0.002528644,0.004540798,0.001502865],"domain_scores_gemma":[0.8889581,0.09624404,0.004091328,0.00491719,0.004212691,0.001576535],"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.0003303833,0.0001189928,0.001673521,0.0004839274,0.0002459517,0.0002212444,0.0002349707,0.4412846,0.001622261,0.5046609,0.004026866,0.04509639],"study_design_scores_gemma":[0.00001929923,0.00006736773,0.0004723221,0.0001649187,0.00006489593,0.0001893637,0.00005504081,0.6923604,0.001399378,0.3013026,0.003854264,0.00005025863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0104223,0.003091252,0.9734583,0.0009164991,0.0001685731,0.00004700329,0.0002316661,0.0002386994,0.01142577],"genre_scores_gemma":[0.5874188,0.0100611,0.3768326,0.001509885,0.002469044,0.001075727,0.002047286,0.0008816117,0.01770391],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01652594,"threshold_uncertainty_score":0.08739859,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3198462604","doi":"10.1137/21m1443352","title":"Complexity Dichotomy for List-5-Coloring with a Forbidden Induced Subgraph","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"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; Mathematics; Vertex (graph theory); Disjoint sets; Induced subgraph; Discrete mathematics; Complete coloring; Integer (computer science); Graph; Time complexity; Fractional coloring; List coloring; Graph power; Computer science; Line graph","authors":[{"name":"Sepehr Hajebi","is_ca":true},{"name":"Yanjia Li","is_ca":true},{"name":"Sophie Spirkl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0753537972018547,"gpt":0.3294979614260338,"spread":0.2541441642241791,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002646347,0.001572957,0.002184405,0.00104591,0.002317339,0.007437878,0.003502162,0.003037279,0.01392866],"category_scores_gemma":[0.01032465,0.0009128837,0.002926682,0.001561721,0.002252626,0.009947645,0.003341803,0.006368421,0.001931608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006433172,"about_ca_system_score_gemma":0.004758527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003626596,"about_ca_topic_score_gemma":0.0038818,"domain_scores_codex":[0.995463,0.001118356,0.0001836515,0.001141975,0.0008642757,0.001228757],"domain_scores_gemma":[0.9803054,0.01539794,0.0009733158,0.001748904,0.0006176493,0.0009567927],"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.003202509,0.001536062,0.005498138,0.002183278,0.0004928336,0.0006569734,0.001270541,0.1718951,0.014918,0.6102425,0.1103435,0.0777607],"study_design_scores_gemma":[0.0004489127,0.000156303,0.001526903,0.0001153246,0.0001574443,0.0003012363,0.0002635418,0.3810068,0.002768895,0.6051167,0.008060369,0.00007765842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5306817,0.004342934,0.3053466,0.04380347,0.0009258288,0.000727802,0.01545936,0.004618332,0.09409397],"genre_scores_gemma":[0.8688168,0.001945276,0.0972961,0.004924869,0.00122966,0.0008783579,0.009674263,0.0006937576,0.01454085],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01392866,"threshold_uncertainty_score":0.04667616,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975406723","doi":"10.1137/070687988","title":"Edge-Face Total Chromatic Number of Halin Graphs","year":2009,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Vertex (graph theory); Discrete mathematics; Face (sociological concept); Enhanced Data Rates for GSM Evolution; Graph; Computer science; Artificial intelligence","authors":[{"name":"Wai Hong Chan","is_ca":false},{"name":"Peter Che Bor Lam","is_ca":false},{"name":"Wai Chee Shiu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01865966902696562,"gpt":0.3178651783919686,"spread":0.299205509365003,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003413858,0.0003684007,0.0002940213,0.0008749636,0.00123674,0.001386819,0.0008177901,0.0003043697,0.004249832],"category_scores_gemma":[0.001374412,0.0002090247,0.0001995542,0.0005672086,0.0007912393,0.0009918083,0.0007053461,0.0005940075,0.0002786814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00169658,"about_ca_system_score_gemma":0.0006237107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003466735,"about_ca_topic_score_gemma":0.005797954,"domain_scores_codex":[0.9997436,0.00004640184,0.000008462122,0.00005877189,0.00006611607,0.00007662251],"domain_scores_gemma":[0.9990016,0.0005323616,0.00009264469,0.0001134457,0.0001245013,0.0001355516],"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.002071433,0.0002513499,0.02624338,0.0003682535,0.0001120617,0.0004616071,0.001079109,0.2593901,0.05859276,0.5106226,0.01661829,0.124189],"study_design_scores_gemma":[0.0001008447,0.0001864926,0.01077793,0.00003936372,0.00008193447,0.0005074173,0.0005024335,0.5802069,0.05203721,0.3450574,0.01043189,0.00007004125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.922976,0.0002073304,0.05185035,0.0003820925,0.00003207687,0.00003115728,0.0004507348,0.0002925104,0.02377763],"genre_scores_gemma":[0.9842254,0.0001068207,0.01163279,0.00004333939,0.00001406018,0.00003163396,0.0002522595,0.00005177814,0.00364193],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004249832,"threshold_uncertainty_score":0.01421714,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2238259313","doi":"10.1137/15m1007185","title":"Lehman's Theorem and the Directed Steiner Tree Problem","year":2016,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Mathematics; Combinatorics; Discrete mathematics; Tree (set theory); Mathematical economics","authors":[{"name":"Ahmad Abdi","is_ca":true},{"name":"Andreas Emil Feldmann","is_ca":false},{"name":"Bertrand Guenin","is_ca":true},{"name":"Jochen Könemann","is_ca":true},{"name":"Laura Sanità","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01524831230176371,"gpt":0.2699891274693736,"spread":0.2547408151676099,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001293181,0.0005088872,0.0005374198,0.0009832071,0.0008286965,0.001479651,0.001193552,0.0009152619,0.003775828],"category_scores_gemma":[0.003235576,0.0003542095,0.0008349817,0.001444056,0.002343042,0.003899832,0.001451125,0.001977554,0.0005090219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001933078,"about_ca_system_score_gemma":0.001033554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002128428,"about_ca_topic_score_gemma":0.002072044,"domain_scores_codex":[0.9993338,0.0001416533,0.00003346888,0.000132752,0.0002486583,0.0001097081],"domain_scores_gemma":[0.9987796,0.0008561793,0.000100191,0.0000631232,0.0001166692,0.00008433279],"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.00001519253,0.00001141683,0.0001594395,0.00004560006,0.000007109455,0.00005120453,0.00007512272,0.01063718,0.0002445004,0.9740341,0.002288636,0.0124305],"study_design_scores_gemma":[0.00001087491,0.00001549656,0.000127433,0.00002485798,0.00000919811,0.00008160727,0.00003611637,0.02800746,0.0003214109,0.9614589,0.009898704,0.000007970213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05384207,0.005759436,0.8437911,0.005152305,0.0002140227,0.00005951243,0.0004321839,0.0003232407,0.09042604],"genre_scores_gemma":[0.710849,0.007939742,0.2520309,0.001343247,0.0006385078,0.0001699765,0.0009078012,0.0001826875,0.02593803],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003775828,"threshold_uncertainty_score":0.01402557,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2903461617","doi":"10.1137/18m1229420","title":"Counterexamples to a Conjecture of Harris on Hall Ratio","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"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; European Commission; National Security Agency; Centre de Recherches Mathématiques; Simons Foundation; National Science Foundation","keywords":"Counterexample; Conjecture; Mathematics; Combinatorics; Discrete mathematics","authors":[{"name":"Adam Blumenthal","is_ca":false},{"name":"Bernard Lidický","is_ca":false},{"name":"Ryan R. Martin","is_ca":false},{"name":"Sergey Norin","is_ca":true},{"name":"Florian Pfender","is_ca":false},{"name":"Jan Volec","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03824283640347566,"gpt":0.3103611491623025,"spread":0.2721183127588268,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002822917,0.0005156664,0.001028831,0.001497701,0.00228605,0.002216312,0.00181709,0.00241356,0.01017138],"category_scores_gemma":[0.02075784,0.0005507458,0.0009551625,0.001765713,0.00715661,0.008096468,0.004130489,0.004066119,0.0008130071],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002021165,"about_ca_system_score_gemma":0.0005501877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001631878,"about_ca_topic_score_gemma":0.001057128,"domain_scores_codex":[0.9977933,0.0005650727,0.00007333517,0.0006216677,0.0004873192,0.0004592495],"domain_scores_gemma":[0.9772032,0.01726639,0.0009815616,0.002907554,0.0008712208,0.0007699826],"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.0002024744,0.00002839406,0.0009724929,0.00007809599,0.00001032675,0.000189949,0.0003724645,0.003181909,0.001396364,0.9750641,0.0116138,0.00688972],"study_design_scores_gemma":[0.00006825114,0.00003193615,0.000723248,0.00002536347,0.00001297576,0.0003104168,0.0002166011,0.01302292,0.001749821,0.9740242,0.009787561,0.00002687299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6218368,0.002927848,0.1464112,0.05787106,0.00130351,0.00009284951,0.0009610776,0.002231498,0.1663642],"genre_scores_gemma":[0.9733213,0.0007046433,0.01505153,0.002981015,0.0007159999,0.00007946105,0.0002207713,0.0002518678,0.00667342],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01017138,"threshold_uncertainty_score":0.03402668,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964048937","doi":"10.1137/18m1174544","title":"An Optimization Parameter for Seriation of Noisy Data","year":2019,"lang":"kn","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; University of Delaware Research Foundation","keywords":"Mathematics; Similarity (geometry); Matrix (chemical analysis); Identity matrix; Combinatorics; Diagonal; Square matrix; Matrix similarity; Matrix norm; Row; Row and column spaces; Seriation (archaeology); Symmetric matrix; Artificial intelligence; Computer science; Mathematical analysis; Eigenvalues and eigenvectors","authors":[{"name":"Mahya Ghandehari","is_ca":false},{"name":"Jeannette Janssen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05583733570121908,"gpt":0.3495324354803124,"spread":0.2936950997790934,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009781443,0.001627938,0.001958139,0.001463927,0.0007381071,0.002723723,0.002682892,0.002842641,0.003215836],"category_scores_gemma":[0.08251316,0.0008259931,0.0009240527,0.001557054,0.003149054,0.006100929,0.003247072,0.003399424,0.00151606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00221313,"about_ca_system_score_gemma":0.001907116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001271348,"about_ca_topic_score_gemma":0.001193602,"domain_scores_codex":[0.9940304,0.002519109,0.0005375665,0.0013623,0.001242798,0.0003077027],"domain_scores_gemma":[0.9643472,0.02326679,0.003079944,0.005715072,0.002577415,0.001013472],"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.000766906,0.0001721682,0.004152681,0.0004405552,0.0001791489,0.0002256157,0.0003379067,0.7445567,0.01232904,0.0618024,0.009427376,0.1656095],"study_design_scores_gemma":[0.00003180094,0.0001474007,0.0005650916,0.00005342437,0.00001842266,0.0001669169,0.00008275192,0.9580845,0.004778328,0.0341057,0.001926764,0.00003900865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01911966,0.0004131333,0.9769721,0.0007799836,0.0001160254,0.00009921053,0.0002309238,0.0009580906,0.001310799],"genre_scores_gemma":[0.4451164,0.000530032,0.5474606,0.0007369476,0.0003276988,0.0004057425,0.001052069,0.0008115822,0.0035589],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009781443,"threshold_uncertainty_score":0.0517298,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001034532","doi":"10.1137/s0895480101384402","title":"Lower Bounds from Tile Covers for the Channel Assignment Problem","year":2005,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Cover (algebra); Mathematics; Reduction (mathematics); Clique; Channel (broadcasting); Constraint (computer-aided design); Tile; Upper and lower bounds; Combinatorics; Enumeration; Mathematical optimization; Assignment problem; Discrete mathematics; Computer science; Computer network","authors":[{"name":"Jeannette Janssen","is_ca":true},{"name":"T. E. Wentzell","is_ca":true},{"name":"Shannon L. Fitzpatrick","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01180277747908987,"gpt":0.2196632457915288,"spread":0.207860468312439,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003604618,0.003599666,0.002071333,0.004223967,0.00188205,0.005418716,0.002794975,0.00222357,0.01595745],"category_scores_gemma":[0.01909868,0.001415814,0.00361016,0.003693786,0.002180691,0.006759956,0.004210485,0.007901085,0.003561092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003637061,"about_ca_system_score_gemma":0.001502289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001522667,"about_ca_topic_score_gemma":0.00203151,"domain_scores_codex":[0.9957985,0.00102824,0.0001506925,0.0004548064,0.001779553,0.0007882083],"domain_scores_gemma":[0.9842451,0.01204415,0.0006418493,0.00129878,0.001253293,0.0005168353],"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.0004086272,0.0002717589,0.001273772,0.0008041016,0.0001920949,0.0002800565,0.0004179975,0.3675829,0.007051476,0.4948519,0.03645238,0.09041291],"study_design_scores_gemma":[0.0000614245,0.0001444058,0.000518959,0.0001764745,0.00009701992,0.0002083757,0.00008944059,0.5132744,0.004806319,0.4614753,0.01910355,0.00004430367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02114622,0.002450455,0.9201123,0.001280392,0.0003161393,0.0002188087,0.001067787,0.0007409801,0.05266688],"genre_scores_gemma":[0.4273248,0.007088333,0.5237482,0.001349655,0.001691753,0.00230519,0.007554672,0.002461219,0.0264761],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01595745,"threshold_uncertainty_score":0.05338299,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2061027724","doi":"10.1137/s0895480103428053","title":"Counting Strings with Given Elementary Symmetric Function Evaluations II: Circular Strings","year":2004,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Aperiodic graph; Alphabet; Finite field; Ring (chemistry); Physics","authors":[{"name":"C. Robert Miers","is_ca":true},{"name":"Frank Ruskey","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01631480771133677,"gpt":0.2511368983542985,"spread":0.2348220906429618,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002657129,0.0005074893,0.0009864818,0.002514922,0.001757607,0.005743713,0.00172029,0.001296108,0.004433464],"category_scores_gemma":[0.01345886,0.0004803098,0.001005631,0.002867705,0.003256172,0.007748974,0.002110093,0.00173365,0.0004772036],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002958856,"about_ca_system_score_gemma":0.001046167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009260721,"about_ca_topic_score_gemma":0.0006126355,"domain_scores_codex":[0.9975623,0.0004597798,0.0002623909,0.0005764313,0.0005355985,0.0006036143],"domain_scores_gemma":[0.9917431,0.004478459,0.001134669,0.001267289,0.0008090985,0.0005671775],"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.0001648542,0.00002841096,0.001555936,0.00006434914,0.00000913988,0.00008647941,0.0003711905,0.003671623,0.002398061,0.9783949,0.0008343185,0.01242073],"study_design_scores_gemma":[0.00002608842,0.00007251167,0.001320265,0.00007268912,0.00004189391,0.0003236997,0.0002001546,0.04581371,0.01204172,0.9359202,0.004113584,0.00005351654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6847871,0.0006735949,0.2641971,0.0006911633,0.0001447117,0.0001184709,0.0006079128,0.0005935727,0.0481863],"genre_scores_gemma":[0.9459757,0.000373109,0.04430236,0.000188823,0.0001898386,0.0001740393,0.0005667096,0.0002283582,0.008001165],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005743713,"threshold_uncertainty_score":0.02146804,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2568997022","doi":"10.1137/120885498","title":"Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Glauber; Omega; Combinatorics; Mathematics; Lambda; Vertex (graph theory); Inverse; Boundary (topology); Tree (set theory); Spectral gap; Markov chain; Discrete mathematics; Physics; Mathematical analysis; Geometry; Graph; Scattering; Quantum mechanics; Statistics","authors":[{"name":"Ricardo Restrepo","is_ca":false},{"name":"Daniel Štefankovič","is_ca":false},{"name":"Juan C. Vera","is_ca":true},{"name":"Eric Vigoda","is_ca":false},{"name":"Linji Yang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04782450638894484,"gpt":0.3731392362918386,"spread":0.3253147299028938,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008676291,0.0005693085,0.0007232781,0.001118727,0.001207236,0.001467232,0.0009778716,0.001350817,0.004337471],"category_scores_gemma":[0.007301482,0.0003747836,0.0008550036,0.0003470817,0.002438284,0.002292456,0.001344278,0.002075738,0.0003848752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001968521,"about_ca_system_score_gemma":0.0009959068,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002821911,"about_ca_topic_score_gemma":0.001842395,"domain_scores_codex":[0.9996933,0.00008341515,0.00000911184,0.00005272344,0.00005244813,0.0001091261],"domain_scores_gemma":[0.9967551,0.001860501,0.0005277834,0.000129954,0.0001661332,0.0005605589],"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.0001957025,0.0001826372,0.001454549,0.000146759,0.00003728961,0.0002723086,0.0006590691,0.1374357,0.01674566,0.836637,0.002236627,0.00399677],"study_design_scores_gemma":[0.00006859224,0.00006265374,0.0006618096,0.00003299165,0.00001381606,0.00005863386,0.0001543102,0.7981549,0.002187249,0.1977963,0.0007740656,0.00003467494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8159477,0.001026521,0.1627493,0.001874728,0.0001266731,0.00008800127,0.0001796493,0.0005715487,0.01743589],"genre_scores_gemma":[0.9838463,0.0002653311,0.01297708,0.0002322544,0.00004416011,0.0001175575,0.0001369951,0.0001735695,0.002206739],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004337471,"threshold_uncertainty_score":0.01451027,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4394576567","doi":"10.1137/23m1566881","title":"The Rainbow Saturation Number Is Linear","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Royal Society; Pacific Institute for the Mathematical Sciences","keywords":"Mathematics; Rainbow; Combinatorics; Saturation (graph theory); Discrete mathematics; Physics","authors":[{"name":"Natalie Behague","is_ca":false},{"name":"Tom Johnston","is_ca":false},{"name":"Shoham Letzter","is_ca":false},{"name":"Natasha Morrison","is_ca":true},{"name":"Shannon N. Ogden","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03317991022247071,"gpt":0.3507728544403557,"spread":0.317592944217885,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009936284,0.0007734734,0.0007925455,0.0008168049,0.00128674,0.001916816,0.001533704,0.0008977776,0.01355364],"category_scores_gemma":[0.005886985,0.0006535184,0.0008475803,0.001064284,0.002809725,0.008176278,0.002331838,0.002393226,0.002221208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002445267,"about_ca_system_score_gemma":0.001994732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001599867,"about_ca_topic_score_gemma":0.00263962,"domain_scores_codex":[0.998293,0.0001909079,0.00007726695,0.0007290705,0.0003388182,0.0003709412],"domain_scores_gemma":[0.991867,0.005145926,0.0004322132,0.001329372,0.0006314563,0.0005941333],"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.001702101,0.0003459789,0.01184745,0.001185896,0.0001932752,0.0004591014,0.001077849,0.06150276,0.09328894,0.6792272,0.03180949,0.1173599],"study_design_scores_gemma":[0.0001399211,0.0002424382,0.004538438,0.0001302304,0.0001416796,0.0007551587,0.0003616252,0.1168958,0.0510656,0.786814,0.03880669,0.0001082895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5161353,0.001779369,0.274589,0.01011966,0.0004056177,0.0002110565,0.004073876,0.004190217,0.1884959],"genre_scores_gemma":[0.9303269,0.00104133,0.04574102,0.0008798938,0.0002629058,0.0002603921,0.001294594,0.0004040579,0.0197888],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01355364,"threshold_uncertainty_score":0.04534149,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4401922998","doi":"10.1137/23m1561105","title":"Cliques, Chromatic Number, and Independent Sets in the Semi-random Process","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Austrian Science Fund","keywords":"Mathematics; Chromatic scale; Combinatorics; Discrete mathematics; Random graph; Graph","authors":[{"name":"David Gamarnik","is_ca":false},{"name":"Mihyun Kang","is_ca":false},{"name":"Paweł Prałat","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03010766748283094,"gpt":0.3597117220717129,"spread":0.3296040545888819,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004016188,0.0009021501,0.001906958,0.003479725,0.0026651,0.004708122,0.002910719,0.00223731,0.00691962],"category_scores_gemma":[0.0170139,0.001007871,0.001398754,0.002541557,0.008034301,0.007034411,0.002477381,0.003124379,0.0003735214],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003802008,"about_ca_system_score_gemma":0.001766461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007461575,"about_ca_topic_score_gemma":0.00673201,"domain_scores_codex":[0.9983607,0.0006819186,0.00004569232,0.0003807441,0.0002956631,0.0002353434],"domain_scores_gemma":[0.9738172,0.0194105,0.002369362,0.001273751,0.001038895,0.002090399],"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.00007759694,0.00003570595,0.0008670358,0.00004285764,0.00002436049,0.00003496304,0.0001580987,0.01964562,0.0004025321,0.9758361,0.001075915,0.001799183],"study_design_scores_gemma":[0.00004569252,0.00001725761,0.000951954,0.00002036444,0.00001661338,0.00004920828,0.00006050765,0.1455105,0.0001284235,0.8524026,0.000766512,0.0000304338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6227123,0.002194173,0.3408294,0.006180624,0.0002533679,0.0001687163,0.00106403,0.0002415045,0.02635595],"genre_scores_gemma":[0.9688298,0.001032834,0.01965435,0.0003305297,0.000499625,0.0001760377,0.0004432914,0.00009628609,0.008937228],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007461575,"threshold_uncertainty_score":0.02758557,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400893749","doi":"10.1137/23m1587713","title":"Optimal Adjacency Labels for Subgraphs of Cartesian Products","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"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; Agence Nationale de la Recherche","keywords":"Adjacency list; Combinatorics; Mathematics; Cartesian product; Cartesian coordinate system; Discrete mathematics; Geometry","authors":[{"name":"Louis Esperet","is_ca":false},{"name":"Nathaniel Harms","is_ca":true},{"name":"Viktor Zamaraev","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02111613834027702,"gpt":0.2820577793294158,"spread":0.2609416409891388,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003979281,0.0008588446,0.001049247,0.0008062722,0.001052486,0.001622858,0.001228565,0.0008560629,0.0204429],"category_scores_gemma":[0.003326042,0.0006375001,0.0005423286,0.001184371,0.0007726714,0.00237809,0.00125076,0.001553742,0.002424441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001310626,"about_ca_system_score_gemma":0.00116421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002735795,"about_ca_topic_score_gemma":0.006882512,"domain_scores_codex":[0.9996111,0.0001036692,0.00001656225,0.0001262131,0.00007767046,0.00006479097],"domain_scores_gemma":[0.9983394,0.0008510959,0.0001013568,0.0003515679,0.0002028877,0.0001535598],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007217872,0.0005693342,0.001888984,0.0007007591,0.00007220244,0.0001406745,0.0005090059,0.149288,0.01862681,0.2601636,0.1022975,0.4650214],"study_design_scores_gemma":[0.0001279742,0.0001166864,0.001227452,0.00009464146,0.00006357491,0.00008978821,0.0003333837,0.3267194,0.007524055,0.6449662,0.01870826,0.00002846841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3479341,0.001501292,0.5745656,0.00416957,0.0007792668,0.0003369789,0.004656949,0.004351661,0.06170462],"genre_scores_gemma":[0.5575727,0.001057083,0.4021492,0.0005754416,0.000271962,0.0002487414,0.006079722,0.00217348,0.0298717],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0204429,"threshold_uncertainty_score":0.06838834,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4381382709","doi":"10.1137/22m150767x","title":"The Spectrum of Triangle-Free Graphs","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"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; Grantová Agentura České Republiky; Beckman Institute for Advanced Science and Technology, University of Illinois, Urbana-Champaign; Simons Foundation; National Science Foundation","keywords":"Combinatorics; Mathematics; Discrete mathematics; Vertex (graph theory); Bipartite graph; Conjecture; Triangle-free graph; Upper and lower bounds; Graph; Line graph; Graph power","authors":[{"name":"József Balogh","is_ca":false},{"name":"Felix Christian Clemen","is_ca":false},{"name":"Bernard Lidický","is_ca":false},{"name":"Sergey Norin","is_ca":true},{"name":"Jan Volec","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04292685767823912,"gpt":0.316427439417595,"spread":0.2735005817393559,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002102759,0.0003412539,0.0001893612,0.001422322,0.0006182003,0.0009802941,0.0005900869,0.0004447126,0.01228009],"category_scores_gemma":[0.001522933,0.0001641545,0.0002415186,0.0008030824,0.001072669,0.001449234,0.0009359738,0.0004925644,0.0008841737],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006316286,"about_ca_system_score_gemma":0.0002020129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001161091,"about_ca_topic_score_gemma":0.000714965,"domain_scores_codex":[0.9997435,0.00003440776,0.000008268012,0.00005882964,0.00009006647,0.00006492755],"domain_scores_gemma":[0.9993321,0.0002541225,0.00009823911,0.00006458168,0.0001087365,0.0001421189],"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.0000924452,0.00002586382,0.000949172,0.00008301447,0.000007818814,0.0001704799,0.0003524996,0.003093212,0.006439978,0.963492,0.0039969,0.02129662],"study_design_scores_gemma":[0.00002058904,0.00002988836,0.001411333,0.00002602721,0.000004720725,0.0002713315,0.000187091,0.03082533,0.002238075,0.9587591,0.006215025,0.00001139973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7878163,0.001161901,0.1118983,0.001497168,0.0002133096,0.00004986709,0.0008688177,0.0003215269,0.09617292],"genre_scores_gemma":[0.9834915,0.0004168689,0.006860522,0.0001461601,0.0001065249,0.0000383757,0.0004227689,0.00005961406,0.008457692],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01228009,"threshold_uncertainty_score":0.04108095,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2896348413","doi":"10.1137/18m1220856","title":"Higher Dimensional Lattice Walks: Connecting Combinatorial and Analytic Behavior","year":2019,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Lattice (music); Diagonal; Gravitational singularity; Combinatorics; Generating function; Enumeration; Boundary (topology); Function (biology); Rational function; Discrete mathematics; Pure mathematics; Mathematical analysis; Geometry; Physics","authors":[{"name":"Stephen Melczer","is_ca":false},{"name":"Mark C. Wilson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04752788008209991,"gpt":0.3384440532801255,"spread":0.2909161731980256,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000886686,0.0005954694,0.0006529149,0.003266007,0.001317314,0.003002101,0.001383339,0.001312426,0.003856235],"category_scores_gemma":[0.006690918,0.0003172362,0.0006598812,0.001961205,0.002863752,0.004326195,0.001481627,0.001614973,0.0004215592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001656673,"about_ca_system_score_gemma":0.0004545405,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001618405,"about_ca_topic_score_gemma":0.001623707,"domain_scores_codex":[0.9993916,0.0002055387,0.00002462783,0.00008475579,0.0001605683,0.0001328443],"domain_scores_gemma":[0.9970272,0.001383267,0.0004766304,0.0003101049,0.0003398547,0.0004629614],"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.00002365139,0.00004417894,0.001172475,0.00003705796,0.000005783108,0.0001139948,0.0001786623,0.007944345,0.0008434413,0.9854822,0.0004854183,0.003668805],"study_design_scores_gemma":[0.000009858463,0.00001713308,0.0005190816,0.00002451621,0.000004882258,0.0001731767,0.0001314214,0.09911289,0.0004573803,0.8982697,0.001261195,0.00001879369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8021941,0.001601241,0.1465302,0.001899277,0.0001080206,0.00004102453,0.0002933166,0.0003509799,0.04698185],"genre_scores_gemma":[0.9788722,0.0005833104,0.01526011,0.0001444037,0.0001144021,0.00005479973,0.0002518274,0.00006125543,0.004657762],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003856235,"threshold_uncertainty_score":0.01290041,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3014010934","doi":"10.1137/18m1224672","title":"Multitasking Capacity: Hardness Results and Improved Constructions","year":2020,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"United States - Israel Binational Science Foundation; Simons Foundation; National Science Foundation","keywords":"Combinatorics; Bipartite graph; Mathematics; Matching (statistics); Cardinality (data modeling); Upper and lower bounds; Discrete mathematics; Hardness of approximation; Complete bipartite graph; Approximation algorithm; Graph; Computer science","authors":[{"name":"Noga Alon","is_ca":false},{"name":"Jonathan D. Cohen","is_ca":false},{"name":"Thomas L. Griffiths","is_ca":false},{"name":"Pasin Manurangsi","is_ca":false},{"name":"Daniel Reichman","is_ca":false},{"name":"Igor Shinkar","is_ca":true},{"name":"Tal Wagner","is_ca":false},{"name":"Alexander Yu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04865152016433313,"gpt":0.2558573971456671,"spread":0.2072058769813339,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003657436,0.002042958,0.002503664,0.002056362,0.002001866,0.005376529,0.005933817,0.003140456,0.01107317],"category_scores_gemma":[0.02803835,0.00132486,0.003228063,0.003687774,0.003628363,0.01237941,0.007072865,0.006563926,0.001792099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00359489,"about_ca_system_score_gemma":0.002226032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002568723,"about_ca_topic_score_gemma":0.001585983,"domain_scores_codex":[0.994055,0.001599053,0.0002546883,0.001423618,0.001550793,0.001116866],"domain_scores_gemma":[0.9691738,0.02227279,0.001527674,0.004344974,0.0009342874,0.001746471],"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.001095167,0.0005563253,0.002802611,0.001066462,0.0002384304,0.0005340388,0.0009546495,0.3207535,0.006771373,0.5893121,0.02059795,0.05531741],"study_design_scores_gemma":[0.0001038022,0.00008800107,0.000510917,0.0000719154,0.00007322821,0.0002603959,0.0001514964,0.4679257,0.002513202,0.5227504,0.005495703,0.00005516344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1773161,0.002256964,0.748521,0.009263922,0.0003642682,0.0004404565,0.003141283,0.001900918,0.05679506],"genre_scores_gemma":[0.8714195,0.001415025,0.1114933,0.001221762,0.0007222216,0.000807667,0.00170389,0.0007522732,0.01046435],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01107317,"threshold_uncertainty_score":0.03704345,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400467622","doi":"10.1137/23m1591773","title":"Product Structure Extension of the Alon–Seymour–Thomas Theorem","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"Australian Research Council; Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada; Narodowe Centrum Nauki; Fonds De La Recherche Scientifique - FNRS; Australian Government; National Science Foundation","keywords":"Mathematics; Extension (predicate logic); Combinatorics; Product (mathematics); Discrete mathematics; Structured program theorem; Geometry; Computer science","authors":[{"name":"Marc Distel","is_ca":false},{"name":"Vida Dujmović","is_ca":true},{"name":"David Eppstein","is_ca":false},{"name":"Robert Hickingbotham","is_ca":false},{"name":"Gwenaël Joret","is_ca":false},{"name":"Piotr Micek","is_ca":false},{"name":"Pat Morin","is_ca":true},{"name":"Michał T. Seweryn","is_ca":false},{"name":"David R. Wood","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01963596640253596,"gpt":0.3005775145388873,"spread":0.2809415481363513,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003679121,0.0003887269,0.0005198449,0.0007058339,0.001047116,0.001029377,0.000936389,0.0006069885,0.01037282],"category_scores_gemma":[0.001732281,0.0004497971,0.0009802468,0.0005648392,0.001431626,0.00420225,0.001959619,0.00171136,0.001069452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005411843,"about_ca_system_score_gemma":0.0003613631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001365518,"about_ca_topic_score_gemma":0.001248359,"domain_scores_codex":[0.9996359,0.00003270159,0.00001484217,0.0001302538,0.00009954593,0.00008668643],"domain_scores_gemma":[0.9986058,0.0005017442,0.0001245874,0.000351231,0.0002381553,0.0001783844],"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.0001587408,0.00004987608,0.001374179,0.0001385511,0.00002581675,0.0003013535,0.0004569274,0.004026202,0.007780129,0.95978,0.004822826,0.02108529],"study_design_scores_gemma":[0.00006949509,0.0001703981,0.002230118,0.00002354421,0.00004499831,0.0009957553,0.0001823125,0.0223035,0.007126438,0.9369819,0.02983808,0.00003329181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.51188,0.001169178,0.33119,0.001571369,0.0002705781,0.0001163053,0.001042731,0.0008437764,0.1519161],"genre_scores_gemma":[0.9373149,0.0006438259,0.04132485,0.0004300544,0.0002347975,0.0001008652,0.0008308442,0.0002316052,0.01888832],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01037282,"threshold_uncertainty_score":0.03470051,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1965667139","doi":"10.1137/110847585","title":"A Local Strengthening of Reed's $\\omega$, $\\Delta$, $\\chi$ Conjecture for Quasi-line Graphs","year":2013,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Omega; Conjecture; Combinatorics; Mathematics; Line (geometry); Mathematical proof; Graph; Line graph; Discrete mathematics; Physics; Geometry","authors":[{"name":"Maria Chudnovsky","is_ca":false},{"name":"Andrew D. King","is_ca":true},{"name":"Matthieu Plumettaz","is_ca":false},{"name":"Paul Seymour","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03564674079192311,"gpt":0.3243638320159371,"spread":0.288717091224014,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002457952,0.001143835,0.001368105,0.0008076206,0.001927366,0.002428071,0.002863752,0.001590907,0.01649605],"category_scores_gemma":[0.01026272,0.001023053,0.001707468,0.001063581,0.003258049,0.01066649,0.004001203,0.006260595,0.002665101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001708641,"about_ca_system_score_gemma":0.001438841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002532769,"about_ca_topic_score_gemma":0.003317488,"domain_scores_codex":[0.9978862,0.0005679041,0.00008904649,0.0007942517,0.0003351643,0.0003272526],"domain_scores_gemma":[0.9884305,0.0061392,0.0007533671,0.003219662,0.0008654593,0.0005917227],"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.001902629,0.0005614156,0.009931533,0.001797734,0.0002113566,0.00102201,0.00232353,0.06713321,0.06204337,0.6739985,0.05030856,0.1287662],"study_design_scores_gemma":[0.0003090437,0.0005321828,0.004865034,0.0002255335,0.0002081477,0.001277306,0.0012788,0.2622177,0.03801037,0.6542385,0.03666041,0.0001768234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4172789,0.001166291,0.4959504,0.01494579,0.0005150872,0.000321848,0.001391275,0.004798236,0.063632],"genre_scores_gemma":[0.8808884,0.0007819036,0.09985067,0.00238802,0.0005042299,0.0003209965,0.001336099,0.0004958343,0.01343384],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01649605,"threshold_uncertainty_score":0.05518484,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4401922144","doi":"10.1137/23m1625342","title":"Off-Diagonal Commonality of Graphs via Entropy","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences; University of Victoria","keywords":"Mathematics; Combinatorics; Diagonal; Discrete mathematics; Entropy (arrow of time); Chordal graph; Graph; Geometry","authors":[{"name":"Natalie Behague","is_ca":false},{"name":"Natasha Morrison","is_ca":true},{"name":"Jonathan A. Noel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02840167449277752,"gpt":0.3151510392851999,"spread":0.2867493647924224,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007672321,0.0003677672,0.0004639136,0.001773502,0.0008396183,0.001392456,0.000749088,0.0005628823,0.003905348],"category_scores_gemma":[0.004724742,0.0002802682,0.0005225824,0.001131374,0.002286589,0.002501473,0.001974151,0.0007880785,0.0002220911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001576822,"about_ca_system_score_gemma":0.0005269352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001692805,"about_ca_topic_score_gemma":0.002252916,"domain_scores_codex":[0.9991832,0.0001981821,0.00003054913,0.0002322729,0.0002048752,0.0001509301],"domain_scores_gemma":[0.9965629,0.001593415,0.0006436048,0.0005003704,0.0002700316,0.0004295995],"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.0001358058,0.00006017558,0.004173525,0.00007801958,0.00003123396,0.0002232547,0.0004721298,0.03156314,0.009495299,0.9356478,0.001175437,0.016944],"study_design_scores_gemma":[0.00002758743,0.00009351543,0.005144818,0.00003123646,0.00002518751,0.0003039804,0.0002008778,0.2053136,0.004814149,0.7814238,0.002589914,0.00003124441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8401471,0.0002774544,0.142316,0.000430422,0.00002690752,0.00007315986,0.0004536381,0.0001935794,0.01608172],"genre_scores_gemma":[0.987269,0.0001382686,0.009701587,0.00004868713,0.00003480485,0.000051216,0.0002201314,0.00004000054,0.00249614],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003905348,"threshold_uncertainty_score":0.01306474,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4402011228","doi":"10.1137/21m1425736","title":"Rainbow Thresholds","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"National Science Foundation","keywords":"Rainbow; Mathematics; Combinatorics; Discrete mathematics; Physics; Optics","authors":[{"name":"Tolson Bell","is_ca":false},{"name":"Alan Frieze","is_ca":false},{"name":"Trent G. Marbach","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03558605946525564,"gpt":0.3326163717282182,"spread":0.2970303122629625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005821435,0.0005456671,0.0011046,0.002142369,0.00191627,0.003898661,0.001504857,0.002095211,0.0545877],"category_scores_gemma":[0.005312608,0.0005226476,0.0007793534,0.001062753,0.002071223,0.007222893,0.00372013,0.003799771,0.007188753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001391593,"about_ca_system_score_gemma":0.0009043929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006427967,"about_ca_topic_score_gemma":0.0007056722,"domain_scores_codex":[0.9990523,0.0001066057,0.00004469197,0.0002806476,0.0002751981,0.0002405511],"domain_scores_gemma":[0.9979061,0.0006169034,0.0001627418,0.0005502576,0.0003489823,0.0004150232],"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.00002363121,0.00001739552,0.0001290675,0.00002799756,0.000004804792,0.00003189695,0.00005658922,0.0002636591,0.0008716907,0.9885783,0.004938798,0.005056087],"study_design_scores_gemma":[0.00000903158,0.00000742082,0.0001710117,0.00001184387,0.000005384102,0.00009413779,0.00005182521,0.002113297,0.0006935095,0.9919219,0.004912837,0.000007743175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1523273,0.001445686,0.1475466,0.005139395,0.001435173,0.0001663266,0.001196173,0.002289103,0.6884543],"genre_scores_gemma":[0.8073962,0.0008889133,0.02196,0.00205701,0.000578939,0.0001873632,0.0009816381,0.001050073,0.1648998],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0545877,"threshold_uncertainty_score":0.182614,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969856863","doi":"10.1137/120898528","title":"On the Maximum Density of Graphs with Unique-Path Labelings","year":2013,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Edge-graceful labeling; Vertex (graph theory); Lemma (botany); Path graph; Path (computing); Graph labeling; Graph; Discrete mathematics; Induced path; Upper and lower bounds; Simple graph; Longest path problem; Graph power; Shortest path problem; Line graph; Computer science","authors":[{"name":"Abbas Mehrabian","is_ca":false},{"name":"Dieter Mitsche","is_ca":false},{"name":"Paweł Prałat","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01161458247781246,"gpt":0.2120082200075993,"spread":0.2003936375297868,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002647344,0.0008519206,0.001577264,0.00225064,0.001686896,0.002728572,0.002739032,0.001801157,0.00516465],"category_scores_gemma":[0.03044995,0.001494968,0.0007807022,0.001960975,0.003592568,0.006876342,0.00328349,0.001915841,0.0006854322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002310507,"about_ca_system_score_gemma":0.0006722602,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001569539,"about_ca_topic_score_gemma":0.001703316,"domain_scores_codex":[0.9980702,0.0008353993,0.00006550086,0.0004180924,0.0003342655,0.0002766152],"domain_scores_gemma":[0.9665859,0.02783015,0.001518141,0.001729335,0.001020229,0.001316277],"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.0004984345,0.0001514148,0.007781378,0.0005353034,0.00008195877,0.0003119103,0.0009237816,0.07077427,0.008349987,0.8720159,0.008093293,0.03048224],"study_design_scores_gemma":[0.00007855483,0.00009577419,0.003073971,0.00009965685,0.0000521576,0.0005951827,0.0002823892,0.2787012,0.003341826,0.709933,0.003700371,0.00004586085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5898058,0.003258615,0.3688424,0.00420713,0.0001062223,0.0001377292,0.001208393,0.0009881622,0.03144545],"genre_scores_gemma":[0.9429568,0.001536198,0.05094285,0.0003856908,0.0002050724,0.0002813581,0.0007124415,0.000260796,0.002718851],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00516465,"threshold_uncertainty_score":0.01727748,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2797568317","doi":"10.1137/18m1182255","title":"On a Generalization of Spikes","year":2019,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Marsden Fund; National Science Foundation","keywords":"Matroid; Partition (number theory); Generalization; Matroid partitioning; Graphic matroid; Integer (computer science); Property (philosophy)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.0186028006303082,"gpt":0.3010084478666883,"spread":0.2824056472363801,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006709951,0.0005393365,0.0008009074,0.0008646247,0.001871852,0.002560504,0.001585541,0.001357286,0.008792073],"category_scores_gemma":[0.004345137,0.0003537666,0.001687758,0.001649394,0.002351243,0.005823023,0.003551807,0.002470472,0.0008978675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001623925,"about_ca_system_score_gemma":0.0006898637,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002350975,"about_ca_topic_score_gemma":0.002149382,"domain_scores_codex":[0.998953,0.0001610583,0.00005417276,0.0003380971,0.0002804059,0.0002132551],"domain_scores_gemma":[0.9973809,0.0008047821,0.0003441615,0.0006957281,0.0003486024,0.000425691],"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.00007169755,0.00003049899,0.0007308255,0.00005698336,0.00001814239,0.0002190378,0.0002132982,0.01001932,0.003024068,0.971176,0.003409875,0.01103026],"study_design_scores_gemma":[0.00002424733,0.0000643886,0.0005489696,0.00002153224,0.0000170999,0.0004179062,0.0002260204,0.04571139,0.001800229,0.9335107,0.01763798,0.00001953461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4370598,0.001340542,0.4198401,0.00525541,0.0006125087,0.0001832027,0.001115051,0.0009324201,0.133661],"genre_scores_gemma":[0.9018126,0.000880809,0.06852122,0.001609834,0.0006419359,0.0001747501,0.000795057,0.0003581178,0.02520571],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008792073,"threshold_uncertainty_score":0.02941239,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4408874684","doi":"10.1137/24m1647692","title":"Dyadic Packing of Dijoins","year":2025,"lang":"es","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Packing problems; Discrete mathematics","authors":[{"name":"Bertrand Guenin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01175268312992277,"gpt":0.2671095122186709,"spread":0.2553568290887481,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000465876,0.0008098597,0.001754391,0.001874901,0.002099875,0.003912232,0.001436316,0.001489959,0.02014484],"category_scores_gemma":[0.003617458,0.0008133182,0.0006654118,0.00389985,0.001083005,0.002892138,0.00306942,0.001944162,0.002908635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001125085,"about_ca_system_score_gemma":0.000636587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003312844,"about_ca_topic_score_gemma":0.00388124,"domain_scores_codex":[0.9989531,0.0001830325,0.00007809073,0.0002369823,0.0002538708,0.000294828],"domain_scores_gemma":[0.9980003,0.000591105,0.0002034135,0.000416641,0.0003668643,0.000421629],"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.001119585,0.0004210176,0.003775516,0.0004822391,0.00009193892,0.001352861,0.0006441983,0.08491494,0.01058495,0.7739525,0.02874697,0.09391334],"study_design_scores_gemma":[0.00009097001,0.0002260922,0.002615311,0.0001461761,0.00006496066,0.0011428,0.001411603,0.4325077,0.007142164,0.5025989,0.05197136,0.00008183511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4909007,0.00187486,0.3542295,0.001092688,0.0009101058,0.0001784297,0.002095743,0.0008434468,0.1478745],"genre_scores_gemma":[0.8203163,0.001239428,0.1098882,0.0003486229,0.0001995931,0.0001624544,0.002966181,0.0006544962,0.06422484],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02014484,"threshold_uncertainty_score":0.06739122,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2886010892","doi":"10.1137/20m1356968","title":"When Do Gomory--Hu Subtrees Exist?","year":2022,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Combinatorics; Computer science; Mathematics","authors":[{"name":"Guyslain Naves","is_ca":false},{"name":"F. Bruce Shepherd","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04253123021233643,"gpt":0.2935675574971187,"spread":0.2510363272847822,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000609311,0.0003525077,0.0008957044,0.0005963169,0.001594032,0.00197986,0.000904056,0.001568734,0.01078229],"category_scores_gemma":[0.006962602,0.0004952803,0.0005838906,0.0008892252,0.001252287,0.005595781,0.001512834,0.00134887,0.001793013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008619419,"about_ca_system_score_gemma":0.0005386457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001135765,"about_ca_topic_score_gemma":0.002408825,"domain_scores_codex":[0.9993636,0.00006777306,0.00002779651,0.00019515,0.00008216142,0.0002635793],"domain_scores_gemma":[0.9979106,0.0007857715,0.0003374168,0.0003593898,0.0002131329,0.0003936516],"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.000656397,0.0001759734,0.01704896,0.000343703,0.00006612162,0.00187279,0.002023977,0.006893446,0.009596687,0.8154349,0.02029072,0.1255963],"study_design_scores_gemma":[0.0001089496,0.0001758069,0.009066137,0.0002151424,0.00009211258,0.002804809,0.004163781,0.02934136,0.007795706,0.8689938,0.07717389,0.00006854031],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.776328,0.0020515,0.143143,0.005136423,0.00029234,0.0002251123,0.002417429,0.001021276,0.06938487],"genre_scores_gemma":[0.9488608,0.0004090949,0.04036804,0.0007743028,0.0000841791,0.00008510294,0.001795519,0.000270734,0.007352267],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01078229,"threshold_uncertainty_score":0.03607041,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3195869111","doi":"10.1137/19m1296069","title":"Hamiltonicity of Random Graphs in the Stochastic Block Model","year":2021,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"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","keywords":"Mathematics; Combinatorics; Random graph; Discrete mathematics; Partition (number theory); Graph; Stochastic block model; Statistics","authors":[{"name":"Michael Anastos","is_ca":true},{"name":"Alan Frieze","is_ca":true},{"name":"Pu Gao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.041733432782127,"gpt":0.3138007515288425,"spread":0.2720673187467155,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001475966,0.0007256403,0.001230572,0.001078802,0.0006999059,0.001234987,0.001890223,0.001296823,0.004570129],"category_scores_gemma":[0.006661068,0.0006542432,0.0007754911,0.0007484982,0.001825855,0.002590289,0.001225316,0.001477782,0.0005116725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001701065,"about_ca_system_score_gemma":0.001065474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007846433,"about_ca_topic_score_gemma":0.00775582,"domain_scores_codex":[0.9991767,0.0003511782,0.00002364045,0.0001499488,0.0001115121,0.0001871518],"domain_scores_gemma":[0.9943638,0.003575154,0.0008863469,0.0003304846,0.0003082724,0.0005359293],"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.0001962704,0.00007570715,0.001497222,0.0001052892,0.00007271172,0.0004023143,0.0002763648,0.170236,0.004062652,0.8160875,0.00381667,0.003171314],"study_design_scores_gemma":[0.00006134476,0.00004588166,0.0004580036,0.00001483638,0.00002209201,0.00005480951,0.00005322462,0.7327221,0.0004486784,0.2652118,0.0008811521,0.00002604665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5329057,0.0009697633,0.4461624,0.002626488,0.00009639363,0.0001789815,0.0007929695,0.0004092795,0.01585815],"genre_scores_gemma":[0.9758968,0.0006643569,0.01407296,0.0002851106,0.00008431968,0.0001852039,0.0003421416,0.0001061068,0.008363],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007846433,"threshold_uncertainty_score":0.01560158,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3091567360","doi":"10.1137/20m1380314","title":"A Complete Multipartite Basis for the Chromatic Symmetric Function","year":2021,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"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","keywords":"Symmetric function; Combinatorics; Mathematics; Multipartite; Chromatic scale; Basis (linear algebra); Monomial; Stanley symmetric function; Lambda; Disjoint sets; Discrete mathematics; Ring of symmetric functions; Graph; Physics","authors":[{"name":"Logan Crew","is_ca":true},{"name":"Sophie Spirkl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08086964179098748,"gpt":0.3354876833294389,"spread":0.2546180415384514,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004272136,0.0004756466,0.0004160917,0.001581922,0.0009856551,0.001665111,0.0007279807,0.0005394619,0.005565215],"category_scores_gemma":[0.0009730365,0.0002353801,0.0005476145,0.00101706,0.001633298,0.001546961,0.0008869818,0.001470327,0.001528151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009195856,"about_ca_system_score_gemma":0.0008044979,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001649025,"about_ca_topic_score_gemma":0.001607502,"domain_scores_codex":[0.9996814,0.0000676155,0.000008288497,0.00005034494,0.000103139,0.00008928779],"domain_scores_gemma":[0.9996463,0.00007559193,0.00002893395,0.00007275348,0.0001146519,0.00006175609],"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.00001322202,0.00001099172,0.00009271444,0.00001071751,0.00000177997,0.00002026403,0.00005320406,0.001634374,0.001893948,0.9908607,0.0008341344,0.004573912],"study_design_scores_gemma":[0.00001331203,0.00003131534,0.0004982032,0.00002643956,0.00000769391,0.0001114603,0.0001175271,0.05961026,0.003900546,0.9265229,0.009126682,0.00003362921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5239374,0.0006592175,0.3551331,0.0008055247,0.0002643433,0.00008784614,0.0007228187,0.0002564715,0.1181333],"genre_scores_gemma":[0.9284879,0.0004947316,0.04186051,0.0002271833,0.0001872396,0.0001197913,0.0006059521,0.0002048876,0.02781164],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005565215,"threshold_uncertainty_score":0.01861751,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2592462466","doi":"10.1137/17m1144805","title":"Lollipop and Lariat Symmetric Functions","year":2018,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Symmetric function; Chromatic scale; Mathematics; Graph; Combinatorics; Ring of symmetric functions; Stanley symmetric function; Discrete mathematics; Pure mathematics; Orthogonal polynomials","authors":[{"name":"Samantha Dahlberg","is_ca":false},{"name":"Stephanie van Willigenburg","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04853382306923126,"gpt":0.3299887152324487,"spread":0.2814548921632175,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005744537,0.0005972767,0.0003788984,0.001626394,0.001192196,0.00219869,0.001140284,0.0006727822,0.01280343],"category_scores_gemma":[0.002057418,0.0002161262,0.0005609385,0.0007989187,0.002446587,0.004035407,0.001333191,0.001657414,0.002115766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001618523,"about_ca_system_score_gemma":0.000708212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001732823,"about_ca_topic_score_gemma":0.002480538,"domain_scores_codex":[0.99965,0.00006163329,0.00001172916,0.00006502166,0.0000924636,0.0001192404],"domain_scores_gemma":[0.9993234,0.0002341197,0.00007526034,0.00008731319,0.0001679374,0.0001119837],"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.00002659972,0.00001883079,0.0004260653,0.00002778141,0.000002524014,0.00007088564,0.000145108,0.001259984,0.001120292,0.9897918,0.001460406,0.0056497],"study_design_scores_gemma":[0.0000126456,0.00002018504,0.0004319251,0.00002581026,0.000009064955,0.0001070534,0.000225616,0.02067081,0.004724935,0.9678357,0.005909321,0.00002692146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5331172,0.0004071087,0.264669,0.001891434,0.0002254409,0.0001115645,0.000719058,0.0005261664,0.198333],"genre_scores_gemma":[0.9506742,0.0001971836,0.02658669,0.0002852695,0.00009552026,0.00009580499,0.0002934622,0.0001990986,0.02157276],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01280343,"threshold_uncertainty_score":0.04283178,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3176383582","doi":"10.1137/21m1450082","title":"A Spectral Moore Bound for Bipartite Semiregular Graphs","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Upper and lower bounds; Discrete mathematics; Graph","authors":[{"name":"Sabrina Lato","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05080937930989123,"gpt":0.3374562849573426,"spread":0.2866469056474514,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001329528,0.0008487287,0.0009411509,0.001999213,0.001141744,0.00198934,0.001961638,0.001160485,0.01365806],"category_scores_gemma":[0.008520398,0.0005548162,0.000745804,0.001709699,0.002039479,0.00483345,0.002527481,0.001988889,0.002688259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001628434,"about_ca_system_score_gemma":0.0005868067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00106099,"about_ca_topic_score_gemma":0.001701024,"domain_scores_codex":[0.9985353,0.0002996804,0.00006868062,0.000369074,0.0004667691,0.0002605221],"domain_scores_gemma":[0.9921697,0.004548437,0.0006374427,0.001051262,0.0008246251,0.0007686284],"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.0003002295,0.0001069412,0.001227711,0.000219897,0.00004083352,0.0001458227,0.000269573,0.03729193,0.01123227,0.9118386,0.008170798,0.0291553],"study_design_scores_gemma":[0.0000212851,0.00006941029,0.0008755078,0.00006380292,0.00002310938,0.0001937507,0.0001309331,0.1862023,0.005813592,0.7988391,0.007716139,0.00005093706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2031596,0.002015442,0.7025218,0.002457891,0.0002702872,0.0000785072,0.001281773,0.001663,0.08655167],"genre_scores_gemma":[0.8871551,0.001234556,0.09624407,0.001153132,0.0003869708,0.000222496,0.0007950543,0.0004445189,0.01236419],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01365806,"threshold_uncertainty_score":0.04569072,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4386848811","doi":"10.1137/22m1534195","title":"Extremal Bounds for 3-Neighbor Bootstrap Percolation in Dimensions Two and Three","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of Victoria","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Cardinality (data modeling); Grid; k-nearest neighbors algorithm; Graph; Percolation (cognitive psychology); Discrete mathematics; Set (abstract data type); Computer science","authors":[{"name":"Peter J. Dukes","is_ca":true},{"name":"Jonathan A. Noel","is_ca":true},{"name":"Abel E. Romer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1075846876101875,"gpt":0.3861414268246157,"spread":0.2785567392144281,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003732499,0.001439194,0.002114617,0.004364837,0.002720892,0.004382276,0.003671689,0.002338327,0.006285334],"category_scores_gemma":[0.02382186,0.0008319201,0.001410391,0.002170872,0.00471247,0.006119906,0.005445546,0.004427699,0.0007185914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002356771,"about_ca_system_score_gemma":0.0006768603,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000887643,"about_ca_topic_score_gemma":0.001273631,"domain_scores_codex":[0.9979328,0.0006367687,0.00008288828,0.000274112,0.0005366202,0.0005367845],"domain_scores_gemma":[0.9763949,0.01670845,0.001882767,0.001995385,0.001175211,0.001843257],"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.0001715471,0.0000553317,0.001114534,0.0001826588,0.00004995142,0.00014734,0.0002532092,0.01783326,0.0009671916,0.969231,0.005286966,0.004706995],"study_design_scores_gemma":[0.0000218616,0.00002129638,0.0009058831,0.0001487075,0.00002927891,0.0001458504,0.0001133594,0.1095149,0.0005701959,0.886003,0.00248101,0.00004463803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3435935,0.01403745,0.416197,0.0102672,0.0009154721,0.0001563937,0.001803108,0.001112038,0.2119179],"genre_scores_gemma":[0.9565141,0.001854637,0.03605935,0.0008198477,0.0006459951,0.000207646,0.0005100683,0.0002538103,0.003134665],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006285334,"threshold_uncertainty_score":0.02102655,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4403257040","doi":"10.1137/24m1640859","title":"Kissing Polytopes","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation; Deutsche Forschungsgemeinschaft; Technion-Israel Institute of Technology; National Science Foundation","keywords":"Polytope; Mathematics; Combinatorics; Discrete mathematics","authors":[{"name":"Antoine Deza","is_ca":true},{"name":"Shmuel Onn","is_ca":false},{"name":"Sebastian Pokutta","is_ca":false},{"name":"Lionel Pournin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04336039856165239,"gpt":0.3579043796522653,"spread":0.314543981090613,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002701622,0.000813931,0.001205405,0.001882753,0.002363245,0.003818143,0.0009753318,0.001524595,0.03274298],"category_scores_gemma":[0.001977912,0.0006761582,0.0008871572,0.001273872,0.00187303,0.003277935,0.003017562,0.004048205,0.004108103],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007905275,"about_ca_system_score_gemma":0.0004194433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006378706,"about_ca_topic_score_gemma":0.000721505,"domain_scores_codex":[0.9995945,0.00004505069,0.00002153753,0.0001097506,0.0001305015,0.00009871171],"domain_scores_gemma":[0.9988482,0.0004386567,0.0001545838,0.0001138577,0.0001431547,0.000301586],"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.0000459023,0.00003833745,0.0002916505,0.00006038545,0.0000160078,0.0001658703,0.0001683789,0.002979889,0.001516057,0.9816326,0.004426968,0.008658003],"study_design_scores_gemma":[0.00002726933,0.00004122698,0.0005205938,0.00003522345,0.00001855996,0.0004618161,0.0003056166,0.01483468,0.001537142,0.9668577,0.01533507,0.00002506892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.517168,0.0008017516,0.1360247,0.002072418,0.0006535935,0.0001307254,0.001227842,0.0005609358,0.3413601],"genre_scores_gemma":[0.8435575,0.0009805376,0.03199949,0.0005089144,0.0003299852,0.0001646981,0.001662669,0.0006468868,0.1201493],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03274298,"threshold_uncertainty_score":0.1095362,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4283011735","doi":"10.1137/21m1417077","title":"Robust Connectivity of Graphs on Surfaces","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"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; Uniwersytet Warszawski","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Lambda; Discrete mathematics; Degeneracy (biology); Dominating set; Tree (set theory); Arboricity; Spanning tree; Invariant (physics); Graph; Planar graph","authors":[{"name":"Peter Bradshaw","is_ca":true},{"name":"Tomáš Masařík","is_ca":false},{"name":"Jana Novotná","is_ca":true},{"name":"Ladislav Stacho","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04604837284947536,"gpt":0.2979433993994719,"spread":0.2518950265499965,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003083478,0.0005369339,0.0005930258,0.002618301,0.0007567176,0.001658436,0.00100474,0.0009498743,0.006317046],"category_scores_gemma":[0.002984995,0.0003323266,0.0006103049,0.00130676,0.002061929,0.00252869,0.001665632,0.0009541016,0.0007417568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009155217,"about_ca_system_score_gemma":0.0002672496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001687768,"about_ca_topic_score_gemma":0.001005095,"domain_scores_codex":[0.9993715,0.00009553407,0.00002928598,0.0001839328,0.0002200172,0.00009968744],"domain_scores_gemma":[0.9987406,0.0004233475,0.0003239828,0.0001897796,0.0001863984,0.0001358849],"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.0001584675,0.00004025702,0.001836718,0.0002151596,0.00004309969,0.0004362756,0.0006236309,0.07748054,0.01200909,0.8572503,0.005269303,0.04463712],"study_design_scores_gemma":[0.0000339372,0.00006824492,0.003584151,0.00006390336,0.0000302253,0.0005335638,0.0003796944,0.1402927,0.003163052,0.8312456,0.0205584,0.00004650567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5762157,0.002000215,0.3395203,0.001316139,0.0001862063,0.0001793111,0.001738326,0.001474004,0.07736979],"genre_scores_gemma":[0.9572312,0.0007382904,0.03202731,0.0002257743,0.0001272198,0.0001686864,0.001449779,0.0002887433,0.007743072],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006317046,"threshold_uncertainty_score":0.02113265,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3026391377","doi":"10.1137/20m1367672","title":"The Uniformity Conjecture in Additive Combinatorics","year":2021,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Hungarian Scientific Research Fund; Natural Sciences and Engineering Research Council of Canada; Ministry of Education and Science of the Russian Federation","keywords":"Conjecture; Cardinality (data modeling); Combinatorics; Mathematics; Product (mathematics); Discrete mathematics; Computer science","authors":[{"name":"Ilya D. Shkredov","is_ca":false},{"name":"József Solymosi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02487217775426493,"gpt":0.3041367521464307,"spread":0.2792645743921658,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002637416,0.0006203245,0.0009925308,0.001256255,0.002074664,0.003024105,0.001690568,0.00140713,0.005922622],"category_scores_gemma":[0.01301255,0.0005638452,0.0009316964,0.002018235,0.004203349,0.01187867,0.004515707,0.002626305,0.001021435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001108703,"about_ca_system_score_gemma":0.0004619624,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008736174,"about_ca_topic_score_gemma":0.0005521023,"domain_scores_codex":[0.9968637,0.0008367948,0.0001914249,0.0008110115,0.0008844748,0.0004125388],"domain_scores_gemma":[0.9920108,0.005343858,0.0003666024,0.001411685,0.0005552507,0.0003118936],"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.0001014589,0.00002330652,0.00117965,0.0001007876,0.00001149826,0.0001405588,0.0002505859,0.002376788,0.0008265079,0.9780164,0.002197132,0.01477538],"study_design_scores_gemma":[0.00001974103,0.00003417241,0.0007254171,0.0000524245,0.00002326396,0.0003618157,0.0001414578,0.009071075,0.002580725,0.9731789,0.01378993,0.00002098145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3621414,0.005751598,0.4771728,0.01119846,0.0008215901,0.00008802911,0.0007420997,0.001321623,0.1407624],"genre_scores_gemma":[0.9515263,0.001866189,0.03056603,0.0010464,0.001065338,0.0001148885,0.0004540443,0.0001759343,0.013185],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005922622,"threshold_uncertainty_score":0.01981312,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053642853","doi":"10.1137/130929229","title":"Homological Face-Width Condition Forcing $K_6$-Minors in Graphs on Surfaces","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"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; Simon Fraser University","keywords":"Mathematics; Combinatorics; Projective plane; Face (sociological concept); Graph; Minor (academic); Discrete mathematics; Surface (topology); Plane (geometry); Geometry","authors":[{"name":"Roi Krakovski","is_ca":true},{"name":"Bojan Mohar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0269461334175931,"gpt":0.3094823273796334,"spread":0.2825361939620403,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004826562,0.0004678328,0.0006463102,0.0009091647,0.001181087,0.001662243,0.0009049269,0.0009062605,0.005915963],"category_scores_gemma":[0.002620926,0.0004510307,0.0009591897,0.0004239947,0.001867659,0.002428783,0.002512272,0.001768787,0.0006354589],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007353868,"about_ca_system_score_gemma":0.0003262105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007758737,"about_ca_topic_score_gemma":0.0008871153,"domain_scores_codex":[0.9994709,0.00007894891,0.00003313914,0.0001331682,0.0001323953,0.000151546],"domain_scores_gemma":[0.9981108,0.0008390174,0.0002080015,0.0002754936,0.0002268982,0.0003397795],"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.000567223,0.000122941,0.004676041,0.0002104084,0.00004968336,0.001032995,0.00156516,0.009498205,0.04506034,0.913047,0.003450359,0.02071964],"study_design_scores_gemma":[0.00007113416,0.0001654638,0.003416041,0.00002721877,0.00003787467,0.000759955,0.0008753596,0.02074927,0.01836417,0.9481677,0.007304901,0.00006105015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9498968,0.0001601103,0.03011572,0.0004890449,0.00008997713,0.00002588634,0.0001441546,0.000308709,0.01876953],"genre_scores_gemma":[0.9871867,0.00009956276,0.008234305,0.0001128183,0.00009012297,0.00003079896,0.0002629842,0.0001082941,0.00387428],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005915963,"threshold_uncertainty_score":0.01979089,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3014978470","doi":"10.1137/20m1370744","title":"Dense Induced Subgraphs of Dense Bipartite Graphs","year":2021,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Bipartite graph; Conjecture; Combinatorics; Mathematics; Degree (music); Graph; Induced subgraph; Girth (graph theory); Discrete mathematics; Vertex (graph theory); Physics","authors":[{"name":"Rose McCarty","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05106553509882367,"gpt":0.3211682898076904,"spread":0.2701027547088667,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003778185,0.000339759,0.0003251958,0.0007399773,0.0005678323,0.0007357898,0.0007363264,0.000397857,0.002836276],"category_scores_gemma":[0.003248544,0.0004679022,0.0004005798,0.0007865004,0.0008793175,0.001478118,0.001400374,0.0009273775,0.0003580734],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006767897,"about_ca_system_score_gemma":0.000320965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001116089,"about_ca_topic_score_gemma":0.001911699,"domain_scores_codex":[0.9995647,0.0001079941,0.00001784249,0.00009642503,0.0001104449,0.0001025761],"domain_scores_gemma":[0.9968592,0.001647025,0.0004320671,0.0004239332,0.0003040244,0.0003337275],"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.0002450974,0.0001864711,0.008590824,0.0003320214,0.00007215203,0.0009414003,0.0009144095,0.03369879,0.03246741,0.8787618,0.008236674,0.03555289],"study_design_scores_gemma":[0.00006483417,0.00008412246,0.004613093,0.00004371643,0.00004991312,0.0007678039,0.0002831666,0.1828479,0.01139141,0.7915851,0.008250059,0.0000189261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8101275,0.0003420035,0.1636463,0.0006481476,0.00003931525,0.00006533338,0.0007644157,0.0004558325,0.02391118],"genre_scores_gemma":[0.9766133,0.0002640784,0.01897023,0.000145943,0.00004269852,0.00007020581,0.0007775082,0.00006108213,0.003054929],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002836276,"threshold_uncertainty_score":0.009488344,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3001604198","doi":"10.1137/20m1320730","title":"Counting Linear Extensions of Posets with Determinants of Hook Lengths","year":2021,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"International Max Planck Research School for Advanced Methods in Process and Systems Engineering; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; National Science Foundation","keywords":"Mathematics; Combinatorics; Skew; Hook; Ribbon; Star product; Descent (aeronautics); Class (philosophy); Discrete mathematics; Geometry; Computer science; Physics","authors":[{"name":"Alexander Garver","is_ca":false},{"name":"Stefan N. Grösser","is_ca":false},{"name":"Jacob P. Matherne","is_ca":false},{"name":"Alejandro H. Morales","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04490005041821215,"gpt":0.3455230302338493,"spread":0.3006229798156371,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008627052,0.0006138175,0.000653923,0.002452796,0.00100336,0.002365837,0.0008424818,0.0006606697,0.004555298],"category_scores_gemma":[0.005926387,0.0003862946,0.0006452927,0.001926204,0.002178925,0.00571923,0.001991592,0.0009611735,0.0004577381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007380659,"about_ca_system_score_gemma":0.000392334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003265183,"about_ca_topic_score_gemma":0.0004556454,"domain_scores_codex":[0.999025,0.0001716645,0.00007344755,0.000269714,0.0002732454,0.0001869463],"domain_scores_gemma":[0.9958038,0.002057498,0.0007412838,0.000339998,0.0004515007,0.0006059878],"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.000146773,0.00007723366,0.01092712,0.00009692668,0.00002258205,0.0003883236,0.0006625907,0.007588342,0.007622506,0.9395658,0.001515273,0.03138643],"study_design_scores_gemma":[0.00002571335,0.0001109303,0.005156199,0.00004855592,0.00003277903,0.001175759,0.0003907508,0.04026353,0.005880814,0.9403455,0.006505456,0.0000639218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8180329,0.0005131279,0.1573808,0.0003648544,0.00007556322,0.00006411848,0.0004484415,0.0002235839,0.0228965],"genre_scores_gemma":[0.9731365,0.0003039258,0.02142085,0.00007379855,0.0001296697,0.0000963015,0.0004294192,0.00005362532,0.00435592],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004555298,"threshold_uncertainty_score":0.01523894,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2903896173","doi":"10.1137/18m1214196","title":"Corrigendum: Orthogonal Tree Decompositions of Graphs","year":2018,"lang":"en","type":"erratum","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Australian Research Council; Fédération Wallonie-Bruxelles","keywords":"Mathematics; Combinatorics; Tree (set theory); Discrete mathematics","authors":[{"name":"Vida Dujmović","is_ca":false},{"name":"Gwenaël Joret","is_ca":false},{"name":"Pat Morin","is_ca":true},{"name":"Sergey Norin","is_ca":true},{"name":"David R. Wood","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03365558894771017,"gpt":0.3176513302921984,"spread":0.2839957413444883,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003188216,0.002131043,0.002120636,0.005046939,0.003015454,0.003974561,0.003516436,0.003082106,0.08969412],"category_scores_gemma":[0.04620136,0.001010779,0.00219319,0.003905083,0.002141324,0.004985083,0.002493897,0.005901668,0.04384653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005423889,"about_ca_system_score_gemma":0.00292516,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01152814,"about_ca_topic_score_gemma":0.01303197,"domain_scores_codex":[0.9936112,0.001064093,0.0006644373,0.0011032,0.00308011,0.0004769501],"domain_scores_gemma":[0.9751389,0.004750761,0.0006525226,0.002330139,0.01609077,0.001036969],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002148445,0.00001047425,0.00005090301,0.0001126228,0.00001163044,0.00008112099,0.00001633866,0.00010294,0.00005346952,0.003210191,0.9862954,0.01003342],"study_design_scores_gemma":[0.00003300052,0.00004249443,0.0009578126,0.0003148867,0.00004797995,0.0004174242,0.00005121843,0.0008414017,0.000485347,0.01364111,0.9830973,0.00007007243],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"other","genre_scores_codex":[0.0004252369,0.004531445,0.005383927,0.05252749,0.9141685,0.00006282167,0.00160464,0.001037132,0.02025873],"genre_scores_gemma":[0.03156897,0.02430817,0.01811698,0.09218615,0.4480877,0.0004505258,0.008224246,0.004714345,0.3723429],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.08969412,"threshold_uncertainty_score":0.3000567,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3193900015","doi":"10.1137/22m1511801","title":"The Typical Approximate Structure of Sets with Bounded Sumset","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"European Social Fund; Agencia Estatal de Investigación; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Ministerio de Economía y Competitividad; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Mathematics; Abelian group; Hypergraph; Combinatorics; Bounded function; Discrete mathematics; Structured program theorem","authors":[{"name":"Marcelo Campos","is_ca":false},{"name":"Matthew Coulson","is_ca":true},{"name":"Oriol Serra","is_ca":false},{"name":"Maximilian Wötzel","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02510234087633091,"gpt":0.3033898950029553,"spread":0.2782875541266244,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001385121,0.000307854,0.0009771693,0.001563752,0.001333244,0.003320582,0.001582759,0.0008971615,0.003636142],"category_scores_gemma":[0.01528026,0.0005908289,0.0005524028,0.00161862,0.002557537,0.005262203,0.002561306,0.001083925,0.0003445297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001543551,"about_ca_system_score_gemma":0.0006473477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006459801,"about_ca_topic_score_gemma":0.0005692065,"domain_scores_codex":[0.9985745,0.000329879,0.00008791535,0.0003498179,0.0004780516,0.0001797454],"domain_scores_gemma":[0.9915953,0.00442735,0.001212007,0.00147647,0.000720261,0.0005686104],"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.0005855551,0.00006715961,0.008563541,0.0001614033,0.00005238743,0.0003971161,0.0008174626,0.03273873,0.009053135,0.9305358,0.001543935,0.01548378],"study_design_scores_gemma":[0.00006128679,0.0001455645,0.003540275,0.00006441245,0.00005851268,0.001023598,0.0005207,0.2338521,0.009548999,0.7471065,0.004010921,0.00006724076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8666999,0.0003215765,0.1249409,0.0006108762,0.00002590315,0.00003228616,0.0005048113,0.0002793302,0.006584424],"genre_scores_gemma":[0.9822109,0.0001334772,0.01511798,0.0000805435,0.00003455303,0.00007840073,0.0003797609,0.00004901123,0.001915309],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003636142,"threshold_uncertainty_score":0.01216412,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}