{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002051808,0.0008879844,0.002190363,0.0001352004,0.0008444411,0.0003290727,0.0004641397,0.002418995,0.00003713935],"category_scores_gemma":[0.0001862157,0.001008901,0.001107946,0.00008336317,0.0005390361,0.00006041443,0.0002810504,0.001051188,0.0001531988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002928237,"about_ca_system_score_gemma":0.000358054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003449102,"about_ca_topic_score_gemma":0.000001929381,"domain_scores_codex":[0.9954841,0.000007525902,0.002254977,0.00118203,0.0001713501,0.0008999761],"domain_scores_gemma":[0.9965734,0.0005895795,0.001712016,0.0006912509,0.0001528063,0.0002809269],"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.0001043976,0.0001375882,0.000003422198,0.002191749,0.0007706712,3.373277e-7,0.00444819,0.0002698289,0.00001382114,0.9685591,0.02172041,0.001780458],"study_design_scores_gemma":[0.005929655,0.0005908322,7.96224e-7,0.001505866,0.0007953856,0.000008281612,0.001884443,0.2485178,0.00003933588,0.4682076,0.2699583,0.002561775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.01898809,0.002948473,0.6209298,0.0001902864,0.009193021,0.01781684,0.01123061,0.0004292266,0.3182736],"genre_scores_gemma":[0.07447127,0.0006400911,0.08227325,0.0004860744,0.037727,0.002817199,0.001313796,0.001384615,0.7988867],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.5386565,"threshold_uncertainty_score":0.9992362,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003321155,0.0003336391,0.0004838174,0.00007636698,0.0001730724,0.0001256677,0.0003730584,0.0007717228,0.000004331727],"category_scores_gemma":[0.000006646912,0.0003228876,0.0002886981,0.00004001062,0.00009804989,0.00004928902,0.0001866857,0.000510933,0.00001287959],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001074024,"about_ca_system_score_gemma":0.0001735172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003316976,"about_ca_topic_score_gemma":0.000004148687,"domain_scores_codex":[0.9985196,0.000003617933,0.0004919677,0.0005080214,0.0002259613,0.0002508567],"domain_scores_gemma":[0.9989048,0.0001882876,0.0003749878,0.0003765236,0.00008902953,0.00006642373],"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.000007073621,0.00003138688,2.548909e-7,0.00007008681,0.00005498456,1.282875e-7,0.0005842725,0.000005182213,0.0001258075,0.9764934,0.002308247,0.02031918],"study_design_scores_gemma":[0.00165214,0.0001714989,7.676065e-7,0.0001514713,0.00006612382,0.000005059227,0.0001310304,0.004384097,0.001388559,0.9406642,0.05080504,0.0005799827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.0001234182,0.00003486858,0.5951776,0.000214138,0.0001129417,0.003501685,0.00004248826,0.0002695107,0.4005233],"genre_scores_gemma":[0.02549236,0.0001248666,0.3721786,0.0006879969,0.0005886266,0.001756994,0.00009178943,0.0002243611,0.5988544],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.2229989,"threshold_uncertainty_score":0.9999223,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002541416,0.0006769419,0.001408475,0.00009190453,0.0002742869,0.00008290503,0.0003406957,0.001381669,0.00006439478],"category_scores_gemma":[0.0004030851,0.0006094938,0.0007500326,0.00007895925,0.000316093,0.00003237824,0.0002112677,0.001169338,0.000009428783],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002001394,"about_ca_system_score_gemma":0.0004897533,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003296682,"about_ca_topic_score_gemma":0.00001116066,"domain_scores_codex":[0.997362,0.00005521233,0.001135165,0.0006016187,0.0003127184,0.0005333353],"domain_scores_gemma":[0.99485,0.003627821,0.000724715,0.0005307464,0.0001070734,0.0001596185],"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.00004237168,0.0002678632,4.628793e-7,0.001011848,0.0004504345,0.000001161765,0.009172854,9.772201e-7,0.00005673622,0.9536567,0.02129355,0.01404504],"study_design_scores_gemma":[0.00178913,0.00009317563,1.435124e-7,0.0003984111,0.0006034973,0.000006244475,0.0004615617,0.0008628652,0.0003445618,0.9142128,0.08060125,0.000626324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.0001549376,0.0001454791,0.483519,0.0001188157,0.0005729179,0.007104045,0.0005017429,0.0002848504,0.5075982],"genre_scores_gemma":[0.00001361674,0.000007158344,0.8013949,0.00005721635,0.0006856455,0.0006513405,0.00005861539,0.0001809488,0.1969505],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3178759,"threshold_uncertainty_score":0.9999148,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0007933201,0.000470001,0.0007125772,0.00005959753,0.0001182877,0.00006448643,0.0003481173,0.001978148,0.00001349814],"category_scores_gemma":[0.00008732214,0.0004031984,0.0004494356,0.000033454,0.0006906372,0.000001508669,0.0003104646,0.0005590374,0.00001216866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005382895,"about_ca_system_score_gemma":0.0005956726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000264235,"about_ca_topic_score_gemma":0.00001147277,"domain_scores_codex":[0.9977329,0.00001056612,0.0008386942,0.0004935283,0.0002958165,0.0006284593],"domain_scores_gemma":[0.9988823,0.0001493128,0.0002884562,0.0004076871,0.00008174159,0.0001905119],"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.0002451304,0.0007087126,0.00001162976,0.003806998,0.001019907,0.000002834824,0.001184219,0.000005464733,0.0155399,0.1651083,0.7535269,0.05884],"study_design_scores_gemma":[0.005159401,0.0006869049,0.000001518892,0.0003635366,0.0002895941,0.00001505526,0.0004937188,0.0004365348,0.004348852,0.2960675,0.6909837,0.001153678],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.006397318,0.0005666336,0.01040235,0.0002765261,0.0004186805,0.005842905,0.001119758,0.00007378275,0.974902],"genre_scores_gemma":[0.003393375,0.0002639853,0.0516107,0.0005627227,0.004264862,0.0008977951,0.003395042,0.0002846716,0.9353268],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.1309592,"threshold_uncertainty_score":0.999842,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000603926,0.0003872932,0.0006577024,0.00004488062,0.0001743246,0.0002373451,0.0004310851,0.0008733916,0.00001148901],"category_scores_gemma":[0.00001166235,0.0003571782,0.00030338,0.00003153491,0.0001073993,0.00006603199,0.0002068776,0.0004331552,0.00001046668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009381562,"about_ca_system_score_gemma":0.00009592346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006481412,"about_ca_topic_score_gemma":0.000005102816,"domain_scores_codex":[0.9981385,0.000004405369,0.0006497151,0.0005466234,0.0003265172,0.0003342351],"domain_scores_gemma":[0.9987901,0.00008966867,0.000481145,0.0004682997,0.00007025733,0.0001004598],"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.00001604713,0.00002861499,0.000001234617,0.0002724482,0.00005728397,6.702824e-7,0.001218227,0.000002642561,0.00003891181,0.9868592,0.006144921,0.005359807],"study_design_scores_gemma":[0.004647712,0.0003199012,0.000004641973,0.001601891,0.00007719134,0.00001319377,0.0002150644,0.005024127,0.0003399989,0.6965898,0.2897772,0.001389217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.001965083,0.00006124529,0.1923689,0.0002631131,0.0008635006,0.07088566,0.0006965511,0.0005674649,0.7323285],"genre_scores_gemma":[0.01563138,0.00001286986,0.4730386,0.0003881873,0.005168847,0.03133599,0.0004005799,0.0004203107,0.4736033],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.2902694,"threshold_uncertainty_score":0.999888,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004575599,0.0004140169,0.000478674,0.00005679216,0.001093658,0.0004711151,0.0006746002,0.0004582271,0.000003601082],"category_scores_gemma":[0.00001423761,0.0003311193,0.0003797387,0.00006918407,0.0002410977,0.00003806387,0.0007125335,0.0005602756,0.000003836838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003691698,"about_ca_system_score_gemma":0.0001276527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.112951e-7,"about_ca_topic_score_gemma":0.000004082785,"domain_scores_codex":[0.9981308,0.000004883136,0.0004761717,0.0006632088,0.0003429732,0.0003819809],"domain_scores_gemma":[0.9981788,0.0006844142,0.0002272355,0.0005873007,0.0001147803,0.0002074244],"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.000002722848,0.00001233819,7.308305e-9,0.00007873901,0.0001484366,3.214341e-7,0.0006835829,8.592738e-7,0.00006303012,0.8469788,0.0008686967,0.1511624],"study_design_scores_gemma":[0.0005944316,0.00005240958,8.343248e-8,0.0001117445,0.00009355696,0.00001398357,0.0002702844,0.002565349,0.0001628352,0.7905896,0.2050778,0.0004679075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009009497,0.002172025,0.8648192,0.001709621,0.0006274649,0.006955847,0.0003470436,0.0003524434,0.1229262],"genre_scores_gemma":[0.0006390613,0.001572111,0.5446129,0.001433302,0.00186465,0.004303711,0.0001315929,0.0002708847,0.4451718],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3222456,"threshold_uncertainty_score":0.9999141,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008907375,0.0005238846,0.0006936801,0.0001175913,0.0002819694,0.0001940664,0.0006581479,0.0008079996,0.00001215149],"category_scores_gemma":[0.00003914048,0.0004848743,0.0005601998,0.00003996053,0.0002163043,0.00004120638,0.0005125208,0.000486118,0.00001523972],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006256791,"about_ca_system_score_gemma":0.00007400569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.850077e-7,"about_ca_topic_score_gemma":3.46411e-7,"domain_scores_codex":[0.9978765,0.000004588739,0.0006588539,0.000702209,0.0003603659,0.0003974458],"domain_scores_gemma":[0.9980335,0.0005420882,0.0004985719,0.0006512264,0.000105001,0.0001696509],"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.000003585969,0.000009397396,1.032517e-8,0.00009055757,0.0001530877,4.387531e-7,0.00117971,0.000003719767,0.00005617593,0.9526296,0.002806386,0.04306731],"study_design_scores_gemma":[0.0006848773,0.0001082593,2.132169e-8,0.0001876675,0.0001548329,0.000006249515,0.00006018203,0.006118124,0.001055881,0.9477555,0.04326235,0.0006060564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000001589212,0.00002950433,0.767551,0.0001150452,0.0004174613,0.001613232,0.00004544709,0.0006699233,0.2295568],"genre_scores_gemma":[0.00002392516,0.00003404835,0.8240517,0.0001483852,0.0003320047,0.0003323032,0.0000250049,0.0001260994,0.1749265],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0565007,"threshold_uncertainty_score":0.9997603,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005819257,0.0005356785,0.0006678784,0.00008254775,0.0005637747,0.0002786807,0.0006507331,0.0007383644,0.00003759318],"category_scores_gemma":[0.000009507971,0.0005069984,0.0005518908,0.00004496853,0.0003545184,0.00008836967,0.0004428967,0.0005232021,0.0000185201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007300894,"about_ca_system_score_gemma":0.0001073213,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001583647,"about_ca_topic_score_gemma":0.000002171287,"domain_scores_codex":[0.9976805,0.000005833507,0.0007634539,0.0006843595,0.0004609874,0.0004048461],"domain_scores_gemma":[0.998233,0.0002782283,0.0006931766,0.0005513775,0.0001001928,0.0001440542],"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.00001109763,0.00003573211,4.087511e-8,0.0002765615,0.0002686631,6.093522e-7,0.003938602,3.11028e-7,0.0002843028,0.835616,0.007536931,0.1520312],"study_design_scores_gemma":[0.001497224,0.0001310994,5.352751e-8,0.0002239131,0.0001414733,0.00001242102,0.0001735272,0.01600534,0.001338995,0.9520742,0.02775749,0.000644256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002527458,0.00007603497,0.5742906,0.00009683082,0.000558222,0.002486198,0.00009371306,0.0004017013,0.4217439],"genre_scores_gemma":[0.0002971847,0.00002328901,0.8489183,0.000310022,0.002322282,0.0003302544,0.0001391728,0.0001396061,0.1475199],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2746276,"threshold_uncertainty_score":0.9997382,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000436818,0.0001485398,0.0001906882,0.00002026622,0.0002397809,0.0002036142,0.0002260573,0.0001531564,0.000002894352],"category_scores_gemma":[0.00002063302,0.0001239279,0.00008060815,0.00003548185,0.00009531654,0.0000645626,0.0002064904,0.0001145116,0.000002521695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001128801,"about_ca_system_score_gemma":0.00002436722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003125185,"about_ca_topic_score_gemma":7.598421e-8,"domain_scores_codex":[0.9991994,0.00001098574,0.0002272388,0.0002536762,0.0001037969,0.0002049069],"domain_scores_gemma":[0.9993821,0.0001836455,0.0001116931,0.0002005262,0.00003560009,0.00008647748],"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.000009410197,0.0001322137,0.00000693199,0.00009449903,0.0001153397,1.372885e-7,0.01182283,0.00001803748,0.007266749,0.9062899,0.007776445,0.06646745],"study_design_scores_gemma":[0.006909463,0.0002791787,0.00001759271,0.0001595353,0.0000805421,0.00001556234,0.003855067,0.2360331,0.06808188,0.6792027,0.004067995,0.001297356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01566202,0.00004603709,0.9801925,0.00006707304,0.00006508244,0.000904598,0.000002358805,0.0002638562,0.002796427],"genre_scores_gemma":[0.0965407,0.000007981084,0.9016762,0.0002713735,0.0000862256,0.0002800713,0.000002166475,0.00001591936,0.001119412],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2360151,"threshold_uncertainty_score":0.5053633,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002229725,0.000166508,0.0002723376,0.00001288908,0.0002983632,0.0002474972,0.0003467131,0.0001775929,0.00000642155],"category_scores_gemma":[0.00001861604,0.0001396191,0.0001804233,0.00006930091,0.00006874368,0.00007350959,0.0004171095,0.0001741236,0.000003199012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000135124,"about_ca_system_score_gemma":0.00009445684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002274816,"about_ca_topic_score_gemma":0.000001158848,"domain_scores_codex":[0.998923,0.000006910908,0.0002651119,0.0003446289,0.0002054359,0.0002549216],"domain_scores_gemma":[0.9990888,0.0002303026,0.0001119546,0.0004063848,0.00005957334,0.0001029942],"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.00001112223,0.0001833379,0.000002396144,0.000118787,0.0001276826,0.000002481671,0.003025231,0.00001775113,0.01687501,0.8587773,0.02533747,0.0955214],"study_design_scores_gemma":[0.01063806,0.0002231791,0.00001575556,0.0003093573,0.0002031314,0.00005485885,0.003828952,0.1455541,0.1746322,0.442821,0.2201766,0.001542815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01477678,0.000127755,0.9693556,0.0004115436,0.0004264753,0.0007562273,0.00008440802,0.0002581791,0.01380299],"genre_scores_gemma":[0.05529948,0.0000230227,0.940127,0.0005505056,0.0007962716,0.0001974535,0.00007195917,0.00003962531,0.00289472],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4159563,"threshold_uncertainty_score":0.5693502,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005549238,0.0003416898,0.000930646,0.000115793,0.00018858,0.0001990977,0.00009362392,0.0003783834,0.000004413082],"category_scores_gemma":[0.00003849962,0.0003270568,0.0003506704,0.00003633359,0.00006396469,0.00005852406,0.0001123569,0.0003116379,0.000001010367],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006560616,"about_ca_system_score_gemma":0.00004827935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003781447,"about_ca_topic_score_gemma":0.0000491352,"domain_scores_codex":[0.9982254,9.056753e-7,0.0008568215,0.0005968011,0.00006226492,0.0002578049],"domain_scores_gemma":[0.9988782,0.0001882218,0.0006360304,0.0002125368,0.00002661468,0.00005842311],"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.0001113589,0.00001014909,0.000003942335,0.0009754876,0.0002675801,6.488776e-7,0.001611196,0.0002098357,0.000009729904,0.9925951,0.0004064972,0.00379844],"study_design_scores_gemma":[0.00186632,0.00007096254,6.218601e-7,0.0007096271,0.0001875441,0.000006143009,0.0005346645,0.2347549,0.00001749575,0.7438637,0.01740569,0.0005823401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.04288677,0.002633585,0.1400057,0.0006328414,0.0005147571,0.01027777,0.003210332,0.0002054399,0.7996328],"genre_scores_gemma":[0.04127759,0.000265833,0.1917,0.000133324,0.002604618,0.001341998,0.0003462515,0.0005783751,0.7617521],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.2487314,"threshold_uncertainty_score":0.9999182,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0003939587,0.0004955262,0.000497493,0.0000196917,0.000190242,0.00006074202,0.0001877816,0.001792834,0.00003193535],"category_scores_gemma":[0.000006774615,0.0004432961,0.0005302458,0.000007205819,0.000185078,0.000001667744,0.0001821334,0.0005398323,0.00001808566],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002632179,"about_ca_system_score_gemma":0.00007912166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.886732e-7,"about_ca_topic_score_gemma":8.526728e-7,"domain_scores_codex":[0.9985664,0.000002769975,0.0005068608,0.0003478042,0.0001540485,0.000422156],"domain_scores_gemma":[0.9989007,0.0000638001,0.0004032009,0.0004161079,0.00004243661,0.0001737416],"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.0002628716,0.0000714495,4.187191e-7,0.0003125271,0.00111604,3.643698e-7,0.0004780894,0.0002165191,0.0006729531,0.7490393,0.1886182,0.05921131],"study_design_scores_gemma":[0.002163722,0.0003439474,1.195593e-7,0.0001904549,0.0004084265,0.000009670083,0.0001069399,0.0008231843,0.001201644,0.04782257,0.9459406,0.0009887263],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000632312,0.0007929517,0.02246084,0.00006665802,0.0007620889,0.003101056,0.0004397577,0.0000560786,0.9716883],"genre_scores_gemma":[0.03039045,0.001415918,0.02381932,0.003860081,0.01905874,0.0005773688,0.002926823,0.0006979565,0.9172533],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.7573224,"threshold_uncertainty_score":0.9998019,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002193856,0.0008703736,0.001795414,0.00007105309,0.0004648537,0.0001801266,0.0003170847,0.001726699,0.000007641454],"category_scores_gemma":[0.0002229123,0.0007746713,0.001554954,0.00002262971,0.0002287369,0.00003218039,0.0002164361,0.0008074653,2.174298e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001315865,"about_ca_system_score_gemma":0.000258083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002218843,"about_ca_topic_score_gemma":0.000004209292,"domain_scores_codex":[0.9969695,0.000007486515,0.001199164,0.0007766272,0.0003390707,0.0007081159],"domain_scores_gemma":[0.9952804,0.002636525,0.001087734,0.0005624066,0.0002288131,0.000204101],"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.0005077296,0.00006520746,6.016715e-8,0.004396945,0.00107357,2.633517e-7,0.00175455,7.32678e-7,0.002076162,0.9274725,0.003210208,0.05944207],"study_design_scores_gemma":[0.01196561,0.0004484732,2.272202e-9,0.0007094872,0.001749611,0.000008678801,0.000687125,0.001863831,0.001717616,0.4346321,0.5449114,0.001306057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007366858,0.0002124627,0.7256223,0.0001494223,0.001380417,0.02834894,0.0007576096,0.000567899,0.2422242],"genre_scores_gemma":[0.00008198529,0.00002149169,0.6701786,0.0001051529,0.001780482,0.001369416,0.0001133075,0.0003830178,0.3259666],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5417012,"threshold_uncertainty_score":0.9995693,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009881023,0.0005858963,0.0007689472,0.00006636935,0.0007583533,0.0004365234,0.0007155188,0.0009592808,0.00002371193],"category_scores_gemma":[0.00001582379,0.0005197135,0.0008439575,0.00003006855,0.0004288715,0.0000789561,0.0002816177,0.0004312629,0.00001624006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004743629,"about_ca_system_score_gemma":0.0001356481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.933792e-7,"about_ca_topic_score_gemma":0.000001272243,"domain_scores_codex":[0.9977531,0.000004621685,0.0006607409,0.0007099055,0.0003350651,0.000536599],"domain_scores_gemma":[0.9980989,0.0004739624,0.0005721799,0.0005642375,0.0001378734,0.0001529243],"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.00003606966,0.00002990502,3.282105e-8,0.0003312764,0.0003241379,6.963768e-7,0.001846072,6.057003e-7,0.0003108863,0.9751057,0.006461086,0.01555356],"study_design_scores_gemma":[0.001789326,0.0001503287,2.340919e-8,0.0002316877,0.0002155947,0.000009735045,0.00009485067,0.002509479,0.0007182276,0.8672886,0.1263571,0.0006350931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008340748,0.0001948367,0.8232542,0.0001855123,0.001851938,0.005815392,0.0004445725,0.000480623,0.1669389],"genre_scores_gemma":[0.001814196,0.00003393365,0.5884365,0.0006612187,0.005961883,0.0008997142,0.0001176428,0.0003734433,0.4017015],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2348177,"threshold_uncertainty_score":0.9997255,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001412667,0.0004030772,0.0004457743,0.00001194014,0.0001514726,0.00005317993,0.000179984,0.0009231013,0.00001281695],"category_scores_gemma":[0.00000759536,0.0003823378,0.0005444716,0.000006065579,0.0001564974,8.148072e-7,0.0001153571,0.0003002727,0.00000600393],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002197506,"about_ca_system_score_gemma":0.0001111693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.071237e-7,"about_ca_topic_score_gemma":0.000001203193,"domain_scores_codex":[0.9987274,0.000002068456,0.0003857489,0.000474039,0.0001734222,0.0002373583],"domain_scores_gemma":[0.9993405,0.00002849471,0.0002072876,0.0002474851,0.00003412486,0.0001421522],"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.0002928694,0.0001227388,7.972924e-7,0.001021784,0.002084316,0.000001735643,0.001072461,0.000004442746,0.3843557,0.5098914,0.07618771,0.02496402],"study_design_scores_gemma":[0.003230301,0.0004403253,5.366958e-8,0.0001369814,0.0005828338,0.000006247354,0.0001898604,0.00006416522,0.1046818,0.06139603,0.8283266,0.0009447878],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.005646669,0.001023039,0.01173922,0.0005587807,0.001025624,0.005758619,0.001193751,0.0001656837,0.9728886],"genre_scores_gemma":[0.05204131,0.0009294814,0.05392842,0.003754535,0.01125642,0.0007194846,0.002370263,0.0009414343,0.8740587],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.7521389,"threshold_uncertainty_score":0.9998628,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000636184,0.0005214308,0.0008393312,0.00005294434,0.0004182638,0.0002486766,0.0004111366,0.0006282803,0.000007530751],"category_scores_gemma":[0.00001041332,0.0004238477,0.0002971897,0.00003737257,0.0007893863,0.00005835623,0.0003269589,0.000696666,0.000004732163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003169546,"about_ca_system_score_gemma":0.0002700466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003986748,"about_ca_topic_score_gemma":0.00000641846,"domain_scores_codex":[0.9981599,0.0000095264,0.0004706335,0.0006517816,0.0003229524,0.0003851462],"domain_scores_gemma":[0.9982001,0.0005790466,0.0004253248,0.0005343175,0.0001000866,0.0001611443],"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.00009375919,0.00002687174,0.000001101316,0.000241666,0.0003066756,0.000001136918,0.001091697,0.000003827774,0.00007372176,0.991854,0.001166259,0.005139248],"study_design_scores_gemma":[0.004692953,0.0008180893,3.323485e-7,0.00097611,0.0004916455,0.00007479998,0.0006979243,0.005303655,0.0005583384,0.9339789,0.05097992,0.001427378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.005504504,0.0003487199,0.1988924,0.0002387187,0.0006840753,0.006123975,0.0004593323,0.0007123012,0.787036],"genre_scores_gemma":[0.05368249,0.0002894082,0.6805475,0.001534763,0.001787537,0.0004156533,0.0001627139,0.0005561469,0.2610238],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.5260122,"threshold_uncertainty_score":0.9998213,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004403893,0.0003896394,0.0004275387,0.00007449784,0.0003729174,0.0002344665,0.0001704111,0.0003721989,0.00008244596],"category_scores_gemma":[0.00001861383,0.0003347243,0.0002764901,0.00002372293,0.0001684711,0.00009710177,0.0001379343,0.0001648798,0.00002568446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004164174,"about_ca_system_score_gemma":0.00003215993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005150407,"about_ca_topic_score_gemma":0.00002263569,"domain_scores_codex":[0.9986099,4.534409e-7,0.0004554939,0.000413969,0.0002449216,0.0002752585],"domain_scores_gemma":[0.9992226,0.00003827752,0.0003051657,0.0002501706,0.0001618773,0.00002195149],"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.0001271212,0.0000306011,3.032022e-7,0.003448427,0.0004358817,5.929995e-8,0.0005437328,0.0000224219,0.00003258849,0.9440001,0.03136708,0.01999166],"study_design_scores_gemma":[0.00221404,0.00004606807,7.4327e-8,0.0002722702,0.0006263589,3.303764e-7,0.00119443,0.01224133,0.00005473208,0.1313386,0.8513816,0.0006301117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0008474971,0.00002968751,0.1765582,0.0004294512,0.0006529908,0.0085821,0.0001053094,0.0003744701,0.8124203],"genre_scores_gemma":[0.004783679,0.00002670677,0.144385,0.002578537,0.01206701,0.003196205,0.001418833,0.0005835303,0.8309605],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.8200145,"threshold_uncertainty_score":0.9999105,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001060064,0.0002868625,0.000470749,0.00003803775,0.000272466,0.0001160703,0.0004800644,0.000353875,0.000005125669],"category_scores_gemma":[0.00005352723,0.0001925043,0.0002650284,0.00002196605,0.000284479,0.00003285149,0.0003905709,0.0005978212,0.000003015531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002070168,"about_ca_system_score_gemma":0.0001013347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.072436e-7,"about_ca_topic_score_gemma":1.941475e-7,"domain_scores_codex":[0.9986404,0.00000839951,0.0003771575,0.0003714587,0.0003471367,0.0002554388],"domain_scores_gemma":[0.9973093,0.00166099,0.0004155702,0.0004945848,0.00006203847,0.00005757558],"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.00001204124,0.000005322373,8.96073e-8,0.00009697547,0.0001151856,1.49275e-7,0.001571632,0.000007429618,0.0003292256,0.9900641,0.0003278915,0.007469885],"study_design_scores_gemma":[0.0006406958,0.0001006823,6.353952e-8,0.0002517449,0.00004945208,0.000003215456,0.0003219144,0.002731363,0.001290092,0.9922788,0.002099516,0.0002324192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.002227941,0.000110538,0.1838292,0.000472382,0.000261129,0.005116026,0.00008745986,0.0001284902,0.8077668],"genre_scores_gemma":[0.1351789,0.0001006988,0.1377329,0.0008944752,0.001321958,0.0004299714,0.00002484217,0.0004071335,0.7239091],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.132951,"threshold_uncertainty_score":0.7850097,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001000825,0.0006699264,0.0008630072,0.0001236778,0.0005879872,0.0003877849,0.0008822827,0.0009437252,0.0000102704],"category_scores_gemma":[0.00003661794,0.0005676397,0.000462082,0.0001037651,0.0004974744,0.0001025656,0.0005770732,0.001210855,0.00003072679],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001208135,"about_ca_system_score_gemma":0.0003344541,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004641232,"about_ca_topic_score_gemma":0.0000156667,"domain_scores_codex":[0.9968322,0.00001077684,0.000577013,0.0009289402,0.0009057279,0.0007453723],"domain_scores_gemma":[0.9975473,0.0006338254,0.000493221,0.0008626467,0.0002119646,0.0002509985],"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.00004394635,0.00002470224,5.73054e-7,0.000160511,0.0003824436,0.000006135601,0.001320014,0.000002682043,0.0001455108,0.9748842,0.000969042,0.02206025],"study_design_scores_gemma":[0.002212696,0.0001449644,1.776609e-7,0.0002964808,0.0001253161,0.00002013325,0.0003422757,0.0008422923,0.000758823,0.9887339,0.005797698,0.0007251868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.003185661,0.00002656614,0.09530932,0.0003282626,0.0006070749,0.008781871,0.0002822643,0.001399758,0.8900792],"genre_scores_gemma":[0.01849133,0.00009255069,0.3447486,0.0007211227,0.001831179,0.002275286,0.0001813351,0.001230763,0.6304278],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.2596514,"threshold_uncertainty_score":0.9996775,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003909886,0.0003445681,0.0005327701,0.00006504761,0.0002386233,0.0004474444,0.0004006033,0.0009027137,0.000001661377],"category_scores_gemma":[0.00001097635,0.0003172168,0.0003695763,0.000007651823,0.00008141656,0.0002252366,0.0001664711,0.0002780315,0.000002413084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000955043,"about_ca_system_score_gemma":0.00009451416,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002135231,"about_ca_topic_score_gemma":0.00000480863,"domain_scores_codex":[0.9984859,0.000001700726,0.0005578446,0.0004714768,0.0002298543,0.0002532328],"domain_scores_gemma":[0.9987376,0.0001257363,0.0005161182,0.0004588337,0.0000815169,0.00008016408],"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.00003379485,0.00004687065,5.838066e-7,0.0004131971,0.0001413494,3.43737e-7,0.003516244,0.00001311041,0.0001302723,0.8818391,0.04136369,0.07250147],"study_design_scores_gemma":[0.00182629,0.00009820667,1.363934e-7,0.0005021307,0.00008107736,0.000004750848,0.0001029734,0.1321665,0.0002028729,0.8374165,0.02709304,0.0005055626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.00009246932,0.00002334941,0.9277806,0.0001061775,0.0003530221,0.003568753,0.0006834312,0.000264909,0.06712727],"genre_scores_gemma":[0.02215077,0.000149282,0.3840966,0.0004533108,0.005619248,0.004845858,0.002106372,0.0005284174,0.5800501],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.543684,"threshold_uncertainty_score":0.999928,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006425089,0.0004245547,0.0007644227,0.00005765809,0.0002075209,0.0002978227,0.0005629834,0.0004376781,0.000005855976],"category_scores_gemma":[0.00001037795,0.0003725849,0.0003517017,0.00002628269,0.0002194425,0.0001498864,0.0004379998,0.0002573412,0.000001807651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002802025,"about_ca_system_score_gemma":0.000119411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002214088,"about_ca_topic_score_gemma":0.000002216782,"domain_scores_codex":[0.998154,0.000002378294,0.0005767792,0.0005939738,0.0003197567,0.0003530954],"domain_scores_gemma":[0.9984385,0.0003228834,0.0005524768,0.0005127148,0.00008069137,0.00009268305],"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.00001789601,0.00002873814,1.767158e-7,0.0007398047,0.0002881158,2.498081e-7,0.0005834782,9.707361e-7,0.00004839765,0.9114979,0.009436029,0.07735826],"study_design_scores_gemma":[0.003241551,0.0003720928,1.116425e-7,0.0004109248,0.0003364039,0.000002129379,0.0003396143,0.006713943,0.0004809726,0.43845,0.548854,0.0007982839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.0002146898,0.0003266456,0.485808,0.0001898657,0.001279518,0.00665076,0.00167238,0.0002041578,0.5036539],"genre_scores_gemma":[0.0004215933,0.0002734091,0.5288581,0.000296281,0.001076224,0.0002499852,0.0002279512,0.0001650207,0.4684314],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.539418,"threshold_uncertainty_score":0.9998726,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004391482,0.0005026571,0.0007769522,0.00006844645,0.0004491702,0.0003455545,0.0006335208,0.0009077949,0.00003029534],"category_scores_gemma":[0.00001934633,0.0005248792,0.0006336785,0.00005538174,0.0002343092,0.0000698109,0.0005296003,0.0006033481,0.000006137143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006002972,"about_ca_system_score_gemma":0.000176427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002176594,"about_ca_topic_score_gemma":0.000002590888,"domain_scores_codex":[0.9977592,0.000006270945,0.0006312359,0.0007360718,0.0004835719,0.0003836955],"domain_scores_gemma":[0.9982508,0.0002940065,0.0004482551,0.0007071152,0.0001491704,0.0001506889],"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.000005215248,0.00003818802,3.699871e-8,0.0002167389,0.0002448877,0.000001335138,0.0006991292,0.000004646642,0.0001795077,0.9433398,0.0009510414,0.05431946],"study_design_scores_gemma":[0.001232454,0.00005421299,9.103286e-8,0.0002618429,0.0001977488,0.00001400702,0.00007345049,0.005245895,0.001629639,0.9694469,0.02116214,0.000681648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00006527119,0.000179914,0.7929792,0.000191102,0.0006531299,0.001660123,0.0001245832,0.0002461266,0.2039006],"genre_scores_gemma":[0.000507186,0.000100486,0.8055805,0.0006930863,0.00221739,0.0003659189,0.000451082,0.0002271556,0.1898572],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05363781,"threshold_uncertainty_score":0.9997203,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006912344,0.000391841,0.0006754061,0.0000970192,0.0002084666,0.00009563945,0.0007074067,0.0007149311,0.00002039313],"category_scores_gemma":[0.00002720025,0.0003530218,0.0004966337,0.00003842479,0.0005539403,0.00006567768,0.0004348689,0.0004181645,0.000008214742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005304085,"about_ca_system_score_gemma":0.0001693505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.86547e-7,"about_ca_topic_score_gemma":8.767021e-7,"domain_scores_codex":[0.9980317,0.000005820333,0.0006246386,0.0005250121,0.0004563139,0.0003565318],"domain_scores_gemma":[0.9981664,0.0003509865,0.0006071766,0.000610484,0.0001368068,0.0001281122],"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.00005359421,0.00003283853,5.086653e-8,0.0003567858,0.0002118205,2.325625e-7,0.002573905,7.616014e-7,0.001751259,0.9479612,0.008502777,0.03855474],"study_design_scores_gemma":[0.002421103,0.0003345275,4.652561e-8,0.0002559976,0.0001373215,0.000007215175,0.0002661971,0.001591782,0.01357824,0.9490414,0.03174842,0.000617783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.000952962,0.00008647997,0.2804193,0.00008317584,0.0003864163,0.004519348,0.0002205793,0.0002422592,0.7130895],"genre_scores_gemma":[0.004189737,0.00003333633,0.5805577,0.0001299546,0.002411915,0.0005244988,0.00008120835,0.0002461298,0.4118255],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.301264,"threshold_uncertainty_score":0.9998922,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007432368,0.000418871,0.0006207594,0.00005734554,0.000732515,0.0008887138,0.0007602794,0.0006661973,0.0000238185],"category_scores_gemma":[0.00001135771,0.0003810507,0.0007030923,0.00001133312,0.0002065839,0.00008112329,0.0003707378,0.0003395346,0.00002383481],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000699576,"about_ca_system_score_gemma":0.0001139802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001133218,"about_ca_topic_score_gemma":5.622606e-7,"domain_scores_codex":[0.9979076,0.000003757941,0.0006842964,0.0006520257,0.0004393269,0.0003129451],"domain_scores_gemma":[0.9977635,0.0001350922,0.001000545,0.0008745381,0.00009697185,0.0001293425],"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.000004286049,0.00001864905,0.000001130926,0.00007579711,0.0003424897,3.371407e-7,0.000817137,0.000001308101,0.0003226165,0.9747123,0.01308278,0.01062123],"study_design_scores_gemma":[0.003076602,0.00007288458,0.000002301511,0.0003523596,0.0004000994,0.000006372487,0.0002532928,0.005671746,0.001467482,0.5240075,0.4635934,0.001095918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0005456221,0.00008696204,0.1358672,0.0003727133,0.0007836267,0.002342121,0.00007343748,0.0002193509,0.859709],"genre_scores_gemma":[0.001113325,0.00004740302,0.1929896,0.0001945692,0.001450952,0.0002147545,0.0001446533,0.0001057124,0.803739],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.4507047,"threshold_uncertainty_score":0.9998642,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008962292,0.0002398345,0.000605639,0.00008038457,0.0001592269,0.0001269566,0.0005230156,0.0004140566,0.00001972116],"category_scores_gemma":[0.0000630096,0.0001529078,0.000262779,0.00008205874,0.0003743623,0.00003638947,0.0002550742,0.0002817294,0.000002322457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009275324,"about_ca_system_score_gemma":0.00003844726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004828833,"about_ca_topic_score_gemma":0.000008767574,"domain_scores_codex":[0.9986988,0.000008447191,0.0005267006,0.0003391503,0.0002346823,0.0001922514],"domain_scores_gemma":[0.9976983,0.001425955,0.0003941242,0.0003724608,0.0000589823,0.00005019647],"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.00001848101,0.00004015987,0.000001845807,0.0001320157,0.000203979,4.534553e-7,0.002822673,0.000001621131,0.00001919923,0.9695346,0.01042387,0.01680114],"study_design_scores_gemma":[0.002601379,0.0001116526,0.000001720357,0.0001075219,0.0002876165,0.000002939815,0.0004557535,0.0007942922,0.00009987023,0.9006645,0.09453906,0.0003336928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.002655732,0.0007620386,0.3475749,0.001246873,0.0004416473,0.005607318,0.001617157,0.0001483205,0.639946],"genre_scores_gemma":[0.08624083,0.001083768,0.2913266,0.002310249,0.004896696,0.001196082,0.0009665888,0.0002535037,0.6117257],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.08411519,"threshold_uncertainty_score":0.62354,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006483835,0.0006286374,0.001112008,0.00007509621,0.0006357829,0.0001924236,0.000285857,0.0005627375,0.0001273631],"category_scores_gemma":[0.000005073284,0.0005581723,0.001517911,0.00002378469,0.0003003377,0.00002138925,0.0001186246,0.0005172833,0.000004672822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000465885,"about_ca_system_score_gemma":0.00008391047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003077687,"about_ca_topic_score_gemma":0.000001858675,"domain_scores_codex":[0.9979778,0.00000511221,0.0007077586,0.0005985239,0.0002839846,0.0004268207],"domain_scores_gemma":[0.9981302,0.000498169,0.0006570158,0.0004868376,0.0001042456,0.0001235265],"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.0001266523,0.00003787925,3.504389e-7,0.0001476306,0.001047606,6.817652e-8,0.0006949518,0.000001984573,0.0001658281,0.9318088,0.04887629,0.01709193],"study_design_scores_gemma":[0.002934225,0.0001259606,1.538018e-8,0.0003536246,0.0007974066,3.402683e-7,0.0001535521,0.0004164003,0.001285646,0.7994016,0.193998,0.0005332344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.002156471,0.0000883691,0.1323469,0.000101622,0.0004405806,0.008566343,0.0009393147,0.0003825334,0.8549779],"genre_scores_gemma":[0.06209801,0.00003401653,0.1389153,0.0005836647,0.02135235,0.00411663,0.00226896,0.001186373,0.7694448],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.1451218,"threshold_uncertainty_score":0.999687,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005709008,0.0004641898,0.0006746121,0.00003686437,0.0003430469,0.0003129735,0.001616065,0.0008375549,0.00001388778],"category_scores_gemma":[0.00001225996,0.0003833711,0.0002847844,0.00001585855,0.0001414735,0.00007602514,0.001924163,0.0005640537,0.00001649706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003048077,"about_ca_system_score_gemma":0.0001298509,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002216545,"about_ca_topic_score_gemma":0.00000138535,"domain_scores_codex":[0.9978752,0.000003396011,0.0005323238,0.0008324714,0.0004189862,0.0003375956],"domain_scores_gemma":[0.9973965,0.0002757828,0.0004658657,0.001634945,0.00006142206,0.00016554],"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.000006005173,0.00001217733,2.644394e-8,0.0001628569,0.000136922,5.440905e-7,0.0002280112,0.000001090345,0.0000141634,0.8175402,0.06082704,0.121071],"study_design_scores_gemma":[0.001148333,0.00005631922,2.551224e-8,0.0002064769,0.0001332285,0.000008015225,0.00004538445,0.03851026,0.00005250557,0.2803945,0.6788775,0.000567453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000002967924,0.00004933877,0.8471339,0.00009210245,0.0003584762,0.001120714,0.0008391386,0.0001889809,0.1502144],"genre_scores_gemma":[0.0006534756,0.00007239742,0.5295983,0.001011139,0.005511278,0.0001983958,0.00175355,0.0003015308,0.4608999],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6180505,"threshold_uncertainty_score":0.9998618,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003827364,0.0003805906,0.0006985053,0.00004439652,0.0002112929,0.0002457817,0.0008617806,0.0004401998,0.000002676441],"category_scores_gemma":[0.00002151259,0.0003260522,0.0004100387,0.0001559119,0.0004071922,0.00003867208,0.000949386,0.0006369704,3.574226e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006183952,"about_ca_system_score_gemma":0.0003579377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004694264,"about_ca_topic_score_gemma":0.000008243086,"domain_scores_codex":[0.9980003,0.000008720945,0.0005837426,0.0007244162,0.0003322362,0.0003506184],"domain_scores_gemma":[0.9979957,0.0002934704,0.0005672263,0.0008389614,0.0001995056,0.000105161],"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.00002958251,0.0004386552,0.000002027117,0.005005674,0.0005968622,0.000001291558,0.01130392,0.0003199693,0.0008352422,0.877983,0.0004237111,0.1030601],"study_design_scores_gemma":[0.002517965,0.00015285,0.000003626608,0.001635765,0.0003166053,0.00002130626,0.003808408,0.1777831,0.002553274,0.8095703,0.0006008047,0.001035957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02405314,0.00006678492,0.9687108,0.0001523322,0.0001579028,0.003470228,0.0001650668,0.000166658,0.003057028],"genre_scores_gemma":[0.1236657,0.00001939304,0.8737785,0.00005677556,0.0001254054,0.001910427,0.00007116162,0.00004416914,0.0003284958],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1774631,"threshold_uncertainty_score":0.9999192,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005007648,0.0004320134,0.0006514312,0.00003601701,0.0003530706,0.0002853587,0.0002944369,0.000542913,0.000005865359],"category_scores_gemma":[0.00001541319,0.000337975,0.0001950043,0.0000172361,0.0001967788,0.00004051391,0.0002894945,0.001011539,0.000006948065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002245844,"about_ca_system_score_gemma":0.0001360474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004728163,"about_ca_topic_score_gemma":0.000001440289,"domain_scores_codex":[0.9984948,0.000006583075,0.000324813,0.0005713781,0.0002910781,0.00031136],"domain_scores_gemma":[0.9987555,0.0003399757,0.0003858509,0.0003322796,0.00005119398,0.000135229],"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.00002369351,0.00002072927,0.000005161609,0.0004362349,0.0002587218,0.000001426236,0.002243394,0.00003771899,0.00005307729,0.9348356,0.00123016,0.06085414],"study_design_scores_gemma":[0.01046159,0.001472262,0.000004135286,0.001850784,0.001009143,0.0001140965,0.001043694,0.07390951,0.0005870637,0.3975426,0.5083841,0.003621056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.003195984,0.0003144951,0.2465159,0.0005176526,0.0005091325,0.004405866,0.0001222629,0.0007850236,0.7436337],"genre_scores_gemma":[0.007902785,0.0001036537,0.3489955,0.0003399243,0.001414998,0.0001498157,0.00007511468,0.0002248509,0.6407933],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.537293,"threshold_uncertainty_score":0.9999073,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002283321,0.0006430047,0.0008213572,0.00006952618,0.0005117903,0.0002126584,0.000549169,0.001226395,0.000003142782],"category_scores_gemma":[0.00007514705,0.0005983777,0.0006991678,0.00008327691,0.0001454427,0.00006858827,0.0002237284,0.001308919,0.000003613322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000611488,"about_ca_system_score_gemma":0.00009507257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.882767e-7,"about_ca_topic_score_gemma":2.694706e-7,"domain_scores_codex":[0.9977581,0.000007171048,0.0006019871,0.000832457,0.0003763769,0.0004238996],"domain_scores_gemma":[0.9969791,0.001679247,0.0006525412,0.0003806517,0.0001145633,0.0001939594],"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.00006640142,0.00001397233,1.069572e-7,0.0002260505,0.0002024766,4.545786e-7,0.002033294,0.0001866639,0.0001860221,0.9872134,0.0009237766,0.008947387],"study_design_scores_gemma":[0.0016089,0.0003794169,4.344104e-8,0.0004001604,0.0001390311,0.000001064684,0.0002183514,0.0136786,0.001099385,0.9733742,0.008455041,0.0006457921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00006211518,0.00001909409,0.9760809,0.0001963315,0.0003350482,0.003787096,0.0001131896,0.0003040309,0.01910222],"genre_scores_gemma":[0.008861908,0.00006934803,0.9517561,0.0007181267,0.001771925,0.0008624954,0.0002235822,0.0003383341,0.03539818],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02432477,"threshold_uncertainty_score":0.9996468,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005729758,0.0003885733,0.0005566064,0.00002871016,0.0002405491,0.00004404346,0.0002033871,0.0008516323,0.00002992281],"category_scores_gemma":[0.00004226264,0.0003550541,0.0005365373,0.00001352108,0.0001775354,0.000001385291,0.0002791216,0.0003764339,0.000001576936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004026147,"about_ca_system_score_gemma":0.0001361466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001200234,"about_ca_topic_score_gemma":0.000001601356,"domain_scores_codex":[0.9983933,0.000005806581,0.0005328216,0.0005655949,0.0001274733,0.0003750185],"domain_scores_gemma":[0.9991733,0.0001766734,0.0003264547,0.0002019053,0.00003684653,0.00008484376],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.002351236,0.0002930293,0.000004804738,0.001214433,0.001825388,0.000004647812,0.001112059,0.00002711901,0.4088826,0.2764812,0.1823243,0.1254792],"study_design_scores_gemma":[0.003899494,0.0006673166,4.714192e-8,0.0001211908,0.0001900837,0.00000900421,0.0003189912,0.00008852981,0.00777522,0.02245194,0.9636221,0.0008560978],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.01394323,0.0005425212,0.001137746,0.0001963758,0.0007190348,0.006939026,0.001847337,0.00009517325,0.9745796],"genre_scores_gemma":[0.03881327,0.0006203461,0.1179053,0.005573711,0.01154744,0.002805964,0.007727674,0.001084145,0.8139222],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.7812978,"threshold_uncertainty_score":0.9998901,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0003146038,0.0006001721,0.000714019,0.00009844655,0.0003722292,0.0003557688,0.007052011,0.00101026,0.000007388613],"category_scores_gemma":[0.0004168525,0.0004981454,0.0002962799,0.00004782757,0.0003170657,0.0001033282,0.01404997,0.0008227356,0.000004041593],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001191172,"about_ca_system_score_gemma":0.0002139041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001833206,"about_ca_topic_score_gemma":0.000001076865,"domain_scores_codex":[0.9977667,0.000004171547,0.0004856113,0.0008349107,0.0004815636,0.0004269978],"domain_scores_gemma":[0.9954694,0.000333529,0.0005392744,0.003488404,0.00007653129,0.000092858],"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.0000208528,0.00002700976,1.073704e-7,0.0004443748,0.0003914039,0.000001059845,0.0006434257,9.876791e-7,0.00009528374,0.8525822,0.05815697,0.08763637],"study_design_scores_gemma":[0.001862972,0.0001146282,2.095941e-7,0.0007122167,0.0002877955,0.000009264153,0.00008534401,0.03164654,0.001353169,0.9532119,0.009984091,0.00073184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000197495,0.00002730074,0.9052075,0.001443694,0.0002656957,0.002488055,0.000337997,0.0008026196,0.08922969],"genre_scores_gemma":[0.0007270183,0.00001648747,0.9565434,0.00008425248,0.0002091354,0.0002201714,0.000125676,0.00007123005,0.04200266],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1006298,"threshold_uncertainty_score":0.999747,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001905674,0.0002637373,0.0004131483,0.00003188122,0.00009407676,0.00002967765,0.000158062,0.001093851,0.000009792103],"category_scores_gemma":[0.00003099076,0.0002690686,0.000183127,0.0000148207,0.00006657709,0.0000211489,0.00008578689,0.0004608382,0.000001024455],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004689652,"about_ca_system_score_gemma":0.00003817136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.35673e-7,"about_ca_topic_score_gemma":4.953728e-7,"domain_scores_codex":[0.9990742,4.713843e-7,0.0003195498,0.0002941797,0.0001027545,0.0002088072],"domain_scores_gemma":[0.9993808,0.0001103464,0.0000789221,0.0003326049,0.0000280416,0.00006932418],"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.00001275435,0.00001258443,6.769411e-9,0.001577551,0.0006393534,5.313066e-7,0.0002832134,0.0000435116,0.001684375,0.872247,0.02135318,0.102146],"study_design_scores_gemma":[0.001336292,0.00004317169,1.049759e-8,0.0004220484,0.000581142,0.00003072022,0.0004806023,0.0178058,0.003261568,0.06847794,0.9069818,0.0005788679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.001951831,0.003164378,0.5632934,0.0004235648,0.007421281,0.01369128,0.002771694,0.004729702,0.4025529],"genre_scores_gemma":[0.008558083,0.002743412,0.3961662,0.0001642605,0.01964381,0.003293177,0.01061964,0.001789914,0.5570215],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.8856286,"threshold_uncertainty_score":0.9999762,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004013017,0.0003628712,0.0004465049,0.00005271087,0.0003861065,0.0002949953,0.0004005836,0.0004993305,0.00001244437],"category_scores_gemma":[0.000007630299,0.0003057921,0.0002274211,0.00002827965,0.0002391625,0.00004732962,0.0002103552,0.0003079113,0.000005305079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002969194,"about_ca_system_score_gemma":0.0001059077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.923192e-7,"about_ca_topic_score_gemma":0.000001114027,"domain_scores_codex":[0.9985886,0.000003697271,0.0003917327,0.0004889091,0.0002245277,0.0003025432],"domain_scores_gemma":[0.9988908,0.0001054928,0.0003715922,0.00039984,0.0001231113,0.000109176],"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.00002343548,0.00005219875,3.502172e-7,0.0002430835,0.000345434,0.000001041226,0.003654311,0.00002838574,0.000162743,0.9580573,0.02995859,0.007473124],"study_design_scores_gemma":[0.004812533,0.0006614981,2.404452e-7,0.001754869,0.0003736419,0.00003640703,0.0002068821,0.05261324,0.004288333,0.8481193,0.08495881,0.00217423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005624834,0.00002728277,0.9086118,0.00004363727,0.000119587,0.0009633299,0.00002515779,0.0004508603,0.08970203],"genre_scores_gemma":[0.0003972836,0.00001402991,0.9452341,0.0001556047,0.0004031582,0.0001126934,0.00002724706,0.00005906071,0.05359684],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.109938,"threshold_uncertainty_score":0.9999394,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004509905,0.0004458012,0.0005979751,0.0001804693,0.0003110453,0.000319064,0.0006849851,0.0007233141,0.000004239454],"category_scores_gemma":[0.000007557736,0.0004152284,0.0007611949,0.00007986506,0.0001427882,0.00002134377,0.0005137998,0.0004109893,0.000001212615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003213504,"about_ca_system_score_gemma":0.0001522629,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001203067,"about_ca_topic_score_gemma":4.841709e-7,"domain_scores_codex":[0.9981793,0.000003441023,0.0005860387,0.000613026,0.0003291347,0.0002890631],"domain_scores_gemma":[0.9986019,0.0002346811,0.0003700338,0.0005592743,0.0001217838,0.0001123026],"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.000003599771,0.00002761636,5.711224e-8,0.0001936998,0.0001483813,2.250245e-7,0.0005039871,7.412798e-7,0.00001168769,0.9539299,0.01623178,0.02894833],"study_design_scores_gemma":[0.001013539,0.0001146369,6.119394e-8,0.0004203699,0.0001497677,0.000002391556,0.0000342784,0.01700341,0.000744618,0.8191961,0.1606827,0.0006380595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000009789933,0.0001118136,0.7091328,0.00007443327,0.0003050213,0.001703989,0.00007186033,0.0004351508,0.2881551],"genre_scores_gemma":[0.002579144,0.0002404777,0.5531549,0.002128723,0.00177909,0.001116466,0.0001818191,0.0002589136,0.4385605],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1559779,"threshold_uncertainty_score":0.9998299,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0009549098,0.0008593409,0.001298742,0.00007057546,0.0008352665,0.0001272659,0.0004632643,0.001947957,0.0002433259],"category_scores_gemma":[0.00007695199,0.0007217708,0.001422,0.00001686494,0.0006791217,0.00002922333,0.0003516476,0.0006553649,0.000007498123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007087724,"about_ca_system_score_gemma":0.000133012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.989799e-7,"about_ca_topic_score_gemma":7.423175e-7,"domain_scores_codex":[0.997125,0.000004926477,0.001043885,0.000741159,0.0004479778,0.0006370773],"domain_scores_gemma":[0.9969605,0.00116268,0.0008222251,0.0006725324,0.0001804577,0.0002016097],"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.0001143194,0.00002669401,4.468687e-8,0.0009550607,0.0007996974,2.945185e-7,0.004730084,1.174263e-7,0.00004410611,0.888288,0.1013893,0.003652232],"study_design_scores_gemma":[0.002087614,0.0002297154,7.284311e-9,0.0002304532,0.0009117881,0.00000744183,0.0007595372,0.0001042425,0.0008198016,0.8496825,0.1444353,0.0007316745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00426251,0.0001696596,0.06655186,0.0001811449,0.001847002,0.01258171,0.003474056,0.0005183067,0.9104137],"genre_scores_gemma":[0.0009740486,0.00005117522,0.3203762,0.0007193275,0.007040637,0.00090658,0.0001527035,0.0006481543,0.6691312],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.2538243,"threshold_uncertainty_score":0.9995233,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005804423,0.0003085523,0.0004270888,0.00007510067,0.0002226933,0.0008486839,0.0004569367,0.0004736853,9.816649e-7],"category_scores_gemma":[0.00004133783,0.0003007422,0.000105705,0.00007745925,0.0001625967,0.000171073,0.0004197457,0.0002745154,0.000002542002],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006077049,"about_ca_system_score_gemma":0.0001961083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.443168e-7,"about_ca_topic_score_gemma":2.736167e-7,"domain_scores_codex":[0.9984734,0.000004345114,0.0003744737,0.0006425505,0.000254412,0.00025079],"domain_scores_gemma":[0.9989305,0.0001161923,0.0002355316,0.000429069,0.0001303698,0.0001583374],"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.00000870956,0.0000620977,5.335154e-8,0.0006414424,0.0001435258,6.359762e-7,0.003117845,0.00009432722,0.0002011933,0.5793322,0.2640729,0.152325],"study_design_scores_gemma":[0.0007469457,0.0002668852,2.904749e-8,0.0001867368,0.0001101713,0.00001253852,0.0001678559,0.04587262,0.002259853,0.9013068,0.04826726,0.0008022863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00000696584,0.00001106768,0.9769835,0.0006139235,0.000231488,0.001374571,0.00004890451,0.0008348114,0.01989475],"genre_scores_gemma":[0.00001084143,0.000008489873,0.8743543,0.0002103407,0.001344666,0.0002763399,0.00007394832,0.00007771112,0.1236433],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3219746,"threshold_uncertainty_score":0.9999444,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004428948,0.000540211,0.0007128353,0.0001570922,0.001140019,0.003259632,0.0008956738,0.0004399058,0.000008625668],"category_scores_gemma":[0.0000525578,0.0003169991,0.0004974772,0.0001476214,0.0008894555,0.00007308889,0.0008672609,0.0005532059,0.00001844339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001266725,"about_ca_system_score_gemma":0.0002464609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004302105,"about_ca_topic_score_gemma":0.000003760517,"domain_scores_codex":[0.9953535,0.00001301204,0.0009883444,0.0014989,0.001713758,0.0004325016],"domain_scores_gemma":[0.9970615,0.0007763297,0.0007254173,0.001080335,0.0002235863,0.0001328564],"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.0001192805,0.0001147546,1.038747e-7,0.0005727574,0.001092795,0.000002852455,0.01388064,0.07471094,0.0001880842,0.792852,0.06736713,0.04909859],"study_design_scores_gemma":[0.0006469585,0.00003741983,6.301091e-9,0.0001694759,0.0004488789,0.00001273456,0.001491676,0.5594838,0.00004626088,0.4215312,0.01573903,0.0003925535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.003088236,0.0001076718,0.9097888,0.0002052638,0.001656335,0.003918683,0.000660013,0.0002110264,0.08036392],"genre_scores_gemma":[0.0406714,0.000004711482,0.3898301,0.0003256373,0.00182579,0.0002044815,0.0004415707,0.0002990178,0.5663973],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5199587,"threshold_uncertainty_score":0.9999282,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0003130599,0.0004485041,0.0004936879,0.00006577406,0.0003991506,0.0005309217,0.002838792,0.0008718778,0.000006587829],"category_scores_gemma":[0.0002377165,0.0003683649,0.000180709,0.00005312441,0.0002260789,0.00006446931,0.008071434,0.00100491,0.00001176151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000108181,"about_ca_system_score_gemma":0.0001640943,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001291216,"about_ca_topic_score_gemma":0.000001868238,"domain_scores_codex":[0.9982451,0.00000270866,0.0003721317,0.0006883112,0.0003743035,0.0003174225],"domain_scores_gemma":[0.9981078,0.0002204515,0.0002875339,0.001235127,0.00007879021,0.00007031841],"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.00001805594,0.00001200199,9.18475e-8,0.0005375167,0.0003700035,0.000009275824,0.0006726192,0.000003795698,0.0001664564,0.9482679,0.02821168,0.02173061],"study_design_scores_gemma":[0.0007626273,0.0001858691,5.377532e-9,0.0006611708,0.0002043438,0.00006859942,0.0003738422,0.02815965,0.0004883442,0.8936518,0.07480969,0.0006340061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.0002589753,0.0003906122,0.2886804,0.001872011,0.000455422,0.002888437,0.0001983949,0.002766003,0.7024897],"genre_scores_gemma":[0.004025573,0.00018961,0.653577,0.0002429391,0.0008384965,0.0003588616,0.0003171911,0.0003775778,0.3400727],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.3648966,"threshold_uncertainty_score":0.9999511,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0005055228,0.0007893929,0.001509028,0.0001040268,0.00058634,0.0001892053,0.0004218767,0.001498635,0.0001134685],"category_scores_gemma":[0.00069794,0.000717966,0.001303028,0.00008952165,0.0003356266,0.00003030686,0.0002683879,0.001097526,0.00001067256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000208349,"about_ca_system_score_gemma":0.0006383054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002844233,"about_ca_topic_score_gemma":0.000001346505,"domain_scores_codex":[0.9967219,0.00003518848,0.001272071,0.000745187,0.0005868627,0.0006388472],"domain_scores_gemma":[0.9936926,0.004529269,0.0007594363,0.0006313867,0.0001354864,0.0002517823],"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.00003989723,0.0001889407,4.18123e-8,0.0008995187,0.0007894541,2.343307e-7,0.0008090672,0.000001212124,0.0001610419,0.9317788,0.03649532,0.02883643],"study_design_scores_gemma":[0.00188756,0.000092043,3.759304e-8,0.0003351313,0.001833642,0.000001276865,0.0001497138,0.001388042,0.0006113238,0.9573098,0.03568899,0.0007024691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.00004938136,0.00002826608,0.8537429,0.0001131526,0.0007616566,0.003425522,0.000508664,0.0003095227,0.1410609],"genre_scores_gemma":[0.0004097564,0.000009856637,0.3377957,0.0001390262,0.002723308,0.0017343,0.0004287652,0.0002538069,0.6565054],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5159472,"threshold_uncertainty_score":0.9997976,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004139019,0.000237848,0.0003984794,0.00003942262,0.0002213442,0.00008316275,0.0002623218,0.0003232432,0.0000163611],"category_scores_gemma":[0.00001647226,0.0002104912,0.0002430634,0.00002756366,0.0005838515,0.00002084492,0.0002941641,0.0001924779,0.00000396466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001221636,"about_ca_system_score_gemma":0.00004843238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.315904e-7,"about_ca_topic_score_gemma":2.808108e-7,"domain_scores_codex":[0.9989485,0.0000045281,0.0003216358,0.0003622094,0.0001895217,0.0001736449],"domain_scores_gemma":[0.998654,0.0004726835,0.0003821192,0.0003304837,0.00008186488,0.000078868],"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.00001299613,0.00001932462,7.494263e-8,0.0001001849,0.0001728812,1.251803e-7,0.0030866,0.000001779859,0.0002173674,0.9915378,0.001770947,0.003079924],"study_design_scores_gemma":[0.001125719,0.0001977443,3.044162e-7,0.0002792628,0.0003365668,0.000004863355,0.0004824744,0.002994601,0.002301542,0.9762067,0.01561116,0.0004590885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.0166462,0.0002968528,0.1512815,0.0003726133,0.0004938429,0.00495882,0.001518504,0.0003938625,0.8240378],"genre_scores_gemma":[0.0490431,0.0001515735,0.5027164,0.0003533223,0.003246962,0.0005735453,0.000405412,0.000373451,0.4431363],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.3809015,"threshold_uncertainty_score":0.8583582,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005806425,0.0006411491,0.0007995297,0.0002027625,0.0002491786,0.0003606318,0.0006951367,0.0007851213,0.00002998513],"category_scores_gemma":[0.000006562154,0.0006000578,0.0006325307,0.00008701179,0.0002660925,0.00005393521,0.0005614043,0.0009925959,0.00005794417],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001180706,"about_ca_system_score_gemma":0.0001139474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003841358,"about_ca_topic_score_gemma":0.000005214226,"domain_scores_codex":[0.9975128,0.000006267841,0.00069333,0.0008493528,0.0004353815,0.0005028696],"domain_scores_gemma":[0.9988071,0.0002274702,0.0002668567,0.0005253765,0.0000329017,0.0001403056],"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.0000352359,0.00005186097,4.268149e-8,0.0001981525,0.0002412677,0.000004458702,0.0007052911,0.000004118439,0.0001406037,0.9601994,0.005220906,0.03319864],"study_design_scores_gemma":[0.001615588,0.000122916,6.479561e-8,0.0004343287,0.0001143482,0.000009059042,0.00004667576,0.01717804,0.0006275683,0.9566032,0.02254079,0.0007073933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.001647731,0.0002884033,0.01519533,0.0006422678,0.002330798,0.00723594,0.001205793,0.001365777,0.9700879],"genre_scores_gemma":[0.00374763,0.0002575285,0.6295367,0.001770119,0.004225985,0.001596891,0.000966378,0.0009145565,0.3569842],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.6143414,"threshold_uncertainty_score":0.9996451,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000600456,0.0004797745,0.0006961159,0.0001162786,0.000458644,0.0001721351,0.0006505335,0.0006166326,0.0000677535],"category_scores_gemma":[0.00001459902,0.0004828229,0.0004842076,0.00007755324,0.0001666642,0.00007906018,0.00036639,0.0009109714,0.00001209609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001150339,"about_ca_system_score_gemma":0.0001414641,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007895464,"about_ca_topic_score_gemma":0.000008436823,"domain_scores_codex":[0.9978322,0.000009833126,0.0006402269,0.0006706899,0.0004405403,0.0004064851],"domain_scores_gemma":[0.9986069,0.0003634527,0.0003514753,0.000508602,0.00004060109,0.0001289907],"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.00004152847,0.00008826123,2.147469e-7,0.0002092059,0.0002203008,0.000007006029,0.003502623,0.00004793206,0.0001993661,0.9310852,0.005725591,0.05887277],"study_design_scores_gemma":[0.003877443,0.0003112419,5.681064e-7,0.0003687301,0.0002082449,0.0000555786,0.0003548578,0.07636303,0.0004033645,0.5864943,0.3300178,0.001544785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.00158093,0.0004228871,0.1546906,0.001486929,0.00370854,0.01727147,0.002015646,0.001550148,0.8172728],"genre_scores_gemma":[0.000621616,0.0001263449,0.7263153,0.0007920119,0.003558228,0.001893753,0.0009958545,0.000448329,0.2652486],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.5716246,"threshold_uncertainty_score":0.9997624,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005268725,0.0003366806,0.0005154433,0.0001142946,0.0002946993,0.0002595301,0.0003422714,0.0005526092,0.000005808594],"category_scores_gemma":[0.00003900237,0.0003137631,0.0006354104,0.00007259222,0.0000639308,0.00004997007,0.0002763244,0.0002735078,0.00000199522],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006220466,"about_ca_system_score_gemma":0.0001614273,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.407429e-7,"about_ca_topic_score_gemma":2.1053e-7,"domain_scores_codex":[0.9984044,0.000003402965,0.0004644961,0.0005828579,0.0002975244,0.0002473031],"domain_scores_gemma":[0.9986652,0.000443803,0.0003216105,0.0003098322,0.0001546484,0.0001049155],"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.000009036248,0.00003660931,1.248395e-8,0.0003558519,0.000179344,1.260152e-7,0.0004871446,0.00003398336,0.0001069476,0.8965471,0.008513282,0.09373052],"study_design_scores_gemma":[0.003707184,0.000295061,9.713266e-8,0.0003295823,0.0004389865,0.00002230385,0.0003712384,0.05060139,0.002011492,0.5408215,0.4002107,0.001190442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00004796266,0.000249893,0.9121074,0.00008372778,0.0003200725,0.00168619,0.00008917912,0.00007839522,0.08533715],"genre_scores_gemma":[0.0005643728,0.00004793981,0.7332715,0.000273609,0.001504659,0.0005018025,0.0004349516,0.00007589494,0.2633252],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3916975,"threshold_uncertainty_score":0.9999315,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.003064244,0.0005361972,0.0008359908,0.00006267191,0.000380106,0.0009391399,0.01996809,0.001364182,6.207221e-7],"category_scores_gemma":[0.005448475,0.0005092308,0.0002973284,0.00008177315,0.0002435443,0.0002141105,0.216052,0.001116095,0.000001948648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007379142,"about_ca_system_score_gemma":0.0005417723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005889194,"about_ca_topic_score_gemma":0.000001133278,"domain_scores_codex":[0.99651,0.00001771844,0.0006733196,0.001705822,0.0004699353,0.0006231762],"domain_scores_gemma":[0.9858666,0.001340967,0.0007916564,0.01179456,0.0001106215,0.00009559712],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006766039,0.0003435679,0.00001536428,0.008245669,0.001635394,0.00000156012,0.004904564,0.0000607139,0.00162497,0.07485428,0.5722349,0.3360114],"study_design_scores_gemma":[0.001398669,0.00003960786,8.165404e-7,0.0003684648,0.0002194424,0.000006019756,0.0002467624,0.2710465,0.003995389,0.7172723,0.00476248,0.0006435375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006861692,0.00007070261,0.9815932,0.002061582,0.0007092324,0.004807889,0.002312568,0.0008198874,0.0007632301],"genre_scores_gemma":[0.0170977,0.00001193105,0.980853,0.000142267,0.0004816161,0.000494105,0.0007383561,0.00006581281,0.0001151952],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.642418,"threshold_uncertainty_score":0.9999322,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004309835,0.0004224631,0.0009717047,0.0001090806,0.0003711763,0.0007593859,0.001264362,0.001043424,0.00001380205],"category_scores_gemma":[0.0002860283,0.0003202827,0.0006178596,0.00009892347,0.0002096971,0.0000463034,0.0005840564,0.000474378,0.0000229018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001151726,"about_ca_system_score_gemma":0.0004192537,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001012613,"about_ca_topic_score_gemma":0.000001129761,"domain_scores_codex":[0.9967286,0.00001689766,0.001337689,0.00104755,0.0005511685,0.000318096],"domain_scores_gemma":[0.9925492,0.004972514,0.0007250865,0.001392816,0.0002283255,0.0001321032],"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.000008637107,0.00001611413,1.104753e-8,0.0003009182,0.0001946598,4.260174e-8,0.0003303229,0.00002269435,0.00008958697,0.5002791,0.411738,0.08701997],"study_design_scores_gemma":[0.0002830098,0.00002177608,4.171302e-9,0.00008308594,0.0002487985,0.000001400707,0.0003203699,0.07075945,0.00002161057,0.4265405,0.5015179,0.0002020766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.00000848387,0.0003565865,0.8524135,0.0001993852,0.000660778,0.007466443,0.00664244,0.0003093432,0.1319431],"genre_scores_gemma":[0.00004559961,0.00001615557,0.3987967,0.00007198237,0.0008910897,0.001669562,0.0008316046,0.0001153382,0.597562],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4656189,"threshold_uncertainty_score":0.9999249,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00108163,0.0004814552,0.000732164,0.00009726588,0.0003689784,0.0005573392,0.0004149605,0.001022139,0.000001925876],"category_scores_gemma":[0.000006147294,0.0004130056,0.0005234645,0.00003242091,0.00006586176,0.00006965757,0.0003737102,0.0004745333,0.000003989886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001332462,"about_ca_system_score_gemma":0.00008734534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003628854,"about_ca_topic_score_gemma":4.542272e-7,"domain_scores_codex":[0.9978101,0.000006437313,0.0007454836,0.0007166123,0.0003399901,0.0003813466],"domain_scores_gemma":[0.9985127,0.0003504805,0.0003633266,0.0005266818,0.0001266704,0.0001201652],"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.000006142324,0.00001186622,1.418251e-8,0.001206539,0.0002574626,2.622417e-7,0.001036494,0.00000526829,0.0002458902,0.9584142,0.02112321,0.01769266],"study_design_scores_gemma":[0.0008341366,0.0001597902,3.48146e-9,0.001151029,0.0002075041,0.00001603249,0.0002462163,0.06122951,0.001452893,0.7232757,0.2107548,0.0006723712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.000005883115,0.0002059498,0.8811651,0.0002472214,0.001039547,0.004365183,0.00008270753,0.0004393102,0.112449],"genre_scores_gemma":[0.002106471,0.0000877124,0.332492,0.0002111894,0.002851292,0.00212215,0.0002531812,0.0004062762,0.6594697],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5486732,"threshold_uncertainty_score":0.9998322,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004280353,0.0003846097,0.0004928387,0.00003684585,0.0004311696,0.000321035,0.0004011723,0.000528847,0.00001152447],"category_scores_gemma":[0.0000632239,0.0003386269,0.0003280378,0.0000329454,0.0001081235,0.00004813521,0.0002693512,0.0006322084,0.0000171142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004752305,"about_ca_system_score_gemma":0.0002307716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006647657,"about_ca_topic_score_gemma":8.739576e-7,"domain_scores_codex":[0.9984497,0.000004350537,0.0004248147,0.0005051029,0.0003027431,0.0003133205],"domain_scores_gemma":[0.9982564,0.0006716095,0.0004658808,0.0004126721,0.00008395683,0.0001094531],"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.000001998389,0.00001293005,6.69659e-7,0.0001414831,0.0001214406,4.197402e-7,0.0005453788,0.00001414262,0.0001131944,0.971477,0.003203091,0.02436824],"study_design_scores_gemma":[0.002737195,0.0002160977,0.000002832939,0.0007127652,0.0003618789,0.00002217975,0.0001916754,0.05412544,0.0003174636,0.8070151,0.1328635,0.001433849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.0001949125,0.00006954505,0.4478037,0.0003869711,0.0006122058,0.002212561,0.0003331539,0.0004249249,0.5479621],"genre_scores_gemma":[0.001811306,0.00001073481,0.5913509,0.0002612617,0.002061169,0.0002117676,0.0002149429,0.0001477378,0.4039302],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.1644619,"threshold_uncertainty_score":0.9999066,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003894813,0.0005826119,0.0007850237,0.00009910959,0.0005880463,0.0004697841,0.0008687106,0.000994602,0.000007441164],"category_scores_gemma":[0.00001941215,0.0005292452,0.001031183,0.00003981871,0.0002723702,0.00006240091,0.0004879305,0.0004984643,0.000001799596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003423314,"about_ca_system_score_gemma":0.0001989344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002740485,"about_ca_topic_score_gemma":0.00001151608,"domain_scores_codex":[0.9978144,0.000003691155,0.0006503979,0.0007594892,0.0003132079,0.000458828],"domain_scores_gemma":[0.9980287,0.0005236481,0.0004401995,0.0007471662,0.0001039687,0.0001563442],"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.00002904188,0.00003981378,2.499989e-7,0.0005163652,0.0003701178,3.341721e-7,0.0005286157,7.522651e-8,0.0001139446,0.9642223,0.02136919,0.01280994],"study_design_scores_gemma":[0.001575284,0.00009322574,1.616936e-7,0.000225643,0.0003047578,0.000002520906,0.00003782593,0.0002178379,0.0006003879,0.7116648,0.2847488,0.0005287835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002899755,0.0001562247,0.7976055,0.0001892067,0.001000834,0.004966395,0.001898802,0.0003563282,0.1935367],"genre_scores_gemma":[0.001583763,0.0003049947,0.8452737,0.001137322,0.002994155,0.001874763,0.001554284,0.0002882234,0.1449888],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2633796,"threshold_uncertainty_score":0.9997159,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003096412,0.0003515809,0.0004564068,0.00004862602,0.0003057439,0.0004116338,0.0005398981,0.0005301273,0.000002308394],"category_scores_gemma":[0.00001137218,0.00028652,0.0003534399,0.00003673173,0.0001068872,0.00008325922,0.0005222901,0.0004578914,0.00002729066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006930798,"about_ca_system_score_gemma":0.0002793127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.381345e-7,"about_ca_topic_score_gemma":1.835378e-7,"domain_scores_codex":[0.9983301,0.000004219489,0.0003980033,0.0005437271,0.0004378767,0.0002861297],"domain_scores_gemma":[0.9985481,0.0006203179,0.0002796602,0.0004177378,0.00004054639,0.00009367058],"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.00000820136,0.00002774289,1.685018e-8,0.0001364969,0.0001074971,7.426341e-7,0.0004594054,0.00006404085,0.000007400764,0.749585,0.2314282,0.01817522],"study_design_scores_gemma":[0.001355487,0.0001106812,2.016659e-7,0.0003826789,0.00006855993,0.000003179901,0.00006333639,0.0182246,0.00006638683,0.8762517,0.1029555,0.0005176677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.00005888902,0.00002790929,0.7459433,0.0002440436,0.001215144,0.002250266,0.0008640779,0.0005092446,0.2488871],"genre_scores_gemma":[0.00004118354,0.00001064846,0.1631145,0.0004991017,0.001766718,0.0002648346,0.0005341287,0.0001056629,0.8336632],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.584776,"threshold_uncertainty_score":0.9999587,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}