{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":207,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":207,"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":"b510aeb975b9","filters":{"venue":"Society for Industrial and Applied Mathematics eBooks"}},"results":[{"id":"W4285053132","doi":"10.1137/1.9781611974713","title":"Linear Stochastic Systems","year":2018,"lang":"it","type":"book","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Financial Risk and Volatility Modeling","field":"Economics, Econometrics and Finance","cited_by":169,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science","authors":[{"name":"Peter E. Caines","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1019803248335425,"gpt":0.2444394479084608,"spread":0.1424591230749183,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004628117,0.001195282,0.0007424842,0.0006583206,0.0003260243,0.001765589,0.0004978988,0.0009559463,0.0235092],"category_scores_gemma":[0.001740289,0.0003374411,0.0005973667,0.001247531,0.0008515173,0.001784892,0.001029125,0.001666138,0.009790184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006274813,"about_ca_system_score_gemma":0.000687974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001158268,"about_ca_topic_score_gemma":0.001053549,"domain_scores_codex":[0.9995121,0.0001270105,0.0000362004,0.0001028753,0.0001906308,0.00003113452],"domain_scores_gemma":[0.9994327,0.0003075772,0.00004749888,0.00005961957,0.0001325187,0.00002003889],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002467541,0.00003370545,0.0004343953,0.0006599682,0.00008409876,0.0001779139,0.000169895,0.06044269,0.001723684,0.6458084,0.1137956,0.1766449],"study_design_scores_gemma":[0.00001917036,0.00006139398,0.0004599707,0.0001756169,0.0000271908,0.000390717,0.00005850455,0.1092372,0.0006751473,0.5709477,0.3179071,0.00004025548],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005932814,0.06770479,0.7306463,0.006324688,0.004918067,0.0001299933,0.002343565,0.002452627,0.1795471],"genre_scores_gemma":[0.3110259,0.0960939,0.1492167,0.003228087,0.01033606,0.0007259114,0.004973906,0.0008210222,0.4235786],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0235092,"threshold_uncertainty_score":0.07864612,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2902415114","doi":"10.1137/1.9781611975673.66","title":"LSCP: Locally Selective Combination in Parallel Outlier Ensembles","year":2019,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":139,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"PricewaterhouseCoopers (Canada); University of Toronto","funders":"","keywords":"Outlier; Linear subspace; Anomaly detection; Computer science; Base (topology); Task (project management); Stability (learning theory); Artificial intelligence; Pattern recognition (psychology); Data mining; Local outlier factor; Feature (linguistics); Machine learning; Mathematics; Engineering","authors":[{"name":"Yue Zhao","is_ca":true},{"name":"Zain Nasrullah","is_ca":true},{"name":"Maciej K. Hryniewicki","is_ca":true},{"name":"Zheng Li","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0393636122034942,"gpt":0.2402044409217747,"spread":0.2008408287182805,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004873444,0.002761913,0.002758568,0.002103789,0.001175103,0.001875282,0.004352903,0.001914011,0.00168129],"category_scores_gemma":[0.008011922,0.00102353,0.002003114,0.002201948,0.001368023,0.003380858,0.005764047,0.002728437,0.001202125],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008600906,"about_ca_system_score_gemma":0.002038474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005563144,"about_ca_topic_score_gemma":0.01022456,"domain_scores_codex":[0.9962872,0.0009282609,0.000170588,0.001122155,0.001126035,0.0003658031],"domain_scores_gemma":[0.9963925,0.0009065592,0.0003470141,0.001039893,0.001039381,0.0002744443],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004059526,0.0004375234,0.01283713,0.0001395399,0.000732664,0.0002618114,0.0002779705,0.4334991,0.01056653,0.004347633,0.008944556,0.5275496],"study_design_scores_gemma":[0.00001811073,0.0001528713,0.00095958,0.000008925977,0.00006872121,0.0001275425,0.00005995799,0.9886347,0.003531327,0.004817613,0.001590413,0.00003016171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03421497,0.0005034585,0.9594409,0.0001781644,0.0000854759,0.0002081484,0.0002229363,0.003732364,0.001413659],"genre_scores_gemma":[0.5502748,0.000316811,0.4419421,0.0003627917,0.0002844405,0.0003972132,0.002017395,0.00070483,0.003699623],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005563144,"threshold_uncertainty_score":0.02577353,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W86299341","doi":"10.1137/9780898719987","title":"A First Course in Numerical Methods","year":2011,"lang":"en","type":"book","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Iterative Methods for Nonlinear Equations","field":"Mathematics","cited_by":119,"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":"Course (navigation); Computer science; Engineering; Aerospace engineering","authors":[{"name":"Uri M. Ascher","is_ca":true},{"name":"Chen Greif","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2466574443687853,"gpt":0.4004403800809391,"spread":0.1537829357121538,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001030941,0.001753111,0.001861952,0.0009078506,0.001060781,0.003156722,0.001395906,0.002235255,0.1398204],"category_scores_gemma":[0.004805685,0.0006984842,0.001741837,0.001285416,0.0009802305,0.002753944,0.002491602,0.005399806,0.1035247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001302361,"about_ca_system_score_gemma":0.001911133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000573985,"about_ca_topic_score_gemma":0.0009241597,"domain_scores_codex":[0.9984697,0.0001986224,0.00007258694,0.0002847445,0.0008591697,0.0001151999],"domain_scores_gemma":[0.9982074,0.0006077219,0.00008253565,0.000193889,0.0007329733,0.000175323],"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.00007433161,0.0001252828,0.0004145817,0.0006731803,0.00002607564,0.0002127936,0.00029893,0.003000723,0.002757072,0.06121311,0.7124759,0.2187279],"study_design_scores_gemma":[0.00001667391,0.00008634226,0.0003594883,0.0003911956,0.000009322705,0.0002573094,0.00008304602,0.002239975,0.0008178277,0.02945937,0.9662613,0.00001809934],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.003796528,0.02998204,0.2812799,0.02446755,0.03559142,0.0005200014,0.002990269,0.005675876,0.6156965],"genre_scores_gemma":[0.02237304,0.02564632,0.1238616,0.007896745,0.00894531,0.0007258118,0.003374841,0.002674393,0.804502],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.1398204,"threshold_uncertainty_score":0.4677458,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2480907039","doi":"10.1137/1.9780898718256","title":"A Course in Mathematical Biology","year":2006,"lang":"en","type":"book","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Genetics, Bioinformatics, and Biomedical Research","field":"Biochemistry, Genetics and Molecular Biology","cited_by":116,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Course (navigation); Mathematics education; Biology; Computer science; Computational biology; Mathematics; Engineering; Aerospace engineering","authors":[{"name":"Gerda de Vries","is_ca":true},{"name":"Thomas Hillen","is_ca":true},{"name":"Mark C. Lewis","is_ca":true},{"name":"Johannes Müller","is_ca":false},{"name":"Birgitt Schönfisch","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03956505411311838,"gpt":0.2891093100562418,"spread":0.2495442559431234,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009627247,0.001394954,0.001126601,0.001419765,0.001501031,0.003070535,0.0008347132,0.001309803,0.08251288],"category_scores_gemma":[0.002560429,0.0004274884,0.0008441198,0.001281793,0.001582735,0.003927816,0.001763392,0.004764522,0.04666412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002295038,"about_ca_system_score_gemma":0.002055153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001554154,"about_ca_topic_score_gemma":0.003814447,"domain_scores_codex":[0.999559,0.00008782672,0.0000158586,0.00008339855,0.00021628,0.00003763483],"domain_scores_gemma":[0.9991224,0.00030268,0.00002940169,0.00008249526,0.0002447167,0.0002182671],"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.0000178324,0.00005978149,0.0001927636,0.00009599293,0.000008085129,0.00004095213,0.0001797728,0.0002962999,0.0003489516,0.1142302,0.7837697,0.1007597],"study_design_scores_gemma":[0.000006834426,0.00001866591,0.0004187235,0.0001628488,0.000004375936,0.00007381525,0.0000506803,0.0003934924,0.0001275179,0.09840923,0.900328,0.000005889834],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.001164293,0.03429239,0.0235321,0.03956212,0.01532241,0.00008397273,0.0006859662,0.0007373072,0.8846195],"genre_scores_gemma":[0.01238871,0.01246015,0.01353634,0.007200877,0.005930328,0.000136228,0.0005959651,0.000622462,0.947129],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.08251288,"threshold_uncertainty_score":0.2760331,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963943319","doi":"10.1137/1.9781611975031.144","title":"Space-Optimal Majority in Population Protocols","year":2018,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":76,"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":"Upper and lower bounds; Population; Logarithm; State (computer science); Protocol (science); Monotonic function; Binary logarithm; Mathematics; State space; Constant (computer programming); Computability; Discrete mathematics; Computer science; Combinatorics; Algorithm; Statistics","authors":[{"name":"Dan Alistarh","is_ca":false},{"name":"James Aspnes","is_ca":false},{"name":"Rati Gelashvili","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0608947133276922,"gpt":0.2741779008733097,"spread":0.2132831875456175,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002758569,0.0009380052,0.00134677,0.0008380588,0.002095922,0.002302255,0.00209888,0.001789146,0.004683703],"category_scores_gemma":[0.01391473,0.0005731065,0.001075608,0.0009548817,0.003721652,0.005698786,0.005776255,0.002936839,0.0008537744],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001738154,"about_ca_system_score_gemma":0.001908452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001449592,"about_ca_topic_score_gemma":0.001697128,"domain_scores_codex":[0.9968767,0.001119178,0.0001579923,0.0007290905,0.0006040325,0.0005130406],"domain_scores_gemma":[0.9895761,0.007376071,0.0006423031,0.00132835,0.0005851851,0.0004919405],"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.0004875944,0.0001217609,0.0008745346,0.0002326318,0.00006831736,0.0002931934,0.0009847429,0.4078194,0.008665551,0.5317823,0.004102767,0.04456728],"study_design_scores_gemma":[0.00009571727,0.0001289293,0.0001164279,0.00003097324,0.00002444218,0.0000819474,0.0001488115,0.5646426,0.004546102,0.4270224,0.003129084,0.00003264903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1316223,0.0006917914,0.8466849,0.001972733,0.0001067602,0.000249951,0.0002540899,0.001086943,0.01733059],"genre_scores_gemma":[0.8469635,0.0006273204,0.1398172,0.0006446876,0.0001081121,0.0005805025,0.0003529236,0.0002649085,0.01064087],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004683703,"threshold_uncertainty_score":0.01566857,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3020969699","doi":"10.1137/1.9781611976465.132","title":"The Expander Hierarchy and its Applications to Dynamic Graph Algorithms","year":2021,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":40,"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":"Treewidth; Tree decomposition; Algorithm; Computer science; Hierarchy; Dynamic problem; Graph; Mathematics; Theoretical computer science; Combinatorics; Pathwidth; Line graph","authors":[{"name":"Gramoz Goranci","is_ca":true},{"name":"Harald Räcke","is_ca":false},{"name":"Thatchaphol Saranurak","is_ca":false},{"name":"Zihan Tan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06587450508378731,"gpt":0.2717993298694636,"spread":0.2059248247856763,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001293823,0.0006733637,0.000696747,0.001532488,0.000933244,0.001546828,0.001907013,0.001234948,0.005739812],"category_scores_gemma":[0.006008668,0.0006974593,0.0007705902,0.0022396,0.001768807,0.005579819,0.002904931,0.00342897,0.00110956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001773507,"about_ca_system_score_gemma":0.0007914327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002578307,"about_ca_topic_score_gemma":0.002317461,"domain_scores_codex":[0.9985147,0.0003653703,0.00005861243,0.000350713,0.0005429712,0.0001676371],"domain_scores_gemma":[0.9968128,0.001695067,0.0002274433,0.0008074963,0.0003097382,0.0001474517],"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.0001424893,0.00008613463,0.0004742726,0.0001692289,0.00003169327,0.0001293105,0.0004435491,0.1252186,0.009449292,0.6915559,0.006395272,0.1659043],"study_design_scores_gemma":[0.00003410434,0.00007196503,0.0003074732,0.00003714468,0.00001789265,0.0002345624,0.00008000061,0.4949307,0.004539977,0.474241,0.02547133,0.00003376402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.009593713,0.000998235,0.9772574,0.0007067578,0.00004749037,0.00006138295,0.0001114546,0.0008672592,0.01035628],"genre_scores_gemma":[0.272883,0.002009254,0.7128554,0.0006587884,0.000245553,0.000257589,0.0004425858,0.0004423744,0.01020552],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.005739812,"threshold_uncertainty_score":0.01920158,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4389986737","doi":"10.1137/1.9781611977806.ch28","title":"Chapter 28: Subgradient Methods","year":2023,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Subgradient method; Computer science; Machine learning","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.1119871231347802,"gpt":0.2978296290613603,"spread":0.1858425059265801,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006241975,0.001695897,0.001090687,0.0008784767,0.0004652814,0.001766549,0.00104052,0.001015818,0.04495889],"category_scores_gemma":[0.002170949,0.0005467682,0.0009742132,0.001415208,0.0007862232,0.00209794,0.001129679,0.003115964,0.03291667],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007221919,"about_ca_system_score_gemma":0.0009313985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001259141,"about_ca_topic_score_gemma":0.001730068,"domain_scores_codex":[0.999374,0.0001044968,0.00002958417,0.0001210223,0.0003343707,0.00003651848],"domain_scores_gemma":[0.9996585,0.0001556354,0.00001382946,0.00005724219,0.00009459323,0.00002018704],"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.00004733003,0.00007656975,0.000121773,0.0009661152,0.00006190739,0.00008183083,0.000134072,0.02363399,0.003661203,0.2548273,0.2483156,0.4680723],"study_design_scores_gemma":[0.00001934076,0.00003654212,0.0002280616,0.0003818881,0.00003157888,0.0002924143,0.00003388698,0.04226122,0.004077066,0.2025838,0.7500225,0.00003182252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.0008307183,0.02989553,0.8306999,0.001374301,0.00212352,0.0001116012,0.0005741605,0.00164227,0.132748],"genre_scores_gemma":[0.0279922,0.06249163,0.5773309,0.002175673,0.00257966,0.0004531952,0.002335118,0.004988346,0.3196533],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.04495889,"threshold_uncertainty_score":0.1504025,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2777560552","doi":"10.1137/1.9781611975031.53","title":"Approximating Weighted Tree Augmentation via Chvátal-Gomory Cuts","year":2018,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Bounded function; Mathematics; Approximation algorithm; Tree (set theory); Bundle; Combinatorics; Set (abstract data type); Discrete mathematics; Mathematical optimization; Computer science","authors":[{"name":"Samuel Fiorini","is_ca":false},{"name":"Martin Groß","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.06393553489565193,"gpt":0.2473285711122279,"spread":0.183393036216576,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00166158,0.002006599,0.001894847,0.001139994,0.000655384,0.00162077,0.002346484,0.002388349,0.005019911],"category_scores_gemma":[0.008002722,0.0009535949,0.00145423,0.001863623,0.001244083,0.003793692,0.002423218,0.004364833,0.0009800685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001714202,"about_ca_system_score_gemma":0.001260423,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004236551,"about_ca_topic_score_gemma":0.005056096,"domain_scores_codex":[0.9987293,0.0003615821,0.00004618603,0.000255681,0.0003538493,0.0002534236],"domain_scores_gemma":[0.9969021,0.002107684,0.0002424749,0.0003370566,0.0002486437,0.0001621298],"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.0003901816,0.0002158405,0.001164551,0.0002427408,0.00007150594,0.0001660231,0.000157174,0.8318142,0.003176769,0.06756584,0.0110484,0.08398668],"study_design_scores_gemma":[0.00002384181,0.00005091732,0.000128781,0.00001993369,0.000008920597,0.00003397124,0.00002657817,0.9594682,0.0005320036,0.03850088,0.001200428,0.000005531967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05424663,0.0008489207,0.9344873,0.0007318429,0.000103687,0.0001166012,0.0004760285,0.001086767,0.007902351],"genre_scores_gemma":[0.476721,0.0007463315,0.5128839,0.0005681393,0.0001825726,0.0005012384,0.002063863,0.0005255016,0.005807419],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005019911,"threshold_uncertainty_score":0.01679325,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2395137269","doi":"10.1137/1.9781611973198.6","title":"Multi-Pivot Quicksort: Theory and Experiments","year":2013,"lang":"en","type":"article","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":27,"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":"Quicksort; Computer science; Cache; Hybrid algorithm (constraint satisfaction); Parallel computing; Algorithm; Sorting algorithm; Sorting; Artificial intelligence; Constraint satisfaction","authors":[{"name":"Shrinu Kushagra","is_ca":true},{"name":"Alejandro López-Ortíz","is_ca":true},{"name":"Aurick Qiao","is_ca":true},{"name":"J. Ian Munro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0560487531630435,"gpt":0.2772960848098143,"spread":0.2212473316467708,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004158078,0.00183486,0.001990002,0.002689476,0.001578089,0.001382303,0.004259741,0.002082742,0.006522261],"category_scores_gemma":[0.01879906,0.0007611702,0.0007268719,0.004669589,0.001605204,0.004091952,0.001814876,0.002041745,0.001857294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002291026,"about_ca_system_score_gemma":0.002250787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009208796,"about_ca_topic_score_gemma":0.007133779,"domain_scores_codex":[0.9947803,0.00101212,0.0004136476,0.0007608896,0.002238874,0.0007941694],"domain_scores_gemma":[0.9813699,0.0114438,0.0007801261,0.00263714,0.002954229,0.0008149158],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.008095129,0.007533268,0.009866778,0.003642872,0.0004541088,0.0005718557,0.0006803938,0.5011811,0.02895442,0.02364669,0.06514305,0.3502304],"study_design_scores_gemma":[0.0008549508,0.001695882,0.002043453,0.00008192247,0.00007719764,0.0002745783,0.0002833781,0.9538968,0.02406077,0.01007967,0.006568853,0.0000824918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6968361,0.008264689,0.2211038,0.001583686,0.001133318,0.001595411,0.003744632,0.02840417,0.03733423],"genre_scores_gemma":[0.7383338,0.001394622,0.2505493,0.0003641921,0.000146352,0.0006993577,0.003476331,0.001301618,0.003734418],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009208796,"threshold_uncertainty_score":0.0219903,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3120098135","doi":"10.1137/1.9781611976472.5","title":"PFP Compressed Suffix Trees","year":2021,"lang":"en","type":"article","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"National Human Genome Research Institute; National Institute of Allergy and Infectious Diseases; Natural Sciences and Engineering Research Council of Canada; Agencia Nacional de Investigación y Desarrollo; Israel Institute for Biological Research; Research Center for Informatics, Czech Technical University in Prague; National Institutes of Health; National Science Foundation","keywords":"Compressed suffix array; Generalized suffix tree; Suffix tree; Computer science; String (physics); Parsing; Suffix array; Suffix; Concatenation (mathematics); Prefix; Computation; Data structure; Tree (set theory); Theoretical computer science; Algorithm; Combinatorics; Mathematics; Artificial intelligence; Programming language","authors":[{"name":"Christina Boucher","is_ca":false},{"name":"Ondřej Cvacho","is_ca":false},{"name":"Travis Gagie","is_ca":true},{"name":"Jan Holub","is_ca":false},{"name":"Giovanni Manzini","is_ca":false},{"name":"Gonzalo Navarro","is_ca":false},{"name":"Massimiliano Rossi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05496279510950445,"gpt":0.2515273967201858,"spread":0.1965646016106814,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008504616,0.0009226095,0.0009710421,0.001939104,0.001151397,0.002289976,0.002358047,0.001434225,0.01235521],"category_scores_gemma":[0.01124992,0.0006013242,0.0009961834,0.005792564,0.0007089509,0.004688832,0.002257771,0.001580859,0.007754704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008682291,"about_ca_system_score_gemma":0.002260858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002233961,"about_ca_topic_score_gemma":0.002637517,"domain_scores_codex":[0.9982526,0.000259451,0.0002133294,0.0004020884,0.0006927078,0.0001797991],"domain_scores_gemma":[0.9958447,0.001351195,0.0002182715,0.001472419,0.001001859,0.0001116422],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0008713241,0.0001943691,0.001618617,0.0007700294,0.00008726513,0.0008397705,0.0005746991,0.03688192,0.02383249,0.07363351,0.1047506,0.7559454],"study_design_scores_gemma":[0.0002923277,0.0003165751,0.001250659,0.0002438214,0.00008867808,0.002079488,0.0004731466,0.4624065,0.056942,0.2519158,0.2238699,0.0001211478],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03294778,0.001529518,0.8882664,0.001267695,0.0006962457,0.0004988686,0.01949965,0.03582596,0.01946779],"genre_scores_gemma":[0.1332439,0.0008581851,0.8126518,0.0005941431,0.0003061223,0.0007144719,0.04020484,0.002229149,0.009197368],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01235521,"threshold_uncertainty_score":0.0413323,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4394717648","doi":"10.1137/1.9781611978032.61","title":"RHINE: A Regime-Switching Model with Nonlinear Representation for Discovering and Forecasting Regimes in Financial Markets","year":2024,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Complex Systems and Time Series Analysis","field":"Economics, Econometrics and Finance","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Representation (politics); Nonlinear system; Financial market; Economics; Econometrics; Financial economics; Finance; Political science; Physics","authors":[{"name":"Kunpeng Xu","is_ca":true},{"name":"Lifei Chen","is_ca":false},{"name":"Jean-Marc Patenaude","is_ca":false},{"name":"Shengrui Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08479186912696933,"gpt":0.2308440259081757,"spread":0.1460521567812064,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009706435,0.0005283122,0.0006508931,0.0004831011,0.000277243,0.0008549987,0.001183706,0.001304587,0.002303897],"category_scores_gemma":[0.003070929,0.0003754674,0.0008287316,0.0004772955,0.0007988243,0.001329815,0.001049063,0.001653003,0.000425552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004644551,"about_ca_system_score_gemma":0.0005021239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003814664,"about_ca_topic_score_gemma":0.002958203,"domain_scores_codex":[0.9997507,0.00008905552,0.00001411329,0.00007087879,0.00004888126,0.00002650424],"domain_scores_gemma":[0.9992454,0.0005260507,0.000101804,0.00004770841,0.00004662156,0.00003245906],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005919174,0.00004234663,0.001638281,0.00006844624,0.00006567888,0.0001094335,0.00007663845,0.9153969,0.001839848,0.05105802,0.001658596,0.02798661],"study_design_scores_gemma":[0.000002072922,0.000007136793,0.00009256537,0.000003759118,0.000003362946,0.000009301264,0.000001956585,0.9922495,0.00007337447,0.007239471,0.0003134267,0.000004120001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0348942,0.0008031206,0.9586044,0.0007253104,0.00007753202,0.00003664296,0.0002465542,0.000320853,0.004291451],"genre_scores_gemma":[0.8644437,0.001118646,0.1232326,0.0002893079,0.0001095898,0.000165299,0.0004809502,0.0001110745,0.01004884],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003814664,"threshold_uncertainty_score":0.007707298,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1895255764","doi":"10.1137/1.9781611972924.10","title":"Clique Cover on Sparse Networks","year":2012,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Treewidth; Cover (algebra); Clique; Bounded function; Clique percolation method; Computer science; Clique-sum; Combinatorics; Algorithm; Theoretical computer science; Discrete mathematics; Mathematics; Graph; Chordal graph; Complex network; Pathwidth; Engineering; Line graph; 1-planar graph","authors":[{"name":"Mathieu Blanchette","is_ca":true},{"name":"Ethan Kim","is_ca":true},{"name":"Adrian Vetta","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03676841343933337,"gpt":0.2274738645858115,"spread":0.1907054511464782,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000339039,0.0005515019,0.0005291954,0.0009415824,0.0008060422,0.00139965,0.0007072526,0.0009577542,0.008268837],"category_scores_gemma":[0.002734117,0.0003925586,0.0004972407,0.001852942,0.0008867951,0.002824076,0.001275686,0.001335155,0.0009386797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008904324,"about_ca_system_score_gemma":0.0003384376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00116912,"about_ca_topic_score_gemma":0.0009876447,"domain_scores_codex":[0.9996504,0.00006699772,0.000007661861,0.00008866721,0.0001444833,0.00004187123],"domain_scores_gemma":[0.9988852,0.0008593912,0.00004250126,0.00009930076,0.00006911292,0.00004455317],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009962045,0.00004288834,0.0005376304,0.0004089396,0.00004970894,0.0002910498,0.0002902861,0.1235083,0.003832891,0.6523247,0.03686582,0.1817482],"study_design_scores_gemma":[0.00002304622,0.00003412905,0.0005837645,0.00006092324,0.00001865899,0.0004436402,0.00009176966,0.2533745,0.001872379,0.6738472,0.06963519,0.0000147461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08639521,0.009089665,0.7550719,0.005146,0.0006059894,0.0001866459,0.001083043,0.0007391744,0.1416824],"genre_scores_gemma":[0.6401148,0.01169958,0.2676333,0.0008406838,0.001545701,0.0003510024,0.001995936,0.0004310759,0.07538792],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008268837,"threshold_uncertainty_score":0.02766198,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2898624802","doi":"10.1137/1.9781611975482.134","title":"Improved Bounds for Randomly Sampling Colorings via Linear Programming","year":2019,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","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":"Engineering and Physical Sciences Research Council","keywords":"Glauber; Mathematics; Combinatorics; Mixing (physics); Discrete mathematics; Conjecture; Constant (computer programming); Graph coloring; Graph; Computer science; Physics","authors":[{"name":"Sitan Chen","is_ca":false},{"name":"Michelle Delcourt","is_ca":false},{"name":"Ankur Moitra","is_ca":false},{"name":"Guillem Perarnau","is_ca":false},{"name":"Luke Postle","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1546373306427187,"gpt":0.3309351898011887,"spread":0.17629785915847,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009359975,0.004049523,0.003685385,0.002566148,0.002313322,0.005679923,0.007063116,0.002936195,0.01736233],"category_scores_gemma":[0.05157643,0.001786054,0.002584192,0.003301634,0.005006855,0.01188482,0.006512117,0.01317679,0.004007892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006957451,"about_ca_system_score_gemma":0.004074421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003655902,"about_ca_topic_score_gemma":0.005290703,"domain_scores_codex":[0.9914986,0.003267693,0.000205905,0.001661391,0.001805148,0.001561121],"domain_scores_gemma":[0.9337979,0.05472756,0.001833974,0.005294779,0.002685641,0.001660231],"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.0006744905,0.0004687047,0.001739417,0.0006461596,0.0001647169,0.0001821295,0.0004067494,0.331396,0.003163629,0.590247,0.01788279,0.0530283],"study_design_scores_gemma":[0.00003270707,0.00006811123,0.0002196868,0.0000735298,0.00003161208,0.00004360761,0.0000374727,0.7265778,0.0008047687,0.2696642,0.002417348,0.00002916374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03014974,0.003951839,0.8956593,0.004145704,0.0005180638,0.0002634171,0.0008705554,0.002358061,0.06208336],"genre_scores_gemma":[0.5518014,0.004117796,0.3897596,0.003809661,0.001718396,0.001604581,0.002413167,0.002802598,0.04197284],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01736233,"threshold_uncertainty_score":0.05808276,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963282263","doi":"10.1137/1.9781611975031.70","title":"A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank","year":2018,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Graph Theory and Algorithms","field":"Computer Science","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 Waterloo","funders":"","keywords":"Mathematics; Rank (graph theory); Hamiltonian (control theory); Combinatorics; Matrix (chemical analysis); Materials science; Mathematical optimization; Composite material","authors":[{"name":"Radu Curticapea","is_ca":false},{"name":"Nathan Lindzey","is_ca":true},{"name":"Jesper Nederlof","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03601687008750448,"gpt":0.2479868785746317,"spread":0.2119700084871272,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002452186,0.001908172,0.001447767,0.002197268,0.001659566,0.004451206,0.002866816,0.001627358,0.01430996],"category_scores_gemma":[0.02214872,0.0009321034,0.00144052,0.00260634,0.002836139,0.01325729,0.003178186,0.004582493,0.003144251],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002302599,"about_ca_system_score_gemma":0.002110702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001512257,"about_ca_topic_score_gemma":0.002472749,"domain_scores_codex":[0.9958212,0.0007102926,0.0001882836,0.001163686,0.001242563,0.0008739785],"domain_scores_gemma":[0.9811772,0.01202894,0.001231725,0.003475721,0.001253316,0.000833035],"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.001186338,0.0004313738,0.008261227,0.0009833276,0.000187017,0.0004484628,0.001284527,0.05393346,0.03111698,0.7293742,0.0241655,0.1486276],"study_design_scores_gemma":[0.00009763132,0.0002737491,0.001583081,0.0001156915,0.0001108837,0.0004768073,0.000199551,0.222241,0.01303434,0.7507432,0.01100003,0.0001241021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2251312,0.002582229,0.6897565,0.006537878,0.0003896267,0.0003811945,0.003286681,0.003768115,0.06816658],"genre_scores_gemma":[0.8143554,0.001132095,0.1681974,0.001174384,0.0006858961,0.0003846039,0.001898017,0.0007661955,0.01140605],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01430996,"threshold_uncertainty_score":0.04787165,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3003802434","doi":"10.1137/1.9781611976236.36","title":"Harmonic Alignment","year":2020,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Single-cell and spatial transcriptomics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"National Institute of General Medical Sciences; National Institutes of Health; Institut de Valorisation des Données; Gruber Foundation","keywords":"Computer science; Pointwise; Leverage (statistics); Population; Feature (linguistics); Data mining; Algorithm; Pattern recognition (psychology); Artificial intelligence; Mathematics","authors":[{"name":"Jay S. Stanley","is_ca":false},{"name":"Scott Gigante","is_ca":false},{"name":"Guy Wolf","is_ca":true},{"name":"Smita Krishnaswamy","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05687771654906773,"gpt":0.2286128385524664,"spread":0.1717351220033987,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002859841,0.00166572,0.001506039,0.003225452,0.001120013,0.00453448,0.003629392,0.001865099,0.01426543],"category_scores_gemma":[0.006867299,0.001136006,0.002494122,0.004035629,0.001853357,0.004962278,0.006407268,0.003094431,0.009615934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001195134,"about_ca_system_score_gemma":0.001423404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001900576,"about_ca_topic_score_gemma":0.001765155,"domain_scores_codex":[0.9953043,0.000879009,0.0003248885,0.001729563,0.001519508,0.0002426644],"domain_scores_gemma":[0.9977878,0.0004921776,0.0002229077,0.000801806,0.000572645,0.0001226689],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001428939,0.00007158694,0.00103312,0.0004590983,0.0001988636,0.0002465033,0.0004413851,0.04317331,0.02153549,0.2348548,0.01940193,0.678441],"study_design_scores_gemma":[0.00004424455,0.0002000094,0.002338831,0.0001301591,0.0001157856,0.0009830778,0.0003531115,0.4135003,0.02012329,0.3800798,0.1819637,0.0001676961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007272289,0.0001566014,0.9957219,0.0000932188,0.00008003405,0.00004814302,0.000223181,0.0006242884,0.00232531],"genre_scores_gemma":[0.03090497,0.0005814532,0.9562744,0.0002971022,0.0003150003,0.0003204763,0.002542928,0.001131836,0.007631786],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01426543,"threshold_uncertainty_score":0.04772258,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2997631494","doi":"10.1137/1.9781611975994.84","title":"Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity","year":2019,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"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":"UK Research and Innovation","keywords":"Constant (computer programming); Block (permutation group theory); Mathematics; Computer science; Algorithm; Combinatorics","authors":[{"name":"Alessandro Chiesa","is_ca":false},{"name":"Tom Gur","is_ca":false},{"name":"Igor Shinkar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05414140227574143,"gpt":0.2239002218250322,"spread":0.1697588195492908,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002147331,0.001213836,0.001597642,0.0005799466,0.001109106,0.002396069,0.002828558,0.001826161,0.004371942],"category_scores_gemma":[0.02624452,0.0006449393,0.0009852584,0.001555586,0.002610459,0.006070783,0.003786387,0.004700614,0.001936689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002369921,"about_ca_system_score_gemma":0.004221972,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0044005,"about_ca_topic_score_gemma":0.00524884,"domain_scores_codex":[0.9943191,0.00105636,0.0004016199,0.001280295,0.001950527,0.0009920945],"domain_scores_gemma":[0.9706358,0.01582054,0.002135352,0.008322834,0.002461058,0.0006244338],"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.002535997,0.0003580673,0.004205201,0.001038388,0.0001488063,0.0006334733,0.001441017,0.5004339,0.0404784,0.2968928,0.01796705,0.1338669],"study_design_scores_gemma":[0.0002542,0.0004335782,0.0005581719,0.0001156885,0.00009000211,0.0006106914,0.0002134516,0.7209356,0.02305808,0.2463527,0.007269471,0.0001083051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1733558,0.00201353,0.8040799,0.002676732,0.0001783701,0.0003289268,0.001670119,0.003478902,0.01221768],"genre_scores_gemma":[0.7319519,0.0009868128,0.2538871,0.001230442,0.0002065611,0.0005004965,0.001832898,0.0006873031,0.008716444],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0044005,"threshold_uncertainty_score":0.01719511,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2734881792","doi":"10.1137/1.9781611975031.27","title":"Approximation Schemes for Clustering with Outliers","year":2018,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":12,"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":"Cluster analysis; Outlier; Metric (unit); Metric space; Facility location problem; Set (abstract data type); Overhead (engineering); Computer science; Mathematics; Euclidean distance; Data point; Fraction (chemistry); Integer (computer science); Algorithm; Data mining; Mathematical optimization; Discrete mathematics; Statistics; Artificial intelligence; Engineering","authors":[{"name":"Zachary Friggstad","is_ca":true},{"name":"Kamyar Khodamoradi","is_ca":true},{"name":"Mohsen Rezapour","is_ca":false},{"name":"Mohammad R. Salavatipour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07641030250898438,"gpt":0.2334986998941839,"spread":0.1570883973851995,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005365008,0.002080834,0.002754507,0.002527286,0.001398315,0.003292299,0.005356382,0.003269225,0.007059265],"category_scores_gemma":[0.0241501,0.0009791702,0.00218113,0.005193724,0.001848399,0.004913356,0.004762126,0.004860818,0.002973952],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00377629,"about_ca_system_score_gemma":0.002087092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005315593,"about_ca_topic_score_gemma":0.003952626,"domain_scores_codex":[0.9958724,0.001404295,0.000267613,0.0007929298,0.001312474,0.0003503094],"domain_scores_gemma":[0.9910811,0.004556953,0.0007711294,0.001785851,0.001497707,0.0003073118],"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.0002808247,0.00007332509,0.0007964553,0.000512286,0.000138128,0.00009693211,0.0002980525,0.6643237,0.001129065,0.1971268,0.01429481,0.1209296],"study_design_scores_gemma":[0.00002302469,0.00004180915,0.0001189345,0.00005291824,0.00001950743,0.00005742495,0.00004109381,0.8912986,0.0003191357,0.1021065,0.005903614,0.00001738781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003135814,0.001961573,0.9904392,0.0005085596,0.0001615145,0.00007406375,0.0001959383,0.0004497618,0.003073429],"genre_scores_gemma":[0.2466982,0.005686467,0.7261116,0.0006687482,0.0008348832,0.000690355,0.002009836,0.0006954339,0.01660459],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007059265,"threshold_uncertainty_score":0.02837324,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2949684529","doi":"10.1137/1.9781611975482.144","title":"On the Spanning and Routing Ratio of Theta-Four","year":2019,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Computer science; Mathematics; Euclidean distance; Routing (electronic design automation); Graph; Discrete mathematics; Computer network; Artificial intelligence","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Jean-Lou De Carufel","is_ca":true},{"name":"Darryl Hill","is_ca":true},{"name":"Michiel Smid","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1063530801688212,"gpt":0.2731127318756878,"spread":0.1667596517068666,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002118223,0.001127178,0.0008698232,0.001836892,0.001016374,0.002526175,0.002719806,0.001009946,0.009191157],"category_scores_gemma":[0.01703401,0.000510461,0.0006871988,0.00205406,0.001780363,0.004668651,0.001772905,0.002002742,0.003558958],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002073518,"about_ca_system_score_gemma":0.001012742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001909538,"about_ca_topic_score_gemma":0.001113201,"domain_scores_codex":[0.997728,0.0006717847,0.00007057193,0.0005401719,0.0005668455,0.0004226735],"domain_scores_gemma":[0.9894227,0.007493696,0.0006666954,0.001231949,0.0007496623,0.0004352957],"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.002002996,0.0002832635,0.005320692,0.0005754777,0.0001649427,0.0003546413,0.0005789454,0.1481075,0.02438393,0.4432077,0.032408,0.342612],"study_design_scores_gemma":[0.0001589484,0.0004484846,0.00255337,0.0001707447,0.0001592048,0.001190915,0.0003902504,0.5840933,0.01895798,0.3690813,0.0227126,0.00008277906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5054921,0.008471581,0.3057874,0.003992149,0.0004491664,0.0001945444,0.001062868,0.002504749,0.1720455],"genre_scores_gemma":[0.8520269,0.002890544,0.1292318,0.0007806348,0.000257797,0.0002155855,0.000914693,0.0007670509,0.01291508],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009191157,"threshold_uncertainty_score":0.03074747,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4281661106","doi":"10.1137/1.9781611977554.ch116","title":"Sparse graphs with bounded induced cycle packing number have logarithmic treewidth","year":2023,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"Simon Fraser University","funders":"Berlin Mathematics Research Center MATH+; Agence Nationale de la Recherche; Deutsche Forschungsgemeinschaft","keywords":"Treewidth; Combinatorics; Bipartite graph; Mathematics; Logarithm; Cograph; Independent set; Time complexity; Chordal graph; Indifference graph; Discrete mathematics; Maximal independent set; Disjoint sets; Pathwidth; 1-planar graph; Graph; Line graph","authors":[{"name":"Marthe Bonamy","is_ca":false},{"name":"Edouard Bonnet","is_ca":false},{"name":"Hugues Déprés","is_ca":false},{"name":"Louis Esperet","is_ca":false},{"name":"Colin Geniet","is_ca":false},{"name":"Claire Hilaire","is_ca":false},{"name":"Stéphan Thomassé","is_ca":false},{"name":"Alexandra Wesolek","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09548717066097315,"gpt":0.2861821617268371,"spread":0.190694991065864,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004673773,0.0008628894,0.000788843,0.0008738504,0.0009894138,0.002111671,0.001177918,0.0008520165,0.006117337],"category_scores_gemma":[0.005163519,0.0008448561,0.0008464443,0.00181571,0.001053641,0.003612879,0.001422214,0.001515542,0.000875733],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001157652,"about_ca_system_score_gemma":0.0007999742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00182731,"about_ca_topic_score_gemma":0.003091891,"domain_scores_codex":[0.9990579,0.0001031686,0.00006236829,0.0002519577,0.0002457174,0.0002788274],"domain_scores_gemma":[0.9906532,0.005413294,0.001429732,0.001228994,0.0005807562,0.0006939952],"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.002962626,0.0007974129,0.03452871,0.001988947,0.000373081,0.001378192,0.001632884,0.2823706,0.1379142,0.3262874,0.0260823,0.1836836],"study_design_scores_gemma":[0.0002377701,0.000329575,0.01140899,0.0001163649,0.0002309521,0.001877969,0.0004521271,0.3091483,0.03646997,0.6185144,0.02113582,0.00007769879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7441944,0.0008608269,0.2233925,0.002218967,0.00008867698,0.0001834779,0.005210656,0.001643104,0.02220741],"genre_scores_gemma":[0.9269643,0.0006175928,0.06061606,0.0005445665,0.00007915688,0.000197911,0.004473096,0.000395775,0.00611142],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006117337,"threshold_uncertainty_score":0.02046454,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2623608619","doi":"10.1137/1.9781611974973.16","title":"Time-Aware Subscription Prediction Model for User Acquisition in Digital News Media","year":2017,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Newspaper; Computer science; Globe; Digital media; Action (physics); Data science; World Wide Web; Advertising; Business","authors":[{"name":"Heidar Davoudi","is_ca":false},{"name":"Morteza Zihayat","is_ca":false},{"name":"Aijun An","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0725633866148066,"gpt":0.2482040606146481,"spread":0.1756406739998415,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001357093,0.000774991,0.001269836,0.00148282,0.00045802,0.001324711,0.001880291,0.001317893,0.002655059],"category_scores_gemma":[0.003149578,0.0004318406,0.0008868601,0.001703161,0.0002972469,0.00174397,0.000576756,0.001829917,0.001291342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009329057,"about_ca_system_score_gemma":0.0007759043,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01956841,"about_ca_topic_score_gemma":0.02812525,"domain_scores_codex":[0.9994912,0.0001049083,0.00003990294,0.0001906483,0.00009324272,0.00007996194],"domain_scores_gemma":[0.9982936,0.001173324,0.0001364194,0.00008853672,0.0002217144,0.00008644059],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009234727,0.001791345,0.1013286,0.0004405827,0.0003147022,0.0008625598,0.0007376412,0.4924073,0.004575908,0.01336146,0.02001943,0.363237],"study_design_scores_gemma":[0.000007108367,0.0000299848,0.002328934,0.000007694669,0.00002825709,0.00004684874,0.00002015818,0.9958199,0.0001826715,0.001022695,0.0004982599,0.000007520509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5056895,0.004817004,0.4668179,0.00343144,0.0003598919,0.0003445222,0.004177695,0.002773445,0.01158858],"genre_scores_gemma":[0.9419352,0.001185897,0.04334512,0.0002988603,0.0002578925,0.0001999069,0.003043138,0.00006506989,0.009668767],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01956841,"threshold_uncertainty_score":0.03890902,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2952098125","doi":"10.1137/1.9781611975482.183","title":"Exact Algorithms and Lower Bounds for Stable Instances of Euclidean <i>k</i>-MEANS","year":2019,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":9,"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":"Euclidean geometry; Euclidean algorithm; Algorithm; Mathematics; Combinatorics; Computer science; Discrete mathematics; Geometry","authors":[{"name":"Zachary Friggstad","is_ca":true},{"name":"Kamyar Khodamoradi","is_ca":true},{"name":"Mohammad R. Salavatipour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04989408783899186,"gpt":0.242237781629213,"spread":0.1923436937902211,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003881675,0.002221002,0.002011074,0.001185478,0.001408105,0.004059575,0.004218361,0.002328347,0.008741566],"category_scores_gemma":[0.02531456,0.0009516046,0.002392357,0.002555771,0.002231776,0.006487387,0.003045167,0.005029757,0.001666806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003840296,"about_ca_system_score_gemma":0.002887857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003757251,"about_ca_topic_score_gemma":0.005153637,"domain_scores_codex":[0.9962035,0.0009788197,0.0002011912,0.001150653,0.0008623678,0.0006034694],"domain_scores_gemma":[0.9804404,0.01375301,0.001650471,0.002396247,0.001055344,0.0007046652],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009840856,0.0004731848,0.003802697,0.000960663,0.0002680252,0.0002322075,0.0004385942,0.7135697,0.006290969,0.1696208,0.01249542,0.09086368],"study_design_scores_gemma":[0.0000784385,0.000118003,0.0003974973,0.00003887745,0.00004296665,0.00009490958,0.00007948445,0.8600042,0.00191409,0.1356998,0.001509363,0.00002225826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.116829,0.002923593,0.849831,0.004971118,0.0002389716,0.0003711689,0.001385902,0.002183227,0.02126603],"genre_scores_gemma":[0.5953716,0.001125779,0.3926645,0.0008830565,0.0003011435,0.0004431169,0.002285228,0.0008818666,0.006043722],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008741566,"threshold_uncertainty_score":0.02924341,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3033460939","doi":"10.1137/1.9781611976465.63","title":"Beyond Submodular Maximization via One-Sided Smoothness","year":2021,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"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":"Submodular set function; Multilinear map; Matroid; Mathematics; Parameterized complexity; Set function; Rounding; Discrete mathematics; Polytope; Function (biology); Combinatorics; Extension (predicate logic); Monotone polygon; Mathematical optimization; Set (abstract data type); Pure mathematics; Computer science","authors":[{"name":"Mehrdad Ghadiri","is_ca":false},{"name":"Richard Santiago","is_ca":false},{"name":"F. Bruce Shepherd","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0661011885999601,"gpt":0.2321363231350354,"spread":0.1660351345350753,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003049948,0.001327965,0.001595197,0.0008341105,0.0006290891,0.001948718,0.001366902,0.001504118,0.002598992],"category_scores_gemma":[0.008536409,0.0006284179,0.001611943,0.001283249,0.0024623,0.003837795,0.003317262,0.00390405,0.0004388361],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001593335,"about_ca_system_score_gemma":0.0011917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001462793,"about_ca_topic_score_gemma":0.001197094,"domain_scores_codex":[0.9987246,0.0005054741,0.00004038599,0.0002585666,0.0003269505,0.0001439728],"domain_scores_gemma":[0.9969435,0.0020727,0.0002266964,0.0004050898,0.0001893938,0.0001626028],"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.0001388239,0.00009703106,0.0009595693,0.0002506177,0.0000889722,0.0001301854,0.0001798041,0.5782332,0.00403955,0.3638055,0.002273828,0.04980293],"study_design_scores_gemma":[0.0000142842,0.00008350883,0.0001896114,0.0000274659,0.0000125048,0.00005567483,0.00002812778,0.8038308,0.0009633378,0.1923283,0.00245018,0.00001614933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03033597,0.0008990463,0.9618428,0.0007821772,0.00003626065,0.00004299358,0.0001083391,0.0002310059,0.005721494],"genre_scores_gemma":[0.6756754,0.001740059,0.3142292,0.0004586247,0.0002349636,0.0002206692,0.0003257491,0.0003355209,0.006779751],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003049948,"threshold_uncertainty_score":0.01612991,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2778851403","doi":"10.1137/1.9781611975031.17","title":"A Polynomial Excluded-Minor Approximation of Treedepth","year":2018,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"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":"Treewidth; Combinatorics; Mathematics; Pathwidth; Minor (academic); Partial k-tree; 1-planar graph; Discrete mathematics; Tree decomposition; Graph minor; Planar graph; Bounded function; Tree-depth; Graph; Chordal graph; Line graph; Voltage graph","authors":[{"name":"Ken‐ichi Kawarabayashi","is_ca":false},{"name":"Benjamin Rossman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07880150073156854,"gpt":0.278216667261791,"spread":0.1994151665302224,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008408068,0.001012227,0.001061623,0.0008007552,0.000941729,0.002467774,0.002080922,0.0008004298,0.009244382],"category_scores_gemma":[0.007157731,0.0005585619,0.001467851,0.001425045,0.001301456,0.005750282,0.002097423,0.003473091,0.002458663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002696862,"about_ca_system_score_gemma":0.001421588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00223462,"about_ca_topic_score_gemma":0.003394199,"domain_scores_codex":[0.9990813,0.0001092332,0.0000301379,0.0003368006,0.0002973256,0.0001453096],"domain_scores_gemma":[0.9957154,0.002103149,0.0002663902,0.001411838,0.0002764786,0.0002268013],"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.001376959,0.0003464652,0.004473846,0.0009573536,0.00009823899,0.0003101731,0.0008292872,0.08025987,0.04021439,0.5508986,0.04148738,0.2787475],"study_design_scores_gemma":[0.0001257505,0.0003041838,0.00214388,0.0001170428,0.000110867,0.0007986731,0.0001661861,0.3579848,0.01359176,0.5793498,0.0452357,0.00007127523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1301738,0.002247057,0.8220026,0.002530864,0.0003828024,0.0001429258,0.001439505,0.004205391,0.03687504],"genre_scores_gemma":[0.6523529,0.001546329,0.3209304,0.001025949,0.0003075028,0.0002085706,0.002387672,0.001632418,0.01960835],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009244382,"threshold_uncertainty_score":0.03092551,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2621664531","doi":"10.1137/1.9781611974973.53","title":"User-guided Cross-domain Sentiment Classification","year":2017,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Cascades (Canada)","funders":"","keywords":"Sentiment analysis; Computer science; Domain adaptation; Artificial intelligence; Domain (mathematical analysis); Polarity (international relations); Transfer of learning; Labeled data; Graph; Context (archaeology); Factor (programming language); Machine learning; Natural language processing; Data mining; Classifier (UML); Theoretical computer science","authors":[{"name":"Arun Reddy Nelakurthi","is_ca":false},{"name":"Hanghang Tong","is_ca":false},{"name":"Ross Maciejewski","is_ca":false},{"name":"Nadya Bliss","is_ca":false},{"name":"Jingrui He","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1277627093176954,"gpt":0.3140586981615908,"spread":0.1862959888438953,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002910713,0.00150491,0.001186709,0.003466685,0.0007327138,0.001032827,0.001279671,0.001277347,0.002511861],"category_scores_gemma":[0.003897526,0.0002761787,0.0009487994,0.002233011,0.0005566974,0.001859475,0.001551987,0.001033292,0.002317146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006743746,"about_ca_system_score_gemma":0.0005089006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002130531,"about_ca_topic_score_gemma":0.003129119,"domain_scores_codex":[0.9984539,0.0004909563,0.00009841409,0.000544037,0.0002430315,0.0001696056],"domain_scores_gemma":[0.9975268,0.000874676,0.0002546392,0.000402014,0.000809718,0.0001322466],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001462482,0.001367781,0.0454624,0.0004528717,0.0005078326,0.0004436962,0.0007311743,0.06983525,0.03539952,0.004510325,0.02658209,0.8132446],"study_design_scores_gemma":[0.000036193,0.0001522694,0.007684594,0.00001656893,0.00005578792,0.0001859587,0.0002789487,0.9735353,0.009818648,0.00402092,0.004184927,0.00002995828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.383091,0.001944986,0.5957405,0.0005542036,0.0003938866,0.0005139322,0.002404847,0.005292166,0.01006447],"genre_scores_gemma":[0.8676147,0.0002911142,0.1201254,0.0002481377,0.0001473572,0.0001906977,0.005519632,0.0002804987,0.005582451],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003466685,"threshold_uncertainty_score":0.01539356,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2780888184","doi":"10.1137/1.9781611975031.60","title":"Voronoi tessellations in the CRT and continuum random maps of finite excess","year":2018,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Engineering and Physical Sciences Research Council; Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics; Voronoi diagram; Random graph; Distance; Graph; Random tree; Planar graph; Simplex; Brownian motion; Discrete mathematics; Partition (number theory); Geometry; Computer science","authors":[{"name":"Louigi Addario‐Berry","is_ca":false},{"name":"Omer Angel","is_ca":true},{"name":"Guillaume Chapuy","is_ca":false},{"name":"Éric Fusy","is_ca":false},{"name":"Christina Goldschmidt","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0591049888782196,"gpt":0.2452943803762953,"spread":0.1861893914980757,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009886624,0.0003385794,0.0007495746,0.00147232,0.0007684873,0.001784998,0.001211882,0.0008053458,0.002742435],"category_scores_gemma":[0.006644004,0.0003581525,0.0007112619,0.0006673307,0.002615929,0.001901498,0.001480921,0.0008241294,0.0002981361],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001922174,"about_ca_system_score_gemma":0.0004873865,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005779921,"about_ca_topic_score_gemma":0.00305433,"domain_scores_codex":[0.9994116,0.0002005914,0.00002115886,0.0001085339,0.0001384586,0.0001196642],"domain_scores_gemma":[0.9972717,0.001276105,0.0005082322,0.0002135198,0.0002579148,0.000472559],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008436806,0.00002344685,0.002105893,0.00003771234,0.00002317934,0.0002625453,0.0002229579,0.1088827,0.001878225,0.882884,0.0007108009,0.002884064],"study_design_scores_gemma":[0.0000472159,0.00004706113,0.001909604,0.00002594277,0.00001543797,0.0002485081,0.0002060391,0.590846,0.0007207555,0.4039883,0.001903689,0.00004149756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7855153,0.0008375645,0.1996978,0.0007590239,0.00005911397,0.00005119197,0.000256098,0.0002538413,0.01257001],"genre_scores_gemma":[0.9866853,0.0002638517,0.008880953,0.00007905965,0.00006287383,0.00005861637,0.0001315677,0.00005222489,0.003785474],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005779921,"threshold_uncertainty_score":0.01394641,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2780822466","doi":"10.1137/1.9781611975031.112","title":"Tight Bounds for Coalescing-Branching Random Walks on Regular Graphs","year":2018,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"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":"Random walk; Combinatorics; Mathematics; Upper and lower bounds; Discrete mathematics; Branching process; Expander graph; Graph; Cover (algebra); Rumor; Statistics","authors":[{"name":"Petra Berenbrin","is_ca":true},{"name":"George Giakkoupis","is_ca":false},{"name":"Peter Kling","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03979422242460341,"gpt":0.2527229191047576,"spread":0.2129286966801542,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00430195,0.003823826,0.00415549,0.003846362,0.003205882,0.006136149,0.005625758,0.003567972,0.01080473],"category_scores_gemma":[0.05141935,0.002205051,0.0027329,0.003865151,0.004501048,0.01360662,0.005755931,0.007425915,0.002818328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005212811,"about_ca_system_score_gemma":0.002093279,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003935637,"about_ca_topic_score_gemma":0.004384439,"domain_scores_codex":[0.9937043,0.001334819,0.0002484001,0.001306111,0.001659106,0.001747272],"domain_scores_gemma":[0.9296857,0.05288406,0.00440999,0.006922357,0.002408558,0.003689268],"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.002422487,0.0006583498,0.005808371,0.001396902,0.0004536833,0.001344308,0.002042573,0.4572831,0.02600257,0.4238672,0.02283813,0.05588235],"study_design_scores_gemma":[0.000139797,0.0002207334,0.001052776,0.000188233,0.0001959032,0.0005203807,0.0002132872,0.651269,0.003830473,0.3360265,0.006248787,0.00009416325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2199365,0.01222422,0.7021108,0.006839221,0.0004199732,0.0006087447,0.00251119,0.004906218,0.05044318],"genre_scores_gemma":[0.9053796,0.005452467,0.0728545,0.001484419,0.0007653362,0.0008832145,0.001866644,0.001616201,0.009697679],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01080473,"threshold_uncertainty_score":0.03782177,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2291149938","doi":"10.1137/1.9781611973754.2","title":"A Data-Aware FM-index","year":2014,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":7,"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":"Search engine indexing; Computer science; Code (set theory); Index (typography); Algorithm; Wavelet; Data compression; Entropy (arrow of time); Tree (set theory); Theoretical computer science; Wavelet transform; Data mining; Artificial intelligence; Mathematics","authors":[{"name":"Hongwei Huo","is_ca":false},{"name":"Longgang Chen","is_ca":false},{"name":"Heng Zhao","is_ca":false},{"name":"Jeffrey Scott Vitter","is_ca":false},{"name":"Yakov Nekrich","is_ca":true},{"name":"Qiang Yu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1035413490006835,"gpt":0.2667702607326768,"spread":0.1632289117319933,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005431595,0.0007217114,0.0009793465,0.002703541,0.0007548052,0.001469022,0.002176726,0.0008609417,0.008136811],"category_scores_gemma":[0.00289029,0.00029763,0.0004491675,0.003404489,0.0004845576,0.003724717,0.002140858,0.0008975057,0.004943175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006894857,"about_ca_system_score_gemma":0.001217055,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001296032,"about_ca_topic_score_gemma":0.00183592,"domain_scores_codex":[0.999119,0.00006314972,0.00006725157,0.00012109,0.0005611001,0.00006832476],"domain_scores_gemma":[0.9987263,0.000208237,0.00006134599,0.000534971,0.0003966056,0.0000725678],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004140312,0.000215117,0.0008598419,0.0003834293,0.00004302421,0.0002147421,0.0001411303,0.006636557,0.07042374,0.02106908,0.03474679,0.8648525],"study_design_scores_gemma":[0.0002663242,0.0006164854,0.002919201,0.0001562719,0.000137043,0.003149058,0.0002224497,0.5391344,0.1936819,0.0441242,0.2153817,0.0002110358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02136989,0.002108623,0.9475806,0.0004592089,0.0006249086,0.0002693679,0.00176966,0.01081596,0.01500179],"genre_scores_gemma":[0.1178219,0.000745988,0.8600937,0.000507988,0.0005130943,0.0002371169,0.005541643,0.0007849077,0.01375368],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008136811,"threshold_uncertainty_score":0.02722031,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3018088442","doi":"10.1137/1.9781611976465.75","title":"Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications","year":2021,"lang":"en","type":"preprint","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"","keywords":"Probabilistic logic; Tree (set theory); Pruning; Algorithm; Computer science; Binary logarithm; Embedding; Combinatorics; Time complexity; Approximation algorithm; Probabilistic analysis of algorithms; Dynamic problem; Mathematics; Discrete mathematics; Theoretical computer science; Artificial intelligence","authors":[{"name":"Sebastian Forster","is_ca":false},{"name":"Gramoz Goranci","is_ca":true},{"name":"Monika Henzinger","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03287864480673584,"gpt":0.2499828280805961,"spread":0.2171041832738603,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00192393,0.0009263067,0.001257935,0.0005209082,0.000955599,0.001960381,0.003619313,0.001887005,0.003848989],"category_scores_gemma":[0.01548633,0.0008889049,0.0007587542,0.001500586,0.001398241,0.01049656,0.006195817,0.002592112,0.001174393],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00114937,"about_ca_system_score_gemma":0.0008653661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000720229,"about_ca_topic_score_gemma":0.0008135375,"domain_scores_codex":[0.9978707,0.0004095868,0.0001846999,0.0006253824,0.0006295607,0.0002800343],"domain_scores_gemma":[0.9867634,0.005274138,0.001061702,0.005751818,0.0008015862,0.0003473382],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00176376,0.0004143563,0.003141259,0.0007619277,0.0001197286,0.0004506438,0.0009690077,0.4136423,0.04925444,0.1150057,0.01256288,0.4019141],"study_design_scores_gemma":[0.00005877094,0.000244652,0.0003306835,0.00002984109,0.0000401555,0.0004048939,0.0001085266,0.8904626,0.01412267,0.08902141,0.005139118,0.00003675961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08514331,0.0009910683,0.9047517,0.001185335,0.00008806816,0.0001206352,0.0003182635,0.003875264,0.00352629],"genre_scores_gemma":[0.7055851,0.0004511076,0.2884209,0.0003239487,0.0001310709,0.0002080327,0.0006602714,0.0005446878,0.003674899],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003848989,"threshold_uncertainty_score":0.01287621,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4244320771","doi":"10.1137/1.9781611975482.61","title":"XOR Codes and Sparse Learning Parity with Noise","year":2019,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Machine Learning and Algorithms","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":"Artificial Intelligence in Medicine (Canada)","funders":"Chinese University of Hong Kong; National Science Foundation","keywords":"Mathematics; Random variable; Combinatorics; Modulo; Decoding methods; Discrete mathematics; Parity (physics); Algorithm; Statistics; Physics; Quantum mechanics","authors":[{"name":"Andrej Bogdanov","is_ca":true},{"name":"Manuel Sabin","is_ca":true},{"name":"Prashant Nalini Vasudevan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03669504724905,"gpt":0.2299703520996574,"spread":0.1932753048506074,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001401795,0.0008033487,0.001282757,0.0004931511,0.0007272169,0.001726309,0.001591379,0.001451356,0.00620644],"category_scores_gemma":[0.0148542,0.0004967788,0.001097554,0.001008567,0.001650829,0.003668059,0.002663412,0.00311652,0.0008454479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001806504,"about_ca_system_score_gemma":0.00174404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002160239,"about_ca_topic_score_gemma":0.003044907,"domain_scores_codex":[0.9978849,0.0006596587,0.0001067237,0.0004645712,0.0005311568,0.0003529714],"domain_scores_gemma":[0.9915394,0.006401532,0.0005368109,0.0008928403,0.0004218581,0.0002074184],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001133911,0.0002781347,0.004557582,0.0004083855,0.0001503273,0.0005323003,0.0005054972,0.5041249,0.005157478,0.3677273,0.01314035,0.1022837],"study_design_scores_gemma":[0.0001020752,0.00005880353,0.0002803101,0.00002090706,0.00001978676,0.00008741635,0.00005901595,0.6829956,0.002406925,0.3126738,0.001274351,0.00002101553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.263104,0.0004894587,0.7134509,0.004745784,0.0001626914,0.0002102716,0.001305094,0.001704083,0.01482777],"genre_scores_gemma":[0.8399129,0.0001837103,0.1475748,0.0008096928,0.0001755295,0.0002820395,0.001184749,0.000323959,0.009552605],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00620644,"threshold_uncertainty_score":0.02076268,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3014017986","doi":"10.1137/1.9781611976236.55","title":"A Unified Non-Negative Matrix Factorization Framework for Semi Supervised Learning on Graphs","year":2020,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Neural Networks","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":"McGill University","funders":"National Institutes of Health; National Science Foundation","keywords":"Prior probability; Constraint (computer-aided design); Computer science; Node (physics); Key (lock); Encoding (memory); Range (aeronautics); Theoretical computer science; Artificial intelligence; Semi-supervised learning; Machine learning; Mathematics","authors":[{"name":"Anasua Mitra","is_ca":false},{"name":"Priyesh Vijayan","is_ca":true},{"name":"Srinivasan Parthasarathy","is_ca":false},{"name":"Balaraman Ravindran","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0552653009393757,"gpt":0.2660261235805125,"spread":0.2107608226411368,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001934785,0.001121652,0.0009842175,0.001141839,0.0004963791,0.001495943,0.002133124,0.001079769,0.003930549],"category_scores_gemma":[0.00339571,0.0005333788,0.0009798375,0.001407594,0.001438981,0.002319677,0.001908369,0.00247578,0.00228532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009563139,"about_ca_system_score_gemma":0.001084854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001297239,"about_ca_topic_score_gemma":0.002983534,"domain_scores_codex":[0.9988624,0.0004800839,0.00004127496,0.0002300175,0.0003409793,0.00004513664],"domain_scores_gemma":[0.9988835,0.0004394098,0.00009723555,0.00027396,0.000239938,0.00006583837],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003985996,0.00008566066,0.0003934354,0.0004145577,0.00009628883,0.0001592156,0.0002664074,0.1930164,0.008534987,0.439656,0.02466432,0.3326729],"study_design_scores_gemma":[0.000006700165,0.00002584431,0.0001025632,0.00003104744,0.000008674776,0.0000841838,0.00001863453,0.7656476,0.001145715,0.2213674,0.01154689,0.00001473233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003176877,0.0001219818,0.9986009,0.00008260323,0.00002024416,0.00001263568,0.00003575593,0.0001630815,0.0006451436],"genre_scores_gemma":[0.04871024,0.0006761614,0.9440826,0.0002352295,0.000207902,0.0002157406,0.000520033,0.0002655174,0.005086618],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003930549,"threshold_uncertainty_score":0.01314896,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4205207469","doi":"10.1137/1.9781611977073.58","title":"Recognizing <i>k</i>-leaf powers in polynomial time, for constant <i>k</i>","year":2022,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Combinatorics; Graph; Time complexity; Mathematics; Degree (music); Tree (set theory); Function (biology); Polynomial; Constant (computer programming); Discrete mathematics; Computer science; Physics; Biology","authors":[{"name":"Manuel Lafond","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04073694120796241,"gpt":0.2381362502607616,"spread":0.1973993090527992,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000211342,0.000773825,0.0006155379,0.0005073108,0.0005609187,0.002134752,0.001037665,0.0007670607,0.0154352],"category_scores_gemma":[0.001319811,0.0005110511,0.0009275993,0.0008853805,0.0007465279,0.004918227,0.0008442381,0.00126692,0.006715851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009808186,"about_ca_system_score_gemma":0.0005776409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001160744,"about_ca_topic_score_gemma":0.001686911,"domain_scores_codex":[0.9997094,0.00001706505,0.00001878085,0.0001380409,0.0000647454,0.0000519157],"domain_scores_gemma":[0.999301,0.0003087253,0.00008293545,0.0001653755,0.00008073112,0.00006124189],"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.000633403,0.0002373133,0.006998723,0.001271929,0.00006774059,0.0006045651,0.001000534,0.02957127,0.1189716,0.1061442,0.07022267,0.664276],"study_design_scores_gemma":[0.000111944,0.0003390441,0.008076572,0.0002219196,0.000143178,0.003483452,0.001127881,0.2660807,0.1180163,0.4472756,0.154995,0.0001283646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2132,0.001588854,0.6522832,0.002468848,0.0003998558,0.0003596278,0.002140164,0.007986781,0.1195727],"genre_scores_gemma":[0.3907143,0.001626281,0.5317726,0.0004936764,0.0001722115,0.0001656654,0.006957775,0.001283102,0.06681433],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0154352,"threshold_uncertainty_score":0.05163586,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4406142049","doi":"10.1137/1.9781611978322.92","title":"Private Mean Estimation with Person-Level Differential Privacy","year":2025,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Privacy-Preserving Technologies in Data","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":"Google (Canada); University of Waterloo","funders":"","keywords":"Differential privacy; Estimation; Differential (mechanical device); Statistics; Computer science; Mathematics; Economics; Physics; Thermodynamics","authors":[{"name":"Sushant Agarwal","is_ca":false},{"name":"Gautam Kamath","is_ca":true},{"name":"Mahbod Majid","is_ca":false},{"name":"Argyris Mouzakis","is_ca":true},{"name":"Rose Silver","is_ca":false},{"name":"Jonathan Ullman","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09075183347604178,"gpt":0.2588734497257937,"spread":0.168121616249752,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005047088,0.001160944,0.001613249,0.0007368508,0.0007148904,0.003243203,0.002900055,0.002021693,0.002800714],"category_scores_gemma":[0.02321676,0.0007461506,0.001142414,0.002380318,0.002454646,0.007580476,0.004709468,0.003829017,0.001058914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00217181,"about_ca_system_score_gemma":0.001187718,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007424035,"about_ca_topic_score_gemma":0.0004900444,"domain_scores_codex":[0.9949456,0.002048537,0.0001558979,0.001131999,0.001309593,0.0004085194],"domain_scores_gemma":[0.987785,0.007807175,0.0007829854,0.002861104,0.0005793133,0.0001844767],"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.0003721658,0.0001147489,0.00271492,0.0002678383,0.0001458911,0.0003017564,0.0004083703,0.2307391,0.00523309,0.6139302,0.005830445,0.1399415],"study_design_scores_gemma":[0.00002008635,0.00007811213,0.0004883901,0.0000327509,0.00002998952,0.0003243743,0.00005920103,0.69529,0.004340507,0.2944954,0.004807649,0.00003367715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004946189,0.0003332683,0.9922622,0.00034769,0.00003115099,0.00002178869,0.00009711898,0.0001088998,0.00185161],"genre_scores_gemma":[0.5418915,0.002222766,0.4417835,0.0007170447,0.000456121,0.0002495043,0.0006312365,0.0001899143,0.01185852],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005047088,"threshold_uncertainty_score":0.02669185,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3019931603","doi":"10.1137/1.9781611976472.9","title":"Engineering Data Reduction for Nested Dissection","year":2021,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Anatomy and Medical Technology","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Reduction (mathematics); Computer science; Dissection (medical); Medicine; Mathematics; Radiology","authors":[{"name":"Wolfgang Ost","is_ca":false},{"name":"Christian Schulz","is_ca":false},{"name":"Darren Strash","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06984927930748606,"gpt":0.2403017338742261,"spread":0.17045245456674,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005964848,0.001326551,0.0009371829,0.00105331,0.0008042488,0.001600994,0.001779939,0.0008180903,0.01794085],"category_scores_gemma":[0.002699946,0.0007287991,0.001456451,0.001598064,0.001049255,0.002112577,0.002137021,0.002979228,0.007709117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000840619,"about_ca_system_score_gemma":0.000988135,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001701821,"about_ca_topic_score_gemma":0.002719587,"domain_scores_codex":[0.9991457,0.00008346358,0.00004905008,0.0001646216,0.0005047385,0.00005227403],"domain_scores_gemma":[0.9990222,0.0003822582,0.00005251183,0.0003097644,0.0002052671,0.00002783412],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00009639423,0.0001095959,0.0005103825,0.0006667114,0.0000381194,0.0001932272,0.0002810305,0.09170319,0.01641121,0.2484929,0.05543647,0.5860608],"study_design_scores_gemma":[0.00004288185,0.00007956411,0.0003175841,0.0001417059,0.00002505937,0.0005452923,0.0001529929,0.3713502,0.02014222,0.3609775,0.2461796,0.00004545856],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002615957,0.0004662162,0.9801419,0.000270665,0.0001299236,0.00006298845,0.0002791546,0.001135025,0.01489825],"genre_scores_gemma":[0.02293489,0.0006451349,0.9599736,0.0001579577,0.00007021319,0.0001326252,0.001243549,0.0007556225,0.0140864],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01794085,"threshold_uncertainty_score":0.06001812,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2885364395","doi":"10.1137/1.9781611975215.7","title":"Multi-criteria Graph Partitioning with Scotch","year":2018,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Polygon mesh; Computer science; Graph partition; Monte Carlo method; Task (project management); Graph; Mathematical optimization; Algorithm; Theoretical computer science; Mathematics; Engineering; Statistics","authors":[{"name":"Rémi Barat","is_ca":false},{"name":"Cédric Chevalier","is_ca":false},{"name":"François Pellegrini","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07030585657788034,"gpt":0.2676367760326233,"spread":0.197330919454743,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007237342,0.0007765079,0.0006206128,0.001024414,0.0006156637,0.0008594307,0.001053323,0.0007119723,0.006235725],"category_scores_gemma":[0.001819857,0.0003963159,0.0007646082,0.0009154746,0.0005702355,0.0007433128,0.00133514,0.0007503619,0.001121816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007314392,"about_ca_system_score_gemma":0.000898285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003353743,"about_ca_topic_score_gemma":0.005112029,"domain_scores_codex":[0.9995283,0.0001173197,0.00001994322,0.00006721569,0.0002267399,0.00004057073],"domain_scores_gemma":[0.9992973,0.0003392379,0.00003848843,0.0001291548,0.0001672672,0.00002853994],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001512805,0.00007891186,0.0008615502,0.0003028193,0.00006864747,0.0002214029,0.0002349785,0.7010914,0.01491234,0.07014956,0.007234139,0.2046929],"study_design_scores_gemma":[0.00002446658,0.00005414752,0.0002757301,0.00002783479,0.00001307134,0.00008604519,0.00004489779,0.9582189,0.004354065,0.02783177,0.009055402,0.00001363975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02117001,0.0003170257,0.9648448,0.0001345905,0.00007309136,0.0001499178,0.0001416394,0.001119737,0.01204928],"genre_scores_gemma":[0.2260586,0.0002566892,0.7631052,0.000135729,0.00002949134,0.0003115008,0.0005141319,0.0006371259,0.008951499],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006235725,"threshold_uncertainty_score":0.02086055,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4406141822","doi":"10.1137/1.9781611978322.27","title":"Triply efficient shadow tomography","year":2025,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Computer Graphics and Visualization Techniques","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":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Shadow (psychology); Tomography; Medicine; Computer vision; Computer science; Radiology; Psychology; Psychoanalysis","authors":[{"name":"Robbie King","is_ca":false},{"name":"David Gosset","is_ca":true},{"name":"Robin Kothari","is_ca":false},{"name":"Ryan Babbush","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04075602441160851,"gpt":0.2588392169961879,"spread":0.2180831925845794,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001239602,0.0005373199,0.0007127872,0.0003977942,0.0008970996,0.001406763,0.001708718,0.001040177,0.00704296],"category_scores_gemma":[0.005626292,0.0003590548,0.0004982891,0.0006633619,0.002522589,0.003603023,0.003875969,0.001825667,0.0008467186],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001638046,"about_ca_system_score_gemma":0.001348536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001054946,"about_ca_topic_score_gemma":0.001236917,"domain_scores_codex":[0.9984652,0.0003351826,0.00007282306,0.0003457787,0.0004876358,0.0002933625],"domain_scores_gemma":[0.9960497,0.001521008,0.0002418648,0.001748817,0.0002673961,0.0001712254],"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.0008132913,0.0001378877,0.001289919,0.0002542397,0.00006270487,0.0002643554,0.0005292023,0.08727361,0.04957931,0.7939926,0.005944438,0.05985843],"study_design_scores_gemma":[0.00009110403,0.0001843881,0.00047687,0.0000346689,0.00003364336,0.0002086164,0.0001815298,0.5926281,0.06821983,0.3287409,0.009135221,0.00006516794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1139212,0.000330406,0.8556749,0.0008631466,0.0001197243,0.0002244838,0.0006273899,0.002007971,0.02623065],"genre_scores_gemma":[0.8675563,0.0001521167,0.1235617,0.0002483366,0.00003290979,0.000230232,0.0004539533,0.0002459242,0.00751844],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00704296,"threshold_uncertainty_score":0.02356112,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2607184796","doi":"10.1137/1.9781611975062.2","title":"Quicksort Is Optimal For Many Equal Keys","year":2018,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"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":"Quicksort; Combinatorics; Constant (computer programming); Mathematics; Sorting; Conjecture; Asymptotically optimal algorithm; Upper and lower bounds; Value (mathematics); Discrete mathematics; Sorting algorithm; Algorithm; Computer science; Statistics; Mathematical analysis","authors":[{"name":"Sebastian Wild","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1073360535337749,"gpt":0.296285575397509,"spread":0.1889495218637341,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00323823,0.001286352,0.002442838,0.001373279,0.002513648,0.006109083,0.002701943,0.002250593,0.01753625],"category_scores_gemma":[0.02997059,0.001102202,0.001787077,0.003139093,0.003280846,0.01908496,0.003847369,0.003544618,0.004136721],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004061437,"about_ca_system_score_gemma":0.003558559,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001265471,"about_ca_topic_score_gemma":0.001616317,"domain_scores_codex":[0.99419,0.0008072383,0.0003799511,0.001905727,0.00141523,0.001301929],"domain_scores_gemma":[0.9768732,0.01465319,0.001456262,0.004856571,0.001379111,0.0007816757],"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.003680721,0.0006133838,0.005824993,0.001860023,0.0003401042,0.0003815825,0.0009200574,0.1060137,0.02207867,0.5905185,0.03871734,0.2290509],"study_design_scores_gemma":[0.0002189521,0.000479795,0.0007386598,0.0001668778,0.000195442,0.0008181273,0.0003812751,0.1391686,0.01783179,0.8231688,0.01672979,0.0001020425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.497061,0.005621649,0.402453,0.005719691,0.0008788033,0.0002681602,0.001904356,0.005424256,0.08066908],"genre_scores_gemma":[0.855939,0.001648723,0.1205076,0.0014376,0.0004240534,0.000221969,0.001228452,0.001372642,0.01722],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.01753625,"threshold_uncertainty_score":0.05866462,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4390018014","doi":"10.1137/1.9781611977806","title":"An Introduction to Convexity, Optimization, and Algorithms","year":2023,"lang":"en","type":"book","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Digital Image Processing Techniques","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":"University of Waterloo; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Convexity; Computer science; Algorithm; Economics","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Walaa M. Moursi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05074735675603823,"gpt":0.2756462767649708,"spread":0.2248989200089326,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007912302,0.001948331,0.001679981,0.001902678,0.0008399592,0.003119964,0.001255386,0.001207363,0.03019498],"category_scores_gemma":[0.002059541,0.0006703314,0.001186235,0.003790312,0.002991953,0.003409487,0.001502914,0.004661637,0.01401866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001348283,"about_ca_system_score_gemma":0.001892009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002040145,"about_ca_topic_score_gemma":0.00338215,"domain_scores_codex":[0.9992602,0.0001671106,0.00004032196,0.0001080771,0.0003717786,0.00005255756],"domain_scores_gemma":[0.9991499,0.0005715459,0.00003439881,0.00007319918,0.000139156,0.00003181358],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002076659,0.00002811413,0.00008999422,0.000587752,0.00002779958,0.00008628519,0.00008219769,0.003020257,0.0005704852,0.5240124,0.3473752,0.1240987],"study_design_scores_gemma":[0.000008503,0.00002600018,0.0003151002,0.0003578089,0.00001323935,0.0003123604,0.00005428476,0.005015065,0.0004113922,0.31505,0.6784096,0.0000267554],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.001330249,0.1856259,0.2505156,0.009164724,0.01115661,0.0001521545,0.001126973,0.001384985,0.5395429],"genre_scores_gemma":[0.04038396,0.2467633,0.2409405,0.009921763,0.01755922,0.0006726268,0.001664845,0.002375215,0.4397186],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.03019498,"threshold_uncertainty_score":0.1010122,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4391759275","doi":"10.1137/1.9781611977967.7","title":"High-Throughput Scientific Computation with Heterogeneous Clusters: A Kitchen-Sink Approach using the Actor Model","year":2024,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Sink (geography); Computation; Throughput; Computer science; Distributed computing; Geography; Algorithm; Cartography; Operating system","authors":[{"name":"Kyle Klenk","is_ca":true},{"name":"Mohammad Mahdi Moayeri","is_ca":true},{"name":"Raymond J. Spiteri","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2753927634670729,"gpt":0.3359933170015934,"spread":0.06060055353452048,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001048443,0.0005892439,0.0007135002,0.0003952235,0.0008403107,0.001886718,0.001677362,0.001088436,0.002791821],"category_scores_gemma":[0.001808206,0.000506325,0.0009545535,0.0007845004,0.001399774,0.002282335,0.001920951,0.001772162,0.0005386575],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001420338,"about_ca_system_score_gemma":0.001454064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003686462,"about_ca_topic_score_gemma":0.004759135,"domain_scores_codex":[0.9994025,0.0003261901,0.00001520886,0.0001005157,0.0001098017,0.00004565615],"domain_scores_gemma":[0.9992537,0.0004881299,0.00004341269,0.00009563056,0.00005573556,0.00006342151],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004351052,0.0000296503,0.000618603,0.00006719019,0.00004987668,0.000148436,0.000200326,0.7947518,0.001866653,0.1844938,0.002059758,0.01567033],"study_design_scores_gemma":[0.000006940449,0.00001406107,0.00006927102,0.000009326899,0.00001028615,0.00002435954,0.00004524019,0.9473873,0.0003234464,0.04752392,0.004577498,0.000008321363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01334799,0.0003571525,0.9736495,0.0007565399,0.00008222973,0.00004940769,0.00004234661,0.0002411925,0.0114736],"genre_scores_gemma":[0.4964764,0.001472424,0.4815507,0.0002966863,0.0001331372,0.0003316492,0.0001524253,0.0003677949,0.01921865],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003686462,"threshold_uncertainty_score":0.01030529,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4394717712","doi":"10.1137/1.9781611978032.94","title":"HyperFLoRA: Federated Learning with Instantaneous Personalization","year":2024,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Privacy-Preserving Technologies in Data","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":"University of Toronto; University of Alberta","funders":"","keywords":"Personalization; Computer science; Business; World Wide Web","authors":[{"name":"Qikai Lu","is_ca":true},{"name":"Di Niu","is_ca":true},{"name":"Mohammadamin Samadi Khoshkho","is_ca":true},{"name":"Baochun Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05389098597745808,"gpt":0.2382131231488756,"spread":0.1843221371714175,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001291249,0.0008026754,0.000669024,0.0005549023,0.0004095653,0.00179833,0.002063732,0.001025547,0.004813926],"category_scores_gemma":[0.002726371,0.0004330462,0.0006780522,0.001033638,0.0007742643,0.00393014,0.002224978,0.002252151,0.001945342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009853824,"about_ca_system_score_gemma":0.0009730972,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001389169,"about_ca_topic_score_gemma":0.001663927,"domain_scores_codex":[0.9991247,0.0001949241,0.0000428896,0.0002483379,0.0003016718,0.00008743638],"domain_scores_gemma":[0.99893,0.000314328,0.00004717819,0.0005541299,0.0001066302,0.00004773431],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002510225,0.0001742776,0.0007954072,0.0001530312,0.00007915634,0.0001992035,0.0001920869,0.2120465,0.006700492,0.07353491,0.02740917,0.6784647],"study_design_scores_gemma":[0.00001973129,0.00006478636,0.0002802327,0.00004095798,0.0000195278,0.0002765287,0.0000369596,0.8715915,0.007548143,0.08706266,0.03303175,0.00002717496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004223024,0.0007440092,0.9859638,0.0002362298,0.00007058585,0.00004548876,0.00009144144,0.003882372,0.004742975],"genre_scores_gemma":[0.3337055,0.002604327,0.6259317,0.0007863707,0.0002386403,0.0003043643,0.001036947,0.001014721,0.0343773],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004813926,"threshold_uncertainty_score":0.01610422,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4408180929","doi":"10.1137/1.9781611978285","title":"Numerical Partial Differential Equations","year":2025,"lang":"en","type":"book","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland; University of Waterloo","funders":"","keywords":"Mathematics; Numerical partial differential equations; Applied mathematics; Partial differential equation; First-order partial differential equation; Mathematical analysis","authors":[{"name":"James H. Adler","is_ca":false},{"name":"Hans De Sterck","is_ca":true},{"name":"Scott MacLachlan","is_ca":true},{"name":"Luke N. Olson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1369214473736494,"gpt":0.3385114165702995,"spread":0.2015899691966501,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004551323,0.00128645,0.001360018,0.001148551,0.0005880332,0.001560829,0.001111911,0.001017703,0.02720716],"category_scores_gemma":[0.001126032,0.0004349034,0.0007453919,0.001655243,0.001230761,0.001530681,0.001314532,0.002637954,0.012546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007146383,"about_ca_system_score_gemma":0.0009407121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001291011,"about_ca_topic_score_gemma":0.001758307,"domain_scores_codex":[0.999571,0.00006933975,0.00001907818,0.00004501635,0.0002774185,0.00001816786],"domain_scores_gemma":[0.999742,0.0001043129,0.000007788176,0.00003029146,0.0001042913,0.00001134191],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001810327,0.00003390681,0.0001055881,0.0006707145,0.00003206542,0.0001096015,0.000175291,0.005544076,0.002763961,0.5615391,0.2338437,0.1951638],"study_design_scores_gemma":[0.00001319621,0.0000212566,0.0001951424,0.0002058883,0.00001174434,0.0002113487,0.00002283314,0.01187276,0.001007398,0.1712615,0.8151584,0.00001847288],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.001408485,0.07810922,0.4785801,0.003684786,0.01229691,0.0003212729,0.001880401,0.002558815,0.42116],"genre_scores_gemma":[0.0245713,0.0566074,0.2405123,0.003340193,0.003951588,0.0008657718,0.002816255,0.001394526,0.6659405],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.02720716,"threshold_uncertainty_score":0.09101701,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2778339298","doi":"10.1137/1.9781611975031.36","title":"Time and Space Efficient Representations of Distributive Lattices","year":2018,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Coding theory and cryptography","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":"University of Waterloo","funders":"","keywords":"Distributive property; Joins; Lattice (music); Distributive lattice; Combinatorics; Mathematics; Binary logarithm; Discrete mathematics; Space (punctuation); Data structure; Computer science; Pure mathematics; Physics","authors":[{"name":"J. Ian Munro","is_ca":true},{"name":"Corwin Sinnamon","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03912692147255858,"gpt":0.2499064284679482,"spread":0.2107795069953896,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005891639,0.0005728752,0.0007369551,0.001082554,0.0009906428,0.00322575,0.001593691,0.0005664193,0.007898946],"category_scores_gemma":[0.003773833,0.0004282554,0.0004672271,0.002589339,0.001383225,0.007124093,0.001969478,0.001524386,0.0024954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001289709,"about_ca_system_score_gemma":0.001093585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000927484,"about_ca_topic_score_gemma":0.001427179,"domain_scores_codex":[0.9988768,0.0001954661,0.00009890128,0.000156547,0.0005310726,0.0001412098],"domain_scores_gemma":[0.9980951,0.0005322578,0.0001698205,0.000823572,0.0002844919,0.00009485021],"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.0007371307,0.0001503254,0.0006190556,0.0003102075,0.0000180772,0.000178786,0.0005790759,0.02510911,0.01350353,0.6176679,0.02192884,0.319198],"study_design_scores_gemma":[0.0001515395,0.0002502051,0.0002985586,0.000141328,0.0000313672,0.0005290364,0.0003838901,0.1677329,0.03211214,0.6939946,0.1042827,0.0000918381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06183602,0.001603943,0.901884,0.00118407,0.000285811,0.0001963127,0.002303646,0.003324034,0.02738214],"genre_scores_gemma":[0.3284212,0.001112175,0.6487266,0.0002932253,0.0002038623,0.0004731355,0.00383743,0.0004954258,0.01643707],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007898946,"threshold_uncertainty_score":0.02642465,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4390575880","doi":"10.1137/1.9781611977912.106","title":"Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time","year":2024,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Complexity and Algorithms in Graphs","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":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Maximum flow problem; Multiplicative function; Monotonic function; Algorithm; Minimum-cost flow problem; Undirected graph; Mathematics; Interior point method; Norm (philosophy); Computer science; Combinatorics; Graph; Amortized analysis; Discrete mathematics; Mathematical optimization; Data structure; Flow network","authors":[{"name":"Jan van den Brand","is_ca":false},{"name":"Li Chen","is_ca":false},{"name":"Rasmus Kyng","is_ca":false},{"name":"Yang P. Liu","is_ca":false},{"name":"Richard Peng","is_ca":true},{"name":"Maximilian Probst Gutenberg","is_ca":false},{"name":"Sushant Sachdeva","is_ca":true},{"name":"Aaron Sidford","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03992184772630632,"gpt":0.2312016338689604,"spread":0.1912797861426541,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002458303,0.00157094,0.001375214,0.001258563,0.001141531,0.002322684,0.004260599,0.001951421,0.00464336],"category_scores_gemma":[0.01634588,0.0007347896,0.001086237,0.002736928,0.001549303,0.007867873,0.003255971,0.002600292,0.001438091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00239867,"about_ca_system_score_gemma":0.003101982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002434137,"about_ca_topic_score_gemma":0.003967801,"domain_scores_codex":[0.9971162,0.0006195882,0.0002247601,0.0007226881,0.0008867125,0.0004299614],"domain_scores_gemma":[0.9869084,0.006462364,0.0009950106,0.00467236,0.0006585826,0.0003033005],"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.00172537,0.0004963701,0.003760636,0.0006629152,0.0002148314,0.0002146408,0.0005044063,0.3337399,0.02907018,0.06049564,0.02831423,0.5408009],"study_design_scores_gemma":[0.0001401059,0.0001510555,0.0005104947,0.00003099177,0.00005742705,0.0002546156,0.00007080388,0.902478,0.01308656,0.07802178,0.005165942,0.00003212333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06703357,0.0006858802,0.9121053,0.001244416,0.000142216,0.0002935687,0.001000626,0.009960259,0.007534156],"genre_scores_gemma":[0.4252177,0.0002885537,0.565381,0.0003999831,0.0001615247,0.0005347136,0.001754359,0.0007227746,0.005539376],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00464336,"threshold_uncertainty_score":0.01740366,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4206483022","doi":"10.1137/1.9781611977073.7","title":"Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time","year":2022,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Complexity and Algorithms in Graphs","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":"University of Toronto; University of Waterloo","funders":"","keywords":"Combinatorics; Planar graph; Flow (mathematics); Mathematics; Bounded function; Planar; Algorithm; Linear programming; Discrete mathematics; Computer science; Graph; Computer graphics (images); Geometry","authors":[{"name":"Sally Dong","is_ca":true},{"name":"Yu Gao","is_ca":true},{"name":"Gramoz Goranci","is_ca":true},{"name":"Yin Tat Lee","is_ca":true},{"name":"Richard Peng","is_ca":true},{"name":"Sushant Sachdeva","is_ca":true},{"name":"Guanghao Ye","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0581106082261173,"gpt":0.2417714419108038,"spread":0.1836608336846865,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004357923,0.001075822,0.0007476321,0.0004808607,0.0004850356,0.001196159,0.001204168,0.0006759217,0.01031398],"category_scores_gemma":[0.002428136,0.0005945652,0.0007278704,0.001122745,0.0007075372,0.003576642,0.001620402,0.001643025,0.001856875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009408676,"about_ca_system_score_gemma":0.001004738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002205619,"about_ca_topic_score_gemma":0.002850055,"domain_scores_codex":[0.9995754,0.00006464054,0.00001917364,0.0001289084,0.0001549698,0.0000568164],"domain_scores_gemma":[0.9993997,0.00034834,0.00004730072,0.0001250671,0.00005153365,0.0000280475],"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.0003759247,0.0001291279,0.000715644,0.0006915724,0.00004803545,0.0001514204,0.000344104,0.2316111,0.01508274,0.1992629,0.0175818,0.5340056],"study_design_scores_gemma":[0.00007013918,0.0001300942,0.0002593953,0.0000381594,0.0000211137,0.0001930207,0.00007919589,0.7698113,0.007167937,0.202395,0.01981348,0.00002099691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.02426,0.000227265,0.9618429,0.000371606,0.00003806017,0.0001100921,0.0002979196,0.0009797247,0.01187239],"genre_scores_gemma":[0.1177401,0.0003533401,0.8699102,0.0001347752,0.00004685487,0.0001934064,0.0008448847,0.0003725491,0.01040396],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.01031398,"threshold_uncertainty_score":0.0345037,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3119986790","doi":"10.1137/1.9781611976496.4","title":"Dispersion for Intervals: A Geometric Approach","year":2021,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Computational Geometry and Mesh Generation","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Mathematics; Interval (graph theory); Polygon (computer graphics); Dispersion (optics); Simple (philosophy); Shortest path problem; Real line; Point (geometry); Line (geometry); Path (computing); Combinatorics; Line segment; Algorithm; Geometry; Computer science; Graph","authors":[{"name":"Thérèse Biedl","is_ca":true},{"name":"Anna Lubiw","is_ca":true},{"name":"Anurag Murty Naredla","is_ca":true},{"name":"Peter Dominik Ralbovsky","is_ca":true},{"name":"Graeme Stroud","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08524411548924146,"gpt":0.255842873706384,"spread":0.1705987582171426,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001973701,0.001751824,0.001804247,0.002983006,0.001483035,0.004347428,0.003983613,0.002361427,0.01410594],"category_scores_gemma":[0.01069399,0.001244191,0.001971488,0.004458582,0.002722803,0.009981982,0.0050006,0.005414819,0.003844445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002044861,"about_ca_system_score_gemma":0.001124023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001808598,"about_ca_topic_score_gemma":0.001376294,"domain_scores_codex":[0.9972376,0.0005272131,0.0001948811,0.0006558443,0.001210083,0.0001744086],"domain_scores_gemma":[0.9966383,0.001985735,0.00019425,0.0006335238,0.0004267649,0.0001214213],"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.0001044085,0.00006835144,0.0004566605,0.000340491,0.00003412509,0.0001185916,0.0004838742,0.08945018,0.002569415,0.6643083,0.01258001,0.2294855],"study_design_scores_gemma":[0.00002472953,0.00006916742,0.0001127787,0.00008481854,0.00001964809,0.0002000992,0.000170125,0.2539136,0.002102481,0.7054563,0.03781383,0.00003243939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002527324,0.0006251418,0.9887305,0.0004303822,0.000104487,0.0000553795,0.0001124441,0.0004439932,0.006970343],"genre_scores_gemma":[0.06421845,0.001374891,0.9230701,0.0002423759,0.000261828,0.0001885661,0.0005741592,0.0007447312,0.009324912],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01410594,"threshold_uncertainty_score":0.04718912,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2798648420","doi":"10.1137/1.9781611975994.32","title":"Individual Sensitivity Preprocessing for Data Privacy","year":2019,"lang":"en","type":"preprint","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Privacy-Preserving Technologies in Data","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":"Banff International Research Station for Mathematical Innovation and Discovery; National Science Foundation","keywords":"Sensitivity (control systems); Differential privacy; Computer science; Context (archaeology); Metric (unit); Data mining; Information sensitivity; Preprocessor; Lipschitz continuity; Aggregate (composite); Algorithm; Artificial intelligence; Mathematics; Computer security; Engineering","authors":[{"name":"Rachel Cummings","is_ca":false},{"name":"David Durfee","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1952656082023171,"gpt":0.324487288984756,"spread":0.1292216807824389,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008804136,0.001397277,0.001854678,0.001452589,0.001529298,0.005028213,0.003322286,0.002565468,0.009771568],"category_scores_gemma":[0.04595081,0.0009188408,0.00299516,0.003106104,0.003801443,0.009637497,0.008022103,0.006442652,0.003034266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00271937,"about_ca_system_score_gemma":0.003029812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008223143,"about_ca_topic_score_gemma":0.0007178194,"domain_scores_codex":[0.9853217,0.004105759,0.001066009,0.003256087,0.005350003,0.0009003644],"domain_scores_gemma":[0.9684386,0.01096075,0.001287551,0.01708415,0.001849861,0.00037917],"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.001166343,0.0002413373,0.004059512,0.000515812,0.0002450244,0.0004130475,0.0008850593,0.1045995,0.02538253,0.5263519,0.0128004,0.3233395],"study_design_scores_gemma":[0.00008902191,0.0002620177,0.001272929,0.0001040862,0.00008949733,0.0006941538,0.0001819871,0.358619,0.05189654,0.5620934,0.02458637,0.000111095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005535359,0.0001528361,0.9881788,0.0005736182,0.00005153363,0.0001511597,0.0003128486,0.002048174,0.002995543],"genre_scores_gemma":[0.3780334,0.0003706774,0.6118031,0.001341783,0.0002159508,0.0007231499,0.001055041,0.001199931,0.005257],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009771568,"threshold_uncertainty_score":0.0465613,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4403388697","doi":"10.1137/1.9781611978162","title":"Data-Driven Methods for Dynamic Systems","year":2024,"lang":"en","type":"book","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science","authors":[{"name":"Jason J. Bramburger","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.36870957484711,"gpt":0.4806720299855022,"spread":0.1119624551383923,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009116352,0.00118905,0.0008494225,0.0006795002,0.0002413356,0.00113816,0.001400829,0.0008390089,0.01508555],"category_scores_gemma":[0.002998409,0.0007289755,0.000692385,0.000927975,0.0006092826,0.001054375,0.001053413,0.00189168,0.005396614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004776701,"about_ca_system_score_gemma":0.0006709567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001370087,"about_ca_topic_score_gemma":0.001647793,"domain_scores_codex":[0.9994586,0.0001248143,0.00003360036,0.00006913386,0.0002959093,0.00001787661],"domain_scores_gemma":[0.9984798,0.001116141,0.0000283065,0.000145101,0.00020769,0.000022996],"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.00008369218,0.00007428575,0.0002783877,0.0009958878,0.0001043723,0.00009808758,0.0001357993,0.2035219,0.005241006,0.199654,0.05992723,0.5298853],"study_design_scores_gemma":[0.0000297668,0.00002281934,0.0001294173,0.0001103937,0.0000198589,0.00009934442,0.00002068184,0.6986509,0.002557175,0.1918675,0.1064734,0.00001870106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002529743,0.001287907,0.9918973,0.0001487247,0.0001595078,0.00002526932,0.0001696768,0.0007940487,0.005264509],"genre_scores_gemma":[0.04144258,0.004820968,0.9112828,0.0003822819,0.0002809243,0.0004625329,0.001300716,0.001307022,0.03872019],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01508555,"threshold_uncertainty_score":0.05046618,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4394717692","doi":"10.1137/1.9781611978032.65","title":"DimReg: Embedding Dimension Search via Regularization for Recommender Systems","year":2024,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Recommender Systems and Techniques","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":"University of Alberta","funders":"","keywords":"Embedding; Recommender system; Regularization (linguistics); Dimension (graph theory); Computer science; Mathematics; Artificial intelligence; Information retrieval; Pure mathematics","authors":[{"name":"Mingjun Zhao","is_ca":true},{"name":"L. Jiang","is_ca":true},{"name":"Yakun Yu","is_ca":true},{"name":"Xinmin Wang","is_ca":false},{"name":"Yuan Yi","is_ca":false},{"name":"Wei Zheng","is_ca":false},{"name":"Di Niu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08221299299143736,"gpt":0.2805718547332522,"spread":0.1983588617418148,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001300032,0.001346179,0.001408316,0.0008340335,0.0005515219,0.0008755461,0.001523769,0.001702619,0.002811987],"category_scores_gemma":[0.004453905,0.0006312092,0.0009689383,0.001178408,0.0006799508,0.001485288,0.001571333,0.002331334,0.001717246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006058496,"about_ca_system_score_gemma":0.0009712989,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003936669,"about_ca_topic_score_gemma":0.006907488,"domain_scores_codex":[0.9990785,0.0003851109,0.00004689397,0.0001744357,0.0002408361,0.00007418405],"domain_scores_gemma":[0.9986699,0.0006821327,0.000104877,0.0002608321,0.000225559,0.00005666021],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002401488,0.0002960964,0.00246564,0.0003259433,0.0002680756,0.0001735834,0.0001925863,0.4882834,0.01031216,0.02654913,0.02262659,0.4482667],"study_design_scores_gemma":[0.00001025168,0.00003095256,0.000106866,0.00000970559,0.00001020555,0.00002810691,0.00000902983,0.9925246,0.0006501571,0.005510072,0.001100183,0.000009891561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006842943,0.0006109396,0.9902322,0.0001939847,0.00005306652,0.00003569343,0.0001223268,0.001038571,0.0008703208],"genre_scores_gemma":[0.2701119,0.0007690546,0.720562,0.000553197,0.0002007962,0.0003020216,0.001168562,0.0003868204,0.005945699],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003936669,"threshold_uncertainty_score":0.009407043,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2899114640","doi":"10.1137/1.9781611975482.44","title":"Testing Halfspaces over Rotation-Invariant Distributions","year":2019,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Machine Learning and Algorithms","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":"University of Waterloo","funders":"","keywords":"Invariant (physics); Rotation (mathematics); Mathematics; Geometry; Mathematical physics","authors":[{"name":"Nathaniel Harms","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04968396008981972,"gpt":0.2504123407981213,"spread":0.2007283807083016,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003530256,0.0009244028,0.001301174,0.001540373,0.0006624738,0.001987638,0.002605029,0.001766196,0.00520922],"category_scores_gemma":[0.02858474,0.0006058337,0.001220932,0.001228638,0.002457368,0.004924884,0.004307293,0.001880904,0.001238566],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008945607,"about_ca_system_score_gemma":0.001102481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00121367,"about_ca_topic_score_gemma":0.0007252406,"domain_scores_codex":[0.9967018,0.0009274819,0.0002514929,0.0008485742,0.001021337,0.000249249],"domain_scores_gemma":[0.9815137,0.01387408,0.0009643958,0.00214643,0.001011531,0.0004899221],"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.001562618,0.0002278747,0.0149752,0.0003496362,0.0002696801,0.0003514669,0.0003897648,0.153973,0.01608875,0.1238419,0.00762209,0.680348],"study_design_scores_gemma":[0.0000819741,0.0002093577,0.001836063,0.00005852355,0.00002168438,0.000320569,0.0001370877,0.8087119,0.009508075,0.1767413,0.002330507,0.00004302242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0614151,0.0002898474,0.9338912,0.0003518472,0.00005126513,0.0001017398,0.000310487,0.001074068,0.002514339],"genre_scores_gemma":[0.5621533,0.0002307469,0.4316953,0.0004664153,0.0001088858,0.0003071591,0.001761097,0.0002971772,0.002979869],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00520922,"threshold_uncertainty_score":0.01866996,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4406142074","doi":"10.1137/1.9781611978322.94","title":"Almost Tight Bounds for Differentially Private Densest Subgraph","year":2025,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Cryptography and Data Security","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":"Institute of Particle Physics","funders":"","keywords":"Computer science; Combinatorics; Mathematics","authors":[{"name":"Michael Dinitz","is_ca":true},{"name":"Satyen Kale","is_ca":false},{"name":"Silvio Lattanzi","is_ca":false},{"name":"Sergei Vassilvitskii","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03839224740578789,"gpt":0.236894613695728,"spread":0.1985023662899401,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008563544,0.003133109,0.004043401,0.002075513,0.002661681,0.008164597,0.006455334,0.004487641,0.01165813],"category_scores_gemma":[0.04460887,0.001712178,0.002952922,0.004999328,0.007060478,0.02553634,0.01096245,0.01536248,0.003672964],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007615618,"about_ca_system_score_gemma":0.002971199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001082789,"about_ca_topic_score_gemma":0.00109178,"domain_scores_codex":[0.9893423,0.002700453,0.0003038253,0.002267853,0.004027718,0.001357793],"domain_scores_gemma":[0.9538065,0.0320156,0.001717316,0.009161944,0.00184023,0.001458301],"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.0008533257,0.000379627,0.001077821,0.0007869258,0.0001680765,0.0002323829,0.0004726679,0.09607822,0.005143377,0.7922878,0.02413568,0.07838424],"study_design_scores_gemma":[0.00006894337,0.0001025602,0.0002916751,0.0001175325,0.00008449542,0.0002897109,0.00007002686,0.1448824,0.003171534,0.8415591,0.00931831,0.00004376898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04264587,0.00750181,0.8706691,0.01093672,0.0006453281,0.0003057146,0.001201791,0.001682769,0.0644109],"genre_scores_gemma":[0.7258424,0.0101424,0.2198329,0.006727793,0.002640368,0.0008111201,0.001732168,0.001626845,0.03064399],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01165813,"threshold_uncertainty_score":0.05525541,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4388470009","doi":"10.1137/1.9781611977509","title":"Computational Discovery on Jupyter","year":2023,"lang":"en","type":"book","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Algorithms and Data Compression","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":"Impact; Western University","funders":"","keywords":"Computer science","authors":[{"name":"Neil J. Calkin","is_ca":true},{"name":"Eunice Y. S. Chan","is_ca":true},{"name":"Robert M. Corless","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06086778104871948,"gpt":0.2591464142571145,"spread":0.1982786332083951,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001299804,0.000565353,0.0006521306,0.001741173,0.004049077,0.003685704,0.0009882055,0.001107226,0.02153262],"category_scores_gemma":[0.006106284,0.0004299867,0.0009417179,0.001778046,0.005470766,0.006821118,0.004646651,0.003028282,0.002815622],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002659513,"about_ca_system_score_gemma":0.001277384,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005285519,"about_ca_topic_score_gemma":0.0046467,"domain_scores_codex":[0.9990174,0.0003728527,0.00002728885,0.0001969617,0.000250764,0.0001347041],"domain_scores_gemma":[0.9985338,0.0009562608,0.00005709448,0.0002028092,0.0001426248,0.0001073635],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004652245,0.00001010817,0.0001444927,0.00004241759,0.000007008805,0.0001266471,0.0004866351,0.00166728,0.0001488852,0.9613514,0.02268682,0.0132819],"study_design_scores_gemma":[0.00002124463,0.00001689723,0.0003167725,0.00006672624,0.00000829654,0.0001243742,0.0001263005,0.007399138,0.0004482848,0.7755846,0.2158654,0.00002195708],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.05915573,0.01465091,0.1953255,0.03875877,0.005283006,0.0001535534,0.001328773,0.00407743,0.6812663],"genre_scores_gemma":[0.6033949,0.006005906,0.1350482,0.004671643,0.002256182,0.0002844247,0.001467069,0.001609916,0.2452617],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.02153262,"threshold_uncertainty_score":0.07203382,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}