{"meta":{"query_hash":"61172f37b6f5","filters":{"topic":"Topological and Geometric Data Analysis"},"cohort_total":390,"direct_labels_cover":0,"predictions_cover":390,"exported":390,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/61172f37b6f5","api":"https://metacan.xera.ac/api/v1/cohort?topic=Topological+and+Geometric+Data+Analysis"},"results":[{"id":"W1416094008","doi":"","title":"Sheaves on Graphs and a Proof of the Hanna Neumann Conjecture","year":2011,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Conjecture; Mathematics; Invariant (physics); Von Neumann architecture; Argument (complex analysis); Pure mathematics; Graph; Discrete mathematics; Combinatorics","score_opus":0.06814641642441865,"score_gpt":0.15890605973607694,"score_spread":0.09075964331165828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1416094008","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9554138,0.00004867774,0.039692163,0.00016644759,0.00008145259,0.00009250277,0.0000073985757,0.000040901807,0.0044566174],"genre_scores_gemma":[0.99905443,0.000013770679,0.00014878894,0.000121460165,0.0000030029903,1.0808461e-7,3.7892693e-7,0.0000014817588,0.0006565773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994159,0.000050795923,0.000067670444,0.00029516648,0.00004757973,0.00012291325],"domain_scores_gemma":[0.9993469,0.00004663234,0.000068297355,0.00045269122,0.000030873125,0.000054582775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007796569,0.000078654826,0.00011388814,0.00014385326,0.00008927489,0.000012999023,0.00072445243,0.000044365366,0.00003096845],"category_scores_gemma":[0.000028888948,0.000050107494,0.000078580924,0.0013079996,0.00016976183,0.00016213047,0.00029727197,0.00008580666,0.0000051837706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016289001,0.00011451788,0.01381647,0.000007193053,0.000047969574,0.000031152238,0.00026793426,0.0003430447,0.000020226953,0.98225063,0.0001986643,0.0028859044],"study_design_scores_gemma":[0.0011684533,0.0010579244,0.27239692,0.000049962244,0.00017768839,0.000015809626,0.00025711418,0.039256617,0.011794916,0.6714656,0.0017702803,0.0005887395],"about_ca_topic_score_codex":0.000087762666,"about_ca_topic_score_gemma":0.00002234175,"teacher_disagreement_score":0.31078506,"about_ca_system_score_codex":0.0000062139643,"about_ca_system_score_gemma":0.00001104891,"threshold_uncertainty_score":0.20433243},"labels":[],"label_agreement":null},{"id":"W145861945","doi":"10.1007/0-387-21597-2_6","title":"Homology of Maps","year":2004,"lang":"en","type":"book-chapter","venue":"Applied mathematical sciences","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Homology (biology); Section (typography); Mathematics; Pure mathematics; Topology (electrical circuits); Combinatorics; Computer science; Biology; Genetics; Amino acid","score_opus":0.030266439288472304,"score_gpt":0.24657716346251013,"score_spread":0.21631072417403782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W145861945","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011715865,0.00012286298,0.1261743,0.00042843242,0.000047717007,0.000118776,0.0000130619555,0.00006500177,0.87301815],"genre_scores_gemma":[0.16298965,0.00035725537,0.6013069,0.0012830464,0.00025826052,0.00006320305,0.000039368642,0.000045374592,0.23365691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979159,0.000007394449,0.00048654154,0.00061267766,0.0006680141,0.000309425],"domain_scores_gemma":[0.9985943,0.00038576836,0.00028483107,0.000577733,0.000039433187,0.00011792392],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00055234216,0.00023220021,0.00061788585,0.00032420963,0.00011299506,0.00006769937,0.0022531922,0.0002282377,0.0012493461],"category_scores_gemma":[0.00006654544,0.00015179819,0.00016807987,0.00043840698,0.0012260503,0.00009580417,0.00070186116,0.00018537678,0.00078448263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.7043326e-7,0.000033495744,2.5597743e-7,0.000030062085,0.000020565762,0.000004804162,0.000023724955,0.000009595768,0.000010893338,0.9911206,0.00037559436,0.008369871],"study_design_scores_gemma":[0.0000672479,0.00008766211,0.000003816472,0.00002521435,0.000029297631,0.000010413961,0.0000050389713,0.000055378496,0.00010169825,0.99302745,0.0063977856,0.00018900336],"about_ca_topic_score_codex":0.000005443128,"about_ca_topic_score_gemma":0.0000012227347,"teacher_disagreement_score":0.6393612,"about_ca_system_score_codex":0.000026049864,"about_ca_system_score_gemma":0.00010242272,"threshold_uncertainty_score":0.9999935},"labels":[],"label_agreement":null},{"id":"W1487729220","doi":"10.1007/978-3-642-02498-6_32","title":"Persistence Diagrams of Cortical Surface Data","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":125,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Persistent homology; Computer science; SIGNAL (programming language); Parametric statistics; Algorithm; Noise (video); Noise reduction; Multivariate statistics; Topological data analysis; Theoretical computer science; Pattern recognition (psychology); Artificial intelligence; Image (mathematics); Mathematics; Machine learning; Statistics","score_opus":0.04356025399614919,"score_gpt":0.28110907417702113,"score_spread":0.23754882018087195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487729220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061309468,0.00021549633,0.9356505,0.0024386954,0.00022592598,0.00006878059,0.0000060310895,0.000056333196,0.000028763428],"genre_scores_gemma":[0.68208927,0.0000129009695,0.31726077,0.00060080085,0.00003089734,2.0814396e-7,0.0000033915906,0.0000010986146,6.5062267e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741805,0.000074347,0.00033369113,0.0010023175,0.0006926915,0.0004789132],"domain_scores_gemma":[0.9970709,0.0005331218,0.000102100035,0.0020301016,0.00011651361,0.00014724107],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001135335,0.00015305018,0.00029190525,0.00026961247,0.00013596208,0.00019907569,0.006386864,0.00006342216,0.000011106876],"category_scores_gemma":[0.0007198932,0.000113439324,0.00005545723,0.0060286154,0.00051304663,0.0009518618,0.0015345244,0.0002452813,0.000012220508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004373875,0.00023444752,0.006555487,0.0000050064405,0.0000059812864,0.00003691245,0.0002832506,0.0306825,0.0023035053,0.003246002,0.000020114714,0.9566224],"study_design_scores_gemma":[0.00013927215,0.00023410955,0.053446896,0.000016647591,0.0000057433217,0.000019163073,7.8295784e-7,0.930821,0.0029101048,0.012156871,0.000055443023,0.00019396364],"about_ca_topic_score_codex":0.00004254044,"about_ca_topic_score_gemma":0.000021061962,"teacher_disagreement_score":0.95642847,"about_ca_system_score_codex":0.000035897112,"about_ca_system_score_gemma":0.0001147912,"threshold_uncertainty_score":0.99898905},"labels":[],"label_agreement":null},{"id":"W151084626","doi":"10.1016/j.jsc.2015.11.020","title":"Reducing complexes in multidimensional persistent homology theory","year":2016,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Bishop's University","funders":"Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Mathematics; Persistent homology; Homology (biology); Algebra over a field; Pure mathematics; Combinatorics; Discrete mathematics; Algorithm","score_opus":0.020010497799121407,"score_gpt":0.26529078868414807,"score_spread":0.24528029088502667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W151084626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48061633,0.00025788843,0.51675135,0.002066276,0.00019182662,0.000025804064,0.0000012534899,0.0000096646245,0.00007958536],"genre_scores_gemma":[0.9777695,0.000031536863,0.021952394,0.00012143068,0.00006759846,5.6221774e-7,8.1155554e-7,0.000002243718,0.000053941494],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9987776,0.00020143196,0.00044854774,0.00015708925,0.00025708645,0.00015819461],"domain_scores_gemma":[0.99875534,0.0005970779,0.00029462212,0.00011588204,0.00016425193,0.00007282027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008237395,0.00007860667,0.00023993735,0.0005886906,0.000047348756,0.000024082567,0.00033391616,0.00003984783,0.00003806635],"category_scores_gemma":[0.00023100319,0.000045599612,0.00014579098,0.00060565694,0.000059328264,0.00034547097,0.00011739698,0.00009496113,0.000018117391],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009142553,0.00053205696,0.005729152,0.000011628893,0.00020517984,0.00021170574,0.0015617338,0.01745985,0.009656413,0.1379075,0.0015726087,0.8250607],"study_design_scores_gemma":[0.00548377,0.0017514754,0.6687589,0.00040654987,0.00012556123,0.002164435,0.000656023,0.08311403,0.0013331928,0.23267627,0.0028109376,0.00071884674],"about_ca_topic_score_codex":0.000019985264,"about_ca_topic_score_gemma":0.0000018187312,"teacher_disagreement_score":0.8243419,"about_ca_system_score_codex":0.000071698865,"about_ca_system_score_gemma":0.000055678174,"threshold_uncertainty_score":0.18594982},"labels":[],"label_agreement":null},{"id":"W1530462586","doi":"10.1186/s13062-015-0058-5","title":"Design principles for cancer therapy guided by changes in complexity of protein-protein interaction networks","year":2015,"lang":"en","type":"article","venue":"Biology Direct","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Cancer Institute; National Institute of General Medical Sciences; Natural Sciences and Engineering Research Council of Canada; National Institutes of Health; Allard Foundation","keywords":"Persistent homology; Biology; Protein Interaction Networks; Computational biology; Protein–protein interaction; Homology (biology); Interaction network; Interaction information; Visualization; Homology modeling; Bioinformatics; Computer science; Machine learning; Data mining; Genetics; Mathematics; Gene; Biochemistry","score_opus":0.2520148399035331,"score_gpt":0.35786032241051446,"score_spread":0.10584548250698134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530462586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102162845,0.0036414827,0.8895838,0.0028720843,0.00024584992,0.0010867885,0.000052205058,0.0000921453,0.0002627549],"genre_scores_gemma":[0.9745707,0.00015761788,0.024283547,0.00016764314,0.00006212828,0.00045433332,0.0000387449,0.000004386545,0.0002608799],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895936,0.00024830562,0.00021435092,0.00030561883,0.000060769213,0.00021158544],"domain_scores_gemma":[0.99932814,0.00012417934,0.00016661908,0.00023754848,0.000094102055,0.000049429615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069453905,0.00010308405,0.0002761932,0.00013888598,0.000030210616,0.000015620333,0.00046875273,0.00009485704,0.000018241992],"category_scores_gemma":[0.00019510083,0.00007144389,0.00004188911,0.00056819426,0.00010681464,0.00008452515,0.00010953043,0.0000630023,0.0000014720416],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010170261,0.0012656691,0.019230712,0.00004777482,0.0005155659,0.0000064327037,0.000679552,0.0063449014,0.09778001,0.054039635,0.013036339,0.80603635],"study_design_scores_gemma":[0.004465715,0.004157691,0.008247106,0.00013443528,0.000033697925,0.0000049158343,0.00008871871,0.3293856,0.3234315,0.035861183,0.2930115,0.0011779456],"about_ca_topic_score_codex":0.0011690707,"about_ca_topic_score_gemma":0.0003732177,"teacher_disagreement_score":0.87240785,"about_ca_system_score_codex":0.000043269374,"about_ca_system_score_gemma":0.000031758696,"threshold_uncertainty_score":0.29133973},"labels":[],"label_agreement":null},{"id":"W1540614089","doi":"10.1002/jgt.1025","title":"Fractional chromatic numbers of cones over graphs","year":2001,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Chromatic scale; Mathematics; Combinatorics; Graph; Graph theory; Discrete mathematics","score_opus":0.010827262015729826,"score_gpt":0.25018495875165897,"score_spread":0.23935769673592913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540614089","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6793921,0.0010873147,0.31557614,0.0005708907,0.00045878757,0.00003374548,0.0000053266504,0.000017731973,0.002857941],"genre_scores_gemma":[0.99584013,0.00029588648,0.0034744863,0.00022259376,0.000045415884,3.915769e-7,6.22867e-7,0.0000024182868,0.000118043885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879014,0.00013165739,0.00043469016,0.00010261883,0.00040846548,0.0001324305],"domain_scores_gemma":[0.9985694,0.0004594823,0.00051607046,0.00022029155,0.00014465436,0.00009008446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090407114,0.00008283841,0.0002703129,0.0006247319,0.000055571418,0.000031781285,0.000651851,0.000045289366,0.00054286525],"category_scores_gemma":[0.00018709706,0.000055133543,0.00032116004,0.0015443403,0.00013728917,0.00050753145,0.000065493026,0.00014806924,0.000009892611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097428514,0.00041434984,0.02521883,0.0000144281275,0.00052988244,0.00014095305,0.00018289904,0.00017587873,0.0007236792,0.9473434,0.0027339514,0.022424338],"study_design_scores_gemma":[0.00041641697,0.0001943259,0.06837199,0.000024073799,0.00006453588,0.00030823916,0.00009412634,0.00016896,0.00018470136,0.92702174,0.0030492702,0.00010159106],"about_ca_topic_score_codex":0.000012916462,"about_ca_topic_score_gemma":0.0000015990529,"teacher_disagreement_score":0.316448,"about_ca_system_score_codex":0.00001046384,"about_ca_system_score_gemma":0.00002859215,"threshold_uncertainty_score":0.5943994},"labels":[],"label_agreement":null},{"id":"W1570514300","doi":"10.1023/a:1016376116653","title":"Hamilton-Jacobi Skeletons","year":2002,"lang":"en","type":"article","venue":"International Journal of Computer Vision","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":286,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Army Research Office; Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Eikonal equation; Mathematics; Gravitational singularity; Algorithm; Vector field; Image processing; Computer science; Artificial intelligence; Applied mathematics; Mathematical analysis; Geometry; Image (mathematics)","score_opus":0.015439134691009533,"score_gpt":0.2710607166309451,"score_spread":0.25562158193993556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570514300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018405598,0.00026394206,0.9728463,0.0051479717,0.0020286057,0.000022339796,0.0000033360081,0.000031683914,0.0012501993],"genre_scores_gemma":[0.91452515,0.00029397308,0.08241046,0.0012657534,0.0009784795,4.099303e-7,0.0000021587277,0.000004389265,0.000519219],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998391,0.00005862038,0.0004591594,0.00017505357,0.0007727593,0.000143433],"domain_scores_gemma":[0.99876255,0.00017675254,0.00029562903,0.00023292458,0.00041307873,0.00011907416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027565673,0.00010180196,0.00019119757,0.00056210684,0.000047906033,0.00027737272,0.0021794876,0.000045332,0.00026683847],"category_scores_gemma":[0.00003930764,0.000073389434,0.00021938073,0.00045385025,0.000034318342,0.0008164287,0.0003182926,0.00017725932,0.000157883],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008996336,0.00042339685,0.0003854333,0.0000015029593,0.00021090584,0.00053219096,0.0002835887,0.0015068678,0.00020431717,0.014877675,0.0565047,0.92506045],"study_design_scores_gemma":[0.0012578336,0.0009817597,0.007867908,0.000074555224,0.000024728373,0.0013132776,0.000009844228,0.41923591,0.00045959002,0.008582793,0.5598717,0.00032014147],"about_ca_topic_score_codex":0.0000048852066,"about_ca_topic_score_gemma":4.817312e-7,"teacher_disagreement_score":0.92474025,"about_ca_system_score_codex":0.00004936816,"about_ca_system_score_gemma":0.000010593621,"threshold_uncertainty_score":0.40500665},"labels":[],"label_agreement":null},{"id":"W1591975058","doi":"10.3233/fi-2009-163","title":"Measuring Resemblances Between Swarm Behaviours: A Perceptual Tolerance Near Set Approach","year":2009,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Winnipeg","funders":"","keywords":"Swarm behaviour; Set (abstract data type); Perception; Computer science; Artificial intelligence; Communication; Psychology; Mathematics; Cognitive psychology; Neuroscience","score_opus":0.08221212626415805,"score_gpt":0.281956884644228,"score_spread":0.19974475838006997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591975058","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65651757,0.00015878906,0.3201168,0.0016870513,0.00014544008,0.00034758568,0.000103339255,0.000430693,0.02049272],"genre_scores_gemma":[0.94927686,0.000014466723,0.049298942,0.0010022789,0.00009626436,0.000012343185,0.000097560616,0.0000037636435,0.00019752969],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9978598,0.000054405646,0.0005495991,0.00032523688,0.0006676669,0.0005433266],"domain_scores_gemma":[0.9987235,0.000080581434,0.00016495981,0.00074349536,0.00006002361,0.0002274624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005122631,0.00022031055,0.00038151455,0.00022842016,0.00034050172,0.000743189,0.0016437883,0.00008788518,0.00007748392],"category_scores_gemma":[0.00007455304,0.00017040622,0.00014011552,0.0013798682,0.000115583636,0.0018472888,0.00032092596,0.0002582877,0.00031913858],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005451402,0.0009651137,0.11693088,0.00012994536,0.00034731094,0.000040984945,0.028068552,0.00183566,0.00004546638,0.028193397,0.03557144,0.7878167],"study_design_scores_gemma":[0.0035321463,0.0023674285,0.72296405,0.00018550354,0.00030430788,0.00010672571,0.0050043077,0.14472234,0.00078694656,0.0070465486,0.109956406,0.0030232891],"about_ca_topic_score_codex":0.00007452283,"about_ca_topic_score_gemma":0.0000017464039,"teacher_disagreement_score":0.78479344,"about_ca_system_score_codex":0.000070006754,"about_ca_system_score_gemma":0.000038254333,"threshold_uncertainty_score":0.7166589},"labels":[],"label_agreement":null},{"id":"W1593924207","doi":"10.5072/zenodo.24896","title":"Colourful theorems and indices of homomorphism complexes","year":2013,"lang":"en","type":"article","venue":"Repository of the Academy's Library (Library of the Hungarian Academy of Sciences)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Combinatorics; Clique; Bipartite graph; Homomorphism; Chromatic scale; Discrete mathematics; Order (exchange); Graph","score_opus":0.014781880248052739,"score_gpt":0.21678952514941302,"score_spread":0.20200764490136028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593924207","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9466165,0.0032217267,0.00013816325,0.042168725,0.00026844686,0.0006395268,0.00007089538,0.00009257751,0.006783462],"genre_scores_gemma":[0.991087,0.00021767056,0.005957708,0.0010189252,0.00007413237,0.0000074193567,9.715798e-7,0.00001283885,0.0016233046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9960818,0.0006048918,0.0011986473,0.00063579896,0.0010604193,0.0004184334],"domain_scores_gemma":[0.9965983,0.00077753776,0.0018803437,0.00054798473,0.000020472924,0.00017533713],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006629192,0.00029518854,0.0007652101,0.00045225417,0.00048686817,0.00013770928,0.009207299,0.00032501665,0.00011351815],"category_scores_gemma":[0.00009922685,0.00016165622,0.00039726627,0.003445492,0.0055171517,0.0054539694,0.004305621,0.00060293096,0.0000035903827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058949732,0.0004166954,0.20572697,0.00035639756,0.00038273243,0.0000012260575,0.0012292657,0.00036000996,0.12658657,0.6391331,0.019218624,0.0065294923],"study_design_scores_gemma":[0.0003436749,0.0001843283,0.415462,0.00023866394,0.000086322245,0.000043375167,0.00014907405,0.002220789,0.4461372,0.13208099,0.0027669792,0.00028661184],"about_ca_topic_score_codex":0.00005743845,"about_ca_topic_score_gemma":5.5453885e-8,"teacher_disagreement_score":0.50705206,"about_ca_system_score_codex":0.000005660587,"about_ca_system_score_gemma":0.00011683055,"threshold_uncertainty_score":0.9971893},"labels":[],"label_agreement":null},{"id":"W1600516947","doi":"10.1007/s00029-015-0201-2","title":"Autonomous Hamiltonian flows, Hofer’s geometry and persistence modules","year":2015,"lang":"en","type":"preprint","venue":"Selecta Mathematica","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Diffeomorphism; Mathematics; Hamiltonian (control theory); Floer homology; Geometry; Pure mathematics; Hamiltonian system; Topology (electrical circuits); Mathematical analysis; Combinatorics; Mathematical optimization","score_opus":0.040826364056074343,"score_gpt":0.2551493507588507,"score_spread":0.21432298670277636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600516947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17618904,0.008829526,0.78324574,0.0065246886,0.0008934581,0.0010960031,0.00025021395,0.0014916657,0.021479676],"genre_scores_gemma":[0.7348572,0.0003062559,0.26217684,0.00027919732,0.00014375134,0.00007108365,0.000062577485,0.000031530853,0.0020715564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996954,0.00011632897,0.00053437136,0.0011962779,0.00061037944,0.00058862864],"domain_scores_gemma":[0.9971661,0.00023785191,0.0002791736,0.0017000397,0.00023598157,0.00038087665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008249995,0.00046231577,0.00086351304,0.0006391139,0.00016998027,0.00065062015,0.0024211246,0.00036279619,0.00011310632],"category_scores_gemma":[0.00070939783,0.00036475377,0.00020875741,0.0013485514,0.00014700062,0.00028403185,0.0036304593,0.00063325674,0.00021373625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004524958,0.0026304037,0.0011693563,0.004497619,0.0030738465,0.0005507627,0.0124215,0.0015152805,0.0002981395,0.4987166,0.061794896,0.41328636],"study_design_scores_gemma":[0.00041063514,0.00028176405,0.0012803273,0.00024505492,0.00033016724,0.00017794472,0.00018622604,0.43970728,0.0001385012,0.54432684,0.01130647,0.0016088252],"about_ca_topic_score_codex":0.00007624324,"about_ca_topic_score_gemma":0.000021109516,"teacher_disagreement_score":0.5586682,"about_ca_system_score_codex":0.00012480585,"about_ca_system_score_gemma":0.0002104298,"threshold_uncertainty_score":0.99988043},"labels":[],"label_agreement":null},{"id":"W1619343944","doi":"10.1090/conm/516","title":"Algebraic Methods in Statistics and Probability II","year":2010,"lang":"en","type":"book","venue":"Contemporary mathematics - American Mathematical Society","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Mathematics; Nonparametric statistics; Estimator; Persistent homology; Bounded function; Algebraic number; Homology (biology); Minimax; Nonparametric regression; Bottleneck; Discrete mathematics; Combinatorics; Statistics; Applied mathematics; Mathematical optimization; Algorithm; Computer science; Mathematical analysis","score_opus":0.04310212085173093,"score_gpt":0.32698168677849726,"score_spread":0.28387956592676633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1619343944","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016647876,0.00051034224,0.91150206,0.00087257597,0.00008993136,0.00085942744,0.00019682811,0.00026187548,0.085540496],"genre_scores_gemma":[0.00028323394,0.0001230125,0.93266237,0.0004898772,0.000069994945,0.00009333031,0.0000860194,0.000057064644,0.066135116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952476,0.00025234005,0.0017191403,0.0012985411,0.0008043536,0.0006779928],"domain_scores_gemma":[0.992538,0.0037396154,0.0011381045,0.0019467346,0.00017863684,0.00045891112],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029267624,0.0008172972,0.002373213,0.0002444888,0.00025114993,0.00027822884,0.0019313017,0.00058199954,0.00025478573],"category_scores_gemma":[0.0015860191,0.0006416781,0.0005238494,0.0011610095,0.0019182763,0.00035797854,0.002278424,0.0016966676,0.00007533644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000324893,0.00084531726,0.000027307417,0.0011898391,0.00028051823,0.000031422307,0.0027261279,8.564203e-7,0.000027573124,0.93261653,0.03540046,0.026850827],"study_design_scores_gemma":[0.00027476923,0.00022120884,0.00003976627,0.0001538421,0.00008732705,0.000024251118,0.00014380208,0.02011201,0.000011430641,0.95117056,0.026999395,0.0007616617],"about_ca_topic_score_codex":0.000026577773,"about_ca_topic_score_gemma":0.000007901057,"teacher_disagreement_score":0.026089165,"about_ca_system_score_codex":0.00018224926,"about_ca_system_score_gemma":0.00057461014,"threshold_uncertainty_score":0.99960345},"labels":[],"label_agreement":null},{"id":"W1636587464","doi":"10.48550/arxiv.math/0603068","title":"Minimum Area Venn Diagrams Whose Curves are Polyominoes","year":2006,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Venn diagram; Polyomino; Simple (philosophy); Mathematics; Set (abstract data type); Intersection (aeronautics); Diagram; Discrete mathematics; Combinatorics; Jordan curve theorem; Computer science; Geometry","score_opus":0.05360812302287927,"score_gpt":0.2607230794146629,"score_spread":0.20711495639178362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1636587464","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9356443,0.012888607,0.03951638,0.0074423067,0.0013206591,0.0003495806,0.0002560239,0.0005568625,0.0020252722],"genre_scores_gemma":[0.9910051,0.001310357,0.0015595634,0.0015035915,0.00042279947,0.00007454127,0.00036500228,0.000020652176,0.0037383542],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99663085,0.00014609945,0.0006101586,0.0014052339,0.00055316597,0.00065451406],"domain_scores_gemma":[0.9965913,0.0002763967,0.0005390284,0.0022033164,0.00015127272,0.00023863303],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036634438,0.00051431864,0.0008337581,0.00041991647,0.0001720976,0.00027258956,0.0033000342,0.00038601665,0.000125534],"category_scores_gemma":[0.0003905807,0.00040487936,0.0005048421,0.0013735598,0.00017502988,0.00030717035,0.0037557634,0.0007224699,0.0004880958],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054029915,0.00045844066,0.91541976,0.00021475276,0.00021356977,0.00026596492,0.00007167539,0.00012372619,0.0000355167,0.00048326023,0.063430004,0.019277915],"study_design_scores_gemma":[0.0002495185,0.00009272785,0.97381777,0.00040515387,0.00016518786,0.000009616832,0.000021942422,0.0020392789,0.00028522193,0.004005342,0.017961405,0.0009468291],"about_ca_topic_score_codex":0.00085842935,"about_ca_topic_score_gemma":0.00016238433,"teacher_disagreement_score":0.058398005,"about_ca_system_score_codex":0.000068892936,"about_ca_system_score_gemma":0.00008023471,"threshold_uncertainty_score":0.9998403},"labels":[],"label_agreement":null},{"id":"W1640101840","doi":"10.3842/sigma.2015.062","title":"Topological Monodromy of an Integrable Heisenberg Spin Chain","year":2015,"lang":"en","type":"article","venue":"Symmetry Integrability and Geometry Methods and Applications","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Integrable system; Monodromy; Chain (unit); Spin (aerodynamics); Physics; Heisenberg model; Mathematical physics; Mathematics; Topology (electrical circuits); Quantum mechanics; Pure mathematics; Antiferromagnetism; Combinatorics","score_opus":0.04600238487639294,"score_gpt":0.3723057361206787,"score_spread":0.3263033512442858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1640101840","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10629554,0.0011825588,0.8890601,0.00111652,0.000055606928,0.0002687642,0.000041795523,0.000095799354,0.0018833495],"genre_scores_gemma":[0.4485064,0.00012032027,0.5508765,0.00016327946,0.000046662026,0.00008162255,0.000019469224,0.000004977982,0.00018075522],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755234,0.0005390612,0.0005499574,0.0008132873,0.00023430276,0.00031104093],"domain_scores_gemma":[0.99736995,0.0007700677,0.00017124732,0.00097402465,0.0002281942,0.00048649593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035822657,0.00023046105,0.00054781063,0.0004668874,0.00016916658,0.00011539563,0.00076029456,0.00020135181,0.000053449963],"category_scores_gemma":[0.0012338428,0.00016459689,0.00011398144,0.003120132,0.00054511277,0.00042032002,0.0004895428,0.00033176164,0.0000070863384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009376206,0.00029972917,0.0026574815,0.000022325323,0.000030400388,7.570097e-7,0.00008110707,0.0000041342046,0.00016039082,0.4924849,0.000035683806,0.50421375],"study_design_scores_gemma":[0.0005897574,0.0008515832,0.011940414,0.000014408651,0.000082145525,0.00005549647,0.0019196653,0.0127986865,0.0044561704,0.9324224,0.034328524,0.0005407773],"about_ca_topic_score_codex":0.00056194747,"about_ca_topic_score_gemma":0.000014978345,"teacher_disagreement_score":0.50367296,"about_ca_system_score_codex":0.000030129942,"about_ca_system_score_gemma":0.00004555005,"threshold_uncertainty_score":0.67120665},"labels":[],"label_agreement":null},{"id":"W1706661728","doi":"10.20382/jocg.v2i1a5","title":"Good quality virtual realization of unit disk graphs","year":2010,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Science Foundation","keywords":"Realization (probability); Mathematics; Unit disk; Quality (philosophy); Unit (ring theory); Combinatorics; Statistics; Physics; Mathematics education","score_opus":0.01540619575692122,"score_gpt":0.24849300508462382,"score_spread":0.2330868093277026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1706661728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41409007,0.000016362132,0.58401704,0.00024396548,0.00025369137,0.000028317536,0.000025303529,0.000016293587,0.0013089702],"genre_scores_gemma":[0.9842947,0.000026240374,0.015173771,0.0000690992,0.000052914012,3.5479758e-8,0.000020747433,0.0000034863322,0.00035899563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99819416,0.0001660395,0.00052621367,0.00020188799,0.0007491115,0.00016257736],"domain_scores_gemma":[0.9971753,0.00058149133,0.0008647614,0.000252194,0.0009470184,0.00017927377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068935397,0.00012530226,0.00035063596,0.0021470955,0.000114714734,0.00005479019,0.0011406784,0.00010393189,0.00010840983],"category_scores_gemma":[0.00030716817,0.00011257539,0.00027133213,0.005357135,0.00014399899,0.00087647163,0.0002252413,0.00032615388,0.0000061153864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040418872,0.0002457102,0.017209351,0.000008921492,0.00015654859,0.000039960367,0.00006819544,0.018642623,0.00039136354,0.9508513,0.00019900972,0.012146553],"study_design_scores_gemma":[0.0040976964,0.0016580828,0.7279094,0.00005577187,0.000322054,0.00020665543,0.0008208445,0.015233109,0.0010322867,0.19587055,0.05191543,0.0008781518],"about_ca_topic_score_codex":0.00005504911,"about_ca_topic_score_gemma":0.000013547884,"teacher_disagreement_score":0.7549808,"about_ca_system_score_codex":0.00002942545,"about_ca_system_score_gemma":0.00015647715,"threshold_uncertainty_score":0.45906913},"labels":[],"label_agreement":null},{"id":"W1929335507","doi":"10.1016/j.jcta.2018.04.004","title":"Extremal hypergraphs for Ryser's Conjecture","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; Alexander von Humboldt-Stiftung","keywords":"Hypergraph; Conjecture; Combinatorics; Bipartite graph; Mathematics; Social connectedness; Independence number; Vertex (graph theory); Matching (statistics); Discrete mathematics; Base (topology); Graph","score_opus":0.010925980757902062,"score_gpt":0.2467997779114212,"score_spread":0.23587379715351914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1929335507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12844631,0.0014541151,0.83365464,0.0057437113,0.02559533,0.00033278315,0.000035310957,0.00012993098,0.004607841],"genre_scores_gemma":[0.986016,0.00003586762,0.0114492765,0.0002686275,0.0018137908,0.0000028650236,0.0000012686703,0.0000071155982,0.00040520896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871594,0.00014120183,0.00041625733,0.00017557236,0.00030420756,0.00024684033],"domain_scores_gemma":[0.99823135,0.00042143633,0.000377475,0.0003301515,0.00050141366,0.00013814896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011816933,0.00013871437,0.0003702197,0.0002582144,0.00019118299,0.00015894313,0.001167874,0.00009826507,0.00013763037],"category_scores_gemma":[0.00070676784,0.00009238765,0.00029220534,0.00085202744,0.00021820932,0.0007619087,0.00016207912,0.0001539389,0.000007885546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003541277,0.000079158184,0.000058590784,0.000003913358,0.00010853729,0.00001554768,0.00012881099,0.0000021271394,0.00022588043,0.98784924,0.0029434178,0.008230631],"study_design_scores_gemma":[0.0008761715,0.0021454163,0.00012988025,0.0000089692785,0.00004430349,0.00011007893,0.000069726426,0.000034080935,0.0021524176,0.84497905,0.14932801,0.00012188427],"about_ca_topic_score_codex":0.0000018806487,"about_ca_topic_score_gemma":8.965662e-7,"teacher_disagreement_score":0.8575697,"about_ca_system_score_codex":0.000021316315,"about_ca_system_score_gemma":0.00007559702,"threshold_uncertainty_score":0.3767459},"labels":[],"label_agreement":null},{"id":"W1953211229","doi":"10.1002/jgt.21834","title":"Relations between the Local Chromatic Number and Its Directed Version","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Hungarian Scientific Research Fund; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Infimum and supremum; Critical graph; Chromatic scale; Windmill graph; Fractional coloring; Graph; Brooks' theorem; Discrete mathematics; Logarithm; Vertex (graph theory); Friendship graph; Undirected graph; Directed graph; Graph coloring; Graph power; Line graph","score_opus":0.008713303986550756,"score_gpt":0.22830622964959996,"score_spread":0.2195929256630492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1953211229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39756668,0.0004755407,0.59836143,0.0019570715,0.00012088579,0.00003043148,0.0000027004612,0.00002617942,0.0014591032],"genre_scores_gemma":[0.9983846,0.00003219566,0.0012889182,0.00011303449,0.000058784088,2.685507e-7,6.3146433e-7,0.000001689512,0.000119899276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906325,0.00032675124,0.00022217662,0.00008252402,0.00020934062,0.00009594732],"domain_scores_gemma":[0.99844885,0.0010468446,0.00019236989,0.0001580689,0.00007937657,0.00007451814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013827177,0.000058187794,0.0001510248,0.00015321924,0.00015877163,0.0000496918,0.0004614327,0.000037490747,0.000085995474],"category_scores_gemma":[0.000373807,0.000029940931,0.00009462838,0.00082772825,0.00008452405,0.0002757004,0.000107718915,0.0001615792,0.000046425306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034662608,0.00013221464,0.05756086,0.0000176966,0.00050372124,0.000021076137,0.00065655424,0.00017049954,0.0001584101,0.755557,0.007663865,0.17752342],"study_design_scores_gemma":[0.0004446412,0.00018687027,0.34646887,0.00003732417,0.00018286068,0.00008352564,0.00007336457,0.0049181827,0.00017764737,0.6411237,0.0061684726,0.0001345541],"about_ca_topic_score_codex":0.000002061541,"about_ca_topic_score_gemma":4.021626e-7,"teacher_disagreement_score":0.6008179,"about_ca_system_score_codex":0.000008794245,"about_ca_system_score_gemma":0.000009509026,"threshold_uncertainty_score":0.1221159},"labels":[],"label_agreement":null},{"id":"W1963931974","doi":"10.1007/s00493-006-0034-x","title":"Local Chromatic Number, KY Fan's Theorem, And Circular Colorings","year":2006,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Brooks' theorem; Chromatic scale; Upper and lower bounds; Chordal graph; Discrete mathematics; Conjecture; Indifference graph; Bipartite graph; Vertex (graph theory); Graph; 1-planar graph","score_opus":0.0060103561267724126,"score_gpt":0.20559387058850803,"score_spread":0.1995835144617356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963931974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2629461,0.0017428555,0.68844515,0.0021718133,0.00045424447,0.00022399913,0.0000062744843,0.0005191928,0.043490373],"genre_scores_gemma":[0.99790627,0.000032342123,0.0013272188,0.00013378363,0.00001853912,0.000010678452,0.00000515647,0.0000049615,0.0005610485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877685,0.000054454722,0.00020812714,0.00039280267,0.00027453975,0.00029323186],"domain_scores_gemma":[0.99914145,0.00015256005,0.00007344606,0.0004746101,0.00004850825,0.000109396235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020114207,0.00014031619,0.00024588153,0.00014670855,0.00015950554,0.00014648236,0.0006728078,0.00007195384,0.00006470035],"category_scores_gemma":[0.00005636137,0.00011154604,0.000070796355,0.0018451958,0.00014627667,0.00025052257,0.00039601704,0.00011223321,0.00016987069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010276844,0.0001448172,0.0032347857,0.000013693996,0.00001823357,0.000048403934,0.000020584144,0.000005904228,0.000035853067,0.98480755,0.0018531247,0.00981602],"study_design_scores_gemma":[0.0006938111,0.00014540194,0.03412862,0.000011890101,0.000043486143,0.000065108296,0.000027141657,0.0062404093,0.0008275301,0.90566045,0.051737715,0.00041844582],"about_ca_topic_score_codex":0.00018856292,"about_ca_topic_score_gemma":0.000001130704,"teacher_disagreement_score":0.73496014,"about_ca_system_score_codex":0.00005200079,"about_ca_system_score_gemma":0.000017153694,"threshold_uncertainty_score":0.45487157},"labels":[],"label_agreement":null},{"id":"W1973273044","doi":"10.1090/s0002-9947-08-04643-6","title":"Local chromatic number and distinguishing the strength of topological obstructions","year":2008,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund","keywords":"Algorithm; Annotation; Artificial intelligence; Computer science; Mathematics","score_opus":0.017210449221599873,"score_gpt":0.24882851232412478,"score_spread":0.23161806310252492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973273044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34637296,0.00001732858,0.6519685,0.0012518124,0.000021714946,0.00005867534,0.000010104981,0.000027034772,0.0002718667],"genre_scores_gemma":[0.9459691,0.000046945595,0.053802025,0.00008478108,0.0000087439885,0.0000066091206,3.1520761e-7,0.0000029012972,0.00007855261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989597,0.000087484346,0.00032388794,0.00017594242,0.00028807967,0.00016486613],"domain_scores_gemma":[0.99836725,0.00080530497,0.00021481585,0.000507042,0.00004866464,0.000056904722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019269325,0.00010248667,0.00031900182,0.00001532578,0.00037276975,0.000016398051,0.00072409527,0.000031909625,0.00011512243],"category_scores_gemma":[0.00014921425,0.000049859165,0.00033189033,0.0011743053,0.0026630296,0.000097247976,0.00009018522,0.00019263047,0.000004352247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003738191,0.0046961857,0.025080249,0.0006572133,0.0026959372,0.000011536826,0.02672019,0.0029820846,0.0016874049,0.75043356,0.0025484911,0.18244977],"study_design_scores_gemma":[0.0012336407,0.00073007244,0.3456884,0.00017331955,0.0011080225,0.0011532265,0.016909257,0.24912225,0.00585908,0.37603787,0.0008269684,0.0011579006],"about_ca_topic_score_codex":0.00017570666,"about_ca_topic_score_gemma":0.0000028521847,"teacher_disagreement_score":0.59959614,"about_ca_system_score_codex":0.000017368322,"about_ca_system_score_gemma":0.000020838559,"threshold_uncertainty_score":0.9812044},"labels":[],"label_agreement":null},{"id":"W197421507","doi":"","title":"On the voltage-current transferring in topological graph theory.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Current (fluid); Topology (electrical circuits); Voltage; Graph; Discrete mathematics; Electrical engineering; Combinatorics","score_opus":0.019133958570325172,"score_gpt":0.2518688174165719,"score_spread":0.23273485884624673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W197421507","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9555069,0.0007057905,0.030144623,0.00792259,0.0010772685,0.00021863331,0.000005121128,0.00016905622,0.0042499835],"genre_scores_gemma":[0.99902123,0.00005870435,0.0001542372,0.00065227994,0.000010456988,0.000020578822,0.0000016647455,0.0000031573413,0.000077666315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860215,0.00017980704,0.00023332916,0.0003762561,0.0002804705,0.00032795634],"domain_scores_gemma":[0.99851763,0.0007987805,0.00003628582,0.0005459456,0.000023571056,0.000077803765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008072809,0.00014184552,0.00018800373,0.0002060116,0.00013366627,0.00009154019,0.0013021756,0.000059821356,0.00021186685],"category_scores_gemma":[0.00026997173,0.00007997015,0.0001210099,0.0015079074,0.000094594216,0.00019314,0.00017530032,0.0003306831,0.00015790445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005606605,0.00020966414,0.00048346343,9.898472e-7,0.000008305323,0.0000064796695,0.00009952663,0.0000430012,0.000009963117,0.9523391,0.0003938798,0.046400014],"study_design_scores_gemma":[0.00030126283,0.00010064918,0.0074506365,0.00000777304,0.0000056999106,0.0000016060851,0.000020618465,0.0010389335,0.000188362,0.9861126,0.0046391087,0.00013272848],"about_ca_topic_score_codex":0.000016989785,"about_ca_topic_score_gemma":0.000011614515,"teacher_disagreement_score":0.046267286,"about_ca_system_score_codex":0.000039123977,"about_ca_system_score_gemma":0.000012775401,"threshold_uncertainty_score":0.3261088},"labels":[],"label_agreement":null},{"id":"W1974745657","doi":"10.4153/cmb-2008-053-9","title":"On the Simple ℤ<sub>2</sub>-homotopy Types of Graph Complexes and Their Simple ℤ<sub>2</sub>-universality","year":2008,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Western University","funders":"Canada Research Chairs","keywords":"Mathematics; Homotopy; Homomorphism; Simple (philosophy); Universality (dynamical systems); Graph; Simple graph; Combinatorics; Pure mathematics; Discrete mathematics","score_opus":0.01822650687824193,"score_gpt":0.20044928091282982,"score_spread":0.1822227740345879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974745657","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96845496,0.0001043843,0.022480197,0.0065202364,0.000031339372,0.0002571369,0.00017832797,0.00006820319,0.0019051967],"genre_scores_gemma":[0.99806005,0.00006722362,0.0004013954,0.0013695178,0.000026859547,0.000011099782,0.000019439849,0.00001206005,0.000032377684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980777,0.00018156026,0.0003963726,0.0004856786,0.00030722265,0.0005514967],"domain_scores_gemma":[0.9969431,0.0014271067,0.00013376385,0.0008531869,0.000105735344,0.0005371171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048738666,0.00027099947,0.00050090865,0.00031422472,0.0004149299,0.000081290644,0.000981365,0.00012251583,0.0007925793],"category_scores_gemma":[0.0006890361,0.00017244142,0.00018767436,0.0010064217,0.0005890722,0.000075390315,0.00022546534,0.00024636462,0.00071573234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021007898,0.00029729892,0.00044848173,0.000103768114,0.0002457305,0.00015358726,0.0009969408,0.000059501177,0.0059503205,0.9009943,0.0771498,0.013579265],"study_design_scores_gemma":[0.00067561836,0.00045004522,0.007695455,0.00006973954,0.000084627856,0.00012745644,0.00047338588,0.005105448,0.05271214,0.900657,0.030974684,0.0009744262],"about_ca_topic_score_codex":0.0012870663,"about_ca_topic_score_gemma":0.0012676651,"teacher_disagreement_score":0.04676182,"about_ca_system_score_codex":0.00006921317,"about_ca_system_score_gemma":0.00013015707,"threshold_uncertainty_score":0.91995305},"labels":[],"label_agreement":null},{"id":"W1974828582","doi":"10.1007/s00039-014-0264-9","title":"Lipschitz Homotopy Groups of the Heisenberg Groups","year":2014,"lang":"en","type":"article","venue":"Geometric and Functional Analysis","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Lipschitz continuity; Mathematics; Heisenberg group; Homotopy; Space (punctuation); Homotopy group; Tree (set theory); Pure mathematics; Group (periodic table); Combinatorics; Mathematical analysis; Physics","score_opus":0.009810489104378487,"score_gpt":0.18875893018898673,"score_spread":0.17894844108460825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974828582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12863457,0.0012087112,0.8664517,0.0015745178,0.00030339288,0.00005579576,0.000024686531,0.00006513738,0.0016814995],"genre_scores_gemma":[0.996335,0.00009902605,0.0015696804,0.00031124326,0.00012976835,0.0000072527105,0.000018443774,0.0000038094033,0.0015257674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99812806,0.00010215518,0.0003706431,0.00053090474,0.00061948283,0.000248771],"domain_scores_gemma":[0.9984653,0.00045453044,0.00016195307,0.00066332705,0.00013042592,0.00012446757],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0006723926,0.00016800835,0.00041257477,0.0022250155,0.00022263841,0.00011936331,0.000624882,0.00008462648,0.00021909567],"category_scores_gemma":[0.0003561177,0.0000964158,0.0005597072,0.02844113,0.00014629007,0.0002261923,0.0005615536,0.00017024597,0.00005822481],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002201874,0.00040882232,0.26389554,0.000051748237,0.004787722,0.0000045552747,0.00008989434,0.004866449,0.00008058933,0.5570533,0.0051440573,0.16359527],"study_design_scores_gemma":[0.0002518359,0.00011405056,0.8909104,0.0000047929775,0.0015964162,0.000011997626,0.00003127223,0.061763875,0.000064610445,0.029319474,0.015658773,0.00027250036],"about_ca_topic_score_codex":0.0001426988,"about_ca_topic_score_gemma":0.000022625989,"teacher_disagreement_score":0.86770046,"about_ca_system_score_codex":0.000018243154,"about_ca_system_score_gemma":0.000016015458,"threshold_uncertainty_score":0.99220985},"labels":[],"label_agreement":null},{"id":"W1981300700","doi":"10.1007/s00493-013-2771-y","title":"Local chromatic number of quadrangulations of surfaces","year":2013,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Chromatic scale; Vertex (graph theory); Graph; Betti number; Generalization; Discrete mathematics; Mathematical analysis","score_opus":0.010703791616940099,"score_gpt":0.2437316914439877,"score_spread":0.2330278998270476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981300700","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5982479,0.00025045167,0.39442736,0.0006343882,0.00016220075,0.00012079048,0.0000049845808,0.00006413473,0.0060878275],"genre_scores_gemma":[0.99321157,0.000008089105,0.00654931,0.000015778083,0.0000024450255,0.000005003985,0.0000023373877,0.0000017970193,0.00020365509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992287,0.000039709415,0.00025788607,0.0001409089,0.00021392283,0.00011886617],"domain_scores_gemma":[0.99908644,0.00018455453,0.00012544016,0.00041534982,0.00013320462,0.000055007116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009076451,0.00006380908,0.00021627735,0.00009041276,0.000032994812,0.000017600732,0.00059573475,0.00003759237,0.0004859279],"category_scores_gemma":[0.00007881819,0.000047895905,0.000072647956,0.0015198721,0.000095376956,0.00023437984,0.00017407008,0.000041642375,0.00018408825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011782486,0.00075019203,0.02883044,0.000068609304,0.00010406099,0.0000025112004,0.00029998238,0.00023163097,0.0004906414,0.92375284,0.005236329,0.040231586],"study_design_scores_gemma":[0.0007189255,0.00023985826,0.3960151,0.0000326133,0.000059251473,0.000008435763,0.00014943819,0.06420153,0.005539114,0.529526,0.0031315605,0.0003782057],"about_ca_topic_score_codex":0.0004243239,"about_ca_topic_score_gemma":9.899885e-7,"teacher_disagreement_score":0.3949637,"about_ca_system_score_codex":0.000012251092,"about_ca_system_score_gemma":0.000016542132,"threshold_uncertainty_score":0.532057},"labels":[],"label_agreement":null},{"id":"W1981774369","doi":"10.1142/9781848163324_0020","title":"MODERN HOMOLOGY SEARCH","year":2008,"lang":"en","type":"article","venue":"","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Homology (biology); Computational biology; Biology; Genetics; Gene","score_opus":0.047210629766845265,"score_gpt":0.2551440176579211,"score_spread":0.20793338789107585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981774369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044173323,0.000078576944,0.9316186,0.0016028188,0.000036462006,0.000016145266,8.13237e-7,0.00010996833,0.022363337],"genre_scores_gemma":[0.9613454,0.000038108934,0.030638875,0.0005851421,0.000017740877,0.0000014007948,0.0000016415202,9.3480776e-7,0.007370767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993755,0.000027492591,0.00007460259,0.0002087412,0.00013901349,0.00017463937],"domain_scores_gemma":[0.99949944,0.00005584514,0.000008461743,0.0003422644,0.000029309424,0.000064684085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008551565,0.000042226202,0.00008478854,0.00013403471,0.000090647685,0.000016288193,0.0006650385,0.000029911149,0.000300293],"category_scores_gemma":[0.000023866189,0.000028098737,0.000040941544,0.00083828525,0.000060926213,0.00015235048,0.00030237142,0.00005788959,0.00055470224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033123404,0.00026852728,0.0156536,0.0000024023898,0.0000571965,0.0005117842,0.00043732914,0.0004383413,0.00024194288,0.65186965,0.019088542,0.31142733],"study_design_scores_gemma":[0.0009877672,0.000625827,0.17070866,0.0000019506797,0.000017092723,0.0012975683,0.000047455793,0.59883225,0.003753155,0.14643975,0.07635875,0.0009297744],"about_ca_topic_score_codex":0.000118740696,"about_ca_topic_score_gemma":0.000004198758,"teacher_disagreement_score":0.9171721,"about_ca_system_score_codex":0.0000058807505,"about_ca_system_score_gemma":0.00001591434,"threshold_uncertainty_score":0.71297604},"labels":[],"label_agreement":null},{"id":"W1984447149","doi":"10.1103/revmodphys.79.611","title":"Statistical topology of closed curves: Some applications in polymer physics","year":2007,"lang":"en","type":"article","venue":"Reviews of Modern Physics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":217,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quantum entanglement; Physics; Polymer; Statistical physics; Statistical mechanics; Polymer physics; Quality (philosophy); Degree (music); Polymerization; Topology (electrical circuits); Theoretical physics; Quantum mechanics; Quantum; Mathematics; Combinatorics","score_opus":0.04031230516135732,"score_gpt":0.32206865754799996,"score_spread":0.28175635238664265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984447149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00091277517,0.023929784,0.974359,0.00013001317,0.00002164199,0.00022122716,0.0000435947,0.000013749233,0.00036821267],"genre_scores_gemma":[0.93540734,0.02134503,0.04193897,0.0008166557,0.0001833602,0.00005182923,0.00013557209,0.000014460002,0.00010676851],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985252,0.000084804444,0.0006383575,0.00029565024,0.00022271868,0.00023326241],"domain_scores_gemma":[0.9985527,0.0003393057,0.0003104066,0.00067097007,0.000061332845,0.00006532949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004946844,0.00012888222,0.0006495846,0.00007339345,0.00002270016,0.0000055486794,0.0007199766,0.000047731148,0.000015674028],"category_scores_gemma":[0.00007178349,0.00010003664,0.00014841117,0.0012092809,0.00014365879,0.00021030515,0.00018609175,0.000118460615,0.000017389164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016480441,0.00031798927,0.00062795787,0.00017191931,0.000014497996,7.759068e-7,0.000043514232,0.000012034076,0.00028320108,0.49905613,0.00011657418,0.49935377],"study_design_scores_gemma":[0.00062708376,0.00022297472,0.008028381,0.00025725306,0.00015804547,0.0000020740129,0.000019534109,0.008955792,0.015307681,0.9557823,0.010062625,0.000576234],"about_ca_topic_score_codex":0.00006342206,"about_ca_topic_score_gemma":0.0000065568634,"teacher_disagreement_score":0.93449455,"about_ca_system_score_codex":0.000016271933,"about_ca_system_score_gemma":0.000029858173,"threshold_uncertainty_score":0.4079376},"labels":[],"label_agreement":null},{"id":"W1984640610","doi":"10.1016/s0012-365x(01)00450-2","title":"On Hedetniemi's conjecture and the colour template scheme","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Univerza v Mariboru; Sun Yat-sen University","keywords":"Mathematics; Conjecture; Scheme (mathematics); Combinatorics; Discrete mathematics; Arithmetic; Mathematical analysis","score_opus":0.01831893673306925,"score_gpt":0.22702301616141307,"score_spread":0.20870407942834382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984640610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20119047,0.0020871037,0.6785564,0.04660887,0.0003313675,0.0009552061,0.00008878957,0.00055188057,0.069629915],"genre_scores_gemma":[0.96298337,0.00011714567,0.03324656,0.0013043691,0.000033885346,0.000016824639,0.0000036128124,0.0000075208686,0.0022867364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999102,0.00004523346,0.00019506818,0.00022620117,0.00024083776,0.0001906575],"domain_scores_gemma":[0.9986745,0.00059881,0.00009602589,0.0005432422,0.000020257681,0.00006716454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002872878,0.00012880709,0.00023850153,0.000070692615,0.00016826858,0.00019827152,0.00063279463,0.00005421198,0.0002019629],"category_scores_gemma":[0.00031616975,0.000062541316,0.00007893994,0.0005362632,0.00016537198,0.00010314551,0.0002525847,0.00013780806,0.00016774867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000246085,0.000038613263,0.000020392417,0.000012927288,0.000038213355,0.000009170526,0.0006456579,0.000009563802,0.0000057549028,0.9933964,0.003960432,0.0018604173],"study_design_scores_gemma":[0.0015970144,0.00018016981,0.0001571372,0.000039855033,0.000065523454,0.00007420241,0.0002474703,0.38968816,0.00013121153,0.59671676,0.010716197,0.00038629607],"about_ca_topic_score_codex":0.0000067884816,"about_ca_topic_score_gemma":0.0000017638424,"teacher_disagreement_score":0.7617929,"about_ca_system_score_codex":0.0000071284226,"about_ca_system_score_gemma":0.0000025359911,"threshold_uncertainty_score":0.2550361},"labels":[],"label_agreement":null},{"id":"W1990285456","doi":"10.1007/pl00001293","title":"Cellular Structures Determined by Polygons and Trees","year":2001,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Polytope; Combinatorics; Moduli space; Polyhedron; Integer (computer science); Space (punctuation); Enumeration; Pure mathematics; Computer science","score_opus":0.03134408109571775,"score_gpt":0.2736930031292617,"score_spread":0.24234892203354397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990285456","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93921983,0.005291149,0.049956515,0.0033825336,0.00019309737,0.00007129478,0.000024918636,0.00008394787,0.0017767091],"genre_scores_gemma":[0.9981349,0.0007717537,0.00031654802,0.000245138,0.000010510052,0.0000013447486,0.000006871864,0.0000029788685,0.0005099585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908763,0.000039243132,0.00019738333,0.00023374398,0.000227357,0.00021465331],"domain_scores_gemma":[0.99919724,0.00011940315,0.00009864001,0.00037827677,0.00008734706,0.000119080665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014576403,0.00010830811,0.00021738604,0.00016604592,0.000071040646,0.00006031241,0.00059810333,0.00006182608,0.000022914948],"category_scores_gemma":[0.000104624785,0.00008514064,0.00005468777,0.0010727812,0.00007088904,0.00023193737,0.00022078847,0.00006828157,0.0000036428657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015420806,0.0003995462,0.015098237,0.000017901519,0.00012212772,0.00007210285,0.00015252603,0.000010187152,0.004210637,0.8439094,0.029204391,0.106787555],"study_design_scores_gemma":[0.0007009763,0.0008716768,0.028890744,0.000009802115,0.000042785436,0.000024946365,0.00004261494,0.0029551177,0.050249353,0.7966191,0.11903318,0.0005596947],"about_ca_topic_score_codex":0.0000773735,"about_ca_topic_score_gemma":0.0000023027794,"teacher_disagreement_score":0.10622786,"about_ca_system_score_codex":0.0000028012626,"about_ca_system_score_gemma":0.000009984263,"threshold_uncertainty_score":0.34719342},"labels":[],"label_agreement":null},{"id":"W1993582455","doi":"10.1016/j.jctb.2005.06.008","title":"A counterexample to a conjecture of Björner and Lovász on the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi>χ</mml:mi></mml:math>-coloring complex","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Counterexample; Conjecture; Combinatorics; Vertex (graph theory); Graph; Mathematics; Discrete mathematics; Computer science","score_opus":0.019918449676751014,"score_gpt":0.24133005701670038,"score_spread":0.22141160733994936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993582455","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9931925,0.00017649653,0.0023983957,0.0017371076,0.0011756986,0.00004214532,0.000025063639,0.00002780947,0.0012247915],"genre_scores_gemma":[0.9968902,0.000081095706,0.001378552,0.0009788655,0.0005810346,0.000010070804,0.0000040306836,0.00001845337,0.000057681948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979381,0.00018162384,0.0005848054,0.0002827985,0.000667626,0.00034504017],"domain_scores_gemma":[0.99759847,0.0009332513,0.00060154864,0.00054549595,0.00013270443,0.00018851164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015022078,0.0002079024,0.0003145683,0.00017835104,0.00029706277,0.00030351875,0.0010566696,0.00017294743,0.00015332234],"category_scores_gemma":[0.0006985157,0.00016157862,0.0002783859,0.0005898714,0.00026754627,0.0005898543,0.00054732716,0.00039848508,0.00006203319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000541032,0.000121717574,0.000010337247,0.000021887021,0.00020813,0.000052895935,0.00075575954,0.0003263863,0.00049425464,0.99447256,0.0012507535,0.0017442855],"study_design_scores_gemma":[0.007047386,0.014871071,0.0018875836,0.00078686746,0.00090679957,0.0018059084,0.0036528509,0.16716531,0.043334194,0.45888168,0.29788026,0.0017800726],"about_ca_topic_score_codex":0.00004376816,"about_ca_topic_score_gemma":0.000014779867,"teacher_disagreement_score":0.5355909,"about_ca_system_score_codex":0.00001934493,"about_ca_system_score_gemma":0.00011886272,"threshold_uncertainty_score":0.6588985},"labels":[],"label_agreement":null},{"id":"W1997435192","doi":"10.1093/biomet/asm004","title":"Maxima of discretely sampled random fields, with an application to 'bubbles'","year":2007,"lang":"en","type":"article","venue":"Biometrika","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Maxima; Mathematics; Random field; Upper and lower bounds; Lattice (music); Gaussian; Bonferroni correction; Statistical physics; Mathematical analysis; Combinatorics; Statistics; Physics","score_opus":0.017904789743260464,"score_gpt":0.2721477490348841,"score_spread":0.2542429592916236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997435192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04866079,0.0000749333,0.9497002,0.00035931452,0.000033128807,0.00016098858,0.000019405354,0.00006155019,0.0009297011],"genre_scores_gemma":[0.90643036,0.0000070151673,0.09316255,0.00023786575,0.000039590883,0.000008006118,0.000022226879,0.000003297027,0.00008906494],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9986834,0.000025698308,0.00025710958,0.00036858206,0.0004232664,0.00024192348],"domain_scores_gemma":[0.9987928,0.00022626437,0.00010221695,0.0005495006,0.00014208427,0.00018710988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008164613,0.000102252845,0.00022853505,0.0013285395,0.000050903942,0.00005285626,0.0008325805,0.00006181473,0.000028555014],"category_scores_gemma":[0.0002117773,0.000067609515,0.000055970904,0.010062297,0.000042782296,0.0002221195,0.0001519912,0.000050444592,0.000036874153],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042549483,0.0004317941,0.0068079135,0.000018502134,0.00010149956,0.000012062669,0.00018301903,0.00006883125,0.0032575417,0.034078944,0.0007633302,0.95385104],"study_design_scores_gemma":[0.012888774,0.0117689455,0.46770105,0.00006485277,0.0002618046,0.000076048185,0.00055933016,0.014532433,0.11001881,0.032464065,0.34677655,0.0028873668],"about_ca_topic_score_codex":0.00039281705,"about_ca_topic_score_gemma":0.00009169327,"teacher_disagreement_score":0.9509637,"about_ca_system_score_codex":0.00002161996,"about_ca_system_score_gemma":0.000019960822,"threshold_uncertainty_score":0.48346},"labels":[],"label_agreement":null},{"id":"W1998475227","doi":"10.1016/j.jctb.2005.06.002","title":"Multiplicative graphs and semi-lattice endomorphisms in the category of graphs","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Multiplicative function; Endomorphism; Mathematics; Combinatorics; Lattice (music); Pathwidth; Discrete mathematics; Graph; Physics; Line graph","score_opus":0.011375846142226588,"score_gpt":0.23998390167450545,"score_spread":0.22860805553227886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998475227","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9757854,0.0037013968,0.011195622,0.0048345057,0.0015172686,0.00026477766,0.0000143977995,0.00002931625,0.0026573497],"genre_scores_gemma":[0.997688,0.00034794025,0.0016821884,0.00017162443,0.00006658694,0.0000027392073,6.538096e-7,0.000003146823,0.000037124548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982725,0.00048103768,0.0005431038,0.00015354184,0.00037379307,0.00017602932],"domain_scores_gemma":[0.997702,0.001189095,0.00050802145,0.00033567185,0.00019167658,0.00007353294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022491352,0.00012760602,0.00037246064,0.0003619105,0.000082916646,0.0000634643,0.001144955,0.00006772086,0.000022726017],"category_scores_gemma":[0.0004899664,0.00007515763,0.00014195948,0.0013086278,0.00031588186,0.0007992075,0.00016220997,0.0002952866,0.0000017035403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014050218,0.00018462562,0.0005772419,0.000004591866,0.0000555356,0.000017583765,0.0012060495,0.000013949486,0.00022535234,0.9908577,0.00016154627,0.0065552806],"study_design_scores_gemma":[0.0010625145,0.00048372275,0.0044254307,0.000012100459,0.00004086734,0.00011171681,0.00066910055,0.00005519566,0.0014948339,0.9866896,0.004850145,0.00010473912],"about_ca_topic_score_codex":0.000015357384,"about_ca_topic_score_gemma":0.0000036733431,"teacher_disagreement_score":0.02190263,"about_ca_system_score_codex":0.000016752962,"about_ca_system_score_gemma":0.000036498343,"threshold_uncertainty_score":0.30648392},"labels":[],"label_agreement":null},{"id":"W2000375636","doi":"10.1016/j.jmva.2010.04.016","title":"Exploring uses of persistent homology for statistical analysis of landmark-based shape data","year":2010,"lang":"en","type":"article","venue":"Journal of Multivariate Analysis","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Banff International Research Station for Mathematical Innovation and Discovery; University of Alberta","keywords":"Landmark; Persistent homology; Mathematics; Point distribution model; Euclidean geometry; Shape analysis (program analysis); Topological data analysis; Dimensionality reduction; Pattern recognition (psychology); Euclidean distance; Statistical analysis; Artificial intelligence; Statistics; Geometry; Algorithm; Computer science","score_opus":0.18105813107649876,"score_gpt":0.34517367793472953,"score_spread":0.16411554685823077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000375636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35370865,0.00008974294,0.6452571,0.00030916248,0.000111044836,0.000043756485,0.00046209857,0.0000066759108,0.000011760887],"genre_scores_gemma":[0.84747624,0.000035598958,0.15225528,0.00003383154,0.000041802992,0.000002631106,0.00013969533,0.000004275549,0.000010607771],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972822,0.00019108142,0.0012466972,0.00042497987,0.00058302993,0.0002719775],"domain_scores_gemma":[0.9944235,0.002077575,0.0013225041,0.0012081835,0.00078652555,0.00018171695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020442863,0.00017430176,0.0014314278,0.0034110453,0.00007218038,0.000052761156,0.0022302538,0.000092705945,0.00027310904],"category_scores_gemma":[0.0020871907,0.00012323624,0.0015855515,0.00712385,0.0001408232,0.00058880035,0.00035663077,0.0002449087,9.658487e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009785874,0.0050990274,0.29236144,0.00021061767,0.2686665,0.00024009723,0.0012258651,0.28943467,0.013782236,0.024256825,0.0008373954,0.102906734],"study_design_scores_gemma":[0.00062799116,0.00028519484,0.12545554,0.00000569585,0.030111097,0.0000036548652,0.00007754101,0.8424271,0.00024818478,0.00011342984,0.0004972477,0.0001473416],"about_ca_topic_score_codex":0.00050436135,"about_ca_topic_score_gemma":0.00020361616,"teacher_disagreement_score":0.5529924,"about_ca_system_score_codex":0.000019436093,"about_ca_system_score_gemma":0.00010046865,"threshold_uncertainty_score":0.50254285},"labels":[],"label_agreement":null},{"id":"W2002340571","doi":"10.1515/apam-2013-0010","title":"Boolean sum of graphs and reconstruction up to complementation","year":2013,"lang":"en","type":"article","venue":"Advances in Pure and Applied Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Complementation; Combinatorics; Vertex (graph theory); Discrete mathematics; Mathematics; Graph; Integer (computer science); Computer science; Genetics; Biology; Phenotype","score_opus":0.012799257943823921,"score_gpt":0.2607504125233438,"score_spread":0.24795115457951988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002340571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49334955,0.00048658575,0.50241315,0.00035435404,0.00007627968,0.00033589933,0.0000065541726,0.000034019573,0.0029436424],"genre_scores_gemma":[0.75162596,0.00034720145,0.2478944,0.00007728248,0.000004240308,0.000022618042,0.0000026253326,0.0000017138564,0.000023936287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994938,0.0000043769564,0.00019180254,0.00014320081,0.00008032879,0.00008652202],"domain_scores_gemma":[0.9996747,0.00007500055,0.00007334385,0.00012279885,0.000017835038,0.00003635217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000886274,0.000058479567,0.00014090724,0.00013087067,0.000028657809,0.000031668147,0.00012047892,0.00001851542,0.000015899466],"category_scores_gemma":[0.000014015202,0.00004474574,0.000010482815,0.0004340275,0.000043693657,0.00026763574,0.00008867642,0.000032466578,0.0000043512973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001053668,0.000024142288,0.0005900161,0.0000546979,0.0000059334598,1.4043992e-7,0.000533792,0.000024380519,0.0005290464,0.5671904,0.00007669352,0.43096972],"study_design_scores_gemma":[0.0002519124,0.000059433667,0.0017356583,0.00002422032,0.000010421439,0.000008010769,0.001566588,0.0025159114,0.0014601323,0.9914467,0.0007920843,0.00012893528],"about_ca_topic_score_codex":0.0000073938786,"about_ca_topic_score_gemma":0.000013676715,"teacher_disagreement_score":0.43084076,"about_ca_system_score_codex":0.0000031871114,"about_ca_system_score_gemma":0.0000021861067,"threshold_uncertainty_score":0.18246783},"labels":[],"label_agreement":null},{"id":"W2007714618","doi":"10.1088/1751-8113/44/49/495003","title":"A proof of selection rules for critical dense polymers","year":2011,"lang":"en","type":"article","venue":"Journal of Physics A Mathematical and Theoretical","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Selection (genetic algorithm); Computer science; Artificial intelligence","score_opus":0.02297745431379735,"score_gpt":0.26521954106831247,"score_spread":0.2422420867545151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007714618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051579487,0.000068148736,0.9472235,0.00041875572,0.000036257352,0.000058609185,0.0000056905888,0.0000071051227,0.00060246064],"genre_scores_gemma":[0.8534568,0.0000052510695,0.14641824,0.000041243675,0.00006299375,0.0000025510435,2.166913e-7,0.000003678317,0.000009035509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896294,0.000054528344,0.0004264583,0.00013112623,0.00024702615,0.00017792522],"domain_scores_gemma":[0.9986146,0.0007390737,0.00014956699,0.00012316077,0.00022138578,0.0001522207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000490798,0.000097733675,0.0003612224,0.000088191584,0.000044884735,0.000031747568,0.00030489423,0.000056370092,0.00015662707],"category_scores_gemma":[0.0008003076,0.000059724858,0.00019196779,0.00028203602,0.00052337686,0.00020631611,0.000096114934,0.0001197533,0.0000023537993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044572214,0.00038902112,0.000021483993,0.00005639241,0.000052930627,0.0000040074847,0.00018077511,3.217452e-7,0.00014294276,0.98399943,0.00001833731,0.015089771],"study_design_scores_gemma":[0.00021244943,0.0006733254,0.00006318079,0.00003206458,0.00009762201,0.00008596327,0.000030782943,0.009133234,0.009800635,0.9797806,0.000016134474,0.00007401467],"about_ca_topic_score_codex":5.864431e-7,"about_ca_topic_score_gemma":3.391635e-8,"teacher_disagreement_score":0.8018773,"about_ca_system_score_codex":0.000006282281,"about_ca_system_score_gemma":0.000027461027,"threshold_uncertainty_score":0.2435509},"labels":[],"label_agreement":null},{"id":"W2010515315","doi":"10.1017/s0963548314000315","title":"Part Sizes of Smooth Supercritical Compositional Structures","year":2014,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Poisson distribution; Mathematics; Supercritical fluid; Multiplicity (mathematics); Combinatorics; Genus; Graph; Statistical physics; Mathematical analysis; Statistics; Physics; Biology","score_opus":0.019875927365830923,"score_gpt":0.24662250376672315,"score_spread":0.22674657640089224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010515315","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57910883,0.00012009952,0.4177354,0.0007510316,0.0004959971,0.00012664206,0.0000082553,0.00017125154,0.0014824929],"genre_scores_gemma":[0.9793596,0.000002457154,0.020404886,0.00013947063,0.000065892564,0.0000019251518,0.000015360127,0.0000047611093,0.0000056337212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997713,0.00028625145,0.0005524902,0.00057045015,0.00051372434,0.00036405431],"domain_scores_gemma":[0.99755555,0.0011434221,0.00007097955,0.00075272674,0.00032363136,0.000153659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010472449,0.00018138633,0.0004281523,0.00014436204,0.00021182843,0.00009764147,0.001234884,0.00009844006,0.00003313683],"category_scores_gemma":[0.00096526113,0.00015429877,0.00014886096,0.0012490613,0.0002512302,0.00021446265,0.00083309045,0.00022902981,0.0000093909775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002476781,0.0002384441,0.010283844,0.000042556905,0.000016652148,0.0000012169215,0.000047190493,0.00018857725,0.00009727459,0.9790665,0.00013002861,0.009885233],"study_design_scores_gemma":[0.00034095743,0.00020243698,0.031192876,0.000016290265,0.00001700716,0.000006222343,0.000008613132,0.03053535,0.0015194482,0.9348861,0.0010434688,0.0002312518],"about_ca_topic_score_codex":0.000023733655,"about_ca_topic_score_gemma":0.0000011408753,"teacher_disagreement_score":0.40025076,"about_ca_system_score_codex":0.00005428924,"about_ca_system_score_gemma":0.000041677955,"threshold_uncertainty_score":0.62921214},"labels":[],"label_agreement":null},{"id":"W2010585683","doi":"10.1016/j.comgeo.2006.05.009","title":"Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree","year":2009,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Science Foundation","keywords":"Contour line; Scalar field; Scalar (mathematics); Tree (set theory); Visualization; Computational topology; Computer science; Topology (electrical circuits); Computer vision; Artificial intelligence; Computer graphics (images); Geometry; Mathematics; Geography; Cartography; Mathematical analysis; Combinatorics","score_opus":0.032246098413128386,"score_gpt":0.29592415510146086,"score_spread":0.2636780566883325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010585683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23203689,0.0009498853,0.7635102,0.0028177158,0.00009867886,0.00006643628,0.000006600819,0.000078917124,0.0004346211],"genre_scores_gemma":[0.9463594,0.00001710552,0.051900297,0.0015412365,0.000069098125,0.0000014153384,0.0000120222085,0.0000033652486,0.00009606854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858636,0.00008757342,0.00027574474,0.00041998006,0.00031639138,0.00031394782],"domain_scores_gemma":[0.998753,0.0006389385,0.000116280076,0.00028698664,0.00009760765,0.00010717551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004091449,0.00015277918,0.0002336428,0.00032218834,0.00045934189,0.00025182762,0.0006575559,0.00007114044,0.000035029858],"category_scores_gemma":[0.00017986735,0.00010416725,0.00007855899,0.001912034,0.00012988612,0.00038293414,0.00027191074,0.00016355056,0.00001640338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002098023,0.00030274593,0.02994794,0.000020730502,0.0001820633,0.00005584378,0.00043403875,0.19081616,0.00041946073,0.4196048,0.0010406375,0.35715458],"study_design_scores_gemma":[0.00057731767,0.00018858736,0.20161127,0.000016911694,0.00004946336,0.00014193937,0.0001828487,0.6560779,0.000117425094,0.13845943,0.0021815435,0.00039532856],"about_ca_topic_score_codex":0.000037023507,"about_ca_topic_score_gemma":0.000002103564,"teacher_disagreement_score":0.7143225,"about_ca_system_score_codex":0.000029982673,"about_ca_system_score_gemma":0.000033607757,"threshold_uncertainty_score":0.4247817},"labels":[],"label_agreement":null},{"id":"W2012039160","doi":"10.1007/s00454-011-9383-3","title":"Oriented Interval Greedoids","year":2011,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Mathematics; Combinatorics; Enumeration; Interval (graph theory); Oriented matroid; Simplicial complex; Regular polygon; Subdivision; Discrete mathematics; Graphic matroid; Geometry","score_opus":0.0279979525442483,"score_gpt":0.25306902121828273,"score_spread":0.22507106867403442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012039160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026783662,0.000116762,0.9555714,0.00027985303,0.00033276022,0.000069816895,0.00003398235,0.00021506894,0.016596654],"genre_scores_gemma":[0.8970618,0.000004388724,0.10140992,0.0005480779,0.00006160373,0.000008138724,0.000078403704,0.000006867339,0.00082079973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9981822,0.00006633559,0.00035561272,0.00053630106,0.0005179561,0.00034159666],"domain_scores_gemma":[0.99893093,0.00014769357,0.00012356776,0.00043083762,0.00017707037,0.00018989242],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026513386,0.00018678054,0.00024359576,0.0006435514,0.00014617459,0.0000907358,0.001111986,0.00006902447,0.0013598532],"category_scores_gemma":[0.00013457602,0.00015065723,0.00018861,0.0032096766,0.00012004744,0.0005941423,0.00059604296,0.00016628328,0.00043724134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040611045,0.00046791608,0.02995574,0.000018287255,0.00032718983,0.00013242074,0.00087309186,0.0020892369,0.000012740805,0.8855153,0.007743879,0.07282361],"study_design_scores_gemma":[0.0010964249,0.000626273,0.56409514,0.000027334267,0.00007257512,0.00009092901,0.00023960877,0.23446779,0.00016602715,0.17853306,0.01955287,0.0010319412],"about_ca_topic_score_codex":0.000105730905,"about_ca_topic_score_gemma":0.0000030719434,"teacher_disagreement_score":0.8702781,"about_ca_system_score_codex":0.000031030148,"about_ca_system_score_gemma":0.00003636849,"threshold_uncertainty_score":0.999553},"labels":[],"label_agreement":null},{"id":"W2012238497","doi":"10.1090/s0002-9947-2010-05186-4","title":"Inapproximability for metric embeddings into $\\mathbb{R}^{d}$","year":2010,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Metric (unit); Combinatorics; Metric space; Pure mathematics; Discrete mathematics","score_opus":0.010939535360017264,"score_gpt":0.27332165237010453,"score_spread":0.2623821170100873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012238497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08193893,0.000007757899,0.9149572,0.0025254092,0.000075668584,0.00021981345,0.000016537639,0.00007748425,0.00018114471],"genre_scores_gemma":[0.5830796,0.000004336311,0.41661736,0.00014745195,0.000012213298,0.00003811806,5.424363e-7,0.0000043529976,0.00009604405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873054,0.00003923641,0.00034995755,0.00031714007,0.00031634243,0.00024680144],"domain_scores_gemma":[0.99774736,0.0008600816,0.0002290158,0.0009465452,0.000118550386,0.00009845798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064527517,0.00013620325,0.0003888307,0.00006569724,0.0002618809,0.000049099956,0.001464667,0.00005569506,0.00009227345],"category_scores_gemma":[0.00038615978,0.00008187681,0.0008165705,0.0030267495,0.00078219007,0.00019097858,0.00008210954,0.00028384637,0.000011126413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004639779,0.0032994528,0.00092595187,0.00068082905,0.0010677141,4.846554e-7,0.005610906,0.00034792227,0.03196224,0.53361535,0.0027074958,0.41973525],"study_design_scores_gemma":[0.0006433311,0.00041824207,0.003934325,0.00001622129,0.00036499614,0.000020510655,0.0009401527,0.1855892,0.013523391,0.7898048,0.004173991,0.0005708474],"about_ca_topic_score_codex":0.00008967825,"about_ca_topic_score_gemma":0.0000057127545,"teacher_disagreement_score":0.50114065,"about_ca_system_score_codex":0.000027578148,"about_ca_system_score_gemma":0.000035999787,"threshold_uncertainty_score":0.33388394},"labels":[],"label_agreement":null},{"id":"W2013368271","doi":"10.1016/j.disc.2004.04.022","title":"Small cones of m-hemimetrics","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Combinatorics; Set (abstract data type); Cone (formal languages); Discrete mathematics; Algorithm; Computer science","score_opus":0.03727717459418168,"score_gpt":0.2542964972022554,"score_spread":0.21701932260807372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013368271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024276612,0.00028519347,0.9640077,0.0007468625,0.000041851756,0.000063991116,0.000015855818,0.00007835987,0.010483624],"genre_scores_gemma":[0.5439107,0.00004325285,0.45508382,0.0001129271,0.000035598234,0.0000030716858,0.0000059758436,0.000004493883,0.0008002126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907947,0.000014969772,0.00032556473,0.00017618238,0.00023158545,0.000172217],"domain_scores_gemma":[0.9988993,0.0002495,0.00016015362,0.00055413524,0.000068958376,0.000067967325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025432996,0.00009801068,0.00024752656,0.00023425756,0.000035559122,0.000046458023,0.0008666263,0.00004703424,0.00008382791],"category_scores_gemma":[0.00032424045,0.0000689061,0.00010779202,0.0015056796,0.00005536738,0.00015191632,0.00028516128,0.00006121091,0.000100394376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001314263,0.00030028884,0.0004946721,0.00008118124,0.00008054274,0.000004884789,0.0007235914,0.00015733385,0.00033550494,0.92594576,0.0010317649,0.07084319],"study_design_scores_gemma":[0.0016369806,0.00054409215,0.0031875505,0.00013227267,0.0003576107,0.000074608586,0.00091094675,0.5691595,0.061067875,0.2699232,0.09126421,0.0017411433],"about_ca_topic_score_codex":0.0000073946317,"about_ca_topic_score_gemma":0.0000027960298,"teacher_disagreement_score":0.65602255,"about_ca_system_score_codex":0.000010139428,"about_ca_system_score_gemma":0.000011367136,"threshold_uncertainty_score":0.28099093},"labels":[],"label_agreement":null},{"id":"W2018883494","doi":"10.1090/s0002-9947-2014-06134-5","title":"On the consistency of the combinatorial codifferential","year":2014,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies; National Science Foundation","keywords":"Counterexample; Subdivision; Triangulation; Piecewise; Consistency (knowledge bases); Operator (biology); Combinatorial method","score_opus":0.012527677058110882,"score_gpt":0.23001449469484286,"score_spread":0.21748681763673197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018883494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1460997,0.0000050949707,0.84390694,0.008133682,0.00023396336,0.00016312208,0.000018660849,0.000027872475,0.00141093],"genre_scores_gemma":[0.9969923,0.0000047666185,0.0024687666,0.00039962967,0.000014666628,0.00000778593,1.6245026e-7,0.0000031679938,0.00010875576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987566,0.00021947679,0.0002819757,0.00015591153,0.00043681666,0.00014924066],"domain_scores_gemma":[0.9972521,0.0014053882,0.00026577624,0.0009832651,0.000057103913,0.000036355017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003752284,0.00010046815,0.0002940821,0.0000151073,0.00027700205,0.000022649292,0.0016205112,0.000029964192,0.00012691616],"category_scores_gemma":[0.00023253089,0.00003920256,0.000692412,0.0011512078,0.001254593,0.000039564056,0.00008824039,0.0002063628,0.000009827618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059281047,0.0004236034,0.00005505991,0.000018753037,0.0001483434,2.1360204e-8,0.00034459814,0.000096805976,0.00032787796,0.9936547,0.0007915465,0.0041327556],"study_design_scores_gemma":[0.000537678,0.00038862968,0.0074137086,0.000053553522,0.00033282183,0.0000048234015,0.0004982283,0.040214546,0.006400846,0.9433357,0.00058454555,0.00023488529],"about_ca_topic_score_codex":0.00005721764,"about_ca_topic_score_gemma":0.0000014304514,"teacher_disagreement_score":0.8508926,"about_ca_system_score_codex":0.000014505584,"about_ca_system_score_gemma":0.000023057093,"threshold_uncertainty_score":0.46226004},"labels":[],"label_agreement":null},{"id":"W2021186992","doi":"10.2478/v10037-012-0019-8","title":"Simple Graphs as Simplicial Complexes: the Mycielskian of a Graph","year":2012,"lang":"en","type":"article","venue":"Formalized Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Simple (philosophy); Combinatorics; Terminology; Graph; Discrete mathematics","score_opus":0.025948639493073817,"score_gpt":0.281675470827225,"score_spread":0.2557268313341512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021186992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20079184,0.00035847368,0.7771683,0.0006793448,0.00025729177,0.00044739654,0.000070153845,0.00022327171,0.020003973],"genre_scores_gemma":[0.9642553,0.00003413582,0.03512737,0.00040574218,0.000040691233,0.000016569382,0.000014132346,0.000006753837,0.0000993385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985148,0.00004856254,0.00045267554,0.00013891784,0.0004086811,0.0004363986],"domain_scores_gemma":[0.9984031,0.0003526334,0.00026079605,0.0007806579,0.000073953954,0.00012885696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006661499,0.00015101684,0.0003304822,0.00020250678,0.00018529649,0.000063347215,0.0013005575,0.000061697516,0.00021160825],"category_scores_gemma":[0.00021761598,0.00008507215,0.00024309849,0.0017101035,0.00013569502,0.0004892411,0.0004340249,0.000107474334,0.00010252557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031124018,0.00022073559,0.000552558,0.000029559498,0.000055202683,5.696819e-7,0.0012364775,0.0000071548734,0.0000848572,0.9944592,0.0018700478,0.0014804862],"study_design_scores_gemma":[0.00057439914,0.00016735394,0.0020710202,0.000012234846,0.0001105346,0.000041598836,0.0010041178,0.003503635,0.0019080342,0.9654679,0.024827894,0.000311323],"about_ca_topic_score_codex":0.0000612102,"about_ca_topic_score_gemma":0.000005557467,"teacher_disagreement_score":0.76346344,"about_ca_system_score_codex":0.000008529937,"about_ca_system_score_gemma":0.000016722113,"threshold_uncertainty_score":0.34691417},"labels":[],"label_agreement":null},{"id":"W2021872174","doi":"10.1017/s0013091512000193","title":"Spaces with Noetherian cohomology","year":2012,"lang":"en","type":"article","venue":"Proceedings of the Edinburgh Mathematical Society","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Université de Nantes; Centre National de la Recherche Scientifique; Ministerio de Economía y Competitividad; Danmarks Grundforskningsfond; Agence Nationale de la Recherche; National Research Foundation; University of Bern","keywords":"Noetherian; Mathematics; Generalization; Pure mathematics; Cohomology; Group (periodic table); Space (punctuation); Group cohomology; Field (mathematics); Galois cohomology; Discrete mathematics; Algebra over a field; Mathematical analysis; Computer science; Physics; Galois group","score_opus":0.014262508021770441,"score_gpt":0.22993984840125725,"score_spread":0.2156773403794868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021872174","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80353695,0.0004129622,0.1326221,0.020749813,0.00051216944,0.0006010439,0.000009219576,0.0003592623,0.041196514],"genre_scores_gemma":[0.92529464,0.00001196921,0.07319089,0.00031576175,0.00016793681,0.000017597165,2.7575953e-7,0.0000062715785,0.000994669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869365,0.0000056562976,0.00023355603,0.000214834,0.00044116392,0.0004111273],"domain_scores_gemma":[0.99914163,0.00018005427,0.00020455413,0.00022083745,0.00011628853,0.00013661855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007324384,0.00014633086,0.00030321185,0.000028189832,0.00013533975,0.000073768206,0.0012520344,0.00010002968,0.0002274993],"category_scores_gemma":[0.0002491618,0.00006989198,0.00023168055,0.0011359054,0.00033679346,0.0004892862,0.00060236524,0.00017497253,0.000010913776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010064783,0.0007089562,0.033111032,0.0001227531,0.00033488727,2.604574e-7,0.0049666036,0.0000027891485,0.0019361451,0.91677856,0.039765995,0.002261954],"study_design_scores_gemma":[0.0020614024,0.00086236873,0.02353764,0.00034060833,0.00084164133,0.00033657884,0.0070961523,0.0146491965,0.042113714,0.8550301,0.05120863,0.0019219263],"about_ca_topic_score_codex":0.0000053357094,"about_ca_topic_score_gemma":8.2640305e-8,"teacher_disagreement_score":0.1217577,"about_ca_system_score_codex":0.00002353306,"about_ca_system_score_gemma":0.000012022784,"threshold_uncertainty_score":0.28501123},"labels":[],"label_agreement":null},{"id":"W2029855664","doi":"10.4153/cjm-2007-043-3","title":"Ideas from Zariski Topology in the Study of Cubical Homology","year":2007,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Mathematical Society","keywords":"Mathematics; Homology (biology); Topology (electrical circuits); Correctness; Noetherian; Axiom; Discrete mathematics; Pure mathematics; Combinatorics; Algebra over a field; Algorithm; Geometry","score_opus":0.027334285321330493,"score_gpt":0.27243523642519324,"score_spread":0.24510095110386274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029855664","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91293,0.00025662582,0.085195936,0.00090118306,0.0001513594,0.00006217379,0.0000046223745,0.0000018368986,0.0004962253],"genre_scores_gemma":[0.9893152,0.0000045536094,0.010413977,0.00020356449,0.00004542116,3.9707854e-7,4.5781877e-7,0.0000020122611,0.00001442846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872243,0.00011711882,0.000614923,0.000098494296,0.00021090469,0.0002361288],"domain_scores_gemma":[0.9981866,0.0008764435,0.00029788658,0.0003632225,0.000092556045,0.00018327648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016073809,0.000074884294,0.00032424295,0.00053326465,0.000047093643,0.000030366955,0.0014503677,0.000068938236,0.00007454072],"category_scores_gemma":[0.00066815095,0.000045066434,0.000071984476,0.0009182145,0.00010534435,0.000088303634,0.00003422957,0.00025128253,0.000007442294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025733967,0.0038192708,0.2796221,0.000036889745,0.00064247125,0.010755175,0.07138117,0.00034701874,0.00007328461,0.5669678,0.0065873894,0.059741743],"study_design_scores_gemma":[0.0021466392,0.0027943489,0.45350853,0.000054294564,0.00025436704,0.00123326,0.04331144,0.0015084083,0.00014444279,0.48955095,0.005065862,0.00042744505],"about_ca_topic_score_codex":0.010313452,"about_ca_topic_score_gemma":0.08715663,"teacher_disagreement_score":0.17388643,"about_ca_system_score_codex":0.000036099704,"about_ca_system_score_gemma":0.00015994831,"threshold_uncertainty_score":0.996277},"labels":[],"label_agreement":null},{"id":"W2032750179","doi":"10.1117/12.872227","title":"Exploring height fields: interactive visualization and applications","year":2011,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Bishop's University","funders":"","keywords":"Visualization; Computer science; Computer graphics; Triangulation; Computational geometry; Field (mathematics); Algorithm; Computer graphics (images); Mathematics; Geometry; Artificial intelligence","score_opus":0.036218812644146135,"score_gpt":0.2455251993080928,"score_spread":0.20930638666394666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032750179","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9817794,0.00008240777,0.014195856,0.0006866805,0.00010984413,0.00029995563,0.000015595911,0.00008841994,0.0027418435],"genre_scores_gemma":[0.8125827,0.00039992356,0.1859959,0.00015749432,0.0002744565,0.00041939848,0.000008181347,0.00002379085,0.00013815849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99861175,1.3333591e-8,0.00042727066,0.00037259347,0.00035877025,0.00022958228],"domain_scores_gemma":[0.99860007,0.00013024967,0.0002563781,0.00006796515,0.0008479885,0.00009736812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003282555,0.0001823026,0.0002550004,0.00015540022,0.00008587726,0.00011027202,0.0010561917,0.000088922505,0.000011477516],"category_scores_gemma":[0.0002868812,0.0001411786,0.00026905086,0.00069519825,0.00012691898,0.0013610448,0.0003501217,0.00016722888,0.0000016944929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016480042,0.000105632935,0.0002772987,0.00008945138,0.00021872726,5.209225e-8,0.0005148359,0.000007124196,0.011194525,0.9845742,0.0003042116,0.0026974564],"study_design_scores_gemma":[0.004108878,0.0025522602,0.023766004,0.0008525856,0.0010392019,0.00010353083,0.012889197,0.28029293,0.51123446,0.11263844,0.047625005,0.0028975108],"about_ca_topic_score_codex":0.000018085462,"about_ca_topic_score_gemma":1.5681232e-7,"teacher_disagreement_score":0.8719358,"about_ca_system_score_codex":0.000046892324,"about_ca_system_score_gemma":0.000010764678,"threshold_uncertainty_score":0.5757097},"labels":[],"label_agreement":null},{"id":"W2034649530","doi":"10.1007/s004540010072","title":"Geometric Construction of a Coboundary of a Cycle","year":2001,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphism; Rectangle; Mathematics; Combinatorics; Discrete mathematics; Computer science; Geometry","score_opus":0.010762083353932824,"score_gpt":0.25145233626384383,"score_spread":0.240690252909911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034649530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32708448,0.00035273875,0.6704396,0.00023200232,0.00012037255,0.000065404565,0.000056265693,0.000044497658,0.0016046491],"genre_scores_gemma":[0.9197111,0.00004423907,0.07998846,0.00007516041,0.000030500161,0.000003608664,0.00007806992,0.0000047629455,0.000064105436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9980557,0.000065246335,0.0005747745,0.00037389726,0.00069228106,0.00023810177],"domain_scores_gemma":[0.9983732,0.00045990883,0.00036848473,0.0003693406,0.00032390442,0.00010514232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032824388,0.000148024,0.0003833614,0.0017672343,0.00009100835,0.000049303082,0.00072259986,0.000073606774,0.00025111876],"category_scores_gemma":[0.00026571116,0.00012900519,0.00020469271,0.009890215,0.00027713345,0.00042660072,0.00029509768,0.00011585023,0.000030487807],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008171012,0.0006525318,0.12939581,0.00010453136,0.00049461087,0.000044693297,0.00020435464,0.07727424,0.00018646473,0.47841558,0.0005797244,0.31256574],"study_design_scores_gemma":[0.0016869372,0.0006749318,0.6184292,0.000056876837,0.00011676709,0.0002445979,0.00026565118,0.16129358,0.0006880466,0.21100202,0.0048486334,0.0006927836],"about_ca_topic_score_codex":0.00011967149,"about_ca_topic_score_gemma":0.0000015996985,"teacher_disagreement_score":0.59262663,"about_ca_system_score_codex":0.000027878114,"about_ca_system_score_gemma":0.000081090475,"threshold_uncertainty_score":0.5260679},"labels":[],"label_agreement":null},{"id":"W2035530447","doi":"10.4153/cjm-2002-013-7","title":"Framed Stratified Sets in Morse Theory","year":2002,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Champlain Regional College; St. Lawrence College","funders":"","keywords":"Morse theory; Morse code; Mathematics; Metric (unit); Pure mathematics; Moduli space; Manifold (fluid mechanics); Circle-valued Morse theory; Order (exchange); Function (biology); Moduli; Mathematical analysis; Computer science; Physics; Quantum mechanics","score_opus":0.03470491367325723,"score_gpt":0.23125580710054336,"score_spread":0.19655089342728613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035530447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48206744,0.002507784,0.49378273,0.008939586,0.0006019156,0.00019008009,0.000033339602,0.000030529274,0.011846595],"genre_scores_gemma":[0.95914704,0.000022976406,0.040107686,0.00036704825,0.000027244483,5.9307905e-7,5.0517366e-7,0.0000036251856,0.00032326163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906623,0.00005591709,0.0003900047,0.00008752323,0.00017469698,0.00022560965],"domain_scores_gemma":[0.99889123,0.0002195783,0.00018063521,0.00027459965,0.00006886706,0.00036508086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064248533,0.000078991034,0.00022044312,0.00054857845,0.00004498353,0.00010990949,0.0008227821,0.000057327405,0.00046639048],"category_scores_gemma":[0.0006382102,0.000058256526,0.00007719227,0.0008650053,0.000051186304,0.00024047006,0.000020851245,0.00020011362,0.000076803706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021487047,0.00040452313,0.00259083,0.00006485475,0.00017156519,0.0031598825,0.008883952,0.000747899,0.000035986304,0.85278404,0.02279946,0.10835488],"study_design_scores_gemma":[0.0010908769,0.00035134275,0.0077261874,0.00020047196,0.00008354917,0.0008705907,0.0017737688,0.07856649,0.0001715584,0.89516854,0.013356536,0.0006400759],"about_ca_topic_score_codex":0.00022342308,"about_ca_topic_score_gemma":0.002908943,"teacher_disagreement_score":0.47707963,"about_ca_system_score_codex":0.000049171867,"about_ca_system_score_gemma":0.000101582926,"threshold_uncertainty_score":0.5106649},"labels":[],"label_agreement":null},{"id":"W2036069578","doi":"10.1103/physreve.80.021130","title":"Critical exponents for the homology of Fortuin-Kasteleyn clusters on a torus","year":2009,"lang":"en","type":"article","venue":"Physical Review E","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Torus; Physics; Combinatorics; Homology (biology); Cluster (spacecraft); Exponent; Type (biology); Mathematical physics; Mathematics; Geometry","score_opus":0.03736089290015637,"score_gpt":0.3542597046764104,"score_spread":0.316898811776254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036069578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010496965,0.02777942,0.8503641,0.10651091,0.00047611064,0.0013226003,0.000056970068,0.00012045606,0.0028725052],"genre_scores_gemma":[0.98801696,0.0019610035,0.001890851,0.007934405,0.00010652908,0.000039947397,0.000003906016,0.0000025760032,0.000043796692],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998965,0.0000694381,0.00022816798,0.0002751623,0.00022833317,0.00023387528],"domain_scores_gemma":[0.9980823,0.0011579258,0.00006974452,0.0005425316,0.000072157345,0.00007534816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024208719,0.00010608822,0.00039177822,0.000039968472,0.00006539001,0.000019877336,0.00085791276,0.000019924491,0.0000152332295],"category_scores_gemma":[0.0010889425,0.0000559531,0.00029508586,0.0005975671,0.00008313374,0.00011331968,0.000108126034,0.00008866226,0.000036997317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009676164,0.00038823302,0.0000048583233,0.00010007712,0.000025027679,0.0000029014702,0.000019907891,0.000007802389,0.000048971226,0.42392036,0.0035040937,0.5719681],"study_design_scores_gemma":[0.0018803319,0.010228791,0.022581909,0.0017847926,0.0011944548,0.000044217908,0.000038302445,0.08310501,0.0020531095,0.6165636,0.25912935,0.0013961471],"about_ca_topic_score_codex":0.000005775782,"about_ca_topic_score_gemma":4.0537506e-7,"teacher_disagreement_score":0.97752005,"about_ca_system_score_codex":0.000010647433,"about_ca_system_score_gemma":0.000011002227,"threshold_uncertainty_score":0.22817011},"labels":[],"label_agreement":null},{"id":"W2036303766","doi":"10.1016/j.top.2006.10.003","title":"The length of a shortest geodesic net on a closed Riemannian manifold","year":2007,"lang":"en","type":"article","venue":"Topology","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Science Foundation","keywords":"Geodesic; Mathematics; Riemannian manifold; Combinatorics; Geodesic map; Minimal volume; Dimension (graph theory); Solving the geodesic equations; Net (polyhedron); Manifold (fluid mechanics); Pure mathematics; Mathematical analysis; Geometry; Fundamental theorem of Riemannian geometry; Ricci curvature","score_opus":0.014362518181942788,"score_gpt":0.2597286723358383,"score_spread":0.2453661541538955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036303766","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55644506,0.0011353454,0.33614674,0.02163162,0.0013616442,0.00043715312,0.000028900233,0.0003374636,0.08247606],"genre_scores_gemma":[0.99667835,0.00003660207,0.0014163821,0.00076028396,0.00006615148,0.0000030641859,0.0000034224654,0.0000031458746,0.0010326202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987457,0.00007275307,0.0002927191,0.00029658224,0.0001931333,0.0003991138],"domain_scores_gemma":[0.99829584,0.0007636398,0.00011097801,0.000703598,0.000044972792,0.000080953316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075089285,0.000108479944,0.00020867099,0.0001826013,0.00015682755,0.000028705987,0.0011248465,0.0000861733,0.000062926614],"category_scores_gemma":[0.00018121745,0.00006487999,0.000090958936,0.0008966909,0.00019796574,0.000069014066,0.00022340979,0.00014606061,0.00010966986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002234138,0.00009523786,0.0016864564,0.0000015015917,0.000041761952,0.000047568723,0.000081879385,0.000012752651,0.00006521215,0.92036676,0.0016226517,0.075955875],"study_design_scores_gemma":[0.0014747198,0.003449067,0.42892793,0.000015718017,0.00011845973,0.00013980504,0.0005099221,0.006353835,0.0052146222,0.12287313,0.43008122,0.0008415636],"about_ca_topic_score_codex":0.0002337353,"about_ca_topic_score_gemma":0.00027821574,"teacher_disagreement_score":0.79749364,"about_ca_system_score_codex":0.000017676568,"about_ca_system_score_gemma":0.000018574958,"threshold_uncertainty_score":0.26457292},"labels":[],"label_agreement":null},{"id":"W2036451905","doi":"10.1016/j.camwa.2010.11.029","title":"Detecting critical regions in multidimensional data sets","year":2010,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Bishop's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Social connectedness; Mathematics; Multidimensional data; Data mining; Theoretical computer science; Pattern recognition (psychology); Artificial intelligence; Computer science","score_opus":0.03972597556941519,"score_gpt":0.31015904761825547,"score_spread":0.27043307204884026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036451905","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042080046,0.000021576823,0.9925919,0.0023547304,0.00006321219,0.000233501,0.000021988093,0.00014922374,0.00035582148],"genre_scores_gemma":[0.23372307,0.0000034050538,0.76596487,0.00014868272,0.00003421229,0.000068543515,0.00003654969,0.0000064365463,0.000014241172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998532,0.000023494349,0.00031443493,0.00058106374,0.000268593,0.00028043205],"domain_scores_gemma":[0.99643266,0.0011486305,0.00009276181,0.00207897,0.00009397073,0.00015302983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036389483,0.00014412281,0.00021372731,0.00024886944,0.0002031243,0.00012299744,0.0019279134,0.00006785529,0.000014633852],"category_scores_gemma":[0.00023825723,0.00011022573,0.000033050525,0.0015198474,0.00015278677,0.00036118203,0.0010075675,0.00033753391,0.00008086806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012898835,0.0005897416,0.0003204922,0.000028981483,0.000025090576,0.000015926913,0.00020841703,0.0001491734,0.0002594292,0.9564903,0.0007228642,0.04118831],"study_design_scores_gemma":[0.00036136305,0.000042703447,0.0018103955,0.000038261976,0.000036697093,0.00017167968,0.00007576808,0.90410364,0.00009018259,0.08080519,0.012081393,0.0003827151],"about_ca_topic_score_codex":0.000019844361,"about_ca_topic_score_gemma":0.0000887918,"teacher_disagreement_score":0.9039545,"about_ca_system_score_codex":0.000012812919,"about_ca_system_score_gemma":0.000049709477,"threshold_uncertainty_score":0.44948748},"labels":[],"label_agreement":null},{"id":"W2036888839","doi":"10.1112/blms/bdr023","title":"Morse theory, random subgraphs, and incoherent groups","year":2011,"lang":"en","type":"article","venue":"Bulletin of the London Mathematical Society","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Morse code; Kleinian group; Finitely-generated abelian group; Pure mathematics; Combinatorics; Computer science","score_opus":0.01666813973464852,"score_gpt":0.20586353404087832,"score_spread":0.18919539430622978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036888839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16129388,0.0013848271,0.8126872,0.010670424,0.00020189496,0.00076294236,0.000021624915,0.00022145864,0.012755751],"genre_scores_gemma":[0.8973378,0.0002092932,0.09896072,0.0015616214,0.000036838792,0.00003223304,0.0000016979769,0.00001205744,0.0018477639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870473,0.00016304447,0.00032350596,0.00027488504,0.00031059663,0.00022323066],"domain_scores_gemma":[0.9985319,0.00053367263,0.00015022437,0.0006471408,0.000042914868,0.00009418837],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010648228,0.00014166006,0.0003245677,0.000024842686,0.0001257124,0.000037244765,0.0010984361,0.000085231404,0.00091725047],"category_scores_gemma":[0.00029793262,0.00007367406,0.00040468184,0.0004297644,0.00038073663,0.000035447298,0.0008731071,0.00015118057,0.00007836283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029893177,0.00043880765,0.00069478876,0.00008959718,0.00016947476,0.000001995362,0.0014379353,0.0000013428048,0.000054153013,0.97687364,0.013927365,0.006281012],"study_design_scores_gemma":[0.0011827304,0.00009835257,0.0050563277,0.000043523414,0.00012108039,0.000017775508,0.00019372402,0.0013527354,0.0010318961,0.9814657,0.009192115,0.00024406769],"about_ca_topic_score_codex":0.00004106209,"about_ca_topic_score_gemma":6.3860665e-7,"teacher_disagreement_score":0.7360439,"about_ca_system_score_codex":0.00000873051,"about_ca_system_score_gemma":0.0000070364226,"threshold_uncertainty_score":0.99999607},"labels":[],"label_agreement":null},{"id":"W2038840372","doi":"10.1080/01621459.2011.641430","title":"Topological Analysis of Variance and the Maxillary Complex","year":2012,"lang":"en","type":"article","venue":"Journal of the American Statistical Association","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Alberta","funders":"","keywords":"Topological data analysis; Persistent homology; Variance (accounting); Curse of dimensionality; Nonlinear system; Computer science; Topology (electrical circuits); High dimensional; Computational topology; Landmark; Theoretical computer science; Data mining; Algorithm; Mathematics; Artificial intelligence","score_opus":0.01454430915466728,"score_gpt":0.27369769421795276,"score_spread":0.2591533850632855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038840372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13843887,0.00021630793,0.84849244,0.012286087,0.00015465352,0.00005304812,0.00006458082,0.0000067822584,0.00028720335],"genre_scores_gemma":[0.9782181,0.00008364019,0.020785931,0.00080958515,0.000053419422,6.075258e-7,0.0000014906748,0.00000121701,0.00004603433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9982504,0.00056020013,0.00042050955,0.00008271069,0.0005056033,0.00018053257],"domain_scores_gemma":[0.9956924,0.0025214078,0.0013597147,0.00019646563,0.00015356144,0.00007648175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017243889,0.00006768057,0.0004986554,0.00012699075,0.00009376897,0.00004355521,0.00055813004,0.000023924065,0.00004252774],"category_scores_gemma":[0.002717056,0.00002970314,0.00019592521,0.0022818192,0.0003370132,0.00015964507,0.00020883328,0.00016091827,0.0000017812403],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009620039,0.00024152105,0.3569882,0.000003566925,0.0026189876,0.0000055902688,0.00036244254,0.00020925993,0.00010334153,0.5934141,0.0032316647,0.042725127],"study_design_scores_gemma":[0.0002110564,0.00006647788,0.98182267,0.0000012523366,0.00079035404,0.00001291727,0.000058150694,0.007332034,0.0000068201334,0.008671606,0.000979948,0.000046701134],"about_ca_topic_score_codex":0.00011572644,"about_ca_topic_score_gemma":0.0000040662485,"teacher_disagreement_score":0.8397792,"about_ca_system_score_codex":0.00006860789,"about_ca_system_score_gemma":0.000018082446,"threshold_uncertainty_score":0.3252766},"labels":[],"label_agreement":null},{"id":"W2041488069","doi":"10.4153/cjm-2005-018-x","title":"Approximating Flats by Periodic Flats in CAT(0) Square Complexes","year":2005,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Square (algebra); Cover (algebra); Plane (geometry); Limit (mathematics); Connection (principal bundle); Pure mathematics; Geometry; Combinatorics; Mathematical analysis","score_opus":0.019143287783754608,"score_gpt":0.23319262163441293,"score_spread":0.21404933385065833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041488069","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7287753,0.002065455,0.26061317,0.0052400217,0.00019659166,0.00016117207,0.000053982672,0.000028518918,0.0028657664],"genre_scores_gemma":[0.85174936,0.000012737091,0.14777435,0.00024861755,0.000068990455,0.0000011247633,0.000003205313,0.000006274254,0.00013530602],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854785,0.00004226731,0.0006597163,0.00013989187,0.00025894743,0.0003513248],"domain_scores_gemma":[0.9986853,0.00014042133,0.00033130372,0.00028859227,0.00010063744,0.00045371932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063040294,0.00012731878,0.00035765267,0.00056956185,0.00011841189,0.0002137276,0.001007396,0.00006409901,0.00013440069],"category_scores_gemma":[0.00032765613,0.000100958285,0.00010397109,0.00092786236,0.00006702275,0.00040658005,0.000046955214,0.00018629915,0.00004582965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009303201,0.0013358156,0.04555007,0.00073173543,0.0005583151,0.0019989118,0.04745675,0.007734757,0.0020530755,0.20054945,0.13642439,0.5555974],"study_design_scores_gemma":[0.004379653,0.0011062855,0.024133116,0.0014783696,0.0002843204,0.00349946,0.009813907,0.67102873,0.0028266846,0.090436175,0.18785723,0.0031560503],"about_ca_topic_score_codex":0.0006793717,"about_ca_topic_score_gemma":0.005773231,"teacher_disagreement_score":0.66329396,"about_ca_system_score_codex":0.0001539502,"about_ca_system_score_gemma":0.00027709227,"threshold_uncertainty_score":0.41169593},"labels":[],"label_agreement":null},{"id":"W2052233329","doi":"10.1006/jctb.2002.2076","title":"Sewing Ribbons on Graphs in Space","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Univerzita Komenského v Bratislave","keywords":"Ribbon; Graph; Combinatorics; Mathematics; Euclidean geometry; Discrete mathematics; Geometry","score_opus":0.015435517117606481,"score_gpt":0.22451968122943006,"score_spread":0.20908416411182357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052233329","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70452917,0.004528423,0.06417463,0.023203671,0.03607921,0.00046265186,0.000020985923,0.00028958116,0.16671166],"genre_scores_gemma":[0.99806195,0.00014443319,0.0010729223,0.00015343887,0.00016781777,7.575879e-7,2.2214071e-7,0.000004012114,0.00039446974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985589,0.0002667214,0.00040094377,0.00015415392,0.00039049354,0.00022883173],"domain_scores_gemma":[0.99877805,0.00043755685,0.0002677022,0.00030762155,0.00009504064,0.00011404304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010988059,0.000122558,0.00032734338,0.0005562394,0.00008405909,0.00011876892,0.0009191449,0.0000703357,0.00019504614],"category_scores_gemma":[0.0006251538,0.00008882304,0.00017205458,0.0016418447,0.00007611595,0.00081484456,0.00013432058,0.00033372905,0.00002653329],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057252368,0.00018958248,0.00025185363,0.000001775642,0.000030211746,0.00012591739,0.00030261333,0.000059940423,0.000034601147,0.99284226,0.0009786645,0.0051253135],"study_design_scores_gemma":[0.0007729927,0.00078596314,0.00080123433,0.000025099785,0.000013373483,0.000058253394,0.00014188672,0.00011102002,0.00048525876,0.98117745,0.015491741,0.00013574977],"about_ca_topic_score_codex":0.0000038140406,"about_ca_topic_score_gemma":5.122103e-7,"teacher_disagreement_score":0.29353273,"about_ca_system_score_codex":0.000042801756,"about_ca_system_score_gemma":0.000014992074,"threshold_uncertainty_score":0.36220986},"labels":[],"label_agreement":null},{"id":"W2052268721","doi":"10.2478/v10037-011-0005-6","title":"The Mycielskian of a Graph","year":2011,"lang":"pl","type":"article","venue":"Formalized Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Graph; Theoretical computer science; Discrete mathematics; Computer science","score_opus":0.055672961289131684,"score_gpt":0.24448759274290835,"score_spread":0.18881463145377667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052268721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016694993,0.0024988656,0.86051804,0.0007146984,0.0009992264,0.0006151416,0.00013001924,0.00016325965,0.117665775],"genre_scores_gemma":[0.6703784,0.0026089444,0.31877574,0.00025115054,0.000085253094,0.000038585207,0.00001266075,0.00003036507,0.007818924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977714,0.00007546629,0.0008714092,0.00025223172,0.0005190068,0.0005104884],"domain_scores_gemma":[0.9973426,0.00043213624,0.000608637,0.0012869962,0.00018196502,0.00014768913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011534824,0.00022818761,0.0004749824,0.0002173725,0.00031705026,0.00011707603,0.0022216297,0.00012555775,0.00045351297],"category_scores_gemma":[0.00039872422,0.00012692639,0.00037932533,0.0020728947,0.0003739701,0.00035245786,0.00069176935,0.00018111072,0.00021509198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016882152,0.0004428377,0.00016731865,0.00012225335,0.00021302205,0.00000746147,0.0051476727,0.0000014702649,0.000009275574,0.981095,0.001865486,0.010911319],"study_design_scores_gemma":[0.0014916916,0.0009477445,0.0017034207,0.00016248846,0.0006184122,0.00006159348,0.0033278128,0.020519588,0.0032259626,0.9339966,0.033147205,0.0007974686],"about_ca_topic_score_codex":0.00007571825,"about_ca_topic_score_gemma":0.000015839158,"teacher_disagreement_score":0.65368336,"about_ca_system_score_codex":0.000012109787,"about_ca_system_score_gemma":0.000049879425,"threshold_uncertainty_score":0.5175908},"labels":[],"label_agreement":null},{"id":"W2053033188","doi":"10.1016/j.neuroimage.2009.04.026","title":"A Tribute to: Keith Worsley — 1951–2009","year":2009,"lang":"en","type":"article","venue":"NeuroImage","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill Genome Centre; McGill University","funders":"Wellcome Trust; University of Chicago","keywords":"Tribute; Geology; Archaeology; History","score_opus":0.01585906301423032,"score_gpt":0.256483669075067,"score_spread":0.24062460606083666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053033188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07185603,0.00020604812,0.7864133,0.119550675,0.0005564729,0.00033625824,0.000074646945,0.0009543137,0.020052267],"genre_scores_gemma":[0.9431417,0.00003224798,0.025254631,0.021487856,0.00014964001,0.0000059203917,0.000012530183,0.0000066471257,0.009908843],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985246,0.000056920762,0.0001966508,0.0005350784,0.00030394614,0.0003828244],"domain_scores_gemma":[0.99880886,0.00007577344,0.00004765864,0.00079189846,0.00004699514,0.00022880647],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018287222,0.00013967961,0.00020648939,0.0002734213,0.00010051676,0.00022754398,0.0012582632,0.000038737082,0.000091873684],"category_scores_gemma":[0.00026665968,0.00010820175,0.000105783794,0.0027443785,0.000020093237,0.00035622838,0.00023889494,0.00014989775,0.00082387764],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022029186,0.0004401003,0.00078142405,0.0000026930675,0.000020028907,0.0006702323,0.00012093338,0.0001172798,0.0043380614,0.021027325,0.2216081,0.7508518],"study_design_scores_gemma":[0.00048688767,0.00096303574,0.21786207,0.000007222056,0.000023828976,0.00004649345,0.000004072235,0.0031913253,0.0018007236,0.011791441,0.7633351,0.0004878113],"about_ca_topic_score_codex":0.000021590491,"about_ca_topic_score_gemma":0.0000039367005,"teacher_disagreement_score":0.8712857,"about_ca_system_score_codex":0.000012327448,"about_ca_system_score_gemma":0.000015218511,"threshold_uncertainty_score":0.9999541},"labels":[],"label_agreement":null},{"id":"W2054789626","doi":"10.1006/aama.2000.0695","title":"A Homological Interpretation of Skeletal Rigidity","year":2000,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Rigidity (electromagnetism); Interpretation (philosophy); Pure mathematics; Algebra over a field; Linguistics; Philosophy; Structural engineering","score_opus":0.008868251794471808,"score_gpt":0.2612120519522976,"score_spread":0.25234380015782576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054789626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051723126,0.00032688046,0.8948935,0.000055752946,0.000033580192,0.00011632298,0.0000047594876,0.00006308898,0.05278294],"genre_scores_gemma":[0.766225,0.00017069717,0.23349403,0.00003747462,0.0000067931464,0.000012810208,0.0000028076563,0.0000016901779,0.00004869393],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913,0.000012897232,0.00032229233,0.00020565624,0.00018295598,0.00014619647],"domain_scores_gemma":[0.99925023,0.0002906623,0.00009549892,0.00032039976,0.00001239246,0.000030833082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020265258,0.00008748122,0.00024233075,0.000106518906,0.000021324058,0.000016374039,0.000571864,0.000045780234,0.0001869941],"category_scores_gemma":[0.00007080529,0.00006373146,0.000050016974,0.00085104635,0.0000916987,0.00020631793,0.000088908775,0.00008698564,0.00007130587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004737385,0.00026870903,0.00009220672,0.000038754784,0.0000051623783,0.0000041444696,0.00023094499,0.0010193974,0.000037458143,0.48681644,0.000014190119,0.5114679],"study_design_scores_gemma":[0.00032879316,0.00010248161,0.00079732406,0.000023902177,0.000012586996,0.000009433001,0.00007844345,0.07370335,0.00064275117,0.9196093,0.004474217,0.00021739687],"about_ca_topic_score_codex":0.0000021575756,"about_ca_topic_score_gemma":0.000004106761,"teacher_disagreement_score":0.71450186,"about_ca_system_score_codex":0.000013185045,"about_ca_system_score_gemma":0.000006258653,"threshold_uncertainty_score":0.25988936},"labels":[],"label_agreement":null},{"id":"W2055994220","doi":"10.1007/jhep02(2013)143","title":"Think globally, compute locally","year":2013,"lang":"en","type":"article","venue":"Journal of High Energy Physics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; American Institute of Mathematics","keywords":"Recursion (computer science); Simple (philosophy); Riemann hypothesis; Riemann surface; Topology (electrical circuits); Ramification","score_opus":0.009699101556630863,"score_gpt":0.2088680426765042,"score_spread":0.19916894111987332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055994220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069969757,0.00016035223,0.989278,0.0021161102,0.00043457176,0.000014017771,0.0000016597726,0.000029752606,0.00096856704],"genre_scores_gemma":[0.9449806,0.000094061834,0.052895915,0.0012728436,0.0004750308,4.6555215e-7,0.000001937421,0.0000041735775,0.00027493175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861187,0.000059702314,0.0003892884,0.00016884269,0.00054287846,0.00022741246],"domain_scores_gemma":[0.9986065,0.00010195459,0.00037485186,0.00036202057,0.00038160945,0.00017306284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001549834,0.00013107872,0.00032221127,0.00010717886,0.00007119992,0.0002436807,0.0016163618,0.00005361252,0.000054964206],"category_scores_gemma":[0.000026030153,0.000086865504,0.00020532667,0.0010496768,0.00005100449,0.00096836116,0.00035100462,0.00017133937,0.00007291236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020547964,0.00012552136,0.000029011191,0.0000013904067,0.00009606654,0.000032130196,0.000020048577,0.0025652344,0.000025526242,0.8241051,0.013154913,0.15984303],"study_design_scores_gemma":[0.00044049055,0.00033060944,0.0034407256,0.000014192602,0.00003680517,0.000071777584,0.000010730787,0.017146742,0.0005211532,0.964234,0.013537578,0.00021520157],"about_ca_topic_score_codex":0.0003193843,"about_ca_topic_score_gemma":0.0000033948088,"teacher_disagreement_score":0.9379837,"about_ca_system_score_codex":0.00003425885,"about_ca_system_score_gemma":0.000062370105,"threshold_uncertainty_score":0.35422724},"labels":[],"label_agreement":null},{"id":"W2057690586","doi":"10.1142/s0218348x12500065","title":"EXAMPLES OF USING BINARY CANTOR SETS TO STUDY THE CONNECTIVITY OF SIERPIŃSKI RELATIVES","year":2012,"lang":"en","type":"article","venue":"Fractals","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada; U.S. Department of Health and Human Services","keywords":"Cantor set; Sierpinski triangle; Totally disconnected space; Cantor's diagonal argument; Mathematics; Class (philosophy); Cantor function; Binary number; Sierpinski carpet; Set (abstract data type); Fractal; Combinatorics; Discrete mathematics; Computer science; Artificial intelligence; Mathematical analysis; Arithmetic","score_opus":0.08001122395588721,"score_gpt":0.33266753405392346,"score_spread":0.25265631009803624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057690586","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9759686,0.00027113772,0.023133319,0.0001519175,0.0000861061,0.00014804787,0.000024844026,0.0000137106645,0.00020230176],"genre_scores_gemma":[0.99534327,0.000002950327,0.0045512915,0.000048420494,0.000022869748,0.0000036441709,0.0000010604654,0.0000022274075,0.000024250674],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99896425,0.00021903592,0.00021981049,0.00016564941,0.0002480153,0.00018323275],"domain_scores_gemma":[0.9984108,0.0008216254,0.00017029881,0.00046512604,0.00005997926,0.00007212699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008339231,0.00007931074,0.00024834936,0.00014087664,0.00007978852,0.000015158527,0.0005336724,0.000028516797,0.000063680214],"category_scores_gemma":[0.00054422335,0.000046321496,0.00006071922,0.0012630465,0.00005762674,0.00038010546,0.00042669362,0.000064746906,0.000008260405],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027625292,0.00241628,0.9099818,0.00001842117,0.00041782335,0.000008279999,0.0142598385,0.0004468185,0.017761838,0.0068792664,0.0003587835,0.047423266],"study_design_scores_gemma":[0.00010188923,0.00018645363,0.99526113,0.0000057682164,0.00003832206,0.0000020549878,0.00075823587,0.0005596743,0.0020871467,0.0004946006,0.00041759844,0.00008710378],"about_ca_topic_score_codex":0.00076000526,"about_ca_topic_score_gemma":0.000012320684,"teacher_disagreement_score":0.08527939,"about_ca_system_score_codex":0.000014309073,"about_ca_system_score_gemma":0.000016905502,"threshold_uncertainty_score":0.18889357},"labels":[],"label_agreement":null},{"id":"W2061130392","doi":"10.1007/bf02950404","title":"Decision tree complexity of graph properties with dimension at most 5","year":2000,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Monotone polygon; Conjecture; Vertex (graph theory); Graph; Discrete mathematics; Theory of computation; Mathematics; Computer science; Algorithm","score_opus":0.019459760509158333,"score_gpt":0.22352323356644951,"score_spread":0.20406347305729117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061130392","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8249392,0.00035726183,0.17231144,0.0021831065,0.00007080431,0.000038332284,6.3277605e-7,0.000024414725,0.00007483597],"genre_scores_gemma":[0.8941013,0.000130375,0.10562137,0.00011150478,0.000013802594,3.795229e-7,9.671253e-8,0.0000014441038,0.000019718855],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853307,0.000019408457,0.00035592247,0.00026494567,0.00060758216,0.0002190821],"domain_scores_gemma":[0.99871504,0.00004648035,0.0002364424,0.00037677272,0.0005322819,0.00009296175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005705595,0.00010178075,0.00031551142,0.0011106019,0.00020616545,0.00006611114,0.0013520075,0.000058229572,0.000016614817],"category_scores_gemma":[0.000047225436,0.00005514194,0.000037250673,0.0047960267,0.001836739,0.0006313963,0.0005056717,0.00013657333,0.0000036260897],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046019377,0.000120304336,0.0029802853,0.0000041806124,0.000020828285,0.000044632885,0.00007019665,0.00016913257,0.0024939114,0.010020781,0.0002529914,0.98377675],"study_design_scores_gemma":[0.007535228,0.025708983,0.18338868,0.0008849809,0.00023611009,0.012734239,0.00019457201,0.2764528,0.15401329,0.31410185,0.022867471,0.0018817849],"about_ca_topic_score_codex":0.00000956858,"about_ca_topic_score_gemma":0.000011063788,"teacher_disagreement_score":0.98189497,"about_ca_system_score_codex":0.000026001857,"about_ca_system_score_gemma":0.00008520409,"threshold_uncertainty_score":0.6767542},"labels":[],"label_agreement":null},{"id":"W2061283920","doi":"10.1090/memo/1100","title":"Sheaves on Graphs, Their Homological Invariants, and a Proof of the Hanna Neumann Conjecture: with an Appendix by Warren Dicks","year":2014,"lang":"en","type":"article","venue":"Memoirs of the American Mathematical Society","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Conjecture; Von Neumann architecture; Pure mathematics; Discrete mathematics","score_opus":0.008589257705905233,"score_gpt":0.21434525198073012,"score_spread":0.20575599427482488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061283920","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7766081,0.00020020836,0.20758216,0.014354328,0.00006197962,0.00046890168,0.00007359563,0.000064501866,0.0005861904],"genre_scores_gemma":[0.989613,0.000016471684,0.009140767,0.0010981263,0.0000134591255,0.000011427591,0.0000029468774,0.00000735069,0.000096459946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826664,0.00030610772,0.00030274005,0.0003921452,0.0004482346,0.0002841352],"domain_scores_gemma":[0.9978921,0.00052959996,0.00038977305,0.0010342526,0.00004264892,0.00011163504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062346575,0.00020615391,0.0005591365,0.000027836664,0.0001796812,0.00004897716,0.0016890761,0.00006287298,0.000024490679],"category_scores_gemma":[0.0002163604,0.00007999512,0.00027483844,0.0011516953,0.0021963334,0.000112947906,0.00059487973,0.000251592,0.0000021475068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020742652,0.0054577254,0.008967816,0.00052989135,0.0016021379,0.0000038320077,0.009167608,0.0003460454,0.0023578026,0.7274409,0.03460633,0.20931247],"study_design_scores_gemma":[0.001271424,0.004946666,0.019508835,0.00024548,0.00031148584,0.00008636966,0.0016353073,0.045510896,0.019857302,0.9028477,0.0028793449,0.0008991733],"about_ca_topic_score_codex":0.00006967066,"about_ca_topic_score_gemma":0.0000038681296,"teacher_disagreement_score":0.21300486,"about_ca_system_score_codex":0.000011642205,"about_ca_system_score_gemma":0.000020368667,"threshold_uncertainty_score":0.80924815},"labels":[],"label_agreement":null},{"id":"W2063513139","doi":"10.1007/s10851-007-0010-0","title":"Discrete Dynamical System Framework for Construction of Connections between Critical Regions in Lattice Height Data","year":2007,"lang":"en","type":"article","venue":"Journal of Mathematical Imaging and Vision","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Bishop's University","funders":"","keywords":"Morse theory; Mathematics; Morse code; Lattice (music); Graph; Topology (electrical circuits); Discrete Morse theory; Dynamical systems theory; Topological data analysis; Discrete mathematics; Algorithm; Computer science; Combinatorics; Pure mathematics; Physics","score_opus":0.038313570599568705,"score_gpt":0.37824094640184025,"score_spread":0.33992737580227156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063513139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014470282,0.00014686375,0.98152626,0.0035819674,0.000098942895,0.000055452736,0.000019854391,0.000013453533,0.000086928274],"genre_scores_gemma":[0.61537254,0.000009738933,0.38453335,0.000015145142,0.00006170291,3.1113692e-7,0.0000022953957,0.000002386638,0.000002540413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858,0.00006776502,0.00071456,0.00019617981,0.000260167,0.00018137605],"domain_scores_gemma":[0.9948913,0.0042757737,0.00022317309,0.0003413317,0.00013062006,0.00013784226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019398957,0.00008419607,0.00037876607,0.0003099982,0.00008450869,0.00007750973,0.00047616474,0.000066099645,0.0000040022833],"category_scores_gemma":[0.002559139,0.00005697838,0.000069185044,0.0005039234,0.00019076963,0.000513527,0.00022930813,0.00023368135,0.0000010856427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014480818,0.00010091465,0.0015749977,0.0001413788,0.000025283496,0.000017757071,0.00007349075,0.0000024258943,0.00004360818,0.97414154,0.00006789203,0.023796203],"study_design_scores_gemma":[0.0006029978,0.00030317335,0.005300816,0.0010907901,0.00021683585,0.0006533101,0.0012475048,0.19564083,0.00021774192,0.79412425,0.00040771122,0.0001940342],"about_ca_topic_score_codex":0.000004007044,"about_ca_topic_score_gemma":6.181496e-7,"teacher_disagreement_score":0.60090226,"about_ca_system_score_codex":0.000025236168,"about_ca_system_score_gemma":0.000016686081,"threshold_uncertainty_score":0.3063713},"labels":[],"label_agreement":null},{"id":"W2064131708","doi":"10.4153/cmb-2011-055-7","title":"Subdivisions of Simplicial Complexes Preserving the Metric Topology","year":2011,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subdivision; Mathematics; Simplicial complex; Metric (unit); Simplicial approximation theorem; Topology (electrical circuits); Combinatorics; Simplicial homology; Polyhedron; Abstract simplicial complex; Simplicial manifold; Discrete mathematics; Pure mathematics; Simplicial set; Geography; Homotopy","score_opus":0.04321883156293268,"score_gpt":0.2404529447121365,"score_spread":0.1972341131492038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064131708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055325147,0.0005184855,0.71466005,0.03234992,0.00026019252,0.00058353675,0.00010873304,0.00015720085,0.19603673],"genre_scores_gemma":[0.98628855,0.000005767831,0.0122684855,0.000840182,0.000026869446,0.000010573618,0.0000026407572,0.000004722164,0.0005522057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987375,0.00010704943,0.0003264007,0.00024180999,0.00019518113,0.00039202312],"domain_scores_gemma":[0.9981345,0.000672093,0.000083156956,0.00071872596,0.00007607141,0.00031546553],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00046133596,0.000110776964,0.00027777607,0.00036610552,0.00017379515,0.000040080336,0.0018174278,0.000073656076,0.016321383],"category_scores_gemma":[0.0012209476,0.000067534194,0.000113707676,0.001380014,0.00022663757,0.00004497671,0.0003424255,0.00013616984,0.0016449321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.882112e-7,0.000047270212,0.00021116504,0.000009524888,0.000027576825,0.000013326019,0.00025410648,0.000001836652,0.000007491969,0.9860033,0.010781639,0.002641807],"study_design_scores_gemma":[0.00021583679,0.00019773393,0.019101385,0.000021155334,0.00007763254,0.00004422101,0.00029350325,0.0033112925,0.00040922308,0.87398076,0.10198218,0.00036506273],"about_ca_topic_score_codex":0.009795842,"about_ca_topic_score_gemma":0.0018351644,"teacher_disagreement_score":0.9309634,"about_ca_system_score_codex":0.000026036392,"about_ca_system_score_gemma":0.00006693935,"threshold_uncertainty_score":0.9991324},"labels":[],"label_agreement":null},{"id":"W2065102439","doi":"10.1117/12.840333","title":"Critical region analysis of scalar fields in arbitrary dimensions","year":2009,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Bishop's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Social connectedness; Scalar (mathematics); Persistent homology; Computational topology; Computer science; Homology (biology); Scalar field; Topological data analysis; Topology (electrical circuits); Theoretical computer science; Mathematics; Algorithm; Geometry; Combinatorics","score_opus":0.013622573396369695,"score_gpt":0.24519402599532922,"score_spread":0.23157145259895953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065102439","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98827255,0.00013903965,0.0023807841,0.007679696,0.000082787934,0.0001585458,0.000019783438,0.000049118094,0.0012177036],"genre_scores_gemma":[0.8963301,0.00009947856,0.10317128,0.0002566322,0.0000674353,0.000017872073,0.000005891831,0.00000781245,0.00004350712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977994,3.132677e-8,0.0007637652,0.00043963437,0.00065011997,0.00034703183],"domain_scores_gemma":[0.9981724,0.00033656787,0.00025421483,0.00011010313,0.0010046648,0.00012206354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005605488,0.0002172852,0.0005852226,0.00051950186,0.000052254345,0.00008464801,0.0015020749,0.00019585124,0.000009250042],"category_scores_gemma":[0.0012783813,0.00016855204,0.00089903834,0.0028348903,0.00019093172,0.00072760036,0.00022839179,0.00029781126,5.984472e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002735882,0.00028591353,0.0013410806,0.00006708288,0.00053420913,4.970482e-7,0.000115756935,0.00036911116,0.025394376,0.97020376,0.0008301933,0.0008306899],"study_design_scores_gemma":[0.0019246888,0.0017379856,0.09377451,0.00050628046,0.0021816604,0.000031905547,0.0011120454,0.7572976,0.06098929,0.07749401,0.0017372521,0.0012128089],"about_ca_topic_score_codex":0.0000197929,"about_ca_topic_score_gemma":3.8777227e-7,"teacher_disagreement_score":0.89270973,"about_ca_system_score_codex":0.00006262987,"about_ca_system_score_gemma":0.000021104705,"threshold_uncertainty_score":0.68733525},"labels":[],"label_agreement":null},{"id":"W2069566112","doi":"10.1002/jgt.20494","title":"On directed local chromatic number, shift graphs, and Borsuk-like graphs","year":2010,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Chromatic scale; Combinatorics; Mathematics; Graph; Critical graph; Discrete mathematics; Foster graph; Friendship graph; Line graph; Graph power","score_opus":0.0055389785225067175,"score_gpt":0.22734510394033508,"score_spread":0.22180612541782838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069566112","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92069054,0.0004771605,0.07614139,0.00059522793,0.0009551304,0.000063507956,0.000008011905,0.000098139004,0.0009709177],"genre_scores_gemma":[0.9944324,0.00016072296,0.0047901575,0.000517618,0.000032369393,0.000001411147,0.0000013512698,0.0000069840644,0.000056987614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982561,0.00023059365,0.0004853327,0.00026427748,0.00047911823,0.00028458086],"domain_scores_gemma":[0.99795246,0.0008025958,0.0003825041,0.00046559525,0.00011246893,0.00028437347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014535473,0.00019285192,0.00040581083,0.00082982186,0.00016765881,0.00014734072,0.0010276523,0.0001196147,0.00019330779],"category_scores_gemma":[0.0003095025,0.00012523137,0.00031112815,0.0020435913,0.0003873562,0.00044651906,0.00015077007,0.0006155328,0.000024426507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060251365,0.00024483388,0.003263212,0.000010683238,0.0001916982,0.00011735083,0.00018450098,0.0000062866925,0.0002038686,0.9566737,0.0018890612,0.03715457],"study_design_scores_gemma":[0.00047188217,0.00028904717,0.04516854,0.000024167513,0.00006819963,0.00021539221,0.00003611957,0.00021036871,0.00013183955,0.95237815,0.00082538486,0.00018090368],"about_ca_topic_score_codex":0.000014418035,"about_ca_topic_score_gemma":0.00001521588,"teacher_disagreement_score":0.073741876,"about_ca_system_score_codex":0.000007935638,"about_ca_system_score_gemma":0.00003071575,"threshold_uncertainty_score":0.5106787},"labels":[],"label_agreement":null},{"id":"W2075552434","doi":"10.1080/13658816.2013.801578","title":"Decentralized and coordinate-free computation of critical points and surface networks in a discretized scalar field","year":2013,"lang":"en","type":"article","venue":"International Journal of Geographical Information Systems","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Australian Research Council; Memorial University of Newfoundland","keywords":"Computer science; Discretization; Computation; Field (mathematics); Scalar field; Algorithm; Distributed computing; Mathematical optimization; Mathematics","score_opus":0.006406391464969001,"score_gpt":0.2515262139536394,"score_spread":0.2451198224886704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075552434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36185312,0.0005150753,0.6302562,0.006781609,0.0003807578,0.00011192478,0.000007812309,0.000010229015,0.000083309205],"genre_scores_gemma":[0.99536586,0.00020367444,0.0042002336,0.00020053654,0.000020073136,0.0000019831166,0.000004986505,0.0000012949732,0.0000013651697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830014,0.00011234058,0.00088556536,0.00008582308,0.00048660024,0.00012952858],"domain_scores_gemma":[0.99815834,0.00053160434,0.00037830125,0.00010146452,0.000709675,0.00012060673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006445819,0.00008650325,0.0002717651,0.00052331766,0.000027371258,0.0003282144,0.0004977318,0.0000874932,0.000012545628],"category_scores_gemma":[0.00073869666,0.000063923784,0.000070494774,0.0005558319,0.00010793759,0.0020193586,0.00020740819,0.00016900183,0.0000017357684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047782843,0.0006560005,0.3941342,0.00026091753,0.00076612754,0.000059619342,0.0016421454,0.019449437,0.00012393756,0.46626607,0.0033437598,0.112819985],"study_design_scores_gemma":[0.003393807,0.00037993802,0.17542633,0.00028034436,0.00003111764,0.00029980784,0.00047027922,0.80042857,0.000040699717,0.018256571,0.0007493699,0.00024318178],"about_ca_topic_score_codex":0.00037021475,"about_ca_topic_score_gemma":0.0000040250534,"teacher_disagreement_score":0.7809791,"about_ca_system_score_codex":0.000013865194,"about_ca_system_score_gemma":0.000012868186,"threshold_uncertainty_score":0.31649792},"labels":[],"label_agreement":null},{"id":"W2080292561","doi":"10.1016/j.tcs.2011.08.026","title":"Counting maps on doughnuts","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematics; Algorithm","score_opus":0.024539384326035415,"score_gpt":0.2379872145340342,"score_spread":0.2134478302079988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080292561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014730193,0.000013050161,0.94175124,0.00056492,0.0004715442,0.00006654601,0.000002378738,0.00024952504,0.0421506],"genre_scores_gemma":[0.86345446,0.0000030514577,0.13506642,0.0013640797,0.00008289874,0.0000028057214,6.9341263e-7,0.0000032391185,0.000022364657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745595,0.00007596558,0.0002492343,0.00082401244,0.0007737036,0.0006211465],"domain_scores_gemma":[0.99828917,0.00022170357,0.000068442016,0.0010011423,0.00013257841,0.00028697323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014981016,0.00016883106,0.00020499101,0.00036247808,0.00039843732,0.0003068142,0.0037671097,0.00004936736,0.00022181144],"category_scores_gemma":[0.00017146481,0.00011565141,0.0000827632,0.003214556,0.0020024052,0.00064602104,0.0013488166,0.00019589621,0.0006614558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038883236,0.00007537856,0.000120344805,0.0000011197717,0.000003568512,0.000021350736,0.00015333023,0.000009293576,0.000023766373,0.9550435,0.000113846,0.04443059],"study_design_scores_gemma":[0.00025677565,0.00065836083,0.008156863,0.000020772015,0.000011084993,0.000037996157,0.000008882559,0.13439894,0.0046101063,0.849827,0.0015366124,0.00047664728],"about_ca_topic_score_codex":0.000011320735,"about_ca_topic_score_gemma":3.0568506e-7,"teacher_disagreement_score":0.84872425,"about_ca_system_score_codex":0.00003302332,"about_ca_system_score_gemma":0.000042790674,"threshold_uncertainty_score":0.8501897},"labels":[],"label_agreement":null},{"id":"W2083711510","doi":"10.1016/j.ejc.2007.04.015","title":"Colorful subgraphs in Kneser-like graphs","year":2007,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Generalization; Bipartite graph; Vertex (graph theory); Chromatic scale; Robertson–Seymour theorem; Discrete mathematics; Chordal graph; Graph; 1-planar graph","score_opus":0.011834286054315373,"score_gpt":0.22893041782465462,"score_spread":0.21709613177033923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083711510","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7124712,0.0014087552,0.26378492,0.0006413345,0.002144833,0.00007121347,0.0000016026552,0.00005590468,0.01942029],"genre_scores_gemma":[0.99710494,0.00014988375,0.0022720378,0.00024618744,0.000038147486,9.592033e-8,6.822415e-7,0.000007906478,0.00018014165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9978567,0.00031526666,0.00075322686,0.00019843479,0.0005265469,0.00034983986],"domain_scores_gemma":[0.9984661,0.00025325033,0.00042006606,0.00037527632,0.00025012819,0.00023521512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044099973,0.00014062332,0.00030243912,0.0012002577,0.000067205925,0.000104145416,0.001733056,0.0000313726,0.000019648158],"category_scores_gemma":[0.00026495705,0.00010846177,0.00019555037,0.004629604,0.000061957035,0.00046270946,0.0002667012,0.00040863556,0.000047726255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009046091,0.0013720632,0.11940647,0.000017641454,0.00013870808,0.011189656,0.0007527793,0.000118368946,0.00020281319,0.79154015,0.00937722,0.06579369],"study_design_scores_gemma":[0.0033271792,0.0020914911,0.749224,0.000057722194,0.00005202897,0.0005045686,0.00023299339,0.00028917694,0.0003500625,0.1107801,0.13244948,0.0006412013],"about_ca_topic_score_codex":0.000003927467,"about_ca_topic_score_gemma":0.0000032471282,"teacher_disagreement_score":0.68076,"about_ca_system_score_codex":0.000044821783,"about_ca_system_score_gemma":0.000031448242,"threshold_uncertainty_score":0.44229427},"labels":[],"label_agreement":null},{"id":"W2083920110","doi":"10.1016/s0166-8641(98)00112-6","title":"Chain-condition methods in topology","year":2000,"lang":"en","type":"article","venue":"Topology and its Applications","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Countable set; Range (aeronautics); Topology (electrical circuits); Subject (documents); Discrete mathematics; Combinatorics; Computer science","score_opus":0.019434265962126197,"score_gpt":0.3424498578408287,"score_spread":0.3230155918787025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083920110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03509608,0.0023551772,0.91236925,0.019498855,0.000074778334,0.00038650495,0.000021200378,0.00017631984,0.03002184],"genre_scores_gemma":[0.92007023,0.0012888645,0.06998383,0.0026329532,0.00009661496,0.00039768143,0.000048783953,0.000005412398,0.005475596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99906397,0.00012955253,0.00019573324,0.00035641697,0.000042152504,0.00021216966],"domain_scores_gemma":[0.9993376,0.00023830423,0.00003669643,0.000302635,0.000019999889,0.000064766085],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002797778,0.00008270407,0.00016886597,0.00020661925,0.00014284157,0.000018370856,0.00038208085,0.00011874722,0.0016161228],"category_scores_gemma":[0.00003339025,0.00007094811,0.00002972462,0.00091482355,0.00012650024,0.0001523183,0.000086974156,0.00012878387,0.00021281475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015148099,0.00005218996,0.00017266098,0.0000016208763,0.00000689534,0.0000016384863,0.00005665139,0.000010075293,0.00011648245,0.70462394,0.0001281958,0.29482815],"study_design_scores_gemma":[0.0005562822,0.00015798245,0.036664907,0.0000027434576,0.00002946912,0.00010062117,0.000084022024,0.008716276,0.0011006766,0.47250718,0.47971144,0.00036839806],"about_ca_topic_score_codex":0.00006505161,"about_ca_topic_score_gemma":0.000028867471,"teacher_disagreement_score":0.8849742,"about_ca_system_score_codex":0.0000112774815,"about_ca_system_score_gemma":0.000012136863,"threshold_uncertainty_score":0.99929655},"labels":[],"label_agreement":null},{"id":"W2085831227","doi":"10.1007/s00454-010-9303-y","title":"Coreduction Homology Algorithm for Regular CW-Complexes","year":2010,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerstwo Edukacji i Nauki; U.S. Department of Energy; National Science Foundation","keywords":"Mathematics; Homology (biology); Algorithm; Preprocessor; Persistent homology; Combinatorics; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.011808489082576054,"score_gpt":0.27068170221882815,"score_spread":0.2588732131362521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085831227","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03768156,0.000093138915,0.9590135,0.0015685147,0.0009163794,0.00018057405,0.00015606282,0.00016877364,0.0002214517],"genre_scores_gemma":[0.44537672,0.000004253065,0.5527633,0.00040358692,0.0003433378,0.000041820153,0.00061730127,0.0000104520705,0.0004392091],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815905,0.000046469508,0.00035686948,0.0006512889,0.000400544,0.00038579767],"domain_scores_gemma":[0.99848,0.00046010656,0.00016346028,0.000453221,0.00028318298,0.000159985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003868659,0.0001988846,0.0002966872,0.00065622287,0.00030922293,0.0001837827,0.0009408918,0.00013352427,0.00015363093],"category_scores_gemma":[0.00020711085,0.00017165198,0.00021909174,0.0019433202,0.0002031681,0.00045539733,0.0002655903,0.00024162293,0.0000864677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010516007,0.00018973734,0.000608234,0.000012804779,0.00015727198,0.000013097155,0.00006814477,0.004338244,0.00068326015,0.47317752,0.004524031,0.5162172],"study_design_scores_gemma":[0.000825994,0.00028899594,0.033867605,0.0000049690716,0.000054304885,0.00015652143,0.000057946232,0.5365965,0.0005145468,0.39171243,0.03535966,0.0005605799],"about_ca_topic_score_codex":0.000043727978,"about_ca_topic_score_gemma":0.0000049662967,"teacher_disagreement_score":0.5322582,"about_ca_system_score_codex":0.000021658072,"about_ca_system_score_gemma":0.000058459187,"threshold_uncertainty_score":0.69997644},"labels":[],"label_agreement":null},{"id":"W2087815526","doi":"10.1088/1751-8113/42/37/375101","title":"Topological structure of dictionary graphs","year":2009,"lang":"en","type":"article","venue":"Journal of Physics A Mathematical and Theoretical","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Topology (electrical circuits); Mathematics; Combinatorics","score_opus":0.006976408313037564,"score_gpt":0.23219361592747068,"score_spread":0.22521720761443312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087815526","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5419524,0.0001579198,0.45424166,0.0026283686,0.000056302837,0.000041243216,0.0000076276447,0.000014376775,0.0009001268],"genre_scores_gemma":[0.9740265,0.00003089434,0.025691148,0.0001756803,0.000068085814,1.0899867e-7,4.753135e-7,0.0000015474019,0.0000055330866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988803,0.00006093701,0.00042941456,0.00012860392,0.00035354984,0.00014714712],"domain_scores_gemma":[0.99903923,0.00033126675,0.00018570106,0.00018159847,0.00011569467,0.00014652549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022478009,0.00010490929,0.0003949793,0.000086109554,0.000041231135,0.000036955214,0.00042735707,0.000070870796,0.00014499927],"category_scores_gemma":[0.00022551151,0.000057358262,0.00018036483,0.0004651324,0.0004268922,0.00018672169,0.00010181885,0.0002135557,0.000002253391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013738638,0.00024851158,0.00003748326,0.000007803891,0.000030127783,0.00001577081,0.000051767518,0.0000040288214,0.0006338357,0.984288,0.00003256682,0.014636369],"study_design_scores_gemma":[0.00017603413,0.0005694369,0.00094110065,0.000017303337,0.000039867213,0.0001506881,0.00001663554,0.0019719992,0.0011865542,0.994839,0.000023049979,0.00006831675],"about_ca_topic_score_codex":1.2907822e-7,"about_ca_topic_score_gemma":8.336651e-9,"teacher_disagreement_score":0.43207416,"about_ca_system_score_codex":0.0000051141024,"about_ca_system_score_gemma":0.000014277421,"threshold_uncertainty_score":0.2339002},"labels":[],"label_agreement":null},{"id":"W2101795236","doi":"10.1142/s0218348x11005531","title":"CONNECTIVITY PROPERTIES OF SIERPIŃSKI RELATIVES","year":2011,"lang":"en","type":"article","venue":"Fractals","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Contractible space; Totally disconnected space; Sierpinski triangle; Fractal; Mathematics; Class (philosophy); Dimension (graph theory); Topology (electrical circuits); Combinatorics; Computer science; Mathematical analysis; Artificial intelligence; Locally compact space","score_opus":0.07128233628526745,"score_gpt":0.22676717008415934,"score_spread":0.15548483379889189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101795236","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8624842,0.00055982324,0.10710905,0.00021138419,0.00010008173,0.000075607,0.00000712079,0.00009198734,0.029360738],"genre_scores_gemma":[0.99379855,0.000013757146,0.005704017,0.000058723464,0.000010282051,0.0000035560224,6.916907e-7,0.0000016017938,0.00040881938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99933916,0.00005742983,0.00015336458,0.00018880329,0.00013921782,0.000121997255],"domain_scores_gemma":[0.99939287,0.00007361336,0.0001010087,0.00033565596,0.000053640473,0.00004321322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021247445,0.000064585125,0.00017852656,0.00011127065,0.000039308597,0.000014746096,0.00047496046,0.000039855506,0.00016201567],"category_scores_gemma":[0.0003035876,0.000041930616,0.000065486005,0.00061769574,0.00008821516,0.00048304643,0.00020007264,0.000062386935,0.00007494106],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008581565,0.0022381889,0.09516915,0.00011447023,0.00056736986,0.000069204856,0.013314798,0.000020693555,0.05703862,0.56778765,0.0023277244,0.2612663],"study_design_scores_gemma":[0.00047088027,0.00058820966,0.6876556,0.000056835346,0.000054954875,0.000013424415,0.00028668053,0.0017464675,0.23211592,0.068572514,0.00786096,0.00057749177],"about_ca_topic_score_codex":0.0001330181,"about_ca_topic_score_gemma":0.0000027477097,"teacher_disagreement_score":0.5924865,"about_ca_system_score_codex":0.0000063444586,"about_ca_system_score_gemma":0.000013473519,"threshold_uncertainty_score":0.17739579},"labels":[],"label_agreement":null},{"id":"W2103928470","doi":"","title":"A brief review of results on the linking probability for 2-component links which span a lattice tube(Knots and soft-matter physics: Topology of polymers and related topics in physics, mathematics and biology)","year":2009,"lang":"en","type":"review","venue":"Kyoto University Research Information Repository (Kyoto University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Component (thermodynamics); Lattice (music); Polymer physics; Physics; Mathematics; Topology (electrical circuits); Statistical physics; Polymer; Combinatorics; Quantum mechanics","score_opus":0.06431813514861066,"score_gpt":0.301736438038649,"score_spread":0.23741830289003835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103928470","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012544638,0.7742131,0.04000481,0.015245522,0.0005772628,0.026190287,0.0012605638,0.00038033057,0.1295835],"genre_scores_gemma":[0.0010131116,0.9942619,0.0031764554,0.00015397918,0.00003871318,0.0000039959077,0.0001387109,0.0000089415635,0.0012041847],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99779016,0.00057334354,0.0006161899,0.0004277601,0.00029090987,0.0003016573],"domain_scores_gemma":[0.99676156,0.0012555617,0.000673395,0.0006378856,0.00055212376,0.00011948824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012462226,0.00023844604,0.0009298452,0.0007986029,0.00030466315,0.000056757894,0.00090194633,0.0003760884,0.0000055727614],"category_scores_gemma":[0.00050560554,0.00019244524,0.0001641393,0.0024251284,0.0005272766,0.00072296074,0.00067890016,0.00071373995,0.000003862355],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018589286,0.00041669924,0.00037158365,0.041143235,0.00049713074,0.000037336962,0.0024664237,0.000015119837,0.0000032665282,0.38180608,0.0002359862,0.57282126],"study_design_scores_gemma":[0.0025857044,0.0018798482,0.0006540887,0.032217193,0.00089280115,0.00009720335,0.0016214065,0.0032508746,0.00005014511,0.012777968,0.9429497,0.0010230723],"about_ca_topic_score_codex":0.00031684514,"about_ca_topic_score_gemma":0.000008730018,"teacher_disagreement_score":0.9427137,"about_ca_system_score_codex":0.0001623385,"about_ca_system_score_gemma":0.00026219373,"threshold_uncertainty_score":0.78476894},"labels":[],"label_agreement":null},{"id":"W2120251897","doi":"10.1145/581316.581318","title":"Using computer algebra methods to determine the chemical dimension of finitely ramified Sierpinski carpets","year":2002,"lang":"en","type":"article","venue":"ACM SIGSAM Bulletin","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Dimension (graph theory); Mathematics; Sierpinski carpet; Hausdorff dimension; Dijkstra's algorithm; Exponent; Sierpinski triangle; Scaling; Shortest path problem; Combinatorics; Path (computing); Pure mathematics; Discrete mathematics; Mathematical analysis; Computer science; Geometry; Fractal","score_opus":0.08648627701896819,"score_gpt":0.3143941057369356,"score_spread":0.22790782871796741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120251897","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1233375,0.00044625122,0.8637762,0.011599853,0.00026563482,0.00020638654,0.000011573981,0.00010151632,0.0002550675],"genre_scores_gemma":[0.3969047,0.000014707033,0.6007188,0.0021510555,0.000080583624,0.000005455211,0.0000039856773,0.0000072564385,0.000113458824],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980922,0.0002659451,0.00042133295,0.00052195974,0.00033881946,0.00035975937],"domain_scores_gemma":[0.99637645,0.0018559342,0.00014601326,0.0013710037,0.000100636105,0.00014995782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062272366,0.00019322622,0.00037538196,0.00019184919,0.00011521754,0.00006237667,0.002026863,0.00009958071,0.00064115523],"category_scores_gemma":[0.0014099919,0.00012444025,0.00016830482,0.0014163806,0.000100673475,0.00006422034,0.0018198326,0.00017957258,0.00019201748],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021721704,0.00035489086,0.00020883024,0.00002090499,0.00012605681,0.000060959508,0.0006984002,0.0009547871,0.035969038,0.0025702496,0.034728643,0.92428553],"study_design_scores_gemma":[0.0015112265,0.00076331093,0.0027668765,0.00010836845,0.00023269802,0.00016490204,0.00006050131,0.5226332,0.11507407,0.003964782,0.35129976,0.0014203298],"about_ca_topic_score_codex":0.00009640352,"about_ca_topic_score_gemma":6.3267527e-7,"teacher_disagreement_score":0.9228652,"about_ca_system_score_codex":0.000023880135,"about_ca_system_score_gemma":0.000007833446,"threshold_uncertainty_score":0.70202},"labels":[],"label_agreement":null},{"id":"W2125037073","doi":"10.1109/iccv.1995.466794","title":"Indexing visual representations through the complexity map","year":2002,"lang":"en","type":"article","venue":"","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Air Force Office of Scientific Research","keywords":"Measure (data warehouse); Mathematics; Search engine indexing; Artificial intelligence; Computer science; Curse of dimensionality; Simple (philosophy); Countable set; Discrete mathematics; Data mining","score_opus":0.11934509743227917,"score_gpt":0.32790543616729806,"score_spread":0.2085603387350189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125037073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075694494,0.00011353624,0.9091994,0.027442247,0.0001104492,0.0000549001,0.000002715125,0.00014363069,0.06217618],"genre_scores_gemma":[0.95508385,0.000019091485,0.033221565,0.0025705227,0.000068870744,0.0000069381254,0.0000055724804,0.0000018758452,0.009021742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991617,0.000058959056,0.00013894652,0.00023833921,0.00021471528,0.00018730866],"domain_scores_gemma":[0.99926966,0.000166142,0.00003867438,0.0004551508,0.00003117953,0.00003920931],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00011534242,0.000060895538,0.00008444971,0.00004938509,0.00027894275,0.00016937879,0.00080552,0.000022703805,0.002284678],"category_scores_gemma":[0.000078020195,0.000032622967,0.00006525117,0.0012489897,0.00014915185,0.0004112067,0.00039076997,0.00008791366,0.0006496198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.914065e-7,0.000090941816,0.00074190483,9.306213e-7,0.000024190544,0.0000053215176,0.00036362052,0.00007674804,0.0000048489014,0.94289404,0.04166939,0.014127749],"study_design_scores_gemma":[0.0003285559,0.00009647385,0.020417329,0.000003195633,0.000027877884,0.000020474834,0.0005836323,0.3534918,0.00020436538,0.32307163,0.3014035,0.00035117037],"about_ca_topic_score_codex":0.00041106547,"about_ca_topic_score_gemma":0.00004719433,"teacher_disagreement_score":0.95432687,"about_ca_system_score_codex":0.0000092264745,"about_ca_system_score_gemma":0.0000028405484,"threshold_uncertainty_score":0.99862736},"labels":[],"label_agreement":null},{"id":"W2126210866","doi":"10.1016/j.laa.2012.06.038","title":"On the geometric interpretation of the nonnegative rank","year":2012,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Rank (graph theory); Combinatorics; Euclidean geometry; Polytope; Dimension (graph theory); Interpretation (philosophy); Matrix (chemical analysis); Euclidean distance; Nonnegative matrix; Discrete mathematics; Eigenvalues and eigenvectors; Symmetric matrix; Geometry; Computer science","score_opus":0.014575781886095754,"score_gpt":0.24603094773756137,"score_spread":0.2314551658514656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126210866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11116617,0.0009044818,0.8773002,0.006709672,0.000083334075,0.0004698735,0.0000326147,0.000039666193,0.0032939839],"genre_scores_gemma":[0.9983974,0.00004305117,0.00073537463,0.00051888055,0.000040871084,0.000056808745,0.0000030628566,0.0000017952817,0.0002027632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994435,0.000047816087,0.00013206204,0.00012653206,0.00014081513,0.00010927691],"domain_scores_gemma":[0.99885404,0.00060598506,0.00008859998,0.00035521472,0.000055438246,0.000040734536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021130774,0.000059002003,0.00007990895,0.0001053592,0.00016433824,0.000022699385,0.0005107932,0.00002723569,0.000041232823],"category_scores_gemma":[0.00024303871,0.000027466394,0.000051134422,0.0022409202,0.000054586326,0.00014755096,0.0001728899,0.00008551903,0.00006481879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013758913,0.00007742415,0.00027204666,0.000002942527,0.00002064652,1.210101e-8,0.00023513996,0.00002240813,0.00007001574,0.9696887,0.00031163363,0.02929765],"study_design_scores_gemma":[0.0012418894,0.0004810466,0.2715227,0.00006913783,0.00041100298,0.000020055393,0.0008325415,0.29736447,0.04241094,0.26862425,0.11590719,0.001114758],"about_ca_topic_score_codex":0.000006762085,"about_ca_topic_score_gemma":7.562855e-7,"teacher_disagreement_score":0.88723123,"about_ca_system_score_codex":0.0000055617866,"about_ca_system_score_gemma":0.0000067392866,"threshold_uncertainty_score":0.12639734},"labels":[],"label_agreement":null},{"id":"W2130233589","doi":"","title":"Almost unknotted embeddings of graphs and surfaces(Knots and soft-matter physics: Topology of polymers and related topics in physics, mathematics and biology)","year":2009,"lang":"en","type":"article","venue":"Kyoto University Research Information Repository (Kyoto University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polymer physics; Mathematics; Soft matter; Physics; Topology (electrical circuits); Discrete mathematics; Polymer; Combinatorics; Engineering","score_opus":0.019011758474588372,"score_gpt":0.25044119095995426,"score_spread":0.2314294324853659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130233589","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98693645,0.0000603533,0.001994853,0.00048340636,0.000021160893,0.0002104017,0.000013718545,0.00002558161,0.010254102],"genre_scores_gemma":[0.99738646,0.0002794535,0.0013100834,0.00003998505,0.0000037309765,8.9833264e-8,0.000009484491,0.0000017749313,0.00096896297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9989987,0.00012732725,0.00022545285,0.00023903044,0.0001797849,0.00022972564],"domain_scores_gemma":[0.99902433,0.00018237595,0.00019287484,0.00023664707,0.00023244276,0.0001313055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026032358,0.00012022561,0.00028380763,0.00092795107,0.00021983452,0.00004625201,0.00035945023,0.00014448793,0.000009791156],"category_scores_gemma":[0.00006264394,0.00012391465,0.000036091118,0.0017319287,0.0006863539,0.0015003742,0.00048448224,0.00021475132,0.0000022455524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024070663,0.0003252613,0.1619412,0.00032491487,0.00025417353,0.00012765534,0.0118289925,0.00010023961,0.0030964268,0.7815764,0.00018333383,0.04000073],"study_design_scores_gemma":[0.014605253,0.0059245112,0.66060865,0.0006200527,0.0004490848,0.00041854475,0.05651847,0.07578301,0.015854567,0.14505678,0.021498233,0.002662855],"about_ca_topic_score_codex":0.0007826971,"about_ca_topic_score_gemma":0.000007412774,"teacher_disagreement_score":0.63651955,"about_ca_system_score_codex":0.000044892364,"about_ca_system_score_gemma":0.00005482706,"threshold_uncertainty_score":0.5053093},"labels":[],"label_agreement":null},{"id":"W2131989567","doi":"10.1142/s0219720004000661","title":"PATTERNHUNTER II: HIGHLY SENSITIVE AND FAST HOMOLOGY SEARCH","year":2004,"lang":"en","type":"article","venue":"Journal of Bioinformatics and Computational Biology","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":231,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Bioinformatics Solutions (Canada); University of Waterloo","funders":"","keywords":"Homology (biology); Sensitivity (control systems); Smith–Waterman algorithm; Computer science; Mathematics; Computational biology; Biology; Genetics; Sequence alignment; Engineering; Gene","score_opus":0.011082962675431672,"score_gpt":0.24645442387469926,"score_spread":0.23537146119926758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131989567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36208743,0.0001053494,0.63395005,0.003635868,0.00007696646,0.000022876271,0.000013866842,0.0000054752613,0.00010211803],"genre_scores_gemma":[0.91376245,0.00009322923,0.08505571,0.0010309567,0.000037963848,2.533086e-7,0.00000936139,0.0000011898803,0.00000887199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921894,0.000034933655,0.00038806885,0.00009178992,0.00012091003,0.00014537077],"domain_scores_gemma":[0.9992833,0.000156495,0.0001962849,0.0000670593,0.00019955238,0.000097308075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027826405,0.00008451053,0.0002218243,0.00031138049,0.00012036823,0.000058093734,0.00019810065,0.00006405447,0.0000037778545],"category_scores_gemma":[0.000031319007,0.00005609251,0.000048449183,0.00024911406,0.00015911937,0.00027836824,0.0002884979,0.00013965483,0.0000056909903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064158136,0.00029158016,0.0051358654,0.00004761014,0.0005157046,0.0001480656,0.0046765544,0.014518203,0.00022366024,0.54323924,0.00035957288,0.43077978],"study_design_scores_gemma":[0.006760806,0.009252112,0.20476954,0.00010239216,0.0001340886,0.010873042,0.0016095167,0.30995104,0.00066650554,0.45058814,0.004314837,0.0009779815],"about_ca_topic_score_codex":0.000016234026,"about_ca_topic_score_gemma":0.0000013893041,"teacher_disagreement_score":0.551675,"about_ca_system_score_codex":0.000015665353,"about_ca_system_score_gemma":0.00005110879,"threshold_uncertainty_score":0.22873862},"labels":[],"label_agreement":null},{"id":"W2134519136","doi":"10.1111/j.1467-8659.2009.01513.x","title":"Manifold Homotopy via the Flow Complex","year":2009,"lang":"en","type":"article","venue":"Computer Graphics Forum","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Homotopy; Submanifold; Mathematics; Manifold (fluid mechanics); Dimension (graph theory); Pure mathematics; Flow (mathematics); Filtration (mathematics); Critical point (mathematics); Function (biology); Sample (material); Mathematical analysis; Geometry; Physics","score_opus":0.019591535305022077,"score_gpt":0.23574142154996006,"score_spread":0.21614988624493797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134519136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007775042,0.00019180113,0.97683793,0.020700771,0.00037415893,0.00013512239,0.000008429956,0.0002591687,0.000715131],"genre_scores_gemma":[0.9122187,0.000069151894,0.06652773,0.020762697,0.00024319107,0.000006664791,0.00003501483,0.0000069795947,0.00012987613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814224,0.000083475345,0.0003017214,0.000523115,0.00040425418,0.0005451783],"domain_scores_gemma":[0.99828726,0.00013942616,0.00009853807,0.0012401689,0.00008955567,0.00014507193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003142522,0.00022048407,0.00026310078,0.00031540488,0.00044267948,0.00036361988,0.0027164205,0.00008723929,0.000040937157],"category_scores_gemma":[0.000011943692,0.00013681159,0.00028169373,0.002531838,0.000087842716,0.00034540505,0.0005961459,0.0002596111,0.00012302885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023234873,0.00012416262,0.00057624705,0.0000018223986,0.00004325123,0.000031479743,0.000050193623,0.00009946769,0.000013504716,0.74991494,0.0346356,0.21450698],"study_design_scores_gemma":[0.00024272733,0.00030407417,0.04082132,0.000004742539,0.000019133153,0.00005502063,0.0000049024834,0.6764336,0.000027567317,0.17432256,0.10747074,0.00029359243],"about_ca_topic_score_codex":0.00002456963,"about_ca_topic_score_gemma":0.000014383238,"teacher_disagreement_score":0.9114412,"about_ca_system_score_codex":0.000013123325,"about_ca_system_score_gemma":0.000012967053,"threshold_uncertainty_score":0.55790144},"labels":[],"label_agreement":null},{"id":"W2137805114","doi":"10.1142/s0218348x15500152","title":"USING EPSILON HULLS TO CHARACTERIZE AND CLASSIFY TOTALLY DISCONNECTED SIERPIŃSKI RELATIVES","year":2015,"lang":"en","type":"article","venue":"Fractals","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sierpinski triangle; Mathematics; Hull; Fractal; Totally disconnected space; Fractal dimension; Dimension (graph theory); Combinatorics; Mathematical analysis; Geology","score_opus":0.1343725120312041,"score_gpt":0.31466411575727965,"score_spread":0.18029160372607556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137805114","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8331233,0.00015457335,0.16086014,0.0025539754,0.00018495168,0.0001263528,0.00003285528,0.0001081934,0.0028556369],"genre_scores_gemma":[0.9525566,0.000009045248,0.046067998,0.00063962326,0.000057697274,0.0000051268207,0.00001788233,0.0000060638713,0.0006399354],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9986396,0.00009393793,0.00024772514,0.00045360648,0.00027838437,0.00028676298],"domain_scores_gemma":[0.9988451,0.00018885147,0.0001143019,0.00041191783,0.000082826184,0.00035699384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033332338,0.00015102711,0.00029612368,0.00023770331,0.00009288358,0.00024925903,0.00046605084,0.00008272188,0.000050178365],"category_scores_gemma":[0.00066431524,0.00011402743,0.000052391315,0.0012315584,0.00005489614,0.0008894651,0.0005249374,0.00012392139,0.00011857888],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033502709,0.0017625035,0.07230857,0.00009755219,0.0010080787,0.00087884313,0.015463237,0.001073127,0.23531927,0.19878277,0.015533856,0.45743716],"study_design_scores_gemma":[0.0015075736,0.0010987993,0.8646622,0.00010772905,0.00011580922,0.00012571043,0.00049915956,0.033500023,0.0023006415,0.02493394,0.06956971,0.0015787669],"about_ca_topic_score_codex":0.000079964644,"about_ca_topic_score_gemma":0.000004855765,"teacher_disagreement_score":0.7923536,"about_ca_system_score_codex":0.0000400905,"about_ca_system_score_gemma":0.000038375147,"threshold_uncertainty_score":0.46499038},"labels":[],"label_agreement":null},{"id":"W2142740132","doi":"10.1007/978-3-642-04271-3_20","title":"Topological Characterization of Signal in Brain Images Using Min-Max Diagrams","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Robustness (evolution); Pairing; Pattern recognition (psychology); Representation (politics); Artificial intelligence; SIGNAL (programming language); Inference; Image (mathematics); Algorithm; Theoretical computer science; Physics","score_opus":0.017073176524273388,"score_gpt":0.2669546916604068,"score_spread":0.2498815151361334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142740132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35777554,0.000030474901,0.6402693,0.0017327005,0.00009769941,0.000063406515,0.000001943384,0.00002380205,0.000005162943],"genre_scores_gemma":[0.8343368,0.0000051229636,0.16447227,0.0011268314,0.000052859803,9.904555e-7,0.000003047562,0.0000014008672,6.6639166e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979883,0.00010515531,0.00037860867,0.0006593375,0.00043545966,0.0004331679],"domain_scores_gemma":[0.99893,0.00034264463,0.00013368137,0.00043293045,0.000078287034,0.000082451224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007988878,0.00015658332,0.00030593912,0.0007389226,0.00008386332,0.00017247225,0.001569242,0.000088120345,0.000017361164],"category_scores_gemma":[0.00029676882,0.00011803638,0.00006192097,0.0061768144,0.00032681943,0.00071457576,0.00037835742,0.0001925247,0.0000027115022],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005542704,0.00020955152,0.010675537,0.000004178607,0.0000021511976,0.000048556994,0.0002925151,0.014984371,0.08865682,0.001596029,0.0000012312416,0.8835235],"study_design_scores_gemma":[0.00023284614,0.0002915409,0.20729367,0.000032623222,0.0000026085067,0.000020029904,5.32535e-7,0.72330356,0.038210552,0.030353915,0.000013644782,0.0002445018],"about_ca_topic_score_codex":0.00006146293,"about_ca_topic_score_gemma":0.000013757375,"teacher_disagreement_score":0.883279,"about_ca_system_score_codex":0.00006579184,"about_ca_system_score_gemma":0.00007078189,"threshold_uncertainty_score":0.4813384},"labels":[],"label_agreement":null},{"id":"W2142999993","doi":"10.1214/ejp.v18-2201","title":"Central limit theorems for Fréchet means in the space of phylogenetic trees","year":2013,"lang":"en","type":"article","venue":"Electronic Journal of Probability","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Limiting; Space (punctuation); Limit (mathematics); Phylogenetic tree; Distribution (mathematics); Pure mathematics; Gaussian; Polish space; Mathematical analysis","score_opus":0.014173809590525128,"score_gpt":0.2300491375055694,"score_spread":0.21587532791504427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142999993","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6986064,0.0013231662,0.2934625,0.006030997,0.00007091409,0.00035853972,0.0000035487913,0.0000060031584,0.00013795482],"genre_scores_gemma":[0.99344945,0.00008294361,0.0063219843,0.00006543218,0.00004778065,0.000010180615,6.536084e-7,0.0000021167132,0.000019450692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832195,0.00024839342,0.0004607535,0.00017973025,0.0002861103,0.00050307065],"domain_scores_gemma":[0.9986076,0.00047687616,0.00029445597,0.0003954945,0.00017192289,0.000053685828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018973203,0.00009971497,0.00027874066,0.00011740423,0.0000382476,0.000047360987,0.001362542,0.00004730229,0.000037888563],"category_scores_gemma":[0.0005312186,0.000053063028,0.00022188605,0.0008054625,0.000108602224,0.00022518926,0.00006761521,0.00026172024,0.0000016400975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007424697,0.0013569616,0.031020576,0.00004355003,0.00020323679,0.0000029626444,0.0017173784,0.003158671,0.0020575349,0.87804765,0.0008063338,0.08151091],"study_design_scores_gemma":[0.0004971768,0.0011728901,0.08054102,0.000008518973,0.000037406928,0.00002331611,0.000117953125,0.003992406,0.0014387412,0.9107903,0.0012729168,0.00010735094],"about_ca_topic_score_codex":0.000085528576,"about_ca_topic_score_gemma":0.00021849979,"teacher_disagreement_score":0.29484308,"about_ca_system_score_codex":0.000094527684,"about_ca_system_score_gemma":0.00017165403,"threshold_uncertainty_score":0.25319648},"labels":[],"label_agreement":null},{"id":"W2143797263","doi":"10.1016/j.jalgebra.2014.02.024","title":"Bulitko's Lemma for acylindrical splittings","year":2014,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lemma (botany); Homomorphism; Mathematics; Key (lock); Pure mathematics; Combinatorics; Algebra over a field; Discrete mathematics; Computer science","score_opus":0.011641645082768057,"score_gpt":0.24246075458787028,"score_spread":0.23081910950510223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143797263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061738275,0.000117004296,0.9291363,0.007989808,0.00030486626,0.000036353238,0.0000017222177,0.000019086527,0.0006565945],"genre_scores_gemma":[0.8649009,0.000016807213,0.1330351,0.0011731591,0.0005448507,0.0000012629354,0.0000010567111,0.000004297136,0.0003225756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99884486,0.000048442238,0.00043208725,0.00015920699,0.00030121126,0.00021417122],"domain_scores_gemma":[0.9985475,0.00049179955,0.00033954554,0.00025350545,0.00020938998,0.00015828475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010085049,0.00008582242,0.00027836085,0.00022806534,0.00007344373,0.00012860059,0.0010565092,0.000056784153,0.00004486046],"category_scores_gemma":[0.001053102,0.000056143428,0.00026098624,0.0006150236,0.000033490316,0.00038827432,0.00014806302,0.00014887053,0.000028338578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043643002,0.00027867465,0.0016835367,0.000019646863,0.00016055799,0.000028974437,0.00016592706,0.000082007886,0.00041062426,0.52349275,0.02662928,0.44700438],"study_design_scores_gemma":[0.0018120487,0.0020619761,0.017829403,0.000031068354,0.00012442519,0.0003009616,0.000039156424,0.019351449,0.0020767616,0.27748176,0.67849433,0.0003966435],"about_ca_topic_score_codex":0.000003421949,"about_ca_topic_score_gemma":4.4294444e-7,"teacher_disagreement_score":0.80316263,"about_ca_system_score_codex":0.000017645512,"about_ca_system_score_gemma":0.000029464454,"threshold_uncertainty_score":0.22894625},"labels":[],"label_agreement":null},{"id":"W2144611664","doi":"10.1007/978-3-319-41573-4_15","title":"High-Dimensional Classification for Brain Decoding","year":2017,"lang":"en","type":"book-chapter","venue":"Contributions to statistics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Magnetoencephalography; Neuroimaging; Decoding methods; Computer science; Neural decoding; Brain activity and meditation; Pattern recognition (psychology); Cognition; Classifier (UML); Principal component analysis; Artificial intelligence; Stimulus (psychology); Functional magnetic resonance imaging; Neuroscience; Psychology; Cognitive psychology; Electroencephalography; Algorithm","score_opus":0.04178386410129276,"score_gpt":0.32509681087796377,"score_spread":0.283312946776671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144611664","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.747617e-7,0.00009990146,0.95604557,0.0072686938,0.0005041112,0.00035845293,0.03070292,0.00007658962,0.0049431776],"genre_scores_gemma":[0.002736653,0.000046071156,0.5465962,0.0012375046,0.00046901958,0.000101198806,0.0065686796,0.000025957437,0.44221866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983624,0.000018756995,0.00040760083,0.0005922102,0.00030218382,0.00031685276],"domain_scores_gemma":[0.99633014,0.0011789486,0.00035949892,0.0010078418,0.00089860643,0.00022493995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004104204,0.00024011059,0.00042785335,0.00033903943,0.0006813201,0.0003060577,0.0010419429,0.00022807284,0.0001561398],"category_scores_gemma":[0.0035059727,0.00022202541,0.0001269148,0.00007603742,0.00009586004,0.00013665057,0.00034484666,0.00018801309,0.00042118563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037762347,0.00001144081,7.5508655e-7,0.000004492199,0.00005141728,0.0000064334936,0.0000030511053,0.000024062028,0.000009090485,0.7793267,0.16370904,0.056849726],"study_design_scores_gemma":[0.00024209643,0.00009191008,0.00016484813,0.000024367124,0.00008834256,0.000003283006,3.409879e-7,0.012143466,0.000009294608,0.42248258,0.5644739,0.00027554124],"about_ca_topic_score_codex":0.000020771547,"about_ca_topic_score_gemma":0.000040572315,"teacher_disagreement_score":0.4372755,"about_ca_system_score_codex":0.00018782422,"about_ca_system_score_gemma":0.00017316017,"threshold_uncertainty_score":0.90539336},"labels":[],"label_agreement":null},{"id":"W2151511525","doi":"10.18910/6837","title":"The restricted Nagata's pairwise algorithm and the Euclidean algorithm","year":2008,"lang":"en","type":"article","venue":"Osaka City University (Osaka City University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Pairwise comparison; Euclidean geometry; Mathematics; Euclidean distance; Euclidean algorithm; Point (geometry); Algorithm; Euclidean domain; Euclidean distance matrix; Combinatorics; Geometry; Statistics","score_opus":0.012908954375143855,"score_gpt":0.17318482766902332,"score_spread":0.16027587329387946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151511525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05941159,0.00034140464,0.89579827,0.014452188,0.0005386259,0.00081979326,0.0003464558,0.00087030814,0.02742139],"genre_scores_gemma":[0.61776894,0.022317303,0.13029633,0.0023002168,0.00065085304,0.0000021398066,0.00028582232,0.00007491219,0.22630347],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964912,0.0007757076,0.00026167644,0.000997254,0.00071946543,0.000754677],"domain_scores_gemma":[0.9962396,0.0013133758,0.00028361785,0.0014013338,0.00031943602,0.00044263608],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006712711,0.00038728534,0.0005243973,0.0007325543,0.0041940836,0.00023038896,0.0037365728,0.0002369927,0.000064502536],"category_scores_gemma":[0.00026687636,0.00028574537,0.0003830654,0.0057520117,0.0020994695,0.0012616891,0.0025763465,0.0006942108,0.000051972733],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000620935,0.0008599608,0.009913253,0.00002258261,0.0014455278,0.0075491956,0.00273959,0.000100362435,0.000018979279,0.4513914,0.026745807,0.4985924],"study_design_scores_gemma":[0.005981714,0.00022683092,0.0354661,0.00001805006,0.0003407817,0.00021006589,0.0021722736,0.03459934,0.000053963642,0.0026548798,0.9172551,0.0010209235],"about_ca_topic_score_codex":0.0025720296,"about_ca_topic_score_gemma":0.00028902927,"teacher_disagreement_score":0.89050925,"about_ca_system_score_codex":0.00026691865,"about_ca_system_score_gemma":0.00019907954,"threshold_uncertainty_score":0.99995947},"labels":[],"label_agreement":null},{"id":"W2152546987","doi":"10.1007/s00454-009-9206-y","title":"Simplices and Spectra of Graphs","year":2009,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Univerza v Ljubljani; Javna Agencija za Raziskovalno Dejavnost RS; American Institute of Mathematics; National Science Foundation","keywords":"Mathematics; Simplex; Codimension; Combinatorics; Dimension (graph theory); Computation; Eigenvalues and eigenvectors; Enhanced Data Rates for GSM Evolution; Pure mathematics; Computer science","score_opus":0.009929335787763083,"score_gpt":0.2566403824881218,"score_spread":0.24671104670035873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152546987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32877982,0.00075591385,0.6657472,0.0018663974,0.000056252866,0.000071550494,0.000036705893,0.00008347416,0.0026026675],"genre_scores_gemma":[0.957864,0.000027599513,0.04158674,0.0004258791,0.000018939907,8.785782e-7,0.000033524288,0.0000018264261,0.000040636834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9988697,0.000028440349,0.0002522118,0.0003273124,0.00034268887,0.00017960266],"domain_scores_gemma":[0.9992727,0.0002173148,0.00011421292,0.00021985992,0.00007805046,0.00009786529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016581597,0.0001127611,0.00021221397,0.00051129976,0.00007792593,0.00007905202,0.00047008484,0.000040061834,0.000046626534],"category_scores_gemma":[0.00006409358,0.00009000402,0.000089050525,0.0022284628,0.00008115605,0.0003276854,0.00012212085,0.00007882331,0.000011389537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007211971,0.000103879676,0.0066163926,0.000009522208,0.00005789775,0.000009763208,0.00008829789,0.0042389613,0.00010553245,0.8936341,0.00034118933,0.094787285],"study_design_scores_gemma":[0.00023225955,0.0002237414,0.551255,0.0000066821012,0.000016602198,0.000014756245,0.000030099638,0.025519878,0.000107653505,0.42186332,0.0005516414,0.0001783597],"about_ca_topic_score_codex":0.000019814024,"about_ca_topic_score_gemma":7.479521e-7,"teacher_disagreement_score":0.62908417,"about_ca_system_score_codex":0.000006763063,"about_ca_system_score_gemma":0.00001593758,"threshold_uncertainty_score":0.36702573},"labels":[],"label_agreement":null},{"id":"W2159327974","doi":"10.1007/978-3-0348-8217-0_24","title":"Group Actions and Homogeneous Spaces","year":2002,"lang":"en","type":"book-chapter","venue":"Birkhäuser Basel eBooks","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Homogeneous; Group (periodic table); Pure mathematics; Mathematics; Computer science; Physics; Combinatorics; Quantum mechanics","score_opus":0.04199540744454208,"score_gpt":0.2237787702989593,"score_spread":0.1817833628544172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159327974","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010830392,0.0020492442,0.03757898,0.0006208119,0.00039147714,0.00026967787,0.00017975393,0.00051565754,0.9582861],"genre_scores_gemma":[0.0068687475,0.0006541762,0.0074731396,0.00067951734,0.0002508615,0.000020120171,0.000031393905,0.000040030394,0.983982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99799824,0.000028143439,0.0003260498,0.0008946596,0.00039807605,0.00035485203],"domain_scores_gemma":[0.99824584,0.0001832378,0.00019642428,0.0010470467,0.00006567953,0.00026178887],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015264929,0.0004221148,0.00048975274,0.0006161869,0.00026078895,0.00034833697,0.0008916291,0.0003426966,0.0006262813],"category_scores_gemma":[0.000028644516,0.0003468981,0.00023346493,0.000105121406,0.00019362023,0.00014519504,0.00063760957,0.00035876557,0.000468456],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003168547,0.000029754263,0.0000157062,0.000020546579,0.00018469515,0.00020871148,0.00006103069,0.0000014262987,0.000018735638,0.83981675,0.0072385226,0.15240094],"study_design_scores_gemma":[0.0001704379,0.00012360707,0.000057696994,0.000031683463,0.00013553278,0.00009761195,0.0000040032496,0.0004268086,0.000026266616,0.038796365,0.9595771,0.0005528756],"about_ca_topic_score_codex":0.00007333386,"about_ca_topic_score_gemma":0.000059664213,"teacher_disagreement_score":0.9523386,"about_ca_system_score_codex":0.00003708026,"about_ca_system_score_gemma":0.000023955636,"threshold_uncertainty_score":0.9998983},"labels":[],"label_agreement":null},{"id":"W2166093887","doi":"","title":"The Manifold Tangent Classifier","year":2011,"lang":"en","type":"article","venue":"","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":157,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Manifold alignment; Classifier (UML); Manifold (fluid mechanics); Disjoint sets; Jacobian matrix and determinant; Tangent space; Pattern recognition (psychology); Artificial intelligence; Mathematics; Computer science; Nonlinear dimensionality reduction; Exploit; Algorithm; Discrete mathematics; Pure mathematics; Dimensionality reduction; Applied mathematics","score_opus":0.059498910997106184,"score_gpt":0.2114213019435433,"score_spread":0.1519223909464371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166093887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010168378,0.00022434052,0.6011104,0.0024084204,0.0002494854,0.000043479726,9.602421e-7,0.00013375629,0.39481232],"genre_scores_gemma":[0.9495407,0.00009968326,0.020402692,0.001144505,0.000038618087,0.0000080827795,6.9261625e-7,0.00000189333,0.028763179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99945956,0.000019974681,0.00008855867,0.00015331164,0.00012545733,0.00015314636],"domain_scores_gemma":[0.9993958,0.000053791395,0.00002239787,0.0004539802,0.000021255508,0.000052762764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016745566,0.000044799715,0.00004825256,0.00003791042,0.0001295537,0.000073132505,0.0009670544,0.00001989145,0.0004963492],"category_scores_gemma":[0.000027825065,0.000019801808,0.00004889864,0.0005413782,0.000024656512,0.00012457097,0.00027541732,0.000041511434,0.00059641025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.7335495e-7,0.000019368194,0.00047404226,1.4813898e-7,0.000011919856,0.0000054810225,0.000028956974,6.38535e-8,0.000004196914,0.92535675,0.009561182,0.0645373],"study_design_scores_gemma":[0.00012117076,0.000111230256,0.07011913,9.2889263e-7,0.000015625354,0.000010222824,0.00011136366,0.0040141167,0.0009684363,0.0909735,0.833345,0.00020929874],"about_ca_topic_score_codex":0.000084421146,"about_ca_topic_score_gemma":0.000035485013,"teacher_disagreement_score":0.9485238,"about_ca_system_score_codex":0.000005653087,"about_ca_system_score_gemma":0.0000053262656,"threshold_uncertainty_score":0.7665846},"labels":[],"label_agreement":null},{"id":"W2166183308","doi":"10.1007/s00493-013-2649-z","title":"Chromatic number and complete graph substructures for degree sequences","year":2013,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Degree (music); Conjecture; Disjoint sets; Upper and lower bounds; Clique number; Subdivision; Clique; Chromatic scale; Discrete mathematics","score_opus":0.033176896259429364,"score_gpt":0.2485224778428964,"score_spread":0.21534558158346706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166183308","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71210384,0.0016134793,0.27306384,0.0062726215,0.0009257817,0.0009325536,0.000036665686,0.000464859,0.0045863413],"genre_scores_gemma":[0.9842573,0.00003168823,0.015240741,0.00023138858,0.00001666785,0.000054157354,0.000005959758,0.000003573388,0.00015852311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904466,0.000033554963,0.00017779272,0.00032201636,0.00016766762,0.0002542973],"domain_scores_gemma":[0.99907446,0.0002745721,0.00007528061,0.0003645677,0.00008643147,0.00012470043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009855091,0.00012314861,0.00022299762,0.00010343155,0.00018430005,0.000219378,0.0007096083,0.000050374176,0.00012811294],"category_scores_gemma":[0.00010299455,0.00008623571,0.000070482725,0.0008739615,0.000102452446,0.0003519141,0.00020779723,0.00006338933,0.000085454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020272248,0.0000960806,0.013354809,0.000059544705,0.00010363369,0.0000075455887,0.00017270312,0.0000033819504,0.00038118628,0.9057191,0.017572429,0.06252757],"study_design_scores_gemma":[0.0003235513,0.00009536807,0.0969557,0.0000051040606,0.000019328285,0.00001791918,0.000019553068,0.0033056159,0.00012651665,0.892952,0.005966982,0.00021235313],"about_ca_topic_score_codex":0.00015415388,"about_ca_topic_score_gemma":0.000002630063,"teacher_disagreement_score":0.27215344,"about_ca_system_score_codex":0.000014634169,"about_ca_system_score_gemma":0.000010446873,"threshold_uncertainty_score":0.35165903},"labels":[],"label_agreement":null},{"id":"W2167387938","doi":"10.1109/pccga.2003.1238302","title":"Voxelization in common sampling lattices","year":2004,"lang":"en","type":"article","venue":"","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Polygon mesh; Social connectedness; Lattice (music); Cartesian coordinate system; Computer science; Hexagonal crystal system; Hexagonal lattice; Theoretical computer science; Mathematics; Algorithm; Computer graphics (images); Geometry; Physics; Crystallography","score_opus":0.03872903221566794,"score_gpt":0.29451887655011,"score_spread":0.2557898443344421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167387938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08638452,0.000056005047,0.9089798,0.0015688773,0.000036496993,0.000021627691,4.5950247e-7,0.00006692922,0.0028853219],"genre_scores_gemma":[0.95044816,0.000014919441,0.04906261,0.00038211406,0.000009446746,0.0000011784254,0.0000039155975,7.520592e-7,0.00007692838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995363,0.00001089297,0.00011170475,0.0001460503,0.00009306986,0.000101983744],"domain_scores_gemma":[0.9997223,0.000042288877,0.00002196365,0.00017423551,0.000012027967,0.000027152677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012075253,0.00003751277,0.000074098716,0.00016432181,0.00002992843,0.00006762264,0.00034707802,0.000022572613,0.00003874737],"category_scores_gemma":[0.000032206244,0.000027120574,0.000018661935,0.0013670382,0.000010490845,0.00030593583,0.000114921946,0.000037411686,0.00007131814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.3143984e-7,0.00011090169,0.022061588,0.0000029038808,0.0000057179195,0.000008881969,0.00012959538,0.013590427,0.0000613519,0.8889171,0.000035799294,0.0750748],"study_design_scores_gemma":[0.0010229485,0.00013995597,0.3134296,0.000024450648,0.000011452883,0.000008592426,0.000110356435,0.0437043,0.0014970686,0.6308577,0.008744232,0.00044932548],"about_ca_topic_score_codex":0.00045329076,"about_ca_topic_score_gemma":0.00034022037,"teacher_disagreement_score":0.8640636,"about_ca_system_score_codex":0.00001700377,"about_ca_system_score_gemma":0.0000069921434,"threshold_uncertainty_score":0.11059449},"labels":[],"label_agreement":null},{"id":"W2171287813","doi":"10.1016/j.camwa.2013.06.004","title":"Comparison of persistent homologies for vector functions: From continuous to discrete and back","year":2013,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Università di Bologna; Università Degli Studi di Modena e Reggio Emila","keywords":"Persistent homology; Mathematics; Stability (learning theory); Homology (biology); Computation; Topological data analysis; Computer graphics; Continuous modelling; Rank (graph theory); Discrete space; Graphics; Topology (electrical circuits); Algorithm; Mathematical analysis; Computer science; Combinatorics; Data mining; Computer graphics (images)","score_opus":0.02758805262229667,"score_gpt":0.27468304791653864,"score_spread":0.24709499529424198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171287813","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012550118,0.00021180877,0.984386,0.00164849,0.00002711873,0.0009041571,0.000058051803,0.00006449602,0.00014972985],"genre_scores_gemma":[0.34314907,0.0000054261754,0.65608007,0.000081644925,0.00001955421,0.0004992637,0.000032281107,0.000005007818,0.00012769604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990584,0.000012717832,0.00030100762,0.00032943237,0.00013298861,0.00016542592],"domain_scores_gemma":[0.99841094,0.000570212,0.00016358937,0.00058475515,0.00015708743,0.00011339307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000063968444,0.00012690257,0.0003447755,0.00012050038,0.00011456573,0.00013335708,0.00057962205,0.00003739849,0.00002147193],"category_scores_gemma":[0.00003139646,0.00008924944,0.0001139589,0.00055469957,0.00009696593,0.00013486994,0.00024912434,0.000048366786,0.00006213209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044777207,0.0036445279,0.007746502,0.0007034118,0.003518519,0.0000014497651,0.011475531,0.009445795,0.0021704193,0.40018308,0.07037843,0.49068755],"study_design_scores_gemma":[0.0019333742,0.0025969043,0.015069552,0.00021617407,0.0009823211,0.000021700811,0.0057492782,0.8748253,0.0010024363,0.05697758,0.03916223,0.0014631727],"about_ca_topic_score_codex":0.00005107478,"about_ca_topic_score_gemma":0.0000040258737,"teacher_disagreement_score":0.86537945,"about_ca_system_score_codex":0.0000137822335,"about_ca_system_score_gemma":0.000010344943,"threshold_uncertainty_score":0.36394867},"labels":[],"label_agreement":null},{"id":"W2178931426","doi":"10.48550/arxiv.1511.05427","title":"A New Matching Algorithm for Multidimensional Persistence","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Simplicial complex; Persistent homology; Mathematics; Simplex; Simplicial homology; Matching (statistics); Simplicial approximation theorem; h-vector; Combinatorics; Computation; Function (biology); Algorithm; Discrete mathematics; Simplicial set; Pure mathematics","score_opus":0.11906617995549382,"score_gpt":0.21042189890145557,"score_spread":0.09135571894596176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2178931426","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005893392,0.00017562574,0.9923692,0.00023523181,0.0004667403,0.00020295067,0.000093782306,0.00017352669,0.00038959977],"genre_scores_gemma":[0.28176647,0.00007198311,0.7060892,0.00024906814,0.00022591127,0.0000017012698,0.00012582901,0.000015621596,0.011454224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801457,0.00006769529,0.0001854911,0.0012154069,0.000145318,0.00037152984],"domain_scores_gemma":[0.998015,0.00019965942,0.00020321361,0.00094382826,0.0002564998,0.0003818402],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034119977,0.00027566857,0.00039123298,0.00036651257,0.00016057088,0.00009536798,0.001793586,0.00024357744,0.000047241458],"category_scores_gemma":[0.00007616691,0.00026739668,0.0003776353,0.000995177,0.00005911632,0.00035357825,0.0026315611,0.0003451231,0.000095896336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053715066,0.00035572067,0.00038829385,0.000078755285,0.0007478978,0.00064090855,0.0006400768,0.2735808,0.000023780212,0.5202925,0.022225166,0.18097241],"study_design_scores_gemma":[0.0005254516,0.00007008745,0.00013319518,0.000028027724,0.00012281691,0.000005938575,0.00009749717,0.8699884,0.000015381267,0.12254056,0.006042684,0.00042997915],"about_ca_topic_score_codex":0.00052266853,"about_ca_topic_score_gemma":0.00002163898,"teacher_disagreement_score":0.5964076,"about_ca_system_score_codex":0.00016419837,"about_ca_system_score_gemma":0.00032529558,"threshold_uncertainty_score":0.9999778},"labels":[],"label_agreement":null},{"id":"W220737694","doi":"","title":"A Combinatorial Shifting Method On Multicomplexes With Applications To Simplicial Complexes And Simple Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Simple (philosophy); Mathematics; Simplicial complex; Abstract simplicial complex; Simplicial approximation theorem; Combinatorics; Simplicial set; Pure mathematics","score_opus":0.026642175524037547,"score_gpt":0.2865448549466455,"score_spread":0.259902679422608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W220737694","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7716674,0.00007987176,0.22282265,0.001661466,0.00048948894,0.00096539117,0.000057036785,0.0005402202,0.0017164449],"genre_scores_gemma":[0.9581436,0.000009374753,0.041006774,0.0006497256,0.000023444632,0.00011403688,0.00002107292,0.000014198913,0.000017770291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977889,0.00013669941,0.00033248359,0.0007891712,0.00048094636,0.00047179236],"domain_scores_gemma":[0.9979379,0.0006998874,0.00012715193,0.0007588707,0.00013901528,0.00033713225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003064614,0.000278073,0.0004550922,0.00040618115,0.00072578975,0.00014804037,0.0009583934,0.00008304739,0.000015833208],"category_scores_gemma":[0.0001323633,0.00021911788,0.00008242725,0.0024357934,0.00014495548,0.0002662188,0.00048289623,0.00021568056,0.0000515805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025675625,0.00025594945,0.003698668,0.0000051129527,0.00004717014,0.000016004617,0.00022440426,0.000051268864,0.00015688072,0.98787725,0.0005543868,0.007087219],"study_design_scores_gemma":[0.001871382,0.0010272793,0.04088813,0.000011509483,0.000043211025,0.00005033743,0.00006162778,0.0022674897,0.0009256999,0.9358857,0.016329682,0.00063790183],"about_ca_topic_score_codex":0.0003019366,"about_ca_topic_score_gemma":0.00001814031,"teacher_disagreement_score":0.18647617,"about_ca_system_score_codex":0.000038022605,"about_ca_system_score_gemma":0.000037825113,"threshold_uncertainty_score":0.8935368},"labels":[],"label_agreement":null},{"id":"W2222654916","doi":"10.1007/978-3-642-33398-9_4","title":"Spaces with a Single Center","year":2012,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Center (category theory); Space (punctuation); Natural (archaeology); Geography; Cartography; Computer science; Archaeology; Crystallography; Chemistry","score_opus":0.023836148432636803,"score_gpt":0.22313464382541798,"score_spread":0.19929849539278116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2222654916","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004112209,0.0006872977,0.8685349,0.0007377448,0.0009623948,0.00024372016,0.000011394309,0.00025260702,0.12815872],"genre_scores_gemma":[0.2811911,0.00040445282,0.66114694,0.002658562,0.0016274535,0.000029253037,0.000021859716,0.0001019192,0.052818462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99595904,0.000020841304,0.0004326592,0.0014588335,0.001200844,0.0009277559],"domain_scores_gemma":[0.9974126,0.000118387965,0.00029201127,0.0016579273,0.00016919694,0.00034986567],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008199186,0.00047380794,0.0005693536,0.0013005856,0.00019597821,0.00080766063,0.004062825,0.00017261854,0.00016126054],"category_scores_gemma":[0.000025385238,0.0003554274,0.00013036505,0.0013945785,0.0009341461,0.0013844608,0.0026605723,0.00049428554,0.00027300365],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000760428,0.00021561446,0.0014201028,0.00002842673,0.000042722473,0.00021416372,0.0002515111,0.00021900142,0.000029606941,0.5632007,0.00022766173,0.4341429],"study_design_scores_gemma":[0.0018526006,0.0017283442,0.007910594,0.0010881154,0.0001029073,0.0007188164,0.0000066778275,0.031829003,0.0007493483,0.048364334,0.9006438,0.0050054635],"about_ca_topic_score_codex":0.000044075387,"about_ca_topic_score_gemma":0.00004743314,"teacher_disagreement_score":0.90041614,"about_ca_system_score_codex":0.00022332797,"about_ca_system_score_gemma":0.00016522151,"threshold_uncertainty_score":0.9998898},"labels":[],"label_agreement":null},{"id":"W2226385761","doi":"10.1007/s40314-015-0303-7","title":"Computing the Monge–Kantorovich distance","year":2016,"lang":"en","type":"article","venue":"Computational and Applied Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Metric (unit); Metric space; Graph; Discrete space; Distance; Context (archaeology); Combinatorics; Discrete mathematics; Intrinsic metric; Finite set; Convex metric space; Mathematical analysis","score_opus":0.015371125851051593,"score_gpt":0.23213171855313078,"score_spread":0.21676059270207917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2226385761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011188761,0.000095199175,0.9842085,0.0024378507,0.000033974397,0.00007246346,0.000006479981,0.00007321724,0.0018835387],"genre_scores_gemma":[0.8361472,0.000011645586,0.16338494,0.0002631362,0.000040829498,0.0000047490303,0.0000022975526,0.0000030922733,0.0001420909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991708,0.000009958325,0.00020283587,0.0002256103,0.00023742115,0.00015342163],"domain_scores_gemma":[0.9987266,0.0008608366,0.00009543104,0.00022078653,0.000041350035,0.000055017495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021230285,0.000098960976,0.00013824564,0.00004298379,0.00020692304,0.00010602607,0.00047729065,0.000024838637,0.00001468114],"category_scores_gemma":[0.00004239066,0.00004448217,0.000033120872,0.00036861424,0.00011240238,0.00009183567,0.00029202894,0.00004547096,0.00005664305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.6589723e-7,0.000033201024,0.000047501402,0.000009153743,0.000014280532,8.0397206e-7,0.00014743267,0.000353393,0.0000406285,0.9250159,0.00036631635,0.07397071],"study_design_scores_gemma":[0.0002975214,0.000019290525,0.0038145941,0.000023203118,0.00001501083,0.000017077082,0.000075989185,0.12347069,0.00007860223,0.8682085,0.0037815385,0.00019795867],"about_ca_topic_score_codex":0.0000010425223,"about_ca_topic_score_gemma":6.5693155e-7,"teacher_disagreement_score":0.82495844,"about_ca_system_score_codex":0.000010435434,"about_ca_system_score_gemma":0.000011930208,"threshold_uncertainty_score":0.18139303},"labels":[],"label_agreement":null},{"id":"W2245362805","doi":"10.48550/arxiv.1506.03318","title":"Noisy data clusters are hollow","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hydro-Québec","funders":"","keywords":"Cluster (spacecraft); Computer science; Data science","score_opus":0.21730359088491066,"score_gpt":0.2176799927275834,"score_spread":0.0003764018426727356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2245362805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04358295,0.00026059215,0.9482806,0.00087923504,0.0009665209,0.00020666992,0.0005231209,0.00040964948,0.0048906878],"genre_scores_gemma":[0.9921124,0.00019333685,0.0026373311,0.00029853146,0.00011206683,3.3993473e-7,0.00037642184,0.000009966619,0.004259623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708855,0.00016443442,0.00021632337,0.0019334616,0.00018459761,0.00041264918],"domain_scores_gemma":[0.9940516,0.000113422866,0.0003451048,0.004944046,0.00019441696,0.0003514391],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0005465158,0.0003257772,0.0004957529,0.000515231,0.00012940865,0.00024098658,0.0094668735,0.00031933334,0.000066812834],"category_scores_gemma":[0.000219532,0.0003120972,0.00018805798,0.002100209,0.00014273034,0.00078458944,0.018967012,0.0005852828,0.00044179335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013360013,0.0012906652,0.03609598,0.0002810532,0.002002229,0.008057694,0.0004222495,0.4961381,0.0000065401778,0.18538596,0.25007287,0.020113083],"study_design_scores_gemma":[0.0005818159,0.000054739387,0.0024447902,0.000048924598,0.0002652423,0.0000071366594,0.00014440942,0.92407745,0.000004216642,0.044635937,0.026894784,0.00084053783],"about_ca_topic_score_codex":0.000403756,"about_ca_topic_score_gemma":0.00013271562,"teacher_disagreement_score":0.9485294,"about_ca_system_score_codex":0.0001453048,"about_ca_system_score_gemma":0.0001733853,"threshold_uncertainty_score":0.9999331},"labels":[],"label_agreement":null},{"id":"W2266138411","doi":"10.1038/ncomms10138","title":"Quantum algorithms for topological and geometric analysis of data","year":2016,"lang":"en","type":"article","venue":"Nature Communications","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":251,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; Army Research Office; Multidisciplinary University Research Initiative; Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Topological data analysis; Persistent homology; Betti number; Computer science; Algorithm; Eigenvalues and eigenvectors; Homology (biology); Topology (electrical circuits); Theoretical computer science; Mathematics; Discrete mathematics; Combinatorics; Biology; Physics","score_opus":0.11068373974530843,"score_gpt":0.376496454858394,"score_spread":0.2658127151130856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2266138411","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003011759,0.00786296,0.9705747,0.017234297,0.000054172233,0.00012464647,0.00088883645,0.00006215769,0.0001865046],"genre_scores_gemma":[0.8404094,0.0015952891,0.15756361,0.00017349556,0.000010737919,0.00001162676,0.00017785685,0.000001894783,0.000056060857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99894375,0.00009035769,0.00026565656,0.00037689204,0.00016652608,0.00015680508],"domain_scores_gemma":[0.9926689,0.002609752,0.00014160243,0.004333737,0.0001745254,0.000071428134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006290437,0.00008570046,0.0002959697,0.00096670544,0.00015054259,0.000038191134,0.0053651016,0.0001665098,0.000021689399],"category_scores_gemma":[0.0014732794,0.00004852261,0.00010365482,0.006408048,0.00022671939,0.00040022086,0.0028969173,0.0001579687,0.0000027649194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004103856,0.00021957772,0.011417689,0.0000033348558,0.00078409957,4.286932e-7,0.000021236701,0.000001965542,0.000108366345,0.7446575,0.0024799884,0.24030167],"study_design_scores_gemma":[0.0010043874,0.00031855973,0.41880876,0.00001583037,0.0023353396,0.0000070170922,0.00007113581,0.22204879,0.0001762359,0.03794437,0.31666976,0.0005998212],"about_ca_topic_score_codex":0.000031598654,"about_ca_topic_score_gemma":0.00008219942,"teacher_disagreement_score":0.8373977,"about_ca_system_score_codex":0.0000125246515,"about_ca_system_score_gemma":0.000018465882,"threshold_uncertainty_score":0.9969783},"labels":[],"label_agreement":null},{"id":"W2275256273","doi":"10.4236/apm.2016.63010","title":"A Global Reduction Based Algorithm for Computing Homology of Chain Complexes","year":2016,"lang":"en","type":"article","venue":"Advances in Pure Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bishop's University","funders":"","keywords":"Mathematics; Homology (biology); Reduction (mathematics); Algorithm; Chain (unit)","score_opus":0.014417191876447034,"score_gpt":0.291960629754154,"score_spread":0.27754343787770697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2275256273","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022596887,0.00050659187,0.99614185,0.0005659146,0.00015373928,0.00012913672,0.0000481594,0.000040313218,0.00015458373],"genre_scores_gemma":[0.17260972,0.000038743143,0.8272446,0.00003614332,0.000032068387,0.000010059182,0.000004024607,0.0000026051302,0.000022048844],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999041,0.00003384919,0.00033886541,0.00023390548,0.00014270743,0.00020964131],"domain_scores_gemma":[0.9989686,0.0004222983,0.00020762793,0.00029938325,0.00007097159,0.000031089712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033414862,0.00009502753,0.0002795579,0.00013009005,0.00003740159,0.000012442062,0.00052399107,0.00004805514,0.000008303329],"category_scores_gemma":[0.00018805826,0.000059872295,0.000071202056,0.0008660691,0.00011292797,0.00022599797,0.00011704408,0.000026657533,0.0000026469274],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017448264,0.00016588002,0.00027729524,0.00005369566,0.000008984316,0.0000017429377,0.000046452737,0.00022349802,0.00007790044,0.16787417,0.0000612869,0.83120733],"study_design_scores_gemma":[0.0007857484,0.0002449301,0.00023931413,0.00011444891,0.000018041566,0.000019128353,0.00007910521,0.45172918,0.001023815,0.54291236,0.0026270053,0.00020694184],"about_ca_topic_score_codex":0.0000028579266,"about_ca_topic_score_gemma":0.0000076076694,"teacher_disagreement_score":0.8310004,"about_ca_system_score_codex":0.000036228925,"about_ca_system_score_gemma":0.000016283342,"threshold_uncertainty_score":0.24415214},"labels":[],"label_agreement":null},{"id":"W2290048588","doi":"10.70930/tac/uyw2jj5b","title":"Classification of Constructible Cosheaves","year":2020,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation","keywords":"Mathematics; Functor; Morphism; Equivalence (formal languages); Stratification (seeds); Simplicial set; Homotopy category; Model category; Pure mathematics; Homotopy; Path (computing); Combinatorics; Computer science","score_opus":0.018432640276448718,"score_gpt":0.24943372445329517,"score_spread":0.23100108417684645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290048588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026641287,0.0004377697,0.9688755,0.0010457269,0.0000066736766,0.000082538725,0.000019395298,0.000033369855,0.0028577058],"genre_scores_gemma":[0.99580336,0.00006824608,0.004000841,0.000057336045,0.000013822939,0.00001484437,0.0000073502156,0.0000010634072,0.00003314896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954396,0.000038367914,0.00016203307,0.00013531072,0.00006973093,0.000050603277],"domain_scores_gemma":[0.99937624,0.00019492635,0.00010639012,0.00021500885,0.00006584716,0.000041584768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017060881,0.000043651235,0.00012380882,0.00005453783,0.000048511603,0.000013570269,0.00030949467,0.000022787612,0.00002339518],"category_scores_gemma":[0.0000645757,0.000034341527,0.000023948467,0.0007589646,0.00031343024,0.00013490919,0.00008510308,0.00003087298,0.000004475035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060616253,0.000015314463,0.00056143565,0.000015018687,0.000010769687,3.1290767e-8,0.00014295921,0.00000341904,0.0018465975,0.95863324,0.000026883521,0.038738243],"study_design_scores_gemma":[0.00012650587,0.00007674808,0.0065524457,0.0000021064686,0.000031281787,0.0000021423975,0.0009259868,0.00059501716,0.025516264,0.95763177,0.008447741,0.00009201969],"about_ca_topic_score_codex":0.0000046065206,"about_ca_topic_score_gemma":2.014682e-7,"teacher_disagreement_score":0.96916205,"about_ca_system_score_codex":0.0000012694865,"about_ca_system_score_gemma":0.000014622725,"threshold_uncertainty_score":0.14004068},"labels":[],"label_agreement":null},{"id":"W2297068249","doi":"10.4007/annals.2016.184.3.3","title":"On the phase transition in random simplicial complexes","year":2016,"lang":"en","type":"preprint","venue":"Annals of Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Azrieli Foundation","keywords":"Giant component; Combinatorics; Betti number; Mathematics; Random graph; Vertex (graph theory); Phase transition; Order (exchange); Connected component; Graph; Simplicial complex; Discrete mathematics; Physics; Quantum mechanics","score_opus":0.11931165855991696,"score_gpt":0.36080761683950185,"score_spread":0.2414959582795849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2297068249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11591404,0.000114346825,0.8540141,0.027507784,0.00009706504,0.00034409715,0.0002245883,0.00004354426,0.0017404443],"genre_scores_gemma":[0.9947668,0.00014860094,0.0036211936,0.0013069676,0.000060468217,0.00002856581,0.000020053438,0.000006530304,0.00004083408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985736,0.00010717947,0.00050519395,0.00026748955,0.0003544704,0.00019204085],"domain_scores_gemma":[0.9973633,0.001404936,0.00030493023,0.0007959234,0.00009067227,0.000040201317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009169232,0.00016828123,0.0004989076,0.00025867263,0.000041017054,0.000059985967,0.00125297,0.000117317606,0.00009486593],"category_scores_gemma":[0.0004294586,0.0000855382,0.00023924523,0.00040320176,0.00008639212,0.000069674046,0.0003678142,0.00020190117,0.000033286968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050214923,0.0018896104,0.0000023728398,0.00019587792,0.00015142407,0.000014186763,0.0023507215,0.0004661349,0.00018238898,0.9659042,0.0066247927,0.022168104],"study_design_scores_gemma":[0.00068758987,0.000116806346,0.000031204705,0.00022530528,0.000018900828,0.0000012467378,0.000041990326,0.014737386,0.0017651306,0.98173964,0.0004776254,0.00015716814],"about_ca_topic_score_codex":0.00002384892,"about_ca_topic_score_gemma":0.000004861146,"teacher_disagreement_score":0.8788527,"about_ca_system_score_codex":0.000006248311,"about_ca_system_score_gemma":0.000030611693,"threshold_uncertainty_score":0.34881467},"labels":[],"label_agreement":null},{"id":"W2310825823","doi":"10.1002/jgt.22569","title":"Topologically 4‐chromatic graphs and signatures of odd cycles","year":2020,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chromatic scale; Signature (topology); Abelian group; Mathematics; Graph; Combinatorics; Discrete mathematics; Geometry","score_opus":0.01986311258326498,"score_gpt":0.25781602621498373,"score_spread":0.23795291363171875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2310825823","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5514604,0.031126946,0.40920213,0.0053638793,0.0010462635,0.00024372396,0.000071912225,0.0001011001,0.0013836868],"genre_scores_gemma":[0.9751435,0.0014507673,0.022941254,0.00038421302,0.00005335135,0.0000013391635,0.0000024748447,0.0000054699676,0.000017657143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769306,0.0004339182,0.00084257696,0.00033588093,0.0005009722,0.00019356403],"domain_scores_gemma":[0.99707514,0.0007813314,0.0012816531,0.00045894776,0.00020453893,0.000198406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013531656,0.00024190373,0.0008931535,0.00083936134,0.00006336862,0.00011299625,0.0020050604,0.00026494588,0.000067826964],"category_scores_gemma":[0.00073759904,0.00015125138,0.0005962745,0.00092815905,0.00038409056,0.00018156777,0.0013496638,0.000854103,0.000001672446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090528236,0.00022580882,0.0009901742,0.00024199189,0.0008219202,0.00024769508,0.0004600076,0.00028333304,0.000989894,0.9594457,0.0009725045,0.035230424],"study_design_scores_gemma":[0.0001822117,0.00035233755,0.014656864,0.00008667668,0.00017553406,0.000046324854,0.00008411031,0.00017506367,0.00026096345,0.98371685,0.00009379253,0.00016926276],"about_ca_topic_score_codex":0.000007946277,"about_ca_topic_score_gemma":0.0000010253883,"teacher_disagreement_score":0.4236831,"about_ca_system_score_codex":0.000010069732,"about_ca_system_score_gemma":0.0000644409,"threshold_uncertainty_score":0.6167852},"labels":[],"label_agreement":null},{"id":"W2322941797","doi":"10.4064/bc84-0-12","title":"Topological bar-codes of fractals: a new characterization of symmetric binary fractal trees","year":2009,"lang":"en","type":"article","venue":"Banach Center Publications","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada; St. Francis Xavier University","keywords":"Fractal; Fractal dimension; Topology (electrical circuits); Binary number; Binary tree; Mathematics; Fractal dimension on networks; Characterization (materials science); Bar (unit); Fractal landscape; Fractal analysis; Computer science; Dimension (graph theory); Discrete mathematics; Algorithm; Combinatorics; Mathematical analysis; Physics; Arithmetic","score_opus":0.02241848451477553,"score_gpt":0.2632273910680202,"score_spread":0.24080890655324466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2322941797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48315197,0.0002736648,0.48625708,0.023619533,0.00013486136,0.0002839862,0.00022445903,0.00022529883,0.0058291457],"genre_scores_gemma":[0.99186647,0.00009914189,0.0067579253,0.00034448088,0.000046879148,0.0000065496283,0.00030944974,0.0000030347499,0.0005660535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9984783,0.000081932165,0.00052378734,0.00037682508,0.00029724702,0.00024191942],"domain_scores_gemma":[0.9984563,0.00013208928,0.00033794032,0.0006977457,0.00021430395,0.00016160925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022332462,0.00013628369,0.00031947874,0.00097259664,0.00007712654,0.000081522856,0.0011429088,0.00010225467,0.0003765367],"category_scores_gemma":[0.0004413206,0.00010697831,0.00016729967,0.0043469034,0.000071874856,0.000934739,0.00017989015,0.00011114281,0.000022386394],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016798893,0.0032217442,0.045502186,0.0000125342885,0.0001277995,0.0000032351518,0.00022571502,0.000015244968,0.018936004,0.660275,0.0048159747,0.26684776],"study_design_scores_gemma":[0.00028314596,0.00027279192,0.97731996,0.000008635104,0.00002618648,0.0000064328483,0.000016957587,0.0029544954,0.0011354698,0.0047327112,0.013089897,0.00015329673],"about_ca_topic_score_codex":0.00008889527,"about_ca_topic_score_gemma":0.0000056275608,"teacher_disagreement_score":0.93181777,"about_ca_system_score_codex":0.000024563971,"about_ca_system_score_gemma":0.000068806636,"threshold_uncertainty_score":0.4362449},"labels":[],"label_agreement":null},{"id":"W2330539116","doi":"10.46298/dmtcs.2830","title":"The Hodge Structure of the Coloring Complex of a Hypergraph (Extended Abstract)","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Hypergraph; Graph","score_opus":0.012580934970896985,"score_gpt":0.2546729614437122,"score_spread":0.24209202647281522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2330539116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4439307,0.000022890086,0.55143744,0.001575993,0.00063762936,0.00028085473,0.00003528396,0.000056262736,0.0020229649],"genre_scores_gemma":[0.88044417,0.0000035831436,0.11943666,0.000069919144,0.000032414344,0.0000021712408,7.290673e-7,0.0000046057253,0.000005757802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737424,0.000059758047,0.000593428,0.0004447061,0.0010713255,0.0004565734],"domain_scores_gemma":[0.9963791,0.00103485,0.0003680636,0.0017799224,0.0002909777,0.00014712394],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012745894,0.00019663524,0.000352132,0.00014963276,0.00059751567,0.0002769921,0.0061715627,0.00007001877,0.00006953267],"category_scores_gemma":[0.0006008422,0.0000898537,0.00022082358,0.0027327023,0.006197892,0.00025582116,0.0020362472,0.0003775554,0.0000041054077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022721024,0.000054374686,0.00006556962,0.000015670885,0.000015116032,9.617372e-7,0.00028578955,0.000025109652,0.02349966,0.97207355,0.000019516154,0.003942413],"study_design_scores_gemma":[0.00015525108,0.00009884716,0.01247445,0.00002642237,0.00002961894,0.00003018899,0.00006308729,0.20493849,0.022078622,0.7597749,0.00012997702,0.00020015435],"about_ca_topic_score_codex":0.0000068130876,"about_ca_topic_score_gemma":0.000008300305,"teacher_disagreement_score":0.43651345,"about_ca_system_score_codex":0.000008893292,"about_ca_system_score_gemma":0.0000781637,"threshold_uncertainty_score":0.9992055},"labels":[],"label_agreement":null},{"id":"W2346641114","doi":"10.1007/s11786-016-0273-1","title":"Topological Sorting of Finitely Near Sets","year":2016,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Disjoint sets; Mathematics; Topological space; Sorting; Combinatorics; Closed set; Space (punctuation); Topology (electrical circuits); Set (abstract data type); Discrete mathematics; Algorithm; Computer science","score_opus":0.04279358418637936,"score_gpt":0.2918718828044226,"score_spread":0.24907829861804326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2346641114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1643699,0.000019618701,0.8341916,0.0007233708,0.0001368097,0.00005298752,0.0000017507722,0.000050897168,0.0004530235],"genre_scores_gemma":[0.5523326,0.0000059240347,0.44756362,0.000072657356,0.000010030416,0.0000018726423,8.082875e-8,0.0000013283712,0.000011890059],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807936,0.000035505705,0.0004902312,0.0004659621,0.0005454469,0.00038346899],"domain_scores_gemma":[0.99817127,0.00068561983,0.0001972336,0.0007451674,0.0001038008,0.0000969206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014899942,0.00011516739,0.00027735706,0.0003333757,0.0001106912,0.000099722085,0.0024616867,0.000046089113,0.00003907209],"category_scores_gemma":[0.0005922892,0.00006375189,0.00006669404,0.0028321154,0.00068999233,0.0005279571,0.0013366545,0.00007453813,0.00005466699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017475652,0.00044358903,0.0062481943,0.000032297048,0.000009611075,0.000042692514,0.0010080372,0.00042945676,0.001037908,0.3932062,0.00009570145,0.59744453],"study_design_scores_gemma":[0.0003594925,0.00023240701,0.0111347465,0.00011732744,0.00000479004,0.000034042612,0.00001603842,0.64557743,0.0035234983,0.3385346,0.00015380554,0.00031181946],"about_ca_topic_score_codex":0.000009110984,"about_ca_topic_score_gemma":0.0000023845225,"teacher_disagreement_score":0.645148,"about_ca_system_score_codex":0.000035499434,"about_ca_system_score_gemma":0.00007053022,"threshold_uncertainty_score":0.45744672},"labels":[],"label_agreement":null},{"id":"W2394571210","doi":"","title":"On The Algebraic Study of Spanning Simplicial Complexes of r-cyclic Graphs G n, r .","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Algebraic number; Simplicial complex; Pure mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.018313887383707515,"score_gpt":0.24943826611326936,"score_spread":0.23112437872956185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394571210","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99732304,0.00001909104,0.0011454526,0.0002816842,0.00029072046,0.00013091609,0.0000023943321,0.00003403803,0.0007726473],"genre_scores_gemma":[0.9997203,0.0000018366089,0.000107692285,0.00014114054,0.000003862578,0.000006356367,0.0000015959728,0.0000036548015,0.000013585058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858946,0.00021969012,0.00032733148,0.0002752662,0.00040068573,0.00018754575],"domain_scores_gemma":[0.99782157,0.0010306472,0.00021890957,0.00079853757,0.00008129353,0.000049062637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054719776,0.00011752968,0.0003194132,0.00021680066,0.00012258047,0.000032245876,0.0013512616,0.0000367109,0.000026375532],"category_scores_gemma":[0.00040669445,0.00007293009,0.000099853125,0.001722552,0.000097578595,0.00009572499,0.00036144507,0.00011899513,0.000013369883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004803992,0.00051520497,0.008184828,0.0000028974132,0.000048463506,8.1115707e-7,0.0002742113,0.00003370229,0.00019084009,0.987924,0.00049432146,0.0023259236],"study_design_scores_gemma":[0.0004997463,0.0010987835,0.0836049,0.000007661094,0.00002574269,5.133626e-7,0.00014187858,0.0011147717,0.0007458112,0.91249835,0.00015564443,0.000106210944],"about_ca_topic_score_codex":0.0002241941,"about_ca_topic_score_gemma":0.000011448885,"teacher_disagreement_score":0.075425655,"about_ca_system_score_codex":0.000006788845,"about_ca_system_score_gemma":0.000008414678,"threshold_uncertainty_score":0.29740027},"labels":[],"label_agreement":null},{"id":"W2398153856","doi":"","title":"Enumeration of boundary cubic inner-forest maps.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enumeration; Mathematics; Boundary (topology); Geometry; Combinatorics; Mathematical analysis","score_opus":0.009317883875871435,"score_gpt":0.21842341902447118,"score_spread":0.20910553514859975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398153856","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98268056,0.00036862353,0.010155222,0.0015717783,0.0012176837,0.00017135359,0.000006770955,0.00011885494,0.0037091572],"genre_scores_gemma":[0.9973289,0.000019829278,0.0021298972,0.00014566656,0.00000646557,0.000013842148,0.000020948597,0.0000032162832,0.0003312602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990079,0.00005225293,0.00024831135,0.00024444427,0.00025543803,0.00019168307],"domain_scores_gemma":[0.9990726,0.00009147236,0.00010867763,0.00051320886,0.00013418528,0.00007982634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017052752,0.000095292104,0.00018294636,0.00018267536,0.00008904104,0.0001370948,0.000725441,0.00006045118,0.0001557775],"category_scores_gemma":[0.0001109026,0.00007604747,0.000069729744,0.00124596,0.00007151979,0.00066300144,0.0002594,0.00009203194,0.00036484428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.7765994e-7,0.00011520343,0.008840778,0.0000058442565,0.00002420112,0.0000027634615,0.00005844202,0.000013811861,0.00026391953,0.9644325,0.010016832,0.016224843],"study_design_scores_gemma":[0.00030126216,0.0001431074,0.049784143,0.0000055289033,0.000010729266,0.0000027927,0.000013569873,0.0029635725,0.0011283353,0.9368947,0.008601009,0.00015125528],"about_ca_topic_score_codex":0.00039069244,"about_ca_topic_score_gemma":0.0000072890307,"teacher_disagreement_score":0.040943366,"about_ca_system_score_codex":0.000019336581,"about_ca_system_score_gemma":0.00003183133,"threshold_uncertainty_score":0.46894568},"labels":[],"label_agreement":null},{"id":"W2401287820","doi":"","title":"Height Probabilities in the Abelian Sandpile Model on the Generalized Trees.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Abelian sandpile model; Mathematics; Abelian group; Pure mathematics; Statistics; Statistical physics; Physics","score_opus":0.022162309184406755,"score_gpt":0.2299046754076468,"score_spread":0.20774236622324005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401287820","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9417277,0.00019997657,0.0067558307,0.031246131,0.0006763265,0.00043084324,0.000009573868,0.00014161204,0.018812],"genre_scores_gemma":[0.99655235,0.000019580315,0.0006411196,0.002300065,0.000009666137,0.00005367221,0.0000041436847,0.000003602813,0.0004157862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985149,0.0003259012,0.00020964835,0.00032192114,0.00035412412,0.00027350098],"domain_scores_gemma":[0.9982751,0.00058280013,0.000059767866,0.0010036224,0.000035073874,0.000043654094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001037769,0.00013284416,0.00018304762,0.00011142012,0.00018648352,0.00017287032,0.0018234238,0.000053453594,0.000035686982],"category_scores_gemma":[0.00025502956,0.00006028529,0.00009227621,0.0011693371,0.00009439453,0.00015771168,0.00019281484,0.00018314693,0.000066248685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028428415,0.00010839689,0.00030677987,0.0000012943054,0.000007353194,0.0000012473623,0.00031649374,0.0005231737,0.0000061599335,0.9900858,0.0061479486,0.002492557],"study_design_scores_gemma":[0.00031198445,0.00009750373,0.0018071643,0.000004063096,0.000005687725,8.5426296e-7,0.000030960182,0.1070656,0.00006051666,0.883341,0.0071699363,0.00010468929],"about_ca_topic_score_codex":0.00011220624,"about_ca_topic_score_gemma":0.000039990813,"teacher_disagreement_score":0.106744714,"about_ca_system_score_codex":0.00002420746,"about_ca_system_score_gemma":0.000019597263,"threshold_uncertainty_score":0.33884054},"labels":[],"label_agreement":null},{"id":"W2405008717","doi":"","title":"Minimal Covers of Maximal Cliques for Interval Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Interval (graph theory); Combinatorics; Independence (probability theory); Discrete mathematics; Independence number; Order (exchange); Upper and lower bounds; Interval graph; Pathwidth; Graph; Statistics","score_opus":0.01653703275778776,"score_gpt":0.2634478112292585,"score_spread":0.24691077847147072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405008717","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9570144,0.00028030656,0.036399804,0.0023634539,0.0010652374,0.00023057153,0.00003917379,0.00016700616,0.0024400386],"genre_scores_gemma":[0.9906841,0.000017762399,0.008880099,0.00031075277,0.0000044238327,0.0000047690532,0.000009298958,0.000002401276,0.00008641211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998995,0.0000335567,0.00026369226,0.00028555188,0.00019236373,0.00022985382],"domain_scores_gemma":[0.9991791,0.00015217735,0.0001166105,0.00036725396,0.00010660135,0.00007822629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002550966,0.00010808329,0.00026000178,0.00019646627,0.000052199335,0.00004861694,0.0008561219,0.00006288545,0.00001684201],"category_scores_gemma":[0.00015370197,0.00008936925,0.00019962997,0.00083313626,0.000057320864,0.00029485853,0.00012266479,0.00006809349,0.000008080561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024242407,0.00017136431,0.0010083972,0.0000038125656,0.000027007423,0.0000037534649,0.000048317608,0.0000019037789,0.00017721874,0.9785548,0.0033682862,0.016610894],"study_design_scores_gemma":[0.0006442748,0.0012804138,0.015706327,0.000007635592,0.000023082106,0.0000026500218,0.000016950278,0.0011188401,0.003211296,0.974002,0.0038314713,0.00015507145],"about_ca_topic_score_codex":0.000021247093,"about_ca_topic_score_gemma":9.720131e-7,"teacher_disagreement_score":0.033669673,"about_ca_system_score_codex":0.000015846057,"about_ca_system_score_gemma":0.000020826517,"threshold_uncertainty_score":0.36443722},"labels":[],"label_agreement":null},{"id":"W2406603664","doi":"","title":"On the Laplacian spectral characterization of the generalized T-shape trees.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Characterization (materials science); Laplace operator; Pure mathematics; Combinatorics; Mathematical analysis; Materials science; Nanotechnology","score_opus":0.011737116681990033,"score_gpt":0.2074694668757511,"score_spread":0.19573235019376106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406603664","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99140203,0.000009518293,0.0003827301,0.0063895076,0.00061353063,0.00015183445,0.0000049962086,0.000033054017,0.001012776],"genre_scores_gemma":[0.9985838,0.000008890812,0.000084386105,0.0007957061,0.0000075086177,0.0000147454375,0.0000059124436,0.0000030101667,0.00049601716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990771,0.00012232325,0.000177158,0.00019228915,0.00026310407,0.00016807082],"domain_scores_gemma":[0.99899226,0.00012786846,0.00012544075,0.00065639534,0.000057998222,0.000040049566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016292393,0.00009197462,0.00013623154,0.000063267245,0.00013060446,0.00009385342,0.001202098,0.000041407307,0.00040736885],"category_scores_gemma":[0.00011532906,0.000043471056,0.0001014329,0.0011565223,0.00006652085,0.0001996714,0.00021253306,0.000102210004,0.00013075712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012674675,0.000064286294,0.0010662058,8.050292e-7,0.000017030665,4.136477e-7,0.00004953182,0.000002325448,0.0037357912,0.99070716,0.001069324,0.0032858371],"study_design_scores_gemma":[0.0003839723,0.00011149464,0.33518302,0.000008236032,0.00001591733,0.0000014200516,0.000009506227,0.011552661,0.007863371,0.64295304,0.0017660494,0.0001513328],"about_ca_topic_score_codex":0.000081764636,"about_ca_topic_score_gemma":0.0000032900336,"teacher_disagreement_score":0.34775415,"about_ca_system_score_codex":0.000016028567,"about_ca_system_score_gemma":0.000014792826,"threshold_uncertainty_score":0.44604033},"labels":[],"label_agreement":null},{"id":"W2408256222","doi":"","title":"A note on fragments in a locally k-critical n-connected graph.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph","score_opus":0.011176491418987328,"score_gpt":0.26357124492893474,"score_spread":0.25239475350994744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408256222","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92840946,0.000267682,0.037192855,0.021673342,0.002043666,0.00033117173,0.000011475306,0.00049199094,0.009578333],"genre_scores_gemma":[0.9955154,0.000012622565,0.0025827782,0.0018327746,0.0000048689985,0.0000056428044,0.000004827945,0.0000029544083,0.000038112656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839604,0.00009540563,0.0002654237,0.0004811922,0.0003704266,0.00039152647],"domain_scores_gemma":[0.9986445,0.0003284305,0.00003880334,0.00077758165,0.000059646965,0.0001510372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025546202,0.00015117359,0.00024958426,0.00043115029,0.00007432547,0.000106493564,0.0012720822,0.00010002715,0.00003842794],"category_scores_gemma":[0.0008756578,0.00012584825,0.0000889191,0.0026962187,0.000048821286,0.00027218877,0.00019247012,0.00023830007,0.00017310647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012243406,0.0005042458,0.0006107063,0.0000014554663,0.00000660869,0.00012726961,0.000048275604,0.00001730792,0.00004810413,0.98035324,0.00077556144,0.017495004],"study_design_scores_gemma":[0.0007378386,0.0005564362,0.037399337,0.00001888413,0.000006063999,0.0000036505744,0.0000046191844,0.0029375048,0.0002099945,0.95730585,0.0006290519,0.0001907541],"about_ca_topic_score_codex":0.00004354742,"about_ca_topic_score_gemma":0.000005889394,"teacher_disagreement_score":0.067105934,"about_ca_system_score_codex":0.00004617576,"about_ca_system_score_gemma":0.000024904073,"threshold_uncertainty_score":0.51319426},"labels":[],"label_agreement":null},{"id":"W2408772186","doi":"10.1515/sagmb-2015-0057","title":"Using persistent homology and dynamical distances to analyze protein binding","year":2016,"lang":"en","type":"article","venue":"Statistical Applications in Genetics and Molecular Biology","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; University of Alberta; Compute Canada","keywords":"Persistent homology; Persistence (discontinuity); Topological data analysis; Persistence length; Homology (biology); Barcode; Protein structure; Allosteric regulation","score_opus":0.01578656115812315,"score_gpt":0.3068789397904513,"score_spread":0.2910923786323281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408772186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22707191,0.00038258225,0.77151966,0.0007366574,0.000007846951,0.00015272897,0.00008884203,0.000008156857,0.00003162842],"genre_scores_gemma":[0.7643294,0.000058418085,0.23547122,0.000062100415,0.0000051958477,0.00004997125,0.000011243566,0.0000024198328,0.000010060267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990204,0.0000663291,0.00018111475,0.00045709088,0.000054416665,0.00022066542],"domain_scores_gemma":[0.9994596,0.00012839366,0.00003148737,0.00022496811,0.000028529903,0.00012698538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000108684064,0.00009233097,0.00016213825,0.00017272265,0.00006704604,0.00002736817,0.00023089316,0.000066131484,0.000007403759],"category_scores_gemma":[0.000079194724,0.000060578055,0.00002107251,0.00045056536,0.00024798824,0.000015858346,0.00030463657,0.00004534872,0.0000034015095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029116272,0.00004067667,0.0032792054,0.00000462487,0.000020075964,0.000005916003,0.000013583719,0.0000098868,0.050199337,0.87052184,0.0000033907822,0.07589855],"study_design_scores_gemma":[0.0013252823,0.0014662409,0.035498522,0.000047139198,0.00016050729,0.00006707983,0.00014491516,0.047915187,0.0054719364,0.8836037,0.02294382,0.001355686],"about_ca_topic_score_codex":0.000026117614,"about_ca_topic_score_gemma":0.000017117178,"teacher_disagreement_score":0.53725743,"about_ca_system_score_codex":0.000022877311,"about_ca_system_score_gemma":0.000013814174,"threshold_uncertainty_score":0.24703014},"labels":[],"label_agreement":null},{"id":"W2425086070","doi":"10.17863/cam.4533","title":"The Mondrian Kernel","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Division of Materials Research; Natural Sciences and Engineering Research Council of Canada; European Commission; Engineering and Physical Sciences Research Council; University of Oxford; Microsoft Research","keywords":"Mondrian; Kernel (algebra); Mathematics; Computer science; Discrete mathematics","score_opus":0.059669664491048144,"score_gpt":0.17947381537743942,"score_spread":0.11980415088639128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2425086070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014908488,0.00022268925,0.9702605,0.0019154066,0.0007592331,0.00013087697,0.00003868832,0.00023781668,0.011526299],"genre_scores_gemma":[0.98238075,0.0005836192,0.00032086557,0.00011918041,0.000095178264,6.690484e-7,0.00000643141,0.000005908875,0.016487416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982529,0.0001358418,0.00016753789,0.0009467983,0.00010852568,0.00038836518],"domain_scores_gemma":[0.9972848,0.00032627047,0.00019999553,0.001911983,0.000106745225,0.00017016308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029252958,0.00022648572,0.00024510355,0.00020696968,0.00034554026,0.00023776352,0.00428089,0.00020599864,0.000057908434],"category_scores_gemma":[0.00011098462,0.0001381102,0.00028863634,0.0010579877,0.00019730341,0.00025040758,0.004250502,0.00035214846,0.0005022978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000868869,0.00003989525,0.0012486621,0.0000057812313,0.00014431663,0.00018638436,0.000023826206,0.0022047115,0.0000041763205,0.98263216,0.0031378395,0.010363581],"study_design_scores_gemma":[0.00035544977,0.00004906197,0.0037613458,0.000030637377,0.00010091887,0.0000040721784,0.00003834732,0.09380062,0.00004339561,0.8378234,0.06341086,0.00058192044],"about_ca_topic_score_codex":0.00009945836,"about_ca_topic_score_gemma":0.000034240493,"teacher_disagreement_score":0.96993965,"about_ca_system_score_codex":0.000091763104,"about_ca_system_score_gemma":0.00007895249,"threshold_uncertainty_score":0.79550296},"labels":[],"label_agreement":null},{"id":"W2433753645","doi":"10.1016/j.ejc.2017.06.007","title":"Reconstruction of infinite matroids from their 3-connected minors","year":2017,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Tree (set theory); Graphic matroid; Planar; Face (sociological concept); Mathematics; Combinatorics; Matroid partitioning; Decomposition; Rest (music); Discrete mathematics; Computer science; Pure mathematics; Physics; Sociology","score_opus":0.029240262023690462,"score_gpt":0.23501746112417174,"score_spread":0.20577719910048128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2433753645","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7414955,0.0032131313,0.23654771,0.0007442001,0.008043112,0.00011118543,0.00013808839,0.000068057896,0.00963905],"genre_scores_gemma":[0.9908524,0.0008806023,0.007836204,0.000030422245,0.00024145374,2.9402042e-7,0.000014961878,0.000015421123,0.00012819601],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971438,0.0006885647,0.0011275954,0.00034399968,0.0004871556,0.00020890232],"domain_scores_gemma":[0.9940646,0.00026258468,0.0034372252,0.0013222261,0.00073321257,0.00018011934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014274862,0.00028025973,0.000805281,0.0006620996,0.00011719349,0.00030414932,0.0040219533,0.00011125953,0.000045950048],"category_scores_gemma":[0.0008213896,0.00020932134,0.0004880902,0.00051085814,0.00014118405,0.00037981002,0.0017959636,0.0009622853,0.00002278968],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012938741,0.00094424357,0.022564158,0.00017260104,0.0024514594,0.0010481572,0.0015750235,0.000852086,0.0005996078,0.057839364,0.0067399717,0.90508395],"study_design_scores_gemma":[0.0042519877,0.0021200527,0.2089052,0.0016972297,0.00083845976,0.0005486853,0.00027331625,0.0048704054,0.0039712787,0.73321974,0.037407458,0.0018962137],"about_ca_topic_score_codex":0.000029380175,"about_ca_topic_score_gemma":8.2687137e-7,"teacher_disagreement_score":0.90318775,"about_ca_system_score_codex":0.000053167332,"about_ca_system_score_gemma":0.00012961356,"threshold_uncertainty_score":0.8535876},"labels":[],"label_agreement":null},{"id":"W2479732621","doi":"10.1090/cbms/096/05","title":"Tranformations of submanifolds","year":2002,"lang":"en","type":"book-chapter","venue":"Regional conference series in mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Philosophy; Materials science; Geology","score_opus":0.06904873133397145,"score_gpt":0.24569845845650592,"score_spread":0.17664972712253446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2479732621","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000037099566,0.0002923164,0.11397801,0.0013283144,0.00008008478,0.00019790832,0.00007582461,0.000074436786,0.883936],"genre_scores_gemma":[0.031294458,0.0052053053,0.112123884,0.00018177766,0.00008029829,0.00002496897,0.0001445287,0.000034570716,0.8509102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983622,0.000011622874,0.00068684213,0.00025412167,0.0004969887,0.00018826539],"domain_scores_gemma":[0.9984939,0.00017287326,0.00040394114,0.0006792759,0.00018674717,0.00006325991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017972612,0.00024583586,0.0005693264,0.00046530704,0.00004374557,0.00006133047,0.0011986281,0.00023826308,0.00088403],"category_scores_gemma":[0.000056583896,0.00020481656,0.00017893262,0.0002622737,0.00023042834,0.00042041353,0.0002189939,0.0002456138,0.000113173366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010602613,0.000039021834,0.000001625846,0.000102573526,0.000031075928,0.000008985052,0.00038386713,0.000007955734,0.0000012609056,0.9960232,0.0006788308,0.0027205767],"study_design_scores_gemma":[0.00011002149,0.00008832749,0.000033190383,0.0002456961,0.00003343233,0.00004746182,0.0000619001,0.0035378574,0.00001970222,0.9332914,0.0622154,0.0003156415],"about_ca_topic_score_codex":0.0000058922114,"about_ca_topic_score_gemma":0.000019640562,"teacher_disagreement_score":0.062731795,"about_ca_system_score_codex":0.00003213967,"about_ca_system_score_gemma":0.00006720252,"threshold_uncertainty_score":0.9679509},"labels":[],"label_agreement":null},{"id":"W2496759324","doi":"10.1007/s10485-017-9484-0","title":"Hedetniemi’s Conjecture and Adjoint Functors in Thin Categories","year":2017,"lang":"en","type":"article","venue":"Applied Categorical Structures","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Functor; Theory of computation; Conjecture; Adjoint functors; Mathematics; Functor category; Pure mathematics; Natural transformation; Algebra over a field; Algorithm","score_opus":0.014872896160963265,"score_gpt":0.24014549081076492,"score_spread":0.22527259464980165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2496759324","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62774444,0.0024934874,0.32539687,0.011331022,0.0013924554,0.00084109226,0.000027091077,0.0005907406,0.030182825],"genre_scores_gemma":[0.9981145,0.000057267778,0.0012858899,0.00030522663,0.000096767144,0.000017798797,0.000010257213,0.0000067516644,0.00010551922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828374,0.000030213501,0.0002827406,0.0006735111,0.00030791276,0.0004218648],"domain_scores_gemma":[0.9985321,0.00013040939,0.0001656885,0.0009603244,0.000024572293,0.00018686257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019254924,0.000253505,0.0004085894,0.00017621809,0.00045246308,0.00061884476,0.0014508945,0.00018910225,0.00008117719],"category_scores_gemma":[0.00017324343,0.00016830336,0.00006358763,0.00040552983,0.0002713095,0.00028286816,0.00067436247,0.00034576177,0.000018523886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008532995,0.000015415586,0.0034432828,0.0000064520596,0.000019351051,0.000026786713,0.00014384043,0.000027962926,0.00017021425,0.96475923,0.00045726507,0.030921653],"study_design_scores_gemma":[0.00037796563,0.000043340042,0.20045756,4.6894823e-7,0.000013773477,0.00001745753,0.00006537668,0.00020050234,0.0006648423,0.79144764,0.0064273556,0.0002837378],"about_ca_topic_score_codex":0.0009219858,"about_ca_topic_score_gemma":0.00020002152,"teacher_disagreement_score":0.3703701,"about_ca_system_score_codex":0.00004151484,"about_ca_system_score_gemma":0.000029452363,"threshold_uncertainty_score":0.6863212},"labels":[],"label_agreement":null},{"id":"W2500087697","doi":"10.1007/978-3-319-30379-6_22","title":"Persistent Homology for Analyzing Environmental Lake Monitoring Data","year":2016,"lang":"en","type":"book-chapter","venue":"","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nipissing University","funders":"","keywords":"Persistent homology; Betti number; Topological data analysis; Homology (biology); Point cloud; Simplicial complex; Computer science; Witness; Geography; Data mining; Cartography; Mathematics; Biology; Algorithm; Artificial intelligence; Combinatorics","score_opus":0.06425895362374323,"score_gpt":0.2601209333427333,"score_spread":0.19586197971899005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2500087697","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018665874,0.0029395453,0.8122101,0.0014928634,0.00088423805,0.00030005956,0.0022787317,0.00018009337,0.17969573],"genre_scores_gemma":[0.005308556,0.0009300632,0.032310158,0.00012510363,0.00063045154,0.000011532838,0.0006117383,0.000022647975,0.96004975],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981311,0.000010929861,0.000297202,0.0010048914,0.00023787457,0.00031802556],"domain_scores_gemma":[0.9976302,0.00023095208,0.0001587487,0.0018408968,0.00001536723,0.00012383606],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023920478,0.00025563175,0.00039253628,0.00030283356,0.00013530088,0.00008706992,0.0028466638,0.0002174587,0.0009716675],"category_scores_gemma":[0.000032017197,0.00017070533,0.00029950828,0.00005536787,0.00009921492,0.00031653038,0.0023761755,0.00013324026,0.00031549623],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010348212,0.000068983834,0.0006566251,0.00002375162,0.0012523637,0.00007054681,0.000026662989,0.0000067799974,0.00004241906,0.435572,0.010955834,0.5513137],"study_design_scores_gemma":[0.00025074888,0.00015816384,0.0001382154,0.000025914042,0.00023604845,0.000022103048,0.000007044377,0.00072875497,0.000012311498,0.012574686,0.9853567,0.0004893401],"about_ca_topic_score_codex":0.0000037263023,"about_ca_topic_score_gemma":0.000008723901,"teacher_disagreement_score":0.9744008,"about_ca_system_score_codex":0.00005272454,"about_ca_system_score_gemma":0.000018048475,"threshold_uncertainty_score":0.9999416},"labels":[],"label_agreement":null},{"id":"W2505042857","doi":"10.1090/cbms/117/07","title":"Finiteness properties of the dual cube complex","year":2012,"lang":"en","type":"book-chapter","venue":"Regional conference series in mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Dual (grammatical number); Cube (algebra); Computer science; Mathematics; Art; Geometry; Literature","score_opus":0.15389151880323843,"score_gpt":0.2566700165742939,"score_spread":0.10277849777105547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2505042857","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038697165,0.00702402,0.07369355,0.018440396,0.0013593007,0.0021967452,0.0004338351,0.00039095286,0.8925915],"genre_scores_gemma":[0.5205742,0.0021691364,0.034638215,0.00054546015,0.00026402512,0.000049167807,0.00007209829,0.00005984947,0.4416278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982648,0.000036468246,0.0005628814,0.00028047618,0.0006121079,0.00024326262],"domain_scores_gemma":[0.99820197,0.00014301411,0.00044672622,0.00092242984,0.00022929229,0.000056581346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002664017,0.0002813811,0.0005903573,0.00019081197,0.00008020059,0.00006652742,0.0015959651,0.0002059839,0.00030723374],"category_scores_gemma":[0.00011659073,0.00016411781,0.00018977217,0.00024720898,0.000644096,0.00027223676,0.0009471793,0.00029533272,0.00004369337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034064965,0.000048410107,0.000012913856,0.00015967387,0.0000393001,0.0000029871187,0.0004284066,0.000005988529,0.000045152312,0.99668276,0.0002784526,0.0022925527],"study_design_scores_gemma":[0.00017990252,0.000076706965,0.00044809168,0.0009367841,0.00008701518,0.00010177016,0.00020564657,0.0015617266,0.0003556267,0.88204145,0.11337861,0.0006266871],"about_ca_topic_score_codex":0.0000134999145,"about_ca_topic_score_gemma":0.000030883053,"teacher_disagreement_score":0.5167045,"about_ca_system_score_codex":0.00003177483,"about_ca_system_score_gemma":0.00014233835,"threshold_uncertainty_score":0.669253},"labels":[],"label_agreement":null},{"id":"W2525374422","doi":"10.5281/zenodo.57024","title":"ggally: v1.2.0","year":2016,"lang":"en","type":"article","venue":"INFM-OAR (INFN Catania)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science","score_opus":0.015223873332923412,"score_gpt":0.22750176557217322,"score_spread":0.2122778922392498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2525374422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11338161,0.000956475,0.8120691,0.034013804,0.0016012723,0.00037222193,0.0002425827,0.0014872624,0.03587568],"genre_scores_gemma":[0.98463506,0.00010062908,0.009253733,0.0014302578,0.0002019578,0.000015328062,0.000011351383,0.000010563355,0.0043411492],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981135,0.000058653794,0.0003182018,0.00058365084,0.00044710637,0.00047886124],"domain_scores_gemma":[0.99805427,0.00025349853,0.00011388472,0.0012413845,0.000103555154,0.00023338369],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00034979038,0.00018987662,0.00026079718,0.0002749665,0.00013518518,0.00016254363,0.0019144554,0.00010646778,0.00053211563],"category_scores_gemma":[0.0003622468,0.000113931026,0.00014235804,0.0014461399,0.00011788444,0.00078004785,0.0007021095,0.000084977386,0.0037234174],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013660594,0.00020547972,0.010245265,0.000011602289,0.00013883506,0.00018082968,0.00021161241,0.000008950215,0.0048946817,0.21096371,0.04572099,0.72740436],"study_design_scores_gemma":[0.0009802585,0.00030365397,0.033704266,0.00003673787,0.00004923436,0.000068150744,0.000029555536,0.00063042843,0.0049377987,0.028305896,0.930082,0.0008719696],"about_ca_topic_score_codex":0.00012627253,"about_ca_topic_score_gemma":0.0000518321,"teacher_disagreement_score":0.8843611,"about_ca_system_score_codex":0.00006084267,"about_ca_system_score_gemma":0.000058701127,"threshold_uncertainty_score":0.9970523},"labels":[],"label_agreement":null},{"id":"W2526183036","doi":"10.1016/j.jctb.2016.09.007","title":"Generalised Mycielski graphs, signature systems, and bounds on chromatic numbers","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chromatic scale; Mathematics; Signature (topology); Combinatorics; Computer science; Geometry","score_opus":0.008151347987678085,"score_gpt":0.21954110571909125,"score_spread":0.21138975773141316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526183036","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8951197,0.005960771,0.05665053,0.008268254,0.02711375,0.00038801655,0.000053932352,0.00017267863,0.0062723206],"genre_scores_gemma":[0.99792296,0.00027607102,0.0005432244,0.00016148774,0.00034667176,0.0000018374759,6.0929045e-7,0.000006527789,0.00074060465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825954,0.0003585843,0.0004626234,0.00019951095,0.00049061736,0.00022910984],"domain_scores_gemma":[0.99823713,0.00058791396,0.00044545732,0.00035596118,0.00018669902,0.0001868451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001191916,0.0001712427,0.00042659193,0.00030187974,0.00014667748,0.00024720986,0.0008118521,0.00012064667,0.00006531195],"category_scores_gemma":[0.0004433016,0.000090143614,0.00014854172,0.0006841263,0.00017414431,0.0009401958,0.00013783992,0.0001813819,0.000010506704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013126551,0.000070600894,0.00009860177,0.000010122163,0.000117850745,0.000056405996,0.00007185727,0.0000068780428,0.0006916743,0.9932354,0.0028129944,0.002696365],"study_design_scores_gemma":[0.0016189626,0.0013682535,0.0006654717,0.00011177309,0.00006129358,0.00019859985,0.00008346508,0.000022210157,0.0008925681,0.96273357,0.03199773,0.0002461099],"about_ca_topic_score_codex":0.0000042468237,"about_ca_topic_score_gemma":3.0504964e-7,"teacher_disagreement_score":0.102803215,"about_ca_system_score_codex":0.000047418587,"about_ca_system_score_gemma":0.00005283862,"threshold_uncertainty_score":0.367595},"labels":[],"label_agreement":null},{"id":"W2546599874","doi":"10.12775/tmna.2001.039","title":"Recursive coboundary formula for cycles in acyclic chain complexes","year":2001,"lang":"en","type":"article","venue":"Topological Methods in Nonlinear Analysis","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphism; Mathematics; Chain (unit); Algebraic number; Homology (biology); Computation; Algebraic structure; Nonlinear system; Discrete mathematics; Algebra over a field; Pure mathematics; Algorithm","score_opus":0.06724515990375672,"score_gpt":0.42641321932919873,"score_spread":0.359168059425442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2546599874","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067062,0.00050651806,0.9282378,0.002827359,0.00008336598,0.00027991465,0.000049267754,0.00010401214,0.0008497742],"genre_scores_gemma":[0.099989064,0.00025784536,0.8982981,0.00079476926,0.000091274494,0.000082806335,0.00007990639,0.000008142357,0.00039813636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959289,0.0009874362,0.00093502935,0.0010452223,0.0003162954,0.0007871285],"domain_scores_gemma":[0.9954854,0.00314065,0.00022943028,0.00085296977,0.00010561223,0.0001859024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003200542,0.0003210967,0.0012332818,0.0020381073,0.00017267131,0.00014722608,0.0016639098,0.00028299505,0.0003608614],"category_scores_gemma":[0.0023788828,0.00023855157,0.00069001724,0.011674297,0.00029636646,0.0003276102,0.0005398077,0.0003874451,0.00001677063],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028602025,0.0022923027,0.16020486,0.000038680806,0.001346118,0.00035066533,0.0006974582,0.006565091,0.00071130117,0.19392459,0.00016652413,0.6334164],"study_design_scores_gemma":[0.0016262647,0.0005312575,0.10859116,0.000017938355,0.0005089018,0.00002095868,0.0005171043,0.46487865,0.00086773233,0.39501527,0.02641466,0.0010101141],"about_ca_topic_score_codex":0.0005971935,"about_ca_topic_score_gemma":0.0010127254,"teacher_disagreement_score":0.6324063,"about_ca_system_score_codex":0.0001191037,"about_ca_system_score_gemma":0.0000330322,"threshold_uncertainty_score":0.97278506},"labels":[],"label_agreement":null},{"id":"W2549157564","doi":"10.20382/jocg.v7i1a18","title":"Recognizing shrinkable complexes is NP-complete","year":2016,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche; Institut national de recherche en informatique et en automatique (INRIA); McGill University","keywords":"Chemistry; Computer science","score_opus":0.023638570692363654,"score_gpt":0.21859456848658648,"score_spread":0.19495599779422282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549157564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072973065,0.00014971467,0.91863734,0.0051128124,0.00028445915,0.000045966655,0.000049366907,0.000047343387,0.0026999363],"genre_scores_gemma":[0.90829825,0.00015479211,0.08705192,0.0010983885,0.00019525544,1.04249416e-7,0.0000061885717,0.000009546499,0.0031855763],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99811083,0.00012180892,0.0004458329,0.00031138552,0.00070518727,0.00030494286],"domain_scores_gemma":[0.99744546,0.0008008879,0.00055308366,0.00025746602,0.00069736416,0.0002457054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042960997,0.00017216467,0.0003971097,0.0021213559,0.00019696311,0.000114433315,0.0014683245,0.00007531334,0.0004834735],"category_scores_gemma":[0.00015849282,0.00012385231,0.0003223854,0.0035232652,0.000114129594,0.0013786482,0.00037890242,0.00017315973,0.000120462384],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033114484,0.00103514,0.031013258,0.00006490395,0.0021792375,0.0018690396,0.000487047,0.018321399,0.0042423783,0.43250257,0.069879755,0.43807414],"study_design_scores_gemma":[0.0038557604,0.00087332824,0.03205649,0.0001416401,0.00017968207,0.0006060889,0.00019623102,0.004840392,0.00083991676,0.08158232,0.8739779,0.0008502179],"about_ca_topic_score_codex":0.00001789532,"about_ca_topic_score_gemma":0.0000014580486,"teacher_disagreement_score":0.8353252,"about_ca_system_score_codex":0.0001451555,"about_ca_system_score_gemma":0.0001229874,"threshold_uncertainty_score":0.5293696},"labels":[],"label_agreement":null},{"id":"W2553157470","doi":"10.3389/fnsys.2016.00085","title":"Insights into Brain Architectures from the Homological Scaffolds of Functional Connectivity Networks","year":2016,"lang":"en","type":"article","venue":"Frontiers in Systems Neuroscience","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Research Council; Medical Research Council; Canadian Institutes of Health Research; European Commission; University of Oxford","keywords":"ENCODE; Neuroimaging; Computer science; Persistent homology; Functional connectivity; Graph theory; Network architecture; Graph; Resting state fMRI; Representation (politics); Theoretical computer science; Artificial intelligence; Neuroscience; Mathematics; Biology; Algorithm","score_opus":0.015874795612659854,"score_gpt":0.21551041418337102,"score_spread":0.19963561857071116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2553157470","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25589904,0.0008323104,0.73934656,0.001617554,0.0020962483,0.000111127294,0.000007667556,0.000038575425,0.000050889677],"genre_scores_gemma":[0.99816537,0.000027222995,0.0010484816,0.00053749396,0.000094792274,0.000019288986,9.774377e-7,0.000002942155,0.00010341964],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99761844,0.0005409452,0.0003550283,0.0006988091,0.0004925655,0.00029421118],"domain_scores_gemma":[0.9977401,0.0012373544,0.00018308674,0.00069964584,0.000047215246,0.00009262076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052548526,0.00015230183,0.000325069,0.00021847812,0.00017802998,0.000096993725,0.0018252126,0.000076783996,0.0000041021126],"category_scores_gemma":[0.0009378826,0.00006954715,0.00009461807,0.0021011804,0.00066492637,0.00025360935,0.00050419354,0.00011053666,0.0000029314292],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012524246,0.0006123658,0.6561599,0.00002139289,0.00006232347,0.00020301185,0.0008210847,0.054257967,0.022473373,0.08459506,0.06311806,0.117550224],"study_design_scores_gemma":[0.0005577871,0.00025610934,0.803133,0.000060300426,0.000009451855,0.000020168502,0.00008094406,0.16233207,0.00032244818,0.023802279,0.009090104,0.00033534467],"about_ca_topic_score_codex":0.0003785576,"about_ca_topic_score_gemma":0.000038197773,"teacher_disagreement_score":0.74226636,"about_ca_system_score_codex":0.000043393542,"about_ca_system_score_gemma":0.000041154333,"threshold_uncertainty_score":0.33917296},"labels":[],"label_agreement":null},{"id":"W2553758132","doi":"10.37236/6632","title":"The Total Acquisition Number of Random Geometric Graphs","year":2017,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Random graph; Computer science; Combinatorics; Statistics; Graph","score_opus":0.007836276950320244,"score_gpt":0.25487018652043686,"score_spread":0.24703390957011662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2553758132","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6734738,0.012934736,0.3025031,0.0067631095,0.001582138,0.0001662702,0.0000030625183,0.00002322552,0.0025505982],"genre_scores_gemma":[0.9972892,0.0022282535,0.000033263263,0.000026216314,0.000051164432,0.0000011728337,2.924062e-7,0.0000035889946,0.00036687593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998236,0.00015673545,0.0004445266,0.00011202285,0.0006300351,0.00042066153],"domain_scores_gemma":[0.9969966,0.0007084099,0.0010119583,0.0008675739,0.00035151673,0.00006393043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026341164,0.000109142056,0.00029237688,0.00018234145,0.0007582973,0.00026292182,0.0032005445,0.000050323535,0.000015710315],"category_scores_gemma":[0.00062621094,0.000051556395,0.0002897291,0.0013408853,0.00018028052,0.00045663427,0.00031737547,0.0004409916,0.000010782143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004361112,0.000085645246,0.0009836067,0.0000016946243,0.0001267629,0.000004600752,0.000027345824,0.000022551349,0.00001981767,0.98631763,0.00038943792,0.011977271],"study_design_scores_gemma":[0.0012716561,0.00032786292,0.015402471,0.0000065393533,0.0000791897,0.00020111576,0.000023719687,0.00035784964,0.0004533762,0.97970486,0.002082537,0.000088847046],"about_ca_topic_score_codex":0.000022983384,"about_ca_topic_score_gemma":0.0000012599431,"teacher_disagreement_score":0.32381544,"about_ca_system_score_codex":0.00007475073,"about_ca_system_score_gemma":0.00013902037,"threshold_uncertainty_score":0.5947461},"labels":[],"label_agreement":null},{"id":"W2580678407","doi":"10.46298/dmtcs.12794","title":"Cuts and Flows of Cell Complexes","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Security Agency","keywords":"Mathematics; Pure mathematics; Flow (mathematics); Discriminant; Torsion (gastropod); Homology (biology); Combinatorics; Geometry","score_opus":0.01191059948671902,"score_gpt":0.23921361371173153,"score_spread":0.2273030142250125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2580678407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092200145,0.00004176034,0.9024031,0.0005626192,0.000077908764,0.00016267195,0.0000051249867,0.00006831991,0.0044783186],"genre_scores_gemma":[0.59220135,0.0000065853123,0.4076521,0.00010326989,0.000014201382,0.000004712793,8.387876e-7,0.000003072579,0.000013881508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978223,0.000052698255,0.000436136,0.00056540384,0.000674241,0.00044921422],"domain_scores_gemma":[0.99804324,0.00044850283,0.00014181051,0.0008766709,0.00020174484,0.00028803045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000747767,0.00019291445,0.00037857532,0.00028015408,0.00021556078,0.0004586579,0.002241248,0.00004727404,0.00019881756],"category_scores_gemma":[0.00012844922,0.00012693007,0.00008832274,0.0016852439,0.0022201277,0.00067970355,0.0018369094,0.000122056255,0.0000938508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.6916307e-7,0.0000845382,0.00004205444,0.000029768225,0.0000057122415,0.0000017864684,0.00037197061,0.000014058002,0.0035368921,0.9905072,0.00006183469,0.005343759],"study_design_scores_gemma":[0.000097967575,0.00011303426,0.00051115564,0.000015838319,0.000009815045,0.000010314017,0.000033139448,0.5869595,0.0032469155,0.40881595,0.000029642704,0.00015676153],"about_ca_topic_score_codex":0.000012952436,"about_ca_topic_score_gemma":3.651622e-7,"teacher_disagreement_score":0.5869454,"about_ca_system_score_codex":0.000010157579,"about_ca_system_score_gemma":0.000029876584,"threshold_uncertainty_score":0.81801534},"labels":[],"label_agreement":null},{"id":"W2587346915","doi":"10.1090/amsip/050/03","title":"Computational aspects in Reidemeister torsion and Chern-Simons theories","year":2011,"lang":"en","type":"book-chapter","venue":"AMS/IP studies in advanced mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Chern–Simons theory; Torsion (gastropod); Theoretical physics; Computer science; Mathematics; Physics; Mathematical physics; Biology; Anatomy; Gauge theory","score_opus":0.06350854716004022,"score_gpt":0.3115429157926643,"score_spread":0.24803436863262407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2587346915","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022278319,0.028059395,0.3927754,0.0013163437,0.0011529025,0.0013085832,0.00010831218,0.00036548218,0.5726858],"genre_scores_gemma":[0.12576553,0.024196504,0.6877319,0.0010540566,0.00022799535,0.00014320719,0.00007537464,0.00012351946,0.16068189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813706,0.000026054246,0.00065092876,0.00057734316,0.00032722065,0.0002813832],"domain_scores_gemma":[0.99817103,0.00080580736,0.00033093017,0.00051876716,0.000115748604,0.000057726716],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037684262,0.0003641741,0.0008321786,0.00042238293,0.000088432025,0.00003441892,0.00056849106,0.00015839623,0.000039816197],"category_scores_gemma":[0.000409195,0.00028253574,0.000089976966,0.00029838257,0.00038994095,0.0002658933,0.0011016887,0.00032451347,0.000037448084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042633174,0.00005831871,0.000054437878,0.0001291319,0.00008180895,0.00006357968,0.0017334445,0.00014328706,4.7265382e-7,0.9876991,0.00010512958,0.009927061],"study_design_scores_gemma":[0.00026824189,0.000081067774,0.00017724618,0.00036136436,0.00003057046,0.00001031917,0.00029845958,0.0009960693,0.00000567187,0.9946337,0.002807598,0.00032972256],"about_ca_topic_score_codex":0.000007724347,"about_ca_topic_score_gemma":0.000104173785,"teacher_disagreement_score":0.41200387,"about_ca_system_score_codex":0.00010873106,"about_ca_system_score_gemma":0.000022444774,"threshold_uncertainty_score":0.9999627},"labels":[],"label_agreement":null},{"id":"W2592021548","doi":"10.1090/gsm/176/02","title":"Hölder’s theorem, convex subgroups and dynamics","year":2016,"lang":"en","type":"book-chapter","venue":"Graduate studies in mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Manitoba","funders":"","keywords":"Regular polygon; Mathematics; Dynamics (music); Pure mathematics; Physics; Geometry; Acoustics","score_opus":0.10227540187925169,"score_gpt":0.3034946910044552,"score_spread":0.2012192891252035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592021548","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022183955,0.009237495,0.18652159,0.00702657,0.0010846005,0.0007337949,0.0002511077,0.00036219074,0.7945608],"genre_scores_gemma":[0.03018704,0.04073145,0.06550583,0.0005881762,0.0003566084,0.00006653675,0.000046189667,0.00012329247,0.86239487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979519,0.000029522818,0.00061657483,0.00060074456,0.00044811092,0.000353127],"domain_scores_gemma":[0.9976012,0.0009754427,0.00034202114,0.0008563717,0.00014456063,0.000080392376],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006519779,0.0004354149,0.0010125433,0.0004225556,0.00011873644,0.00007437076,0.0009139827,0.00018762959,0.00003130537],"category_scores_gemma":[0.00033686144,0.00027163498,0.00014603786,0.00020745717,0.00071049616,0.00014533687,0.0015152943,0.00030199994,0.00012649345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011671675,0.000021789945,0.0000115590165,0.00014295356,0.00022318636,0.000061136605,0.00066462974,3.0825151e-7,1.7271117e-7,0.9813365,0.0009864632,0.016550163],"study_design_scores_gemma":[0.0001822573,0.00006474197,0.000013408384,0.0002767283,0.00007706816,0.000025676944,0.0001594369,0.0020639685,8.773436e-7,0.9917415,0.005009626,0.000384716],"about_ca_topic_score_codex":0.000002060404,"about_ca_topic_score_gemma":0.000031074494,"teacher_disagreement_score":0.12101575,"about_ca_system_score_codex":0.000116408875,"about_ca_system_score_gemma":0.00001707327,"threshold_uncertainty_score":0.9999736},"labels":[],"label_agreement":null},{"id":"W2594550289","doi":"10.1145/3038462.3038472","title":"EulerianGrapher","year":2017,"lang":"en","type":"article","venue":"","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science","score_opus":0.02418900718392285,"score_gpt":0.2718810142192168,"score_spread":0.24769200703529393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594550289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003990403,0.000029322602,0.70898587,0.0057698125,0.00016678446,0.000016218431,8.534193e-7,0.00010127193,0.28093946],"genre_scores_gemma":[0.9604009,0.000008036956,0.029969333,0.00041600424,0.000026702886,0.0000011945756,3.8511504e-7,6.495923e-7,0.0091768205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9996564,0.000005153734,0.00004372438,0.00013302627,0.0000734127,0.0000883319],"domain_scores_gemma":[0.99904406,0.000011227329,0.000030432859,0.00085959805,0.000013714296,0.00004094068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000075441305,0.00003016567,0.000049631697,0.000040428866,0.00020992878,0.00035128108,0.001419014,0.000015106592,0.00046889443],"category_scores_gemma":[0.00007414544,0.000018729095,0.0000385517,0.00011494223,0.000033300494,0.00039524699,0.00036185642,0.000020754671,0.00041284098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.5103077e-7,0.000018753397,0.0077876,3.2138726e-7,0.000011166678,0.0000099219005,0.0000060751663,5.812355e-7,0.000030437406,0.79818654,0.010432377,0.18351595],"study_design_scores_gemma":[0.00023118619,0.000047415364,0.5442978,0.0000014119983,0.0000072022353,0.000005021306,0.000007274024,0.0044132513,0.0007479267,0.090026736,0.3599846,0.00023011742],"about_ca_topic_score_codex":0.00009927617,"about_ca_topic_score_gemma":0.0000102150625,"teacher_disagreement_score":0.95641047,"about_ca_system_score_codex":0.0000013862235,"about_ca_system_score_gemma":0.0000028340914,"threshold_uncertainty_score":0.5306373},"labels":[],"label_agreement":null},{"id":"W2604050004","doi":"10.4310/hha.2017.v19.n1.a5","title":"Remarks about $\\Delta$-complexes and applications","year":2017,"lang":"en","type":"article","venue":"Homology Homotopy and Applications","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; University of Regina","keywords":"Delta; Computer science; Physics; Astronomy","score_opus":0.01529241818983374,"score_gpt":0.2820326075835781,"score_spread":0.2667401893937444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604050004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005507087,0.0015698159,0.97827154,0.0046439893,0.00003107485,0.00051376125,0.00007541644,0.00013808801,0.00924923],"genre_scores_gemma":[0.96552724,0.0015536838,0.029062953,0.0007337359,0.00024697036,0.0013861664,0.00007090023,0.000009538858,0.0014088013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99880034,0.00003426665,0.00021981314,0.00059747434,0.00009402054,0.00025405834],"domain_scores_gemma":[0.99808687,0.00015457995,0.0001706019,0.0013623969,0.00006445779,0.0001611157],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00020313065,0.00014358413,0.00023623859,0.00013965732,0.0015771424,0.00031821078,0.0011010949,0.000119885204,0.000037045607],"category_scores_gemma":[0.000046844474,0.00012281978,0.00004970135,0.00027976726,0.00064949034,0.00031030606,0.0006689731,0.00015300911,0.000055746303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012556778,0.00007332527,0.0050033936,0.000008754858,0.000025015803,0.0000025331249,0.000024979,0.0000010074135,0.00010859639,0.76012313,0.00037822552,0.23424979],"study_design_scores_gemma":[0.0003875918,0.00006900379,0.2200029,0.0000059095946,0.000065739965,0.00013703718,0.000040008683,0.0010260293,0.00018724214,0.2612028,0.51650965,0.0003660644],"about_ca_topic_score_codex":0.00012697018,"about_ca_topic_score_gemma":0.00005320849,"teacher_disagreement_score":0.9600202,"about_ca_system_score_codex":0.000007910744,"about_ca_system_score_gemma":0.000019310952,"threshold_uncertainty_score":0.99972266},"labels":[],"label_agreement":null},{"id":"W2607074508","doi":"10.71781/15631","title":"Théorème de Kunneth en homologie de Morse","year":2005,"lang":"fr","type":"dissertation","venue":"Open MIND","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Humanities; Philosophy","score_opus":0.05860148049826247,"score_gpt":0.35081830852515333,"score_spread":0.29221682802689086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607074508","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65754414,0.0060645253,0.08045648,0.010738224,0.0016657143,0.0011675139,0.00049803173,0.000027562515,0.24183783],"genre_scores_gemma":[0.29285,0.0013080193,0.38906327,0.00059282506,0.0007391347,0.00007499625,0.0013202371,0.0000326832,0.31401885],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.996878,0.00041045315,0.0005040144,0.0010062057,0.00034634394,0.00085494167],"domain_scores_gemma":[0.99781114,0.0005358084,0.0003206361,0.00086719176,0.00012669916,0.00033853878],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001414747,0.00038889868,0.00060846546,0.00032426286,0.00027960312,0.0011052411,0.0048436695,0.0006113113,0.0112077575],"category_scores_gemma":[0.0007727289,0.00034012325,0.00024375705,0.0017397775,0.000115653755,0.000740024,0.0010146069,0.00059696054,0.003872222],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003195226,0.0003916509,0.0023581123,0.000014912768,0.00018000591,0.00041632887,0.003166737,0.0014571423,0.0001677047,0.0030880424,0.003107973,0.9856194],"study_design_scores_gemma":[0.0012319773,0.00077510934,0.12419781,0.00027263135,0.0010601807,0.00027013247,0.0041041654,0.053360574,0.007631517,0.00917889,0.79560107,0.0023159212],"about_ca_topic_score_codex":0.0026380224,"about_ca_topic_score_gemma":0.0021426259,"teacher_disagreement_score":0.9833035,"about_ca_system_score_codex":0.00026132094,"about_ca_system_score_gemma":0.0007561903,"threshold_uncertainty_score":0.9999317},"labels":[],"label_agreement":null},{"id":"W2608380376","doi":"10.1016/j.crma.2017.05.010","title":"Vers un théorème de la limite centrale dans l'espace de Wasserstein ?","year":2017,"lang":"fr","type":"article","venue":"Comptes Rendus Mathématique","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Limit (mathematics); Pure mathematics; Mathematical analysis","score_opus":0.02160443265182185,"score_gpt":0.273887736983857,"score_spread":0.25228330433203516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608380376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36775386,0.012680932,0.5039958,0.050127417,0.0017644842,0.0004110948,0.0002839467,0.00046255646,0.06251997],"genre_scores_gemma":[0.9236866,0.003981481,0.0516222,0.00049497746,0.0002878359,0.000022704087,0.000026112692,0.000032703483,0.019845383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99645436,0.00082446367,0.00044762943,0.0007329338,0.00038642174,0.0011541715],"domain_scores_gemma":[0.9958451,0.00088415004,0.00050753116,0.0020846957,0.00010209941,0.00057645136],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013275836,0.00042386356,0.00059303106,0.00020873593,0.0009888905,0.0019197493,0.0035375555,0.0004808774,0.00093640934],"category_scores_gemma":[0.0011292284,0.00040071592,0.00033849827,0.0006039777,0.0008195635,0.0009638808,0.0012488278,0.0007361663,0.0006308741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004146555,0.0010884817,0.04486876,0.00025339035,0.0006086436,0.0017521606,0.0066148904,0.001821335,0.0023645472,0.7935946,0.06526721,0.08172454],"study_design_scores_gemma":[0.0017069898,0.00042616887,0.32384044,0.0005707501,0.00049801625,0.0006796599,0.0010159389,0.18821205,0.010923616,0.06425013,0.40609992,0.0017763155],"about_ca_topic_score_codex":0.001885156,"about_ca_topic_score_gemma":0.000114592774,"teacher_disagreement_score":0.7293444,"about_ca_system_score_codex":0.00037041897,"about_ca_system_score_gemma":0.00032727025,"threshold_uncertainty_score":0.9999769},"labels":[],"label_agreement":null},{"id":"W2608635750","doi":"10.1090/crmm/017/03","title":"Chain complexes and simplicial objects","year":2002,"lang":"en","type":"book-chapter","venue":"CRM monograph series","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Chain (unit); Simplicial complex; Simplicial approximation theorem; Abstract simplicial complex; Simplicial manifold; Computer science; Mathematics; Combinatorics; Pure mathematics; Simplicial set; Physics; Astronomy","score_opus":0.022508095447428256,"score_gpt":0.2119213632927256,"score_spread":0.18941326784529733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608635750","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000691651,0.010514427,0.01751773,0.002224608,0.00068624073,0.00048183353,0.00033179406,0.0008571322,0.9666946],"genre_scores_gemma":[0.15690528,0.023683071,0.024855046,0.0033433128,0.0015454489,0.00008436878,0.00047116875,0.00016016646,0.7889521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983734,0.000018320094,0.00031845295,0.00067875994,0.0002843624,0.00032669512],"domain_scores_gemma":[0.9988032,0.0000975224,0.00018257745,0.0006859307,0.00006445336,0.000166314],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010239129,0.0003843115,0.00056584936,0.0007249437,0.00026506296,0.00032508254,0.00081957795,0.00027106318,0.0002831583],"category_scores_gemma":[0.000023685243,0.00031883433,0.00023315997,0.00038694695,0.0004461499,0.0003935663,0.0006368833,0.00026327136,0.00006653318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005200973,0.000015810347,0.000099028155,0.000020904388,0.00011769413,0.000044742763,0.0001818657,0.0000014650908,0.0000047299172,0.956876,0.002764371,0.039868206],"study_design_scores_gemma":[0.00017867968,0.00032678986,0.0012103223,0.000041174393,0.000093954426,0.00004983802,0.000033308315,0.00019772715,0.00003107656,0.41677862,0.5802666,0.00079191383],"about_ca_topic_score_codex":0.00003530739,"about_ca_topic_score_gemma":0.00004948232,"teacher_disagreement_score":0.57750225,"about_ca_system_score_codex":0.000010403254,"about_ca_system_score_gemma":0.000011325862,"threshold_uncertainty_score":0.9999264},"labels":[],"label_agreement":null},{"id":"W2610043059","doi":"10.1090/amsip/050/19","title":"Analytic continuation of Chern-Simons theory","year":2011,"lang":"en","type":"book-chapter","venue":"AMS/IP studies in advanced mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":423,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Continuation; Analytic continuation; Chern–Simons theory; Mathematics; Mathematical physics; Mathematical analysis; Computer science; Programming language; Gauge theory","score_opus":0.09742948925082853,"score_gpt":0.32447281421974933,"score_spread":0.2270433249689208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610043059","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021373598,0.010983095,0.5746414,0.00014271453,0.00045009382,0.00054984534,0.00006181395,0.00015469232,0.4128026],"genre_scores_gemma":[0.057348203,0.02394518,0.30762,0.0003139135,0.00015246708,0.00010423668,0.000049747912,0.00010570917,0.61036056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979447,0.000032113385,0.0008816693,0.00049017905,0.00038420546,0.0002671117],"domain_scores_gemma":[0.9967638,0.0010458904,0.00082566397,0.0010494933,0.00026415757,0.000050957893],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067651796,0.0003580281,0.0011500219,0.0004893712,0.00005647234,0.000013981433,0.0010269762,0.00017144904,0.000100484634],"category_scores_gemma":[0.0009482537,0.00027506845,0.00023310195,0.0004117252,0.0004014434,0.00020084555,0.000781311,0.00026694778,0.00007094694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004370699,0.00008275782,0.0000095236,0.00017574996,0.0003530332,0.000017817052,0.0013638034,0.0000398649,0.000004607981,0.961964,0.00015324228,0.03583122],"study_design_scores_gemma":[0.00022914904,0.000106792206,0.00003262395,0.00037844127,0.00018260522,0.0000032972189,0.00038838974,0.00048686008,0.00006311985,0.99461025,0.0031897048,0.00032876647],"about_ca_topic_score_codex":0.0000037152945,"about_ca_topic_score_gemma":0.000031336353,"teacher_disagreement_score":0.2670214,"about_ca_system_score_codex":0.000085357664,"about_ca_system_score_gemma":0.000026281748,"threshold_uncertainty_score":0.99997014},"labels":[],"label_agreement":null},{"id":"W2617036728","doi":"10.1103/physreve.96.032312","title":"Construction of and efficient sampling from the simplicial configuration model","year":2017,"lang":"en","type":"article","venue":"Physical review. E","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Simplicial complex; Computer science; Model category; Sampling (signal processing); Mathematics; Combinatorics; Pure mathematics; Computer vision","score_opus":0.05503517661930724,"score_gpt":0.35682239926871745,"score_spread":0.3017872226494102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617036728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26306102,0.0009709539,0.7324736,0.0029131,0.000039819242,0.00009897096,0.000021224447,0.000012516884,0.0004087645],"genre_scores_gemma":[0.9948987,0.00084237376,0.0039466587,0.00023451885,0.00006583754,0.000003659783,0.000004677151,0.0000010215573,0.0000025541876],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994444,0.000027466798,0.00013186717,0.00017718019,0.00014605033,0.000073017996],"domain_scores_gemma":[0.99909353,0.00018126391,0.0001706193,0.00047720873,0.000046019486,0.000031377298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013084599,0.000056430155,0.00018660164,0.000011362296,0.0001883772,0.00007531907,0.00046535445,0.000011681795,0.000004245851],"category_scores_gemma":[0.0003991961,0.000031575277,0.00006415016,0.0001133958,0.00012807014,0.00011466724,0.00019093529,0.000056634988,0.000007871668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024242056,0.000058253096,0.00049100234,0.000030304727,0.000023087188,2.5260377e-7,0.00006570585,0.00045779854,0.0018027426,0.4285091,0.000112960246,0.5684464],"study_design_scores_gemma":[0.00013586355,0.000032231055,0.022896454,0.00013476993,0.00009643994,9.282356e-7,0.0000062404147,0.81427085,0.001692279,0.15964794,0.0009605524,0.00012544029],"about_ca_topic_score_codex":0.00009284486,"about_ca_topic_score_gemma":0.0000028350269,"teacher_disagreement_score":0.8138131,"about_ca_system_score_codex":0.000004051415,"about_ca_system_score_gemma":0.000009769893,"threshold_uncertainty_score":0.14488642},"labels":[],"label_agreement":null},{"id":"W2622502366","doi":"10.1007/s00220-017-3065-9","title":"Fermionic Approach to Weighted Hurwitz Numbers and Topological Recursion","year":2017,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Université de Montréal","funders":"Agence Nationale de la Recherche","keywords":"Generating function; Monotone polygon; Hypergeometric distribution; Recursion (computer science); Multiplicative function; Basis (linear algebra); Simple (philosophy); Quantum; Hurwitz matrix","score_opus":0.08829402534430071,"score_gpt":0.3472792679979914,"score_spread":0.2589852426536907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2622502366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036642037,0.0001957715,0.8458209,0.012938148,0.000051759736,0.0003933736,0.000005946958,0.0001410449,0.10381103],"genre_scores_gemma":[0.7724025,0.000095067546,0.22706224,0.0001715275,0.000014175561,0.000038170365,0.000006367526,0.0000036414924,0.0002062618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889237,0.00011725131,0.000265643,0.00032338017,0.00018098707,0.0002203982],"domain_scores_gemma":[0.9955382,0.00037084718,0.00010420272,0.0038091098,0.000049080933,0.00012856444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042460818,0.00012265546,0.00027273357,0.00008023919,0.00054443773,0.0002863899,0.003879964,0.00007680388,0.000012679219],"category_scores_gemma":[0.00053400005,0.00009272406,0.000059005128,0.0005234253,0.00038003534,0.00037078987,0.0031057198,0.00025289532,0.00011510182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012061507,0.00038871937,0.0002820481,0.000008281588,0.0000075294124,5.9992357e-7,0.00018432575,0.0000040497807,0.000005908131,0.97886294,0.00009648363,0.020157909],"study_design_scores_gemma":[0.00015392597,0.000030690084,0.0046448484,0.000022907983,0.000010030614,0.0000045046695,0.00005876839,0.029899364,0.000020781497,0.9638817,0.0011117393,0.00016077892],"about_ca_topic_score_codex":0.000025141486,"about_ca_topic_score_gemma":0.0000046461078,"teacher_disagreement_score":0.7357605,"about_ca_system_score_codex":0.000033859695,"about_ca_system_score_gemma":0.0000132910745,"threshold_uncertainty_score":0.7210003},"labels":[],"label_agreement":null},{"id":"W2657857444","doi":"10.1109/isbi.2017.7950575","title":"Brain geometry persistent homology marker for Parkinson's disease","year":2017,"lang":"en","type":"article","venue":"","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Persistent homology; Topological data analysis; Point cloud; Persistence (discontinuity); Homology (biology); Timeline; Topology (electrical circuits); Geometry; Neurodegeneration; Computer science; Mathematics; Disease; Medicine; Artificial intelligence; Biology; Pathology; Combinatorics; Genetics; Algorithm; Statistics","score_opus":0.027929088879160232,"score_gpt":0.274645960610605,"score_spread":0.24671687173144474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2657857444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03448131,0.00047998593,0.8910629,0.06547635,0.00051196606,0.00023246786,0.00007125864,0.00014662172,0.007537135],"genre_scores_gemma":[0.95680165,0.000023471961,0.022154253,0.0025394289,0.00008669936,0.00003578153,0.00001560321,0.000004049986,0.018339058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988747,0.000031443684,0.0001359979,0.00047624158,0.00015919359,0.0003224134],"domain_scores_gemma":[0.9980397,0.0002461747,0.00009746252,0.0013163651,0.000057968897,0.00024230959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035896988,0.000108753666,0.00017912476,0.0001833868,0.0004998861,0.00034869084,0.0019092843,0.000050325372,0.00032356335],"category_scores_gemma":[0.0010585887,0.00007671632,0.00029535897,0.00022666214,0.00012208034,0.00037365305,0.00069229986,0.00005489466,0.00010423058],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008249858,0.00045153283,0.10237018,0.00003974594,0.00034655645,0.00013131539,0.00004226982,0.000043335833,0.000022836528,0.35323477,0.24557789,0.29765707],"study_design_scores_gemma":[0.00037878304,0.000111254616,0.39289594,0.0000023348623,0.000038778973,0.000004663917,0.000013494797,0.016748527,0.000009389955,0.009821013,0.57976454,0.00021130242],"about_ca_topic_score_codex":0.000065520784,"about_ca_topic_score_gemma":0.000009303826,"teacher_disagreement_score":0.92232037,"about_ca_system_score_codex":0.000016800066,"about_ca_system_score_gemma":0.000025112018,"threshold_uncertainty_score":0.38447705},"labels":[],"label_agreement":null},{"id":"W2746090999","doi":"10.7202/1040904ar","title":"Une autre manière de modéliser les réseaux sociaux. Applications à l’étude de co-publications","year":2017,"lang":"fr","type":"article","venue":"Nouvelles perspectives en sciences sociales","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Strong","keywords":"Humanities; Philosophy; Combinatorics; Mathematics","score_opus":0.11383510687401406,"score_gpt":0.40151028328938293,"score_spread":0.2876751764153689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2746090999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045537427,0.013390084,0.543848,0.30222023,0.0004026175,0.00073336426,0.0006597318,0.00040764606,0.09280089],"genre_scores_gemma":[0.9368705,0.0036053185,0.042795543,0.0003517181,0.001049049,0.00015490224,0.000020347246,0.000019630146,0.015132968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99554414,0.00055639923,0.00047275066,0.0013624931,0.0008702738,0.0011939728],"domain_scores_gemma":[0.9962377,0.0010142601,0.00063755695,0.0012044844,0.0004994869,0.0004065177],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.0023227732,0.00040896778,0.00052105624,0.00043047397,0.008897592,0.0028241726,0.0056606974,0.0004438898,0.0006468643],"category_scores_gemma":[0.0014901318,0.00038625576,0.00043619162,0.0024283917,0.009316053,0.001851521,0.0009589729,0.00053821324,0.00023891791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030563267,0.0005859729,0.013653872,0.000022039674,0.00014235526,0.000007077201,0.02702883,0.00037705046,0.00012882678,0.9301692,0.009845653,0.01803606],"study_design_scores_gemma":[0.00061875436,0.00022761011,0.4243629,0.00006878635,0.00030408418,0.00004467599,0.17747903,0.022856906,0.00020429738,0.27403602,0.09848724,0.0013096969],"about_ca_topic_score_codex":0.0128897745,"about_ca_topic_score_gemma":0.0031065256,"teacher_disagreement_score":0.8913331,"about_ca_system_score_codex":0.0010923165,"about_ca_system_score_gemma":0.0027725252,"threshold_uncertainty_score":0.9998589},"labels":[],"label_agreement":null},{"id":"W2755171146","doi":"10.70930/tac/4fxr6zrg","title":"Classifying Tangent Structures using Weil Algebras","year":2017,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tangent; Mathematics; Algebra over a field; Pure mathematics; Computer science; Geometry","score_opus":0.028003975728143036,"score_gpt":0.2937827071458388,"score_spread":0.26577873141769576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755171146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06690621,0.00072077406,0.9301493,0.0002701773,0.000029968647,0.00007743961,0.0000111095205,0.00003228516,0.0018027514],"genre_scores_gemma":[0.9926231,0.00006426747,0.0070773633,0.000035519814,0.000042749103,0.000012614663,0.0000031844925,0.0000019618233,0.00013927247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994641,0.000033349355,0.00012766715,0.00018451872,0.00009053439,0.000099855846],"domain_scores_gemma":[0.9989344,0.00010732581,0.00015804646,0.00070804526,0.00004766877,0.000044529417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028339538,0.000069355425,0.00012825188,0.000076466844,0.0005785271,0.00016101025,0.00077960105,0.00003417108,0.000026353275],"category_scores_gemma":[0.00007195959,0.000051451232,0.000033278407,0.0001750299,0.00035664896,0.000303747,0.0003308981,0.000048372825,0.0000030382328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026439466,0.000010700158,0.0004212506,0.0000062004565,0.000016497674,2.5584512e-7,0.000063706524,0.000011146897,0.00030592078,0.94387954,0.0000101937085,0.055271942],"study_design_scores_gemma":[0.00006295601,0.0000113877195,0.0070941537,0.0000018551145,0.00002529036,0.0000038450635,0.00013695251,0.00040417502,0.003254079,0.98454094,0.0043827794,0.00008155846],"about_ca_topic_score_codex":0.000041529856,"about_ca_topic_score_gemma":0.00000242909,"teacher_disagreement_score":0.9257169,"about_ca_system_score_codex":0.000004740555,"about_ca_system_score_gemma":0.000015666546,"threshold_uncertainty_score":0.44496214},"labels":[],"label_agreement":null},{"id":"W2765260291","doi":"10.1007/s10208-020-09444-1","title":"Linking Combinatorial and Classical Dynamics: Conley Index and Morse Decompositions","year":2020,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Hausdorff Research Institute for Mathematics; Natural Sciences and Engineering Research Council of Canada; Uniwersytet Jagielloński w Krakowie; Simons Foundation; National Science Foundation","keywords":"Morse code; Discrete Morse theory; Simplicial complex; Invariant (physics); Morse theory; Dynamical systems theory; Simplicial approximation theorem; Abstract simplicial complex","score_opus":0.020965238897328025,"score_gpt":0.27060778671346625,"score_spread":0.24964254781613823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765260291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045916565,0.000024424677,0.94845897,0.0049874224,0.000057813984,0.000087731336,0.0000360265,0.000051775103,0.00037929],"genre_scores_gemma":[0.7593709,0.000005697502,0.24038434,0.00012288294,0.000029288056,0.0000036082995,0.000074051655,0.000003184732,0.000006013189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908787,0.000029342506,0.00033058165,0.00020480395,0.00025151728,0.00009586871],"domain_scores_gemma":[0.9987286,0.0007235031,0.00014913635,0.00012664203,0.0001587248,0.00011341595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010719525,0.00009405376,0.00021062203,0.00013649392,0.00016033252,0.00014871024,0.00026057285,0.000046541027,0.000019360165],"category_scores_gemma":[0.00020295083,0.00008687179,0.000040616622,0.0005939145,0.00016196157,0.0002855423,0.00026588936,0.00009600049,0.000009672471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020669927,0.00010400958,0.0005847578,0.000034543726,0.000036226407,0.0000013213537,0.00029161584,0.0026127396,0.0000061362675,0.9934076,0.00007342469,0.0028455234],"study_design_scores_gemma":[0.0002235766,0.00004843906,0.001458267,0.000009601849,0.000017292485,0.000007453131,0.000050727507,0.6165186,0.0000032193218,0.3814878,0.00011019753,0.00006483299],"about_ca_topic_score_codex":0.0000042686474,"about_ca_topic_score_gemma":0.0000020517914,"teacher_disagreement_score":0.71345437,"about_ca_system_score_codex":0.0000130683275,"about_ca_system_score_gemma":0.00004534703,"threshold_uncertainty_score":0.35425287},"labels":[],"label_agreement":null},{"id":"W2770285924","doi":"10.1002/sta4.167","title":"Bump hunting by topological data analysis","year":2017,"lang":"en","type":"article","venue":"Stat","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Studienstiftung des Deutschen Volkes","keywords":"Statistical inference; Persistent homology; Topological data analysis; Inference; Kernel density estimation; Computer science; Kernel (algebra); Data set; Statistical hypothesis testing; Statistical analysis; Algorithm; Mathematics; Data mining; Topology (electrical circuits); Statistics; Discrete mathematics; Artificial intelligence; Combinatorics","score_opus":0.07395390870928459,"score_gpt":0.3424577054442873,"score_spread":0.2685037967350027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770285924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031501234,0.00034469352,0.9540554,0.006349409,0.00018340453,0.000050535607,0.00033951996,0.00014015236,0.0070356256],"genre_scores_gemma":[0.9760015,0.00006240905,0.021610405,0.00034778778,0.000051623585,0.0000018241346,0.00019769941,0.0000021344715,0.0017245945],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9985317,0.000046344194,0.00018565479,0.0006672135,0.00026618622,0.00030291657],"domain_scores_gemma":[0.9960227,0.0001574849,0.00016167268,0.003511539,0.000034488556,0.00011211361],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00048289806,0.00010339496,0.00025934645,0.0001525423,0.0005481624,0.0007078116,0.0055800104,0.000054419488,0.00032085498],"category_scores_gemma":[0.00094524585,0.00007191251,0.00009977363,0.0008083986,0.00013965325,0.0008953024,0.0033140949,0.00011156318,0.00012325724],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009763733,0.00036590066,0.39037046,0.000009248495,0.0017511828,0.000171082,0.00012193087,0.000058094753,0.00023771044,0.11011258,0.06801969,0.42877236],"study_design_scores_gemma":[0.0006842316,0.00018901775,0.4107007,0.0000057620327,0.0010153824,0.000007978079,0.00012806547,0.18951498,0.00037742016,0.030564416,0.3657519,0.0010601303],"about_ca_topic_score_codex":0.0008703967,"about_ca_topic_score_gemma":0.00012198416,"teacher_disagreement_score":0.94450027,"about_ca_system_score_codex":0.000009901897,"about_ca_system_score_gemma":0.000011913048,"threshold_uncertainty_score":0.99980026},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0591049888782196,"score_gpt":0.24529438037629533,"score_spread":0.18618939149807573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2780888184","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026557322,0.00076203863,0.34757492,0.0012468734,0.0004416473,0.0056073177,0.0016171574,0.00014832051,0.639946],"genre_scores_gemma":[0.08624083,0.0010837679,0.29132658,0.0023102493,0.004896696,0.0011960824,0.0009665888,0.0002535037,0.6117257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986988,0.000008447191,0.00052670063,0.00033915025,0.00023468229,0.00019225138],"domain_scores_gemma":[0.9976983,0.0014259552,0.00039412422,0.0003724608,0.000058982296,0.00005019647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008962292,0.00023983445,0.00060563895,0.00008038457,0.00015922685,0.00012695657,0.0005230156,0.00041405665,0.00001972116],"category_scores_gemma":[0.000063009604,0.00015290784,0.00026277898,0.00008205874,0.00037436228,0.00003638947,0.00025507418,0.0002817294,0.0000023224566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018481012,0.000040159874,0.0000018458072,0.00013201567,0.00020397897,4.534553e-7,0.0028226727,0.0000016211308,0.000019199231,0.9695346,0.010423872,0.016801145],"study_design_scores_gemma":[0.0026013793,0.000111652625,0.0000017203566,0.00010752188,0.00028761654,0.0000029398154,0.0004557535,0.0007942922,0.00009987023,0.9006645,0.09453906,0.0003336928],"about_ca_topic_score_codex":0.0000048288334,"about_ca_topic_score_gemma":0.000008767574,"teacher_disagreement_score":0.08411519,"about_ca_system_score_codex":0.000009275324,"about_ca_system_score_gemma":0.000038447255,"threshold_uncertainty_score":0.62354004},"labels":[],"label_agreement":null},{"id":"W2784087054","doi":"10.1002/rsa.20841","title":"Enumeration and randomized constructions of hypertrees","year":2019,"lang":"en","type":"preprint","venue":"Random Structures and Algorithms","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"H2020 European Research Council; Azrieli Foundation","keywords":"Enumeration; Vertex (graph theory); Homology (biology); Combinatorics; Mathematics; Face (sociological concept); Upper and lower bounds; Discrete mathematics; Physics; Biology; Genetics; Graph; Mathematical analysis","score_opus":0.010571807602737545,"score_gpt":0.23958239543593088,"score_spread":0.22901058783319334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784087054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084852874,0.012244507,0.89891624,0.0009314282,0.0012467705,0.0009423403,0.00026023327,0.00009036823,0.0005152255],"genre_scores_gemma":[0.93198466,0.0037476013,0.06381528,0.00007897737,0.00013176707,0.00002496222,0.00007529996,0.0000070746296,0.00013436814],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983486,0.00020647347,0.0004688297,0.0005626684,0.00024750683,0.000165914],"domain_scores_gemma":[0.99837655,0.00066040916,0.00032776882,0.00045151717,0.00009860189,0.00008517051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042240214,0.000249976,0.0012029966,0.00028653772,0.000105210835,0.00021694392,0.00035983848,0.00021423565,0.000036283705],"category_scores_gemma":[0.00023407594,0.00016306611,0.00021922057,0.00024655517,0.0003548435,0.00014160087,0.0007857058,0.00027008564,8.846956e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0040811873,0.000074429154,0.0009900447,0.00047745195,0.0017845266,0.000016245998,0.0010825653,0.0030694618,0.0002287217,0.23823665,0.0004613549,0.74949735],"study_design_scores_gemma":[0.16964133,0.00013613241,0.004146577,0.00012037759,0.0008592774,0.00017442805,0.0001336204,0.3518052,0.00076060125,0.4693632,0.0018128001,0.0010464134],"about_ca_topic_score_codex":0.00028238777,"about_ca_topic_score_gemma":0.000004674301,"teacher_disagreement_score":0.8471318,"about_ca_system_score_codex":0.0000066511466,"about_ca_system_score_gemma":0.000040356732,"threshold_uncertainty_score":0.6649643},"labels":[],"label_agreement":null},{"id":"W2784422906","doi":"10.1007/s41468-019-00041-y","title":"On the geometrical properties of the coherent matching distance in 2D persistent homology","year":2019,"lang":"en","type":"preprint","venue":"Journal of Applied and Computational Topology","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Abitibi-Témiscamingue","funders":"H2020 European Research Council; European Science Foundation; European Commission","keywords":"Monodromy; Betti number; Mathematics; Persistent homology; Homology (biology); Computation; Metric (unit); Grid; Pure mathematics; Topology (electrical circuits); Matching (statistics); Simplicial complex; Combinatorics; Algorithm; Geometry","score_opus":0.025195054153239114,"score_gpt":0.235369660497868,"score_spread":0.2101746063446289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784422906","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8844137,0.0015175021,0.10170332,0.010666735,0.00067056855,0.00026680797,0.000013249892,0.000006154322,0.00074195367],"genre_scores_gemma":[0.99776685,0.00006380547,0.0014238134,0.0006492575,0.000049195954,0.000006402754,0.0000015928335,0.0000034452526,0.00003565676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983523,0.00016063197,0.00061827374,0.0002697218,0.00042462244,0.00017448913],"domain_scores_gemma":[0.99809045,0.0007668304,0.00067983376,0.00029030922,0.00013113662,0.00004142667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057689793,0.00016035017,0.00051571336,0.0003796774,0.00008261556,0.000052020918,0.0012482909,0.00014518974,0.000019497087],"category_scores_gemma":[0.0000990134,0.00007640332,0.00023288785,0.0005871376,0.0003044187,0.000037261387,0.0010019388,0.00076166354,0.0000029933326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000917848,0.00022535064,0.00055883906,0.000050274462,0.00018719779,0.000008196856,0.0005859069,0.31496426,0.000026732347,0.6794466,0.00028416957,0.0035706814],"study_design_scores_gemma":[0.00081482757,0.0004430528,0.034119457,0.00016761158,0.000093445946,0.00013861929,0.0006654934,0.03649051,0.00007926635,0.92610204,0.0005957321,0.00028991152],"about_ca_topic_score_codex":0.000028439494,"about_ca_topic_score_gemma":0.0000039221864,"teacher_disagreement_score":0.27847373,"about_ca_system_score_codex":0.00006310799,"about_ca_system_score_gemma":0.00014054024,"threshold_uncertainty_score":0.33090913},"labels":[],"label_agreement":null},{"id":"W2789262120","doi":"10.1101/268383","title":"Topology highlights mesoscopic functional equivalence between imagery and perception","year":2018,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Compagnia di San Paolo","keywords":"Perception; Cognitive psychology; Mental image; Cognition; Embodied cognition; Psychology; Neurophysiology; Functional equivalence; Cognitive science; Population; Computer science; Neuroimaging; Equivalence (formal languages); Artificial intelligence; Mathematics; Neuroscience; Pure mathematics; Sociology","score_opus":0.024438952318288087,"score_gpt":0.23708953155145612,"score_spread":0.21265057923316805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789262120","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6813323,0.0007871712,0.31284577,0.0024406256,0.0015616714,0.00028393738,0.0001681958,0.0005567449,0.000023614839],"genre_scores_gemma":[0.97160226,0.00034290116,0.026369471,0.00028950672,0.0012956924,0.00005093988,0.0000012550585,0.000023688031,0.000024265026],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99659175,0.00020950106,0.0005203106,0.0016031372,0.0004888729,0.0005864224],"domain_scores_gemma":[0.9972286,0.00019058655,0.00034259804,0.0015165076,0.0003928369,0.00032885032],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067267596,0.00047208846,0.00064931693,0.00061941374,0.0003032183,0.0004228174,0.0013007845,0.0005568249,0.00023388253],"category_scores_gemma":[0.00019198915,0.00042290994,0.0001483851,0.0010755947,0.00042511098,0.00048126478,0.0023667978,0.00054665323,0.00027410907],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011672876,0.0014156095,0.44977185,0.001990943,0.0032813065,0.0006769401,0.00015662228,0.00009235081,0.36858547,0.13960244,0.0334293,0.00088043895],"study_design_scores_gemma":[0.00029109992,0.00014367128,0.9825207,0.0000925343,0.00017624746,6.0747915e-8,0.0000014329911,0.00073740905,0.0072664297,0.00022648272,0.0077199778,0.0008239473],"about_ca_topic_score_codex":0.00007966408,"about_ca_topic_score_gemma":8.4206727e-7,"teacher_disagreement_score":0.5327489,"about_ca_system_score_codex":0.00014959634,"about_ca_system_score_gemma":0.00021454977,"threshold_uncertainty_score":0.99982226},"labels":[],"label_agreement":null},{"id":"W2791067803","doi":"10.1017/9781108553490.011","title":"Synthetic Differential Topology","year":2018,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Topology (electrical circuits); Computer science; Differential (mechanical device); Content (measure theory); Mathematics; Engineering; Combinatorics; Mathematical analysis","score_opus":0.021240639575467814,"score_gpt":0.19950683146796205,"score_spread":0.17826619189249424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791067803","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008705093,0.0000677828,0.08302074,0.00006098405,0.00044465903,0.00012150042,0.00014950121,0.00020464578,0.9158431],"genre_scores_gemma":[0.0025666268,0.00006596765,0.0005512455,0.00008682707,0.00018199548,3.3530176e-7,0.000035670397,0.000013312424,0.99649805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982376,0.000053258584,0.00019454902,0.0008643186,0.00029079488,0.0003594553],"domain_scores_gemma":[0.99811864,0.000111495596,0.00020385056,0.0012233828,0.00013461211,0.00020799557],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000075764685,0.00034284627,0.0004981197,0.0004221868,0.00021221234,0.00009322381,0.0022169405,0.00041648746,0.00013768439],"category_scores_gemma":[0.000020875097,0.0003292938,0.00032306576,0.000032886524,0.0005061466,0.00011727738,0.0018682864,0.00034206646,0.00020034294],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011908466,0.000011453551,5.171522e-7,0.000010239684,0.00013865478,0.00022123341,0.00001324733,2.0717748e-7,0.0000069006705,0.964671,0.030888375,0.004026229],"study_design_scores_gemma":[0.0002231431,0.00011051719,0.000014376077,0.000023732857,0.00019494582,0.000024132549,0.0000047248286,0.00027264416,0.00010589981,0.00029267007,0.9983222,0.0004110225],"about_ca_topic_score_codex":0.00009700791,"about_ca_topic_score_gemma":0.0000021394108,"teacher_disagreement_score":0.9674338,"about_ca_system_score_codex":0.00009044772,"about_ca_system_score_gemma":0.00005084286,"threshold_uncertainty_score":0.9999159},"labels":[],"label_agreement":null},{"id":"W2796347907","doi":"10.1145/3188745.3188942","title":"Operator scaling via geodesically convex optimization, invariant theory and polynomial identity testing","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Polynomial; Matrix polynomial; Scaling; Operator (biology); Polynomial matrix; Convex optimization; Applied mathematics; Discrete mathematics; Regular polygon; Mathematical analysis","score_opus":0.02528442273177934,"score_gpt":0.26193872787014877,"score_spread":0.23665430513836944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796347907","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070382496,0.00019316241,0.99017364,0.00046464428,0.0004059885,0.00017615291,0.000020405758,0.00023519408,0.0012925601],"genre_scores_gemma":[0.32872474,0.000047899484,0.66888845,0.0014480759,0.00043959313,0.000018974299,0.000046306028,0.000014420286,0.00037155626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737996,0.0003363718,0.0005186739,0.0010574511,0.00036357375,0.00034394258],"domain_scores_gemma":[0.9976222,0.00066016923,0.00023111772,0.00087446393,0.0003760366,0.00023604279],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020930052,0.00029320433,0.00048175332,0.0003222071,0.00030172957,0.001320452,0.0017716363,0.00028531448,0.0003796246],"category_scores_gemma":[0.0021558274,0.00022254449,0.000096272146,0.0010515233,0.00024708212,0.00070505537,0.00573812,0.00036627863,0.000057558496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014850119,0.0011225222,0.019685991,0.00046440092,0.0022180201,0.0003209099,0.0012628748,0.17979112,0.0008327349,0.61312497,0.00929615,0.1717318],"study_design_scores_gemma":[0.00026048452,0.000071028415,0.0030942825,0.000045110777,0.00012105987,0.000023636963,0.000015429649,0.95754874,0.00016250169,0.037904568,0.00015845697,0.0005947238],"about_ca_topic_score_codex":0.00051418983,"about_ca_topic_score_gemma":0.000015276211,"teacher_disagreement_score":0.7777576,"about_ca_system_score_codex":0.00004108794,"about_ca_system_score_gemma":0.00015268548,"threshold_uncertainty_score":0.9997163},"labels":[],"label_agreement":null},{"id":"W2801314139","doi":"10.1139/tcsme-2012-0016","title":"AN APPROACH FOR COUNTING THE NUMBER OF SPECIALIZED MECHANISMS SUBJECT TO NON-ADJACENCY CONSTRAINTS","year":2012,"lang":"en","type":"article","venue":"Transactions of the Canadian Society for Mechanical Engineering","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Adjacency matrix; Kinematics; Adjacency list; Computer science; Polynomial; Combinatorics; Kinematic chain; Mathematics; Permutation (music); Graph","score_opus":0.016988795680246173,"score_gpt":0.24136222234179103,"score_spread":0.22437342666154486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801314139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019041277,0.00001302465,0.9966734,0.0004050611,0.0002852898,0.00045793102,0.00018393509,0.000024270732,0.000052938845],"genre_scores_gemma":[0.70316875,0.0000016315356,0.29656732,0.0001238858,0.000042296902,0.000060039256,0.000004543848,0.000007943209,0.000023596178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989278,0.000014390875,0.00025870948,0.00018841815,0.00018861736,0.00042210953],"domain_scores_gemma":[0.9989538,0.00018127367,0.000067347886,0.00045020456,0.000093129966,0.00025422257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007852394,0.00012165011,0.00023247044,0.00005372536,0.0002691135,0.00003365642,0.00096637587,0.00010570645,0.000036575297],"category_scores_gemma":[0.00007996675,0.00008271069,0.00057848345,0.00088902103,0.000046652796,0.00018635805,0.000017730401,0.0001266632,7.940212e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022438138,0.00036011948,0.00005228761,0.00027169505,0.00092502154,1.5640802e-7,0.002734049,0.050310593,0.02636569,0.89337665,0.00056547724,0.025015797],"study_design_scores_gemma":[0.0012659124,0.00019044212,0.000464395,0.00004535038,0.0005286849,0.00002159358,0.0012619067,0.9327403,0.05253698,0.0061752805,0.004047224,0.00072198425],"about_ca_topic_score_codex":0.0027423888,"about_ca_topic_score_gemma":0.0005818016,"teacher_disagreement_score":0.88720137,"about_ca_system_score_codex":0.00010035573,"about_ca_system_score_gemma":0.000102863094,"threshold_uncertainty_score":0.41456896},"labels":[],"label_agreement":null},{"id":"W2802327855","doi":"10.3389/fpls.2018.00553","title":"Topological Data Analysis as a Morphometric Method: Using Persistent Homology to Demarcate a Leaf Morphospace","year":2018,"lang":"en","type":"article","venue":"Frontiers in Plant Science","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Persistent homology; Topological data analysis; Phylogenetic tree; Measure (data warehouse); Homology (biology); Topology (electrical circuits); Biology; Phylogenetics; Shape analysis (program analysis); Evolutionary biology; Pattern recognition (psychology); Computer science; Mathematics; Artificial intelligence; Algorithm; Data mining; Gene; Combinatorics; Ecology; Genetics","score_opus":0.06244271969750149,"score_gpt":0.33425295410224554,"score_spread":0.27181023440474406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802327855","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07859321,0.0003550818,0.9181266,0.0013122727,0.0007835042,0.00016312818,0.00011961194,0.00006850571,0.00047808973],"genre_scores_gemma":[0.36860767,0.000035450164,0.63025206,0.0008238056,0.000047365407,0.0000057556986,0.00002348599,0.0000033976937,0.00020100446],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952478,0.00023378621,0.00045742939,0.0020533951,0.0009586113,0.0010490196],"domain_scores_gemma":[0.99662066,0.00023854892,0.000175631,0.002327222,0.0001581501,0.0004798184],"candidate_categories":["bibliometrics","open_science"],"consensus_categories":[],"category_scores_codex":[0.0037783189,0.00025655466,0.0006890374,0.006221348,0.00047409505,0.00032702784,0.0077529117,0.00012044447,0.00010810836],"category_scores_gemma":[0.0020667526,0.00019793792,0.00016922674,0.046664625,0.0009881308,0.00096914626,0.004016817,0.00024551546,0.00008893535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048516062,0.002205904,0.6223427,0.00004620841,0.0031281195,0.0029054065,0.0052867024,0.04087605,0.005359476,0.06751802,0.08866948,0.16117676],"study_design_scores_gemma":[0.00023259518,0.00044669714,0.025952835,0.000008642843,0.00029652103,0.00017555707,0.00045799726,0.9631832,0.00034179306,0.0026471238,0.0057400893,0.00051695306],"about_ca_topic_score_codex":0.0018055413,"about_ca_topic_score_gemma":0.00009638229,"teacher_disagreement_score":0.92230713,"about_ca_system_score_codex":0.00025460203,"about_ca_system_score_gemma":0.00022416838,"threshold_uncertainty_score":0.99761564},"labels":[],"label_agreement":null},{"id":"W2807222275","doi":"10.2140/agt.2021.21.1209","title":"Barcode embeddings for metric graphs","year":2021,"lang":"en","type":"article","venue":"Algebraic & Geometric Topology","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Embedding; Barcode; Injective function; Metric space; Mathematics; Invariant (physics); Discrete space; Discrete mathematics; Combinatorics; Topology (electrical circuits); Computer science; Artificial intelligence","score_opus":0.016192065123436784,"score_gpt":0.2657656619095716,"score_spread":0.24957359678613483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807222275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026339969,0.006748428,0.9540909,0.0071550487,0.0013267365,0.0002650565,0.000058921905,0.0003727904,0.0036421423],"genre_scores_gemma":[0.91558605,0.00050844817,0.075682014,0.0034741347,0.00017658161,0.000102971135,0.00011333026,0.000023425988,0.004333026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963388,0.00017856174,0.00064066687,0.0012993799,0.00047761263,0.0010649831],"domain_scores_gemma":[0.99543285,0.0022938584,0.00022983205,0.0012789343,0.00042758422,0.00033694098],"candidate_categories":["metaepi_narrow","bibliometrics","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00066240854,0.00033780147,0.00073962874,0.0041271797,0.00033659453,0.00020706978,0.0019102439,0.00029048015,0.0009700743],"category_scores_gemma":[0.00451938,0.0002972402,0.00051767717,0.030782603,0.00019676084,0.00048852223,0.0009238959,0.0002855512,0.00027326372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008601101,0.0002868084,0.0018938042,0.000021664287,0.00027472666,0.00012911904,0.000055211774,0.00003392547,0.0001791112,0.78867644,0.013474477,0.1949661],"study_design_scores_gemma":[0.002746201,0.00106469,0.029190997,0.000010927121,0.0003469678,0.00057004404,0.00025106032,0.0040953252,0.007980782,0.6011735,0.35099763,0.0015718719],"about_ca_topic_score_codex":0.000106935506,"about_ca_topic_score_gemma":0.000021867974,"teacher_disagreement_score":0.8892461,"about_ca_system_score_codex":0.000072407296,"about_ca_system_score_gemma":0.00014764561,"threshold_uncertainty_score":0.99994797},"labels":[],"label_agreement":null},{"id":"W2890117028","doi":"10.1142/s0218348x18500986","title":"CONVEX HULLS OF SIERPIŃSKI RELATIVES","year":2018,"lang":"en","type":"article","venue":"Fractals","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Division of Mathematical Sciences","keywords":"Convex hull; Mathematics; Combinatorics; Hull; Convex combination; Regular polygon; Scaling; Convex polytope; Fractal; Convex set; Dimension (graph theory); Sierpinski triangle; Geometry; Mathematical analysis; Convex optimization; Geology","score_opus":0.011512955610805497,"score_gpt":0.2558882685569981,"score_spread":0.24437531294619258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890117028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3085381,0.00052556227,0.590645,0.002109986,0.0004435875,0.00012349762,0.00003793596,0.00016887249,0.09740746],"genre_scores_gemma":[0.98672146,0.000014457496,0.011348298,0.00027226508,0.00006829095,0.0000015025383,0.0000037311247,0.0000018599197,0.001568117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9992023,0.000043180775,0.00019455775,0.0002168484,0.0001932361,0.00014986025],"domain_scores_gemma":[0.99908257,0.0002198545,0.000121412406,0.0004211472,0.00009498042,0.00006003839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002214647,0.000067458604,0.00019599855,0.00014176327,0.00005159529,0.000029420327,0.00062145665,0.000050685878,0.000626497],"category_scores_gemma":[0.00028121067,0.000048645463,0.000069067406,0.001036386,0.00017488134,0.00033863072,0.00022528371,0.00005867889,0.00050758466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030275984,0.00071498356,0.033468913,0.000037583497,0.00042345712,0.000049404163,0.0027610764,0.000013890694,0.020405674,0.54372966,0.046052538,0.35231254],"study_design_scores_gemma":[0.0008947985,0.001491498,0.43132555,0.00005237896,0.00007702825,0.000019138097,0.00018496292,0.0055227433,0.06240129,0.13162155,0.36559942,0.00080963544],"about_ca_topic_score_codex":0.000026723852,"about_ca_topic_score_gemma":0.0000012960235,"teacher_disagreement_score":0.6781834,"about_ca_system_score_codex":0.0000065905388,"about_ca_system_score_gemma":0.0000148790205,"threshold_uncertainty_score":0.6859703},"labels":[],"label_agreement":null},{"id":"W2891725784","doi":"10.1214/17-aoas1119","title":"Topological data analysis of single-trial electroencephalographic signals","year":2018,"lang":"en","type":"article","venue":"The Annals of Applied Statistics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":93,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Biomedical Imaging and Bioengineering; King Abdullah University of Science and Technology; McMaster University; University of Wisconsin-Madison; Emory University; National Institutes of Health; National Science Foundation","keywords":"Electroencephalography; Pattern recognition (psychology); Computer science; Resampling; Neurophysiology; Artificial intelligence; Speech recognition; Neuroscience; Psychology","score_opus":0.16827890641685442,"score_gpt":0.3625785741721692,"score_spread":0.1942996677553148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891725784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03463269,0.000103014245,0.9616544,0.0006322789,0.000066464905,0.00016616922,0.0010048219,0.000035675755,0.0017044783],"genre_scores_gemma":[0.96052414,0.00011042862,0.03863885,0.0004542279,0.00007412501,0.000004218691,0.00017147517,0.0000032101352,0.000019324305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797887,0.00010510168,0.00058874657,0.00046696706,0.00052023405,0.00034009363],"domain_scores_gemma":[0.9963341,0.0009834708,0.00044211204,0.001863021,0.00029769412,0.00007963047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001188821,0.0001455097,0.00056900235,0.0005031321,0.000116145726,0.000049641025,0.0034098162,0.00006995512,0.00020723119],"category_scores_gemma":[0.00041818107,0.00008853448,0.000122251,0.005667158,0.00084640173,0.00010379904,0.00088231603,0.00011072348,0.000012089827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00126203,0.0005938684,0.000110349465,0.000008388785,0.0020375177,0.0000043642804,0.00019930226,0.00018833394,0.002419479,0.9519293,0.0056797294,0.03556736],"study_design_scores_gemma":[0.004089332,0.005247654,0.011972507,0.00000958598,0.0033765587,0.0000025543595,0.00019764855,0.08542255,0.015595133,0.8667529,0.006571977,0.0007615638],"about_ca_topic_score_codex":0.000072828494,"about_ca_topic_score_gemma":0.00004973857,"teacher_disagreement_score":0.92589146,"about_ca_system_score_codex":0.0000031243248,"about_ca_system_score_gemma":0.000032703785,"threshold_uncertainty_score":0.6336344},"labels":[],"label_agreement":null},{"id":"W2893734123","doi":"10.1093/obo/9780199756384-0157","title":"Anomie and Strain Theory","year":2018,"lang":"en","type":"dataset","venue":"","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Anomie; General strain theory; Strain (injury); Psychology; Criminology; Social psychology; Biology","score_opus":0.01360466289604733,"score_gpt":0.24663646956242094,"score_spread":0.2330318066663736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2893734123","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000022276463,0.000117071024,0.028824553,0.00025717943,0.00013459189,0.00003728911,0.97002774,0.000043464326,0.00055589614],"genre_scores_gemma":[0.0000059282584,0.00020431558,0.0046593216,0.001056007,0.00012960304,0.000003006817,0.99259025,0.0000016586487,0.0013499359],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99892646,0.00007693709,0.00015373195,0.0004838896,0.00016438936,0.00019457078],"domain_scores_gemma":[0.9987341,0.0002144661,0.000068952104,0.0008516529,0.000026802722,0.0001040048],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004376958,0.00015353605,0.00023303016,0.0002565048,0.00007080559,0.00020615356,0.0013210501,0.00015471548,0.0017709498],"category_scores_gemma":[0.00015702209,0.000097430064,0.00005540868,0.00056599267,0.00014329964,0.00015344085,0.0009396055,0.00013217138,0.00035526944],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.160243e-7,0.000018087861,0.0000012126757,0.0000048281054,0.000028711238,0.000010932364,0.0000012765747,3.1999747e-8,2.1152972e-7,0.011752706,0.9758998,0.012281454],"study_design_scores_gemma":[0.000048229813,0.00006586764,0.00010659994,0.0000025962663,0.000023189275,0.0000069204634,0.000001898566,0.00003294375,0.0000014104343,0.021357922,0.9782032,0.00014923653],"about_ca_topic_score_codex":0.00012739797,"about_ca_topic_score_gemma":0.00006248353,"teacher_disagreement_score":0.024165232,"about_ca_system_score_codex":0.000007770187,"about_ca_system_score_gemma":0.000023240624,"threshold_uncertainty_score":0.9991416},"labels":[],"label_agreement":null},{"id":"W2894350713","doi":"10.48550/arxiv.1809.10779","title":"On the Reliability Roots of Simplicial Complexes and Matroids","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Matroid; Mathematics; Combinatorics; h-vector; Unit disk; Simplicial complex; Simplicial homology; Unit (ring theory); Abstract simplicial complex; Graph; Reliability (semiconductor); Unit disk graph; Simplicial approximation theorem; Terminal (telecommunication); Discrete mathematics; Pure mathematics; Computer science; Simplicial set; Physics","score_opus":0.0629690705403804,"score_gpt":0.19640168331551686,"score_spread":0.13343261277513646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894350713","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8209993,0.00001827972,0.17680956,0.00041196175,0.00011729939,0.0001219466,0.00005492918,0.00005267864,0.0014140237],"genre_scores_gemma":[0.9991077,0.00004399155,0.0004621689,0.00012181949,0.000037574155,3.0149957e-7,0.0000071617906,0.0000031542581,0.00021612609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986263,0.00016223635,0.00017155874,0.000747407,0.00009983005,0.00019264889],"domain_scores_gemma":[0.9978025,0.0005040982,0.00020016904,0.0012870573,0.00012439358,0.00008180184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003792515,0.00017738505,0.00031147175,0.00018933653,0.00014437427,0.000059906917,0.001718856,0.00014670714,0.00009017268],"category_scores_gemma":[0.00020320863,0.00012468266,0.00015825126,0.0008697118,0.00043187657,0.000104902916,0.0027638103,0.00027893658,0.00003285244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038521717,0.000153487,0.0058316356,0.000036305206,0.00009743233,0.000021899214,0.000050794464,0.010234318,0.000024635776,0.9808297,0.0017812236,0.0009000056],"study_design_scores_gemma":[0.00021270651,0.00023214145,0.05212978,0.00003000359,0.00009505483,0.000001390831,0.000034744804,0.12994224,0.00013394463,0.8161546,0.0007272753,0.00030609942],"about_ca_topic_score_codex":0.00033013808,"about_ca_topic_score_gemma":0.00003063704,"teacher_disagreement_score":0.1781084,"about_ca_system_score_codex":0.00003829715,"about_ca_system_score_gemma":0.000037097605,"threshold_uncertainty_score":0.50844115},"labels":[],"label_agreement":null},{"id":"W2896786466","doi":"10.2140/gt.2021.25.3257","title":"Bounds on spectral norms and barcodes","year":2021,"lang":"en","type":"preprint","venue":"Geometry & Topology","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Monotone polygon; Symplectic geometry; Pure mathematics; Hamiltonian (control theory); Lagrangian; Poisson bracket; Norm (philosophy); Intersection homology; Bounding overwatch; Homology (biology); Algebraic number; Mathematical analysis; Cohomology; Computer science; Mathematical optimization; Lie algebra; Geometry","score_opus":0.017569660319171187,"score_gpt":0.2599710640787305,"score_spread":0.24240140375955932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896786466","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8650696,0.0047032614,0.108597375,0.01203265,0.0033432108,0.0002546092,0.000097952885,0.00033261036,0.0055686967],"genre_scores_gemma":[0.98020333,0.00095686247,0.015554639,0.0015832733,0.00037355575,0.000034665594,0.0001594318,0.0000138065525,0.0011204064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9967414,0.00018364014,0.0004458482,0.001536444,0.0003803395,0.00071233016],"domain_scores_gemma":[0.9974099,0.00046771416,0.00019929234,0.0015730533,0.00009332017,0.00025672634],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004350576,0.00042649344,0.00086350064,0.0011855431,0.0001994035,0.00053492346,0.0017628246,0.00057215936,0.00084902946],"category_scores_gemma":[0.00048458623,0.00034599396,0.00027700057,0.0018197971,0.0003858813,0.00019068593,0.004385936,0.0010441535,0.000113984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053585904,0.0011966903,0.030594602,0.00029278806,0.0014297091,0.0020263996,0.00070479466,0.0011736783,0.00025298353,0.6971494,0.005833166,0.25929224],"study_design_scores_gemma":[0.002322863,0.003162024,0.4978475,0.00022971405,0.00063901726,0.0010872212,0.0006483312,0.011600465,0.003720121,0.30757996,0.16567913,0.005483632],"about_ca_topic_score_codex":0.00048867,"about_ca_topic_score_gemma":0.000081581675,"teacher_disagreement_score":0.4672529,"about_ca_system_score_codex":0.000076468365,"about_ca_system_score_gemma":0.000112323854,"threshold_uncertainty_score":0.9998992},"labels":[],"label_agreement":null},{"id":"W2906945318","doi":"10.48550/arxiv.1810.10813","title":"Inverse Problems in Topological Persistence","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Persistence (discontinuity); Inverse; Topological data analysis; Topology (electrical circuits); Mathematics; Geology; Geometry; Combinatorics; Algorithm","score_opus":0.14365121526489724,"score_gpt":0.19552367215401448,"score_spread":0.051872456889117236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2906945318","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5540158,0.00010608044,0.43557724,0.0005117746,0.0005284895,0.0002948279,0.000027723707,0.00029009543,0.00864792],"genre_scores_gemma":[0.9954328,0.00022653994,0.0022328014,0.00021959854,0.000056638266,0.0000012205264,0.000017485125,0.0000050790213,0.0018078496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748355,0.0001924176,0.00024870352,0.0014836426,0.000121358906,0.0004703341],"domain_scores_gemma":[0.9980838,0.00011925848,0.0001923731,0.0012879693,0.000117166885,0.00019948921],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039919865,0.0002912974,0.0004338282,0.0006281426,0.00010916882,0.00011701315,0.0031587726,0.00040582145,0.00026754726],"category_scores_gemma":[0.00015015762,0.0002676656,0.00026939853,0.002461363,0.00037301716,0.00036167432,0.0042549577,0.0006128861,0.0003657945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058469544,0.0013587574,0.1630693,0.00021261527,0.00037794092,0.0030247264,0.0010427543,0.26869398,0.000028159438,0.55402887,0.004443722,0.003660688],"study_design_scores_gemma":[0.00074860867,0.0003081859,0.020754788,0.00010668843,0.00010688211,0.000012227294,0.00024248476,0.66763276,0.0000275379,0.3050524,0.00386227,0.0011451809],"about_ca_topic_score_codex":0.0004436686,"about_ca_topic_score_gemma":0.00029946252,"teacher_disagreement_score":0.44141695,"about_ca_system_score_codex":0.000191347,"about_ca_system_score_gemma":0.00009691576,"threshold_uncertainty_score":0.9999775},"labels":[],"label_agreement":null},{"id":"W2912803718","doi":"10.1007/s00222-020-00986-3","title":"Local limits of uniform triangulations in high genus","year":2020,"lang":"en","type":"preprint","venue":"Inventiones mathematicae","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Triangulation; Genus; Infinity; Conjecture; Limit (mathematics); Combinatorics; Uniqueness; Planar; Probabilistic logic; Plane (geometry); Discrete mathematics; Pure mathematics; Mathematical analysis; Geometry; Computer science; Statistics","score_opus":0.06969730773636827,"score_gpt":0.29295105471254146,"score_spread":0.22325374697617317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912803718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020865053,0.00016832583,0.97435296,0.002862833,0.00018530943,0.0002580505,0.000044461583,0.000092506176,0.001170499],"genre_scores_gemma":[0.93085665,0.00003308588,0.06868882,0.00006763426,0.000032988162,0.000041521133,0.00008256515,0.0000074222553,0.00018930266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808276,0.00008516264,0.0008126823,0.0004441372,0.00038562022,0.00018963573],"domain_scores_gemma":[0.99839514,0.00020515049,0.0004194269,0.00079383195,0.00009209026,0.00009435283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036952892,0.00018806255,0.0006014823,0.00051153376,0.000035366727,0.000071876864,0.0012323445,0.00018734987,0.00016170651],"category_scores_gemma":[0.00035446565,0.00015774772,0.00027494063,0.0015993003,0.000097610384,0.00015535456,0.0010678204,0.00027991598,0.00013227385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045581883,0.00040349382,0.00016433097,0.00043813273,0.000114649745,0.000025957212,0.00035294224,0.0021307052,0.000014691506,0.9800381,0.00035481114,0.015957637],"study_design_scores_gemma":[0.0002877476,0.00004329012,0.004729575,0.00016619895,0.0000655886,0.0000037746477,0.00005218292,0.086640716,0.00020073065,0.90732306,0.00027681512,0.00021033114],"about_ca_topic_score_codex":0.00015479335,"about_ca_topic_score_gemma":0.00003834494,"teacher_disagreement_score":0.9099916,"about_ca_system_score_codex":0.000045185414,"about_ca_system_score_gemma":0.00007140746,"threshold_uncertainty_score":0.6432766},"labels":[],"label_agreement":null},{"id":"W2918205015","doi":"","title":"Kernels in tensor product of digraphs I.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tensor product; Product (mathematics); Tensor (intrinsic definition); Pure mathematics; Geometry","score_opus":0.014581871548918197,"score_gpt":0.24800408702177096,"score_spread":0.23342221547285277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918205015","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.993822,0.00017897441,0.0010642979,0.0006685814,0.00074391486,0.000094717034,0.0000035313312,0.000060408496,0.0033636028],"genre_scores_gemma":[0.99826014,0.000014269981,0.0014417085,0.00007150152,0.00000784936,0.0000042062215,0.0000015497765,0.0000024418289,0.00019632603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897194,0.000049594077,0.00023075803,0.00032786318,0.00021034898,0.00020949425],"domain_scores_gemma":[0.99907166,0.0000729184,0.00008132353,0.00060879684,0.00011157278,0.000053709817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029897134,0.00008435255,0.00020285665,0.00029488117,0.000035351877,0.000028214403,0.0008677995,0.000034943256,0.000044691005],"category_scores_gemma":[0.00024750817,0.00006492306,0.00005817725,0.0027165362,0.00012802347,0.0002360298,0.00025773246,0.000074660646,0.00007407445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004957712,0.00025741858,0.07152157,0.000005820939,0.00002139464,0.000010129858,0.0001670329,0.0000019554998,0.00026028336,0.91138643,0.0015660825,0.014796896],"study_design_scores_gemma":[0.0005297478,0.00032045218,0.2647584,0.00001347669,0.0000096429685,0.0000035635476,0.000018140832,0.0008932135,0.00786615,0.72101647,0.0043713744,0.00019937556],"about_ca_topic_score_codex":0.00015598844,"about_ca_topic_score_gemma":0.00001173473,"teacher_disagreement_score":0.19323683,"about_ca_system_score_codex":0.000011910912,"about_ca_system_score_gemma":0.000019741285,"threshold_uncertainty_score":0.26474854},"labels":[],"label_agreement":null},{"id":"W2918404841","doi":"10.1101/569210","title":"A topological data analysis based classification method for multiple measurements","year":2019,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Ottawa Mental Health Centre","funders":"","keywords":"Classifier (UML); Topological data analysis; Computer science; Feature selection; Data mining; Artificial intelligence; Pattern recognition (psychology); Machine learning; Algorithm","score_opus":0.1255587367199574,"score_gpt":0.31372027834225613,"score_spread":0.18816154162229873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918404841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045139994,0.00037558164,0.9905082,0.0011383592,0.0006435786,0.0008641938,0.0015277008,0.00042147984,0.0000069100765],"genre_scores_gemma":[0.5755244,0.000021789818,0.42377236,0.00035856632,0.000114536466,0.00016581024,0.000017121904,0.00002025088,0.0000051838842],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99431735,0.00047448956,0.00080529996,0.002888605,0.00083967386,0.0006745497],"domain_scores_gemma":[0.9904388,0.00075513177,0.00074721954,0.0070077972,0.0007485282,0.00030252806],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0033334594,0.0005622995,0.0011143468,0.0011504333,0.00022012867,0.0006089102,0.0059409975,0.0006468906,0.00006051711],"category_scores_gemma":[0.0023511644,0.00048772062,0.00051567896,0.00415875,0.00008267816,0.0004207727,0.0028071133,0.0005205372,0.00007200058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046382632,0.0069110645,0.5279951,0.0021397285,0.027910162,0.0001094581,0.000033070657,0.06169104,0.31212622,0.046135448,0.013441289,0.0010435781],"study_design_scores_gemma":[0.0005663811,0.00006277396,0.12209856,0.000026920676,0.0014128517,2.5465872e-9,8.856007e-7,0.86248213,0.0057192524,0.000020426076,0.006877308,0.0007324843],"about_ca_topic_score_codex":0.00014793608,"about_ca_topic_score_gemma":0.000010865174,"teacher_disagreement_score":0.80079114,"about_ca_system_score_codex":0.00021883559,"about_ca_system_score_gemma":0.0004319728,"threshold_uncertainty_score":0.99975747},"labels":[],"label_agreement":null},{"id":"W2940913597","doi":"10.1088/1367-2630/ab57d2","title":"Mercator: uncovering faithful hyperbolic embeddings of complex networks","year":2019,"lang":"en","type":"preprint","venue":"New Journal of Physics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Agencia Estatal de Investigación; Canada First Research Excellence Fund; Banco Bilbao Vizcaya Argentaria; James S. McDonnell Foundation; Generalitat de Catalunya; Ministerio de Economía y Competitividad; Institució Catalana de Recerca i Estudis Avançats; Academy of Finland; Ministerio de Ciencia e Innovación; Fundación BBVA","keywords":"Mercator projection; Embedding; Similarity (geometry); Algorithm; Hyperbolic geometry; Mathematics; Degree (music); Computer science; Node (physics); Topology (electrical circuits); Artificial intelligence; Differential geometry; Geometry; Combinatorics; Image (mathematics); Geography; Physics","score_opus":0.03462542677870203,"score_gpt":0.2725653414281198,"score_spread":0.23793991464941774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940913597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028408943,0.0009872664,0.9684355,0.00030400942,0.0010243523,0.00007499319,0.000016571988,0.00002151397,0.0007268344],"genre_scores_gemma":[0.96669096,0.00041270565,0.031406086,0.00020137455,0.0011229335,4.5843473e-7,0.000010979524,0.000013918017,0.00014058127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778426,0.00007508992,0.00081379747,0.00033884522,0.0006939044,0.00029410486],"domain_scores_gemma":[0.9968075,0.0001941818,0.0016703003,0.00079950324,0.0003250142,0.0002034767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037943898,0.00027734137,0.0010363122,0.00024732345,0.000040310373,0.00015351636,0.002637272,0.00018666079,0.000045798082],"category_scores_gemma":[0.000068237,0.00021761275,0.0006459052,0.00096178777,0.00005842602,0.00039109244,0.0017876786,0.00088734,0.000017155453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000266352,0.00026610994,0.0029838565,0.000120325036,0.0008461053,0.000030709227,0.0004091293,0.6840921,0.00053530943,0.017266052,0.016263006,0.27716064],"study_design_scores_gemma":[0.0035811244,0.0015986575,0.026168114,0.0013853676,0.001576175,0.00019386681,0.0002261476,0.5885538,0.0043066824,0.28861466,0.081037834,0.0027575626],"about_ca_topic_score_codex":0.00014104464,"about_ca_topic_score_gemma":0.000001994156,"teacher_disagreement_score":0.938282,"about_ca_system_score_codex":0.00007283553,"about_ca_system_score_gemma":0.00026089864,"threshold_uncertainty_score":0.887399},"labels":[],"label_agreement":null},{"id":"W2941111042","doi":"10.48550/arxiv.1904.10256","title":"Ghrist Barcoded Video Frames. Application in Detecting Persistent Visual Scene Surface Shapes captured in Videos","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Betti number; Vertex (graph theory); Barcode; Combinatorics; Mathematics; Abelian group; Triangulation; Free abelian group; Computer science; Computer vision; Topology (electrical circuits); Artificial intelligence; Geometry","score_opus":0.04393824799308674,"score_gpt":0.20437916846543583,"score_spread":0.1604409204723491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941111042","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5579512,0.00019361342,0.44077983,0.00018151749,0.0001135988,0.00034425125,0.0000143969455,0.000089261106,0.0003322998],"genre_scores_gemma":[0.99779564,0.00014106557,0.0015426984,0.00013218136,0.00002869741,0.0000022680122,0.00003551043,0.0000121895455,0.00030977596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968533,0.0002490244,0.00040175885,0.0017449332,0.00018929975,0.0005616651],"domain_scores_gemma":[0.99810857,0.00029034325,0.0003340575,0.0009465324,0.00011414645,0.00020632781],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064958556,0.00036707308,0.00061018567,0.0008663364,0.000094219205,0.00015346105,0.002111237,0.0004576668,0.000033538756],"category_scores_gemma":[0.00024717746,0.00039209318,0.00032796798,0.003214961,0.00009113865,0.0003986969,0.0023845222,0.00093692495,0.00012791005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035331028,0.00023432261,0.052988194,0.00006589786,0.00007729708,0.00013880103,0.00022537436,0.9397349,0.0001898662,0.0034221632,0.000030411633,0.0028574623],"study_design_scores_gemma":[0.0005367849,0.00005234367,0.018306848,0.00006886772,0.0000491552,0.0000020943269,0.0002582981,0.9762061,0.00011756806,0.0037744907,0.00014456897,0.00048288447],"about_ca_topic_score_codex":0.004179954,"about_ca_topic_score_gemma":0.0010064798,"teacher_disagreement_score":0.4398444,"about_ca_system_score_codex":0.0005155897,"about_ca_system_score_gemma":0.0001645672,"threshold_uncertainty_score":0.9998531},"labels":[],"label_agreement":null},{"id":"W2945144629","doi":"10.55016/ojs/cdm.v16i3.71284","title":"Homotopy Type of Independence Complexes of Certain Families of Graphs","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Indian Institute of Technology Bombay; Infosys Foundation","keywords":"Mathematics; Homotopy; Combinatorics; Homotopy sphere; Regular homotopy; Categorical variable; Discrete mathematics; Independence (probability theory); Graph; n-connected; Wedge (geometry); Pure mathematics; Geometry","score_opus":0.024733293724966722,"score_gpt":0.306981659783901,"score_spread":0.2822483660589343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945144629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14991082,0.00039736542,0.8475088,0.000502471,0.00005794265,0.0001383121,0.00071460224,0.000026203339,0.00074350927],"genre_scores_gemma":[0.9449788,0.00006065416,0.054768488,0.00002299401,0.0000045212087,0.0000043383916,0.000031512573,0.0000026321643,0.00012606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986887,0.00005766065,0.0005371693,0.00019248399,0.00035104164,0.00017294768],"domain_scores_gemma":[0.99761224,0.00038503538,0.00024411909,0.0007091947,0.0009751411,0.00007425746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030315414,0.000101390775,0.00047102032,0.0002455542,0.000050526345,0.000019948875,0.00069210154,0.000061040475,0.000069893315],"category_scores_gemma":[0.0017712087,0.00008040067,0.00014755677,0.0028761728,0.00014741992,0.00011138862,0.00043616336,0.00007164947,0.000008853235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003820347,0.0002484351,0.0011001737,0.000102552476,0.00010173196,0.000004354014,0.000445453,0.00013825655,0.011117208,0.9851909,0.00019889657,0.0013481767],"study_design_scores_gemma":[0.0010260107,0.0007282798,0.018897109,0.0003820599,0.00034529282,0.00003194218,0.0024119979,0.01829089,0.3732343,0.58173287,0.002266981,0.0006522883],"about_ca_topic_score_codex":0.000053099284,"about_ca_topic_score_gemma":0.000018705805,"teacher_disagreement_score":0.79506797,"about_ca_system_score_codex":0.000013621531,"about_ca_system_score_gemma":0.000088911685,"threshold_uncertainty_score":0.32786444},"labels":[],"label_agreement":null},{"id":"W2945547540","doi":"10.1103/physreve.100.020702","title":"Bulk-boundary correspondence in soft matter","year":2019,"lang":"en","type":"article","venue":"Physical review. E","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brockhouse Institute for Materials Research","funders":"Istanbul Teknik Üniversitesi","keywords":"Fractal dimension; Soft matter; Materials science; Fumed silica; Liquid crystal; Randomness; Condensed matter physics; Universality (dynamical systems); Fractal; Phase boundary; Phase (matter); Chemical physics; Physics; Chemistry; Composite material; Mathematics; Quantum mechanics","score_opus":0.01160292160548665,"score_gpt":0.30023215575459716,"score_spread":0.2886292341491105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945547540","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6376412,0.066708736,0.19839513,0.056611314,0.0013036333,0.0017490333,0.00003450856,0.00043515707,0.037121277],"genre_scores_gemma":[0.98603374,0.001603419,0.0011242911,0.009122572,0.00006889472,0.000015935217,0.000008957256,0.0000057891853,0.0020163797],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99876815,0.000074360876,0.00018740665,0.00042168566,0.00029422872,0.00025414414],"domain_scores_gemma":[0.99894357,0.00021304784,0.00006443447,0.000669883,0.00002848994,0.00008059379],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00025430747,0.00011501216,0.00036784678,0.00007084796,0.000028020897,0.000066711895,0.0010238818,0.000020511874,0.0013592328],"category_scores_gemma":[0.00011703178,0.00008320232,0.00014141564,0.0013128164,0.000061673396,0.00034736536,0.00038954345,0.00017424136,0.026352396],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028271104,0.0016457248,0.1201989,0.0015222298,0.00008437735,0.00012770615,0.0004299501,0.00015801049,0.0019130721,0.117832705,0.11375964,0.6422994],"study_design_scores_gemma":[0.00068536814,0.0003183747,0.22298135,0.0014375001,0.00006225715,0.000020704252,0.000014447756,0.04319055,0.00024593086,0.14294668,0.58690226,0.0011945701],"about_ca_topic_score_codex":0.000054700828,"about_ca_topic_score_gemma":0.000005109581,"teacher_disagreement_score":0.6411048,"about_ca_system_score_codex":0.000018189205,"about_ca_system_score_gemma":0.000023700703,"threshold_uncertainty_score":0.9995537},"labels":[],"label_agreement":null},{"id":"W2947685135","doi":"10.14288/1.0384585","title":"Incidence Networks for Geometric Deep Learning","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Incidence (geometry); Polytope; Equivariant map; Pooling; Node (physics); Invariant (physics); Enhanced Data Rates for GSM Evolution; Mathematics; Decomposition; Tensor decomposition; Variety (cybernetics); Tensor (intrinsic definition); Computer science; Combinatorics; Pure mathematics; Artificial intelligence; Geometry; Physics","score_opus":0.05613920351421213,"score_gpt":0.19183396055099614,"score_spread":0.13569475703678402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947685135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024694635,0.0004656072,0.9729046,0.00006385848,0.0005682174,0.00028647573,0.0000099453855,0.00022739894,0.00077921187],"genre_scores_gemma":[0.99147284,0.0006276639,0.0037714643,0.00011616574,0.000105696825,0.0000019797048,0.00006239368,0.000011610477,0.0038301686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752945,0.00012950662,0.0002404768,0.0014395509,0.00012490773,0.0005360952],"domain_scores_gemma":[0.99726087,0.00072898,0.00036490342,0.0012270854,0.00023099621,0.00018715022],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052638655,0.0003118257,0.0005063576,0.0011052064,0.00022076207,0.00021885723,0.0031791118,0.00040142055,0.00006601913],"category_scores_gemma":[0.00040660345,0.00031429,0.00042035812,0.0044883112,0.0000780774,0.00042073277,0.0037735766,0.00078421226,0.00015757972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011163838,0.00004162015,0.008933236,0.000030016075,0.00009761701,0.000052617863,0.00001628098,0.94268733,4.6168796e-7,0.038259167,0.00022145506,0.009649003],"study_design_scores_gemma":[0.00026129087,0.000102729886,0.003944226,0.00002098853,0.000104902596,0.0000020565299,0.000023424978,0.97938025,0.000004234595,0.012729671,0.003005664,0.0004205734],"about_ca_topic_score_codex":0.00014383138,"about_ca_topic_score_gemma":0.000018961002,"teacher_disagreement_score":0.9691332,"about_ca_system_score_codex":0.00015343745,"about_ca_system_score_gemma":0.00006948941,"threshold_uncertainty_score":0.9999309},"labels":[],"label_agreement":null},{"id":"W2950051395","doi":"10.3390/molecules24122301","title":"Metabolic Brain Network Analysis of FDG-PET in Alzheimer’s Disease Using Kernel-Based Persistent Features","year":2019,"lang":"en","type":"article","venue":"Molecules","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Biomedical Imaging and Bioengineering; Canadian Institutes of Health Research; National Institutes of Health; H. Lundbeck A/S; Servier; National Natural Science Foundation of China; Eisai; Genentech; IXICO; Northern California Institute for Research and Education; Pfizer; Biogen; BioClinica; F. Hoffmann-La Roche; University of Southern California; Eli Lilly and Company; U.S. Department of Defense; Meso Scale Diagnostics; Alzheimer's Disease Neuroimaging Initiative; Novartis Pharmaceuticals Corporation; Bristol-Myers Squibb; National Institute on Aging; Alzheimer's Association; Foundation for the National Institutes of Health","keywords":"Univariate; Neuroimaging; Positron emission tomography; Medicine; Disease; Computational biology; Pattern recognition (psychology); Computer science; Pathology; Artificial intelligence; Machine learning; Biology; Nuclear medicine; Multivariate statistics","score_opus":0.020424735320556317,"score_gpt":0.26184254891197445,"score_spread":0.24141781359141812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950051395","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8895913,0.012784059,0.095139585,0.0016301267,0.00014294976,0.00020886117,0.000069023576,0.00006316334,0.0003709484],"genre_scores_gemma":[0.9898146,0.000013037567,0.009269013,0.00077778875,0.000016666061,0.000003992867,0.00004866557,0.0000049205432,0.000051337087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984246,0.00016712656,0.00027772176,0.00047246926,0.00034180758,0.00031629208],"domain_scores_gemma":[0.99879605,0.00016205515,0.00013835893,0.000714322,0.00005255487,0.0001366408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029087966,0.00015622759,0.00047925688,0.0008115743,0.000042688192,0.00007075532,0.0007795375,0.00003728357,0.00009647504],"category_scores_gemma":[0.0000898261,0.00012415415,0.00051387394,0.005906179,0.00005607485,0.00012992363,0.00023363433,0.00009297331,0.00001246267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003274324,0.00023013541,0.09632851,0.000009955789,0.0018526783,0.00008674152,0.00006919029,0.8778832,0.00035357304,0.017239127,0.00032146613,0.0055926726],"study_design_scores_gemma":[0.00026114102,0.00003695741,0.33957407,0.0000128813845,0.0015108887,8.312757e-7,0.00002133083,0.6570179,0.00016761983,0.00053408777,0.00063633505,0.0002259449],"about_ca_topic_score_codex":0.0004072208,"about_ca_topic_score_gemma":0.00006406805,"teacher_disagreement_score":0.24324556,"about_ca_system_score_codex":0.000016089563,"about_ca_system_score_gemma":0.00004932692,"threshold_uncertainty_score":0.50628597},"labels":[],"label_agreement":null},{"id":"W2950434461","doi":"10.48550/arxiv.math/0512019","title":"Colorful subgraphs in Kneser-like graphs","year":2005,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Generalization; Bipartite graph; Combinatorics; Mathematics; Vertex (graph theory); Chromatic scale; Discrete mathematics; Graph","score_opus":0.03923175768553431,"score_gpt":0.2696543492115211,"score_spread":0.2304225915259868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950434461","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9846815,0.0013790958,0.008004591,0.0019728981,0.00083597575,0.00025856207,0.000036358404,0.0002836516,0.002547367],"genre_scores_gemma":[0.99342424,0.00067193416,0.003299628,0.001028741,0.00012243191,0.00006725977,0.00008185852,0.000013765328,0.0012901387],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9966155,0.0001702288,0.00065257883,0.001406577,0.00048259227,0.0006724707],"domain_scores_gemma":[0.9972601,0.00020567025,0.00027632248,0.0019258959,0.00010952333,0.00022251206],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006086536,0.00043444918,0.0007124503,0.0013331678,0.00010488933,0.0001880602,0.0035536492,0.00047241873,0.00025590137],"category_scores_gemma":[0.00017115327,0.00036563192,0.0004313727,0.0037836689,0.00015435785,0.0003574136,0.0035338206,0.001002583,0.0006127972],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000983973,0.00037508627,0.96999055,0.000033884124,0.00012359489,0.00017767993,0.00022862216,0.0005548191,0.000030479097,0.0077313012,0.0033407933,0.017403347],"study_design_scores_gemma":[0.00039054712,0.000103260856,0.9572541,0.00004799455,0.00005058455,0.000008345878,0.000030585597,0.0026686725,0.0001050857,0.015735237,0.022856845,0.00074870413],"about_ca_topic_score_codex":0.0008739087,"about_ca_topic_score_gemma":0.0005928921,"teacher_disagreement_score":0.01951605,"about_ca_system_score_codex":0.00008195638,"about_ca_system_score_gemma":0.00010140957,"threshold_uncertainty_score":0.99987954},"labels":[],"label_agreement":null},{"id":"W2950555606","doi":"10.46298/dmtcs.2909","title":"Critical Groups of Simplicial Complexes","year":2011,"lang":"fr","type":"preprint","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Simplicial complex; Abstract simplicial complex; h-vector; Mathematics; Simplicial approximation theorem; Sketch; Simplicial manifold; Simplicial homology; Abelian group; Interpretation (philosophy); Combinatorics; Simplicial set; Graph; Pure mathematics; Computer science; Algorithm","score_opus":0.04055166733370223,"score_gpt":0.300638903574668,"score_spread":0.26008723624096575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950555606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009892041,0.00026707648,0.96939313,0.0023247965,0.0019744642,0.0004839697,0.00021539566,0.00017447837,0.015274662],"genre_scores_gemma":[0.596144,0.000039394057,0.403178,0.0002416571,0.00030023154,0.000017194943,0.000016238446,0.000024314875,0.00003890907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9900862,0.00046537563,0.0022695712,0.002588503,0.0026767745,0.0019135942],"domain_scores_gemma":[0.9899972,0.0029058058,0.00080011174,0.0036845766,0.0014881272,0.0011241612],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.0043131136,0.001049585,0.0021590297,0.00085529976,0.00082003267,0.0013559409,0.011249269,0.00053313735,0.0016591214],"category_scores_gemma":[0.002618017,0.0008208185,0.000932479,0.0042894906,0.02797391,0.0011000092,0.016407741,0.0012500181,0.0004006025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015082156,0.0009105972,0.000042129137,0.00039089614,0.000088656394,0.00004736578,0.0023354944,0.00012625114,0.000314703,0.98738825,0.000110676934,0.008229902],"study_design_scores_gemma":[0.00015046263,0.0004254273,0.0005712074,0.00031461724,0.00019298695,0.00006424637,0.00006098314,0.3335372,0.0010277927,0.6628462,0.00012939185,0.0006794974],"about_ca_topic_score_codex":0.00010233223,"about_ca_topic_score_gemma":0.000005000828,"teacher_disagreement_score":0.586252,"about_ca_system_score_codex":0.00010814199,"about_ca_system_score_gemma":0.00042501988,"threshold_uncertainty_score":0.99968076},"labels":[],"label_agreement":null},{"id":"W2950926516","doi":"10.48550/arxiv.math/0311208","title":"The closed topological vertex via the Cremona transform","year":2003,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Vertex (graph theory); Topology (electrical circuits); Mathematics; Combinatorics; Computer science; Graph","score_opus":0.04290137455633065,"score_gpt":0.2654534158300039,"score_spread":0.22255204127367328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950926516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39029184,0.008876462,0.45274445,0.10322137,0.0046493243,0.0014325784,0.000071060844,0.0007363241,0.03797657],"genre_scores_gemma":[0.9932214,0.0009789106,0.0007660098,0.002276189,0.00014234112,0.0000631501,0.000021846849,0.000010435818,0.0025197195],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970411,0.00033280035,0.0005208464,0.0009204048,0.0005392215,0.00064559357],"domain_scores_gemma":[0.9965583,0.0008313202,0.00019540428,0.0021551612,0.00010308507,0.00015671227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010272489,0.000383325,0.0004535701,0.000098145996,0.00078017154,0.00034641402,0.0049060355,0.00037805884,0.00020386597],"category_scores_gemma":[0.0003483305,0.00017067687,0.0005197528,0.001093575,0.00045042924,0.00014472583,0.0014259178,0.0011557994,0.00044619138],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006698046,0.000744255,0.043587133,0.00005589871,0.0013482239,0.0002457579,0.0008205336,0.00029534884,0.0001516908,0.19784303,0.026274316,0.7285668],"study_design_scores_gemma":[0.00061851693,0.00037270598,0.32067242,0.000029853696,0.00031904463,0.00005625746,0.0001320368,0.009268066,0.00058575586,0.2961589,0.3705332,0.0012532355],"about_ca_topic_score_codex":0.00024434566,"about_ca_topic_score_gemma":0.00006763718,"teacher_disagreement_score":0.7273136,"about_ca_system_score_codex":0.00006369051,"about_ca_system_score_gemma":0.00008533446,"threshold_uncertainty_score":0.91167164},"labels":[],"label_agreement":null},{"id":"W2951887113","doi":"10.48550/arxiv.math/0502452","title":"Local chromatic number and distinguishing the strength of topological obstructions","year":2005,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Chromatic scale; Combinatorics; Mathematics; Homomorphism; Friendship graph; Critical graph; Upper and lower bounds; Graph; Vertex (graph theory); Discrete mathematics; Hierarchy; Topology (electrical circuits); Line graph; Graph power","score_opus":0.03828702917080024,"score_gpt":0.278391050894502,"score_spread":0.24010402172370177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951887113","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9206427,0.00034266026,0.07531619,0.0019199844,0.00026603043,0.000097897486,0.000027258258,0.00008871963,0.0012985943],"genre_scores_gemma":[0.992724,0.00010260577,0.0066394447,0.0001292716,0.00016929451,0.000012486091,0.000016855187,0.000004602605,0.00020144625],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9983695,0.00012299973,0.0004274828,0.0005525265,0.000268147,0.00025934636],"domain_scores_gemma":[0.9981892,0.00048128833,0.00027000654,0.0008917087,0.00007263613,0.00009512249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030024393,0.00020998079,0.00040170437,0.00007939586,0.00019644882,0.00011822998,0.0013442398,0.00019386635,0.00021002746],"category_scores_gemma":[0.0006224749,0.00012440125,0.0001568553,0.00057678146,0.00047281815,0.00012683737,0.0025980955,0.0005578141,0.000039955004],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004200334,0.00030219462,0.8244011,0.00011579511,0.00033780097,0.00004001472,0.0007915273,0.00073234626,0.00002502767,0.055306826,0.0008336817,0.11710951],"study_design_scores_gemma":[0.00014845721,0.000050637773,0.9705449,0.000056815596,0.00012692402,0.000043092194,0.00021940697,0.011783543,0.0001361475,0.014678373,0.0018862912,0.00032543656],"about_ca_topic_score_codex":0.00044583797,"about_ca_topic_score_gemma":0.00004799422,"teacher_disagreement_score":0.1461438,"about_ca_system_score_codex":0.000033853205,"about_ca_system_score_gemma":0.00003556294,"threshold_uncertainty_score":0.5072936},"labels":[],"label_agreement":null},{"id":"W2952274870","doi":"10.48550/arxiv.1310.8089","title":"Reducing complexes in multidimensional persistent homology theory","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Bishop's University","funders":"","keywords":"Discrete Morse theory; Correctness; Morse code; Mathematics; Persistent homology; Polygon mesh; Matching (statistics); Simplicial complex; Reduction (mathematics); Homology (biology); Morse theory; Algorithm; Computer science; Combinatorics; Pure mathematics; Geometry","score_opus":0.07405416942672052,"score_gpt":0.1947448019288083,"score_spread":0.12069063250208778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952274870","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7518146,0.00030639273,0.2456113,0.00027960807,0.0003635051,0.00018938644,0.000023437493,0.00012437609,0.0012874061],"genre_scores_gemma":[0.9935258,0.000117500655,0.004202158,0.00014631158,0.00003261944,0.0000013036705,0.000039908085,0.0000063429743,0.0019280385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976374,0.00036969135,0.0002470113,0.0012370824,0.00009801701,0.000410819],"domain_scores_gemma":[0.9981121,0.00035862648,0.0001915356,0.0010732645,0.000107886066,0.000156625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042562347,0.00026954216,0.00045539794,0.00077570527,0.00012236627,0.00006430353,0.0017646585,0.00027703235,0.00032942244],"category_scores_gemma":[0.00010790663,0.00025533713,0.00034583668,0.0011998456,0.00022208357,0.00026116922,0.003647266,0.0005894644,0.0002567835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001926372,0.00025467426,0.0025169214,0.000024955874,0.00017952271,0.00045371134,0.00020389196,0.23512502,0.000042212414,0.75870115,0.0006413756,0.0018373202],"study_design_scores_gemma":[0.00069288537,0.00012144603,0.019102868,0.00007709092,0.00012922513,0.000021410615,0.00030178577,0.7529397,0.000037764923,0.22494942,0.0008400965,0.0007863166],"about_ca_topic_score_codex":0.0012000998,"about_ca_topic_score_gemma":0.000032987573,"teacher_disagreement_score":0.5337517,"about_ca_system_score_codex":0.00017241602,"about_ca_system_score_gemma":0.00008444628,"threshold_uncertainty_score":0.99998987},"labels":[],"label_agreement":null},{"id":"W2953482213","doi":"10.1016/j.neuroimage.2019.06.044","title":"Topology highlights mesoscopic functional equivalence between imagery and perception: The case of hypnotizability","year":2019,"lang":"en","type":"article","venue":"NeuroImage","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Office of Fossil Energy","keywords":"Corollary; Perception; Psychology; Cognitive psychology; Persistent homology; Electroencephalography; Sensory system; Cognition; Neuroimaging; Mental image; Motor imagery; Topological data analysis; Neuroscience; Computer science; Pure mathematics; Mathematics","score_opus":0.027003241653105733,"score_gpt":0.2602192281321953,"score_spread":0.23321598647908953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953482213","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96714586,0.00007853814,0.026791232,0.0046802983,0.00021391307,0.00011057598,0.000020335965,0.00004296198,0.00091631385],"genre_scores_gemma":[0.9976864,0.000020323985,0.0015504503,0.00027502287,0.00007643286,0.0000029586731,0.0000040372834,0.0000025233687,0.00038184726],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9987938,0.00018057933,0.00022748086,0.0004568784,0.00015566305,0.00018562059],"domain_scores_gemma":[0.9984548,0.0006316466,0.00008624973,0.0007007043,0.000063960826,0.00006264807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032225702,0.0001056955,0.00021606531,0.00010035096,0.00011743963,0.0000545052,0.00046219895,0.000047290858,0.00045919823],"category_scores_gemma":[0.000096696,0.00006475626,0.0000707349,0.00058839686,0.00028307343,0.00032781536,0.00048189377,0.00014430814,0.00008739421],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005927282,0.00057296123,0.5384102,0.00029564672,0.0002189286,0.0017327949,0.00097468623,0.00009244194,0.026018675,0.17377473,0.0074296175,0.25042003],"study_design_scores_gemma":[0.00026078714,0.00023754712,0.9883527,0.000003610773,0.000039650356,0.00040080256,0.000054049706,0.0013756033,0.00041500217,0.0064668395,0.0022459135,0.00014749372],"about_ca_topic_score_codex":0.00012411871,"about_ca_topic_score_gemma":0.0000036976867,"teacher_disagreement_score":0.4499425,"about_ca_system_score_codex":0.000009796652,"about_ca_system_score_gemma":0.000018665356,"threshold_uncertainty_score":0.50278986},"labels":[],"label_agreement":null},{"id":"W2955067198","doi":"","title":"Lorentzian Distance Learning for Hyperbolic Representations","year":2019,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.03603241555476244,"score_gpt":0.3178020778446282,"score_spread":0.2817696622898658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955067198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039823107,0.00006392193,0.8982388,0.007968049,0.00066686305,0.00023116327,0.000022766855,0.00027324836,0.052712105],"genre_scores_gemma":[0.9803573,0.00004219963,0.0043814755,0.00023887391,0.00007862233,0.000026045711,0.00016931035,0.000007537993,0.014698638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860805,0.000082541555,0.00022774136,0.0004952483,0.00036463593,0.00022176368],"domain_scores_gemma":[0.9990347,0.00028786768,0.00015839782,0.00026132583,0.00018483619,0.000072887815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002426104,0.0001358853,0.00017367778,0.00027097706,0.00016109942,0.00027770325,0.0009742543,0.000044614007,0.0008676319],"category_scores_gemma":[0.0005272485,0.000115933646,0.000117268704,0.00041975293,0.000029204248,0.00036487752,0.00020426916,0.00036421404,0.0004343585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030122266,0.00006835203,0.07094129,0.000006068112,0.00007002683,0.000004816329,0.00016668688,0.017696759,0.0004860332,0.85128486,0.000117742384,0.05912722],"study_design_scores_gemma":[0.0005182434,0.00022507126,0.013292316,0.000023146711,0.0000083887835,0.0000049244886,0.00010152523,0.8921545,0.00010899518,0.009468938,0.08386598,0.00022796945],"about_ca_topic_score_codex":0.00011107132,"about_ca_topic_score_gemma":0.000016399827,"teacher_disagreement_score":0.9405342,"about_ca_system_score_codex":0.000039062117,"about_ca_system_score_gemma":0.000025274208,"threshold_uncertainty_score":0.9499961},"labels":[],"label_agreement":null},{"id":"W2962995814","doi":"10.1016/j.aim.2017.10.034","title":"Spectral analysis of random-to-random Markov chains","year":2017,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Markov chain; Eigenvalues and eigenvectors; Random field; Examples of Markov chains; Variable-order Markov model; Markov process; Combinatorics; Pure mathematics; Markov model; Statistics","score_opus":0.016088672479340753,"score_gpt":0.30458676398371987,"score_spread":0.2884980915043791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962995814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038693566,0.00042714388,0.9505886,0.00046962703,0.0001178869,0.00014469643,0.000020512562,0.0000313282,0.009506651],"genre_scores_gemma":[0.81159437,0.00046728054,0.18733096,0.00005992123,0.000022331094,0.000012596888,0.0000037737532,0.000003782568,0.0005049921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869055,0.000034348024,0.00043405013,0.00029030605,0.00030772202,0.00024303359],"domain_scores_gemma":[0.997803,0.0004566461,0.00032573822,0.0012887768,0.000049112874,0.000076768854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000652733,0.00012439405,0.0006586898,0.0006533023,0.00011166467,0.00010223165,0.0018577458,0.000038876155,0.000083595995],"category_scores_gemma":[0.0010893852,0.00009055841,0.0002164754,0.0017839874,0.000099922785,0.0005494838,0.0003705534,0.000079581645,0.000018873901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001474708,0.0014775448,0.051266793,0.0002410999,0.0017309663,0.00011959249,0.0033514164,0.024922693,0.0002088068,0.6196204,0.00020440346,0.2967088],"study_design_scores_gemma":[0.0045321705,0.00020511434,0.08421292,0.00011232385,0.0010069787,0.000005832989,0.00027381146,0.6845617,0.00088210625,0.21871747,0.0046850853,0.0008044208],"about_ca_topic_score_codex":0.000027179167,"about_ca_topic_score_gemma":0.00016865562,"teacher_disagreement_score":0.7729008,"about_ca_system_score_codex":0.000017715585,"about_ca_system_score_gemma":0.000009835646,"threshold_uncertainty_score":0.36928648},"labels":[],"label_agreement":null},{"id":"W2963119423","doi":"10.20382/jocg.v8i2a4","title":"Minimum cycle and homology bases of surface-embedded graphs","year":2017,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; National Science Foundation","keywords":"Cycle basis; Mathematics; Combinatorics; Homology (biology); Basis (linear algebra); Minimum weight; Graph; Discrete mathematics; Line graph; Graph power; Geometry","score_opus":0.012965189556991682,"score_gpt":0.23298692041010693,"score_spread":0.22002173085311524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963119423","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87094307,0.00014387768,0.12646078,0.0008462792,0.00017410553,0.000030617484,0.000019298415,0.0000095418945,0.001372412],"genre_scores_gemma":[0.97353137,0.00008624156,0.02603737,0.00006274862,0.000024335402,1.601152e-8,0.0000026092496,0.000002484768,0.00025284858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9988829,0.000091082504,0.00030283595,0.0001930432,0.0003727267,0.00015744388],"domain_scores_gemma":[0.9978304,0.0004602655,0.0008164295,0.0002884603,0.0004542263,0.00015020989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033315993,0.00010986071,0.00036416814,0.0011011059,0.00024535749,0.00009318297,0.0012008769,0.00007009265,0.00004788245],"category_scores_gemma":[0.00022865445,0.00009831235,0.00017982784,0.0009604903,0.00027983374,0.00085361575,0.0004211469,0.00014808754,0.000003147999],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045601765,0.0014041085,0.19035111,0.00012484365,0.0019687042,0.0023990658,0.00056975434,0.1707972,0.0010594301,0.5486358,0.004301602,0.077932365],"study_design_scores_gemma":[0.0061367764,0.0021479062,0.78668404,0.00011134961,0.00044926337,0.0007660716,0.0007225183,0.052644014,0.00093951734,0.13077234,0.017737266,0.00088892423],"about_ca_topic_score_codex":0.000038116046,"about_ca_topic_score_gemma":0.0000023766333,"teacher_disagreement_score":0.5963329,"about_ca_system_score_codex":0.000025014338,"about_ca_system_score_gemma":0.000090737965,"threshold_uncertainty_score":0.40090612},"labels":[],"label_agreement":null},{"id":"W2963121792","doi":"10.1090/s0002-9939-2010-10596-8","title":"The threshold function for vanishing of the top homology group of random 𝑑-complexes","year":2010,"lang":"lv","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Universität Bremen","keywords":"Homology (biology); Group (periodic table); Mathematics; Function (biology); Pure mathematics; Combinatorics; Genetics; Biology; Physics; Quantum mechanics; Gene","score_opus":0.013845724300505867,"score_gpt":0.24818573606971892,"score_spread":0.23434001176921304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963121792","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9524283,0.00018104857,0.03719224,0.0077967956,0.0004437324,0.00089740154,0.00006382566,0.000031993477,0.00096465996],"genre_scores_gemma":[0.98452616,0.00004966759,0.014804131,0.00029086662,0.00010635255,0.00003421419,7.109083e-7,0.000012219357,0.0001757049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975954,0.000031365435,0.00086079934,0.0003946583,0.0006760733,0.0004417024],"domain_scores_gemma":[0.9949979,0.0020600334,0.0018037239,0.00060067745,0.0004631386,0.000074499294],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0021075995,0.00023915738,0.00084881316,0.000033416312,0.0005398925,0.00011763536,0.0032495637,0.000117166855,0.000032351152],"category_scores_gemma":[0.001985188,0.00010413683,0.001340481,0.0019505033,0.0035003182,0.00021527457,0.0013482207,0.0004947669,0.0000018272698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016523157,0.00054072414,0.006335968,0.00047341146,0.0006358178,2.6406333e-8,0.0016110367,0.000006594043,0.039834097,0.9369437,0.003686752,0.009766643],"study_design_scores_gemma":[0.0014169732,0.0007680223,0.029785857,0.00014603896,0.0010537851,0.000010704373,0.0045168092,0.022048907,0.012229728,0.92535883,0.002273847,0.00039050897],"about_ca_topic_score_codex":0.00006995026,"about_ca_topic_score_gemma":0.0000043180244,"teacher_disagreement_score":0.03209783,"about_ca_system_score_codex":0.000020333404,"about_ca_system_score_gemma":0.000039372724,"threshold_uncertainty_score":0.9992116},"labels":[],"label_agreement":null},{"id":"W2963201904","doi":"","title":"Dimensionality Reduction has Quantifiable Imperfections: Two Geometric Bounds","year":2018,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Alberta","funders":"","keywords":"Measure (data warehouse); Dimensionality reduction; Mathematical proof; Computer science; Reduction (mathematics); Lipschitz continuity; Key (lock); Curse of dimensionality; Algorithm; Mathematics; Mathematical optimization; Point (geometry); Set (abstract data type); Topology (electrical circuits); Data mining; Artificial intelligence; Combinatorics","score_opus":0.04108341971202272,"score_gpt":0.28598691689081174,"score_spread":0.244903497178789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963201904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1365322,0.0008194171,0.85055715,0.0015383137,0.0035022344,0.00039688844,0.000015861398,0.0009693666,0.0056685545],"genre_scores_gemma":[0.9975932,0.0000059964777,0.0014334613,0.00015876241,0.00027099985,0.000027299457,0.000046208934,0.0000034482064,0.0004606288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816185,0.0000833963,0.00063804793,0.00027461947,0.00053316716,0.00030889842],"domain_scores_gemma":[0.9983407,0.00005046876,0.0004046921,0.00043042874,0.00066472247,0.00010894203],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00076782424,0.00015551383,0.00021750444,0.00089374266,0.0011448022,0.0021333296,0.0005062175,0.00007855865,0.000031271647],"category_scores_gemma":[0.00024361786,0.00011934367,0.000069788024,0.0055870265,0.00015853293,0.0072813043,0.0001556167,0.00014471613,0.00039633457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000764653,0.0004309486,0.002873903,0.0006770668,0.0001721866,0.000006024821,0.0026948906,0.015005497,0.0019153222,0.095306315,0.07187714,0.80896425],"study_design_scores_gemma":[0.0005872758,0.00030106967,0.0024138882,0.00006288942,0.00003466091,0.00033181673,0.0004123943,0.8561615,0.001343454,0.0012087947,0.13665906,0.00048323197],"about_ca_topic_score_codex":0.0006526585,"about_ca_topic_score_gemma":0.0000032219339,"teacher_disagreement_score":0.861061,"about_ca_system_score_codex":0.00008858754,"about_ca_system_score_gemma":0.000086317734,"threshold_uncertainty_score":0.99890256},"labels":[],"label_agreement":null},{"id":"W2963492452","doi":"10.20382/jocg.v11i2a2","title":"Exact computation of the matching distance on 2-parameter persistence modules","year":2020,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Austrian Science Fund","keywords":"Persistence (discontinuity); Computation; Computer science; Matching (statistics); Algorithm; Mathematics; Statistics; Engineering","score_opus":0.024910838561059138,"score_gpt":0.2164718685251791,"score_spread":0.19156102996411997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963492452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24810533,0.00005838316,0.74760574,0.0036922437,0.00012369764,0.00004079085,0.000013026026,0.000012477859,0.00034828595],"genre_scores_gemma":[0.97741216,0.000014300446,0.021943916,0.00050754315,0.00004591174,3.485991e-8,0.0000022234785,0.0000032998662,0.000070636204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984118,0.00015782751,0.00034963168,0.00021482684,0.00072703586,0.00013889623],"domain_scores_gemma":[0.9981358,0.00055766065,0.0006563794,0.000152993,0.000365971,0.00013116818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020727133,0.00012334093,0.00028951935,0.0005179658,0.00013388688,0.00006180119,0.0012069435,0.0000512241,0.00001648852],"category_scores_gemma":[0.00018927269,0.00009037011,0.0003219879,0.0032088975,0.00010491278,0.00054013636,0.00023449586,0.0002720985,0.000006022785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007736773,0.0001494133,0.0020200766,0.00002960776,0.0001812893,0.0000614033,0.00043977253,0.92833996,0.0001044124,0.057119478,0.00050784607,0.010969354],"study_design_scores_gemma":[0.0041993484,0.0023618257,0.25557905,0.00042249868,0.00043597753,0.00017656806,0.0024702835,0.6491738,0.0013439867,0.062731445,0.019955928,0.0011493046],"about_ca_topic_score_codex":0.000006397291,"about_ca_topic_score_gemma":4.2854236e-7,"teacher_disagreement_score":0.7293068,"about_ca_system_score_codex":0.00006422744,"about_ca_system_score_gemma":0.00007027123,"threshold_uncertainty_score":0.36851862},"labels":[],"label_agreement":null},{"id":"W2963712264","doi":"10.20382/jocg.v4i1a6","title":"Simplicial flat norm with scale","year":2012,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation","keywords":"Simplicial approximation theorem; Simplicial homology; Simplicial complex; Mathematics; Abstract simplicial complex; Simplicial manifold; h-vector; Simplicial set; Betti number; Norm (philosophy); Combinatorics; Bounding overwatch; Discrete mathematics; Pure mathematics; Computer science","score_opus":0.009232245547067383,"score_gpt":0.20229480824700038,"score_spread":0.193062562699933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963712264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33918872,0.00009389766,0.6571289,0.00056116615,0.00018779338,0.000031121683,0.0000068217055,0.00002316807,0.00277842],"genre_scores_gemma":[0.95241135,0.000015622734,0.046691604,0.00022238372,0.00023256628,4.2810296e-8,0.0000054020034,0.0000041228755,0.00041687692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9985963,0.00006787454,0.00025168216,0.00015235307,0.00064276555,0.00028899676],"domain_scores_gemma":[0.9984903,0.00026560927,0.00035773928,0.00016520142,0.00042047436,0.00030070564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031436537,0.00013036844,0.00027600394,0.0015101797,0.00014934734,0.00007332696,0.0008498962,0.00006291478,0.00009342945],"category_scores_gemma":[0.000040260962,0.00010173493,0.00016902617,0.0039007806,0.000078939265,0.0015665955,0.0002059357,0.00021491754,0.000035416193],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000634286,0.0018505361,0.28483108,0.000054860724,0.0017501106,0.00093749544,0.0011576733,0.16756675,0.0003465574,0.38041395,0.01200826,0.14844845],"study_design_scores_gemma":[0.0059463596,0.0025355231,0.5458886,0.00008912552,0.0006188864,0.0019471467,0.0011211132,0.013238778,0.0008790863,0.014040408,0.41210812,0.001586817],"about_ca_topic_score_codex":0.000012794899,"about_ca_topic_score_gemma":0.0000025405777,"teacher_disagreement_score":0.61322266,"about_ca_system_score_codex":0.00010747327,"about_ca_system_score_gemma":0.00010393347,"threshold_uncertainty_score":0.414863},"labels":[],"label_agreement":null},{"id":"W2964314221","doi":"10.11575/cdm.v12i2.62777","title":"Shellability, vertex decomposability, and lexicographical products of graphs","year":2015,"lang":"en","type":"article","venue":"University of Calgary","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; Redeemer University","funders":"","keywords":"Lexicographical order; Combinatorics; Vertex (graph theory); Mathematics; Graph; Independence number; Product (mathematics); Discrete mathematics","score_opus":0.021023812281441068,"score_gpt":0.21077841213092124,"score_spread":0.18975459984948018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964314221","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95785546,0.000320391,0.03716684,0.0013766119,0.00007231407,0.000104819606,0.0000076177976,0.00004743238,0.0030485073],"genre_scores_gemma":[0.9789837,0.000036589772,0.020886973,0.00002200336,0.0000024451908,3.146883e-8,0.000003923892,0.0000010240232,0.00006331392],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99914503,0.00008327082,0.00012094938,0.0002962335,0.00023864147,0.00011588899],"domain_scores_gemma":[0.99907243,0.00010851106,0.00006557455,0.0004203497,0.00019127554,0.00014186656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035691768,0.00006904663,0.0002193939,0.00022606093,0.000038267946,0.000008172288,0.000596311,0.000056957895,0.000016928612],"category_scores_gemma":[0.00016713259,0.00006394164,0.000070870396,0.001235006,0.0004996484,0.00021512437,0.0006414597,0.00007230326,0.000002930588],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001404203,0.0010403278,0.52011585,0.00013633021,0.00016763978,0.000043992444,0.00097362255,0.000019123709,0.00048880395,0.37224397,0.0027032685,0.10192664],"study_design_scores_gemma":[0.0022072908,0.0012770212,0.7164844,0.000030192732,0.00016448539,0.00002819187,0.0004938754,0.010336238,0.0016111067,0.25224116,0.014581994,0.0005440033],"about_ca_topic_score_codex":0.00051317003,"about_ca_topic_score_gemma":0.000037264534,"teacher_disagreement_score":0.19636859,"about_ca_system_score_codex":0.000010485143,"about_ca_system_score_gemma":0.000050113515,"threshold_uncertainty_score":0.26074642},"labels":[],"label_agreement":null},{"id":"W2965694609","doi":"10.1007/s12346-020-00430-0","title":"Keplerian Orbits Through the Conley–Zehnder Index","year":2021,"lang":"en","type":"preprint","venue":"Qualitative Theory of Dynamical Systems","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Ellipse; Mathematics; Hamiltonian (control theory); Computation; Lagrangian; Simple (philosophy); Homotopy; Pure mathematics; Action (physics); Mathematical analysis; Physics; Geometry; Algorithm; Quantum mechanics; Mathematical optimization","score_opus":0.061492967397823596,"score_gpt":0.34798790922420403,"score_spread":0.2864949418263804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965694609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036936015,0.003319163,0.9529302,0.0014120223,0.0013295639,0.00050116604,0.00028163608,0.00012451326,0.0031657293],"genre_scores_gemma":[0.9951803,0.000057616784,0.0029412569,0.00024404404,0.00011861278,0.00008946974,0.00015508576,0.000017853765,0.0011957233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9892715,0.0070198555,0.0011868691,0.001088182,0.000952926,0.0004806423],"domain_scores_gemma":[0.9916491,0.0048627187,0.00091694633,0.0019421928,0.00049199327,0.0001370647],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0038847325,0.0004702053,0.0013055692,0.00018007756,0.00017395902,0.00040447156,0.0033461847,0.00044679164,0.00014015334],"category_scores_gemma":[0.0013307945,0.0002829771,0.0005569831,0.0014125732,0.00086362544,0.00029810154,0.002905036,0.0009062858,0.000040365787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002298367,0.00016825729,0.00003531528,0.00021974272,0.0007162564,0.000017635353,0.025172487,0.0018503878,0.000029230754,0.970146,0.00025181536,0.0013698927],"study_design_scores_gemma":[0.00052644755,0.0002104947,0.0012240016,0.00047921625,0.00019318907,0.000022873763,0.064769395,0.047580235,0.000038509777,0.8824249,0.0015480045,0.0009827535],"about_ca_topic_score_codex":0.0018323092,"about_ca_topic_score_gemma":0.000041106116,"teacher_disagreement_score":0.9582443,"about_ca_system_score_codex":0.00011201129,"about_ca_system_score_gemma":0.00017590096,"threshold_uncertainty_score":0.9999622},"labels":[],"label_agreement":null},{"id":"W2966283154","doi":"10.1002/jgt.22487","title":"On the imaginary parts of chromatic roots","year":2019,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Chromatic scale; The Imaginary; Combinatorics; Graph; Order (exchange); Discrete mathematics","score_opus":0.008522637999256006,"score_gpt":0.22397371537773708,"score_spread":0.21545107737848107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966283154","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9385926,0.0010076659,0.049792938,0.0033475375,0.00045072654,0.00007812984,0.000003264387,0.000012593331,0.0067145037],"genre_scores_gemma":[0.99868965,0.00003701419,0.00064658583,0.00042529902,0.000023109085,3.7686266e-7,1.6628302e-7,0.000001967808,0.00017583558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989447,0.00022021821,0.00030072097,0.00009060857,0.0003279016,0.00011586236],"domain_scores_gemma":[0.99814343,0.00093825854,0.0003761926,0.00040906208,0.00008440844,0.000048672704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00149308,0.00007058507,0.00021973193,0.00030622722,0.00003785772,0.000031974574,0.0010438483,0.000023556253,0.00029250226],"category_scores_gemma":[0.00021291476,0.00003324844,0.000223352,0.00085754495,0.0000864453,0.00022814663,0.00010732852,0.00015602529,0.000051992818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003316664,0.00015988012,0.0013472461,0.00001027032,0.00013048628,0.00002885575,0.00011305429,0.0001456488,0.0004696981,0.98331,0.0028302069,0.011421527],"study_design_scores_gemma":[0.00019261445,0.00049761316,0.018542558,0.00004441933,0.000030267713,0.00005623437,0.00005720608,0.00032801405,0.0005473635,0.9791038,0.0005332992,0.00006659938],"about_ca_topic_score_codex":0.0000015265617,"about_ca_topic_score_gemma":1.4149884e-7,"teacher_disagreement_score":0.060097,"about_ca_system_score_codex":0.000007174842,"about_ca_system_score_gemma":0.000020423116,"threshold_uncertainty_score":0.32026947},"labels":[],"label_agreement":null},{"id":"W2966843155","doi":"10.1088/1475-7516/2019/09/052","title":"Stochastic homology of Gaussian vs. non-Gaussian random fields: graphs towards Betti numbers and persistence diagrams","year":2019,"lang":"en","type":"article","venue":"Journal of Cosmology and Astroparticle Physics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Ministero dello Sviluppo Economico; Institut Périmètre de physique théorique; Industry Canada; Government of Canada; John Templeton Foundation","keywords":"Betti number; Euler characteristic; Persistent homology; Gaussian; Topology (electrical circuits); Random field; Minkowski space; Topological data analysis; Homology (biology)","score_opus":0.010908307634083547,"score_gpt":0.22803377142048223,"score_spread":0.2171254637863987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966843155","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74672335,0.00019732365,0.25166246,0.0011824215,0.00012912443,0.00004939269,0.0000030064114,0.0000048036136,0.000048085956],"genre_scores_gemma":[0.99549127,0.000043629614,0.0042166905,0.00018284435,0.000038562,0.0000012655672,7.974068e-7,0.0000030455071,0.000021915808],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9989069,0.00008776344,0.00036992462,0.00020513238,0.00017414577,0.0002561325],"domain_scores_gemma":[0.9989782,0.00022383667,0.00033218996,0.00021776598,0.00009630819,0.0001517105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032127707,0.00012523879,0.0004964399,0.00010811022,0.00006576799,0.00003233193,0.00036502501,0.00007190625,0.000015758336],"category_scores_gemma":[0.00006673738,0.00009061048,0.00013266987,0.00044623142,0.00029746853,0.00031012556,0.00015967243,0.00023110532,0.0000043585087],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017801161,0.0017502541,0.4302565,0.00018176221,0.0016529016,0.000373623,0.004348941,0.006525135,0.00555989,0.17841353,0.00083677884,0.36832058],"study_design_scores_gemma":[0.01398703,0.011233128,0.5223705,0.00017185434,0.0008388907,0.0015312736,0.0013615934,0.039537214,0.0071047745,0.40063336,0.00021714366,0.0010132496],"about_ca_topic_score_codex":0.00003172233,"about_ca_topic_score_gemma":0.0000035131986,"teacher_disagreement_score":0.36730734,"about_ca_system_score_codex":0.000007373475,"about_ca_system_score_gemma":0.000040261308,"threshold_uncertainty_score":0.36949882},"labels":[],"label_agreement":null},{"id":"W2978794977","doi":"10.1007/978-3-031-43587-4_19","title":"On Computing a Center Persistence Diagram","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Center (category theory); Bottleneck; Combinatorics; Reduction (mathematics); Diagram; Metric (unit); Matching (statistics); Focus (optics); Mathematics; Discrete mathematics; Computer science; Physics; Geometry","score_opus":0.03319845772222746,"score_gpt":0.25307329038396226,"score_spread":0.2198748326617348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978794977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000104088016,0.00010431519,0.9904688,0.0013863551,0.0016908341,0.00021443069,0.00001950462,0.00038082586,0.0056308354],"genre_scores_gemma":[0.7098486,0.0001981501,0.2739472,0.0092790555,0.0012405367,0.000013865449,0.00006555103,0.00010215188,0.00530489],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99489725,0.000045016644,0.00055654556,0.002175227,0.0013952387,0.00093074853],"domain_scores_gemma":[0.99626845,0.0012818619,0.00028569018,0.0017199287,0.0001826528,0.00026141026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009748369,0.0005769856,0.0006772101,0.0018757911,0.000373191,0.0007136379,0.005064568,0.0003115731,0.000043844724],"category_scores_gemma":[0.00040151385,0.00045900437,0.00030880366,0.002660307,0.00069930946,0.00037773285,0.0027314008,0.00097247923,0.0005942728],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038989483,0.00006352754,0.00009733362,0.000019137853,0.000026405205,0.0002785822,0.0002564305,0.021610115,0.000004614963,0.080461904,0.00013333382,0.8970447],"study_design_scores_gemma":[0.00037075582,0.00047566183,0.0006286638,0.0004538762,0.000018524313,0.00006096719,3.5908892e-7,0.70480704,0.000082749364,0.28996238,0.0019925646,0.0011464275],"about_ca_topic_score_codex":0.000025665253,"about_ca_topic_score_gemma":0.00004173738,"teacher_disagreement_score":0.8958983,"about_ca_system_score_codex":0.00023642267,"about_ca_system_score_gemma":0.00017190725,"threshold_uncertainty_score":0.9997862},"labels":[],"label_agreement":null},{"id":"W2990671488","doi":"10.1101/860676","title":"The Topology of Mutated Driver Pathways","year":2019,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Myeloid leukemia; Glioblastoma; Leukemia; Computational biology; Cancer; Cancer research; Biology; GRASP; Computer science; Genetics","score_opus":0.015648302221184282,"score_gpt":0.21311875183676535,"score_spread":0.19747044961558108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990671488","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7741504,0.004187893,0.2122361,0.002297325,0.004797495,0.00097508373,0.0004554356,0.0007777596,0.00012253565],"genre_scores_gemma":[0.99352264,0.00045441947,0.005656266,0.00018060317,0.00010816553,0.000037218073,2.7788425e-7,0.00002146264,0.000018925419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9971597,0.00023281686,0.0006100289,0.00097655517,0.00045940603,0.0005614565],"domain_scores_gemma":[0.9955677,0.0003773319,0.0006015274,0.0027911942,0.00049779745,0.00016446075],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080788665,0.00037856077,0.00063980697,0.00034062983,0.00019313129,0.00023476439,0.0033037958,0.0004384759,0.0000423029],"category_scores_gemma":[0.0004404557,0.00026599504,0.00026721004,0.0015887275,0.0003033476,0.00017388407,0.0026364767,0.00062216795,0.00017980897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087377644,0.0011371752,0.035351817,0.00065282994,0.0027195658,0.0004289346,0.000102896396,0.0021985103,0.28706405,0.6619285,0.007977596,0.00035077243],"study_design_scores_gemma":[0.0020381636,0.00069766043,0.5061004,0.00036019317,0.0006291291,1.1945961e-7,0.000019724592,0.033892702,0.35170773,0.0010299785,0.09968291,0.003841265],"about_ca_topic_score_codex":0.000105267965,"about_ca_topic_score_gemma":0.0000024053854,"teacher_disagreement_score":0.6608985,"about_ca_system_score_codex":0.00008626112,"about_ca_system_score_gemma":0.00035284524,"threshold_uncertainty_score":0.9999792},"labels":[],"label_agreement":null},{"id":"W2991014666","doi":"10.1090/conm/739","title":"Probabilistic Methods in Geometry, Topology and Spectral Theory","year":2019,"lang":"en","type":"book","venue":"Contemporary mathematics - American Mathematical Society","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Topology (electrical circuits); Probabilistic logic; Geometry and topology; Geometry; Algebra over a field; Pure mathematics; Combinatorics; Statistics","score_opus":0.03622992020155609,"score_gpt":0.3184341090837138,"score_spread":0.2822041888821577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991014666","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024325246,0.002117191,0.7683272,0.0008281079,0.00016896361,0.0012667568,0.00005982521,0.00026682997,0.22672191],"genre_scores_gemma":[0.001476468,0.0004103045,0.81799054,0.0009167403,0.00015062708,0.00016750739,0.00007493406,0.00010591848,0.17870694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951427,0.0004817568,0.0015492154,0.0013703075,0.0006525681,0.0008034554],"domain_scores_gemma":[0.9882866,0.008396469,0.0010186263,0.0018517136,0.0001038684,0.0003427023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0034468044,0.00083790376,0.0027503453,0.0004335106,0.00011328855,0.0002536492,0.0020533476,0.0005135607,0.0003197486],"category_scores_gemma":[0.001669308,0.0006467531,0.0007583737,0.0014908911,0.0017607549,0.00032197958,0.001576312,0.0011521307,0.0002510838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006017635,0.00040404248,0.000028854274,0.0010140613,0.00034708387,0.000034928693,0.0013773502,0.000004004035,0.000006480154,0.9783041,0.007312889,0.011160171],"study_design_scores_gemma":[0.0003734121,0.00030273615,0.00006482659,0.00022742874,0.000121933896,0.00004089642,0.00042308573,0.01705792,0.0000069646167,0.96547246,0.015064067,0.00084425457],"about_ca_topic_score_codex":0.00002000125,"about_ca_topic_score_gemma":0.0000019854212,"teacher_disagreement_score":0.049663406,"about_ca_system_score_codex":0.00028428517,"about_ca_system_score_gemma":0.0004685107,"threshold_uncertainty_score":0.9995984},"labels":[],"label_agreement":null},{"id":"W2991808555","doi":"10.7554/elife.49298","title":"Differences in topological progression profile among neurodegenerative diseases from imaging data","year":2019,"lang":"en","type":"article","venue":"eLife","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Canadian Institutes of Health Research; Horizon 2020 Framework Programme; National Institutes of Health; Genentech; IXICO; H. Lundbeck A/S; Servier; Eisai; Agence Nationale de la Recherche; Weston Brain Institute; National Institute on Aging; National Institute for Health and Care Research; Northern California Institute for Research and Education; BioClinica; Biogen; Pfizer; Novartis Pharmaceuticals Corporation; Alzheimer's Association; Université Côte d’Azur; Eli Lilly and Company; Bristol-Myers Squibb; University College London Hospitals NHS Foundation Trust; Janssen Alzheimer Immunotherapy Research And Development; European Commission; Alzheimer's Disease Neuroimaging Initiative; Meso Scale Diagnostics; Michael J. Fox Foundation for Parkinson's Research","keywords":"Cohort; Disease; Neurodegeneration; Atrophy; Topological data analysis; Topology (electrical circuits); Biology; Neuroscience; Medicine; Pathology; Computer science; Mathematics; Algorithm","score_opus":0.030257045560164106,"score_gpt":0.28161592059662893,"score_spread":0.2513588750364648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991808555","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9860805,0.00072386296,0.011237079,0.00093158305,0.00022934465,0.00016199193,0.00016109389,0.00010357507,0.000370956],"genre_scores_gemma":[0.9946914,0.000034446002,0.0045680865,0.00027804036,0.000071199356,0.0000125489205,0.00020491326,0.0000025976447,0.00013677703],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9983113,0.0001477384,0.00020416988,0.0007462004,0.00034851945,0.00024207395],"domain_scores_gemma":[0.99865663,0.00020523355,0.000079161924,0.0009302684,0.00002767192,0.00010103825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013712092,0.00012349423,0.00023737275,0.00012007133,0.000059926424,0.00016852705,0.0017678413,0.00003575404,0.00036612965],"category_scores_gemma":[0.00019779312,0.00007640959,0.000035463676,0.00072501437,0.00008314211,0.00075262744,0.0016628852,0.0001350159,0.00015428042],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040336654,0.000108024826,0.9761261,0.0000014794423,0.000006531308,0.00002836742,0.000039720257,0.0000041288135,0.00005442971,0.0011691605,0.0007250909,0.02173293],"study_design_scores_gemma":[0.00016244929,0.000038040795,0.91392344,0.000013172672,0.0000064891524,4.4150244e-7,0.00004102584,0.0844427,0.00022279377,0.000585316,0.00042788792,0.00013624257],"about_ca_topic_score_codex":0.00025240862,"about_ca_topic_score_gemma":0.000029354156,"teacher_disagreement_score":0.08443857,"about_ca_system_score_codex":0.000010972986,"about_ca_system_score_gemma":0.000023147204,"threshold_uncertainty_score":0.4008863},"labels":[],"label_agreement":null},{"id":"W2996235808","doi":"10.1142/9789813141704_0044","title":"SPIN TQFTS AND FERMIONIC PHASES OF MATTER","year":2016,"lang":"en","type":"article","venue":"","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Spin (aerodynamics); Physics; Condensed matter physics; Thermodynamics","score_opus":0.01466481204746566,"score_gpt":0.25334731251488213,"score_spread":0.23868250046741646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996235808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4197774,0.00022001106,0.56201816,0.010248198,0.000059462818,0.000039459257,0.00000621745,0.00005244096,0.0075786803],"genre_scores_gemma":[0.992207,0.00003157051,0.0032806178,0.00035113838,0.0000074336353,7.8786627e-7,2.3924397e-7,5.99901e-7,0.0041206516],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99959975,0.000010776419,0.000090344176,0.00014248984,0.00007363694,0.00008301397],"domain_scores_gemma":[0.9996413,0.00007371698,0.000025439955,0.00020667652,0.000016689371,0.000036169862],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006329715,0.000037002985,0.000083084175,0.00008664186,0.000015437805,0.000016279171,0.00024035168,0.000015181588,0.0011041624],"category_scores_gemma":[0.000028455555,0.000016618098,0.00002427539,0.00030407016,0.00004382692,0.00017589281,0.00016942898,0.000010053746,0.00012175399],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052183827,0.00017241192,0.07211107,0.000009658469,0.000053597945,0.000011052692,0.000029935194,5.516891e-7,0.0044770245,0.25285807,0.015925573,0.65434587],"study_design_scores_gemma":[0.0020620734,0.0006368992,0.7455923,0.000057942612,0.000055725064,0.000056066634,0.000028191775,0.0007826725,0.05727577,0.14237995,0.05036332,0.00070908974],"about_ca_topic_score_codex":0.000033010278,"about_ca_topic_score_gemma":0.000002875147,"teacher_disagreement_score":0.6734812,"about_ca_system_score_codex":0.000002517025,"about_ca_system_score_gemma":0.0000038105472,"threshold_uncertainty_score":0.99980897},"labels":[],"label_agreement":null},{"id":"W2997214582","doi":"10.4153/s0008439520000454","title":"Relative vertex asphericity","year":2020,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vertex (graph theory); Generalization; Diagrammatic reasoning; Injective function; Combinatorics; Mathematics; Computer science; Graph; Mathematical analysis; Programming language","score_opus":0.021862138007078875,"score_gpt":0.20307922900367442,"score_spread":0.18121709099659555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997214582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002257914,0.00009943065,0.7144296,0.16018285,0.000051677107,0.00013784487,0.000022243445,0.00016787024,0.122650534],"genre_scores_gemma":[0.9318591,0.000005404487,0.045951396,0.020159602,0.000057665493,0.000011450987,0.0000072943035,0.000007685744,0.0019404396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99886,0.000053783377,0.00020299746,0.000339569,0.00019483877,0.00034878709],"domain_scores_gemma":[0.99836546,0.00022645891,0.000037883972,0.00031307476,0.000040592553,0.0010165194],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00014430852,0.00011741603,0.00022453985,0.00006187492,0.00010315495,0.00010375807,0.00084205205,0.00007333494,0.017479973],"category_scores_gemma":[0.0012974516,0.00009282362,0.00009221127,0.0009420461,0.00006860115,0.00008950316,0.00013869372,0.00017268557,0.037889656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010730461,0.000019656218,0.000042014268,0.000010688639,0.000027879752,0.000102253965,0.00021025962,0.000007709353,0.0000057096318,0.9244309,0.06862748,0.006514369],"study_design_scores_gemma":[0.00020831556,0.0001237248,0.00061283284,0.000012475836,0.000026200427,0.000012840915,0.000057417852,0.018213106,0.00004742219,0.16685122,0.8134723,0.00036219007],"about_ca_topic_score_codex":0.0006361643,"about_ca_topic_score_gemma":0.00010361713,"teacher_disagreement_score":0.92960113,"about_ca_system_score_codex":0.000051390925,"about_ca_system_score_gemma":0.000078521334,"threshold_uncertainty_score":0.98341817},"labels":[],"label_agreement":null},{"id":"W3006798337","doi":"10.1007/978-3-030-41258-6_30","title":"Classifying Discrete Structures by Their Stabilizers","year":2020,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Thesaurus; Information retrieval; Artificial intelligence","score_opus":0.044780773188207126,"score_gpt":0.2818069300396792,"score_spread":0.2370261568514721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006798337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030753403,0.0009028716,0.84615326,0.005691623,0.00019225513,0.00026002023,0.00015397185,0.00014454284,0.1464707],"genre_scores_gemma":[0.5478621,0.01584161,0.41998658,0.012225425,0.00013067717,0.00005955599,0.0011075364,0.0000305886,0.002755913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983872,0.000033048174,0.00058248173,0.00035745944,0.00042294196,0.0002168396],"domain_scores_gemma":[0.9972802,0.00025023945,0.0002988174,0.00184252,0.00016913917,0.00015910272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005232955,0.000224658,0.00029681003,0.0007237108,0.0004500749,0.0008490802,0.004851808,0.00011092305,0.000020778461],"category_scores_gemma":[0.00007892222,0.0001763222,0.000065635584,0.0009890937,0.000986928,0.0054918933,0.0040073125,0.00045872203,0.00002927166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.593073e-7,0.0000043047053,0.00002332853,0.000009105783,0.000007452877,1.9012715e-7,0.00054754945,0.000043021166,0.000002399766,0.7796754,0.0009996119,0.21868674],"study_design_scores_gemma":[0.00020939905,0.00007046503,0.00051577884,0.00004470766,0.000008647472,0.0000085050715,0.00005406125,0.2785572,0.000016484577,0.07302455,0.6470482,0.00044202083],"about_ca_topic_score_codex":0.000012675066,"about_ca_topic_score_gemma":0.0000036274846,"teacher_disagreement_score":0.7066509,"about_ca_system_score_codex":0.00008513832,"about_ca_system_score_gemma":0.00012638865,"threshold_uncertainty_score":0.90159464},"labels":[],"label_agreement":null},{"id":"W3008716181","doi":"10.1007/s11571-020-09574-w","title":"Removing uncertainty in neural networks","year":2020,"lang":"en","type":"article","venue":"Cognitive Neurodynamics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Morphing; Manifold (fluid mechanics); Reciprocal; Artificial neural network; Artificial intelligence; Euclidean geometry; Topology (electrical circuits); Mathematics","score_opus":0.022431222012583036,"score_gpt":0.24172210976021324,"score_spread":0.2192908877476302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008716181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20526949,0.00014351055,0.78889894,0.0039793514,0.00023278428,0.00013185901,0.00001774031,0.00017784574,0.0011484646],"genre_scores_gemma":[0.99274576,0.000036482106,0.0004420023,0.0066512283,0.000065839864,0.000004016222,0.00002547867,0.000005981971,0.000023192468],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986205,0.00012259251,0.00022445078,0.0005424301,0.00017313298,0.00031686653],"domain_scores_gemma":[0.9992008,0.00031929588,0.000069794376,0.00018604164,0.00007115223,0.00015292208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011293232,0.00014053284,0.00021093024,0.00012955633,0.000062970925,0.00010660626,0.0006707497,0.000054890264,0.000017821381],"category_scores_gemma":[0.0008924237,0.0001239891,0.00008127829,0.0024370695,0.000060683797,0.00029625138,0.0005113805,0.00033301505,0.000025382536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080422156,0.00019525994,0.03570039,0.000019777595,0.000043534732,0.0013242385,0.00044799433,0.1909561,0.00005945174,0.013709584,0.000311445,0.7571518],"study_design_scores_gemma":[0.00023970075,0.00008760446,0.031105438,0.000004572006,0.000008328046,0.0000053952967,0.00003364163,0.9679184,0.0000014757444,0.00029809363,0.00015707174,0.00014028783],"about_ca_topic_score_codex":0.000029260758,"about_ca_topic_score_gemma":0.000032665288,"teacher_disagreement_score":0.788457,"about_ca_system_score_codex":0.000017911796,"about_ca_system_score_gemma":0.000013932982,"threshold_uncertainty_score":0.50561285},"labels":[],"label_agreement":null},{"id":"W3014913653","doi":"10.17713/ajs.v49i2.907","title":"Fast Approximate Complete-data k-nearest-neighbor Estimation","year":2020,"lang":"en","type":"article","venue":"Austrian Journal of Statistics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Nearest neighbor graph; k-nearest neighbors algorithm; Nearest-neighbor chain algorithm; Best bin first; Nearest neighbor search; Intrinsic dimension; Graph; Sorting; Data set; Set (abstract data type); Dimension (graph theory); Mathematics; Fixed-radius near neighbors; Nearest neighbour algorithm; Large margin nearest neighbor; Manifold (fluid mechanics); Algorithm; Computer science; Combinatorics; Data mining; Statistics; Artificial intelligence; Cluster analysis; Curse of dimensionality","score_opus":0.11148355364176016,"score_gpt":0.2919919520773583,"score_spread":0.18050839843559813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014913653","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029586695,0.000062964056,0.9937415,0.004680013,0.00015692861,0.00004701146,0.00092836673,0.00002205922,0.00006525229],"genre_scores_gemma":[0.2637072,0.000045753433,0.73547083,0.00045625796,0.00017098634,3.3206703e-7,0.00011846541,0.000005660219,0.000024499064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841326,0.00008746627,0.0005895517,0.00023457113,0.00047083458,0.00020432394],"domain_scores_gemma":[0.99817365,0.00034234807,0.0005218839,0.00045040954,0.00021883943,0.00029286896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039898432,0.00011968209,0.0003173033,0.00014154406,0.000086063934,0.00023194085,0.002002894,0.00004178655,0.00013863758],"category_scores_gemma":[0.0016480723,0.000091619106,0.000047008045,0.0009885879,0.00006679134,0.0006348512,0.00044806302,0.00024472337,0.0000791204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007208405,0.00021672052,0.0018730513,0.00007223575,0.000348038,0.0010338211,0.0004974827,0.008073506,0.0001129827,0.12232533,0.14372326,0.7216515],"study_design_scores_gemma":[0.00088431005,0.00060189015,0.0032829405,0.000020407864,0.0001321964,0.00007556616,0.00008635376,0.9678012,0.000045104563,0.01036496,0.016468178,0.00023685525],"about_ca_topic_score_codex":0.000009030599,"about_ca_topic_score_gemma":0.0000014807708,"teacher_disagreement_score":0.9597277,"about_ca_system_score_codex":0.000018649142,"about_ca_system_score_gemma":0.00008365681,"threshold_uncertainty_score":0.3736119},"labels":[],"label_agreement":null},{"id":"W3018013674","doi":"10.3389/fncom.2020.00034","title":"Topological View of Flows Inside the BOLD Spontaneous Activity of the Human Brain","year":2020,"lang":"en","type":"article","venue":"Frontiers in Computational Neuroscience","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Topology (electrical circuits); Functional magnetic resonance imaging; Resting state fMRI; Blood-oxygen-level dependent; Computer science; Persistent homology; Brain activity and meditation; Topological data analysis; Betti number; Artificial intelligence; Computer vision; Mathematics; Psychology; Algorithm; Electroencephalography; Neuroscience; Pure mathematics","score_opus":0.03227489643239082,"score_gpt":0.2631923044446767,"score_spread":0.23091740801228586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3018013674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46659732,0.00008744767,0.5107756,0.021781173,0.00041070217,0.0001611452,0.000019925374,0.000021931055,0.0001447289],"genre_scores_gemma":[0.985803,0.0000062650265,0.010732132,0.0034150188,0.000015800371,0.00000286027,7.381856e-7,0.0000018122164,0.000022350045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983194,0.00026454896,0.00029372002,0.00038526385,0.0005531639,0.0001839327],"domain_scores_gemma":[0.99900854,0.00038258656,0.00018586857,0.0003123057,0.00005208299,0.000058612433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035237236,0.000100060395,0.00023760875,0.00008717892,0.0001744947,0.0000383474,0.0021100359,0.000029251838,0.000008106454],"category_scores_gemma":[0.0007704414,0.000055480108,0.000110587804,0.0026687265,0.0005044723,0.00019003481,0.00065067137,0.00019718539,9.4798077e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007939794,0.0011329224,0.05897458,0.00009447484,0.000038940998,0.00039663163,0.001410429,0.56591654,0.028401555,0.23450176,0.013247369,0.09580539],"study_design_scores_gemma":[0.0002537052,0.00025496577,0.31483936,0.000011584982,0.000008173447,0.000054975917,0.000033697164,0.6495426,0.00076089497,0.031026317,0.0030526083,0.00016106073],"about_ca_topic_score_codex":0.000029929755,"about_ca_topic_score_gemma":0.000005290926,"teacher_disagreement_score":0.5192057,"about_ca_system_score_codex":0.00001654091,"about_ca_system_score_gemma":0.0000628271,"threshold_uncertainty_score":0.39210066},"labels":[],"label_agreement":null},{"id":"W3023942632","doi":"10.1007/s00500-020-04945-1","title":"RETRACTED ARTICLE: Fuzzy hyperconnected proximity spaces and fuzzy summability over CW complexes. Application of Smirnov fuzzy similarity in video analysis","year":2020,"lang":"en","type":"article","venue":"Soft Computing","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":true,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Centroid; Topology (electrical circuits); Similarity (geometry); Space (punctuation); Fuzzy logic; Path (computing); Triangulation; Closure (psychology); Image (mathematics); Pure mathematics; Combinatorics; Computer science; Artificial intelligence; Geometry","score_opus":0.020689833684774978,"score_gpt":0.2594284365589162,"score_spread":0.2387386028741412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023942632","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80317193,0.00012786452,0.19444692,0.00155745,0.000024628449,0.00029258712,0.000028106233,0.00017272052,0.00017776486],"genre_scores_gemma":[0.9844445,0.000006574502,0.015080748,0.00036241568,0.0000516148,0.000006355617,0.000039253533,0.00000635657,0.0000021811975],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9970279,0.00030052397,0.00077478116,0.0010137114,0.00046269112,0.00042040885],"domain_scores_gemma":[0.9976563,0.00084529124,0.00038541786,0.00067144836,0.00021482033,0.00022676581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010462739,0.00024571232,0.0007640776,0.0003983085,0.0001593534,0.00015557416,0.0007709666,0.00018324748,0.000015601889],"category_scores_gemma":[0.0013228774,0.00022166816,0.0001842846,0.008817364,0.0002037318,0.0005381743,0.00079627574,0.00046169604,0.0000059002177],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036511225,0.0003292549,0.92865527,0.0000882489,0.00024747849,0.000008251496,0.0007921281,0.0028890646,0.0031687643,0.007073843,0.000046524612,0.05666468],"study_design_scores_gemma":[0.00033077275,0.0000544319,0.6553333,0.000006868655,0.00010604257,0.0000010834656,0.00006661851,0.33872202,0.00037095492,0.004723058,0.00008619823,0.00019865793],"about_ca_topic_score_codex":0.0011046949,"about_ca_topic_score_gemma":0.0003643378,"teacher_disagreement_score":0.33583295,"about_ca_system_score_codex":0.00005471716,"about_ca_system_score_gemma":0.00003796401,"threshold_uncertainty_score":0.9039365},"labels":[],"label_agreement":null},{"id":"W3026760178","doi":"10.1109/isbi45749.2020.9098337","title":"Modeling the Topology of Cerebral Microvessels Via Geometric Graph Contraction","year":2020,"lang":"en","type":"article","venue":"","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Skeletonization; Topology (electrical circuits); Computer science; Microvessel; Binary number; Discretization; Graph; Algorithm; Contraction (grammar); Mathematics; Artificial intelligence; Theoretical computer science; Combinatorics; Mathematical analysis","score_opus":0.02660112018943711,"score_gpt":0.24063555295796063,"score_spread":0.21403443276852352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026760178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035212178,0.00021565359,0.95359164,0.009989763,0.00009077513,0.000055926343,0.000003403673,0.00005850274,0.00078213797],"genre_scores_gemma":[0.99156076,0.000033390203,0.006401098,0.001898594,0.000042805183,0.000002200384,0.000003072494,0.000001873244,0.000056238292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990626,0.000055884193,0.0002549995,0.00027083827,0.00017091705,0.00018478114],"domain_scores_gemma":[0.999306,0.00017388677,0.0000743689,0.00029409843,0.00007614253,0.00007550655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018734597,0.00008238012,0.00019564097,0.00023185698,0.00007788696,0.00004271842,0.0008492733,0.00005275094,0.00016761075],"category_scores_gemma":[0.00017206307,0.00004672949,0.000118840064,0.0036348458,0.000056819554,0.00026295,0.00023502484,0.00011867112,0.00003764677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006723198,0.0005235518,0.0061802976,0.000050615912,0.0006179734,0.000026529142,0.00087950553,0.05893225,0.013727116,0.5281067,0.0058124075,0.3850758],"study_design_scores_gemma":[0.0003137218,0.00020005963,0.0014456422,0.0000011773753,0.0000416751,0.000011763638,0.00012277413,0.97658044,0.004761107,0.014812611,0.0015388359,0.00017020477],"about_ca_topic_score_codex":0.00046179906,"about_ca_topic_score_gemma":0.000010491308,"teacher_disagreement_score":0.95634854,"about_ca_system_score_codex":0.0000060781326,"about_ca_system_score_gemma":0.000012010776,"threshold_uncertainty_score":0.19055733},"labels":[],"label_agreement":null},{"id":"W3027306383","doi":"10.1162/neco_a_01289","title":"Shapley Homology: Topological Analysis of Sample Influence for Neural Networks","year":2020,"lang":"en","type":"article","venue":"Neural Computation","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Persistent homology; Topological data analysis; Simplicial complex; Betti number; Homology (biology); Mathematics; Entropy (arrow of time); Metric space; Computer science; Theoretical computer science; Topology (electrical circuits); Algorithm; Discrete mathematics; Combinatorics","score_opus":0.044829975127109914,"score_gpt":0.2954383192714988,"score_spread":0.2506083441443889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027306383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38049093,0.000045105033,0.6170772,0.0021396107,0.00004593105,0.00009013507,0.000030775725,0.00007288511,0.000007436335],"genre_scores_gemma":[0.9746248,0.000004362599,0.023005709,0.002184941,0.000046325305,0.00001000511,0.00011884904,0.0000029497398,0.0000020173904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985932,0.000107397995,0.00038884854,0.00046797685,0.00019657033,0.0002459958],"domain_scores_gemma":[0.9981431,0.0011716938,0.0002015899,0.00019445118,0.00016609246,0.00012307588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014591016,0.00013144873,0.0004182263,0.00025717524,0.00010094111,0.00006781938,0.00066634186,0.000083098246,0.000026701107],"category_scores_gemma":[0.00069452607,0.00010432346,0.00026824806,0.003957678,0.000090423295,0.00029288224,0.00023961975,0.00011980918,0.000002112047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023455046,0.00003318662,0.01231179,0.0000056675935,0.00014269417,0.0000038056044,0.00008050278,0.9532923,0.000045418106,0.006356319,0.00011187732,0.02759299],"study_design_scores_gemma":[0.00016998411,0.00035543722,0.06212686,5.406636e-7,0.00018278428,0.0000012048129,0.00000961834,0.93454343,0.00002275989,0.0024181388,0.000062770814,0.00010644822],"about_ca_topic_score_codex":0.00012645821,"about_ca_topic_score_gemma":0.000016299944,"teacher_disagreement_score":0.5941339,"about_ca_system_score_codex":0.000011383567,"about_ca_system_score_gemma":0.000008518817,"threshold_uncertainty_score":0.4254187},"labels":[],"label_agreement":null},{"id":"W3035504622","doi":"10.24963/ijcai.2020/612","title":"BitcoinHeist: Topological Data Analysis for Ransomware Prediction on the Bitcoin Blockchain","year":2020,"lang":"en","type":"article","venue":"","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Division of Electrical, Communications and Cyber Systems; Natural Sciences and Engineering Research Council of Canada; National Institutes of Health; National Science Foundation","keywords":"Ransomware; Cryptocurrency; Computer science; Hacker; Computer security; Payment; Cryptography; Ransom; Heuristics; Asset (computer security); Malware; Operating system; World Wide Web","score_opus":0.1491455436113459,"score_gpt":0.2869107010583967,"score_spread":0.1377651574470508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035504622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003329284,0.000050654937,0.92024016,0.07454755,0.00006571211,0.0002194802,0.0004820958,0.0002476115,0.00081745576],"genre_scores_gemma":[0.9703741,0.000017445169,0.017231505,0.011418904,0.00018807693,0.000034351742,0.00027161252,0.0000045649535,0.00045945265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980114,0.00012498797,0.00031638113,0.00090312766,0.00035537663,0.00028872894],"domain_scores_gemma":[0.9973453,0.00084631785,0.00008195663,0.0015028807,0.000060413902,0.00016309909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063323043,0.00016204882,0.00031980863,0.0002023972,0.0002595168,0.00016888502,0.0030669142,0.00008549483,0.00052892946],"category_scores_gemma":[0.0010256688,0.00008156263,0.0002495462,0.00486259,0.000079370024,0.00014781003,0.00082278677,0.0001505018,0.00008759462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108575725,0.00045230548,0.009710689,0.000018047884,0.0020376118,0.000031748117,0.00033192823,0.008553801,0.00011693824,0.84084797,0.09169543,0.046094954],"study_design_scores_gemma":[0.0002861355,0.0003750181,0.0041634296,0.0000014302263,0.0003356502,0.000001484382,0.00011101788,0.9368609,0.00016342668,0.004019013,0.05349524,0.00018724565],"about_ca_topic_score_codex":0.000067119974,"about_ca_topic_score_gemma":0.000033738717,"teacher_disagreement_score":0.96704483,"about_ca_system_score_codex":0.000013141933,"about_ca_system_score_gemma":0.000018736848,"threshold_uncertainty_score":0.57914066},"labels":[],"label_agreement":null},{"id":"W3037078431","doi":"10.46298/compositionality-6-4","title":"Homotopy Theoretic and Categorical Models of Neural Information Networks","year":2024,"lang":"en","type":"article","venue":"Compositionality","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Foundational Questions Institute; Silicon Valley Community Foundation; National Science Foundation","keywords":"Categorical variable; Homotopy; Artificial neural network; Mathematics; Computer science; Artificial intelligence; Pure mathematics; Statistics","score_opus":0.013346404939800799,"score_gpt":0.23692560782318386,"score_spread":0.22357920288338307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037078431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017012702,0.00068095414,0.9798855,0.001282138,0.00009205016,0.000040735245,0.000019892337,0.00006486139,0.000921147],"genre_scores_gemma":[0.9973034,0.000036814963,0.0023939537,0.00017289368,0.00002306036,0.0000037306424,0.000058042602,8.256086e-7,0.000007266755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939805,0.00004740506,0.00017928256,0.0001289607,0.00015747441,0.00008880117],"domain_scores_gemma":[0.99955153,0.00015843651,0.000028044333,0.00016254708,0.000050748105,0.0000486801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019616481,0.000057052734,0.00010147551,0.000094707015,0.000049475457,0.00012700827,0.00022594661,0.00003446351,0.000022312632],"category_scores_gemma":[0.000010927518,0.000042123018,0.00005005662,0.0005863436,0.00009124823,0.000823927,0.00017065495,0.000079952704,0.000006186686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023189757,0.000016473112,0.00008411171,0.000015474996,0.0000123944465,0.0000024195115,0.000041585612,0.005282857,0.000004474607,0.9793025,0.0001583728,0.0150770135],"study_design_scores_gemma":[0.00003209118,0.000021263695,0.0040604365,0.0000030808972,0.000008137263,0.000013964439,0.0000021249982,0.73975575,0.000011130679,0.25578955,0.00026120286,0.000041301926],"about_ca_topic_score_codex":0.00002957633,"about_ca_topic_score_gemma":3.4029551e-7,"teacher_disagreement_score":0.9802907,"about_ca_system_score_codex":0.00001193641,"about_ca_system_score_gemma":0.000010860491,"threshold_uncertainty_score":0.17177269},"labels":[],"label_agreement":null},{"id":"W3037388861","doi":"","title":"Intrinsic Topological Transforms via the Distance Kernel Embedding","year":2020,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Embedding; Topology (electrical circuits); Kernel (algebra); Computer science; Mathematics; Artificial intelligence; Pure mathematics; Combinatorics","score_opus":0.015831980925685576,"score_gpt":0.22673878995879393,"score_spread":0.21090680903310835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037388861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011279557,0.00039188674,0.8779582,0.10046605,0.000051911193,0.00011727333,0.000009952546,0.00021331814,0.009511893],"genre_scores_gemma":[0.9695185,0.00016219428,0.028116534,0.0012241587,0.000023623352,0.000015364963,0.000025807489,0.000006720637,0.0009071341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970359,0.0013840824,0.00033096186,0.0005620148,0.00036240587,0.0003246292],"domain_scores_gemma":[0.99700606,0.0011394592,0.00014351399,0.0010813619,0.00041977534,0.00020984643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019201282,0.00016966784,0.00022729857,0.00006584187,0.00043442383,0.00036449873,0.002458156,0.00008060956,0.00017995197],"category_scores_gemma":[0.0013055883,0.0001091447,0.00016770187,0.0017440862,0.0002559883,0.000338914,0.0006102336,0.00030107994,0.000109699744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006195158,0.00016964045,0.0010552115,0.000011189798,0.000036746264,0.000010160742,0.003892013,0.000046396843,0.0004752208,0.74919116,0.00068051653,0.24442557],"study_design_scores_gemma":[0.0016696006,0.000007645543,0.024905544,0.00019899706,0.00010788349,0.00005748663,0.0006310742,0.56208354,0.032719336,0.08503628,0.2911614,0.0014212065],"about_ca_topic_score_codex":0.00017342212,"about_ca_topic_score_gemma":0.0001212252,"teacher_disagreement_score":0.9582389,"about_ca_system_score_codex":0.000029760475,"about_ca_system_score_gemma":0.000035831825,"threshold_uncertainty_score":0.45679063},"labels":[],"label_agreement":null},{"id":"W3037443247","doi":"10.1142/s1793525312500197","title":"COBOUNDARY EXPANDERS","year":2012,"lang":"en","type":"article","venue":"Journal of Topology and Analysis","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Isoperimetric inequality; Mathematics; Generalization; Combinatorics; Enhanced Data Rates for GSM Evolution; Property (philosophy); Expander graph; Random graph; Point (geometry); Simplicial complex; Pure mathematics; Discrete mathematics; Graph; Mathematical analysis; Geometry; Computer science","score_opus":0.014936299423361825,"score_gpt":0.26664763016428755,"score_spread":0.2517113307409257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037443247","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2617031,0.005982156,0.726497,0.004442437,0.00032289463,0.000014596108,0.0000025957434,0.000015008683,0.001020175],"genre_scores_gemma":[0.9904038,0.00032378783,0.008478402,0.00048026632,0.000109708184,2.5371895e-7,0.0000012793364,0.0000011154432,0.00020143855],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991145,0.00009955625,0.00030512628,0.00010313391,0.00015983125,0.00021786532],"domain_scores_gemma":[0.9991569,0.00015822348,0.00024728812,0.00018281233,0.00007302255,0.00018176032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070313574,0.000076849356,0.00036769648,0.0007986298,0.000112295085,0.00004762901,0.0003898645,0.00006850979,0.0002004239],"category_scores_gemma":[0.00011589492,0.0000505147,0.00027193155,0.0017024885,0.00013633561,0.0005728296,0.00012459849,0.0001463247,0.000007878594],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022526674,0.00032050873,0.82089937,0.000006023996,0.0050763013,0.000067836554,0.00070962723,0.00010780134,0.00011334722,0.09038839,0.0024659086,0.079822384],"study_design_scores_gemma":[0.0010873579,0.0005987024,0.8972997,0.0000073994006,0.006063839,0.00077266886,0.0010447043,0.0037430942,0.00042763387,0.026258005,0.06211775,0.0005791375],"about_ca_topic_score_codex":0.000019854968,"about_ca_topic_score_gemma":0.0000045083593,"teacher_disagreement_score":0.72870064,"about_ca_system_score_codex":0.000011709069,"about_ca_system_score_gemma":0.00001683396,"threshold_uncertainty_score":0.21945012},"labels":[],"label_agreement":null},{"id":"W3041251855","doi":"10.1186/s12859-020-03595-2","title":"Efficient implied alignment","year":2020,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Robert J. Kleberg, Jr. and Helen C. Kleberg Foundation; Defense Sciences Office, DARPA; Defense Advanced Research Projects Agency; McGill University","keywords":"Algorithm; Tree traversal; Artificial intelligence; Computer science","score_opus":0.03399497211501743,"score_gpt":0.23570747319662025,"score_spread":0.20171250108160282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041251855","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014409292,0.000031323343,0.99131256,0.0015244243,0.00006812489,0.00007690925,0.000010611147,0.0001505188,0.0053845956],"genre_scores_gemma":[0.19253479,0.00000891044,0.80220354,0.005091549,0.000058643483,0.000006369551,0.000015690182,0.0000034789075,0.00007705772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990403,0.000012583676,0.00029930414,0.00013704885,0.0002939338,0.00021684768],"domain_scores_gemma":[0.9992954,0.00005878328,0.00009132569,0.00034022675,0.000025614803,0.0001886601],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012862879,0.00009585734,0.00014447879,0.00007256016,0.00007001584,0.000121607954,0.0007693637,0.000037347556,0.00006112923],"category_scores_gemma":[0.000101289974,0.00006713211,0.000080952545,0.001014281,0.000026315558,0.00010741558,0.00046951606,0.000060870465,0.00095433387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025728423,0.00038318522,0.0023725517,0.00029302563,0.0001652587,0.000020983023,0.0073528946,0.119470194,0.00009529236,0.5999796,0.047827564,0.22201376],"study_design_scores_gemma":[0.0001629017,0.00005988204,0.00059096375,0.0000015671869,0.000007856786,0.00000223042,0.00011328076,0.9859258,0.000093532326,0.0002558278,0.012673667,0.00011250454],"about_ca_topic_score_codex":0.0000029542157,"about_ca_topic_score_gemma":4.0116606e-7,"teacher_disagreement_score":0.8664556,"about_ca_system_score_codex":0.000016362945,"about_ca_system_score_gemma":0.000026380274,"threshold_uncertainty_score":0.9998235},"labels":[],"label_agreement":null},{"id":"W3045422897","doi":"10.1051/0004-6361/202039048","title":"Persistent homology in cosmic shear: Constraining parameters with topological data analysis","year":2021,"lang":"en","type":"article","venue":"Astronomy and Astrophysics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Science and Technology Facilities Council; Danmarks Grundforskningsfond; International Max Planck Research School for Advanced Methods in Process and Systems Engineering; Deutsche Forschungsgemeinschaft; National Research Foundation; Western Canada Research Grid; Compute Canada","keywords":"Topological data analysis; Persistent homology; Dark energy; Cosmology; COSMIC cancer database; Topological defect; Weak gravitational lensing; Dark matter; Markov chain Monte Carlo","score_opus":0.0314804417966561,"score_gpt":0.2403467344350823,"score_spread":0.2088662926384262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045422897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.268766,0.00012420955,0.7303027,0.0005495886,0.000020095194,0.000032635726,0.000039286988,0.000019788507,0.0001457044],"genre_scores_gemma":[0.6640219,0.000010050397,0.33570418,0.00008803763,0.000012032587,0.0000028687796,0.00014140329,0.000001748819,0.000017786317],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99850154,0.000102990816,0.00020604228,0.0007209285,0.00013218026,0.00033634566],"domain_scores_gemma":[0.99885863,0.00013933824,0.00007391648,0.00077361567,0.000043031778,0.000111446716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013517904,0.00014592202,0.0003841392,0.00016740523,0.0000916044,0.00013098282,0.0006310283,0.00004478563,0.00003628027],"category_scores_gemma":[0.000028183622,0.00011306814,0.00008965361,0.0021469947,0.00022987861,0.0003317054,0.0007079353,0.00019723899,0.0000063013626],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035429468,0.0005389033,0.097580634,0.000007894223,0.0020702272,0.00048569436,0.00024441918,0.01659492,0.000056160323,0.0419389,0.00007927616,0.84036756],"study_design_scores_gemma":[0.007990978,0.0047314484,0.6374844,0.00010315673,0.005860081,0.0006199737,0.01519383,0.27677855,0.0006517885,0.009014817,0.03774938,0.0038215874],"about_ca_topic_score_codex":0.0000829469,"about_ca_topic_score_gemma":0.000024621148,"teacher_disagreement_score":0.83654594,"about_ca_system_score_codex":0.00001704103,"about_ca_system_score_gemma":0.00006841193,"threshold_uncertainty_score":0.4610785},"labels":[],"label_agreement":null},{"id":"W3048323270","doi":"10.1109/tfuzz.2020.3014662","title":"SFCM: A Fuzzy Clustering Algorithm of Extracting the Shape Information of Data","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Fuzzy Systems","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Cluster analysis; Computer science; Algorithm; Topological data analysis; Fuzzy logic; Fuzzy clustering; Fuzzy set; Data mining; Mathematics; Artificial intelligence","score_opus":0.06541276780932331,"score_gpt":0.27074114620418266,"score_spread":0.20532837839485935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048323270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00074294856,0.00009758599,0.99672437,0.0007798794,0.00038247491,0.00018427301,0.0002720575,0.00006805329,0.0007483544],"genre_scores_gemma":[0.99078447,0.000035921796,0.008948873,0.0001250619,0.0000496752,0.000011073546,0.000014344798,0.000003881705,0.000026701318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843675,0.00010482988,0.0006100319,0.00024812025,0.00043407615,0.0001662004],"domain_scores_gemma":[0.9983369,0.0002985866,0.00032953743,0.0008478086,0.00010705183,0.000080118676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004962272,0.00011930298,0.0002779843,0.0001868738,0.00013107905,0.00010473409,0.001575788,0.000063337655,0.00001569275],"category_scores_gemma":[0.000034555902,0.000081084014,0.000094195115,0.001614578,0.00004984897,0.0016233674,0.000029220508,0.00019112953,0.00003930548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021380458,0.00012273992,0.00001447265,0.00020035193,0.00021259791,0.0000035706296,0.0015689441,0.04592703,0.00046917956,0.00057887984,0.0005103304,0.95037055],"study_design_scores_gemma":[0.00023000827,0.00013679313,0.000064627886,0.000040659063,0.00005468369,0.000013780537,0.0007677423,0.9951999,0.0005873754,0.000037236077,0.0027451867,0.00012199944],"about_ca_topic_score_codex":0.0003371121,"about_ca_topic_score_gemma":0.000008468184,"teacher_disagreement_score":0.9900415,"about_ca_system_score_codex":0.00001530875,"about_ca_system_score_gemma":0.00003325433,"threshold_uncertainty_score":0.33065102},"labels":[],"label_agreement":null},{"id":"W3070123090","doi":"10.1016/j.mad.2020.111390","title":"Why we should use topological data analysis in ageing: Towards defining the “topological shape of ageing”","year":2020,"lang":"en","type":"preprint","venue":"Mechanisms of Ageing and Development","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Health and Social Services Centre University Institute of Geriatrics of Sherbrooke; Université de Sherbrooke","funders":"Canadian Institutes of Health Research; Fundação de Amparo à Ciência e Tecnologia do Estado de Pernambuco; Ikerbasque, Basque Foundation for Science; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Topological data analysis; Data science; Computer science; Battle; Conceptual framework; Topology (electrical circuits); Epistemology; Cognitive science; Psychology; Mathematics; Geography; Philosophy","score_opus":0.14675738831857912,"score_gpt":0.31085726963205534,"score_spread":0.16409988131347622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3070123090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056034278,0.0013834321,0.9340286,0.007580643,0.00025023878,0.00030265172,0.00013918032,0.00013153868,0.0001494411],"genre_scores_gemma":[0.76496965,0.00057169126,0.2330802,0.001064281,0.000020759273,0.000022889533,0.0002304179,0.000010458596,0.000029641431],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9947316,0.00041224403,0.0014337292,0.0018201263,0.0010142898,0.00058799126],"domain_scores_gemma":[0.99630076,0.00074217934,0.0007360197,0.0018733012,0.00013038241,0.00021736174],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0021500504,0.0005520667,0.001613371,0.00091887015,0.00022379372,0.00032394513,0.004421306,0.00050781184,0.00015384729],"category_scores_gemma":[0.0013059593,0.0003565678,0.00029159745,0.0028127609,0.0002542506,0.00029777142,0.015021725,0.0009759127,0.000005317331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026129678,0.0018443167,0.010839113,0.0011414016,0.008464523,0.0066641946,0.009869011,0.011051935,0.0009263618,0.4560937,0.002033444,0.49081072],"study_design_scores_gemma":[0.0020457995,0.0010783138,0.35581565,0.0010178947,0.002781248,0.000052950352,0.0029876751,0.27031684,0.0062660063,0.3348892,0.018518964,0.0042294897],"about_ca_topic_score_codex":0.0019494584,"about_ca_topic_score_gemma":0.00039341205,"teacher_disagreement_score":0.7089354,"about_ca_system_score_codex":0.00006476983,"about_ca_system_score_gemma":0.00022187551,"threshold_uncertainty_score":0.99988866},"labels":[],"label_agreement":null},{"id":"W3087655975","doi":"10.1017/fms.2021.64","title":"Topology of random -dimensional cubical complexes","year":2021,"lang":"en","type":"preprint","venue":"Forum of Mathematics Sigma","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; European Commission; Simons Foundation; National Science Foundation","keywords":"Combinatorics; Mathematics; Corollary; Simple (philosophy); Homology (biology); Random graph; Discrete mathematics; Group (periodic table); Topology (electrical circuits); Physics; Graph","score_opus":0.026011688777909353,"score_gpt":0.2705960806356113,"score_spread":0.24458439185770195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3087655975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06478808,0.00096531986,0.9298242,0.002476705,0.0004013724,0.00021502153,0.00012300513,0.000056026223,0.0011502864],"genre_scores_gemma":[0.7401165,0.000033601355,0.25940022,0.000108241584,0.000037314152,0.000011950519,0.00009601458,0.000008491112,0.00018767262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759096,0.000109136134,0.0009423784,0.00047782116,0.00058650464,0.0002931868],"domain_scores_gemma":[0.99669206,0.001021077,0.0006833476,0.0012422048,0.00026877547,0.0000925336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051325624,0.00024118427,0.001265188,0.00030910474,0.000046097462,0.000044208005,0.0016611879,0.0002849139,0.00046197555],"category_scores_gemma":[0.0004914364,0.00018456815,0.0005108582,0.00054178183,0.00026367896,0.00008114673,0.0038839555,0.00030585905,0.000010871825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004366529,0.003516179,0.0007669782,0.0018829469,0.0013650416,0.00009097586,0.0011589135,0.0065055443,0.0023084057,0.96292347,0.010279331,0.009158534],"study_design_scores_gemma":[0.0017080395,0.00035333697,0.0005726911,0.0004605709,0.0003198972,0.000071235925,0.00060719956,0.14901121,0.01906519,0.8259978,0.0010900857,0.00074273156],"about_ca_topic_score_codex":0.00009844467,"about_ca_topic_score_gemma":0.0000142855,"teacher_disagreement_score":0.67532843,"about_ca_system_score_codex":0.00001674031,"about_ca_system_score_gemma":0.00011516149,"threshold_uncertainty_score":0.7526471},"labels":[],"label_agreement":null},{"id":"W3089598160","doi":"10.1145/3263961","title":"Session details: Geometry &amp; topology","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Session (web analytics); Topology (electrical circuits); Computer science; Geometry; Geometry and topology; Computer graphics (images); Mathematics; Combinatorics","score_opus":0.029774792533330745,"score_gpt":0.26970104262654243,"score_spread":0.2399262500932117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089598160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046912305,0.00010373936,0.9444038,0.0075726607,0.00032818475,0.000104814666,0.00001065411,0.00022226253,0.00034157909],"genre_scores_gemma":[0.9496011,0.00033220908,0.046735916,0.002276264,0.000028330374,0.00003805983,0.000011343399,0.0000075563753,0.00096922455],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856216,0.00008883546,0.0002528133,0.00045906843,0.00029146136,0.00034565982],"domain_scores_gemma":[0.9978876,0.0004005325,0.000064746,0.0013718606,0.00010599302,0.00016926521],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00018077953,0.00016400001,0.00020954262,0.00089945184,0.00032399388,0.0001333293,0.0014174585,0.00017278957,0.0013055073],"category_scores_gemma":[0.000117103475,0.0001246272,0.00019785162,0.003678326,0.00012849698,0.00057795993,0.000042402153,0.00035740287,0.0010399574],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012298026,0.0012059165,0.0028675268,0.000022641396,0.00030860575,0.000016880236,0.00027290508,0.0006036091,0.00061938394,0.07583841,0.006967103,0.9112647],"study_design_scores_gemma":[0.0017862027,0.001149608,0.08441985,0.00005085519,0.00028505642,0.00015973738,0.00040230402,0.009774578,0.0035354707,0.70542264,0.19088997,0.0021237037],"about_ca_topic_score_codex":0.00028640238,"about_ca_topic_score_gemma":0.00008854905,"teacher_disagreement_score":0.909141,"about_ca_system_score_codex":0.000018265091,"about_ca_system_score_gemma":0.00001954272,"threshold_uncertainty_score":0.99973786},"labels":[],"label_agreement":null},{"id":"W3092789209","doi":"10.1017/9781108649094.004","title":"Topological connectedness and independent sets in graphs","year":2019,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Social connectedness; Hypergraph; Combinatorics; Mathematics; Line graph; Simplicial complex; Graph; Topology (electrical circuits); Discrete mathematics","score_opus":0.023140924277997615,"score_gpt":0.20507190369839598,"score_spread":0.18193097942039838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092789209","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031909833,0.0002790091,0.0033318205,0.00007543304,0.00021241918,0.00027818792,0.00014784481,0.00012054103,0.99236375],"genre_scores_gemma":[0.042111117,0.00024307173,0.0003082995,0.00014942365,0.000016271537,4.6084594e-7,0.000037422044,0.000009855726,0.95712405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982642,0.00006454406,0.00020644793,0.00085522776,0.00029770954,0.0003118913],"domain_scores_gemma":[0.9987285,0.00017936554,0.00016006219,0.00068237004,0.00007651025,0.00017315462],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015830404,0.00031186375,0.00054012,0.00059655396,0.000090613474,0.000092206086,0.0012170079,0.0004633814,0.000010922275],"category_scores_gemma":[0.000022900862,0.00029235988,0.00015109741,0.00006322915,0.0002388532,0.00017285724,0.0016598674,0.0005246213,0.00002041229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016391874,0.0000140908805,0.00008402509,0.000018958814,0.000056972185,0.0005745317,0.000018702543,0.0000022362326,0.0000027510896,0.9945348,0.0012165507,0.003460022],"study_design_scores_gemma":[0.0018712734,0.0003054551,0.0045945826,0.0001323735,0.00019781177,0.00009813966,0.00006665553,0.0011914811,0.000048149082,0.0024154074,0.9876267,0.0014519942],"about_ca_topic_score_codex":0.00027928202,"about_ca_topic_score_gemma":0.000013582122,"teacher_disagreement_score":0.9921194,"about_ca_system_score_codex":0.00008577515,"about_ca_system_score_gemma":0.00006162465,"threshold_uncertainty_score":0.99995285},"labels":[],"label_agreement":null},{"id":"W3092794119","doi":"10.48550/arxiv.2010.09043","title":"Berkovich curves and Schottky uniformization","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Uniformization (probability theory); Computer science; Mathematics; Statistics","score_opus":0.0825142577460757,"score_gpt":0.18283737704851077,"score_spread":0.10032311930243508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092794119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02270736,0.0006572102,0.9707102,0.002208347,0.00016683427,0.00016612736,0.000043132743,0.00027101955,0.003069734],"genre_scores_gemma":[0.993166,0.0033778548,0.0018980238,0.00062033674,0.0000369764,3.6331411e-7,0.00007858907,0.0000053108033,0.00081650715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855506,0.000084005515,0.0001468634,0.0009273301,0.00008722167,0.00019950815],"domain_scores_gemma":[0.9988033,0.00007929935,0.00015775592,0.0006734269,0.00008712968,0.00019906859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014496401,0.0001984968,0.00029392232,0.00026468877,0.00011600343,0.00012758657,0.0012954504,0.00016748779,0.000058158097],"category_scores_gemma":[0.00012036988,0.00019465819,0.00010952601,0.0017604261,0.00008670332,0.00037283776,0.0027797446,0.00036129632,0.00006933658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017390466,0.00012017393,0.013122061,0.0003627468,0.00028987107,0.00040752214,0.00011028614,0.022317586,0.000010459273,0.9530858,0.0037581811,0.0063979626],"study_design_scores_gemma":[0.0005096521,0.00011717769,0.011671108,0.00017224107,0.0003078968,0.0000070407873,0.00005025458,0.7663698,0.000045367535,0.2111376,0.0087424135,0.0008694676],"about_ca_topic_score_codex":0.0001451827,"about_ca_topic_score_gemma":0.000019717492,"teacher_disagreement_score":0.9704587,"about_ca_system_score_codex":0.00004102741,"about_ca_system_score_gemma":0.00006228036,"threshold_uncertainty_score":0.793793},"labels":[],"label_agreement":null},{"id":"W3095314349","doi":"10.1007/978-3-030-60026-6_9","title":"The Complexity and Parallel Implementation of Two Sparse Multivariate Hensel Lifting Algorithms for Polynomial Factorization","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Algorithm; Bivariate analysis; Speedup; Parallel computing; Factorization; Maple; Interpolation (computer graphics); Artificial intelligence","score_opus":0.06510990149325345,"score_gpt":0.31830714447756303,"score_spread":0.25319724298430957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3095314349","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009862339,0.00016511318,0.99694145,0.0017776814,0.00047055466,0.00039446392,0.000061304745,0.000039737086,0.000051081064],"genre_scores_gemma":[0.2899854,0.000050464674,0.70914334,0.0004202402,0.00031818094,0.000010003918,0.000039582486,0.000011259084,0.00002157258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977595,0.000039962168,0.00052107946,0.00085757265,0.00047714065,0.00034473653],"domain_scores_gemma":[0.99793965,0.00085098547,0.0004422535,0.00046746765,0.00019071462,0.00010895764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006528536,0.00026784764,0.00039769046,0.00028450714,0.00040133932,0.0003521912,0.0013908306,0.00009756193,0.000005300413],"category_scores_gemma":[0.00015858495,0.00018707605,0.00010128464,0.00064657803,0.00065800856,0.00032334134,0.0009137414,0.00023985005,0.0000018127259],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010994843,0.000013497414,0.00022766179,0.000019667716,0.00003334609,0.0000036206238,0.00056394294,0.0028478852,0.00012138792,0.09281077,0.000016315107,0.9033309],"study_design_scores_gemma":[0.0007560485,0.00026521806,0.001675394,0.00003349748,0.000028289105,0.000006445437,0.0000020316938,0.71621615,0.00045904733,0.2790576,0.0011215606,0.0003787267],"about_ca_topic_score_codex":0.00025860127,"about_ca_topic_score_gemma":0.00018448521,"teacher_disagreement_score":0.9029522,"about_ca_system_score_codex":0.00006535909,"about_ca_system_score_gemma":0.00014347787,"threshold_uncertainty_score":0.76287395},"labels":[],"label_agreement":null},{"id":"W3095966380","doi":"10.1063/5.0035395","title":"Learning-based approach to plasticity in athermal sheared amorphous packings: Improving softness","year":2021,"lang":"en","type":"preprint","venue":"APL Materials","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation; U.S. Department of Energy","keywords":"Plasticity; Persistent homology; Statistical physics; Representation (politics); SPHERES; Computer science; Hard spheres; Particle (ecology); Simple (philosophy); Biological system; Artificial intelligence; Algorithm; Physics; Thermodynamics; Geology","score_opus":0.018706065262101303,"score_gpt":0.2349550200398586,"score_spread":0.2162489547777573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3095966380","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61268306,0.000026735044,0.3861064,0.00014304377,0.0004807978,0.00024159606,0.00005451818,0.00017579555,0.00008805218],"genre_scores_gemma":[0.97417575,0.0000046364617,0.024896987,0.0003154237,0.00014713276,0.00014144095,0.00021487668,0.000021275793,0.000082455495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99646795,0.0004411457,0.00066517654,0.0013584265,0.00046461006,0.000602718],"domain_scores_gemma":[0.998352,0.00022518626,0.00031744957,0.0008041016,0.00012231681,0.00017895186],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00078976114,0.00039990188,0.0009525403,0.0005320413,0.00010827597,0.0012542439,0.0017707205,0.00036570107,0.00020045157],"category_scores_gemma":[0.001019475,0.00034979076,0.00015393441,0.0011565888,0.000054652093,0.00019619544,0.0034424884,0.00044520438,0.00006001146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048852107,0.004713028,0.00880396,0.0040862355,0.00072069524,0.0017099777,0.0071434593,0.68752575,0.19526653,0.0064247795,0.0008907611,0.0822263],"study_design_scores_gemma":[0.0061690444,0.0017050821,0.20333211,0.0019852254,0.0006912384,0.00012281381,0.0014375433,0.32854536,0.43486926,0.006029725,0.0036683178,0.011444266],"about_ca_topic_score_codex":0.0022665956,"about_ca_topic_score_gemma":0.00003206874,"teacher_disagreement_score":0.3614927,"about_ca_system_score_codex":0.0001164589,"about_ca_system_score_gemma":0.00018148797,"threshold_uncertainty_score":0.9998954},"labels":[],"label_agreement":null},{"id":"W3096888713","doi":"10.48550/arxiv.2008.09039","title":"Why we should use Topological Data Analysis in Ageing: towards defining\\n the \"Topological shape of ageing\"","year":2020,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Canadian Institutes of Health Research; Fundação de Amparo à Ciência e Tecnologia do Estado de Pernambuco; Ikerbasque, Basque Foundation for Science; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Ageing; Topological data analysis; Topology (electrical circuits); Computer science; Mathematics; Biology; Algorithm; Combinatorics; Genetics","score_opus":0.2544557462283044,"score_gpt":0.24485127612143098,"score_spread":0.00960447010687343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096888713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4339553,0.0002571138,0.5517911,0.012652187,0.000070808645,0.00013904636,0.00010152991,0.00016427819,0.000868632],"genre_scores_gemma":[0.99487793,0.00028858354,0.0020011163,0.0026645702,0.000023148577,3.719396e-7,0.000042919724,0.0000043281025,0.00009704718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735147,0.0003683709,0.00037470163,0.0012544664,0.00021576627,0.00043521033],"domain_scores_gemma":[0.99717134,0.00070207875,0.00021031432,0.0016168015,0.00007545601,0.0002239814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005437681,0.00023849565,0.00059252226,0.00044379412,0.00015067967,0.00012909214,0.0049515185,0.00018711506,0.00048262274],"category_scores_gemma":[0.001061146,0.0001626632,0.00030605405,0.01058609,0.0004266191,0.0008675899,0.0035172396,0.00042610685,0.000037754213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012069105,0.00049081846,0.13434215,0.000020136033,0.00091383164,0.0037802795,0.00049157056,0.039109953,0.000036969184,0.809919,0.0024198554,0.008354767],"study_design_scores_gemma":[0.00050188834,0.0002750676,0.09551212,0.000008162372,0.0005939472,0.0000037964414,0.00040882005,0.8825459,0.000035064553,0.01081668,0.008884011,0.0004145607],"about_ca_topic_score_codex":0.0011755334,"about_ca_topic_score_gemma":0.00033618935,"teacher_disagreement_score":0.84343594,"about_ca_system_score_codex":0.000036692192,"about_ca_system_score_gemma":0.000042688258,"threshold_uncertainty_score":0.9201236},"labels":[],"label_agreement":null},{"id":"W3106391989","doi":"10.3929/ethz-b-000462843","title":"Uncovering the Topology of Time-Varying fMRI Data using Cubical Persistence","year":2021,"lang":"en","type":"article","venue":"Repository for Publications and Research Data (ETH Zurich)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Institut de Valorisation des Données; Alfried Krupp von Bohlen und Halbach-Stiftung; National Institutes of Health; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Voxel; Computer science; Topological data analysis; Cluster analysis; Persistence (discontinuity); Functional magnetic resonance imaging; Set (abstract data type); Representation (politics); Noise (video); Artificial intelligence; Trajectory; Data set; Persistent homology; Time point; Pattern recognition (psychology); Resting state fMRI; Topology (electrical circuits); Algorithm; Mathematics; Psychology","score_opus":0.2749485147984605,"score_gpt":0.4053294569964664,"score_spread":0.1303809421980059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106391989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025743516,0.008796098,0.9226452,0.034322172,0.00037564914,0.0007497317,0.0019379043,0.00013454969,0.00529519],"genre_scores_gemma":[0.76480097,0.0014392616,0.22105345,0.0002835117,0.0005791139,0.00007007994,0.0040975725,0.000028925717,0.0076470906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759686,0.00038038372,0.00032423926,0.00086333975,0.00047626212,0.0003589242],"domain_scores_gemma":[0.992995,0.001729258,0.000110558605,0.004414493,0.00061771565,0.00013294125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00260203,0.000087910244,0.00019361473,0.00025152846,0.001003407,0.0005177776,0.0046438607,0.000076452954,0.000023720033],"category_scores_gemma":[0.002929702,0.000059046783,0.000044144414,0.002462786,0.00042888089,0.001412785,0.0076578073,0.0002517568,0.000003863713],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001089049,0.003194681,0.017623805,0.00079932547,0.0022742453,0.00014360264,0.0015558819,0.0016771003,0.09076384,0.41031778,0.2665754,0.20496544],"study_design_scores_gemma":[0.00040058573,0.00014538484,0.003505807,0.000039807648,0.00012124178,0.00037013873,0.00050189206,0.530932,0.0027825045,0.004213239,0.45665833,0.00032907145],"about_ca_topic_score_codex":0.00027196493,"about_ca_topic_score_gemma":0.000012275554,"teacher_disagreement_score":0.7390575,"about_ca_system_score_codex":0.00003046344,"about_ca_system_score_gemma":0.0003163932,"threshold_uncertainty_score":0.9544909},"labels":[],"label_agreement":null},{"id":"W3123452453","doi":"","title":"Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time","year":2017,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Exponential growth; Exponential function; Betti number; Homology (biology); Mathematics; Torsion (gastropod); Time complexity; Discrete mathematics; Algorithm; Computer science; Mathematical analysis","score_opus":0.012602578176045745,"score_gpt":0.2318496813916548,"score_spread":0.21924710321560906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123452453","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64491415,0.00038881003,0.298624,0.024485173,0.00017649235,0.00020040579,0.000017110387,0.000102846716,0.031091044],"genre_scores_gemma":[0.9849186,0.000045603134,0.01294385,0.00006965655,0.000009780334,0.000004427576,0.000022197157,0.0000053470812,0.0019805396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99651825,0.0021584546,0.00036502274,0.00041724043,0.00026561823,0.00027541086],"domain_scores_gemma":[0.99532086,0.0014328256,0.00042801423,0.002354774,0.0003915444,0.00007199852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004433646,0.00012645997,0.00025570893,0.00018901288,0.00052100344,0.00029706297,0.0034592971,0.00008464041,0.00010763633],"category_scores_gemma":[0.001955108,0.00009688878,0.000117149415,0.0006064911,0.00037951965,0.00028474297,0.0016612887,0.00021069155,0.00006590125],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000115983485,0.0008937165,0.026659537,0.00003205977,0.00010291339,0.000022405748,0.005880932,0.0000888605,0.0067147203,0.52842236,0.0021521186,0.42901877],"study_design_scores_gemma":[0.0024490354,0.000004491514,0.59694576,0.00061109476,0.000077306155,0.000070052185,0.00019953183,0.27994695,0.05887883,0.041747168,0.018114632,0.00095511944],"about_ca_topic_score_codex":0.0012991953,"about_ca_topic_score_gemma":0.00061473413,"teacher_disagreement_score":0.5702862,"about_ca_system_score_codex":0.000024470792,"about_ca_system_score_gemma":0.00006067129,"threshold_uncertainty_score":0.64282924},"labels":[],"label_agreement":null},{"id":"W3125511987","doi":"10.1051/0004-6361/202039048/pdf","title":"Persistent homology in cosmic shear: Constraining parameters with topological data analysis","year":2021,"lang":"en","type":"article","venue":"Springer Link (Chiba Institute of Technology)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Science and Technology Facilities Council; Danmarks Grundforskningsfond; International Max Planck Research School for Advanced Methods in Process and Systems Engineering; Deutsche Forschungsgemeinschaft; National Research Foundation; Western Canada Research Grid; Compute Canada","keywords":"Physics; Astrophysics; COSMIC cancer database; Topological data analysis; Astronomy; Topology (electrical circuits); Theoretical physics","score_opus":0.038552979444740315,"score_gpt":0.2619345398763296,"score_spread":0.22338156043158927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125511987","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7298873,0.0012960737,0.2539987,0.012478078,0.0003020181,0.00017462698,0.000060136754,0.0003384531,0.0014646212],"genre_scores_gemma":[0.74480575,0.00012311725,0.25477302,0.00017441719,0.000013073147,0.000009408494,0.00006038944,0.0000041901926,0.000036657668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9973284,0.000059801998,0.0005849998,0.0012144833,0.00028671176,0.0005256082],"domain_scores_gemma":[0.9969777,0.000093903596,0.0002216397,0.0024553265,0.00015165324,0.000099813056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045901356,0.00024516517,0.0008210788,0.0018192395,0.00010358143,0.000061595674,0.0027208386,0.00034200386,0.000051363542],"category_scores_gemma":[0.000682322,0.00019319341,0.00019587712,0.010799701,0.0011991643,0.00042825268,0.0022158963,0.0005726886,0.000015769181],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058135414,0.0011411537,0.31028178,0.00006770305,0.005029647,0.0033055062,0.00019134152,0.014641111,0.000831104,0.46158633,0.00015575855,0.20271045],"study_design_scores_gemma":[0.015232293,0.0064327447,0.42583394,0.00082745246,0.011035557,0.003753056,0.0051211487,0.29596472,0.019205535,0.071818605,0.13620763,0.008567333],"about_ca_topic_score_codex":0.00018023867,"about_ca_topic_score_gemma":0.00032489712,"teacher_disagreement_score":0.3897677,"about_ca_system_score_codex":0.000057444602,"about_ca_system_score_gemma":0.00020309526,"threshold_uncertainty_score":0.78781986},"labels":[],"label_agreement":null},{"id":"W3128608632","doi":"10.1063/5.0035395","title":"Learning-based approach to plasticity in athermal sheared amorphous packings: Improving softness","year":2020,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation; U.S. Department of Energy","keywords":"Plasticity; Statistical physics; Persistent homology; Amorphous solid; Representation (politics); SPHERES; Materials science; Particle (ecology); Hard spheres; Biological system; Computer science; Artificial intelligence; Physics; Algorithm; Crystallography; Thermodynamics","score_opus":0.05448461561466493,"score_gpt":0.16423797032108262,"score_spread":0.10975335470641769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128608632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36237693,0.000002880808,0.6369039,0.00015861102,0.00001888189,0.00006880485,0.0000033348886,0.00013004626,0.00033662227],"genre_scores_gemma":[0.99706435,0.0000012779672,0.002233482,0.0005535086,0.000025954952,6.2808135e-7,0.000005481393,0.0000062860595,0.00010901373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998499,0.00010741461,0.00014407588,0.0007824218,0.00010326664,0.00036383214],"domain_scores_gemma":[0.9991985,0.00014180719,0.00007631181,0.00025006675,0.000052535484,0.00028079867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013257797,0.00015730839,0.00024311205,0.0002824946,0.000121424295,0.0000864069,0.0010701811,0.00007847332,0.00003118324],"category_scores_gemma":[0.00031172155,0.00015497542,0.00009734276,0.003869291,0.00005619421,0.00034133624,0.00048005633,0.00026782445,0.00010164728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006087666,0.00017134548,0.019433554,0.000019823563,0.000017902697,0.00021743966,0.00032506927,0.96777034,0.0001938119,0.009143874,0.00005261021,0.0025933718],"study_design_scores_gemma":[0.0005090952,0.00018519603,0.00928231,0.000004785576,0.0000167034,9.872637e-7,0.00013687753,0.9889615,0.0001558123,0.00016600378,0.00033944403,0.00024123956],"about_ca_topic_score_codex":0.00026372087,"about_ca_topic_score_gemma":0.000017069748,"teacher_disagreement_score":0.6346874,"about_ca_system_score_codex":0.000068252935,"about_ca_system_score_gemma":0.000049863753,"threshold_uncertainty_score":0.6319714},"labels":[],"label_agreement":null},{"id":"W3134406394","doi":"10.1007/978-3-030-99336-8_1","title":"Categorical Foundations of Gradient-Based Learning","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Gradient descent; Softmax function; Categorical variable; Artificial intelligence; Theoretical computer science; Variety (cybernetics); Python (programming language); Entropy (arrow of time); Algorithm; Machine learning; Artificial neural network; Programming language","score_opus":0.023384148691827804,"score_gpt":0.2553564875562189,"score_spread":0.23197233886439111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134406394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000053929187,0.0002155762,0.9954825,0.0008649793,0.0006302912,0.00012684209,0.000007692588,0.0000914798,0.0025266944],"genre_scores_gemma":[0.6441341,0.000059278038,0.35375172,0.00090299017,0.00020101978,0.000017568513,0.0000764339,0.000024840203,0.00083204475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680424,0.00005674668,0.0004964228,0.001119965,0.0010795039,0.00044310023],"domain_scores_gemma":[0.99763244,0.00074458396,0.00034055364,0.0009795844,0.00016834568,0.00013450715],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000790518,0.0002982162,0.00049804023,0.0016401234,0.00037056016,0.00019517378,0.0032684659,0.00013978433,0.00037712025],"category_scores_gemma":[0.0002811329,0.00025584243,0.00020757246,0.002657582,0.0005927723,0.0003494174,0.0015596253,0.00085051777,0.000024764395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035954047,0.00007800284,0.0002790371,0.000018403067,0.000019493173,0.00007093953,0.00015525467,0.22615321,0.000022368607,0.22872654,0.000021622343,0.54445153],"study_design_scores_gemma":[0.00031484143,0.0005927952,0.00040825774,0.000039336857,0.000033029617,0.00003107045,2.8575306e-7,0.7447442,0.00023130806,0.21441206,0.038467754,0.000725056],"about_ca_topic_score_codex":0.00010487162,"about_ca_topic_score_gemma":0.00003058763,"teacher_disagreement_score":0.64408016,"about_ca_system_score_codex":0.00023261846,"about_ca_system_score_gemma":0.00038874612,"threshold_uncertainty_score":0.9999894},"labels":[],"label_agreement":null},{"id":"W3135217630","doi":"10.20382/jocg.v11i2a7","title":"Topological data analysis in information space","year":2020,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Austrian Science Fund; Deutsche Forschungsgemeinschaft","keywords":"Simplex; Histogram; Context (archaeology); Euclidean space; Mathematics; Euclidean geometry; Point (geometry); Topological data analysis; Dimension (graph theory); Topology (electrical circuits); Euclidean distance; Probability distribution; Computer science; Theoretical computer science; Algorithm; Combinatorics; Artificial intelligence; Image (mathematics); Geography; Statistics; Geometry","score_opus":0.03036330825642656,"score_gpt":0.2336477017209446,"score_spread":0.20328439346451804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135217630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052084744,0.000054563538,0.9388106,0.007906871,0.0000654013,0.0000347757,0.000036539295,0.000021708442,0.0009848035],"genre_scores_gemma":[0.94397277,0.000038561077,0.055027228,0.0008037933,0.00005061713,2.4286466e-8,0.00006927235,0.0000013217533,0.00003643691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847573,0.0001246797,0.0004346015,0.00022265669,0.0005739424,0.00016841665],"domain_scores_gemma":[0.99845374,0.00033210797,0.0004393237,0.00027601118,0.00028830062,0.00021053813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042769534,0.00010883786,0.0003756309,0.0026887846,0.000061027873,0.000116148476,0.0021227447,0.00007281053,0.00012515154],"category_scores_gemma":[0.000436087,0.000095484866,0.00018230343,0.013554073,0.000054169996,0.002841785,0.00073046744,0.0002677823,0.000027832366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013566574,0.00022732638,0.043896068,0.000016813014,0.0010598563,0.00057614216,0.0003916537,0.76556915,0.00000861889,0.16378771,0.0029283855,0.021402586],"study_design_scores_gemma":[0.0021183917,0.0005892627,0.21196595,0.000012324374,0.0005535673,0.000053143733,0.0008303218,0.66000694,0.00001650304,0.007915444,0.11546247,0.00047565997],"about_ca_topic_score_codex":0.000028481138,"about_ca_topic_score_gemma":0.0000043665896,"teacher_disagreement_score":0.891888,"about_ca_system_score_codex":0.000071241164,"about_ca_system_score_gemma":0.0001125465,"threshold_uncertainty_score":0.6512283},"labels":[],"label_agreement":null},{"id":"W3137237563","doi":"10.1002/widm.1436","title":"Blockchain networks: Data structures of Bitcoin, Monero, Zcash, Ethereum, Ripple, and Iota","year":2021,"lang":"en","type":"preprint","venue":"Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Science Foundation of Sri Lanka","keywords":"Blockchain; Cryptocurrency; Computer science; Asset (computer security); Popularity; Big data; Data science; Computer security; Data mining","score_opus":0.09912994489545705,"score_gpt":0.35639318000931836,"score_spread":0.2572632351138613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137237563","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06941899,0.78055936,0.1402078,0.000648773,0.0018147688,0.0007455282,0.0059133647,0.00008961053,0.0006018349],"genre_scores_gemma":[0.6160029,0.2737572,0.0810865,0.00030146833,0.0015736996,0.00010923042,0.025771853,0.00011530748,0.0012818343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99344224,0.00078612095,0.0016166167,0.0032429341,0.00033877313,0.00057330244],"domain_scores_gemma":[0.9888972,0.0006544951,0.001010424,0.009051264,0.00010992182,0.00027666148],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.002520871,0.0008255366,0.0022345094,0.00043840625,0.00030072377,0.0010433864,0.0080814455,0.00044221728,0.000050949515],"category_scores_gemma":[0.0006317545,0.0006078763,0.0002412229,0.0010840377,0.00050061557,0.0010357345,0.12977724,0.0008616292,0.0000055889573],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005420556,0.0005778998,0.003352484,0.0030173927,0.0010952542,0.00016523378,0.0037235457,0.00020382731,0.00005013301,0.0007596924,0.09565628,0.8913441],"study_design_scores_gemma":[0.0016634434,0.0007509309,0.008530874,0.020392464,0.003098566,0.0006229184,0.0051832744,0.8606544,0.000036649573,0.005209009,0.08891283,0.004944624],"about_ca_topic_score_codex":0.00010152581,"about_ca_topic_score_gemma":0.00045289312,"teacher_disagreement_score":0.88639945,"about_ca_system_score_codex":0.000031759893,"about_ca_system_score_gemma":0.00019385532,"threshold_uncertainty_score":0.9999936},"labels":[],"label_agreement":null},{"id":"W3137402593","doi":"10.1090/ulect/074","title":"Topological Persistence in Geometry and Analysis","year":2020,"lang":"en","type":"book","venue":"University lecture series","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Topology (electrical circuits); Geometry and topology; Topological data analysis; Embedding; Differential topology; Algebraic topology; Field (mathematics); Symplectic geometry; Computational topology; Symplectomorphism; Mathematics; Geometry; Pure mathematics; Computer science; Homotopy; Algorithm; Artificial intelligence; Combinatorics","score_opus":0.012680721432118267,"score_gpt":0.1795383173659771,"score_spread":0.16685759593385885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137402593","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025728398,0.0057846173,0.48465937,0.027891658,0.00035200553,0.0005069675,0.00056904706,0.00078172516,0.47688177],"genre_scores_gemma":[0.09870297,0.003107692,0.03111331,0.0021904807,0.00018535336,7.6224416e-7,0.0005866605,0.00001964653,0.8640931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985187,0.00007789754,0.0001420239,0.00076789124,0.00024446507,0.00024903394],"domain_scores_gemma":[0.99915135,0.00014146908,0.0001024285,0.00040113291,0.000049176848,0.00015441635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009061462,0.0002483904,0.0006360893,0.001292618,0.0001393558,0.00009625209,0.0010785818,0.0003495629,0.00024188508],"category_scores_gemma":[0.00010736242,0.00021675702,0.0002640291,0.0038309786,0.00028762443,0.00033995503,0.00094053184,0.0004780106,0.000021648024],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022084638,0.00018991827,0.016286893,0.00020696648,0.005057288,0.0068014013,0.0034599425,0.00093758415,0.0000146503935,0.9097938,0.020093407,0.03693729],"study_design_scores_gemma":[0.0003865723,0.0004485209,0.01730884,0.000023418885,0.0014805254,0.000037517966,0.00035415558,0.0016537856,0.00001079766,0.0291724,0.9480288,0.0010946532],"about_ca_topic_score_codex":0.000054113658,"about_ca_topic_score_gemma":0.0003296001,"teacher_disagreement_score":0.9279354,"about_ca_system_score_codex":0.00013458527,"about_ca_system_score_gemma":0.00009586457,"threshold_uncertainty_score":0.88390946},"labels":[],"label_agreement":null},{"id":"W3140444966","doi":"10.55016/ojs/cdm.v3i2.61933","title":"LC reductions yield isomorphic simplicial complexes","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Yield (engineering); Combinatorics; Simplicial complex; Materials science","score_opus":0.03808600290545455,"score_gpt":0.2923542278538305,"score_spread":0.2542682249483759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140444966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014659768,0.00008398052,0.97273916,0.009425271,0.0001636761,0.00024843644,0.00069526874,0.00027339984,0.0017110339],"genre_scores_gemma":[0.9521113,0.000036235797,0.046108622,0.00050239835,0.00016067519,0.00006187326,0.00009187787,0.0000068540744,0.0009201672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984212,0.000037973845,0.0004284053,0.00036642436,0.00032167247,0.0004243483],"domain_scores_gemma":[0.9981453,0.00034256495,0.000111219815,0.0008704137,0.00026577996,0.00026475525],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021781096,0.00018046553,0.00035895818,0.00030163533,0.00074739597,0.000119603355,0.0009779542,0.00008199855,0.00022020658],"category_scores_gemma":[0.0015582422,0.00014587192,0.00017888998,0.0021900542,0.00015912722,0.00027706163,0.0004464032,0.00016119244,0.00085551874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034711045,0.00036354412,0.00011602348,0.000010763145,0.00010699217,0.000032512235,0.0006534663,0.00033220657,0.0014213863,0.93956786,0.05626707,0.0011246707],"study_design_scores_gemma":[0.0023707491,0.001363701,0.01274196,0.00020768019,0.0006577794,0.0018184916,0.0011599658,0.07964888,0.011761933,0.5680877,0.31624377,0.0039374195],"about_ca_topic_score_codex":0.000044928234,"about_ca_topic_score_gemma":0.0000121483745,"teacher_disagreement_score":0.93745154,"about_ca_system_score_codex":0.000066307555,"about_ca_system_score_gemma":0.00006535998,"threshold_uncertainty_score":0.99992245},"labels":[],"label_agreement":null},{"id":"W3158771626","doi":"10.1016/j.ijar.2021.10.012","title":"Phenotyping OSA: a time series analysis using fuzzy clustering and persistent homology","year":2021,"lang":"en","type":"article","venue":"International Journal of Approximate Reasoning","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Cluster analysis; Persistent homology; Fuzzy logic; Embedding; Sleep apnea; Computer science; Fuzzy clustering; Topological data analysis; Population; Time series; Mathematics; Pattern recognition (psychology); Data mining; Artificial intelligence; Machine learning; Medicine; Algorithm; Internal medicine","score_opus":0.015607057797437023,"score_gpt":0.2601489393057628,"score_spread":0.24454188150832581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158771626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27580786,0.0017680494,0.7201246,0.0012717291,0.00029679472,0.000022707507,0.000008562648,0.000023988327,0.00067567505],"genre_scores_gemma":[0.7324785,0.00024846112,0.26682618,0.00014309256,0.00015840826,6.6864885e-7,0.00000935554,0.0000059511067,0.0001293926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986216,0.000091941125,0.00042597362,0.00025291636,0.0004132485,0.00019436682],"domain_scores_gemma":[0.99870145,0.00010497758,0.00039014668,0.00017121088,0.0005294248,0.000102757585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047228936,0.000119888784,0.00036599828,0.0006180895,0.00010440556,0.0003611304,0.0006090205,0.00005248564,0.00005933677],"category_scores_gemma":[0.0002871751,0.00010145094,0.00030843742,0.0010733735,0.00005792086,0.00075438747,0.00059324864,0.00015898624,0.0000030092785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006718789,0.0015499339,0.06807088,0.00018304709,0.06822015,0.015570495,0.011085156,0.23197734,0.043745123,0.20112723,0.0004390113,0.35735974],"study_design_scores_gemma":[0.00077782176,0.0001246327,0.005432818,0.00016071282,0.0011129245,0.0075128004,0.0008436291,0.9774862,0.0010839939,0.004349557,0.000711324,0.0004036143],"about_ca_topic_score_codex":0.000023074435,"about_ca_topic_score_gemma":0.000004283364,"teacher_disagreement_score":0.74550885,"about_ca_system_score_codex":0.00008876609,"about_ca_system_score_gemma":0.00006515121,"threshold_uncertainty_score":0.4137049},"labels":[],"label_agreement":null},{"id":"W3159017946","doi":"10.15173/sciential.v1i5.2537","title":"The Value of Manifold Learning Algorithms in Simplifying Complex Datasets for More Efficacious Analysis","year":2020,"lang":"en","type":"article","venue":"Sciential - McMaster Undergraduate Science Journal","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Nonlinear dimensionality reduction; Dimensionality reduction; Curse of dimensionality; Manifold (fluid mechanics); Embedding; Computer science; Filter (signal processing); Key (lock); Feature (linguistics); Space (punctuation); Clustering high-dimensional data; Manifold alignment; Artificial intelligence; Algorithm; Data mining; Pattern recognition (psychology); Cluster analysis","score_opus":0.0396700500878683,"score_gpt":0.3077831244121165,"score_spread":0.26811307432424825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159017946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02197672,0.00011151978,0.95727175,0.01980022,0.00036822425,0.00022072335,0.000061410756,0.000040377756,0.00014906836],"genre_scores_gemma":[0.971267,0.000043005908,0.028041044,0.0004509945,0.00009694241,0.0000038092037,0.000020340702,0.0000058674123,0.00007101303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99564654,0.00015845384,0.00082141935,0.00084869284,0.0016261657,0.0008987025],"domain_scores_gemma":[0.9978858,0.00033261967,0.0005608849,0.00047418324,0.00028450313,0.00046199988],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0038371172,0.00021651079,0.00045171307,0.0010617917,0.0017316866,0.00150803,0.0043237316,0.000046220157,0.00003119899],"category_scores_gemma":[0.00086648704,0.00013976381,0.00034972225,0.015129979,0.00087737263,0.0013411334,0.0011324983,0.00042857093,0.000010566598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023471452,0.00068313663,0.016090073,0.00008218143,0.0012142323,0.00018277863,0.0050263056,0.39833128,0.025851669,0.09722156,0.0044963057,0.45058575],"study_design_scores_gemma":[0.00071155396,0.00027781416,0.009612147,0.000010548679,0.00015722787,0.00003000124,0.00053409854,0.9774073,0.00059386453,0.00419761,0.006205274,0.00026260866],"about_ca_topic_score_codex":0.000042515,"about_ca_topic_score_gemma":0.000022954371,"teacher_disagreement_score":0.9492903,"about_ca_system_score_codex":0.00007880195,"about_ca_system_score_gemma":0.00020500681,"threshold_uncertainty_score":0.9995679},"labels":[],"label_agreement":null},{"id":"W3162826551","doi":"","title":"Semi-supervised, Topology-Aware Segmentation of Tubular Structures from Live Imaging 3D Microscopy","year":2021,"lang":"en","type":"preprint","venue":"RUCforsk (Roskilde University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Compute Canada","funders":"","keywords":"Segmentation; Autoencoder; Consistency (knowledge bases); Ground truth; Artificial intelligence; Computer science; Representation (politics); Task (project management); Pattern recognition (psychology); Variation (astronomy); Net (polyhedron); Topology (electrical circuits); Deep learning; Machine learning; Mathematics; Geometry","score_opus":0.00927312754177153,"score_gpt":0.22281091462373037,"score_spread":0.21353778708195884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3162826551","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03431062,0.0009923895,0.96274376,0.00030662,0.00067086774,0.00020580554,0.0006005898,0.00013369697,0.00003563621],"genre_scores_gemma":[0.10155008,0.00073523336,0.89555705,0.00025239325,0.00011486422,0.0000014868232,0.0012038858,0.000017198452,0.00056782685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750483,0.0002187025,0.00037173353,0.0011297977,0.00038729547,0.00038765094],"domain_scores_gemma":[0.9978142,0.00018341835,0.00039936716,0.0011636766,0.00027435893,0.00016500101],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012003858,0.0003824403,0.0006913067,0.0008436546,0.00020240249,0.00019836903,0.0021729162,0.00033910782,0.00061784004],"category_scores_gemma":[0.000060848575,0.00039566593,0.00046268146,0.0012123421,0.00023548728,0.00048893574,0.0038839276,0.0005157592,0.000015304839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028290378,0.0015416123,0.12480058,0.0010266058,0.0065877293,0.0050956723,0.010255678,0.021031132,0.056123972,0.74596673,0.009150369,0.018136995],"study_design_scores_gemma":[0.006101353,0.00044933584,0.002058208,0.0010064605,0.0038442921,0.0000872026,0.01969841,0.0925405,0.03846361,0.8245983,0.0054857964,0.0056664925],"about_ca_topic_score_codex":0.0031070723,"about_ca_topic_score_gemma":0.0001370795,"teacher_disagreement_score":0.12274237,"about_ca_system_score_codex":0.00019760442,"about_ca_system_score_gemma":0.00020033031,"threshold_uncertainty_score":0.9998495},"labels":[],"label_agreement":null},{"id":"W3167968211","doi":"10.1142/s0129167x21500403","title":"Persistence modules, symplectic Banach–Mazur distance and Riemannian metrics","year":2021,"lang":"en","type":"article","venue":"International Journal of Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Symplectic geometry; Pure mathematics; Geodesic; Cotangent bundle; Mathematical analysis; Trigonometric functions; Geometry","score_opus":0.02949853466757768,"score_gpt":0.2636050591387573,"score_spread":0.23410652447117963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3167968211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028345378,0.0015820952,0.96541154,0.0034481038,0.00039921264,0.000019183062,0.000011663131,0.000012864972,0.00076997175],"genre_scores_gemma":[0.82520777,0.00046109743,0.17360194,0.00024808646,0.00009563686,5.671978e-7,0.0000020739653,0.0000039340694,0.00037887643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985319,0.000037976337,0.0004343429,0.00015831146,0.00071348296,0.00012402356],"domain_scores_gemma":[0.9982012,0.00034847163,0.00035727012,0.00022201962,0.00076472125,0.000106303516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003861341,0.00009349829,0.00022882436,0.00030706805,0.000050242663,0.00026259857,0.0009848978,0.00003671422,0.000049657567],"category_scores_gemma":[0.0013316489,0.0000719268,0.00012649361,0.0008205588,0.00005082987,0.00043051303,0.00027179657,0.00014371389,0.000009071138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012072207,0.0011999162,0.0049919793,0.000095291056,0.0011657855,0.0022443752,0.0018582752,0.0006126554,0.00042188296,0.90093863,0.0032796143,0.083179526],"study_design_scores_gemma":[0.002527108,0.000539591,0.016064815,0.0005546819,0.00048184898,0.009934517,0.0032633245,0.2705129,0.0035795076,0.6347716,0.05661446,0.0011556245],"about_ca_topic_score_codex":0.0000029416876,"about_ca_topic_score_gemma":0.0000059442295,"teacher_disagreement_score":0.7968624,"about_ca_system_score_codex":0.00006207469,"about_ca_system_score_gemma":0.000053063177,"threshold_uncertainty_score":0.29330897},"labels":[],"label_agreement":null},{"id":"W3171325567","doi":"10.32614/rj-2021-033","title":"Benchmarking R packages for Calculation of Persistent Homology","year":2021,"lang":"en","type":"article","venue":"The R Journal","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Cancer Institute; National Institutes of Health","keywords":"Benchmarking; R package; Homology (biology); Computer science; Persistent homology; Software; Software package; Programming language; Software engineering; Computational biology; Theoretical computer science; Computational science; Biology; Algorithm; Genetics; Amino acid","score_opus":0.0257368699423724,"score_gpt":0.2636360315381434,"score_spread":0.237899161595771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3171325567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078677244,0.0014206405,0.9152519,0.0041712984,0.00020025771,0.000024794648,0.0000028924617,0.0000057361376,0.00024523784],"genre_scores_gemma":[0.98522234,0.00011834998,0.014205481,0.00014130854,0.00010019178,6.222245e-7,0.0000026191028,0.0000010481309,0.00020801401],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994747,0.00009718286,0.00013857332,0.000068811365,0.00011598515,0.00010473315],"domain_scores_gemma":[0.9993499,0.00023329472,0.000096408534,0.00016807456,0.0001224382,0.000029869576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053166325,0.000034246088,0.00009161625,0.000057879446,0.00014886449,0.000034818746,0.00032983435,0.000020555823,0.000055158765],"category_scores_gemma":[0.00013891234,0.00001925405,0.000173951,0.00037652455,0.000030422943,0.000084303494,0.000101030106,0.000072228264,0.0000019226843],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050519542,0.0004221629,0.0074859606,0.000046195837,0.0013360902,0.00011391203,0.003854188,0.023295209,0.00602015,0.1249918,0.022914957,0.80946887],"study_design_scores_gemma":[0.0032611382,0.0023487438,0.19969054,0.000117603704,0.0015345912,0.0076612667,0.0027938443,0.5313537,0.014036701,0.16020975,0.07601925,0.0009729024],"about_ca_topic_score_codex":0.000005406827,"about_ca_topic_score_gemma":0.0000019819677,"teacher_disagreement_score":0.9065451,"about_ca_system_score_codex":0.000011112419,"about_ca_system_score_gemma":0.000027165297,"threshold_uncertainty_score":0.11449604},"labels":[],"label_agreement":null},{"id":"W3174325142","doi":"10.1142/s179352532350005x","title":"Systolic inequalities for the number of vertices","year":2023,"lang":"en","type":"article","venue":"Journal of Topology and Analysis","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"FP7 Ideas: European Research Council; European Commission; Russian Foundation for Basic Research; Agence Nationale de la Recherche; National Science Foundation","keywords":"Mathematics; Mathematical proof; Upper and lower bounds; Corollary; Path (computing); Combinatorics; Ideal (ethics); Inequality; Isoperimetric inequality; Pure mathematics; Mathematical analysis; Geometry; Law","score_opus":0.03374346195479653,"score_gpt":0.32491421385947267,"score_spread":0.2911707519046761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174325142","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5514697,0.0019164914,0.43262583,0.013462874,0.00025838817,0.000044685356,0.000024935664,0.000019868241,0.00017721178],"genre_scores_gemma":[0.99715376,0.00056365906,0.0016871652,0.00014913791,0.000051237726,0.0000016130413,0.0000017661239,0.0000011084057,0.0003905743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991928,0.00007859274,0.0003658685,0.00009525011,0.00014060386,0.00012691364],"domain_scores_gemma":[0.9981392,0.0011836962,0.00031203366,0.00018373938,0.00014114332,0.00004016375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088892045,0.00005698706,0.00036338612,0.0004621295,0.0001058669,0.000029306246,0.0005057449,0.000045185032,0.00005598948],"category_scores_gemma":[0.00034755774,0.000029667925,0.00030763834,0.0023782447,0.00013594983,0.00015351223,0.00011306016,0.00006963839,0.0000035661155],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009902646,0.00018193673,0.353587,0.00010345043,0.015387439,0.00005827237,0.0021265112,0.0031100854,0.00015102843,0.5551143,0.0053750416,0.06470589],"study_design_scores_gemma":[0.001814011,0.00080752483,0.58722734,0.00003735899,0.014439285,0.00025399445,0.0062287943,0.17036587,0.0008415913,0.1882588,0.029146964,0.0005784457],"about_ca_topic_score_codex":0.00006886089,"about_ca_topic_score_gemma":0.000013565741,"teacher_disagreement_score":0.44568405,"about_ca_system_score_codex":0.000004337751,"about_ca_system_score_gemma":0.000016240074,"threshold_uncertainty_score":0.12098228},"labels":[],"label_agreement":null},{"id":"W3176301449","doi":"10.1109/cvpr46437.2021.00945","title":"Confluent Vessel Trees with Accurate Bifurcations","year":2021,"lang":"en","type":"article","venue":"","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Robarts Clinical Trials; Vector Institute; University of Waterloo","funders":"","keywords":"Geodesic; Computer science; Pairwise comparison; Property (philosophy); Algorithm; Flow (mathematics); Voxel; Graph; Theoretical computer science; Topology (electrical circuits); Mathematics; Artificial intelligence; Geometry; Combinatorics","score_opus":0.02151161456830931,"score_gpt":0.25265393122768426,"score_spread":0.23114231665937496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176301449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011840691,0.00016158842,0.9613238,0.009774862,0.0000447592,0.000026918377,0.00000595047,0.00012269305,0.016698727],"genre_scores_gemma":[0.94833213,0.000045125973,0.040967025,0.0014706784,0.00001866418,0.000007608192,0.000018220928,0.0000018548735,0.009138671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937314,0.00002366865,0.0000937758,0.00024517273,0.00013959265,0.00012463008],"domain_scores_gemma":[0.99929863,0.00007381059,0.00002699342,0.00042683957,0.00010652871,0.00006720282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000052861793,0.000056946647,0.00009085987,0.00007590363,0.000074280535,0.00015548173,0.00037532405,0.00001798428,0.00043082287],"category_scores_gemma":[0.000049016067,0.00003396713,0.00003123481,0.0017199644,0.000028693388,0.00025297652,0.00015340112,0.000040298954,0.00015808977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021663338,0.0002545246,0.003524381,0.0000031602508,0.0001115564,0.00010303066,0.00011184665,0.0005961902,0.00042501828,0.93778247,0.008605474,0.048480175],"study_design_scores_gemma":[0.0011475633,0.0003063711,0.22447029,0.00001778653,0.00011210791,0.00013553746,0.00055390474,0.036901962,0.019218318,0.018252077,0.69800806,0.0008760244],"about_ca_topic_score_codex":0.000046863486,"about_ca_topic_score_gemma":0.000068745016,"teacher_disagreement_score":0.9364915,"about_ca_system_score_codex":0.000006436818,"about_ca_system_score_gemma":0.000047419235,"threshold_uncertainty_score":0.47172084},"labels":[],"label_agreement":null},{"id":"W3176785613","doi":"10.3336/gm.56.1.11","title":"Approximate inverse limits and (m,n)-dimensions","year":2021,"lang":"en","type":"article","venue":"Glasnik Matematicki","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Mathematics; Fixed point; Fixed-point theorem; Abelian group; Closeness; Inverse; Boundary (topology); Discrete mathematics; Pure mathematics; Combinatorics; Mathematical analysis; Geometry","score_opus":0.02291181565956979,"score_gpt":0.23995459829619695,"score_spread":0.21704278263662716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176785613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47485086,0.0028971608,0.48105523,0.017958334,0.00094221265,0.00046869405,0.000059803937,0.0010293317,0.020738382],"genre_scores_gemma":[0.70927495,0.0004398409,0.28238294,0.0034193082,0.00005817007,0.000032605447,0.00003808033,0.000014939302,0.004339182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881613,0.000082365026,0.0002534447,0.0003776884,0.00022295475,0.00024742287],"domain_scores_gemma":[0.99891037,0.000153356,0.00007510361,0.0006274577,0.00008344843,0.00015027651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002318366,0.00012295664,0.0002620719,0.00012621195,0.00013070626,0.00020831078,0.00035460456,0.000054313048,0.00013783747],"category_scores_gemma":[0.00027839202,0.000092697526,0.000060321217,0.0011116856,0.00005749101,0.0003351295,0.0005089183,0.000083498344,0.00031953288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066413236,0.00054603966,0.0022604226,0.0006072095,0.0003069736,0.0009252793,0.0012171502,0.000092622446,0.0039041971,0.92794234,0.037612285,0.024578858],"study_design_scores_gemma":[0.0034088504,0.0005028317,0.016343607,0.0005523756,0.0005836307,0.0017992761,0.0021438664,0.37142935,0.03662154,0.45889273,0.10457977,0.0031421767],"about_ca_topic_score_codex":0.000014474142,"about_ca_topic_score_gemma":0.000008736483,"teacher_disagreement_score":0.4690496,"about_ca_system_score_codex":0.0000105193485,"about_ca_system_score_gemma":0.000027071792,"threshold_uncertainty_score":0.41070554},"labels":[],"label_agreement":null},{"id":"W3183550367","doi":"10.4153/s0008439522000121","title":"On the homotopy and strong homotopy type of complexes of discrete Morse functions","year":2022,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Homotopy; Morse code; Disjoint union (topology); Morse theory; Discrete Morse theory; Disjoint sets; Type (biology); Circle-valued Morse theory; Simplicial complex; Combinatorics; Pure mathematics; Topology (electrical circuits); Computer science","score_opus":0.026061194120725252,"score_gpt":0.2359454288713518,"score_spread":0.20988423475062656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183550367","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8195662,0.00037695686,0.09357735,0.055274054,0.00021587744,0.0007571647,0.0008619493,0.00007160378,0.029298862],"genre_scores_gemma":[0.99711096,0.0000027815645,0.0014112197,0.0003322348,0.000007607039,0.00001557399,0.000007821423,0.000003658552,0.0011081509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910164,0.00009140246,0.0002143584,0.00018070644,0.00022312898,0.00018877971],"domain_scores_gemma":[0.9987608,0.00052373577,0.00007206168,0.00044331705,0.000038216956,0.00016183613],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003221085,0.00008122413,0.00020209792,0.00017757728,0.00021088318,0.000027130043,0.00056698546,0.000020818614,0.010257506],"category_scores_gemma":[0.00035137375,0.000053140408,0.00006185912,0.0007062195,0.00017386275,0.000019196958,0.0002193904,0.000138064,0.00015469636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036921613,0.000050784227,0.00010501897,0.000014873766,0.00003074183,0.000007131035,0.000107226886,0.00007395262,0.000030196032,0.9863277,0.012395847,0.00085284945],"study_design_scores_gemma":[0.0010318095,0.002721846,0.010896936,0.00010304966,0.00025104705,0.00011540012,0.0033900351,0.036123294,0.00053760555,0.63542455,0.30836844,0.0010359492],"about_ca_topic_score_codex":0.0012097143,"about_ca_topic_score_gemma":0.00015831347,"teacher_disagreement_score":0.3509031,"about_ca_system_score_codex":0.000027402919,"about_ca_system_score_gemma":0.000052925978,"threshold_uncertainty_score":0.99064726},"labels":[],"label_agreement":null},{"id":"W3189073627","doi":"10.1137/22m1528471","title":"Signatures, Lipschitz-Free Spaces, and Paths of Persistence Diagrams","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Applied Algebra and Geometry","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Persistence (discontinuity); Mathematics; Lipschitz continuity; Pure mathematics; Lipschitz domain; Topology (electrical circuits); Geology; Combinatorics","score_opus":0.013718285468928872,"score_gpt":0.21746740053188215,"score_spread":0.2037491150629533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189073627","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9748251,0.004860368,0.013178862,0.0037574375,0.00034732893,0.0001702516,0.00004542001,0.00016255821,0.0026526682],"genre_scores_gemma":[0.99434173,0.002392817,0.0024840848,0.00045018925,0.00010878034,0.0000036504914,0.000006852967,0.000007719623,0.00020416465],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982251,0.0000489524,0.0003388338,0.0004398263,0.00055096374,0.00039634964],"domain_scores_gemma":[0.9985271,0.00038921126,0.00022419833,0.00048813908,0.000054457967,0.00031690998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007347074,0.00020851294,0.00039243113,0.00097381376,0.00025457627,0.00020476471,0.00091207225,0.0001338598,0.00004631492],"category_scores_gemma":[0.00024285083,0.0001470466,0.000117297604,0.0033640387,0.00016529686,0.00020644839,0.00062342157,0.00047982123,0.000030993044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082131584,0.00028956038,0.006052919,0.00010064499,0.00033197735,0.00028410784,0.00054085435,0.00021903112,0.0014369605,0.39324066,0.010973422,0.5864477],"study_design_scores_gemma":[0.0058605406,0.002994532,0.44490337,0.00024956377,0.0003256329,0.0006323597,0.0027025202,0.0061478512,0.0033023912,0.47787166,0.052640945,0.0023686518],"about_ca_topic_score_codex":0.000005240069,"about_ca_topic_score_gemma":0.000002709617,"teacher_disagreement_score":0.5840791,"about_ca_system_score_codex":0.000012730666,"about_ca_system_score_gemma":0.000025566787,"threshold_uncertainty_score":0.5996386},"labels":[],"label_agreement":null},{"id":"W3195130179","doi":"10.1093/mnras/stab2326","title":"Persistent homology of the cosmic web – I. Hierarchical topology in ΛCDM cosmologies","year":2021,"lang":"en","type":"article","venue":"Monthly Notices of the Royal Astronomical Society","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"H2020 European Research Council; Government of Canada","keywords":"Physics; COSMIC cancer database; Structure formation; Persistent homology; Topology (electrical circuits); Cosmic string; Topological defect; Universe; Astrophysics; Galaxy; Theoretical physics; Computer science; Algorithm","score_opus":0.011987424170202198,"score_gpt":0.214841880434952,"score_spread":0.2028544562647498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195130179","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98864293,0.0004490316,0.00036216204,0.009794006,0.00030018747,0.00009200988,0.000042884025,0.00001408574,0.00030270565],"genre_scores_gemma":[0.9932773,0.0000013257686,0.0062004062,0.00023368711,0.000026442813,0.000006024701,0.000003654049,0.000003276131,0.00024785608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9982515,0.0003524024,0.0004380735,0.00039251093,0.00021086307,0.00035466137],"domain_scores_gemma":[0.9983872,0.0005064912,0.00022786116,0.00076439563,0.000058606587,0.00005545153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033227092,0.00014196859,0.00043268138,0.00002997493,0.0001059828,0.000023692868,0.0020901328,0.00014952892,0.00005773743],"category_scores_gemma":[0.0002663816,0.000080241756,0.0008512972,0.0006289555,0.0008845439,0.00006297362,0.0022685882,0.00037907416,0.000003981957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038120703,0.00081263133,0.23325089,0.00003581876,0.00040315278,0.0000032413739,0.00055234676,0.74684125,0.00015070177,0.010286237,0.0027873851,0.0048382403],"study_design_scores_gemma":[0.00063101406,0.00015364832,0.60773313,0.000017025699,0.00008912319,3.589538e-7,0.00050114264,0.38731563,0.00080506544,0.0013488961,0.0012366748,0.00016828011],"about_ca_topic_score_codex":0.00031363618,"about_ca_topic_score_gemma":0.00010588499,"teacher_disagreement_score":0.37448224,"about_ca_system_score_codex":0.00007944699,"about_ca_system_score_gemma":0.00012478395,"threshold_uncertainty_score":0.38840213},"labels":[],"label_agreement":null},{"id":"W3196096170","doi":"10.48550/arxiv.2108.09810","title":"ICLR 2021 Challenge for Computational Geometry &amp; Topology: Design and Results","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Topology (electrical circuits); Computational topology; Geometry and topology; Representation (politics); Computer science; Geometry; Mathematics; Political science; Combinatorics","score_opus":0.12929319780648235,"score_gpt":0.22498756362290293,"score_spread":0.09569436581642057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196096170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029752558,0.000462851,0.9675985,0.0011299336,0.00029144474,0.0002480823,0.00012378556,0.000076135686,0.0003167134],"genre_scores_gemma":[0.90215826,0.000732846,0.09497266,0.00014603301,0.00008518777,0.0000021055282,0.00034059293,0.00000834659,0.0015539859],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974973,0.00021889486,0.00030568612,0.001511684,0.000109387365,0.00035705208],"domain_scores_gemma":[0.99735826,0.0010117464,0.00027033204,0.0008876606,0.00027881833,0.00019317302],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062652456,0.00027552596,0.00046644933,0.0005464802,0.00021885472,0.00019220093,0.0011995718,0.00035173184,0.00007334413],"category_scores_gemma":[0.0003630451,0.00028665722,0.00022651676,0.0013258904,0.0001756717,0.00027705068,0.0023241767,0.00036508773,0.000028455048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012725074,0.00036941364,0.00036099143,0.00009340671,0.0005448682,0.0003490549,0.00031387154,0.7125166,0.0000044913663,0.2730604,0.0024482592,0.0098113995],"study_design_scores_gemma":[0.001548962,0.00020941759,0.0018611118,0.000049808183,0.00022760149,0.000014679663,0.00020086262,0.7545319,0.000016839642,0.23447795,0.006037984,0.00082282844],"about_ca_topic_score_codex":0.000102190825,"about_ca_topic_score_gemma":0.000037883518,"teacher_disagreement_score":0.8726258,"about_ca_system_score_codex":0.00007897871,"about_ca_system_score_gemma":0.0001445634,"threshold_uncertainty_score":0.9999586},"labels":[],"label_agreement":null},{"id":"W3206978967","doi":"10.2140/agt.2023.23.2895","title":"Bifiltrations and persistence paths for 2–Morsefunctions","year":2023,"lang":"en","type":"article","venue":"Algebraic & Geometric Topology","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Homotopy; Morse code; Persistent homology; Filtration (mathematics); Pure mathematics; Morse theory; Path (computing); Persistence (discontinuity); Homology (biology); Topology (electrical circuits); Combinatorics; Algorithm; Computer science","score_opus":0.040756222342440925,"score_gpt":0.26201996850914383,"score_spread":0.2212637461667029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206978967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09949242,0.0011072218,0.8773353,0.017870743,0.0011879441,0.00041488715,0.0001037048,0.000786839,0.0017009525],"genre_scores_gemma":[0.98436415,0.00033923614,0.010227459,0.00084540056,0.00012319676,0.00014158268,0.00008394211,0.000009400106,0.0038656436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982102,0.000062501014,0.00030529313,0.00067487627,0.00019895,0.00054820336],"domain_scores_gemma":[0.99760884,0.0014220619,0.000096063726,0.00057626603,0.000118193966,0.00017854871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049819367,0.00016638484,0.00029269964,0.0024888301,0.00047089104,0.00011764337,0.00072044716,0.00013552097,0.00015710319],"category_scores_gemma":[0.0015558865,0.0001413271,0.00014989277,0.013304891,0.00022274959,0.00034061354,0.00037403943,0.00012874245,0.00027501408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007699166,0.0001458771,0.0070952745,0.000022922883,0.00018592252,0.000030161718,0.000257277,0.00008988159,0.0001501584,0.7271953,0.02753369,0.23728584],"study_design_scores_gemma":[0.0021446585,0.002198829,0.30583218,0.000011713688,0.0003416654,0.00030823107,0.0015492375,0.029386004,0.00040544488,0.29487845,0.36141625,0.0015273192],"about_ca_topic_score_codex":0.00007508262,"about_ca_topic_score_gemma":0.000026046122,"teacher_disagreement_score":0.8848717,"about_ca_system_score_codex":0.00002435034,"about_ca_system_score_gemma":0.00004770435,"threshold_uncertainty_score":0.63925594},"labels":[],"label_agreement":null},{"id":"W3214340599","doi":"10.1038/s41531-021-00240-4","title":"A versatile computational algorithm for time-series data analysis and machine-learning models","year":2021,"lang":"en","type":"article","venue":"npj Parkinson s Disease","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Alberta Children's Hospital; University of Calgary","funders":"Alberta Children's Hospital Research Institute; Fondation Brain Canada","keywords":"Computer science; Handwriting; Simple (philosophy); Series (stratigraphy); Artificial intelligence; Algorithm; Time series; Machine learning; SIMPLE algorithm","score_opus":0.04186667416350517,"score_gpt":0.2643719267424362,"score_spread":0.22250525257893103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214340599","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008360144,0.0013877627,0.99514395,0.00082296005,0.000029645715,0.000068266345,0.0015284285,0.00008297361,0.00009999797],"genre_scores_gemma":[0.24006908,0.00022709239,0.74922764,0.0006340796,0.000083185616,0.000033332388,0.008135746,0.0000124558965,0.0015773607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845445,0.00009938565,0.00019501644,0.0007396239,0.00029961078,0.00021189569],"domain_scores_gemma":[0.9985993,0.00026150435,0.00007994013,0.0006669811,0.00012326034,0.00026901966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023036175,0.00013106031,0.0002598023,0.00023403035,0.00021979623,0.00028862566,0.00062236725,0.00003379664,0.0001671199],"category_scores_gemma":[0.00021823698,0.00011718342,0.00012683788,0.0017884662,0.000054883396,0.00083277916,0.0007928656,0.00007562739,0.000019360587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007976147,0.00058496045,0.020681314,0.000050756746,0.0023532005,0.00027312688,0.00022657194,0.10289166,0.00001026933,0.01785388,0.004618262,0.85037625],"study_design_scores_gemma":[0.0002457973,0.000020065705,0.006996511,0.000002201036,0.00041582267,0.0000019872698,0.000013365548,0.9520319,0.0000062014396,0.009770726,0.030345684,0.00014972255],"about_ca_topic_score_codex":0.000042906082,"about_ca_topic_score_gemma":0.000012408201,"teacher_disagreement_score":0.8502265,"about_ca_system_score_codex":0.000014026253,"about_ca_system_score_gemma":0.000084001826,"threshold_uncertainty_score":0.47786012},"labels":[],"label_agreement":null},{"id":"W3216107441","doi":"10.37236/9849","title":"Biconed Graphs, Weighted Forests, and $h$-Vectors of Matroid Complexes","year":2021,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Texas State University; National Science Foundation","keywords":"Combinatorics; Matroid; Mathematics; Graphic matroid; Conjecture; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.007220578002477035,"score_gpt":0.21947755174072303,"score_spread":0.212256973738246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216107441","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87048763,0.019858513,0.10669826,0.0024755371,0.00025254968,0.00004957529,0.0000030500396,0.000017583643,0.00015729794],"genre_scores_gemma":[0.9974583,0.0021372132,0.00023016392,0.000060782666,0.000019200872,4.7392518e-7,0.0000014411384,0.000004207649,0.00008826464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985003,0.00016952002,0.00043260364,0.00014101637,0.0004046785,0.00035187928],"domain_scores_gemma":[0.998469,0.00034400434,0.00041467207,0.00035770735,0.00033252712,0.00008211944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070888374,0.0001163245,0.00036831686,0.00023125597,0.00010869157,0.00006389544,0.0009139836,0.000046398705,0.000016884733],"category_scores_gemma":[0.00013421942,0.0000702503,0.00016218927,0.0021396384,0.0001065634,0.00022242745,0.0002275378,0.00035243342,0.0000014226163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009927288,0.000112374524,0.0026736,0.0000067428364,0.00015388853,0.000016295013,0.000055606386,0.0000061387905,0.0004655389,0.99464977,0.00028252747,0.0015676025],"study_design_scores_gemma":[0.00057402893,0.00048282876,0.009218248,0.000011148899,0.00008512156,0.00028740265,0.00005349966,0.00049319334,0.0061368733,0.980135,0.0024184908,0.00010413962],"about_ca_topic_score_codex":0.000015110454,"about_ca_topic_score_gemma":0.0000123018635,"teacher_disagreement_score":0.12697062,"about_ca_system_score_codex":0.000048263984,"about_ca_system_score_gemma":0.00021479824,"threshold_uncertainty_score":0.2864724},"labels":[],"label_agreement":null},{"id":"W3216147440","doi":"10.1007/s13239-021-00590-3","title":"Spectral-Clustering of Lagrangian Trajectory Graphs: Application to Abdominal Aortic Aneurysms","year":2021,"lang":"en","type":"article","venue":"Cardiovascular Engineering and Technology","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Spectral clustering; Cluster analysis; Trajectory; Graph; Fluid dynamics; Topology (electrical circuits); Computer science; Physics; Discrete mathematics; Artificial intelligence; Combinatorics; Mechanics","score_opus":0.004539281865310953,"score_gpt":0.1832368790102193,"score_spread":0.17869759714490835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216147440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12016921,0.003962079,0.87524074,0.00025865578,0.00006835914,0.000059697282,0.0000024473118,0.00019187201,0.000046925234],"genre_scores_gemma":[0.96534497,0.00013407772,0.03445155,0.000015077958,0.00001570571,0.000018390947,0.0000028730349,0.0000056984313,0.00001163007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991127,0.000013964022,0.00016122447,0.00037122727,0.00014008075,0.00020080508],"domain_scores_gemma":[0.9991389,0.00002290293,0.000021485765,0.0006895127,0.00006097124,0.000066261404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016390682,0.00010560803,0.00031633244,0.00052390393,0.000031158972,0.000020519297,0.00031401752,0.0000958343,0.0000021539947],"category_scores_gemma":[0.00009288697,0.00010206419,0.00019110872,0.0024830261,0.000033228316,0.000060301198,0.00020528106,0.00011049871,0.0000041689773],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040067384,0.00009233123,0.0012041809,0.0001976218,0.0013581518,0.00033148343,0.0001176608,0.06713553,0.069312975,0.04647891,0.000034306817,0.81373286],"study_design_scores_gemma":[0.0024724312,0.0006634377,0.041865353,0.00017108467,0.0012901222,0.003370775,0.00039114273,0.6456603,0.23506634,0.0091753565,0.057420213,0.0024534427],"about_ca_topic_score_codex":0.0000141408955,"about_ca_topic_score_gemma":0.0000024725225,"teacher_disagreement_score":0.8451758,"about_ca_system_score_codex":0.000012348765,"about_ca_system_score_gemma":0.0000100447505,"threshold_uncertainty_score":0.41620567},"labels":[],"label_agreement":null},{"id":"W326312060","doi":"","title":"On constrained 2-Partitions of monochromatic sets and generalizations in the sense of Erdos-Ginzburg-Ziv.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monochromatic color; Mathematics; Combinatorics; Sense (electronics); Physics; Chemistry; Optics","score_opus":0.0150296317507517,"score_gpt":0.2522213373162421,"score_spread":0.23719170556549038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W326312060","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9928115,0.00010087027,0.0035295764,0.0025548316,0.000068413436,0.000098178745,0.000020945903,0.00001664945,0.0007990314],"genre_scores_gemma":[0.99762106,0.000023365475,0.0020640264,0.00025627483,0.0000017454252,0.0000061653272,0.000008201258,0.0000015970179,0.000017582599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921745,0.000103554004,0.000250823,0.00014622422,0.00016944976,0.000112488444],"domain_scores_gemma":[0.99913967,0.00034224795,0.00009348387,0.00034708504,0.000043888816,0.000033617325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025016043,0.00006907334,0.00016314026,0.00018391067,0.000051024246,0.000022174932,0.0002723065,0.00003306324,0.000026574964],"category_scores_gemma":[0.0001405339,0.00004785235,0.000048109905,0.0011303776,0.000116025556,0.0001273211,0.000070173824,0.000058057216,0.0000052745163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011142193,0.00021222085,0.0005060475,0.000005596835,0.000016599459,0.0000037611167,0.0003252651,0.0005947447,0.000103239574,0.9960138,0.0007491285,0.0014684731],"study_design_scores_gemma":[0.0009596899,0.0002511884,0.020782562,0.00003201087,0.000045938497,0.000018596416,0.00013898361,0.04526752,0.0010127366,0.930877,0.00044422978,0.00016958406],"about_ca_topic_score_codex":0.00005020646,"about_ca_topic_score_gemma":0.000016792384,"teacher_disagreement_score":0.06513685,"about_ca_system_score_codex":0.0000091647935,"about_ca_system_score_gemma":0.000018324456,"threshold_uncertainty_score":0.19513622},"labels":[],"label_agreement":null},{"id":"W4200481646","doi":"10.36939/ir.202112231202","title":"Cubical homology-based Image Classification - A Comparative Study","year":2021,"lang":"en","type":"dissertation","venue":"","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Winnipeg","keywords":"Persistent homology; Topological data analysis; Histogram; Pattern recognition (psychology); Artificial intelligence; Homology (biology); Pixel; Topology (electrical circuits); Digital image; Computer science; Mathematics; Algorithm; Image (mathematics); Image processing; Biology; Combinatorics","score_opus":0.057741368176086126,"score_gpt":0.3497655258012138,"score_spread":0.2920241576251277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200481646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24499273,0.000631827,0.65880615,0.0018005404,0.0015280744,0.0013078684,0.00007117245,0.0007688798,0.09009278],"genre_scores_gemma":[0.92359626,0.00001036216,0.05158458,0.00028439186,0.00007649975,0.00016600352,0.00369482,0.000010610655,0.020576468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99768984,0.00027457,0.0004147032,0.00092393864,0.0004518385,0.00024510713],"domain_scores_gemma":[0.9981957,0.00024459916,0.0002173879,0.0009079176,0.0003260968,0.0001082855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023907878,0.0002616529,0.0005830177,0.0004519773,0.00014918052,0.00029900522,0.0011779525,0.00021126353,0.000753439],"category_scores_gemma":[0.0001193877,0.00019934519,0.0001983788,0.0022476015,0.000046614496,0.00022099823,0.000107618594,0.00034633031,0.0003359549],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005105632,0.04855266,0.014308973,0.00043072124,0.004879301,0.0028682202,0.01848075,0.00015767029,0.0073708296,0.55839044,0.11293514,0.23111473],"study_design_scores_gemma":[0.0040960796,0.0032206757,0.7866762,0.00009399406,0.0012973073,0.000021352536,0.03803319,0.13066316,0.006352037,0.008864295,0.01686404,0.0038176684],"about_ca_topic_score_codex":0.00013962897,"about_ca_topic_score_gemma":0.0005483145,"teacher_disagreement_score":0.77236724,"about_ca_system_score_codex":0.000043725126,"about_ca_system_score_gemma":0.00017550038,"threshold_uncertainty_score":0.82496285},"labels":[],"label_agreement":null},{"id":"W4205455326","doi":"10.1016/j.dam.2016.01.016","title":"On <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>r</mml:mi></mml:math>-dynamic coloring of graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; List coloring; Edge coloring; Vertex (graph theory); Complete coloring; Graph; Greedy coloring; Graph power; Line graph","score_opus":0.01528063017840748,"score_gpt":0.24052918085165914,"score_spread":0.22524855067325167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205455326","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8958418,0.000059770733,0.09947769,0.00023346345,0.00019725673,0.000078438505,0.00011329783,0.00015003467,0.0038482652],"genre_scores_gemma":[0.9732142,0.00015131859,0.026009783,0.00021766871,0.000065653345,0.00012445849,0.000055394714,0.000048023354,0.000113478614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711496,0.00002883195,0.00073564344,0.0006613052,0.00084725406,0.00061200187],"domain_scores_gemma":[0.99689585,0.00086156116,0.00061227963,0.0013681384,0.000050859067,0.0002113317],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005980934,0.00034179806,0.0003821322,0.0002469187,0.0002652602,0.00018296654,0.001381883,0.00028372277,0.000053610922],"category_scores_gemma":[0.00031237793,0.00027470003,0.0004091332,0.00090040156,0.00029789208,0.0003267478,0.0008837703,0.00025682422,0.0006877681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042120297,0.00018227943,0.000003788208,0.0001740791,0.00019222403,0.000032954675,0.00031282607,0.00015782534,0.0022502763,0.99341995,0.00016061471,0.0030710734],"study_design_scores_gemma":[0.0008021671,0.00040775497,0.000083874205,0.00027425928,0.00025022487,0.000036610647,0.0003037939,0.91885173,0.008149752,0.069672644,0.0006292791,0.000537899],"about_ca_topic_score_codex":0.000035138164,"about_ca_topic_score_gemma":0.000021707483,"teacher_disagreement_score":0.9237473,"about_ca_system_score_codex":0.000017835162,"about_ca_system_score_gemma":0.000076985794,"threshold_uncertainty_score":0.9999705},"labels":[],"label_agreement":null},{"id":"W4206795002","doi":"10.1186/s12859-022-04559-4","title":"Topology preserving stratification of tissue neoplasticity using Deep Neural Maps and microRNA signatures","year":2022,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Queen's University","funders":"Southeastern Ontario Academic Medical Organization; Natural Sciences and Engineering Research Council of Canada","keywords":"microRNA; Computational biology; Artificial intelligence; Cluster analysis; Cancer; DNA microarray; Deep learning; Biology; Artificial neural network; Machine learning; Computer science; Bioinformatics; Gene expression; Gene; Genetics","score_opus":0.02635764017547924,"score_gpt":0.257129791685578,"score_spread":0.23077215151009875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206795002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06656271,0.00022129554,0.9324841,0.00018011055,0.00012781788,0.00010916868,0.000042901687,0.000033632292,0.00023828326],"genre_scores_gemma":[0.662384,0.000004769462,0.33741468,0.000114353665,0.000017767203,0.00000382034,0.000029952997,0.0000021898204,0.000028503657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991122,0.000065010536,0.00033298414,0.00012802797,0.00020060113,0.00016119496],"domain_scores_gemma":[0.99920726,0.00018596686,0.0002208865,0.00029422616,0.00004250601,0.000049181148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021361407,0.00008344231,0.00015978534,0.00018932552,0.00019991444,0.00006185437,0.0005828461,0.000041154934,0.00006364014],"category_scores_gemma":[0.00010048719,0.00007084544,0.000031418,0.0007077995,0.00006819219,0.0003547054,0.00074377254,0.00012804226,0.000001722549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010366998,0.00065525423,0.020773172,0.0011529508,0.00024449022,0.00002539763,0.010433294,0.50093883,0.013691181,0.2070255,0.0033330477,0.24162324],"study_design_scores_gemma":[0.000106884974,0.00009753806,0.0031066805,0.0000013379887,0.000016798813,0.00002185588,0.00038240087,0.9934765,0.0004387172,0.0017555397,0.00050530635,0.000090424975],"about_ca_topic_score_codex":0.00007961667,"about_ca_topic_score_gemma":0.000020447062,"teacher_disagreement_score":0.59582126,"about_ca_system_score_codex":0.000017828323,"about_ca_system_score_gemma":0.000024781175,"threshold_uncertainty_score":0.2888993},"labels":[],"label_agreement":null},{"id":"W4210496160","doi":"10.4171/owr/2019/1","title":"Graph Theory","year":2020,"lang":"de","type":"article","venue":"Oberwolfach Reports","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Mathematics","score_opus":0.028845648065148822,"score_gpt":0.23649593609107875,"score_spread":0.2076502880259299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210496160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01768043,0.04447657,0.8561381,0.03493414,0.0060250848,0.0006824265,0.00010677361,0.0010350744,0.038921416],"genre_scores_gemma":[0.9828983,0.00064766215,0.0047856113,0.006794102,0.0010758421,0.00001401845,0.0000926105,0.000025144513,0.0036667327],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99574655,0.00029411085,0.0009928258,0.0014558735,0.0008284853,0.00068215193],"domain_scores_gemma":[0.9968682,0.0002251869,0.000580747,0.0014072817,0.00014516168,0.0007734422],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011172208,0.00038349867,0.0006262205,0.000231207,0.00026754042,0.000436629,0.0010345003,0.0002194601,0.0020915198],"category_scores_gemma":[0.0013679683,0.00030924092,0.0005099153,0.0039295605,0.00021910104,0.0004684624,0.0010208264,0.00045735046,0.0017558438],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007492446,0.0009314524,0.032185987,0.00018414068,0.0019526073,0.036426894,0.002676512,0.000623765,0.00031398365,0.20317556,0.18554997,0.5359042],"study_design_scores_gemma":[0.00024710014,0.00041395793,0.009649223,0.000027016647,0.0005259339,0.00025477423,0.000093353476,0.0027334846,0.0005277949,0.070322804,0.91426766,0.00093688513],"about_ca_topic_score_codex":0.000083430605,"about_ca_topic_score_gemma":0.0000021401354,"teacher_disagreement_score":0.9652178,"about_ca_system_score_codex":0.000027817192,"about_ca_system_score_gemma":0.000112833404,"threshold_uncertainty_score":0.999936},"labels":[],"label_agreement":null},{"id":"W4213060114","doi":"10.1016/b0-12-227410-5/00784-5","title":"Topology, General","year":2003,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Topology (electrical circuits); Computer science; Mathematics; Combinatorics","score_opus":0.019090789416873203,"score_gpt":0.24122715901079247,"score_spread":0.22213636959391928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213060114","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002892892,0.0013638666,0.0026773247,0.0008169563,0.0005927694,0.00013744118,0.000026988622,0.0001338642,0.9942479],"genre_scores_gemma":[0.00003189754,0.00011813002,0.010371225,0.0032283368,0.00030096158,0.000010720646,0.000022765165,0.000020036823,0.98589593],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99797577,0.000043839787,0.00041802193,0.000805556,0.00035062022,0.00040616977],"domain_scores_gemma":[0.99816424,0.000068898844,0.0002117675,0.0012811235,0.00008106001,0.00019290372],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025186632,0.00039355468,0.0006046127,0.0003802881,0.00013416853,0.00011950601,0.0015196161,0.0004135249,0.00082252844],"category_scores_gemma":[0.00002480888,0.00031228986,0.00037854566,0.000076353936,0.00020127247,0.000081922495,0.0005612194,0.00044251792,0.0008859822],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.0115295e-7,0.0000043048635,0.0000015440473,0.000003610998,0.000060310784,0.000051427003,0.000008744034,4.3776157e-7,0.0000010589944,0.33696154,0.0024765797,0.66042995],"study_design_scores_gemma":[0.000085697844,0.00005113258,0.0000074272616,0.000010897591,0.00005102844,0.000033280856,4.483587e-7,0.000026570973,0.000010931147,0.13757479,0.861809,0.00033876105],"about_ca_topic_score_codex":0.0000013060156,"about_ca_topic_score_gemma":0.0000063788866,"teacher_disagreement_score":0.85933244,"about_ca_system_score_codex":0.000053741995,"about_ca_system_score_gemma":0.00005384768,"threshold_uncertainty_score":0.99993294},"labels":[],"label_agreement":null},{"id":"W4213406532","doi":"10.1007/978-3-031-01333-1_14","title":"Exploring the Geometry and Topology of Neural Network Loss Landscapes","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Maxima and minima; Dimensionality reduction; Generalization; Artificial neural network; Visualization; Nonlinear dimensionality reduction; Topology (electrical circuits); Jump; Reduction (mathematics); Trajectory; Manifold (fluid mechanics); Algorithm; Artificial intelligence; Mathematics; Geometry","score_opus":0.03630738852770949,"score_gpt":0.24030680133088006,"score_spread":0.20399941280317058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213406532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006565275,0.0020525584,0.98628306,0.0025239813,0.0015923227,0.00015728544,0.000011092337,0.000059856986,0.00075454806],"genre_scores_gemma":[0.95309424,0.0007260035,0.04405844,0.0013764966,0.0005572191,0.000016114649,0.0000078606345,0.0000151978265,0.00014843483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974736,0.00006223527,0.00039724106,0.00093011156,0.00064038904,0.00049642514],"domain_scores_gemma":[0.99740154,0.0012195368,0.00023654857,0.0009801302,0.0000719565,0.00009027639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096363784,0.00028300725,0.0004999169,0.00070327264,0.0003590006,0.00016556536,0.0030742914,0.00008967469,0.00009140224],"category_scores_gemma":[0.00012078697,0.00018478755,0.000115420684,0.0019819895,0.00079760194,0.00046592727,0.0036564528,0.0006718221,0.0000033443805],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058945725,0.000017794437,0.0010861171,0.00001756019,0.000029617484,0.00008332681,0.00031261,0.09365594,0.000003823049,0.10300647,0.000022876568,0.801758],"study_design_scores_gemma":[0.0005826035,0.0010818185,0.012428654,0.0001304196,0.000089078116,0.00047805955,0.000003097947,0.5203363,0.00017537604,0.43219343,0.030938827,0.0015623572],"about_ca_topic_score_codex":0.000077883735,"about_ca_topic_score_gemma":0.000060722676,"teacher_disagreement_score":0.946529,"about_ca_system_score_codex":0.000047720372,"about_ca_system_score_gemma":0.00007372404,"threshold_uncertainty_score":0.75354177},"labels":[],"label_agreement":null},{"id":"W4214861559","doi":"10.3390/axioms11030112","title":"Cubical Homology-Based Machine Learning: An Application in Image Classification","year":2022,"lang":"en","type":"article","venue":"Axioms","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Persistent homology; Topological data analysis; Artificial intelligence; Histogram; Pattern recognition (psychology); Topology (electrical circuits); Pixel; Homology (biology); Computer science; Digital image; Mathematics; Algorithm; Image processing; Image (mathematics); Biology; Combinatorics","score_opus":0.020714720683029073,"score_gpt":0.26667880356643037,"score_spread":0.2459640828834013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214861559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08762433,0.00006203453,0.9081842,0.0034137706,0.00004651073,0.00009500512,0.000009540606,0.00013492999,0.0004297036],"genre_scores_gemma":[0.9953777,0.0000029071618,0.0038142428,0.00035886094,0.000014949678,0.000092836686,0.00022565929,0.000003323473,0.00010951142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882084,0.00022652964,0.00017158304,0.00039716487,0.00021444973,0.00016941292],"domain_scores_gemma":[0.99932456,0.00007938048,0.00007582665,0.0004401999,0.000020918811,0.00005910493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045406068,0.00007089611,0.00011426687,0.000321204,0.00017124985,0.000043111006,0.0007835484,0.000033122335,0.00014792207],"category_scores_gemma":[0.00006295082,0.000064211774,0.000040806415,0.0019842852,0.00004905836,0.00019824051,0.00023060205,0.00025486044,0.00006915815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049051312,0.0019654839,0.034966715,0.000009487957,0.000022368686,0.000078143414,0.00041400644,0.0086212475,0.011383361,0.5052424,0.00033271656,0.43691504],"study_design_scores_gemma":[0.00025466798,0.00020895264,0.061325077,3.0190114e-7,0.0000046553096,0.000006163697,0.000045172284,0.9241534,0.00011144223,0.0027925477,0.010980405,0.000117195596],"about_ca_topic_score_codex":0.00036843598,"about_ca_topic_score_gemma":0.000036324767,"teacher_disagreement_score":0.9155322,"about_ca_system_score_codex":0.000056098554,"about_ca_system_score_gemma":0.00002297644,"threshold_uncertainty_score":0.26184803},"labels":[],"label_agreement":null},{"id":"W4220914713","doi":"10.4171/owr/2021/8","title":"Nonpositively Curved Complexes","year":2022,"lang":"en","type":"article","venue":"Oberwolfach Reports","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Geometry; Computer science; Physics","score_opus":0.016869860771580952,"score_gpt":0.23136575206131116,"score_spread":0.2144958912897302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220914713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32452133,0.001454059,0.58131206,0.007216706,0.0022857883,0.00059791765,0.00012009923,0.0013080699,0.08118397],"genre_scores_gemma":[0.99022245,0.000004196912,0.005734713,0.00057051145,0.000033017444,0.000041897296,0.000055559267,0.000005102053,0.0033325776],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99804884,0.00013465206,0.00036794192,0.0005702963,0.00057813904,0.00030013415],"domain_scores_gemma":[0.99873376,0.0000862769,0.0002229706,0.00078734773,0.000052980886,0.00011668009],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000652243,0.00012411228,0.00022296814,0.00021699507,0.0005037304,0.0001157963,0.000683787,0.000023189796,0.0009627884],"category_scores_gemma":[0.000099199104,0.00010783865,0.0001428438,0.0016404771,0.000043630913,0.0002642379,0.0012843417,0.00019212614,0.00004040492],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035400142,0.0027472489,0.14601867,0.00003256471,0.0006625544,0.027010411,0.0013231447,0.0048865466,0.004953277,0.2293658,0.15206686,0.43089753],"study_design_scores_gemma":[0.00028018068,0.0003533459,0.16301878,0.0000031875002,0.000046472484,0.002911977,0.00010955251,0.00391777,0.001663376,0.026733708,0.80025256,0.0007090879],"about_ca_topic_score_codex":0.00029473144,"about_ca_topic_score_gemma":0.0000075411162,"teacher_disagreement_score":0.6657011,"about_ca_system_score_codex":0.000058476915,"about_ca_system_score_gemma":0.000043177264,"threshold_uncertainty_score":0.99995047},"labels":[],"label_agreement":null},{"id":"W4226485042","doi":"10.4153/s0008414x22000657","title":"Homological approximations in persistence theory","year":2022,"lang":"en","type":"preprint","venue":"Canadian Journal of Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Bishop's University; Université de Sherbrooke","funders":"","keywords":"Indecomposable module; Abelian group; Invariant (physics); Mathematics; Pure mathematics; Homological algebra; Rank (graph theory); Rank of an abelian group; Global dimension; Algebra over a field; Discrete mathematics; Elementary abelian group; Combinatorics","score_opus":0.05784341720297558,"score_gpt":0.2530803628380359,"score_spread":0.19523694563506033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226485042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0758485,0.0037166765,0.903961,0.0048141875,0.0011790913,0.00029850617,0.00014847465,0.0000302326,0.010003312],"genre_scores_gemma":[0.75986135,0.00010802388,0.23892209,0.00037565146,0.0000898423,0.000016457063,0.000014980773,0.000011875948,0.0005997261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982823,0.00020430787,0.00066709716,0.00022220094,0.00033086928,0.00029323102],"domain_scores_gemma":[0.9979578,0.0004124896,0.0005315637,0.0005976967,0.00012403548,0.0003763915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018349397,0.00015950305,0.0004834732,0.0011760155,0.00012581226,0.00019267734,0.0027933787,0.00014157123,0.0007307624],"category_scores_gemma":[0.0012874065,0.00012527703,0.00027330467,0.0009888797,0.00011571888,0.00014238236,0.0005145693,0.0010069704,0.00001272154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024453657,0.00035708767,0.0021516676,0.00020456746,0.0002249404,0.00235875,0.0063024373,0.010524192,0.0000020508835,0.9634851,0.0028142375,0.011572481],"study_design_scores_gemma":[0.00021545963,0.00015291013,0.0028315089,0.00014265499,0.0001029689,0.0005102728,0.002968306,0.013503998,0.0000048062466,0.9733348,0.0058069224,0.0004253908],"about_ca_topic_score_codex":0.00036437987,"about_ca_topic_score_gemma":0.0014444827,"teacher_disagreement_score":0.68401283,"about_ca_system_score_codex":0.00027843044,"about_ca_system_score_gemma":0.0011129265,"threshold_uncertainty_score":0.8001335},"labels":[],"label_agreement":null},{"id":"W4229029442","doi":"10.24963/ijcai.2022/168","title":"TopoSeg: Topology-aware Segmentation for Point Clouds","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Point cloud; Segmentation; Topology (electrical circuits); Computer science; Correctness; Network topology; Persistent homology; Robustness (evolution); Scale-space segmentation; Computational topology; Artificial intelligence; Image segmentation; Algorithm; Mathematics; Computer network","score_opus":0.07334618563402434,"score_gpt":0.29902978609084013,"score_spread":0.2256836004568158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229029442","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08797341,0.000056334706,0.72118497,0.16896503,0.005999339,0.001840756,0.00043518184,0.0003459392,0.013199056],"genre_scores_gemma":[0.9930152,0.00002389491,0.0051684077,0.00088185084,0.00011378969,0.0001733217,0.000014914821,0.000008435335,0.00060016365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761224,0.00002748428,0.0006779735,0.000580673,0.0007997018,0.00030190175],"domain_scores_gemma":[0.9982437,0.0001826062,0.0005466101,0.00027298962,0.0006784422,0.00007568124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000808202,0.00020598112,0.00027425447,0.00032927873,0.000561934,0.00020643265,0.0028338046,0.000058933514,0.0006794274],"category_scores_gemma":[0.00048079315,0.00015692577,0.00027232248,0.0008793839,0.00018391153,0.00039684484,0.0012592928,0.00031550534,0.00003288051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008346382,0.0002536083,0.00017265625,0.000013319266,0.00005810513,7.530713e-7,0.000497654,0.00056024996,0.0032665937,0.9753995,0.0011641732,0.018529946],"study_design_scores_gemma":[0.000120835655,0.0007082158,0.00037732185,0.000045103316,0.00003698304,0.0000238793,0.0025855051,0.11250525,0.13544703,0.74401265,0.0037609122,0.00037633284],"about_ca_topic_score_codex":0.00009427528,"about_ca_topic_score_gemma":0.000016870967,"teacher_disagreement_score":0.9050418,"about_ca_system_score_codex":0.00018257932,"about_ca_system_score_gemma":0.000069555645,"threshold_uncertainty_score":0.7439254},"labels":[],"label_agreement":null},{"id":"W4230319290","doi":"10.4064/fm222-1-2","title":"More on the Kechris–Pestov–Todorcevic correspondence: Precompact expansions","year":2013,"lang":"en","type":"article","venue":"Fundamenta Mathematicae","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Calgary","keywords":"Mathematics; Invariant (physics); Pure mathematics; Mathematical physics","score_opus":0.03606682909353761,"score_gpt":0.27478650774102353,"score_spread":0.23871967864748592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230319290","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67859936,0.00023804967,0.24498591,0.052809153,0.00062085385,0.0015659065,0.000040855535,0.00065041916,0.02048952],"genre_scores_gemma":[0.97948426,0.00002364056,0.010426162,0.0031025284,0.000060214617,0.00017552616,0.000008835413,0.000012196983,0.006706622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980643,0.00013060989,0.00036040015,0.00044856878,0.00057476474,0.00042137576],"domain_scores_gemma":[0.9968391,0.0013296258,0.00015019924,0.0014361197,0.00005919557,0.00018573129],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004320151,0.00022652083,0.00029585714,0.00020318416,0.00031570613,0.00049635087,0.0019578892,0.00006395882,0.008005827],"category_scores_gemma":[0.0004324885,0.000118571515,0.00016814012,0.0012991448,0.00013737546,0.0005054008,0.00047790323,0.00022852929,0.008492011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011391005,0.0012719431,0.00084477867,0.000050448223,0.00024394711,0.000027429896,0.0033338442,0.00013724812,0.00090384664,0.6114494,0.3427639,0.038961813],"study_design_scores_gemma":[0.0015976552,0.001778563,0.058002107,0.00056492264,0.0002694451,0.00019254928,0.007939568,0.23677084,0.0046258313,0.59379107,0.091797665,0.0026698133],"about_ca_topic_score_codex":0.00006191902,"about_ca_topic_score_gemma":0.0000018641775,"teacher_disagreement_score":0.30088493,"about_ca_system_score_codex":0.00004996552,"about_ca_system_score_gemma":0.000027613973,"threshold_uncertainty_score":0.99290097},"labels":[],"label_agreement":null},{"id":"W4232342780","doi":"10.4324/9781315145167-11","title":"Generalizing Across Borders","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.03557087290161422,"score_gpt":0.2947224591664948,"score_spread":0.2591515862648806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232342780","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000108865115,0.00034387314,0.25446787,0.0006540597,0.0002727959,0.000043970613,0.00002669516,0.00020273653,0.7439771],"genre_scores_gemma":[0.00024632784,0.00018506892,0.023971636,0.0014828815,0.00026281326,0.0000016794826,0.00003346267,0.000010668443,0.9738055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99847823,0.000007502517,0.00024468853,0.0006308342,0.00031828933,0.0003204736],"domain_scores_gemma":[0.9986987,0.000047791364,0.0001185093,0.00092273235,0.00009461428,0.00011762815],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000189129,0.00023350967,0.00030854577,0.00016539673,0.00014377762,0.00024365025,0.0015156447,0.00023468488,0.0049876627],"category_scores_gemma":[0.00002596045,0.00016791106,0.00021106032,0.00019095348,0.00013210897,0.00020187214,0.00100587,0.00016275489,0.0027848938],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.5503036e-7,0.000006735596,0.000004729718,0.000003623611,0.00008798162,0.000026688806,0.0000535942,0.0000022627855,0.0000017491353,0.8495928,0.08035261,0.06986654],"study_design_scores_gemma":[0.000051646424,0.00004184415,0.00001054355,0.0000061900178,0.000013023732,0.0000052585237,0.0000038150847,0.0004482441,0.000013884357,0.07457644,0.92456466,0.00026445527],"about_ca_topic_score_codex":0.000081494276,"about_ca_topic_score_gemma":0.000067699635,"teacher_disagreement_score":0.84421206,"about_ca_system_score_codex":0.00002541072,"about_ca_system_score_gemma":0.000024807598,"threshold_uncertainty_score":0.99799156},"labels":[],"label_agreement":null},{"id":"W4232636732","doi":"10.1002/jgt.20331","title":"The bond and cycle spaces of an infinite graph","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Simon Fraser University","funders":"","keywords":"Mathematics; Vertex (graph theory); Discrete mathematics; Combinatorics; Graph","score_opus":0.011945785772957507,"score_gpt":0.23186238961718064,"score_spread":0.21991660384422312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232636732","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9791015,0.0030458323,0.016798731,0.00049709587,0.000096224874,0.000021276986,0.0000038945486,0.000008106272,0.0004273718],"genre_scores_gemma":[0.9952446,0.0016013826,0.0029748427,0.00010852444,0.00003302033,2.8132516e-7,2.7292617e-7,0.0000013549421,0.000035727437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906874,0.00015118434,0.00029540528,0.00009611836,0.00026040478,0.00012817777],"domain_scores_gemma":[0.9986423,0.0005799615,0.00033645888,0.0002312472,0.00010885421,0.000101180085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012004385,0.00007128449,0.0001900946,0.00027620114,0.00019980778,0.00005426677,0.0006995832,0.00003279012,0.000007698997],"category_scores_gemma":[0.00015425528,0.000033314285,0.0001364485,0.001025699,0.00030549584,0.00042633846,0.000107720036,0.0001401728,8.606058e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021191119,0.00040482174,0.016364645,0.000011486439,0.00046484295,0.00025155488,0.001551108,0.00011245599,0.0014227892,0.6563524,0.0011851109,0.32166687],"study_design_scores_gemma":[0.00040314937,0.0006738702,0.114652716,0.000013715031,0.00005125978,0.00051633804,0.00035167826,0.00021747491,0.0007857644,0.8772007,0.0049958467,0.00013746723],"about_ca_topic_score_codex":0.000009191905,"about_ca_topic_score_gemma":0.000004700632,"teacher_disagreement_score":0.3215294,"about_ca_system_score_codex":0.0000025428483,"about_ca_system_score_gemma":0.000016370066,"threshold_uncertainty_score":0.15367801},"labels":[],"label_agreement":null},{"id":"W4234555707","doi":"10.1007/b97315","title":"Computational Homology","year":2004,"lang":"en","type":"book","venue":"Applied mathematical sciences","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":369,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Homology (biology); Computer science; Computational biology; Mathematics; Biology; Genetics; Amino acid","score_opus":0.023439387184865823,"score_gpt":0.25763664796072905,"score_spread":0.23419726077586323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234555707","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004133494,0.00006592351,0.45843834,0.0006990238,0.00004828861,0.00009858365,0.0000065683707,0.00010941955,0.5405297],"genre_scores_gemma":[0.0068675564,0.000024772848,0.59125054,0.0020627403,0.00024699923,0.000067729474,0.00007608606,0.000019631436,0.39938396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997444,0.000018444967,0.0004255531,0.00080568483,0.0008795781,0.00042677284],"domain_scores_gemma":[0.99844605,0.00071549544,0.00019791009,0.00043458413,0.00004291471,0.00016306296],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005985083,0.00026638625,0.0005239256,0.00033268088,0.00027562527,0.0002549842,0.0025506804,0.00023962902,0.00082895404],"category_scores_gemma":[0.00008312232,0.00018143443,0.00014858581,0.0009258849,0.001092437,0.00014732529,0.00074611005,0.00026242156,0.001930628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.5195384e-7,0.00005366045,2.0914207e-7,0.000020405161,0.000019794063,0.000011776844,0.00003969413,0.00075515785,3.9511423e-7,0.98952353,0.00393944,0.0056355833],"study_design_scores_gemma":[0.00008744879,0.000059831276,0.000008586904,0.000018923893,0.000021646938,0.000027296459,0.000003951499,0.0021189735,0.0000036231795,0.9751659,0.02223773,0.0002460745],"about_ca_topic_score_codex":0.0000021747533,"about_ca_topic_score_gemma":8.615526e-7,"teacher_disagreement_score":0.14114574,"about_ca_system_score_codex":0.00015641349,"about_ca_system_score_gemma":0.0008487375,"threshold_uncertainty_score":0.9988465},"labels":[],"label_agreement":null},{"id":"W4234959268","doi":"10.1007/978-3-319-60252-3","title":"Descriptional Complexity of Formal Systems","year":2017,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Computer science; Formal methods; Formal system; Programming language; Software engineering","score_opus":0.05476019861187439,"score_gpt":0.2714581221125291,"score_spread":0.21669792350065473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234959268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000077659424,0.0006269409,0.99368066,0.000284548,0.0017237633,0.00019045424,0.000048869348,0.00006261569,0.0033044643],"genre_scores_gemma":[0.5424796,0.00006805106,0.45340872,0.00049769547,0.00095355033,0.000016562972,0.00007644647,0.000020134867,0.0024792685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963235,0.00006020596,0.00059473753,0.0010960991,0.0012668291,0.0006585746],"domain_scores_gemma":[0.9965892,0.00034072003,0.0006198292,0.001940652,0.00034420687,0.00016539462],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013394139,0.00034933788,0.00075357134,0.0011103887,0.00039537126,0.00067427335,0.007215608,0.00026487227,0.00002056134],"category_scores_gemma":[0.00027469973,0.0002727927,0.00019381396,0.0011820879,0.002208324,0.0012208199,0.002767054,0.00053136924,0.000031662166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015277199,0.00020664585,0.0006143014,0.0002137459,0.00007463784,0.00012778018,0.00031945927,0.041230433,0.00005389508,0.2621927,0.00092293037,0.6940282],"study_design_scores_gemma":[0.00031294694,0.00033876227,0.0029718904,0.0002903333,0.000021569236,0.00008696708,1.8267875e-7,0.7289635,0.00014481739,0.26052606,0.0056714304,0.0006715096],"about_ca_topic_score_codex":0.00015932765,"about_ca_topic_score_gemma":0.00005118919,"teacher_disagreement_score":0.6933567,"about_ca_system_score_codex":0.00024355676,"about_ca_system_score_gemma":0.0008250092,"threshold_uncertainty_score":0.9999724},"labels":[],"label_agreement":null},{"id":"W4236614157","doi":"10.1109/icpr.2004.1333697","title":"Morse homology descriptor for shape characterization","year":2004,"lang":"en","type":"article","venue":"Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Bishop's University","funders":"","keywords":"Morse theory; Morse code; Manifold (fluid mechanics); Topology (electrical circuits); Discrete Morse theory; Mathematics; Characterization (materials science); Homology (biology); Persistent homology; Morse homology; Function (biology); Topological data analysis; Set (abstract data type); Combinatorics; Discrete mathematics; Pure mathematics; Computer science; Physics; Algorithm; Cellular homology; Engineering","score_opus":0.057838490630805865,"score_gpt":0.2699408169607278,"score_spread":0.21210232632992193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236614157","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6670502,0.0000441933,0.30123836,0.022266733,0.0020534217,0.000949024,0.0009529552,0.00022046968,0.00522468],"genre_scores_gemma":[0.9939556,0.0000448967,0.0032641306,0.0016269465,0.00020249383,0.00011236364,0.00016688969,0.000013527023,0.0006131133],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981718,0.0000125418865,0.0004933814,0.00053672295,0.00048270973,0.00030285583],"domain_scores_gemma":[0.9979159,0.000047015703,0.00048682067,0.00019590618,0.0012621547,0.00009217927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028241414,0.00022877705,0.0002634482,0.00037041857,0.00015492445,0.00020099703,0.0016889413,0.00012585192,0.00039769613],"category_scores_gemma":[0.00032049755,0.00017237902,0.00019186539,0.0006056018,0.00012386666,0.0007064554,0.00020668455,0.00017674605,0.000110051405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003545404,0.002713171,0.025756247,0.00023563264,0.0008550527,0.000009586709,0.0013185849,0.000111790054,0.05642521,0.25117332,0.007722005,0.65332484],"study_design_scores_gemma":[0.008978853,0.0023903912,0.12637858,0.0013367739,0.00037934407,0.0002358875,0.00057133543,0.03428958,0.20741868,0.6052072,0.010176971,0.0026364066],"about_ca_topic_score_codex":0.00006267322,"about_ca_topic_score_gemma":0.000008390323,"teacher_disagreement_score":0.65068847,"about_ca_system_score_codex":0.00011988301,"about_ca_system_score_gemma":0.000077534496,"threshold_uncertainty_score":0.70294124},"labels":[],"label_agreement":null},{"id":"W4249254142","doi":"10.1007/978-3-642-39310-5","title":"Descriptional Complexity of Formal Systems","year":2013,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Formal system; Formal methods; Formal language; Programming language; Software engineering","score_opus":0.04094704262930757,"score_gpt":0.2482400812262219,"score_spread":0.20729303859691434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249254142","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016421305,0.0006357264,0.9952331,0.00027131214,0.0013441809,0.00025640166,0.000031937016,0.000077500285,0.0019856081],"genre_scores_gemma":[0.37675855,0.000053799533,0.61941355,0.00081329484,0.00074732536,0.000029309804,0.00007733516,0.000020734276,0.0020860692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961967,0.000071796705,0.00068514596,0.0010712293,0.0012820525,0.00069306913],"domain_scores_gemma":[0.9973324,0.00041826238,0.00041881774,0.0012509982,0.0003991634,0.00018035882],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009896837,0.0003600263,0.00072173495,0.0012869358,0.00018662483,0.00046182482,0.0047865976,0.0002641777,0.000058833346],"category_scores_gemma":[0.00015336793,0.00027484001,0.00017762886,0.0026455175,0.0015749459,0.0011861506,0.0021974742,0.00052605296,0.00007860997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008845929,0.00023903808,0.0004166933,0.00021961631,0.00007249674,0.0000563217,0.0003641434,0.068300225,0.000087859844,0.34443182,0.0017670505,0.58403593],"study_design_scores_gemma":[0.00020153903,0.00027104796,0.0014985007,0.00015497918,0.000013255405,0.00005487968,2.409657e-7,0.7960169,0.00011558853,0.19857606,0.0025902062,0.0005068282],"about_ca_topic_score_codex":0.00020831297,"about_ca_topic_score_gemma":0.000025058276,"teacher_disagreement_score":0.7277166,"about_ca_system_score_codex":0.0002650048,"about_ca_system_score_gemma":0.0006280068,"threshold_uncertainty_score":0.9999704},"labels":[],"label_agreement":null},{"id":"W4251414905","doi":"10.1007/0-387-21597-2_9","title":"Homological Algebra","year":2004,"lang":"en","type":"book-chapter","venue":"Applied mathematical sciences","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Disjoint sets; Homology (biology); Section (typography); Homological algebra; Mathematics; Simple (philosophy); Algebra over a field; Computer science; Discrete mathematics; Pure mathematics; Biology","score_opus":0.03497409763850703,"score_gpt":0.24808527307917946,"score_spread":0.21311117544067243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251414905","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017884204,0.00013115142,0.1654595,0.0010587074,0.00006274303,0.00017303244,0.000008706536,0.00023623758,0.83285207],"genre_scores_gemma":[0.061171994,0.0002867762,0.3934761,0.0031611738,0.00040213048,0.000095820775,0.00003103801,0.00004525835,0.54132974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99684876,0.000010373318,0.0005085147,0.0010677596,0.0010445443,0.0005200268],"domain_scores_gemma":[0.9982875,0.0004583511,0.00022853377,0.0007365589,0.000035906363,0.00025317864],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007016818,0.00038622282,0.00066525507,0.0002970978,0.0003150136,0.00035424033,0.0031490198,0.00035899153,0.005607065],"category_scores_gemma":[0.00010399149,0.00023841579,0.00024150652,0.00052923465,0.001214615,0.00017669279,0.0011073112,0.0003659324,0.0043732524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.068934e-7,0.000042292995,2.4935153e-7,0.000015956984,0.00002047983,0.000026809656,0.000016345342,0.000013628522,0.000003540184,0.9878754,0.000367675,0.011616984],"study_design_scores_gemma":[0.00008069649,0.00009557571,0.0000076199726,0.000026114747,0.000027849923,0.000015705258,0.0000048153875,0.00018151979,0.000027441276,0.9789287,0.020242399,0.0003615558],"about_ca_topic_score_codex":0.000003554133,"about_ca_topic_score_gemma":9.966544e-7,"teacher_disagreement_score":0.29152232,"about_ca_system_score_codex":0.00005818154,"about_ca_system_score_gemma":0.000118491706,"threshold_uncertainty_score":0.99640197},"labels":[],"label_agreement":null},{"id":"W4285813993","doi":"10.1109/iwcmc55113.2022.9824981","title":"Publishing Private High-dimensional Datasets: A Topological Approach","year":2022,"lang":"en","type":"article","venue":"2022 International Wireless Communications and Mobile Computing (IWCMC)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Dependency (UML); Publication; Graph; Publishing; Dependency graph; Data mining; Data publishing; Theoretical computer science; Key (lock); Data science; Information retrieval; Artificial intelligence","score_opus":0.024086000871610513,"score_gpt":0.2711633523553911,"score_spread":0.24707735148378057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285813993","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6474838,0.0032784028,0.32090783,0.020330766,0.0013920517,0.0007672664,0.0014930692,0.0006956719,0.0036511456],"genre_scores_gemma":[0.968028,0.00014852012,0.027207183,0.0011553325,0.000059901588,0.00014325035,0.0031199455,0.0000071238387,0.00013073315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749404,0.00039774182,0.00048771364,0.0006468469,0.000671095,0.00030255367],"domain_scores_gemma":[0.9972999,0.00056709675,0.0002706847,0.0016094848,0.00012111215,0.00013171392],"candidate_categories":["sts","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0011122484,0.00018787505,0.00027110177,0.00038796998,0.0013793793,0.0006787726,0.0054966337,0.00005945022,0.00024505795],"category_scores_gemma":[0.00013164643,0.00017204284,0.000101168494,0.0011874302,0.00021024018,0.0005569219,0.014636812,0.0007239699,0.000011199232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015894035,0.0011997847,0.001982566,0.000008337439,0.0002189219,0.000019125247,0.00036957604,0.0098355105,0.00017490696,0.81497186,0.009707038,0.16149649],"study_design_scores_gemma":[0.0005947212,0.00016046512,0.0030167734,0.000008410069,0.000022791668,0.00015239057,0.0003264713,0.82147807,0.000014323117,0.0054885037,0.1683543,0.00038277003],"about_ca_topic_score_codex":0.00031462152,"about_ca_topic_score_gemma":0.000006006846,"teacher_disagreement_score":0.8116426,"about_ca_system_score_codex":0.00012443596,"about_ca_system_score_gemma":0.000049615133,"threshold_uncertainty_score":0.99992067},"labels":[],"label_agreement":null},{"id":"W4286239141","doi":"10.1090/proc/16196","title":"The integer homology threshold in 𝑌_{𝑑}(𝑛,𝑝)","year":2022,"lang":"lv","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Algorithm; Artificial intelligence; Annotation; Computer science","score_opus":0.015233090622855945,"score_gpt":0.250386330098252,"score_spread":0.23515323947539607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286239141","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9024806,0.0009951526,0.0036240944,0.08285896,0.00040455267,0.0008105528,0.0000624167,0.00010155861,0.008662144],"genre_scores_gemma":[0.9917633,0.00024124135,0.0036812723,0.002181364,0.00006098785,0.00011134832,9.823723e-7,0.000016884975,0.0019425994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99674636,0.00006942066,0.0008065259,0.0006024545,0.0010276601,0.0007476055],"domain_scores_gemma":[0.9973154,0.00093833345,0.0009350064,0.0005410241,0.00015436854,0.00011587368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023976234,0.00028178556,0.0007393735,0.00010417643,0.000904746,0.00018659115,0.004867826,0.00005797005,0.0001875809],"category_scores_gemma":[0.00076400064,0.00015158561,0.00082827476,0.007067261,0.0023452851,0.00016903141,0.005804224,0.0010769846,0.000027417978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054505264,0.0011849593,0.0096103,0.00014474812,0.00039321894,0.0000030701565,0.0057096346,0.00013270818,0.00036587587,0.9302939,0.041318692,0.010788385],"study_design_scores_gemma":[0.0006783986,0.0010269331,0.010710022,0.00008157261,0.00028202878,0.00011153947,0.027424566,0.12829694,0.00035833352,0.79886144,0.031352412,0.0008157932],"about_ca_topic_score_codex":0.00013413983,"about_ca_topic_score_gemma":0.0000022690156,"teacher_disagreement_score":0.13143244,"about_ca_system_score_codex":0.00019911253,"about_ca_system_score_gemma":0.00006729923,"threshold_uncertainty_score":0.9045713},"labels":[],"label_agreement":null},{"id":"W4288769727","doi":"10.3934/fods.2022014","title":"Statistical inference for persistent homology applied to simulated fMRI time series data","year":2022,"lang":"en","type":"article","venue":"Foundations of Data Science","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Persistent homology; Topological data analysis; Inference; Statistical inference; Computer science; Time series; Series (stratigraphy); Statistical hypothesis testing; Conditional independence; Data mining; Artificial intelligence; Machine learning; Algorithm; Mathematics; Statistics; Biology","score_opus":0.08636553521497028,"score_gpt":0.35414476045227283,"score_spread":0.2677792252373026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288769727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018400647,0.00001830656,0.9845604,0.003050728,0.00014780564,0.00031635407,0.009570775,0.000059676346,0.00043590076],"genre_scores_gemma":[0.62173396,0.000004611803,0.3714082,0.0002882098,0.000018628036,0.00002955629,0.006275097,0.000003896443,0.00023786478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757296,0.000049559017,0.00033015787,0.0010861511,0.0006153908,0.00034577187],"domain_scores_gemma":[0.99519444,0.0006630666,0.0001247139,0.0036878088,0.00018088125,0.00014907989],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0015970238,0.000103368824,0.00021608525,0.0004586542,0.00091412687,0.0002234581,0.012126839,0.000018127339,0.00048613668],"category_scores_gemma":[0.0020588937,0.00009415426,0.000023054177,0.004236577,0.0005801925,0.0022910323,0.014286304,0.000095683805,0.00008308188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006857222,0.0007108535,0.00028139073,0.000022490516,0.00010614048,0.0000065232202,0.00038737897,0.024715364,0.0025748424,0.85777664,0.02942442,0.083925396],"study_design_scores_gemma":[0.00042255278,0.0008489258,0.0027398837,0.000003500755,0.000092533475,0.000019203715,0.00029318064,0.7585315,0.00008511198,0.01081492,0.22570078,0.00044793054],"about_ca_topic_score_codex":0.00009743348,"about_ca_topic_score_gemma":0.000013594152,"teacher_disagreement_score":0.84696174,"about_ca_system_score_codex":0.000053221833,"about_ca_system_score_gemma":0.00042949323,"threshold_uncertainty_score":0.99368596},"labels":[],"label_agreement":null},{"id":"W4293768001","doi":"10.1142/s0218348x22501699","title":"BAR-CODES OF SIERPIŃSKI RELATIVES WITH TRIANGLE CONVEX HULLS","year":2022,"lang":"en","type":"article","venue":"Fractals","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Isosceles triangle; Sierpinski triangle; Mathematics; Combinatorics; Convex hull; Hull; Boundary (topology); Regular polygon; Dimension (graph theory); Fractal; Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.01172421685858425,"score_gpt":0.22352758272109782,"score_spread":0.21180336586251358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293768001","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61328006,0.002163798,0.33569998,0.005118677,0.0003630736,0.00045417316,0.00035976173,0.00030020642,0.042260263],"genre_scores_gemma":[0.9908513,0.000011898133,0.0067722886,0.00025343016,0.000017156108,0.000018125134,0.00002001073,0.0000036504964,0.00205214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987609,0.00014498115,0.00022913354,0.0002872421,0.00039875283,0.00017900468],"domain_scores_gemma":[0.9988424,0.00042044127,0.00019024541,0.00043876664,0.00004431239,0.00006382552],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000420882,0.00009197525,0.0003225211,0.00020443517,0.00014857858,0.00003453589,0.0007733123,0.000025720961,0.00142036],"category_scores_gemma":[0.00014743317,0.000064982945,0.00008960482,0.0015536797,0.0000797653,0.0003040892,0.0004251862,0.00014428343,0.00004077019],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004924817,0.0037938473,0.08085695,0.00011709879,0.0018995716,0.0006935195,0.008043292,0.006844957,0.011121155,0.56099087,0.04745654,0.27768973],"study_design_scores_gemma":[0.0058685676,0.006969769,0.26773533,0.00005941027,0.00035140364,0.00016492815,0.003360789,0.014614506,0.016192254,0.07122362,0.6112965,0.0021629143],"about_ca_topic_score_codex":0.000054448286,"about_ca_topic_score_gemma":0.0000014680593,"teacher_disagreement_score":0.56384,"about_ca_system_score_codex":0.000021376622,"about_ca_system_score_gemma":0.000038910846,"threshold_uncertainty_score":0.99949247},"labels":[],"label_agreement":null},{"id":"W4299547608","doi":"10.48550/arxiv.1410.2579","title":"Counting cycles in labeled graphs: The nonpositive immersion property\\n for one-relator groups","year":2014,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Immersion (mathematics); Mathematics; Von Neumann architecture; Torsion (gastropod); Property (philosophy); Rank (graph theory); Pure mathematics; Combinatorics; Philosophy","score_opus":0.06791123140621982,"score_gpt":0.19472216173521867,"score_spread":0.12681093032899884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299547608","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5366659,0.00020834453,0.4595434,0.0008863485,0.00052759174,0.0012411005,0.00008587276,0.00008471171,0.0007567029],"genre_scores_gemma":[0.9960685,0.0008084107,0.00089968677,0.00040496333,0.00012177625,0.000010743209,0.00006988254,0.00002571476,0.0015903587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994533,0.00069905206,0.0007416529,0.002630132,0.00030386858,0.0010922765],"domain_scores_gemma":[0.99510884,0.0014189507,0.0008842514,0.0018077855,0.0004969011,0.0002832729],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002047515,0.00071794173,0.0010745134,0.0010690092,0.00097231445,0.00040933889,0.0043768003,0.00063857296,0.00009943007],"category_scores_gemma":[0.0003360003,0.00049910264,0.0008339959,0.0049056,0.00065415184,0.0008184506,0.003527492,0.0011860266,0.00018071443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009400804,0.0020933526,0.046810243,0.0005019206,0.00187336,0.0002998939,0.0017517215,0.14772509,0.00035723002,0.77567345,0.0007465604,0.021227086],"study_design_scores_gemma":[0.0023470523,0.00046525782,0.015346964,0.00044447754,0.00086834526,0.000005353247,0.000991225,0.9249149,0.00020504392,0.051207963,0.0018406734,0.0013627384],"about_ca_topic_score_codex":0.0016532934,"about_ca_topic_score_gemma":0.00026768688,"teacher_disagreement_score":0.7771898,"about_ca_system_score_codex":0.00033851966,"about_ca_system_score_gemma":0.00017364492,"threshold_uncertainty_score":0.9997461},"labels":[],"label_agreement":null},{"id":"W4299873972","doi":"10.1007/978-3-031-02559-4_2","title":"Sparseness Measures","year":2010,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on speech and audio processing","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Impulse (physics); Computer science; Artificial intelligence; Pattern recognition (psychology); Mathematics; Physics","score_opus":0.02231769962941045,"score_gpt":0.23150756286602575,"score_spread":0.20918986323661531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299873972","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050534384,0.016232375,0.1555608,0.006334721,0.00073039706,0.0004868304,0.000102185106,0.0009553611,0.819092],"genre_scores_gemma":[0.50504625,0.004950919,0.11725013,0.007144072,0.002844781,0.00009417863,0.000065723936,0.0003013355,0.3623026],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974118,0.000032583997,0.00035779574,0.00106859,0.0006980127,0.00043121632],"domain_scores_gemma":[0.99823236,0.0003674757,0.0003229513,0.00072691316,0.00013550567,0.00021478836],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038574755,0.0005427609,0.0007267396,0.0006152202,0.00045774036,0.0006757651,0.0010892032,0.0005952826,0.00024363537],"category_scores_gemma":[0.00045020867,0.00038379023,0.00021547306,0.00024801446,0.00022923535,0.00022998123,0.00029180307,0.00081818877,0.00010241265],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011189875,0.00002142465,0.0000069253356,0.00005153963,0.00006986483,0.000072729235,0.000026918007,0.0000037011753,0.00044604705,0.011138511,0.0003996122,0.98775154],"study_design_scores_gemma":[0.00019127996,0.00013924405,0.00017721728,0.000593794,0.00029125015,0.00016474393,0.000005735896,0.00016696377,0.056562964,0.15895076,0.78117186,0.0015841532],"about_ca_topic_score_codex":0.00001458862,"about_ca_topic_score_gemma":0.000040655148,"teacher_disagreement_score":0.9861674,"about_ca_system_score_codex":0.00003001454,"about_ca_system_score_gemma":0.00011173247,"threshold_uncertainty_score":0.9998614},"labels":[],"label_agreement":null},{"id":"W4309182998","doi":"10.1051/0004-6361/202243868","title":"Persistent homology in cosmic shear","year":2022,"lang":"en","type":"article","venue":"Astronomy and Astrophysics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Leibniz-Gemeinschaft; Alliance de recherche numérique du Canada; International Max Planck Research School for Advanced Methods in Process and Systems Engineering; Deutsche Forschungsgemeinschaft; Max-Planck-Gesellschaft; Bundesministerium für Bildung und Forschung; Science and Technology Facilities Council; European Commission; Alexander von Humboldt-Stiftung","keywords":"Physics; Astrophysics; COSMIC cancer database; Homology (biology); Astronomy; Cosmic string; Theoretical physics; Genetics; Biology","score_opus":0.010082119874226228,"score_gpt":0.2000492107305031,"score_spread":0.1899670908562769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309182998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3691011,0.00018310187,0.62931937,0.0008722599,0.00009199403,0.0000619946,0.00001999082,0.00002872723,0.00032143915],"genre_scores_gemma":[0.9533129,0.0000035237981,0.04641548,0.00011811812,0.000022544507,0.000017120718,0.00001600628,0.0000020763869,0.00009225942],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999245,0.00006213608,0.000110555244,0.00026842905,0.000100126585,0.00021378548],"domain_scores_gemma":[0.9996612,0.000030335654,0.000037743102,0.0002092116,0.000009710078,0.000051773502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008425246,0.00007494805,0.00013655901,0.00011526342,0.00015665518,0.000034903456,0.00038966423,0.000011080327,0.00006546668],"category_scores_gemma":[0.000003701247,0.000071359565,0.000058395257,0.0007141816,0.00004312434,0.00014295072,0.00064388633,0.00016851556,0.000012493299],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010994745,0.0002828542,0.005390071,0.0000023156797,0.00004769744,0.000031866886,0.0002086657,0.009292532,0.00006271177,0.060233817,0.0004644133,0.9239721],"study_design_scores_gemma":[0.003045064,0.003826087,0.13201885,0.000008464711,0.00009612661,0.0001221372,0.0036097744,0.036278937,0.00013309525,0.015512795,0.80416006,0.0011886224],"about_ca_topic_score_codex":0.000063328116,"about_ca_topic_score_gemma":7.827651e-7,"teacher_disagreement_score":0.92278343,"about_ca_system_score_codex":0.000030363524,"about_ca_system_score_gemma":0.000021337608,"threshold_uncertainty_score":0.29099587},"labels":[],"label_agreement":null},{"id":"W4309583437","doi":"10.1002/rsa.21123","title":"Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity","year":2022,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Chromatic scale; Random graph; Vertex (graph theory); Combinatorics; Mathematical proof; Degree (music); Probabilistic logic; Discrete mathematics; Joint probability distribution; Graph; Set (abstract data type); Upper and lower bounds; Computer science; Statistics","score_opus":0.013205083916041905,"score_gpt":0.23581597389450187,"score_spread":0.22261088997845996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309583437","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77273035,0.0006656012,0.22504576,0.00044412006,0.000031729433,0.00078470854,0.00010283917,0.0000427919,0.00015209935],"genre_scores_gemma":[0.9781749,0.00006164109,0.021548286,0.000060092043,0.000016797214,0.00011728757,0.0000072749403,0.0000035797796,0.000010091522],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9987899,0.00012783679,0.00021077017,0.0004588606,0.00024473254,0.00016790046],"domain_scores_gemma":[0.99903953,0.00040181808,0.000077900775,0.00030794402,0.000043396674,0.0001293915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003665033,0.00014460347,0.0004207892,0.00013609756,0.0003283045,0.00008196447,0.00024115326,0.000027135062,0.00003737714],"category_scores_gemma":[0.000037777125,0.000094484814,0.000049506674,0.0009849081,0.00020127313,0.00011689771,0.00033531504,0.000108925145,1.649072e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016691224,0.00038264587,0.052945096,0.00029207495,0.00064451,0.000025284582,0.0017895772,0.000852935,0.00059451174,0.31210876,0.00020256496,0.62849295],"study_design_scores_gemma":[0.016273832,0.0008287994,0.49000067,0.000016911808,0.00024755136,0.0003618271,0.00045427226,0.011644883,0.0005671052,0.4756366,0.0031496591,0.0008179061],"about_ca_topic_score_codex":0.00013693629,"about_ca_topic_score_gemma":0.00002934949,"teacher_disagreement_score":0.627675,"about_ca_system_score_codex":0.0000073512256,"about_ca_system_score_gemma":0.000012446173,"threshold_uncertainty_score":0.3852979},"labels":[],"label_agreement":null},{"id":"W4312328230","doi":"10.1109/access.2022.3229008","title":"Topological Forest","year":2022,"lang":"en","type":"article","venue":"IEEE Access","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Random forest; Metric (unit); Computer science; Topology (electrical circuits); Reduction (mathematics); Inference; Representation (politics); Decision tree; Mathematics; Artificial intelligence; Combinatorics","score_opus":0.045763428135395606,"score_gpt":0.3044053996242905,"score_spread":0.2586419714888949,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312328230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3102592,0.00020369551,0.6700924,0.006155143,0.0013342743,0.000118864875,0.000026484862,0.0003489771,0.011460993],"genre_scores_gemma":[0.9963908,0.0000069161906,0.0010732932,0.0017168229,0.000060557162,0.00003505497,0.0000054717098,0.0000018337194,0.00070923235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99897087,0.00007245079,0.00013057093,0.00031204688,0.00029541148,0.00021866296],"domain_scores_gemma":[0.9993245,0.00010168995,0.00004892672,0.00043616578,0.000019399957,0.00006932681],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021102627,0.000069583744,0.00012070174,0.00015341706,0.0003028014,0.00018509904,0.0029038007,0.000020603375,0.0011020979],"category_scores_gemma":[0.000045429002,0.000052134164,0.00007334285,0.0016905827,0.000037882288,0.00042712555,0.0014920146,0.00014965795,0.00008277214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020804344,0.0007220787,0.087393425,0.0000071654076,0.000089626716,0.0005375323,0.00014209657,0.012762394,0.00011354353,0.6549487,0.091344066,0.15191853],"study_design_scores_gemma":[0.0007306329,0.0005067798,0.13444434,0.0000016126851,0.00003437162,0.00012824089,0.00008063958,0.035177317,0.00068160426,0.3118247,0.5155832,0.0008065397],"about_ca_topic_score_codex":0.00014136612,"about_ca_topic_score_gemma":0.000013606133,"teacher_disagreement_score":0.68613166,"about_ca_system_score_codex":0.000026161837,"about_ca_system_score_gemma":0.000015365362,"threshold_uncertainty_score":0.99981105},"labels":[],"label_agreement":null},{"id":"W4312462894","doi":"10.4213/tm4272","title":"Обобщенные виртуальные многогранники и квазиторические многообразия","year":2022,"lang":"ru","type":"article","venue":"Труды Математического института им Стеклова","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.022314699457639538,"score_gpt":0.2378010940960942,"score_spread":0.21548639463845468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312462894","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21697515,0.091409005,0.1971571,0.10810596,0.055904534,0.009886582,0.013492504,0.009540296,0.29752886],"genre_scores_gemma":[0.9253064,0.0013644876,0.0061627757,0.009914595,0.0020977114,0.00057499454,0.0008631073,0.00027365284,0.0534423],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.97959876,0.0023350948,0.003167867,0.005164408,0.005274464,0.0044594253],"domain_scores_gemma":[0.98794657,0.001394744,0.0016911236,0.0063525913,0.000635245,0.0019797431],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","open_science","insufficient_payload"],"category_scores_codex":[0.0041673156,0.002257593,0.0028315145,0.0031534054,0.0049289097,0.0019907518,0.011820237,0.00075803517,0.050164323],"category_scores_gemma":[0.0010494858,0.0022672128,0.002076716,0.01617043,0.0011098761,0.002216724,0.013687713,0.00426658,0.00814647],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006595666,0.00729499,0.010293856,0.00037541505,0.002905655,0.0048204046,0.004556462,0.009463241,0.0016628688,0.12833628,0.42180818,0.4078231],"study_design_scores_gemma":[0.0035085154,0.002608956,0.011630805,0.000097031145,0.00091130944,0.0007700004,0.002231989,0.03103358,0.00066621974,0.014084234,0.9282172,0.0042401687],"about_ca_topic_score_codex":0.0018186446,"about_ca_topic_score_gemma":0.00020899046,"teacher_disagreement_score":0.7083312,"about_ca_system_score_codex":0.0013353218,"about_ca_system_score_gemma":0.0012561966,"threshold_uncertainty_score":0.99904525},"labels":[],"label_agreement":null},{"id":"W4316662478","doi":"10.21203/rs.3.rs-2468688/v1","title":"Minimally Rigid Clusters in Dense Suspension Flow","year":2023,"lang":"en","type":"preprint","venue":"Research Square","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Army Research Office; Center for Hierarchical Materials Design","keywords":"Suspension (topology); Flow (mathematics); Mechanics; Computer science; Physics; Mathematics; Pure mathematics","score_opus":0.11995251078765402,"score_gpt":0.39538060197675656,"score_spread":0.27542809118910255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4316662478","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79465085,0.003926209,0.116884045,0.06483176,0.0035805737,0.0047408896,0.00068105554,0.0022557965,0.008448838],"genre_scores_gemma":[0.96962434,0.0013658892,0.021890555,0.0001652741,0.00028693667,0.00019766676,0.00038252276,0.0000410075,0.006045787],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943115,0.0008884172,0.00048125483,0.0014253557,0.0018622663,0.0010312066],"domain_scores_gemma":[0.99597913,0.001328061,0.00008745609,0.001877817,0.00043003738,0.00029750806],"candidate_categories":["open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0038437478,0.00026280564,0.00050716515,0.0027769862,0.00017773916,0.0005856699,0.003266499,0.0004063753,0.00013465401],"category_scores_gemma":[0.0020976022,0.00021413255,0.00024856947,0.0052801976,0.00016965505,0.00021378326,0.011071058,0.0018579097,0.0015102897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005371206,0.002889369,0.063656844,0.0036993364,0.0007591101,0.025240613,0.0049752565,0.0776683,0.0004925613,0.02904835,0.33081156,0.4602216],"study_design_scores_gemma":[0.0014695924,0.0007629228,0.15748855,0.0015566779,0.00003253368,0.000023915674,0.0007931118,0.72983843,0.00027901784,0.07812194,0.027889634,0.0017436978],"about_ca_topic_score_codex":0.0014313156,"about_ca_topic_score_gemma":0.0018177874,"teacher_disagreement_score":0.6521701,"about_ca_system_score_codex":0.00029046292,"about_ca_system_score_gemma":0.00032610103,"threshold_uncertainty_score":0.99926716},"labels":[],"label_agreement":null},{"id":"W4320725624","doi":"10.14712/1213-7243.2023.003","title":"Counterexamples to Hedetniemi's conjecture and infinite Boolean lattices","year":2023,"lang":"en","type":"article","venue":"Commentationes Mathematicae Universitatis Carolinae","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Counterexample; Conjecture; Combinatorics; Mathematics; Exponential function; Lattice (music); Discrete mathematics; Base (topology); Physics","score_opus":0.025148722635846377,"score_gpt":0.2683470578078771,"score_spread":0.2431983351720307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320725624","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58148354,0.000119085154,0.3887927,0.024207905,0.00017810619,0.00046023386,0.00018632942,0.0006702331,0.003901875],"genre_scores_gemma":[0.92411226,0.0001331776,0.07188317,0.0023618694,0.00003207283,0.000011459234,0.00012833421,0.0000130076705,0.0013246782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894345,0.0000637461,0.00019880671,0.00031856328,0.00024036932,0.00023507648],"domain_scores_gemma":[0.9985475,0.0007866866,0.00008936071,0.0003498555,0.00006969473,0.00015690086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020759531,0.00014591048,0.00023257466,0.00051808154,0.0002369173,0.00017224756,0.0005580985,0.00004356536,0.00009389291],"category_scores_gemma":[0.000119800716,0.00012793054,0.000050223363,0.0016084092,0.00006580543,0.00044902234,0.00049102004,0.00006892942,0.0003366197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015589047,0.0001104573,0.0074335174,0.00015104028,0.00026348885,0.00014276287,0.014965955,0.00026661373,0.00014331272,0.8647811,0.06131149,0.050414693],"study_design_scores_gemma":[0.005200835,0.0014025769,0.27915922,0.0003509855,0.0006791177,0.0001733786,0.045488764,0.06580295,0.0007601626,0.46380246,0.13425276,0.0029268127],"about_ca_topic_score_codex":0.000042903157,"about_ca_topic_score_gemma":0.000032170803,"teacher_disagreement_score":0.40097862,"about_ca_system_score_codex":0.000028415821,"about_ca_system_score_gemma":0.000017103766,"threshold_uncertainty_score":0.5216856},"labels":[],"label_agreement":null},{"id":"W4360604838","doi":"10.1109/icnc57223.2023.10074146","title":"Evaluating Generative Adversarial Networks: A Topological Approach","year":2023,"lang":"en","type":"article","venue":"","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Persistent homology; Metric (unit); Computer science; Topology (electrical circuits); Topological data analysis; Convolution (computer science); Manifold (fluid mechanics); Generative grammar; Algebraic number; Algebraic topology; Artificial neural network; Adversarial system; Artificial intelligence; Theoretical computer science; Mathematics; Algorithm; Pure mathematics; Homotopy; Combinatorics","score_opus":0.11270299689442917,"score_gpt":0.35152513187341083,"score_spread":0.23882213497898166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360604838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067392415,0.0000419466,0.98011327,0.0010942033,0.00023399599,0.00008925405,0.0000020154635,0.00052559347,0.011160468],"genre_scores_gemma":[0.71717876,0.000034239787,0.27823338,0.0010622833,0.00044045947,0.0000423472,0.000058192352,0.000004457646,0.0029458595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845356,0.0001602996,0.00020097443,0.0005026591,0.0003241071,0.0003584002],"domain_scores_gemma":[0.99915934,0.0002529875,0.000048177277,0.00038927392,0.000050826464,0.00009937211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008089484,0.00011248297,0.00019115175,0.0001871905,0.00019158027,0.0001405264,0.00083395944,0.000082434024,0.000231466],"category_scores_gemma":[0.0003344173,0.00007128585,0.00010675997,0.0035519574,0.000060869217,0.00024264133,0.0007239413,0.00012569001,0.000281147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011102855,0.00014207212,0.0010016477,0.0000027913206,0.000105198626,0.00004102261,0.00021802276,0.116327696,0.00005699689,0.7241545,0.014898218,0.14304075],"study_design_scores_gemma":[0.00018896766,0.00011220786,0.0010105023,5.595273e-7,0.0000091145885,0.0000035523772,0.000071642375,0.97997093,0.00001891396,0.017643325,0.00084576267,0.00012450595],"about_ca_topic_score_codex":0.000043331638,"about_ca_topic_score_gemma":0.000002197711,"teacher_disagreement_score":0.8636432,"about_ca_system_score_codex":0.000018044917,"about_ca_system_score_gemma":0.000019700683,"threshold_uncertainty_score":0.36136696},"labels":[],"label_agreement":null},{"id":"W4360820285","doi":"10.1101/2023.03.22.533807","title":"Neurospectrum: A Geometric and Topological Deep Learning Framework for Uncovering Spatiotemporal Signatures in Neural Activity","year":2023,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mila - Quebec Artificial Intelligence Institute","funders":"National Institutes of Health","keywords":"Persistent homology; Homology (biology); Computer science; Scattering; Neuroscience; Artificial intelligence; Computational biology; Physics; Statistical physics; Biology; Algorithm; Genetics; Optics; Gene","score_opus":0.02383982251255067,"score_gpt":0.250575864442556,"score_spread":0.2267360419300053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360820285","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6418815,0.0009425454,0.35457888,0.000777887,0.000764392,0.0004457822,0.000046494377,0.0005613277,0.0000011707646],"genre_scores_gemma":[0.96691316,0.0003306008,0.03217333,0.00015146796,0.00023188238,0.00014892498,3.7839374e-7,0.00004494897,0.000005291236],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9962574,0.00020211237,0.0004993009,0.0017558407,0.0004604851,0.0008248523],"domain_scores_gemma":[0.99721247,0.00096167845,0.00042605834,0.0009883256,0.00014540214,0.00026606044],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009342994,0.000545484,0.00083670265,0.0014437783,0.00025179228,0.00066464586,0.0013347279,0.00078312634,0.000014152231],"category_scores_gemma":[0.0029528923,0.00051086216,0.00022472398,0.004454175,0.00012829606,0.0003885025,0.0023087445,0.0018977738,0.00000959861],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045093737,0.0018022431,0.74693257,0.002155234,0.0010166815,0.0021225584,0.00012484398,0.11152067,0.027222538,0.10341692,0.0003037987,0.0029310104],"study_design_scores_gemma":[0.00042350736,0.0002742087,0.8653982,0.0000975649,0.000056962042,3.0970618e-8,0.000002495057,0.1284037,0.0031321603,0.00088748673,0.00037133673,0.00095235335],"about_ca_topic_score_codex":0.00024376757,"about_ca_topic_score_gemma":0.000015231282,"teacher_disagreement_score":0.32503167,"about_ca_system_score_codex":0.00016312631,"about_ca_system_score_gemma":0.00009117873,"threshold_uncertainty_score":0.9997343},"labels":[],"label_agreement":null},{"id":"W4362608358","doi":"10.4995/agt.2023.17046","title":"Good coverings of proximal Alexandrov spaces. Path cycles in the extension of the Mitsuishi-Yamaguchi good covering and Jordan Curve Theorems","year":2023,"lang":"en","type":"article","venue":"Applied General Topology","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Mathematics; Path (computing); Extension (predicate logic); Space (punctuation); Sequence (biology); Cover (algebra); Frame (networking); Frame work; Pure mathematics; Mathematical analysis; Geometry; Combinatorics","score_opus":0.013976916672860329,"score_gpt":0.2371581689189568,"score_spread":0.22318125224609647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362608358","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9934197,0.00018154031,0.002123973,0.0016017099,0.000115732044,0.000221624,0.00001888592,0.000030765605,0.0022860758],"genre_scores_gemma":[0.99804187,0.00014025535,0.0012945314,0.00030035406,0.00004140225,0.000018791223,0.000007584895,0.0000055630376,0.0001496603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9985348,0.00014740844,0.0003250817,0.00040507523,0.00026454762,0.00032311154],"domain_scores_gemma":[0.9988185,0.00029483365,0.0001930717,0.00062378246,0.000030908406,0.000038886315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070856593,0.00015370845,0.00034470102,0.00017531736,0.000103215905,0.00003758444,0.0010412143,0.00010034171,0.000013560827],"category_scores_gemma":[0.00007633328,0.00008520019,0.00008609635,0.0016479582,0.00040317088,0.000090537724,0.0008262032,0.00018302521,0.000004449653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023213352,0.000099478275,0.016658854,0.000026617214,0.000040249502,0.000012191387,0.00096805714,0.0005547267,0.012543281,0.9556077,0.00029486767,0.013170753],"study_design_scores_gemma":[0.0021443742,0.0006254681,0.6840749,0.00004280736,0.000102584476,0.000097799086,0.0019634406,0.014951995,0.027935656,0.26225147,0.0051155384,0.0006939964],"about_ca_topic_score_codex":0.00056156155,"about_ca_topic_score_gemma":0.00012088007,"teacher_disagreement_score":0.6933562,"about_ca_system_score_codex":0.000008666887,"about_ca_system_score_gemma":0.000024167743,"threshold_uncertainty_score":0.34743628},"labels":[],"label_agreement":null},{"id":"W4367000465","doi":"10.48550/arxiv.2304.12231","title":"An Approximation Theory for Metric Space-Valued Functions With A View Towards Deep Learning","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; ShanghaiTech University; McMaster University; U.S. Department of Energy; National Science Foundation","keywords":"Mathematics; Banach space; Metric space; Euclidean geometry; Discrete mathematics; Vector space; Uniform continuity; Euclidean space; Space (punctuation); Pure mathematics; Computer science","score_opus":0.08487018259703219,"score_gpt":0.21610238656275546,"score_spread":0.13123220396572327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367000465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011635995,0.00010228497,0.9864635,0.00011552261,0.00019886569,0.0003681334,0.000032867014,0.00056459877,0.00051826955],"genre_scores_gemma":[0.9793132,0.00015788438,0.01596085,0.000034237302,0.000059805796,0.00001033873,0.00022863,0.000019315718,0.0042157625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777097,0.00031719025,0.00018576898,0.0012218538,0.00014883046,0.00035536525],"domain_scores_gemma":[0.99797404,0.00029591532,0.00028095514,0.0010152269,0.00025221767,0.00018164796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008735594,0.0002797816,0.0004102374,0.0012684113,0.0003467593,0.00022289093,0.0014628215,0.00021930618,0.000048744023],"category_scores_gemma":[0.0002794714,0.00024005264,0.00025072895,0.0053331205,0.00009276593,0.00052356714,0.0008688785,0.00045195137,0.00009366748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006594465,0.00017045345,0.00086023536,0.00012730848,0.00037280892,0.00005603754,0.00015824258,0.533834,0.0000029136534,0.4365347,0.00007458926,0.027742773],"study_design_scores_gemma":[0.00040336134,0.0003285594,0.002455322,0.00003365322,0.00039629656,0.0000023373811,0.0003985443,0.91330653,0.000011207867,0.081441164,0.0007927665,0.0004302395],"about_ca_topic_score_codex":0.00015360546,"about_ca_topic_score_gemma":0.00004093446,"teacher_disagreement_score":0.9705026,"about_ca_system_score_codex":0.00013551081,"about_ca_system_score_gemma":0.00010086253,"threshold_uncertainty_score":0.9789063},"labels":[],"label_agreement":null},{"id":"W4367052271","doi":"10.1111/mafi.12389","title":"Designing universal causal deep learning models: The geometric (Hyper)transformer","year":2023,"lang":"en","type":"article","venue":"Mathematical Finance","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"H2020 European Research Council; McMaster University; Natural Sciences and Engineering Research Council of Canada; Horizon 2020 Framework Programme; Eidgenössische Technische Hochschule Zürich; ETH Zürich Foundation","keywords":"Mathematics; Euclidean geometry; Markov chain; Metric space; Series (stratigraphy); Euclidean space; Algorithm; Computer science; Theoretical computer science; Discrete mathematics; Pure mathematics; Geometry","score_opus":0.044239983314984674,"score_gpt":0.2421600431032657,"score_spread":0.19792005978828103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367052271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011167859,0.00019571003,0.98234826,0.0013398471,0.00005628885,0.00009773037,0.0000019469694,0.00030783404,0.0044845236],"genre_scores_gemma":[0.96107876,0.00026700145,0.03527795,0.00014670509,0.00004074797,0.000022895376,0.000005645246,0.000011356996,0.003148907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837244,0.00008142385,0.000257794,0.000375409,0.00042568357,0.0004872436],"domain_scores_gemma":[0.99845654,0.00091704045,0.00006431423,0.0004417411,0.00005108296,0.00006926256],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007155085,0.00015450278,0.00025405575,0.0003497296,0.0003494805,0.00014768456,0.0011391384,0.00007477938,0.00008021],"category_scores_gemma":[0.00042123976,0.000094829404,0.00012582526,0.006632677,0.00010891983,0.00047140504,0.00023344792,0.00029270997,0.0011356844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004476456,0.00008125454,0.00011158983,0.0000330244,0.00004484711,0.000072235765,0.00089073286,0.030660022,0.0000784071,0.8367801,0.0008829158,0.1303604],"study_design_scores_gemma":[0.00016996883,0.000082202896,0.00065501255,0.0000192899,0.000026980475,0.00001677768,0.00021274122,0.82668173,0.00020698724,0.16528116,0.0064104283,0.0002367176],"about_ca_topic_score_codex":0.000015124956,"about_ca_topic_score_gemma":0.0000014135532,"teacher_disagreement_score":0.94991094,"about_ca_system_score_codex":0.000028473674,"about_ca_system_score_gemma":0.000019460154,"threshold_uncertainty_score":0.9996421},"labels":[],"label_agreement":null},{"id":"W4375816094","doi":"10.2139/ssrn.4439299","title":"Topological Recursion on Transalgebraic Spectral Curves and Atlantes Hurwitz Numbers","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Recursion (computer science); Topology (electrical circuits); Mathematics; Pure mathematics; Combinatorics; Algorithm","score_opus":0.023142463411299826,"score_gpt":0.26578936437181494,"score_spread":0.2426469009605151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4375816094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.386391,0.04798779,0.45550707,0.10270379,0.0029986792,0.000840549,0.000118856704,0.0012454315,0.002206827],"genre_scores_gemma":[0.8516638,0.14172192,0.0011544555,0.0007423368,0.00048357292,0.000014376072,0.00005002797,0.000027506454,0.004142002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99520236,0.00029089514,0.00052121776,0.0009528909,0.0006509847,0.0023816638],"domain_scores_gemma":[0.99850553,0.00031370154,0.0002971382,0.0005832658,0.00006719257,0.00023315927],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002272399,0.00041970858,0.00063468755,0.00050906447,0.00029674053,0.00030756954,0.0018752742,0.00033670338,0.000075589785],"category_scores_gemma":[0.0002824904,0.00029693835,0.00039893237,0.0009084157,0.00015494062,0.00021298265,0.0006762989,0.005130157,0.00009533752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082603605,0.0002879245,0.0022938093,0.00012606164,0.0007608523,0.00019243077,0.00016997107,0.00018496235,0.000025333886,0.92652285,0.0028037755,0.06654941],"study_design_scores_gemma":[0.00032961112,0.0008668064,0.0039021561,0.00023742057,0.00008713041,0.0004591657,0.00015628857,0.0006478379,0.000029279814,0.99157536,0.0012170131,0.0004919116],"about_ca_topic_score_codex":0.00021455435,"about_ca_topic_score_gemma":0.0003668352,"teacher_disagreement_score":0.46527278,"about_ca_system_score_codex":0.00040720668,"about_ca_system_score_gemma":0.0006526715,"threshold_uncertainty_score":0.99994826},"labels":[],"label_agreement":null},{"id":"W4375851843","doi":"10.32388/1ok16d","title":"Review of: \"Quantum mechanics and symplectic topology\"","year":2023,"lang":"en","type":"peer-review","venue":"","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Symplectic geometry; Topology (electrical circuits); Physics; Classical mechanics; Theoretical physics; Quantum mechanics; Mathematics; Pure mathematics; Combinatorics","score_opus":0.056920669742481736,"score_gpt":0.3273811915849871,"score_spread":0.27046052184250535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4375851843","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.9067e-8,0.69614935,0.1851268,0.1152436,0.0012407511,0.0002914295,0.000137237,0.00016777944,0.0016429549],"genre_scores_gemma":[0.000003988709,0.9288061,0.001981797,0.021676298,0.000062919025,0.000028565753,0.00024226677,0.000010523472,0.047187537],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99759173,0.0001678036,0.0007099545,0.00076419546,0.0004334544,0.00033284866],"domain_scores_gemma":[0.9975189,0.0005078144,0.0003809403,0.0011954589,0.00026707584,0.00012983414],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012463098,0.00029097428,0.0013752335,0.00037103836,0.00006233072,0.000035081324,0.0016569805,0.00020538145,0.0009217301],"category_scores_gemma":[0.0019306195,0.00019575501,0.00030065648,0.0035426482,0.000047590413,0.00010812219,0.0014736654,0.0003181074,0.00024878778],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.2635395e-7,0.000014425821,4.0972301e-7,0.017750135,0.00006740044,0.000009423648,0.0000011785261,5.982611e-8,9.1929046e-8,0.15340343,0.80701154,0.021741774],"study_design_scores_gemma":[0.000040444687,0.00010107024,0.0000038481057,0.012512893,0.00032062447,0.00002909043,0.0000012732457,0.0009993131,7.874481e-7,0.034902323,0.95083874,0.00024958423],"about_ca_topic_score_codex":0.00024100543,"about_ca_topic_score_gemma":0.000034439076,"teacher_disagreement_score":0.23265673,"about_ca_system_score_codex":0.000021892547,"about_ca_system_score_gemma":0.000098651326,"threshold_uncertainty_score":0.99999154},"labels":[],"label_agreement":null},{"id":"W4378070712","doi":"10.1137/21m1462945","title":"Time-Inhomogeneous Diffusion Geometry and Topology","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Mathematics of Data Science","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; National Institutes of Health; National Science Foundation","keywords":"Persistent homology; Topology (electrical circuits); Topological data analysis; Diffusion process; Diffusion map; Diffusion; Mathematics; Statistical physics; Computer science; Geometry; Algorithm; Physics; Nonlinear dimensionality reduction; Combinatorics; Artificial intelligence","score_opus":0.04308051946447704,"score_gpt":0.3099756244684499,"score_spread":0.26689510500397284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378070712","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8773856,0.00027914497,0.116482325,0.0033599176,0.00040446964,0.00013512904,0.00013021388,0.00013757816,0.001685619],"genre_scores_gemma":[0.7934063,0.0015104319,0.20365904,0.0003581528,0.00013079088,0.0000016477978,0.00002730095,0.000012276016,0.000894062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792707,0.000038082955,0.00039603637,0.00043826996,0.0008397547,0.00036080935],"domain_scores_gemma":[0.99765384,0.0004823099,0.00028082152,0.0012556375,0.00011317901,0.00021422109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002765602,0.00011675281,0.0002804966,0.0010748716,0.0003375287,0.00021320672,0.0043138326,0.00004423775,0.00007425812],"category_scores_gemma":[0.0014759122,0.00007793142,0.0000405346,0.00443498,0.00063809106,0.0012216243,0.0028513544,0.00017812251,0.00020301127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025342568,0.0015922096,0.0010880845,0.00020941033,0.00017660248,0.0007971908,0.0016764249,0.00066104496,0.048066616,0.40522552,0.01575218,0.5247294],"study_design_scores_gemma":[0.0010738455,0.0016699777,0.007707271,0.00023065096,0.00010124846,0.0025110221,0.00074910786,0.760216,0.004474061,0.21018311,0.010128805,0.0009548826],"about_ca_topic_score_codex":0.0000029157015,"about_ca_topic_score_gemma":5.232544e-7,"teacher_disagreement_score":0.759555,"about_ca_system_score_codex":0.000017454515,"about_ca_system_score_gemma":0.00008126507,"threshold_uncertainty_score":0.8016246},"labels":[],"label_agreement":null},{"id":"W4380373845","doi":"10.1007/s00493-023-00047-2","title":"The Chromatic Number of the Product of 5-Chromatic Graphs can be 4","year":2023,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics; Product (mathematics); Discrete mathematics; Geometry","score_opus":0.017308036087016348,"score_gpt":0.2537779589324572,"score_spread":0.23646992284544086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380373845","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98014814,0.00042316562,0.0005262047,0.014063237,0.0010635753,0.00036928503,0.000018106002,0.00017904586,0.0032092691],"genre_scores_gemma":[0.9989939,0.00004929761,0.00015845163,0.00005034326,0.0000066788293,0.000014157394,0.0000017966048,0.0000036628242,0.0007217292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865866,0.00013100007,0.00031825117,0.000214859,0.00045216957,0.00022506012],"domain_scores_gemma":[0.9980188,0.00042396638,0.00021574153,0.0012040216,0.0000926878,0.000044809785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004623867,0.00009584308,0.00022725148,0.0000932604,0.00020751703,0.000035823614,0.0019467609,0.00002723822,0.000019322999],"category_scores_gemma":[0.0005344867,0.000046249148,0.00014934501,0.006225199,0.00019686554,0.000074672615,0.00064541196,0.000091514274,0.000029494828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022870768,0.0002990028,0.020419966,0.00014528583,0.00017686178,0.0000068995896,0.0006898862,0.000020949063,0.00042871005,0.9412879,0.021363385,0.015158899],"study_design_scores_gemma":[0.0005028362,0.00015382699,0.25459087,0.00005182423,0.00011485427,0.000016163922,0.00017681747,0.0039253887,0.006961456,0.72306436,0.010123796,0.00031782157],"about_ca_topic_score_codex":0.000112190515,"about_ca_topic_score_gemma":0.000006192085,"teacher_disagreement_score":0.23417088,"about_ca_system_score_codex":0.000018802968,"about_ca_system_score_gemma":0.000045911907,"threshold_uncertainty_score":0.36175984},"labels":[],"label_agreement":null},{"id":"W4381681592","doi":"10.1007/s41468-023-00128-7","title":"Geometry of the matching distance for 2D filtering functions","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Computational Topology","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Abitibi-Témiscamingue","funders":"Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Kungliga Tekniska Högskolan; Knut och Alice Wallenbergs Stiftelse; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Matching (statistics); Grid; Manifold (fluid mechanics); Pareto principle; Computer science; Algorithm; Geometry; Mathematics; Mathematical optimization; Statistics; Engineering","score_opus":0.017143196305563636,"score_gpt":0.25656594691110507,"score_spread":0.23942275060554144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381681592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12793596,0.000056493667,0.8697821,0.0017398281,0.00024965743,0.00004028592,0.000015029979,0.000010509203,0.00017011841],"genre_scores_gemma":[0.9812809,0.0000128928305,0.018324148,0.0001861939,0.000074508556,0.0000027409496,0.0000032943835,0.0000020214784,0.00011330223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999331,0.000015072886,0.0002835628,0.000106227,0.0001548425,0.00010929731],"domain_scores_gemma":[0.9990659,0.0004916999,0.0002289667,0.000091871945,0.0000869135,0.000034700406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027625487,0.000055048135,0.00017071074,0.00021108788,0.00013359159,0.00002441664,0.00034711306,0.00003135484,0.000009513296],"category_scores_gemma":[0.000040923707,0.000035001416,0.00008931833,0.00084517756,0.000083147635,0.00008014693,0.00015919475,0.00008631653,0.000002175826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003052734,0.000049310474,0.000488553,0.000025721165,0.00010781569,0.0000031744066,0.00028723548,0.08394836,0.0003694643,0.86443347,0.0014453927,0.048811004],"study_design_scores_gemma":[0.000701776,0.00015532564,0.0589809,0.000015368201,0.000046022942,0.00007959378,0.00054709,0.03173565,0.00018345445,0.8956949,0.011724275,0.00013563929],"about_ca_topic_score_codex":0.000002537598,"about_ca_topic_score_gemma":8.69051e-7,"teacher_disagreement_score":0.8533449,"about_ca_system_score_codex":0.00000897546,"about_ca_system_score_gemma":0.00002857586,"threshold_uncertainty_score":0.14273164},"labels":[],"label_agreement":null},{"id":"W4382766048","doi":"10.4230/lipics.approx/random.2023.52","title":"Extracting Mergers and Projections of Partitions","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Randomness; Combinatorics; Omega; Mathematics; Lemma (botany); Constant (computer programming); Discrete mathematics; Random variable; Entropy (arrow of time); Computer science; Statistics; Physics","score_opus":0.1855664032319113,"score_gpt":0.21665258667470977,"score_spread":0.031086183442798482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382766048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24421878,0.000054527096,0.75269556,0.0003836941,0.0003359571,0.00013405636,0.000057146706,0.00026424992,0.0018560551],"genre_scores_gemma":[0.9961311,0.0003047442,0.0014938253,0.000011983706,0.000019367126,8.223198e-7,0.00001456983,0.000003817882,0.0020197264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899936,0.00006037515,0.00014902683,0.0005718823,0.000055659762,0.0001637158],"domain_scores_gemma":[0.99894214,0.00018823027,0.00017691054,0.0005302525,0.00008098161,0.000081474966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018563285,0.00011448788,0.00020734555,0.00047461523,0.00013438729,0.000044948378,0.0005821493,0.00011491146,0.000033973167],"category_scores_gemma":[0.00013068022,0.000116172385,0.00012776002,0.0018141012,0.00010343909,0.00022391825,0.0012536644,0.00024657336,0.00003534992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001261982,0.00035552733,0.031130439,0.0001737618,0.0006652381,0.00032180152,0.00043400298,0.3195302,0.00009461058,0.6403508,0.0023512614,0.0045797173],"study_design_scores_gemma":[0.00040273744,0.00012385503,0.033395402,0.00011906295,0.0004895699,0.0000050101676,0.00076972827,0.7144101,0.00020551293,0.24705538,0.0022084888,0.0008151341],"about_ca_topic_score_codex":0.00066981826,"about_ca_topic_score_gemma":0.00007804801,"teacher_disagreement_score":0.75191236,"about_ca_system_score_codex":0.000027321279,"about_ca_system_score_gemma":0.00004919771,"threshold_uncertainty_score":0.47373724},"labels":[],"label_agreement":null},{"id":"W4385444777","doi":"10.1007/978-3-031-24117-8_16","title":"Putting Paradoxes to Work: Contextuality in Measurement-Based Quantum Computation","year":2023,"lang":"en","type":"book-chapter","venue":"Outstanding contributions to logic","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Kochen–Specker theorem; Equivalence (formal languages); Computation; Mathematical proof; Theoretical physics; Cohomology; Mathematics; Pure mathematics; Algebra over a field; Witness; Quantum; Computer science; Physics; Geometry; Quantum mechanics; Algorithm; Programming language","score_opus":0.10555806707246979,"score_gpt":0.32801872083017863,"score_spread":0.22246065375770885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385444777","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003874116,0.00018436636,0.97776055,0.014161672,0.0004743009,0.00070763845,0.0005568649,0.000477223,0.0056386404],"genre_scores_gemma":[0.9693474,0.00002319941,0.011869495,0.0017371764,0.00017936365,0.00013313683,0.0004190014,0.00004574171,0.016245443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99608576,0.0001493106,0.0008916411,0.001100645,0.0010306706,0.0007419833],"domain_scores_gemma":[0.9972296,0.0007527434,0.00031392934,0.0006871148,0.00066446053,0.00035214916],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002773672,0.0004495249,0.0008670546,0.0016791027,0.00033905692,0.00039844296,0.0010365432,0.0003182131,0.0000560802],"category_scores_gemma":[0.0026985782,0.00040383777,0.00028983562,0.0022728676,0.000065211636,0.00016564739,0.0005147916,0.00044299176,0.0009883237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002851661,0.00006217874,0.00026797503,0.000017613645,0.00009099939,0.000101623766,0.00007005452,0.006348816,0.000017283975,0.97468084,0.0043549533,0.013959114],"study_design_scores_gemma":[0.0023375822,0.00064764835,0.0065645883,0.0016326836,0.0002727794,0.0000071644827,0.00007040579,0.027069785,0.000060933686,0.9033792,0.055431765,0.0025254316],"about_ca_topic_score_codex":0.00008505104,"about_ca_topic_score_gemma":0.00019701025,"teacher_disagreement_score":0.9693087,"about_ca_system_score_codex":0.0011410431,"about_ca_system_score_gemma":0.00016773105,"threshold_uncertainty_score":0.99984133},"labels":[],"label_agreement":null},{"id":"W4385446735","doi":"10.1007/s10711-023-00825-8","title":"Remarks on the oscillation energy of Legendrian isotopies","year":2023,"lang":"en","type":"article","venue":"Geometriae Dedicata","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Isotopy; Hyperbolic geometry; Degenerate energy levels; Oscillation (cell signaling); Algebraic geometry; Pure mathematics; Differential geometry; Metric (unit); Flow (mathematics); Class (philosophy); Energy (signal processing); Mathematical analysis; Topology (electrical circuits); Geometry; Combinatorics; Physics; Computer science; Artificial intelligence","score_opus":0.028217732930258768,"score_gpt":0.24494850649946184,"score_spread":0.21673077356920306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385446735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08094502,0.0009993133,0.82022274,0.06796133,0.0019729938,0.00039685052,0.00027854147,0.0009579302,0.026265267],"genre_scores_gemma":[0.99672633,0.0003167255,0.00062506384,0.0006180746,0.0001271234,0.000013481924,0.00008212204,0.000005216671,0.0014858533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982836,0.000107512824,0.00031687898,0.000379312,0.00062889385,0.0002837537],"domain_scores_gemma":[0.9974662,0.0010807617,0.000167504,0.0011281424,0.00007238756,0.000084973544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010593472,0.000115644965,0.0002198028,0.0013333173,0.00015397294,0.00006830997,0.0016565286,0.00007913463,0.00023130108],"category_scores_gemma":[0.0015890788,0.00006833324,0.00012831416,0.012636037,0.000107965054,0.0001723524,0.00057484175,0.000104715866,0.00027682493],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011994358,0.00008825649,0.0016126913,0.000009630414,0.00012757236,0.000016957554,0.00013329713,0.00012398206,0.00024687254,0.6982498,0.09062274,0.2087562],"study_design_scores_gemma":[0.0010367207,0.0007034058,0.11296928,0.000056394234,0.00007192218,0.000014233081,0.00038672917,0.025561532,0.0083118975,0.08888853,0.7612301,0.0007692243],"about_ca_topic_score_codex":0.00016519953,"about_ca_topic_score_gemma":0.000014192568,"teacher_disagreement_score":0.9157813,"about_ca_system_score_codex":0.000015928897,"about_ca_system_score_gemma":0.000028015615,"threshold_uncertainty_score":0.6071197},"labels":[],"label_agreement":null},{"id":"W4385520054","doi":"10.4171/jems/1370","title":"Volume entropy semi-norm and systolic volume semi-norm","year":2023,"lang":"en","type":"article","venue":"Journal of the European Mathematical Society","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto; Agence Nationale de la Recherche","keywords":"Mathematics; Norm (philosophy); Volume (thermodynamics); Pure mathematics; Entropy (arrow of time); Simplicial complex; Combinatorics; Thermodynamics","score_opus":0.0146533429264468,"score_gpt":0.22673056100919833,"score_spread":0.21207721808275154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385520054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37582955,0.00087231677,0.5749115,0.032980308,0.0011375354,0.0003874856,0.00003787108,0.0004472177,0.013396221],"genre_scores_gemma":[0.95743847,0.00046894906,0.019170607,0.0014842057,0.00082897424,0.00000211957,0.0000024793696,0.000040139676,0.020564046],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977027,0.00031499317,0.0006594196,0.00024516176,0.0006929046,0.00038478052],"domain_scores_gemma":[0.99834734,0.00026948305,0.00043981292,0.00056939846,0.00012538185,0.00024855227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025843524,0.00018428975,0.00042141872,0.00008471886,0.00026990793,0.00028488456,0.0017973569,0.000058586844,0.00011373619],"category_scores_gemma":[0.00064013305,0.0001005103,0.00062688737,0.0016029718,0.00018595142,0.00034197513,0.0012981024,0.00044576745,0.0006374478],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019985911,0.00089190574,0.009773138,0.00059345923,0.0015928725,0.00053006684,0.008489565,0.00085544586,0.0020186899,0.06700547,0.8628653,0.045364052],"study_design_scores_gemma":[0.0027501627,0.00078394305,0.13289532,0.0007085246,0.00094638596,0.0026226696,0.0023584005,0.42289826,0.00028964214,0.1842074,0.24790181,0.0016374877],"about_ca_topic_score_codex":0.0000023027137,"about_ca_topic_score_gemma":1.7254752e-7,"teacher_disagreement_score":0.61496353,"about_ca_system_score_codex":0.000058302485,"about_ca_system_score_gemma":0.000028309663,"threshold_uncertainty_score":0.81933147},"labels":[],"label_agreement":null},{"id":"W4385777897","doi":"10.32388/hggrg5","title":"Review of: \"Quantum mechanics and symplectic topology\"","year":2023,"lang":"en","type":"peer-review","venue":"","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Symplectic geometry; Topology (electrical circuits); Physics; Theoretical physics; Classical mechanics; Pure mathematics; Mathematics; Combinatorics","score_opus":0.056920669742481736,"score_gpt":0.3273811915849871,"score_spread":0.27046052184250535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385777897","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.9067e-8,0.69614935,0.1851268,0.1152436,0.0012407511,0.0002914295,0.000137237,0.00016777944,0.0016429549],"genre_scores_gemma":[0.000003988709,0.9288061,0.001981797,0.021676298,0.000062919025,0.000028565753,0.00024226677,0.000010523472,0.047187537],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99759173,0.0001678036,0.0007099545,0.00076419546,0.0004334544,0.00033284866],"domain_scores_gemma":[0.9975189,0.0005078144,0.0003809403,0.0011954589,0.00026707584,0.00012983414],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012463098,0.00029097428,0.0013752335,0.00037103836,0.00006233072,0.000035081324,0.0016569805,0.00020538145,0.0009217301],"category_scores_gemma":[0.0019306195,0.00019575501,0.00030065648,0.0035426482,0.000047590413,0.00010812219,0.0014736654,0.0003181074,0.00024878778],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.2635395e-7,0.000014425821,4.0972301e-7,0.017750135,0.00006740044,0.000009423648,0.0000011785261,5.982611e-8,9.1929046e-8,0.15340343,0.80701154,0.021741774],"study_design_scores_gemma":[0.000040444687,0.00010107024,0.0000038481057,0.012512893,0.00032062447,0.00002909043,0.0000012732457,0.0009993131,7.874481e-7,0.034902323,0.95083874,0.00024958423],"about_ca_topic_score_codex":0.00024100543,"about_ca_topic_score_gemma":0.000034439076,"teacher_disagreement_score":0.23265673,"about_ca_system_score_codex":0.000021892547,"about_ca_system_score_gemma":0.000098651326,"threshold_uncertainty_score":0.99999154},"labels":[],"label_agreement":null},{"id":"W4385800627","doi":"10.1109/cvprw59228.2023.00068","title":"Quantifying Extrinsic Curvature in Neural Manifolds","year":2023,"lang":"en","type":"article","venue":"","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Artificial neural network; Generative model; Curvature; Manifold (fluid mechanics); Information geometry; Invariant (physics); Artificial intelligence; Computer science; Mathematics; Topology (electrical circuits); Generative grammar; Geometry; Scalar curvature","score_opus":0.07255607167967665,"score_gpt":0.3026907998947017,"score_spread":0.23013472821502506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385800627","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82466024,0.00091658375,0.13103701,0.023100076,0.0011604376,0.00023677933,0.000010159655,0.0022614743,0.016617255],"genre_scores_gemma":[0.99564093,0.000031915955,0.0021333715,0.00043117793,0.000024611918,0.0000033541655,0.000007312729,0.0000020242728,0.001725288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99908847,0.00003228915,0.00014327899,0.00029909043,0.00017649696,0.00026037093],"domain_scores_gemma":[0.99946696,0.00010481748,0.000022689212,0.00033991717,0.000014606528,0.0000510066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022952692,0.00007321325,0.00012184563,0.0004921856,0.00004497684,0.00010236156,0.000704925,0.000048007198,0.00010073722],"category_scores_gemma":[0.00007458448,0.00005127144,0.000055270946,0.006070716,0.000013161181,0.0003267748,0.00041129088,0.00011308798,0.0005478158],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003825406,0.00010033547,0.10988996,0.000014617878,0.00002712026,0.00067339616,0.00019280092,0.0008429213,0.000246169,0.46796745,0.017103346,0.40293807],"study_design_scores_gemma":[0.000290903,0.000051639116,0.6283625,0.000005918193,0.0000057704565,0.000011762559,0.000092046284,0.34554484,0.00011656254,0.0053266743,0.019903826,0.0002876016],"about_ca_topic_score_codex":0.00015636002,"about_ca_topic_score_gemma":0.00015844451,"teacher_disagreement_score":0.5184725,"about_ca_system_score_codex":0.000009273285,"about_ca_system_score_gemma":0.0000065214795,"threshold_uncertainty_score":0.7041246},"labels":[],"label_agreement":null},{"id":"W4387210271","doi":"10.48550/arxiv.2309.15949","title":"Cristallinity of rigid flat connections revisited","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Statement (logic); Point (geometry); Set (abstract data type); Mathematics; Topology (electrical circuits); Pure mathematics; Computer science; Geometry; Combinatorics; Programming language; Philosophy","score_opus":0.14179398186111813,"score_gpt":0.21886828339435493,"score_spread":0.0770743015332368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387210271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10348205,0.000065945154,0.892867,0.00028339884,0.00039601285,0.0001506511,0.00020362802,0.0004161999,0.0021350745],"genre_scores_gemma":[0.9945303,0.000412967,0.0011805225,0.000046782377,0.000040453437,4.7259667e-7,0.0000822626,0.000007229114,0.0036989874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982636,0.00014481599,0.0002805735,0.0009492269,0.00010900533,0.00025277393],"domain_scores_gemma":[0.99753803,0.00032316972,0.00031428292,0.0014394445,0.00023686986,0.00014822508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032881042,0.00021121415,0.00046286287,0.00069429097,0.00013339093,0.00006889832,0.0019637728,0.0002439195,0.00013025153],"category_scores_gemma":[0.00026611032,0.00021187642,0.00037471007,0.0034346404,0.00014110451,0.00021925409,0.0027505232,0.0004377367,0.00024746166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024282075,0.00021217327,0.008366393,0.0001708076,0.00058892695,0.00047988526,0.000100673584,0.07006978,0.00003804649,0.9134621,0.0056120763,0.00087484624],"study_design_scores_gemma":[0.0007132165,0.00019894983,0.016538147,0.00016073708,0.00058352976,0.000005677686,0.00016167611,0.46064448,0.00029026414,0.51033556,0.009231814,0.0011359327],"about_ca_topic_score_codex":0.00067786314,"about_ca_topic_score_gemma":0.000060678074,"teacher_disagreement_score":0.8916865,"about_ca_system_score_codex":0.000071102564,"about_ca_system_score_gemma":0.000077985074,"threshold_uncertainty_score":0.86400694},"labels":[],"label_agreement":null},{"id":"W4387427116","doi":"10.1016/j.ejc.2023.103860","title":"Mixing is hard for triangle-free reflexive graphs","year":2023,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Ministry of Education, Science and Technology; Ministry of Education; Kyungpook National University","keywords":"Mathematics; Combinatorics; Simplicial complex; Simplicial homology; Graph; Simplicial approximation theorem; Discrete mathematics; Simplicial set; Pure mathematics","score_opus":0.056953514808353436,"score_gpt":0.2804022602852278,"score_spread":0.22344874547687438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387427116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04040899,0.0012797926,0.931403,0.012890287,0.0037388701,0.00021632455,0.000056950736,0.00029095126,0.009714857],"genre_scores_gemma":[0.97194165,0.00063015503,0.020951461,0.0013423684,0.00038064612,0.0000024086846,0.000009460014,0.000041749285,0.0047001126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817646,0.00026086226,0.0005767212,0.00022630306,0.0004594587,0.00030019364],"domain_scores_gemma":[0.9979905,0.00039693492,0.00047361257,0.00058486295,0.00036578972,0.00018833809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026900524,0.00013388977,0.00033837408,0.00074184017,0.00016129212,0.00018357235,0.002410697,0.000025560257,0.000016644974],"category_scores_gemma":[0.001163093,0.00010172091,0.00038791908,0.0033613988,0.000037989015,0.0004019169,0.00046807682,0.00021164615,0.00010304254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054816926,0.00019650387,0.0006929934,0.000027957278,0.00027226174,0.00085981295,0.00058776606,0.000071717564,0.00014470462,0.5254365,0.4065399,0.06511503],"study_design_scores_gemma":[0.0039610313,0.0018270961,0.008209568,0.000054353328,0.00011688546,0.00008730103,0.00012807218,0.0015164104,0.0005017137,0.55742884,0.42575452,0.00041423793],"about_ca_topic_score_codex":7.5526555e-7,"about_ca_topic_score_gemma":7.6862584e-8,"teacher_disagreement_score":0.9315326,"about_ca_system_score_codex":0.000029858851,"about_ca_system_score_gemma":0.00003464789,"threshold_uncertainty_score":0.4479715},"labels":[],"label_agreement":null},{"id":"W4388447105","doi":"10.4171/dm/x14","title":"Topological Iwasawa invariants and arithmetic statistics","year":2022,"lang":"en","type":"article","venue":"Documenta Mathematica","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Université Laval","funders":"","keywords":"Mathematics; Iwasawa theory; Arithmetic; Topology (electrical circuits); Algebra over a field; Pure mathematics; Combinatorics","score_opus":0.014609608637479562,"score_gpt":0.24675699233387588,"score_spread":0.23214738369639631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388447105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014836995,0.00020456528,0.97496647,0.004038567,0.00016839379,0.00022170045,0.00013073944,0.00015150558,0.0052810754],"genre_scores_gemma":[0.7350377,0.000045817946,0.26126853,0.0013914144,0.000022387996,0.00008040576,0.000030447407,0.0000071353775,0.0021161975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862134,0.00011910439,0.00026029843,0.00035535835,0.00039119372,0.00025269782],"domain_scores_gemma":[0.9990296,0.0003128378,0.00008615694,0.0004402054,0.000016475955,0.00011472106],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00044132842,0.00011660629,0.00022725436,0.00014946876,0.00032321384,0.0002035952,0.0007877779,0.000022691893,0.003018099],"category_scores_gemma":[0.00016092711,0.0000898634,0.00003672187,0.00068776496,0.00008424086,0.00022183926,0.0015909573,0.00015116067,0.0000898579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002037914,0.00016562127,0.00017988557,0.000010640349,0.000030197707,0.00006072801,0.00018266532,0.0000039546667,0.000018864514,0.98436075,0.0040374086,0.010947226],"study_design_scores_gemma":[0.0003995434,0.0003352798,0.0010307005,0.0000033525055,0.000045290883,0.00019031495,0.00033866736,0.015359804,0.00004949134,0.95771796,0.024239596,0.00028998434],"about_ca_topic_score_codex":0.000028298153,"about_ca_topic_score_gemma":0.0000012583799,"teacher_disagreement_score":0.72020066,"about_ca_system_score_codex":0.00003559289,"about_ca_system_score_gemma":0.000015359763,"threshold_uncertainty_score":0.9978933},"labels":[],"label_agreement":null},{"id":"W4388533850","doi":"10.1137/22m1522656","title":"Computing Geometric Feature Sizes for Algebraic Manifolds","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Applied Algebra and Geometry","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Bristol-Myers Squibb Canada; Vetenskapsrådet; National Science Foundation","keywords":"Feature (linguistics); Mathematics; Algebraic number; Variety (cybernetics); Computation; Algebraic geometry; Distinctive feature; Toric variety; Pure mathematics; Algorithm; Topology (electrical circuits); Combinatorics; Mathematical analysis","score_opus":0.0146984993993263,"score_gpt":0.25132138589689573,"score_spread":0.23662288649756943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388533850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48851404,0.003819426,0.49006388,0.010904029,0.0016998253,0.00075557147,0.000080633006,0.0010439398,0.003118661],"genre_scores_gemma":[0.9852724,0.000643706,0.010609062,0.0015645768,0.0006051584,0.0000143875195,0.000038764414,0.00002607546,0.0012258538],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971688,0.00005163413,0.00048006157,0.00074221194,0.00068151654,0.0008757996],"domain_scores_gemma":[0.99745166,0.0011952156,0.00030845503,0.00049246714,0.00011360753,0.00043858262],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013786141,0.00036299744,0.00057888246,0.0032865435,0.0007980598,0.0005423952,0.0012038079,0.00022843502,0.00006768568],"category_scores_gemma":[0.00036616297,0.00027132922,0.0002820667,0.010860057,0.00008067136,0.00029814392,0.0005135597,0.00061765197,0.00024558898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006518871,0.00019997229,0.0012774889,0.000078872385,0.0003586843,0.00014522109,0.00012853288,0.00034972417,0.00031799442,0.34737432,0.05305405,0.59664994],"study_design_scores_gemma":[0.0090851225,0.0031857777,0.265018,0.0001855516,0.00041698056,0.0011599325,0.0011947977,0.024428202,0.0025778948,0.41393328,0.27499256,0.0038219306],"about_ca_topic_score_codex":0.0000016604863,"about_ca_topic_score_gemma":5.436977e-7,"teacher_disagreement_score":0.59282804,"about_ca_system_score_codex":0.000047020574,"about_ca_system_score_gemma":0.000042255215,"threshold_uncertainty_score":0.9999739},"labels":[],"label_agreement":null},{"id":"W4388767802","doi":"10.1142/s0219199723500554","title":"Persistent homology for functionals","year":2023,"lang":"en","type":"article","venue":"Communications in Contemporary Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Innosuisse - Schweizerische Agentur für Innovationsförderung; Agence Nationale de la Recherche","keywords":"Mathematics; Persistent homology; Morse theory; Morse code; Homology (biology); Pure mathematics; Filtration (mathematics); Class (philosophy); Algorithm; Computer science","score_opus":0.2859288559465944,"score_gpt":0.37204540332896174,"score_spread":0.08611654738236735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388767802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048785717,0.00399215,0.91644806,0.042565465,0.00030581627,0.0009149081,0.00009921741,0.0007177692,0.030078018],"genre_scores_gemma":[0.7984945,0.00031613922,0.19751742,0.00037665112,0.00001778772,0.00035353334,0.00019787566,0.000008542011,0.0027175436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990956,0.000074426374,0.00036195666,0.00019085099,0.00011582502,0.00016129609],"domain_scores_gemma":[0.9962596,0.001586141,0.00010516606,0.001922135,0.000085527325,0.00004141273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000818513,0.00008313586,0.00020321348,0.00044382925,0.00016055857,0.00005354333,0.0022094715,0.00005792347,0.000013392014],"category_scores_gemma":[0.00052072987,0.00007212151,0.00013457116,0.0018818947,0.00010165624,0.00021396266,0.0008908708,0.00009919828,0.00015057033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021866006,0.0003847707,0.0006204353,0.000038537553,0.00007182357,0.0000034269087,0.00076537085,0.00012216368,0.000019757817,0.95197743,0.039937414,0.0060566915],"study_design_scores_gemma":[0.00069788314,0.00015425967,0.0018380259,0.00004178025,0.00002220021,0.000014552981,0.0012984984,0.43756205,0.00001693687,0.34622356,0.211811,0.0003192548],"about_ca_topic_score_codex":0.000011081421,"about_ca_topic_score_gemma":0.0000073077604,"teacher_disagreement_score":0.79361594,"about_ca_system_score_codex":0.000026339896,"about_ca_system_score_gemma":0.000054567226,"threshold_uncertainty_score":0.4105785},"labels":[],"label_agreement":null},{"id":"W4388832379","doi":"10.3389/fcpxs.2023.1281714","title":"Topology and spectral interconnectivities of higher-order multilayer networks","year":2023,"lang":"en","type":"article","venue":"Frontiers in Complex Systems","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Formalism (music); Pairwise comparison; Computer science; Interdependence; Complex system; Theoretical computer science; Interdependent networks; Topology (electrical circuits); Persistent homology; Complex network; Mathematics; Artificial intelligence; Combinatorics; Algorithm","score_opus":0.029225008047717434,"score_gpt":0.2618234814674809,"score_spread":0.23259847341976347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388832379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053395756,0.0020465134,0.93907964,0.00080355007,0.0030904869,0.00019425088,0.000017925928,0.00017772395,0.0011941601],"genre_scores_gemma":[0.99072444,0.00006718481,0.008100898,0.000051277246,0.00010809091,0.000014384244,0.000011626526,0.0000049668897,0.00091713405],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986873,0.00016014423,0.00033172587,0.0003543693,0.00014278264,0.0003236643],"domain_scores_gemma":[0.9992734,0.00018606246,0.000098885284,0.0003453734,0.000038448507,0.000057801808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035620504,0.00012422643,0.00045017997,0.0005584575,0.000049759627,0.000058576385,0.0005371089,0.000086297565,0.000022716784],"category_scores_gemma":[0.000042589858,0.00010251029,0.00005169063,0.0019112653,0.00016487134,0.00017688192,0.0003299727,0.00011577029,0.00000627633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006215775,0.00023838601,0.39819655,0.00022208387,0.0004882899,0.00018846008,0.0019260348,0.036703896,0.00017565323,0.22590254,0.29044175,0.045454197],"study_design_scores_gemma":[0.0004608694,0.00012481627,0.10765658,0.000022254293,0.00001091141,0.000011670229,0.0007607219,0.8656838,0.00001202298,0.0044700596,0.020555003,0.00023128718],"about_ca_topic_score_codex":0.00055566523,"about_ca_topic_score_gemma":0.000029993662,"teacher_disagreement_score":0.9373287,"about_ca_system_score_codex":0.000029972824,"about_ca_system_score_gemma":0.000008960079,"threshold_uncertainty_score":0.41802484},"labels":[],"label_agreement":null},{"id":"W4389070743","doi":"10.1101/2023.11.27.568841","title":"Discovering Secondary Protein Structures via Local Euler Curvature","year":2023,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre Hospitalier Universitaire de Sherbrooke; Université de Sherbrooke","funders":"Ministerio de Ciencia e Innovación; Agencia Estatal de Investigación; Basque Center for Applied Mathematics; Eusko Jaurlaritza","keywords":"Cluster analysis; Computer science; Euler characteristic; Classifier (UML); Curvature; Topological data analysis; Protein secondary structure; Artificial intelligence; Topology (electrical circuits); Protein structure; Protein structure prediction; Theoretical computer science; Mathematics; Biology; Algorithm; Geometry","score_opus":0.014934767669636428,"score_gpt":0.21854720640165778,"score_spread":0.20361243873202137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389070743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17558418,0.0014202585,0.8161869,0.0011894098,0.0025370785,0.00071547076,0.0005655204,0.001786273,0.000014919114],"genre_scores_gemma":[0.97681284,0.000061205574,0.022100888,0.00025396212,0.00049663946,0.00015689626,0.000001735558,0.000079117446,0.00003673391],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9955768,0.00017562108,0.0006540627,0.0019438617,0.00077881635,0.00087085826],"domain_scores_gemma":[0.99609697,0.00011837002,0.00044569766,0.0026682774,0.00027790878,0.00039277296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006001779,0.0007365195,0.00081818353,0.0007176636,0.0002632258,0.00083734613,0.003157853,0.00076537306,0.000113792485],"category_scores_gemma":[0.0003209735,0.0006400074,0.00034083184,0.0026701756,0.00021212266,0.00059070956,0.004438694,0.0017503465,0.00026267415],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019980351,0.001696539,0.016509315,0.0058721527,0.0074217687,0.0059292726,0.0002474072,0.017195525,0.6919112,0.22684938,0.023839068,0.0023285202],"study_design_scores_gemma":[0.001983742,0.00039880016,0.58078164,0.0011868352,0.0005125476,2.602681e-7,0.000017955776,0.041649107,0.2864765,0.0028828795,0.07569162,0.0084181335],"about_ca_topic_score_codex":0.00027750086,"about_ca_topic_score_gemma":0.000011279993,"teacher_disagreement_score":0.80122864,"about_ca_system_score_codex":0.00020520741,"about_ca_system_score_gemma":0.00040908656,"threshold_uncertainty_score":0.9996051},"labels":[],"label_agreement":null},{"id":"W4389821359","doi":"10.48550/arxiv.2312.09194","title":"Dyson Equation for Correlated Linearizations and Test Error of Random Features Regression","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Mathematics; Random matrix; Uniqueness; Applied mathematics; Matrix (chemical analysis); Ridge; Scaling; Regression; Linear regression; Class (philosophy); Statistics; Computer science; Eigenvalues and eigenvectors; Mathematical analysis; Artificial intelligence","score_opus":0.1285123907950168,"score_gpt":0.2276777890962469,"score_spread":0.09916539830123008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389821359","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029350378,0.00009203886,0.96934325,0.00032172084,0.00023914265,0.00028831288,0.0001454306,0.00014254457,0.000077174736],"genre_scores_gemma":[0.9920553,0.00026249228,0.0034172696,0.000019126648,0.000026002295,0.0000016530829,0.00025843765,0.0000068949685,0.0039528436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889404,0.000062187166,0.00018671402,0.00063100125,0.000074079995,0.0001519558],"domain_scores_gemma":[0.9978521,0.001060422,0.00029251532,0.0005192042,0.00019929242,0.000076498334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024774892,0.0001546379,0.00030833326,0.0004682272,0.00013725685,0.00005663733,0.00064127194,0.00024867064,0.000008878426],"category_scores_gemma":[0.0010415056,0.00013300292,0.00013803509,0.001480871,0.000081558894,0.00017047036,0.000920242,0.00020722715,0.000008216188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035441533,0.0006568185,0.029925361,0.00045671652,0.00062320183,0.0001228029,0.0006186477,0.62616754,0.00034228803,0.32286325,0.006165746,0.011703196],"study_design_scores_gemma":[0.0009930276,0.00009481013,0.009597435,0.00008899945,0.00018327877,8.721068e-7,0.00004006799,0.9550354,0.0001240993,0.033458028,0.00017887518,0.00020513352],"about_ca_topic_score_codex":0.00015731483,"about_ca_topic_score_gemma":0.000026902277,"teacher_disagreement_score":0.965926,"about_ca_system_score_codex":0.000029069344,"about_ca_system_score_gemma":0.0000500267,"threshold_uncertainty_score":0.54237014},"labels":[],"label_agreement":null},{"id":"W4389892881","doi":"10.28924/2291-8639-21-2023-136","title":"A Topological Data Analysis of the Protein Structure","year":2023,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Persistent homology; Topological data analysis; Embedding; Computer science; Rigidity (electromagnetism); Homology (biology); Topology (electrical circuits); Computational topology; Theoretical computer science; Data mining; Mathematics; Algorithm; Artificial intelligence; Combinatorics; Biology","score_opus":0.028333074388401828,"score_gpt":0.31699788979271176,"score_spread":0.28866481540430994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389892881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23095964,0.00013864216,0.7595039,0.008549644,0.00006586207,0.00009883567,0.00051027676,0.00001991047,0.00015329721],"genre_scores_gemma":[0.9956532,0.00008403871,0.00390228,0.00009844162,0.0000621294,0.0000033074302,0.00008011021,0.0000012170016,0.00011529131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99861306,0.00006000743,0.00046576207,0.00023197499,0.0005399793,0.0000892002],"domain_scores_gemma":[0.9982489,0.00014393902,0.00049738534,0.00070412515,0.00034905344,0.00005661255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044143214,0.000071120594,0.0003076421,0.0013408214,0.000075482865,0.00009610042,0.0030469028,0.000040990155,0.00008855577],"category_scores_gemma":[0.00015415139,0.00003947623,0.00033508608,0.011071616,0.000098193974,0.00021902031,0.0009020212,0.000114061375,0.0000019537054],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029103707,0.0005408051,0.1882432,0.000009765048,0.07173455,0.000030510495,0.00032122864,0.02280703,0.0067058844,0.5370887,0.0022651094,0.17022413],"study_design_scores_gemma":[0.00030195096,0.000051972955,0.7695636,0.000008573596,0.009274842,0.000016445532,0.00016659257,0.15780887,0.00063609745,0.036729354,0.025230281,0.00021139464],"about_ca_topic_score_codex":0.0000542019,"about_ca_topic_score_gemma":0.00007407697,"teacher_disagreement_score":0.76469356,"about_ca_system_score_codex":0.000012533936,"about_ca_system_score_gemma":0.000029396877,"threshold_uncertainty_score":0.5661954},"labels":[],"label_agreement":null},{"id":"W4390235465","doi":"10.20944/preprints202312.1770.v1","title":"Shared Protentions in Multi-Agent Active Inference","year":2023,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Inference; Category theory; Computer science; Cognitive science; Topos theory; Artificial intelligence; Situation calculus; Phenomenology (philosophy); Epistemology; Theoretical computer science; Mathematics; Psychology","score_opus":0.35283395166738385,"score_gpt":0.4087831728974821,"score_spread":0.05594922123009827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390235465","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53419113,0.000108258384,0.45371398,0.004032401,0.0013434074,0.0023496712,0.00041445196,0.0014457925,0.002400919],"genre_scores_gemma":[0.98870677,0.00012782056,0.006676841,0.000078582794,0.000038678045,0.000775577,0.0001465167,0.00001554429,0.0034336972],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9963595,0.00023513318,0.00063489756,0.0017917599,0.00048815244,0.000490533],"domain_scores_gemma":[0.9968241,0.00019919434,0.00033147118,0.0022822476,0.00017548495,0.00018749623],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00074596057,0.00035203932,0.0005393786,0.00091609877,0.00011301719,0.00012325736,0.0033695032,0.00033614412,0.00048977335],"category_scores_gemma":[0.0017204548,0.0003224736,0.0003034224,0.0020762489,0.00008773084,0.00035839365,0.012778159,0.0011322912,0.0053499243],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002061669,0.0014043459,0.961085,0.00017952498,0.00041668734,0.00024917698,0.0017574652,0.009119904,0.00067644735,0.009106924,0.0001458757,0.01583798],"study_design_scores_gemma":[0.00025669247,0.000015055617,0.96779674,0.000111894355,0.000025024336,0.0000012615626,0.0000476028,0.01627365,0.0008595101,0.013550951,0.00066091894,0.0004006964],"about_ca_topic_score_codex":0.0019091556,"about_ca_topic_score_gemma":0.00035969066,"teacher_disagreement_score":0.4545156,"about_ca_system_score_codex":0.00019963422,"about_ca_system_score_gemma":0.00017061997,"threshold_uncertainty_score":0.99992275},"labels":[],"label_agreement":null},{"id":"W4391244969","doi":"10.48550/arxiv.2401.13646","title":"Bounds on the mod 2 homology of random 2-dimensional determinantal hypertrees","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Chatterjee; Combinatorics; Mathematics; Simplicial complex; Random graph; Statement (logic); Betti number; Graph; Homology (biology); Discrete mathematics; Computer science","score_opus":0.06026216775025626,"score_gpt":0.1849607676604765,"score_spread":0.12469859991022025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391244969","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9461338,0.00025937124,0.048505064,0.00085646904,0.0006389347,0.00016309727,0.00009036309,0.00010636522,0.003246527],"genre_scores_gemma":[0.99756694,0.00006207573,0.00021606768,0.00015955341,0.00004066596,8.9481244e-7,0.0000139742615,0.000005957464,0.0019338618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840623,0.00017371807,0.00020257161,0.00083903584,0.00013131853,0.00024714725],"domain_scores_gemma":[0.9980065,0.00061526557,0.00015727103,0.0010624405,0.00007939211,0.00007912002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029659388,0.00023258428,0.00041395193,0.0004412534,0.00012391804,0.0000673937,0.0019614017,0.0002151962,0.00010789824],"category_scores_gemma":[0.00008959744,0.00015338422,0.0003935303,0.0011470005,0.0003059611,0.00007467076,0.0037688063,0.00051210367,0.00017184872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012784725,0.00028045094,0.0005172029,0.00004539462,0.0003861083,0.0012623745,0.000080445854,0.04603109,0.00008544791,0.94558257,0.0022293972,0.0033716834],"study_design_scores_gemma":[0.00064237294,0.00024581584,0.0011659486,0.000078878955,0.00028170514,0.000029707047,0.00003343351,0.505991,0.0004537225,0.48956272,0.001089098,0.00042565246],"about_ca_topic_score_codex":0.00016343723,"about_ca_topic_score_gemma":0.00003332331,"teacher_disagreement_score":0.45995986,"about_ca_system_score_codex":0.000054191332,"about_ca_system_score_gemma":0.00009998113,"threshold_uncertainty_score":0.6254827},"labels":[],"label_agreement":null},{"id":"W4391564220","doi":"10.1103/prxquantum.5.010319","title":"Analyzing Prospects for Quantum Advantage in Topological Data Analysis","year":2024,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Australian Research Council; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; U.S. Department of Energy; Office of Science; National Science Foundation","keywords":"Quantum gate; Quantum; Quantum algorithm; Computer science; Qubit; Mathematics; Algorithm; Topology (electrical circuits); Discrete mathematics; Theoretical computer science; Combinatorics; Quantum mechanics","score_opus":0.058865690539145935,"score_gpt":0.34399010999983914,"score_spread":0.2851244194606932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391564220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022162749,0.0038207604,0.9696678,0.0028083823,0.00038193722,0.00027017694,0.0002279651,0.00035842622,0.00030182372],"genre_scores_gemma":[0.98397654,0.00021738686,0.015012186,0.00013132807,0.00010110023,0.000041006435,0.0002959147,0.000008571702,0.0002159785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970911,0.00009740196,0.00051936763,0.0013985324,0.0003078246,0.0005857581],"domain_scores_gemma":[0.9974335,0.00070271903,0.000079265585,0.0015971278,0.000047429854,0.00013995772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013113625,0.00022620482,0.00055306585,0.0013462325,0.00011641875,0.00047804785,0.0025721218,0.00011463986,0.0001145429],"category_scores_gemma":[0.0006531493,0.00016258708,0.00027416056,0.008782665,0.00008194027,0.0009930644,0.0011745065,0.00025109976,0.0000822491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012100502,0.0001630021,0.009116302,0.000050620798,0.00042140152,0.00018060427,0.00006931357,0.00019765287,0.000053372474,0.9743543,0.00089905725,0.014482253],"study_design_scores_gemma":[0.00015745361,0.00012276322,0.008185021,0.00001605038,0.0002947545,0.000005766875,0.000052766325,0.8748322,0.000035709607,0.10484547,0.0111654345,0.00028658722],"about_ca_topic_score_codex":0.00013191324,"about_ca_topic_score_gemma":0.00011899172,"teacher_disagreement_score":0.9618138,"about_ca_system_score_codex":0.00005739127,"about_ca_system_score_gemma":0.000056393103,"threshold_uncertainty_score":0.66301084},"labels":[],"label_agreement":null},{"id":"W4391835920","doi":"","title":"INVARIANTS OF PERSISTENCE MODULES DEFINED BY ORDER-EMBEDDINGS","year":2024,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Indecomposable module; Functor; Partially ordered set; Mathematics; Embedding; Endomorphism; Iterated function; Pure mathematics; Combinatorics; Order (exchange); Discrete mathematics; Computer science","score_opus":0.05095263933021541,"score_gpt":0.26091265163955135,"score_spread":0.20996001230933595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391835920","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8779232,0.004256959,0.107664645,0.0044859797,0.00093672023,0.00020605756,0.0003152105,0.0003353915,0.0038758488],"genre_scores_gemma":[0.98315656,0.00031294278,0.014026154,0.00027696666,0.000059958624,0.00002008957,0.00008227603,0.000013005092,0.0020520675],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748725,0.0000719673,0.0005059996,0.0011231685,0.00044113438,0.00037051138],"domain_scores_gemma":[0.997917,0.00018307549,0.0002711959,0.0012950836,0.00019201914,0.00014161864],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036955773,0.00032216683,0.00059080013,0.0003909455,0.00007690944,0.00016702163,0.0026458069,0.00028561158,0.00015269266],"category_scores_gemma":[0.00054685073,0.00025633292,0.00029608174,0.002001655,0.0001526683,0.00016950305,0.005746118,0.0005967455,0.00040826612],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007890818,0.0034367887,0.3396632,0.0036700594,0.0054087653,0.0007766207,0.0047835354,0.00376065,0.01319997,0.20457764,0.23450063,0.18614322],"study_design_scores_gemma":[0.0020769103,0.0016154426,0.24445774,0.0021729202,0.0023993016,0.00010665061,0.0008779362,0.2697199,0.024087215,0.37882298,0.06624327,0.0074197245],"about_ca_topic_score_codex":0.0005848204,"about_ca_topic_score_gemma":0.00001675174,"teacher_disagreement_score":0.26595926,"about_ca_system_score_codex":0.000047724756,"about_ca_system_score_gemma":0.000098344324,"threshold_uncertainty_score":0.9999889},"labels":[],"label_agreement":null},{"id":"W4392201431","doi":"10.1101/2024.02.16.579506","title":"The Topology of Representational Geometry","year":2024,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Similarity (geometry); Computer science; Artificial intelligence; Function (biology); Topology (electrical circuits); Artificial neural network; Pattern recognition (psychology); Mathematics; Image (mathematics)","score_opus":0.015768597004808496,"score_gpt":0.2459191006431322,"score_spread":0.23015050363832368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392201431","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7415666,0.03267548,0.18794003,0.020532569,0.012853525,0.0012687502,0.0011204693,0.0016813274,0.00036127373],"genre_scores_gemma":[0.98935074,0.0004643663,0.009623912,0.00015656746,0.00027650458,0.000063431275,2.7201614e-7,0.000020598114,0.000043607557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99725235,0.00016007083,0.00061294093,0.0009922093,0.00055443856,0.0004280109],"domain_scores_gemma":[0.99648494,0.0004994071,0.00036344287,0.0021180392,0.00038505084,0.00014914735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095556316,0.00030254826,0.00045240528,0.00054714165,0.00018314229,0.00036620538,0.0025443041,0.0003245393,0.00005332133],"category_scores_gemma":[0.00069714035,0.00021421997,0.00027530134,0.0025408152,0.00031355186,0.000113848364,0.004065845,0.00073183235,0.00014823838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019767735,0.00026051415,0.0063129487,0.0003617447,0.0011921414,0.00019097932,0.000017106091,0.00031818284,0.0292214,0.95257664,0.009376864,0.00015168435],"study_design_scores_gemma":[0.0014208606,0.0005395577,0.49966836,0.0006547399,0.0012679931,3.534677e-7,0.00003017534,0.02992904,0.27122015,0.01766355,0.17301723,0.004587965],"about_ca_topic_score_codex":0.00010996767,"about_ca_topic_score_gemma":0.0000022099189,"teacher_disagreement_score":0.9349131,"about_ca_system_score_codex":0.00007867702,"about_ca_system_score_gemma":0.00034646757,"threshold_uncertainty_score":0.87356365},"labels":[],"label_agreement":null},{"id":"W4392215833","doi":"10.1103/physrevd.109.034518","title":"Improved algorithm for dynamical triangulations and simulations of finer lattices","year":2024,"lang":"en","type":"article","venue":"Physical review. D/Physical review. D.","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Office of Science; Ministry of Colleges and Universities; Alliance de recherche numérique du Canada; National Science Foundation; Government of Canada; Compute Canada; High Energy Physics; U.S. Department of Energy; Institut Périmètre de physique théorique; Innovation, Science and Economic Development Canada","keywords":"Algorithm; Computer science; Statistical physics; Physics","score_opus":0.022180045858801498,"score_gpt":0.427082817605102,"score_spread":0.4049027717463005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392215833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0433809,0.2811303,0.6409274,0.02755242,0.00041593923,0.0040352154,0.0012711982,0.0005244765,0.00076216843],"genre_scores_gemma":[0.857504,0.08694752,0.049583405,0.0035007172,0.001078023,0.0005327333,0.00045037043,0.00006203723,0.00034116884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976217,0.00016099276,0.0006688146,0.0007844661,0.0004023076,0.00036172452],"domain_scores_gemma":[0.99637413,0.0022878638,0.00019681826,0.0007102122,0.00020076739,0.00023021398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040045817,0.00031631012,0.0012068789,0.00012836483,0.00010772867,0.00010256934,0.0006750513,0.00004123381,0.000021152038],"category_scores_gemma":[0.0011520109,0.00021305287,0.00076941494,0.0024436368,0.000147338,0.00052792806,0.00032063178,0.00024585906,0.00004699415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024469196,0.00055496424,0.00004520091,0.0043642926,0.00019383659,0.0000032847863,0.000032003827,0.000026473283,0.0012017553,0.20596306,0.002014795,0.78559786],"study_design_scores_gemma":[0.000176243,0.0001871839,0.00029962478,0.0017927225,0.00070608343,0.0000023982857,0.0000010778492,0.8771881,0.00017497981,0.07921885,0.03995446,0.00029830093],"about_ca_topic_score_codex":0.000011697974,"about_ca_topic_score_gemma":0.000002357878,"teacher_disagreement_score":0.8771616,"about_ca_system_score_codex":0.000028827753,"about_ca_system_score_gemma":0.000058508806,"threshold_uncertainty_score":0.8688044},"labels":[],"label_agreement":null},{"id":"W4393139439","doi":"10.1007/s00209-024-03460-5","title":"Random group actions on $$\\textrm{CAT}(0)$$ square complexes","year":2024,"lang":"de","type":"article","venue":"Mathematische Zeitschrift","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Square (algebra); Group (periodic table); Combinatorics; Pure mathematics; Geometry; Quantum mechanics; Physics","score_opus":0.04330554920111333,"score_gpt":0.2960279831808725,"score_spread":0.25272243397975913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393139439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034079372,0.031940475,0.88205147,0.012127999,0.00597779,0.0011005157,0.001005167,0.0018969749,0.060491644],"genre_scores_gemma":[0.9451517,0.0022248982,0.033796445,0.0012927197,0.0022436916,0.00020635186,0.00042425824,0.00012606957,0.014533851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9949669,0.000366686,0.0009832399,0.0015897236,0.0011230146,0.0009704083],"domain_scores_gemma":[0.9954481,0.0020519183,0.00021688684,0.0017342357,0.00011395357,0.000434887],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011758386,0.00072698557,0.0010355111,0.0010785472,0.00066755735,0.0021147379,0.001930503,0.00035631895,0.004478894],"category_scores_gemma":[0.00050154777,0.0005356931,0.00081406295,0.004333458,0.00027757377,0.0009290692,0.0008314057,0.00076289574,0.028189637],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035136,0.0006430575,0.000029817895,0.00045399513,0.00080477213,0.000257608,0.0009034937,0.00012877943,0.00031552144,0.8704009,0.068106204,0.05792071],"study_design_scores_gemma":[0.00090323464,0.00045430145,0.0004568593,0.00077182916,0.00061848556,0.00006253254,0.00016482604,0.06315796,0.00037636748,0.006363564,0.92578876,0.0008812966],"about_ca_topic_score_codex":0.00014802565,"about_ca_topic_score_gemma":0.000025763062,"teacher_disagreement_score":0.9417438,"about_ca_system_score_codex":0.00002351342,"about_ca_system_score_gemma":0.000104780294,"threshold_uncertainty_score":0.9997095},"labels":[],"label_agreement":null},{"id":"W4393236250","doi":"10.21105/joss.06321","title":"TDApplied: An R package for machine learning andinference with persistence diagrams","year":2024,"lang":"en","type":"article","venue":"The Journal of Open Source Software","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Canadian Institutes of Health Research","keywords":"Topological data analysis; Persistent homology; Inference; Computer science; Persistence (discontinuity); Variety (cybernetics); Theoretical computer science; Diagram; Machine learning; Artificial intelligence; Data mining; Algorithm","score_opus":0.04598616535528826,"score_gpt":0.28684652085976675,"score_spread":0.24086035550447848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393236250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022088079,0.0011128082,0.9751326,0.0012856212,0.00006465938,0.00014491829,0.000012292556,0.00006320198,0.000095854164],"genre_scores_gemma":[0.9603864,0.00011229064,0.038010955,0.00021413581,0.00008967836,0.000005539958,0.000007769193,0.000012250021,0.001161012],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998826,0.00012843766,0.00025643333,0.00021709598,0.00033690582,0.0002351033],"domain_scores_gemma":[0.99840623,0.0007410311,0.00019575324,0.00037911333,0.00013666373,0.0001412331],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014573756,0.00013811563,0.0002688966,0.00014467181,0.00033152735,0.0010578409,0.003035762,0.00003709688,0.0000662405],"category_scores_gemma":[0.00025164755,0.00006565321,0.000106573236,0.001004455,0.0000937015,0.0010639267,0.00052237086,0.00036890793,0.000014238239],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003316546,0.0002505959,0.013603802,0.000089445515,0.0005660657,0.0001707261,0.007928033,0.0070013935,0.00019918602,0.008012478,0.0023700022,0.9594766],"study_design_scores_gemma":[0.0058591003,0.022248266,0.023622217,0.0014659219,0.002651019,0.0053603617,0.014482794,0.21682362,0.0022551254,0.05982194,0.64200205,0.0034075687],"about_ca_topic_score_codex":0.000055664605,"about_ca_topic_score_gemma":0.000024855575,"teacher_disagreement_score":0.95606905,"about_ca_system_score_codex":0.000026405434,"about_ca_system_score_gemma":0.00007833865,"threshold_uncertainty_score":0.99997914},"labels":[],"label_agreement":null},{"id":"W4393432267","doi":"10.5281/zenodo.6311384","title":"Data and Weights for Reverse Homology","year":2021,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Homology (biology); Computer science; Computational biology; Biology; Combinatorics; Mathematics; Genetics; Amino acid","score_opus":0.06337598371883695,"score_gpt":0.2774712107476321,"score_spread":0.21409522702879513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393432267","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006963363,0.00040225504,0.04005723,0.0013766544,0.0001576546,0.00023082644,0.9568347,0.00019979701,0.0007339478],"genre_scores_gemma":[0.000017059114,0.00099764,0.00335978,0.00035866786,0.00016616558,4.5266866e-8,0.99439096,0.00019179643,0.0005179021],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99761486,0.00032964797,0.00028346264,0.0010909422,0.0003089245,0.0003721412],"domain_scores_gemma":[0.99678147,0.00011438293,0.00016153764,0.0023525287,0.00039545808,0.00019461408],"candidate_categories":["sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science","insufficient_payload"],"category_scores_codex":[0.0008186787,0.00019009518,0.0003130693,0.00043465008,0.0014305363,0.0012577727,0.005569025,0.00016787738,0.0045449804],"category_scores_gemma":[0.0019198853,0.00017263013,0.00005844933,0.0011530526,0.00017962801,0.00040371082,0.012134841,0.0003189249,0.0020256361],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006421913,0.00007629161,6.470038e-8,0.000059850146,0.00006825493,0.000042825213,0.000015291105,6.193403e-7,0.0000050632457,0.0016882605,0.96155417,0.03648291],"study_design_scores_gemma":[0.00023783847,0.00014351982,0.000012108788,0.000015409305,0.00005497816,0.00015530796,0.000020909647,0.00046918454,0.0000036780111,0.0005532038,0.9981281,0.00020577443],"about_ca_topic_score_codex":0.000038791968,"about_ca_topic_score_gemma":0.0000021057988,"teacher_disagreement_score":0.037556272,"about_ca_system_score_codex":0.000044290544,"about_ca_system_score_gemma":0.000007792923,"threshold_uncertainty_score":0.99986947},"labels":[],"label_agreement":null},{"id":"W4393452174","doi":"10.5281/zenodo.5159439","title":"Data and Weights for Reverse Homology","year":2021,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Homology (biology); Computational biology; Computer science; Biology; Genetics; Amino acid","score_opus":0.06337598371883695,"score_gpt":0.2774712107476321,"score_spread":0.21409522702879513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393452174","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006963363,0.00040225504,0.04005723,0.0013766544,0.0001576546,0.00023082644,0.9568347,0.00019979701,0.0007339478],"genre_scores_gemma":[0.000017059114,0.00099764,0.00335978,0.00035866786,0.00016616558,4.5266866e-8,0.99439096,0.00019179643,0.0005179021],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99761486,0.00032964797,0.00028346264,0.0010909422,0.0003089245,0.0003721412],"domain_scores_gemma":[0.99678147,0.00011438293,0.00016153764,0.0023525287,0.00039545808,0.00019461408],"candidate_categories":["sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science","insufficient_payload"],"category_scores_codex":[0.0008186787,0.00019009518,0.0003130693,0.00043465008,0.0014305363,0.0012577727,0.005569025,0.00016787738,0.0045449804],"category_scores_gemma":[0.0019198853,0.00017263013,0.00005844933,0.0011530526,0.00017962801,0.00040371082,0.012134841,0.0003189249,0.0020256361],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006421913,0.00007629161,6.470038e-8,0.000059850146,0.00006825493,0.000042825213,0.000015291105,6.193403e-7,0.0000050632457,0.0016882605,0.96155417,0.03648291],"study_design_scores_gemma":[0.00023783847,0.00014351982,0.000012108788,0.000015409305,0.00005497816,0.00015530796,0.000020909647,0.00046918454,0.0000036780111,0.0005532038,0.9981281,0.00020577443],"about_ca_topic_score_codex":0.000038791968,"about_ca_topic_score_gemma":0.0000021057988,"teacher_disagreement_score":0.037556272,"about_ca_system_score_codex":0.000044290544,"about_ca_system_score_gemma":0.000007792923,"threshold_uncertainty_score":0.99986947},"labels":[],"label_agreement":null},{"id":"W4393701688","doi":"10.5281/zenodo.6258674","title":"Data and Weights for Reverse Homology","year":2021,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Homology (biology); Computational biology; Biology; Computer science; Evolutionary biology; Genetics; Amino acid","score_opus":0.06337598371883695,"score_gpt":0.2774712107476321,"score_spread":0.21409522702879513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393701688","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006963363,0.00040225504,0.04005723,0.0013766544,0.0001576546,0.00023082644,0.9568347,0.00019979701,0.0007339478],"genre_scores_gemma":[0.000017059114,0.00099764,0.00335978,0.00035866786,0.00016616558,4.5266866e-8,0.99439096,0.00019179643,0.0005179021],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99761486,0.00032964797,0.00028346264,0.0010909422,0.0003089245,0.0003721412],"domain_scores_gemma":[0.99678147,0.00011438293,0.00016153764,0.0023525287,0.00039545808,0.00019461408],"candidate_categories":["sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science","insufficient_payload"],"category_scores_codex":[0.0008186787,0.00019009518,0.0003130693,0.00043465008,0.0014305363,0.0012577727,0.005569025,0.00016787738,0.0045449804],"category_scores_gemma":[0.0019198853,0.00017263013,0.00005844933,0.0011530526,0.00017962801,0.00040371082,0.012134841,0.0003189249,0.0020256361],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006421913,0.00007629161,6.470038e-8,0.000059850146,0.00006825493,0.000042825213,0.000015291105,6.193403e-7,0.0000050632457,0.0016882605,0.96155417,0.03648291],"study_design_scores_gemma":[0.00023783847,0.00014351982,0.000012108788,0.000015409305,0.00005497816,0.00015530796,0.000020909647,0.00046918454,0.0000036780111,0.0005532038,0.9981281,0.00020577443],"about_ca_topic_score_codex":0.000038791968,"about_ca_topic_score_gemma":0.0000021057988,"teacher_disagreement_score":0.037556272,"about_ca_system_score_codex":0.000044290544,"about_ca_system_score_gemma":0.000007792923,"threshold_uncertainty_score":0.99986947},"labels":[],"label_agreement":null},{"id":"W4393881506","doi":"10.5281/zenodo.5146062","title":"Data and Weights for Reverse Homology","year":2022,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Homology (biology); Computational biology; Computer science; Biology; Combinatorics; Mathematics; Evolutionary biology; Genetics; Gene","score_opus":0.062103361184606555,"score_gpt":0.27551178993116765,"score_spread":0.2134084287465611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393881506","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005859371,0.0002338509,0.019810896,0.0012979566,0.00017384098,0.00030936077,0.97712606,0.00024917725,0.0007929792],"genre_scores_gemma":[0.000015201484,0.0006665368,0.0014776026,0.0003687261,0.000108566564,9.5016354e-8,0.996595,0.00021042067,0.00055780663],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997538,0.00038270786,0.00027905562,0.0010537859,0.0003710968,0.00037538048],"domain_scores_gemma":[0.9970822,0.000120376375,0.00018275832,0.0022297318,0.00020854245,0.00017641058],"candidate_categories":["sts","open_science","insufficient_payload"],"consensus_categories":["open_science","insufficient_payload"],"category_scores_codex":[0.0010718111,0.00018536136,0.00028285422,0.0005686495,0.0023281968,0.0008919316,0.007314504,0.00011478321,0.053044394],"category_scores_gemma":[0.0013622933,0.00017245467,0.000055185592,0.0011878692,0.00017227861,0.00039543692,0.017445453,0.00039278215,0.0012913601],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011090986,0.00008053319,6.2184e-8,0.000044171335,0.000060207243,0.000027543665,0.000022043447,0.0000014573448,0.000002257614,0.0024868879,0.9635842,0.03367957],"study_design_scores_gemma":[0.00024990618,0.00026415405,0.0000093823155,0.0000047701815,0.000050075247,0.00013005079,0.000024576853,0.00043535288,9.5271e-7,0.00077265134,0.99785143,0.0002067197],"about_ca_topic_score_codex":0.0000560851,"about_ca_topic_score_gemma":0.0000013750843,"teacher_disagreement_score":0.051753033,"about_ca_system_score_codex":0.000065599284,"about_ca_system_score_gemma":0.000006197621,"threshold_uncertainty_score":0.99948627},"labels":[],"label_agreement":null},{"id":"W4393889680","doi":"10.5281/zenodo.5146063","title":"Data and Weights for Reverse Homology","year":2021,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Homology (biology); Computational biology; Computer science; Biology; Genetics; Gene","score_opus":0.06337598371883695,"score_gpt":0.2774712107476321,"score_spread":0.21409522702879513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393889680","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006963363,0.00040225504,0.04005723,0.0013766544,0.0001576546,0.00023082644,0.9568347,0.00019979701,0.0007339478],"genre_scores_gemma":[0.000017059114,0.00099764,0.00335978,0.00035866786,0.00016616558,4.5266866e-8,0.99439096,0.00019179643,0.0005179021],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99761486,0.00032964797,0.00028346264,0.0010909422,0.0003089245,0.0003721412],"domain_scores_gemma":[0.99678147,0.00011438293,0.00016153764,0.0023525287,0.00039545808,0.00019461408],"candidate_categories":["sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science","insufficient_payload"],"category_scores_codex":[0.0008186787,0.00019009518,0.0003130693,0.00043465008,0.0014305363,0.0012577727,0.005569025,0.00016787738,0.0045449804],"category_scores_gemma":[0.0019198853,0.00017263013,0.00005844933,0.0011530526,0.00017962801,0.00040371082,0.012134841,0.0003189249,0.0020256361],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006421913,0.00007629161,6.470038e-8,0.000059850146,0.00006825493,0.000042825213,0.000015291105,6.193403e-7,0.0000050632457,0.0016882605,0.96155417,0.03648291],"study_design_scores_gemma":[0.00023783847,0.00014351982,0.000012108788,0.000015409305,0.00005497816,0.00015530796,0.000020909647,0.00046918454,0.0000036780111,0.0005532038,0.9981281,0.00020577443],"about_ca_topic_score_codex":0.000038791968,"about_ca_topic_score_gemma":0.0000021057988,"teacher_disagreement_score":0.037556272,"about_ca_system_score_codex":0.000044290544,"about_ca_system_score_gemma":0.000007792923,"threshold_uncertainty_score":0.99986947},"labels":[],"label_agreement":null},{"id":"W4393889879","doi":"10.5281/zenodo.6250665","title":"Data and Weights for Reverse Homology","year":2021,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Homology (biology); Computational biology; Computer science; Biology; Evolutionary biology; Genetics; Gene","score_opus":0.06337598371883695,"score_gpt":0.2774712107476321,"score_spread":0.21409522702879513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393889879","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006963363,0.00040225504,0.04005723,0.0013766544,0.0001576546,0.00023082644,0.9568347,0.00019979701,0.0007339478],"genre_scores_gemma":[0.000017059114,0.00099764,0.00335978,0.00035866786,0.00016616558,4.5266866e-8,0.99439096,0.00019179643,0.0005179021],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99761486,0.00032964797,0.00028346264,0.0010909422,0.0003089245,0.0003721412],"domain_scores_gemma":[0.99678147,0.00011438293,0.00016153764,0.0023525287,0.00039545808,0.00019461408],"candidate_categories":["sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science","insufficient_payload"],"category_scores_codex":[0.0008186787,0.00019009518,0.0003130693,0.00043465008,0.0014305363,0.0012577727,0.005569025,0.00016787738,0.0045449804],"category_scores_gemma":[0.0019198853,0.00017263013,0.00005844933,0.0011530526,0.00017962801,0.00040371082,0.012134841,0.0003189249,0.0020256361],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006421913,0.00007629161,6.470038e-8,0.000059850146,0.00006825493,0.000042825213,0.000015291105,6.193403e-7,0.0000050632457,0.0016882605,0.96155417,0.03648291],"study_design_scores_gemma":[0.00023783847,0.00014351982,0.000012108788,0.000015409305,0.00005497816,0.00015530796,0.000020909647,0.00046918454,0.0000036780111,0.0005532038,0.9981281,0.00020577443],"about_ca_topic_score_codex":0.000038791968,"about_ca_topic_score_gemma":0.0000021057988,"teacher_disagreement_score":0.037556272,"about_ca_system_score_codex":0.000044290544,"about_ca_system_score_gemma":0.000007792923,"threshold_uncertainty_score":0.99986947},"labels":[],"label_agreement":null},{"id":"W4394026521","doi":"10.5281/zenodo.4628539","title":"Gradient tables","year":2021,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Mathematics","score_opus":0.03592391610423937,"score_gpt":0.24512046197338097,"score_spread":0.2091965458691416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394026521","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008353563,0.00041730693,0.017066902,0.0008261732,0.00023436958,0.00015153791,0.9759704,0.0004599099,0.0048650713],"genre_scores_gemma":[0.00006796949,0.000712478,0.0006602353,0.0002845728,0.00015523832,2.6362633e-8,0.99718267,0.00025926132,0.000677546],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99735385,0.0003996695,0.00031571314,0.00084886985,0.0006136404,0.00046825464],"domain_scores_gemma":[0.99745876,0.000045208144,0.00017043945,0.0015701845,0.0005049208,0.0002505136],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006175569,0.00022243123,0.0003066913,0.00058209547,0.0017294863,0.0023540906,0.004709833,0.00014667296,0.025059422],"category_scores_gemma":[0.001119817,0.00020329632,0.00012936543,0.0025815112,0.00012954962,0.00031633105,0.006495187,0.0004512499,0.014850126],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002374995,0.00013726181,4.4623572e-8,0.000034825323,0.000060667986,0.00008167341,0.000022770577,0.000010625021,0.000009291997,0.0019114065,0.95873666,0.0389924],"study_design_scores_gemma":[0.00013039395,0.00011040572,0.000016762206,0.000020757634,0.000029761179,0.00010376739,0.000025799047,0.000110878136,0.00001514686,0.00024644713,0.9989494,0.00024045237],"about_ca_topic_score_codex":0.00009541703,"about_ca_topic_score_gemma":0.0000013442001,"teacher_disagreement_score":0.04021277,"about_ca_system_score_codex":0.00011534213,"about_ca_system_score_gemma":0.0000062956246,"threshold_uncertainty_score":0.99957013},"labels":[],"label_agreement":null},{"id":"W4394045256","doi":"10.5281/zenodo.6250565","title":"Data and Weights for Reverse Homology","year":2021,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Homology (biology); Computer science; Computational biology; Biology; Genetics; Gene","score_opus":0.06337598371883695,"score_gpt":0.2774712107476321,"score_spread":0.21409522702879513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394045256","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006963363,0.00040225504,0.04005723,0.0013766544,0.0001576546,0.00023082644,0.9568347,0.00019979701,0.0007339478],"genre_scores_gemma":[0.000017059114,0.00099764,0.00335978,0.00035866786,0.00016616558,4.5266866e-8,0.99439096,0.00019179643,0.0005179021],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99761486,0.00032964797,0.00028346264,0.0010909422,0.0003089245,0.0003721412],"domain_scores_gemma":[0.99678147,0.00011438293,0.00016153764,0.0023525287,0.00039545808,0.00019461408],"candidate_categories":["sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science","insufficient_payload"],"category_scores_codex":[0.0008186787,0.00019009518,0.0003130693,0.00043465008,0.0014305363,0.0012577727,0.005569025,0.00016787738,0.0045449804],"category_scores_gemma":[0.0019198853,0.00017263013,0.00005844933,0.0011530526,0.00017962801,0.00040371082,0.012134841,0.0003189249,0.0020256361],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006421913,0.00007629161,6.470038e-8,0.000059850146,0.00006825493,0.000042825213,0.000015291105,6.193403e-7,0.0000050632457,0.0016882605,0.96155417,0.03648291],"study_design_scores_gemma":[0.00023783847,0.00014351982,0.000012108788,0.000015409305,0.00005497816,0.00015530796,0.000020909647,0.00046918454,0.0000036780111,0.0005532038,0.9981281,0.00020577443],"about_ca_topic_score_codex":0.000038791968,"about_ca_topic_score_gemma":0.0000021057988,"teacher_disagreement_score":0.037556272,"about_ca_system_score_codex":0.000044290544,"about_ca_system_score_gemma":0.000007792923,"threshold_uncertainty_score":0.99986947},"labels":[],"label_agreement":null},{"id":"W4396954601","doi":"10.1007/s41468-024-00176-7","title":"Multiparameter discrete Morse theory","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Computational Topology","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bishop's University; Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Morse code; Discrete Morse theory; Mathematics; Computer science; Mathematical economics","score_opus":0.010504898243902978,"score_gpt":0.2619581483245136,"score_spread":0.2514532500806106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396954601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026025584,0.0009834376,0.9681044,0.0030151592,0.00030414652,0.000032081127,0.000004962235,0.000030553056,0.0014996373],"genre_scores_gemma":[0.9442537,0.00004427398,0.054692034,0.00076995784,0.00013145378,0.000001355006,0.000003173389,0.0000029194696,0.00010112069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991737,0.000041092233,0.00029486732,0.0001812573,0.0001810282,0.00012808286],"domain_scores_gemma":[0.99901724,0.00067115726,0.0000844793,0.00008812364,0.000055083805,0.00008391126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041411075,0.00008645661,0.00019970657,0.00030898792,0.00005809302,0.000119233926,0.00031243436,0.000051248782,0.000058266316],"category_scores_gemma":[0.000032425538,0.00005653336,0.00008865165,0.0004164442,0.00013031898,0.00018683399,0.00012926338,0.00017681494,0.000030462961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019588237,0.000022148164,0.000021361931,0.000005997707,0.00009204566,0.000060933653,0.00015225472,0.0033700608,0.000030392013,0.92848474,0.00052769645,0.06721277],"study_design_scores_gemma":[0.00020385579,0.00012844412,0.0014734309,0.000006682619,0.00003231106,0.00028210753,0.000057674177,0.04458809,0.000029733656,0.9418711,0.011232215,0.000094339244],"about_ca_topic_score_codex":0.0000018248959,"about_ca_topic_score_gemma":2.226474e-7,"teacher_disagreement_score":0.91822815,"about_ca_system_score_codex":0.00001171891,"about_ca_system_score_gemma":0.000040508974,"threshold_uncertainty_score":0.23053636},"labels":[],"label_agreement":null},{"id":"W4399332322","doi":"10.1016/j.neunet.2024.106420","title":"Capacity bounds for hyperbolic neural network representations of latent tree structures","year":2024,"lang":"en","type":"article","venue":"Neural Networks","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; Vector Institute","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Embedding; Mathematics; Representation (politics); Tree (set theory); Distortion (music); Euclidean space; Curvature; Dimension (graph theory); Artificial neural network; Upper and lower bounds; Activation function; Hyperbolic tree; Function (biology); Graph; Perceptron; Euclidean geometry; Discrete mathematics; Algorithm; Combinatorics; Computer science; Hyperbolic geometry; Pure mathematics; Artificial intelligence; Differential geometry; Mathematical analysis; Geometry","score_opus":0.03486758422580956,"score_gpt":0.2775667507472389,"score_spread":0.24269916652142937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399332322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2215915,0.005618435,0.7623491,0.0048572985,0.0038699436,0.0005014846,0.0000739708,0.00054311816,0.0005951194],"genre_scores_gemma":[0.99293345,0.000050060993,0.005772823,0.00032380517,0.00064177415,0.00002329961,0.000038824575,0.000008508139,0.00020743132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984814,0.00007116905,0.0003403987,0.00048023846,0.00021761157,0.00040917154],"domain_scores_gemma":[0.9987961,0.00045829226,0.00007834143,0.0004943179,0.000065842105,0.00010711512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001774521,0.00016040554,0.00027771754,0.00013553095,0.00015675373,0.00024259738,0.00071840663,0.000096143594,0.00003435226],"category_scores_gemma":[0.000062456136,0.00011627798,0.00026965444,0.0018205219,0.00010574573,0.00033522138,0.000228315,0.00021728923,0.0000024578628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018681954,0.000039907103,0.0046297084,0.000030394975,0.0001425063,0.00002129348,0.000092531336,0.58210355,0.00005039012,0.11364431,0.021684762,0.277542],"study_design_scores_gemma":[0.00011299411,0.00010355892,0.023522075,0.0000065360687,0.00004953391,0.00001497705,0.0000027503327,0.9551882,0.000022585875,0.018041136,0.0028045017,0.00013115903],"about_ca_topic_score_codex":0.00010438485,"about_ca_topic_score_gemma":0.000060907074,"teacher_disagreement_score":0.771342,"about_ca_system_score_codex":0.00001551737,"about_ca_system_score_gemma":0.000012710244,"threshold_uncertainty_score":0.47416785},"labels":[],"label_agreement":null},{"id":"W4400006081","doi":"10.1007/s41468-024-00181-w","title":"From finite vector field data to combinatorial dynamical systems in the sense of Forman","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Computational Topology","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Institut des Sciences Mathématiques, Université du Québec à Montréal","keywords":"Sense (electronics); Field (mathematics); Computer science; Mathematics; Theoretical computer science; Algebra over a field; Pure mathematics; Engineering","score_opus":0.024852186449293052,"score_gpt":0.28573100886826575,"score_spread":0.2608788224189727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400006081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31456476,0.000721971,0.6702715,0.01158646,0.0018734839,0.00014819112,0.000115501396,0.000016471447,0.0007016115],"genre_scores_gemma":[0.995077,0.000014827584,0.0042501823,0.00039339668,0.00024003738,0.000001129948,0.000019401514,0.0000014897182,0.0000025173442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990823,0.000056872013,0.0003681606,0.00016298541,0.0002335052,0.00009615103],"domain_scores_gemma":[0.99778026,0.0018615526,0.000088341425,0.00018140055,0.00004335011,0.000045085468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004694115,0.000064322936,0.00021711117,0.00024156287,0.000028617626,0.000081492,0.00062744593,0.00005303067,0.000010060756],"category_scores_gemma":[0.00007173126,0.00003929185,0.000033454195,0.0005515513,0.000041134477,0.00012514165,0.00024956837,0.0001771553,0.0000045061643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007794707,0.00009936871,0.000074954936,0.000017643333,0.000096832526,0.00011911736,0.0008386452,0.010551455,0.000047960522,0.9709216,0.002492334,0.014662136],"study_design_scores_gemma":[0.0007500255,0.000653248,0.0054654563,0.00004246639,0.000058872065,0.00018414168,0.00059938146,0.5879152,0.000018865654,0.3882727,0.015872631,0.0001669884],"about_ca_topic_score_codex":0.00010674951,"about_ca_topic_score_gemma":0.0000057024877,"teacher_disagreement_score":0.68051225,"about_ca_system_score_codex":0.000009970653,"about_ca_system_score_gemma":0.00004442187,"threshold_uncertainty_score":0.1602275},"labels":[],"label_agreement":null},{"id":"W4400454076","doi":"10.1117/1.jmi.11.4.044002","title":"Projected pooling loss for red nucleus segmentation with soft topology constraints","year":2024,"lang":"en","type":"article","venue":"Journal of Medical Imaging","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Montreal Neurological Institute and Hospital","funders":"Chinese Government Scholarship; Assistance publique-Hôpitaux de Paris; Agence Nationale de la Recherche; Association France Parkinson; European Commission; China Scholarship Council; EU Joint Programme – Neurodegenerative Disease Research; Biogen; Yale University","keywords":"Medicine; Pooling; Segmentation; Topology (electrical circuits); Nucleus; Artificial intelligence; Combinatorics","score_opus":0.01518282694581315,"score_gpt":0.3083966653326332,"score_spread":0.2932138383868201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400454076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060683666,0.0004833309,0.9611319,0.03164645,0.00045975103,0.000062895,0.000004165536,0.000045996167,0.00009716832],"genre_scores_gemma":[0.93979686,0.00007793158,0.05868536,0.0010091348,0.00036222427,0.0000034080501,0.0000045522324,0.0000066921407,0.00005385632],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984868,0.00005552871,0.00038678796,0.00018999103,0.0006586181,0.00022224616],"domain_scores_gemma":[0.9989917,0.00042187193,0.00014651337,0.000105395906,0.0001591235,0.00017538841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010587402,0.00008659382,0.00021581067,0.00034295942,0.00006709046,0.00019974436,0.00058009755,0.00004856293,0.00019753087],"category_scores_gemma":[0.00067641906,0.00005246645,0.00009742232,0.00074207626,0.00019902865,0.00047350224,0.00008963807,0.0002791006,0.00000484591],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002456528,0.00006216165,0.0007957108,0.000040680054,0.00015285147,0.0012939412,0.0002544512,0.000026070295,0.00027260504,0.0071061184,0.003913064,0.98605776],"study_design_scores_gemma":[0.0036229768,0.00057574257,0.0014088519,0.0008510546,0.00038076343,0.010939067,0.0012512119,0.9147089,0.0011048763,0.019097438,0.045524336,0.00053479424],"about_ca_topic_score_codex":0.000010193914,"about_ca_topic_score_gemma":0.0000016781817,"teacher_disagreement_score":0.985523,"about_ca_system_score_codex":0.000042180207,"about_ca_system_score_gemma":0.000228078,"threshold_uncertainty_score":0.21628246},"labels":[],"label_agreement":null},{"id":"W4400596966","doi":"10.55016/ojs/cdm.v16i3.72114","title":"On the homotopy type of complexes of graphs with bounded domination number","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Consejo Nacional de Ciencia y Tecnología","keywords":"Mathematics; Combinatorics; Homotopy; Bounded function; Type (biology); Assertion; Discrete mathematics; Pure mathematics; Computer science","score_opus":0.020209359730731957,"score_gpt":0.29798672960534367,"score_spread":0.2777773698746117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16023023,0.000040762778,0.833725,0.0030802286,0.00003853326,0.00019023113,0.0002318225,0.00002602369,0.002437183],"genre_scores_gemma":[0.9722272,0.000008085654,0.027432352,0.00009350351,0.000005158997,0.000010268514,0.000029351322,0.0000027611422,0.00019129108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910426,0.000060996692,0.000265349,0.00015491419,0.00028020085,0.00013428698],"domain_scores_gemma":[0.99794126,0.00063272234,0.00014958184,0.0006141597,0.000614705,0.000047571713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026762212,0.0000859332,0.00024746676,0.00008389311,0.00010677125,0.000052832373,0.00044095,0.000031322168,0.00016146102],"category_scores_gemma":[0.001126997,0.000047826903,0.000080223974,0.002158475,0.00011084911,0.0000773667,0.00015549963,0.00006175521,0.000032944426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046717123,0.00013028743,0.000079457954,0.000011908808,0.00005562084,0.000001913478,0.00014253703,0.000033030687,0.00050906284,0.9982888,0.0005387425,0.0002039341],"study_design_scores_gemma":[0.00064198015,0.00037937966,0.0031676607,0.0001459813,0.00016720456,0.000023995404,0.00041483724,0.008849465,0.04241535,0.94169205,0.0018301008,0.00027198723],"about_ca_topic_score_codex":0.000010392064,"about_ca_topic_score_gemma":0.000011137607,"teacher_disagreement_score":0.811997,"about_ca_system_score_codex":0.000018388202,"about_ca_system_score_gemma":0.000048555117,"threshold_uncertainty_score":0.19503245},"labels":[],"label_agreement":null},{"id":"W4401631702","doi":"10.22215/etd/2024-16106","title":"Efficient Computations of Interesting Paths","year":2024,"lang":"en","type":"dissertation","venue":"","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Heuristics; Completeness (order theory); Computer science; Computation; Algorithm; Approximation algorithm; Class (philosophy); Directed acyclic graph; Theoretical computer science; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.0200865792474819,"score_gpt":0.29073208109991333,"score_spread":0.2706455018524314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401631702","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11033324,0.0016151019,0.7927567,0.00033827295,0.002187755,0.00019034468,0.00004875882,0.0004526132,0.092077225],"genre_scores_gemma":[0.9643816,0.000009429524,0.023918176,0.000036716225,0.000033487373,0.000006467487,0.00029967414,0.0000066346365,0.01130783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989309,0.000021662116,0.00033009853,0.00034510437,0.00024872195,0.00012352834],"domain_scores_gemma":[0.9992453,0.00016920097,0.00012661073,0.00029730904,0.00011720106,0.0000443786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013431914,0.00012112873,0.0002339105,0.00052734313,0.000038093454,0.00009318862,0.00067743164,0.000085303254,0.0001093627],"category_scores_gemma":[0.00012699339,0.00008630319,0.00015281956,0.0017567334,0.000015592972,0.000028944263,0.00015281381,0.00015313427,0.00017453813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052622145,0.0003243463,0.00006636459,0.0005412076,0.00031516975,0.00006164279,0.002734282,0.014216585,0.00018244724,0.67030764,0.0056609283,0.30558413],"study_design_scores_gemma":[0.00008286413,0.00009846193,0.0017032652,0.0002385181,0.00012864001,0.000004268815,0.00077102694,0.9802405,0.0004866741,0.014384249,0.001528024,0.00033347143],"about_ca_topic_score_codex":0.00011273314,"about_ca_topic_score_gemma":0.000041976913,"teacher_disagreement_score":0.9660239,"about_ca_system_score_codex":0.000014089569,"about_ca_system_score_gemma":0.000044772227,"threshold_uncertainty_score":0.3519342},"labels":[],"label_agreement":null},{"id":"W4401754044","doi":"10.1109/ichi61247.2024.00073","title":"A Topological Data Analysis of Un met Health Care Needs Among Injured Patients","year":2024,"lang":"en","type":"article","venue":"","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Topological data analysis; Health care; Computer science; Topology (electrical circuits); Business; Medicine; Political science; Mathematics; Combinatorics","score_opus":0.02814135079369484,"score_gpt":0.3056940308985888,"score_spread":0.277552680104894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401754044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28670555,0.003994315,0.6995259,0.0032414054,0.00047940557,0.0002865221,0.0015424356,0.00061418326,0.0036102799],"genre_scores_gemma":[0.9837531,0.000051605337,0.014756376,0.00041032897,0.000015948895,0.0000029702517,0.00085319695,0.0000026082248,0.00015388278],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9981337,0.00012795246,0.00043305318,0.00061764603,0.0004155217,0.00027207998],"domain_scores_gemma":[0.9980427,0.00018176096,0.00008856554,0.001450268,0.000085333,0.00015134325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039585278,0.00013281628,0.00050000113,0.0014425474,0.00007317012,0.00014214909,0.002133801,0.000070728,0.0005856664],"category_scores_gemma":[0.0001518509,0.00008271232,0.00019947723,0.014046352,0.000091748414,0.0004764461,0.0016322882,0.00011966984,0.000021205493],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007296331,0.00034562493,0.11658777,0.000052016218,0.0033213203,0.000018097262,0.001649499,0.0001288779,0.0000020108478,0.14977485,0.00651102,0.7216016],"study_design_scores_gemma":[0.0004930086,0.0013895651,0.8108854,0.000026505133,0.0023557292,0.0000012349395,0.0014628059,0.15481804,0.00011077258,0.0044075227,0.02328465,0.0007647141],"about_ca_topic_score_codex":0.0011049592,"about_ca_topic_score_gemma":0.00016935455,"teacher_disagreement_score":0.7208369,"about_ca_system_score_codex":0.000036134832,"about_ca_system_score_gemma":0.00004852994,"threshold_uncertainty_score":0.6748807},"labels":[],"label_agreement":null},{"id":"W4401852840","doi":"10.1016/j.geomphys.2024.105306","title":"Topological recursion on transalgebraic spectral curves and Atlantes Hurwitz numbers","year":2024,"lang":"en","type":"article","venue":"Journal of Geometry and Physics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta; Pacific Institute for the Mathematical Sciences","keywords":"Mathematics; Recursion (computer science); Pure mathematics; Topology (electrical circuits); Combinatorics; Algorithm","score_opus":0.013745615953584136,"score_gpt":0.2552712664707454,"score_spread":0.24152565051716124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401852840","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.826822,0.01842817,0.14363,0.009432813,0.0005595793,0.00006373264,0.00002304373,0.000057542537,0.0009831355],"genre_scores_gemma":[0.9920161,0.0051769875,0.0019022754,0.00046043328,0.00025532258,3.3156002e-7,0.0000018103964,0.000003138496,0.00018365117],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990637,0.000059699178,0.00023480586,0.00021020186,0.00026554565,0.00016608687],"domain_scores_gemma":[0.99925244,0.00038379474,0.000079261285,0.00011903351,0.000035878566,0.00012956542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038574383,0.000119019445,0.00026534643,0.00015201444,0.00007557875,0.00015912698,0.0002707713,0.00005347909,0.00005282891],"category_scores_gemma":[0.000067014436,0.000072992596,0.00012858385,0.0011998272,0.000096227726,0.000441756,0.0000589774,0.0003201328,0.000007224048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009450724,0.0004376039,0.0052221417,0.00044898884,0.00040723686,0.00059143687,0.0005105689,0.000067560264,0.0004770997,0.40511987,0.008082771,0.5785402],"study_design_scores_gemma":[0.0015707632,0.008217318,0.07838464,0.002038477,0.0004958172,0.002097028,0.00036406273,0.009764371,0.004614162,0.8226494,0.0684414,0.0013625624],"about_ca_topic_score_codex":0.0000059932204,"about_ca_topic_score_gemma":4.7759835e-7,"teacher_disagreement_score":0.57717764,"about_ca_system_score_codex":0.000010954223,"about_ca_system_score_gemma":0.000017079634,"threshold_uncertainty_score":0.29765517},"labels":[],"label_agreement":null},{"id":"W4402578255","doi":"10.4171/jems/1521","title":"Coarse nodal count and topological persistence","year":2024,"lang":"en","type":"article","venue":"Journal of the European Mathematical Society","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; McGill University","funders":"","keywords":"Mathematics; Persistence (discontinuity); Topology (electrical circuits); Pure mathematics; Combinatorics","score_opus":0.027975274834260253,"score_gpt":0.24119365347790575,"score_spread":0.2132183786436455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402578255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12189766,0.0032357117,0.82014203,0.03314687,0.00090257224,0.0001319669,0.000010316039,0.00013605384,0.020396832],"genre_scores_gemma":[0.9530926,0.00016657439,0.04465871,0.00086440577,0.00022865436,2.826795e-7,1.2469309e-7,0.0000065484405,0.0009821353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987467,0.00020622046,0.00033602893,0.00016229173,0.0003871713,0.00016161246],"domain_scores_gemma":[0.9991069,0.00036150694,0.00010556622,0.00025326523,0.000058559803,0.00011423283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017731481,0.000097851764,0.00019870803,0.000027524415,0.00012524994,0.00030491492,0.0010198824,0.00003281922,0.00007694763],"category_scores_gemma":[0.00032403274,0.000043986387,0.00044156323,0.00050326437,0.00023572086,0.00023468031,0.0006029732,0.00033775484,0.00006801032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001092908,0.0005993502,0.00058401475,0.00034245595,0.00082327944,0.00068684114,0.006460827,0.00009759065,0.0010902657,0.830288,0.07273372,0.086282745],"study_design_scores_gemma":[0.0011496159,0.0009623809,0.01897495,0.0008175912,0.0008125756,0.006305173,0.0025222045,0.22352065,0.0002886636,0.6100586,0.13353677,0.0010508266],"about_ca_topic_score_codex":4.70354e-7,"about_ca_topic_score_gemma":5.314782e-8,"teacher_disagreement_score":0.8311949,"about_ca_system_score_codex":0.000030287552,"about_ca_system_score_gemma":0.000021111498,"threshold_uncertainty_score":0.29403016},"labels":[],"label_agreement":null},{"id":"W4402905630","doi":"10.1167/jov.24.10.1366","title":"The mechanisms of crossed and uncrossed disparities in coarse stereopsis","year":2024,"lang":"en","type":"article","venue":"Journal of Vision","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Stereopsis; Psychology; Computer science; Artificial intelligence","score_opus":0.011919047901238615,"score_gpt":0.28297427607738296,"score_spread":0.27105522817614436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402905630","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65858984,0.0071233492,0.32756415,0.0059516877,0.0005681155,0.000059221093,0.000009419012,0.000016944761,0.000117262294],"genre_scores_gemma":[0.9959862,0.0004893765,0.0032930984,0.00005097044,0.000016141375,2.825076e-7,1.9491218e-7,0.0000015348985,0.00016219592],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916416,0.00005133918,0.00033293455,0.00009427005,0.00025777335,0.00009954704],"domain_scores_gemma":[0.9992244,0.00042869477,0.000111929614,0.00013806304,0.000056255893,0.000040627732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000895834,0.000052691394,0.00015970199,0.00021117587,0.000060425577,0.0003304202,0.00038707058,0.00003110466,0.000005779099],"category_scores_gemma":[0.0001280583,0.000026177499,0.00007182009,0.00069247425,0.00007304655,0.00037084048,0.00016103483,0.00012224294,0.0000014711192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012549009,0.00029807808,0.0032225957,0.000100877936,0.00018485662,0.0004418139,0.0010869611,0.00026760617,0.020816233,0.30564097,0.0047503654,0.6630641],"study_design_scores_gemma":[0.0017614743,0.0027494393,0.18739158,0.0005844197,0.000108615204,0.00029660837,0.00076337,0.18775512,0.012758533,0.58699185,0.01841592,0.00042308457],"about_ca_topic_score_codex":0.0000370775,"about_ca_topic_score_gemma":0.000013458481,"teacher_disagreement_score":0.66264105,"about_ca_system_score_codex":0.000012453478,"about_ca_system_score_gemma":0.000024957779,"threshold_uncertainty_score":0.31862497},"labels":[],"label_agreement":null},{"id":"W4402919518","doi":"10.1016/j.aam.2024.102787","title":"A topological approach to mapping space signatures","year":2024,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Office of Naval Research; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Topological space; Topology (electrical circuits); Space (punctuation); Pure mathematics; Combinatorics; Computer science","score_opus":0.019086095157435486,"score_gpt":0.27338754682010463,"score_spread":0.25430145166266915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402919518","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005688077,0.0023066602,0.9055894,0.0004709854,0.000107847016,0.00017862179,0.000003009684,0.0002459253,0.090528734],"genre_scores_gemma":[0.3683295,0.000108262815,0.631041,0.00022870665,0.000039360897,0.00006087088,0.0000025643462,0.0000052318114,0.00018453595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986175,0.000012024917,0.0002736754,0.0005037235,0.00027697627,0.00031613055],"domain_scores_gemma":[0.9989771,0.00045493167,0.000036089932,0.00043227864,0.000010944694,0.000088611414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003398287,0.00016042298,0.00027741547,0.00038318706,0.00004801398,0.00017097889,0.00091493863,0.00008155708,0.000019007084],"category_scores_gemma":[0.00013369914,0.00011100181,0.00006094269,0.0027695093,0.00005299809,0.00021920819,0.00042029945,0.00022375066,0.00015324532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.738367e-7,0.00010086255,0.0000063582866,0.00009561637,0.0000068054487,0.000012879223,0.00049265014,0.0013642879,0.00009301067,0.96631193,0.00021978348,0.031295042],"study_design_scores_gemma":[0.00009909555,0.000036934107,0.00006024116,0.000052425854,0.000009298687,0.000012175382,0.0005260251,0.066024296,0.00024634055,0.8532012,0.0793895,0.00034247362],"about_ca_topic_score_codex":0.0000017943256,"about_ca_topic_score_gemma":0.0000016700133,"teacher_disagreement_score":0.3677607,"about_ca_system_score_codex":0.00003734109,"about_ca_system_score_gemma":0.000012712911,"threshold_uncertainty_score":0.45265225},"labels":[],"label_agreement":null},{"id":"W4403349328","doi":"10.1007/s00220-024-05140-1","title":"The Spin-Statistics Theorem for Topological Quantum Field Theories","year":2024,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Atlantic Association for Research in the Mathematical Sciences; Simons Foundation","keywords":"Complex system; Quantum no-deleting theorem; Quantum; Spin (aerodynamics); Field (mathematics); Mathematics; Physics; Theoretical physics; Quantum mechanics; Pure mathematics; Quantum discord; Quantum entanglement; Computer science","score_opus":0.05439118232417729,"score_gpt":0.36503600163259126,"score_spread":0.310644819308414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403349328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007353488,0.0010050691,0.98066187,0.0133059425,0.00010374902,0.0001793419,0.000027430726,0.000114153954,0.004528927],"genre_scores_gemma":[0.7229769,0.0006817678,0.27507988,0.0005139985,0.00007513853,0.00021419178,0.000025671678,0.000009882339,0.0004225399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989247,0.00013340381,0.00033607017,0.00021671131,0.00015467367,0.0002344528],"domain_scores_gemma":[0.98620313,0.011826124,0.00004282009,0.0018122005,0.00006397679,0.00005177303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007766033,0.00011287653,0.00018460437,0.000049293558,0.00035455832,0.00038832927,0.002802764,0.000059904884,0.000024303703],"category_scores_gemma":[0.0019691663,0.000063739266,0.000105232815,0.000911146,0.00042155842,0.00017104906,0.0008755198,0.00026890647,0.00009030816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016086229,0.00008665514,0.000004862634,0.000018273824,0.00001701055,9.3900854e-7,0.00014857725,0.0000060928414,0.000003087323,0.93592125,0.0012697112,0.062521935],"study_design_scores_gemma":[0.000034025965,0.00004205573,0.000014954943,0.00001777725,0.000011441325,0.0000014691038,0.00007314588,0.21831688,0.00002665766,0.7699167,0.011471662,0.000073230505],"about_ca_topic_score_codex":0.0000035815262,"about_ca_topic_score_gemma":0.0000052428427,"teacher_disagreement_score":0.7229034,"about_ca_system_score_codex":0.000024807887,"about_ca_system_score_gemma":0.000039010283,"threshold_uncertainty_score":0.52082795},"labels":[],"label_agreement":null},{"id":"W4403578252","doi":"10.48550/arxiv.2410.12516","title":"Deformation Quantization via Categorical Factorization Homology","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Colleges and Universities; Institut Périmètre de physique théorique; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Deutsche Forschungsgemeinschaft; European Commission; Government of Canada","keywords":"Factorization; Categorical variable; Homology (biology); Deformation (meteorology); Quantization (signal processing); Mathematics; Computer science; Pure mathematics; Computational biology; Physics; Genetics; Biology; Algorithm; Gene","score_opus":0.06334213142545342,"score_gpt":0.19098453100618948,"score_spread":0.12764239958073606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403578252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033662308,0.000085625805,0.9638369,0.00025037333,0.00087923976,0.000121288795,0.000017961343,0.000340625,0.00080569176],"genre_scores_gemma":[0.998094,0.00015255448,0.0006556258,0.00005610469,0.00007265369,7.805672e-7,0.00028473025,0.000007257268,0.0006762723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998453,0.00012813207,0.0002326553,0.00083641376,0.00010444671,0.0002453213],"domain_scores_gemma":[0.99880254,0.000072768235,0.00018431958,0.0006856835,0.00014565434,0.00010905961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018254976,0.00021823174,0.00026884055,0.0007074262,0.000114719696,0.00016734703,0.0010973236,0.00036467006,0.000057233272],"category_scores_gemma":[0.000058475987,0.00020530973,0.0001742952,0.0025011788,0.00005976701,0.00038510715,0.002061302,0.00045215822,0.0005109489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055645037,0.00007004777,0.0009996452,0.00005664329,0.000093958195,0.0001395078,0.00010855324,0.087500215,0.000016687725,0.9063404,0.00031826366,0.0043504788],"study_design_scores_gemma":[0.00007206608,0.00003331627,0.00088013697,0.0000064309465,0.00008145275,0.0000058825717,0.0000119595425,0.63597053,0.000034399338,0.3622314,0.00046332355,0.00020908132],"about_ca_topic_score_codex":0.00027859118,"about_ca_topic_score_gemma":0.00002736621,"teacher_disagreement_score":0.9644317,"about_ca_system_score_codex":0.00020275344,"about_ca_system_score_gemma":0.0000803395,"threshold_uncertainty_score":0.8372288},"labels":[],"label_agreement":null},{"id":"W4404310873","doi":"10.48550/arxiv.2410.19070","title":"The directed landscape seen from its trees","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Geography; Tree (set theory); Computer science; Mathematics; Combinatorics","score_opus":0.05380860263613948,"score_gpt":0.1810828611226944,"score_spread":0.1272742584865549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404310873","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7040255,0.010193048,0.23509336,0.005124775,0.004157035,0.00063758314,0.0010491706,0.003568587,0.036150962],"genre_scores_gemma":[0.9881389,0.0007817741,0.00024134133,0.00006531148,0.0001225717,8.2447144e-7,0.00006507677,0.000007918738,0.010576264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981745,0.00014264026,0.00017010732,0.0010812605,0.00012052969,0.00031097833],"domain_scores_gemma":[0.9979127,0.00047358623,0.00012441381,0.0012550298,0.00009424901,0.0001400082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019574094,0.0002513019,0.000295651,0.00026849686,0.00022880206,0.00042626553,0.003033069,0.00021977349,0.00012646265],"category_scores_gemma":[0.000101231395,0.00017371836,0.0002880946,0.002049449,0.00007843168,0.00014092913,0.0054237093,0.0006000071,0.00074564165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077077726,0.00030235894,0.0071514864,0.00006994079,0.0027949528,0.0036145444,0.0004825862,0.051825196,0.000038884456,0.8560269,0.038660914,0.038955145],"study_design_scores_gemma":[0.00020146806,0.000034153014,0.008584819,0.000042650994,0.00029927943,0.0000018817509,0.0000622523,0.72731215,0.00005172935,0.24343339,0.01948418,0.0004920695],"about_ca_topic_score_codex":0.0004402396,"about_ca_topic_score_gemma":0.00029731618,"teacher_disagreement_score":0.6754869,"about_ca_system_score_codex":0.000053802672,"about_ca_system_score_gemma":0.00007618733,"threshold_uncertainty_score":0.9583964},"labels":[],"label_agreement":null},{"id":"W4404413602","doi":"10.37236/12984","title":"Simplicial Complexes with Many Facets are Vertex Decomposable","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Banff International Research Station for Mathematical Innovation and Discovery; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Vertex (graph theory); Combinatorics; Simplicial complex; Mathematics; Graph","score_opus":0.007737977919089127,"score_gpt":0.2329950582611353,"score_spread":0.2252570803420462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404413602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14202233,0.015394278,0.8303815,0.010058448,0.00082571607,0.00012142576,0.000004582567,0.00011783706,0.001073879],"genre_scores_gemma":[0.99880606,0.00047089264,0.00011071493,0.00016827634,0.00007179957,0.0000013087247,8.698333e-7,0.0000081838825,0.00036188448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830455,0.00009934285,0.00032394187,0.00019048913,0.00054173474,0.000539936],"domain_scores_gemma":[0.99883467,0.00033893922,0.00020857659,0.0003623741,0.00016068324,0.000094753974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074873545,0.00015594953,0.00031618954,0.00024864747,0.00017976576,0.00031493756,0.0016859017,0.000046889032,0.000026582504],"category_scores_gemma":[0.00005051696,0.000080758226,0.00014962247,0.0020960195,0.00006927896,0.0004275248,0.00017994034,0.0006573856,0.000037129124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015881826,0.00008470086,0.00018372208,0.000007996558,0.000195073,0.000060382907,0.00006729774,0.000174206,0.000056583125,0.992248,0.0036757812,0.0032303862],"study_design_scores_gemma":[0.00047231378,0.0011163742,0.0015530154,0.000047223944,0.00012781977,0.0006722001,0.00007726498,0.008269916,0.0005136599,0.92474085,0.06219254,0.00021682399],"about_ca_topic_score_codex":0.000013485505,"about_ca_topic_score_gemma":0.000010078019,"teacher_disagreement_score":0.85678375,"about_ca_system_score_codex":0.00018374107,"about_ca_system_score_gemma":0.0002709933,"threshold_uncertainty_score":0.3293225},"labels":[],"label_agreement":null},{"id":"W4405030335","doi":"10.48550/arxiv.2411.19319","title":"Decomposing zero-dimensional persistent homology over rooted tree quivers","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Université de Sherbrooke; Centre de Recherches Mathématiques; Bishop's University","keywords":"Zero (linguistics); Persistent homology; Mathematics; Homology (biology); Tree (set theory); Combinatorics; Pure mathematics; Discrete mathematics; Biology; Genetics; Philosophy; Algorithm; Linguistics","score_opus":0.057274469660645304,"score_gpt":0.1973245956959598,"score_spread":0.1400501260353145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405030335","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7475921,0.0009733421,0.24362242,0.0007884536,0.0017338392,0.00023413636,0.00010368046,0.00056405604,0.0043879636],"genre_scores_gemma":[0.99386966,0.00007717776,0.00202183,0.0002250467,0.000060447062,6.0481443e-7,0.000071763025,0.0000133844205,0.0036600952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711853,0.00017288885,0.00026765282,0.0017458295,0.0001827503,0.0005123384],"domain_scores_gemma":[0.9980043,0.00020438775,0.00019040352,0.0012051556,0.00012634919,0.00026936262],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024198729,0.00040356052,0.00052706664,0.0009863119,0.00020918115,0.0001968418,0.0021374216,0.00041533104,0.00022083828],"category_scores_gemma":[0.00004582921,0.00039130315,0.0008081416,0.0020302988,0.00022207771,0.00021983856,0.006784254,0.0008578218,0.0004447985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009624279,0.000533868,0.0028682565,0.00014847475,0.0022508858,0.006223885,0.00027814225,0.52332026,0.00014582333,0.44080296,0.016242342,0.0070888475],"study_design_scores_gemma":[0.00061705546,0.00019085896,0.004045834,0.00010277539,0.00075468404,0.00004438443,0.00005665691,0.84602755,0.000041596468,0.14415069,0.0030017484,0.0009661487],"about_ca_topic_score_codex":0.0005381627,"about_ca_topic_score_gemma":0.00006178084,"teacher_disagreement_score":0.3227073,"about_ca_system_score_codex":0.0003342772,"about_ca_system_score_gemma":0.0001709113,"threshold_uncertainty_score":0.9998539},"labels":[],"label_agreement":null},{"id":"W4405266750","doi":"10.59254/sbpo-2024-193760","title":"Topological Analysis of Graphs for Comparing Sets of Time Series: A Case Study with Hospital Data","year":2024,"lang":"en","type":"article","venue":"Anais do Simpósio Brasileiro de Pesquisa Operacional","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Series (stratigraphy); Time series; Computer science; Topological data analysis; Topology (electrical circuits); Data mining; Theoretical computer science; Mathematics; Algorithm; Combinatorics; Machine learning","score_opus":0.040726476970636055,"score_gpt":0.3270858457740597,"score_spread":0.2863593688034236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405266750","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94670737,0.00040066845,0.051099315,0.000283085,0.00007324089,0.00036453156,0.0008974145,0.00009473604,0.00007964495],"genre_scores_gemma":[0.9858968,0.000022366852,0.01356867,0.000056429522,0.00003133677,0.000034634097,0.000321922,0.000011146549,0.00005665379],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712026,0.0001415905,0.0006671378,0.0010728964,0.00057802047,0.0004201093],"domain_scores_gemma":[0.9972443,0.00076184166,0.0001685885,0.0014009651,0.00023367835,0.00019061011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008973593,0.00029214213,0.0009171149,0.0010535999,0.0001729735,0.00022953989,0.0019012815,0.00010586348,0.00032687237],"category_scores_gemma":[0.00023077737,0.00019983317,0.0003150503,0.005276743,0.00027019792,0.00094498997,0.0011095534,0.00019388672,0.000008506769],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032963805,0.00458493,0.89786446,0.0001995056,0.013294141,0.0054553268,0.0048606005,0.008404927,0.00021340781,0.043232385,0.0027836405,0.018777033],"study_design_scores_gemma":[0.0015672815,0.0064699575,0.24900645,0.00008815836,0.0050842445,0.0010509907,0.0046653734,0.727616,0.00014577132,0.0019190713,0.0011983291,0.0011883676],"about_ca_topic_score_codex":0.0008303783,"about_ca_topic_score_gemma":0.00034121022,"teacher_disagreement_score":0.7192111,"about_ca_system_score_codex":0.00003678801,"about_ca_system_score_gemma":0.00013451908,"threshold_uncertainty_score":0.81489605},"labels":[],"label_agreement":null},{"id":"W4405470324","doi":"10.48550/arxiv.2412.11718","title":"On topological defects in Chern-Simons theory","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Science and Technology Facilities Council; Azrieli Foundation; Hrvatska Zaklada za Znanost","keywords":"Chern–Simons theory; Physics; Topology (electrical circuits); Mathematics; Theoretical physics; Mathematical physics; Combinatorics; Gauge theory","score_opus":0.06614652562316359,"score_gpt":0.19899368304232304,"score_spread":0.13284715741915945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405470324","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7586857,0.00038816946,0.21578653,0.00045315048,0.0006527056,0.00020395349,0.000040522486,0.00041578556,0.02337349],"genre_scores_gemma":[0.9964979,0.00014151368,0.00024003659,0.00023917375,0.000043361102,0.0000012452383,0.000011034109,0.000007649531,0.0028180568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975865,0.00029560825,0.00019233025,0.0014176106,0.000109719665,0.00039826464],"domain_scores_gemma":[0.9980065,0.00056288496,0.00009371409,0.0011414636,0.000037814916,0.00015758215],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004956442,0.00030159001,0.00040440608,0.00081142964,0.00007047299,0.00013615657,0.0021817654,0.00040503225,0.00022031875],"category_scores_gemma":[0.00023086919,0.0002544896,0.00032926849,0.002399227,0.00015664026,0.000106027765,0.0045142993,0.0011343404,0.0007905963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018773664,0.00014270455,0.0008518431,0.000019971243,0.000057662877,0.0014515001,0.000041767416,0.024686495,0.0000025587224,0.97115225,0.0002818952,0.0012926017],"study_design_scores_gemma":[0.00016809625,0.000091784,0.0031805492,0.00004774079,0.00005734413,0.000001951487,0.000036840735,0.048584286,0.000020676498,0.9471178,0.00036719607,0.00032572643],"about_ca_topic_score_codex":0.00012219851,"about_ca_topic_score_gemma":0.00006424679,"teacher_disagreement_score":0.23781224,"about_ca_system_score_codex":0.00018758858,"about_ca_system_score_gemma":0.00007907446,"threshold_uncertainty_score":0.99999076},"labels":[],"label_agreement":null},{"id":"W4405639848","doi":"10.1214/24-ejs2331","title":"A note on estimating the dimension from a random geometric graph","year":2024,"lang":"en","type":"article","venue":"Electronic Journal of Statistics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Random geometric graph; Graph; Dimension (graph theory); Combinatorics; Random graph; Statistics; Discrete mathematics; Line graph; Voltage graph","score_opus":0.009653693413360594,"score_gpt":0.25829125180430274,"score_spread":0.24863755839094215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405639848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041206535,0.0047765654,0.98906785,0.0013768708,0.00049978594,0.000042288426,0.000040434377,0.000025501093,0.00005004088],"genre_scores_gemma":[0.89474916,0.00050292513,0.10418988,0.00025167863,0.000220027,0.0000011892264,0.0000069563757,0.000006753525,0.00007144608],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838126,0.00010893106,0.00040705714,0.00019228445,0.0005453198,0.0003651747],"domain_scores_gemma":[0.9967032,0.0026699018,0.00020080332,0.00024785683,0.0001066951,0.00007152971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009785127,0.000120479715,0.00024393573,0.0005618561,0.00012899004,0.0002634048,0.0007354993,0.00003698914,0.000047193993],"category_scores_gemma":[0.0008744082,0.00006378776,0.00012624411,0.0025778075,0.00003657571,0.00019052447,0.00009354533,0.00062995974,0.000044274537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000615318,0.00010028763,0.00003616183,0.000010733199,0.00037712982,0.00032639943,0.00027771178,0.004832682,0.00011026088,0.3847038,0.010503052,0.5986603],"study_design_scores_gemma":[0.0008821927,0.0011626924,0.00073990074,0.000088712746,0.0002472486,0.00015550172,0.000021613685,0.406019,0.0001798447,0.58031994,0.009969932,0.0002134314],"about_ca_topic_score_codex":0.000044955417,"about_ca_topic_score_gemma":0.000008612661,"teacher_disagreement_score":0.8906285,"about_ca_system_score_codex":0.000101870166,"about_ca_system_score_gemma":0.00018401908,"threshold_uncertainty_score":0.27368966},"labels":[],"label_agreement":null},{"id":"W4406116173","doi":"10.1112/jlms.70065","title":"Homology of spectral minimal partitions","year":2025,"lang":"en","type":"article","venue":"Journal of the London Mathematical Society","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Bipartite graph; Disjoint sets; Partition (number theory); Eigenfunction; Laplace operator; Homology (biology); Combinatorics; Topology (electrical circuits); Algebraic connectivity; Discrete mathematics; Pure mathematics; Laplacian matrix; Graph; Eigenvalues and eigenvectors; Mathematical analysis","score_opus":0.012591410480386261,"score_gpt":0.2616111437683409,"score_spread":0.24901973328795463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406116173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18481892,0.00036431616,0.78867984,0.02289591,0.00028526597,0.00007475724,0.000006402823,0.000014829774,0.0028597403],"genre_scores_gemma":[0.9021018,0.000054044904,0.0959705,0.0007353009,0.000057026304,0.0000013918648,2.0331994e-7,0.0000021370804,0.0010775994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894637,0.00007298288,0.0004830747,0.000089338115,0.00025550602,0.00015272776],"domain_scores_gemma":[0.9988349,0.00041182394,0.00028208696,0.00031379567,0.000108176835,0.00004923533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005516711,0.00006921134,0.0003017382,0.000053227945,0.00007849002,0.00003042216,0.0011010726,0.00006229169,0.00011764291],"category_scores_gemma":[0.0003806145,0.000035815967,0.0006697491,0.0010085257,0.00018495152,0.0001212989,0.0003001664,0.00021493193,0.000008358333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010573258,0.0007334112,0.0018365834,0.000083144005,0.00045316393,0.000008096082,0.00039834162,0.00014084876,0.0011940087,0.95395136,0.038147606,0.0030428814],"study_design_scores_gemma":[0.00046240308,0.00014950777,0.010598081,0.000059301285,0.00017825143,0.00008479725,0.0001250942,0.004598386,0.003644883,0.9768002,0.0032088535,0.000090221125],"about_ca_topic_score_codex":0.0000018908266,"about_ca_topic_score_gemma":4.6846995e-7,"teacher_disagreement_score":0.7172829,"about_ca_system_score_codex":0.000027227801,"about_ca_system_score_gemma":0.00005698099,"threshold_uncertainty_score":0.20460851},"labels":[],"label_agreement":null},{"id":"W4406213667","doi":"10.3390/math13020208","title":"Persistent Topological Laplacians—A Survey","year":2025,"lang":"en","type":"article","venue":"Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Allergy and Infectious Diseases; National Institute of General Medical Sciences; Michigan State University Foundation; Bristol-Myers Squibb Canada; Bristol-Myers Squibb; National Institutes of Health; National Science Foundation","keywords":"Topology (electrical circuits); Topological data analysis; Computer science; Mathematics; Combinatorics","score_opus":0.034700024076389516,"score_gpt":0.2771156825517166,"score_spread":0.2424156584753271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406213667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017845271,0.0002029118,0.9519708,0.0027295474,0.00020003162,0.00008034257,0.000012842294,0.00015950314,0.02679874],"genre_scores_gemma":[0.8933481,0.000048607817,0.09169173,0.0011586101,0.000020046235,0.000011220998,0.000014782365,0.0000032591217,0.013703671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912095,0.00006287877,0.00021353872,0.00023285473,0.00017198824,0.00019781549],"domain_scores_gemma":[0.99891466,0.00040705892,0.000046369445,0.0005230621,0.000057421767,0.000051453728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005330113,0.00009289245,0.00020955382,0.00015207585,0.00009499421,0.00015249664,0.0009066429,0.00006532574,0.00015007233],"category_scores_gemma":[0.0005944878,0.00006293923,0.00012595543,0.0013388006,0.000052650215,0.00011181134,0.00039174754,0.00008284652,0.00016884787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015200598,0.0002883428,0.002891922,0.000023516184,0.00007955039,0.000010268457,0.00013421242,0.000029708179,0.000009849967,0.98295254,0.0066494993,0.006929072],"study_design_scores_gemma":[0.0012051043,0.00050151115,0.115442246,0.000098388286,0.00023813962,0.00004456696,0.0008585493,0.18854675,0.00064415723,0.5850257,0.10609691,0.0012979599],"about_ca_topic_score_codex":0.00003176197,"about_ca_topic_score_gemma":0.000017631262,"teacher_disagreement_score":0.8755028,"about_ca_system_score_codex":0.000022410328,"about_ca_system_score_gemma":0.000018924206,"threshold_uncertainty_score":0.25665873},"labels":[],"label_agreement":null},{"id":"W4406785411","doi":"10.48550/arxiv.2501.13328","title":"Physics on manifolds with exotic differential structures","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Differential (mechanical device); Physics; Theoretical physics; Computer science; Geology; Pure mathematics; Mathematics; Aerospace engineering; Engineering","score_opus":0.05159901094583412,"score_gpt":0.2606523501397377,"score_spread":0.20905333919390356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406785411","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6552504,0.000087252265,0.34022555,0.0006212976,0.00072785665,0.00018073898,0.00007870067,0.00023927425,0.002588983],"genre_scores_gemma":[0.9949654,0.000039036673,0.0021812224,0.0004330472,0.00026987304,0.000018141662,0.00008638561,0.000007117012,0.0019998236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.997923,0.000076326854,0.00024792686,0.0009878743,0.0004227157,0.00034211238],"domain_scores_gemma":[0.99801266,0.00012226107,0.00017723133,0.0015073171,0.00007709618,0.00010345253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006344476,0.00036606265,0.00048285702,0.00023243474,0.00012956628,0.00020591862,0.0020700379,0.00021022733,0.000120812896],"category_scores_gemma":[0.00004205809,0.00024013835,0.00020318964,0.00084958837,0.000076506585,0.000106236206,0.0021816904,0.00061171537,0.00009156943],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013491904,0.0013222555,0.31391552,0.0005717233,0.002529822,0.0006886838,0.0005009388,0.0130985575,0.00011800897,0.49658626,0.006870567,0.16366273],"study_design_scores_gemma":[0.0007014607,0.00049873703,0.9183507,0.00020405986,0.00041957948,0.000009328985,0.000020628944,0.008672294,0.0013210467,0.066150516,0.002428605,0.0012230141],"about_ca_topic_score_codex":0.00014060324,"about_ca_topic_score_gemma":0.000019805135,"teacher_disagreement_score":0.6044352,"about_ca_system_score_codex":0.000046064255,"about_ca_system_score_gemma":0.0000754676,"threshold_uncertainty_score":0.97925574},"labels":[],"label_agreement":null},{"id":"W4406800364","doi":"10.21468/scipostphys.18.1.031","title":"Studying the 3d Ising surface CFTs on the fuzzy sphere","year":2025,"lang":"en","type":"article","venue":"SciPost Physics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Ministry of Colleges and Universities; Institut Périmètre de physique théorique; Industry Canada; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Ising model; Surface (topology); Fuzzy logic; Statistical physics; Physics; Mathematics; Theoretical physics; Condensed matter physics; Geometry; Computer science; Artificial intelligence","score_opus":0.030402319970767686,"score_gpt":0.26590185338459216,"score_spread":0.23549953341382446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406800364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38761532,0.0011903348,0.4226588,0.06480644,0.0019341577,0.0007242296,0.000032162665,0.0004462747,0.120592274],"genre_scores_gemma":[0.9939836,0.000016032054,0.0015258879,0.0027250715,0.00009269602,0.0000037155812,0.0000021477108,0.0000035057367,0.0016473434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880385,0.00013067451,0.00014422536,0.000335959,0.00032747848,0.00025779902],"domain_scores_gemma":[0.9981711,0.00070613786,0.00006647263,0.0009620991,0.000063554275,0.000030646665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045469118,0.00012612884,0.000143643,0.000026577378,0.00063771266,0.0003628303,0.0016863341,0.000029067185,0.000022779563],"category_scores_gemma":[0.00011567602,0.000059250015,0.00009713318,0.0028867766,0.00010810353,0.00019678721,0.0007014585,0.00022677392,0.00017444056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005825425,0.00020083388,0.0014762909,0.0000072274743,0.00016619904,0.0000065890213,0.0005914305,0.0061072665,0.00020538188,0.71459985,0.011904062,0.26472902],"study_design_scores_gemma":[0.00085106655,0.00040131714,0.035213243,0.00020954019,0.00029741973,0.0000036995104,0.0021939285,0.10752424,0.0066191377,0.7296418,0.11588347,0.0011611234],"about_ca_topic_score_codex":0.00007411108,"about_ca_topic_score_gemma":0.000012792724,"teacher_disagreement_score":0.60636824,"about_ca_system_score_codex":0.000026618181,"about_ca_system_score_gemma":0.0000410871,"threshold_uncertainty_score":0.49048346},"labels":[],"label_agreement":null},{"id":"W4407326094","doi":"10.2166/wcc.2025.645","title":"Hybridizing persistent homology and machine learning for oceanographic time series","year":2025,"lang":"en","type":"article","venue":"Journal of Water and Climate Change","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Support vector machine; Cluster analysis; Machine learning; Artificial intelligence; Computer science; Buoy; Time series; Data mining; Regression; Hierarchical clustering; Engineering; Mathematics; Statistics","score_opus":0.02861044477818587,"score_gpt":0.24100395671265173,"score_spread":0.21239351193446587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407326094","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9480785,0.016364198,0.016187597,0.018379992,0.00037319338,0.00017422478,0.000026285275,0.000044147302,0.0003718661],"genre_scores_gemma":[0.99246055,0.0045780474,0.002177339,0.0004191281,0.00006714552,0.0000034115699,0.000008859489,0.0000030439667,0.0002824775],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99939096,0.00003641753,0.00018898424,0.0001260946,0.00006573595,0.00019182923],"domain_scores_gemma":[0.9996902,0.0000513549,0.00007421146,0.00006686085,0.000063962536,0.00005344225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039504704,0.00007684192,0.00022278786,0.00033664244,0.00016902777,0.0001005623,0.00016594084,0.000031229327,0.000011137765],"category_scores_gemma":[0.000022821518,0.0000442449,0.00010462061,0.00019874505,0.000050680403,0.00032871796,0.00021583875,0.00009265074,0.0000010345153],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013588252,0.0009938044,0.32394576,0.0022951348,0.003516384,0.00083015405,0.023237385,0.00010877538,0.015820086,0.04230465,0.004173805,0.58141524],"study_design_scores_gemma":[0.019350283,0.026797153,0.17819619,0.0015436261,0.004816732,0.010180936,0.008662445,0.12296162,0.022162504,0.07219499,0.5290373,0.004096198],"about_ca_topic_score_codex":0.0000041085837,"about_ca_topic_score_gemma":0.0000015149367,"teacher_disagreement_score":0.577319,"about_ca_system_score_codex":0.0000058858864,"about_ca_system_score_gemma":0.000002697514,"threshold_uncertainty_score":0.18042548},"labels":[],"label_agreement":null},{"id":"W4407570972","doi":"10.1021/acs.jpcb.5c01287","title":"Persistent Sheaf Laplacian Analysis of Protein Flexibility","year":2025,"lang":"en","type":"article","venue":"The Journal of Physical Chemistry B","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Institute of Allergy and Infectious Diseases; National Institute of General Medical Sciences; Michigan State University Foundation; Bristol-Myers Squibb; Division of Mathematical Sciences; National Institutes of Health; National Science Foundation","keywords":"Computer science; Gaussian; Flexibility (engineering); Topology (electrical circuits); Harmonic; Computation; Artificial intelligence; Sheaf; Algorithm; Biological system; Machine learning; Physics; Mathematics; Biology; Pure mathematics; Statistics; Combinatorics","score_opus":0.01424634833886994,"score_gpt":0.2686602678134724,"score_spread":0.25441391947460246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407570972","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9577195,0.00021172201,0.0380389,0.0016033297,0.000017552797,0.000041817722,0.000009996221,0.000010544789,0.0023466256],"genre_scores_gemma":[0.9991,0.000004555845,0.0002882517,0.00005078892,0.000041182167,6.943183e-7,0.0000013344096,9.92806e-7,0.0005121907],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99894804,0.00007632166,0.00035105165,0.00013518934,0.0003530243,0.0001363547],"domain_scores_gemma":[0.9986717,0.00022825129,0.00029234315,0.0005397058,0.0001995999,0.00006841616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005834364,0.00009200149,0.00041666935,0.00011910647,0.000058684585,0.000027158263,0.0013201381,0.00003498542,0.00004548204],"category_scores_gemma":[0.00024045298,0.000050481187,0.0006813515,0.0032407984,0.0001359424,0.00011363469,0.00023897931,0.00021881811,0.0000017086695],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053081836,0.0055216625,0.0033260016,0.00043953885,0.021697005,0.00004092314,0.0022090964,0.043241918,0.81730884,0.03351921,0.0016719226,0.070493035],"study_design_scores_gemma":[0.0012611903,0.00068159564,0.020692907,0.00015175942,0.01054799,0.000017068176,0.00086154,0.24371424,0.6866137,0.03116106,0.0037135582,0.0005834135],"about_ca_topic_score_codex":0.000018951549,"about_ca_topic_score_gemma":9.69281e-7,"teacher_disagreement_score":0.20047233,"about_ca_system_score_codex":0.000040033832,"about_ca_system_score_gemma":0.00005618187,"threshold_uncertainty_score":0.2453167},"labels":[],"label_agreement":null},{"id":"W4407938149","doi":"10.5220/0013367500003899","title":"Topology-Driven Defense: Detecting Model Poisoning in Federated Learning with Persistence Diagrams","year":2025,"lang":"en","type":"article","venue":"","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Persistence (discontinuity); Computer science; Persistent data structure; Topology (electrical circuits); Distributed computing; Computer security; Engineering; Programming language","score_opus":0.020093992768069925,"score_gpt":0.24214885000788067,"score_spread":0.22205485723981075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407938149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15007302,0.000075539254,0.8396983,0.0015184663,0.000027754702,0.00005397873,2.8264017e-7,0.00016125129,0.008391379],"genre_scores_gemma":[0.9508688,0.000009911696,0.04689548,0.00037326783,0.000005802859,0.000008249238,0.0000021213555,0.0000025698705,0.0018338256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874747,0.00008088552,0.00020228553,0.0004761224,0.00014268798,0.00035055666],"domain_scores_gemma":[0.9993688,0.00022684401,0.000056246532,0.00022603848,0.00006782789,0.000054237687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024777,0.00012820237,0.00021980381,0.00038056186,0.0002919855,0.00020074172,0.000531005,0.00007534767,0.000017293116],"category_scores_gemma":[0.00023921127,0.000091308604,0.000052692038,0.0028390912,0.000063634456,0.000287464,0.00033403488,0.00030529272,0.000010816709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002916203,0.00013653883,0.22001453,0.000019568228,0.00011456637,0.000105025254,0.0007544006,0.5225393,0.0003979263,0.083861,0.00010683466,0.17192112],"study_design_scores_gemma":[0.00023561527,0.000075501775,0.004112021,0.000021004687,0.000010727921,0.000006474426,0.0005201301,0.99314314,0.00021121053,0.0014186131,0.000096891956,0.00014864898],"about_ca_topic_score_codex":0.00028629697,"about_ca_topic_score_gemma":0.0006416393,"teacher_disagreement_score":0.80079573,"about_ca_system_score_codex":0.00005290096,"about_ca_system_score_gemma":0.000060868744,"threshold_uncertainty_score":0.3723457},"labels":[],"label_agreement":null},{"id":"W4408132674","doi":"10.1007/978-3-031-85363-0_41","title":"Signals as Cobordisms in Riemannian Manifolds","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in networks and systems","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Pure mathematics; Ricci-flat manifold; Mathematics; Riemannian geometry; Curvature of Riemannian manifolds; Geology; Geometry; Sectional curvature; Scalar curvature","score_opus":0.012367581846291087,"score_gpt":0.23523935584285077,"score_spread":0.2228717739965597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408132674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000064427804,0.035572,0.85018,0.00085992046,0.0011181037,0.00055348914,0.00002759662,0.00009538235,0.1115291],"genre_scores_gemma":[0.943484,0.0024754386,0.0005255019,0.0011570158,0.00057241047,0.000039545004,0.000090218746,0.00002588984,0.051629953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770933,0.000090750844,0.00064510555,0.0008421934,0.0002981267,0.00041448377],"domain_scores_gemma":[0.9982455,0.00073055376,0.00021052686,0.00065819744,0.000049057795,0.000106158186],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005236621,0.0004073224,0.0009315913,0.0007024067,0.00007454174,0.00032063428,0.0008256404,0.00077877915,0.000055395853],"category_scores_gemma":[0.00008795664,0.0003111329,0.00013930575,0.0006774366,0.000066811466,0.000105798434,0.00042312493,0.00067693985,0.000015192935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026720336,0.000056490037,0.0012880971,0.00024085355,0.00023612962,0.0009930164,0.00018251676,0.17818943,0.0000017841028,0.63157845,0.0026741892,0.18453236],"study_design_scores_gemma":[0.0009801922,0.0003562134,0.0014228518,0.0027403426,0.00012590627,0.00010048749,0.000010090088,0.57361144,0.0000018019333,0.1991605,0.21970314,0.0017870512],"about_ca_topic_score_codex":0.0007051819,"about_ca_topic_score_gemma":0.00061091705,"teacher_disagreement_score":0.9434196,"about_ca_system_score_codex":0.00006552761,"about_ca_system_score_gemma":0.00004267291,"threshold_uncertainty_score":0.9999341},"labels":[],"label_agreement":null},{"id":"W4408186096","doi":"10.1016/j.topol.2025.109319","title":"Double homology and wedge-decomposable simplicial complexes","year":2025,"lang":"en","type":"article","venue":"Topology and its Applications","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Regina","keywords":"Mathematics; Simplicial homology; Simplicial complex; Wedge (geometry); Homology (biology); h-vector; Simplicial approximation theorem; Abstract simplicial complex; Pure mathematics; Combinatorics; Simplicial set; Geometry; Amino acid; Chemistry; Homotopy","score_opus":0.015496613882018666,"score_gpt":0.29123129850502033,"score_spread":0.27573468462300166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408186096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07375734,0.0066838176,0.8359716,0.04346493,0.00020012454,0.00066993415,0.000045440192,0.00031978244,0.03888701],"genre_scores_gemma":[0.99038476,0.00041546242,0.004328532,0.0016173213,0.000045103723,0.0001447667,0.000021499181,0.000002348389,0.0030401994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992166,0.000030064852,0.00016118247,0.00036123148,0.000036504116,0.00019438112],"domain_scores_gemma":[0.9993671,0.0002080789,0.000040260307,0.00027988234,0.00004244683,0.00006219681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010796708,0.000088640016,0.00018860438,0.00019133557,0.0003924116,0.000047974547,0.00038507322,0.00009677823,0.0000748581],"category_scores_gemma":[0.00001693047,0.00007528282,0.000023983215,0.00071563665,0.00022254218,0.00011583566,0.0004067269,0.00010020238,0.000052650026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003954208,0.000045071778,0.00055163197,0.0000052582536,0.000021977803,6.301151e-7,0.000021228461,0.0000024419119,0.00022388418,0.98341864,0.0014508907,0.014254415],"study_design_scores_gemma":[0.00092978176,0.00009460851,0.016762739,0.000003249281,0.000069802925,0.000050680483,0.00006288256,0.0033947965,0.0013173317,0.52931964,0.44772655,0.00026793047],"about_ca_topic_score_codex":0.00008986924,"about_ca_topic_score_gemma":0.000043868866,"teacher_disagreement_score":0.9166274,"about_ca_system_score_codex":0.0000067230385,"about_ca_system_score_gemma":0.00002139168,"threshold_uncertainty_score":0.3069944},"labels":[],"label_agreement":null},{"id":"W4408977865","doi":"10.1007/978-3-031-82431-9_7","title":"Counting Simplicial Pairs in Hypergraphs","year":2025,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Simplicial complex; Mathematics; Computer science","score_opus":0.0803611080694429,"score_gpt":0.3492624266076777,"score_spread":0.2689013185382348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408977865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006554105,0.012838007,0.6906563,0.002356874,0.0015853823,0.00044142618,0.00008207007,0.00017317104,0.29180124],"genre_scores_gemma":[0.60260904,0.016716314,0.1581245,0.006764199,0.0008909404,0.00020544186,0.0003544851,0.00008331846,0.21425174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754494,0.00003818444,0.0008053106,0.00079844904,0.00049867557,0.0003144298],"domain_scores_gemma":[0.99722147,0.0019045938,0.00020966415,0.0003362965,0.00028836276,0.000039601044],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004980619,0.00032569634,0.0006328812,0.0012901785,0.00011274748,0.00006467096,0.0011883549,0.00016919916,0.000050932013],"category_scores_gemma":[0.00047157748,0.00029995164,0.00016527949,0.0011323072,0.00031418318,0.00017441355,0.0010891127,0.00047639833,0.00007466026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003709628,0.000029781024,0.00031234857,0.000038643182,0.00010036538,0.000083167615,0.00017914824,0.034371424,4.1501266e-8,0.8868885,0.0012325511,0.07676034],"study_design_scores_gemma":[0.000061389575,0.00004441245,0.00037085908,0.0003044635,0.00001634855,0.000004869544,0.000115563664,0.034802895,0.0000017731609,0.9498399,0.014061982,0.00037556],"about_ca_topic_score_codex":0.00007324157,"about_ca_topic_score_gemma":0.0002578095,"teacher_disagreement_score":0.6025435,"about_ca_system_score_codex":0.00019785999,"about_ca_system_score_gemma":0.00011615241,"threshold_uncertainty_score":0.9999453},"labels":[],"label_agreement":null},{"id":"W4410572102","doi":"10.2140/agt.2025.25.1227","title":"Synthetic approach to the Quillen model structure on topological spaces","year":2025,"lang":"en","type":"article","venue":"Algebraic & Geometric Topology","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Division of Mathematical Sciences; National Science Foundation","keywords":"Mathematics; Topological space; Pure mathematics; Topology (electrical circuits); Combinatorics","score_opus":0.01492685401742792,"score_gpt":0.2524113606465499,"score_spread":0.237484506629122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410572102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06037651,0.001490137,0.8510114,0.051557932,0.0008897162,0.0005114564,0.000047465277,0.00030274954,0.033812623],"genre_scores_gemma":[0.97366804,0.00006338614,0.012421056,0.008851697,0.00009693466,0.00005399766,0.0000115878875,0.000008500861,0.004824812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99657506,0.0002876816,0.00047195863,0.0012935166,0.00049771427,0.00087408704],"domain_scores_gemma":[0.9965515,0.0011438121,0.00012838081,0.0018543093,0.00010585881,0.00021611876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063063914,0.00038231758,0.0006183387,0.002472604,0.00045521898,0.0002202139,0.00384296,0.0003332461,0.00017891706],"category_scores_gemma":[0.0018217348,0.0002196417,0.0002368609,0.013255409,0.00033873587,0.00015959855,0.0014659581,0.0005433514,0.00024087237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016204185,0.00019999086,0.00024820465,0.0000066620846,0.000109845445,0.000007329985,0.00008874925,0.007064245,0.000014199993,0.93085325,0.013875639,0.047515657],"study_design_scores_gemma":[0.0018848174,0.0021135206,0.026836224,0.00003413516,0.00042129608,0.00018180208,0.0009387236,0.1660511,0.0011167796,0.56095684,0.23719215,0.002272609],"about_ca_topic_score_codex":0.00014738261,"about_ca_topic_score_gemma":0.000017335133,"teacher_disagreement_score":0.9132915,"about_ca_system_score_codex":0.000094667725,"about_ca_system_score_gemma":0.000090689784,"threshold_uncertainty_score":0.89567286},"labels":[],"label_agreement":null},{"id":"W4411500943","doi":"10.3389/fnins.2025.1597899","title":"The topology of representational geometry","year":2025,"lang":"en","type":"article","venue":"Frontiers in Neuroscience","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Canadian Institutes of Health Research","keywords":"Similarity (geometry); Computer science; Artificial intelligence; Topology (electrical circuits); Function (biology); Artificial neural network; Theoretical computer science; Pattern recognition (psychology); Mathematics; Image (mathematics)","score_opus":0.010215206902143155,"score_gpt":0.27085300323338196,"score_spread":0.2606377963312388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411500943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014369083,0.00057726225,0.973504,0.005717482,0.0025777898,0.00006813918,0.00000463887,0.000022395361,0.003159189],"genre_scores_gemma":[0.9807998,0.00022869858,0.015448158,0.0010807231,0.000009652433,0.000008979059,6.2840934e-7,0.0000010391794,0.0024223223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9989916,0.00007496022,0.00021022836,0.00031957534,0.0002078937,0.00019574382],"domain_scores_gemma":[0.9991911,0.00022934497,0.00006417167,0.00045678247,0.000033366632,0.000025214558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004040787,0.000051310402,0.000113934126,0.00041247104,0.00013915615,0.00005331353,0.0017381187,0.000021087428,0.0000023604564],"category_scores_gemma":[0.001006654,0.000033622287,0.000041738745,0.004773103,0.00045592905,0.0001959157,0.00042475667,0.00009096703,8.262229e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000996391,0.000091110946,0.26357692,0.0000051030806,0.000005752777,0.000016805729,0.00003748754,0.0005749019,0.0004796493,0.62616736,0.027942616,0.08109229],"study_design_scores_gemma":[0.00032488134,0.00008451195,0.69052345,0.00000765809,0.0000066521375,0.0000067038004,0.00013520675,0.060808506,0.0016357114,0.16644228,0.079875335,0.0001491143],"about_ca_topic_score_codex":0.00003062431,"about_ca_topic_score_gemma":0.0000038835237,"teacher_disagreement_score":0.9664307,"about_ca_system_score_codex":0.0000148041,"about_ca_system_score_gemma":0.000049808743,"threshold_uncertainty_score":0.3229886},"labels":[],"label_agreement":null},{"id":"W4412096251","doi":"10.1002/rnc.8074","title":"Comment on “Autorepar: A Method to Obtain Identifiable and Observable Reparameterizations of Dynamic Models With Mechanistic Insights”: Existence of an Identifiable Reparameterization","year":2025,"lang":"en","type":"article","venue":"International Journal of Robust and Nonlinear Control","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Observable; Computer science; Econometrics; Statistical physics; Applied mathematics; Mathematical economics; Economics; Mathematics; Physics","score_opus":0.016242790876674136,"score_gpt":0.29060875806289416,"score_spread":0.27436596718622003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412096251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06504723,0.00013544537,0.933253,0.0011517651,0.00013826668,0.00015945702,0.000048913644,0.000009820453,0.000056114048],"genre_scores_gemma":[0.56466776,0.00006963363,0.434448,0.0006462267,0.000013640166,0.00000656998,0.000014764852,0.0000043742925,0.00012904678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837965,0.00016221934,0.0006513247,0.0002679938,0.00042697813,0.00011184923],"domain_scores_gemma":[0.9979468,0.00037954433,0.000517942,0.00027375945,0.0007926394,0.00008929231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007086103,0.00012140614,0.00043075148,0.00063712976,0.000060676357,0.00015390362,0.0006016361,0.000047593487,0.000004587483],"category_scores_gemma":[0.00032064997,0.000088956236,0.00006818151,0.00067200174,0.000051916013,0.0006202648,0.00013596512,0.000090431626,2.4700068e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024968022,0.0022112888,0.000678654,0.00057049026,0.002921998,0.00016176053,0.0011543786,0.5288177,0.028786378,0.4087139,0.00019880319,0.023287807],"study_design_scores_gemma":[0.00095644273,0.0007434529,0.0002389354,0.00037487334,0.00014898606,0.000028627072,0.000080434205,0.9807171,0.0016189037,0.014769174,0.00022076485,0.000102276754],"about_ca_topic_score_codex":0.00008700379,"about_ca_topic_score_gemma":0.000016803244,"teacher_disagreement_score":0.4996205,"about_ca_system_score_codex":0.00004021585,"about_ca_system_score_gemma":0.00007363924,"threshold_uncertainty_score":0.362753},"labels":[],"label_agreement":null},{"id":"W4413186186","doi":"10.55016/ojs/cdm.v5i2.62064","title":"Homotopy types of independence complexes of forests","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Homotopy; Independence (probability theory); Combinatorics; Pure mathematics; Statistics","score_opus":0.012441116789803074,"score_gpt":0.29295498788831076,"score_spread":0.28051387109850767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12079062,0.000036598703,0.87722665,0.000615814,0.00007503858,0.00015243737,0.00036012835,0.00003702867,0.00070569105],"genre_scores_gemma":[0.92476964,0.0000032523262,0.07507536,0.000020437836,0.000015110652,0.000009076606,0.0000121447865,0.0000025677648,0.00009243233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893796,0.000020133999,0.00038203754,0.00017489176,0.00029753626,0.00018743212],"domain_scores_gemma":[0.9983222,0.00029147294,0.00018259358,0.0007088974,0.00039080356,0.00010406788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036306836,0.00009582795,0.00031826162,0.00021027414,0.00006701285,0.00003462116,0.0009933432,0.000072700685,0.00009044369],"category_scores_gemma":[0.0014691055,0.000070605005,0.00010524199,0.0011669373,0.00013023238,0.0001513417,0.00038250085,0.00012848087,0.000038979535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017705999,0.0001336473,0.0010829634,0.000025914536,0.000036642654,0.0000013982833,0.00017154623,0.000050676947,0.007698621,0.988945,0.00026241524,0.0015894052],"study_design_scores_gemma":[0.00097328826,0.0005797989,0.049925093,0.00013676894,0.00022484749,0.000040824187,0.00018871948,0.06252301,0.1391879,0.73955655,0.0059072846,0.0007558889],"about_ca_topic_score_codex":0.000035955793,"about_ca_topic_score_gemma":0.000084635845,"teacher_disagreement_score":0.803979,"about_ca_system_score_codex":0.00000851123,"about_ca_system_score_gemma":0.00004170892,"threshold_uncertainty_score":0.28791887},"labels":[],"label_agreement":null},{"id":"W4413186344","doi":"10.55016/ojs/cdm.v7i2.61908","title":"Vertex decompositions of two-dimensional complexes and graphs","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.016072123820208443,"score_gpt":0.3008052375639724,"score_spread":0.284733113743764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1237219,0.0004467601,0.8726979,0.0016508689,0.00009105003,0.00018110183,0.00053387426,0.00007116089,0.0006053806],"genre_scores_gemma":[0.8950024,0.0000043203177,0.10475907,0.00012433412,0.000013780054,0.000012588979,0.000037647318,0.0000027750245,0.00004305325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903727,0.00003898037,0.00029077442,0.00015462657,0.00020072391,0.0002776296],"domain_scores_gemma":[0.9987623,0.0003785099,0.00008647628,0.00038668065,0.00015238224,0.00023362905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029424246,0.00010812113,0.00025982322,0.00022305228,0.00018619426,0.000048810798,0.0003412538,0.000033488068,0.000055286426],"category_scores_gemma":[0.0002891845,0.00008244502,0.000086898326,0.0009522901,0.000100077865,0.00026849698,0.0003731821,0.00006192072,0.00005237209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.823553e-7,0.00016039668,0.00056043,0.000008231706,0.000045248373,5.515945e-7,0.0001489966,0.00006025124,0.0011090023,0.99652094,0.00082936574,0.0005556185],"study_design_scores_gemma":[0.0017311726,0.00035356745,0.037894372,0.0001474108,0.00045850556,0.00015048632,0.00020078587,0.06864334,0.009640327,0.8758988,0.0038835723,0.0009976543],"about_ca_topic_score_codex":0.000017121429,"about_ca_topic_score_gemma":0.0000032030725,"teacher_disagreement_score":0.7712805,"about_ca_system_score_codex":0.000019231089,"about_ca_system_score_gemma":0.000014103793,"threshold_uncertainty_score":0.336201},"labels":[],"label_agreement":null},{"id":"W4413845316","doi":"10.1016/j.topol.2025.109557","title":"Corrigendum to “Double homology and wedge-decomposable simplicial complexes” [Topology and its Applications 367 (2025) 109319]","year":2025,"lang":"en","type":"article","venue":"Topology and its Applications","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Simplicial homology; Wedge (geometry); Simplicial complex; Homology (biology); Simplicial approximation theorem; Persistent homology; Topology (electrical circuits); Pure mathematics; Combinatorics; Simplicial set; Geometry; Biology; Algorithm; Amino acid; Genetics; Homotopy","score_opus":0.027813842113677215,"score_gpt":0.305297092140418,"score_spread":0.2774832500267408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413845316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04049183,0.01190122,0.8588073,0.06285144,0.00058597454,0.0029979243,0.0002678802,0.0004947071,0.021601701],"genre_scores_gemma":[0.9662675,0.001562646,0.007686588,0.0061640916,0.00019926882,0.001976913,0.00013031012,0.000015990252,0.015996672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979074,0.00008777506,0.0004219416,0.0009791423,0.000090196976,0.00051355024],"domain_scores_gemma":[0.9984934,0.00037033804,0.00011391857,0.00059944415,0.00015341409,0.00026948212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024348022,0.00024981773,0.0004838741,0.00051607616,0.00094591803,0.000092813556,0.0007701988,0.0002735625,0.00017972398],"category_scores_gemma":[0.000058653084,0.000234271,0.000048570597,0.0016322368,0.00038954135,0.0001856104,0.0010233583,0.00025644051,0.00020497321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014754733,0.0001263979,0.00059991336,0.000020611522,0.00005804783,0.0000017112646,0.00007113787,0.0000074396075,0.0006930031,0.9758417,0.0050831493,0.01748213],"study_design_scores_gemma":[0.00092829595,0.00020161123,0.009985305,0.0000056648073,0.0001344717,0.000099868856,0.00013438694,0.0028655175,0.0008829766,0.13318184,0.85111904,0.00046103593],"about_ca_topic_score_codex":0.00017056859,"about_ca_topic_score_gemma":0.00016925494,"teacher_disagreement_score":0.9257757,"about_ca_system_score_codex":0.000026842998,"about_ca_system_score_gemma":0.000071661474,"threshold_uncertainty_score":0.9553294},"labels":[],"label_agreement":null},{"id":"W4413972858","doi":"10.70930/tac/piomkimz","title":"Construction of categorical bundles from local data","year":2016,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Science and Engineering Research Board; Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Categorical variable; Computer science; Mathematics; Statistics","score_opus":0.01661250565285147,"score_gpt":0.25049548062318805,"score_spread":0.23388297497033658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413972858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010487366,0.00051034143,0.9879566,0.0004069679,0.000018709372,0.00005087051,0.00016364748,0.000027123435,0.00037836237],"genre_scores_gemma":[0.99195004,0.0001999561,0.007687018,0.000013092189,0.000029242896,0.0000108465165,0.00004127886,0.0000016207525,0.000066898116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992858,0.00006120971,0.00021271787,0.00025565227,0.00010551542,0.000079114194],"domain_scores_gemma":[0.99828035,0.0006512993,0.00011879222,0.0008411079,0.00006640832,0.000042056185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030445817,0.00006448471,0.00016500942,0.00008271501,0.000057369627,0.000014110904,0.0008290946,0.000041198,0.00005350306],"category_scores_gemma":[0.00007627383,0.00003820066,0.000022083024,0.00047687365,0.0007910822,0.000319934,0.00041758653,0.00002930953,0.000008489589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007675006,0.000025966547,0.0003019537,0.0000028186676,0.000018192819,8.700196e-8,0.000020729578,5.7594855e-7,0.0003444648,0.728655,0.000025962956,0.27059656],"study_design_scores_gemma":[0.00010629524,0.000025247384,0.0013225754,0.0000024070216,0.00002999324,0.0000030876006,0.00019175644,0.00007932011,0.0072824163,0.9853535,0.0055385544,0.00006484573],"about_ca_topic_score_codex":0.00009746091,"about_ca_topic_score_gemma":0.000004276997,"teacher_disagreement_score":0.98146266,"about_ca_system_score_codex":0.000004121826,"about_ca_system_score_gemma":0.000021981954,"threshold_uncertainty_score":0.29147753},"labels":[],"label_agreement":null},{"id":"W4413972940","doi":"10.70930/tac/uhnx7enz","title":"Addendum to “Rank-based persistence”","year":2023,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Addendum; Persistence (discontinuity); Rank (graph theory); Computer science; Mathematics; Statistics; Combinatorics; Philosophy; Engineering; Linguistics; Geotechnical engineering","score_opus":0.021097212541705452,"score_gpt":0.2564157631692604,"score_spread":0.23531855062755494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413972940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01560947,0.00016202382,0.9791682,0.0022734443,0.000024046723,0.000141831,0.000029994413,0.00017394402,0.002417063],"genre_scores_gemma":[0.9965265,0.000021095877,0.002207815,0.00019306081,0.00003153505,0.00009075689,0.000016836177,0.000001876626,0.0009105617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994409,0.000037655293,0.00011420563,0.00019385164,0.00010036634,0.0001130126],"domain_scores_gemma":[0.99916625,0.0002968026,0.00003538354,0.00038538044,0.000052016137,0.00006414295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041357402,0.00005732782,0.00010701057,0.0002206407,0.0001269395,0.00003520084,0.00048585347,0.000023928076,0.000038729457],"category_scores_gemma":[0.00007160131,0.000044564094,0.000037120433,0.0022567753,0.00012649149,0.000095236515,0.00014445478,0.000031922616,0.00010758318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050685267,0.000017148164,0.0001086091,0.0000067612814,0.000008398729,3.3351813e-7,0.00012201037,0.000073692834,0.00014198902,0.95479965,0.000469847,0.044246465],"study_design_scores_gemma":[0.00016198192,0.00011278499,0.0044065886,0.0000049591563,0.000037220943,0.0000012579287,0.0010470322,0.0010220867,0.0063064694,0.9107515,0.075926736,0.0002213787],"about_ca_topic_score_codex":0.000008283088,"about_ca_topic_score_gemma":0.0000014170382,"teacher_disagreement_score":0.980917,"about_ca_system_score_codex":0.0000030165386,"about_ca_system_score_gemma":0.000015607333,"threshold_uncertainty_score":0.1817271},"labels":[],"label_agreement":null},{"id":"W4414001643","doi":"10.1016/j.dam.2025.08.042","title":"Entanglement statistics of polymers in a lattice tube and unknotting of 4-plats","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; Saskatoon City Hospital; Capilano University","funders":"Japan Society for the Promotion of Science; Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Compute Canada; Pacific Institute for the Mathematical Sciences; Division of Mathematical Sciences; National Science Foundation","keywords":"Mathematics; Quantum entanglement; Combinatorics; Lattice (music); Statistics; Quantum mechanics; Quantum; Physics","score_opus":0.010011778679498503,"score_gpt":0.2586941472269866,"score_spread":0.24868236854748807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414001643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06961864,0.00017443133,0.9211992,0.0001543977,0.000025266772,0.00017071201,0.000067732144,0.00001801795,0.008571576],"genre_scores_gemma":[0.6750579,0.000034699537,0.3247614,0.00004990297,0.0000022021711,0.000006882366,0.000007874646,0.00000252124,0.00007662767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990572,0.0000111385425,0.00043298435,0.00017411985,0.0001815851,0.00014297142],"domain_scores_gemma":[0.999108,0.00037635653,0.00016589637,0.00029397025,0.000025540725,0.000030215646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026416464,0.00008993556,0.0002921837,0.00024247062,0.000022059401,0.00001828949,0.0003286547,0.00003445672,0.000029028295],"category_scores_gemma":[0.000088254055,0.00007227974,0.000025647061,0.00095145963,0.000074888885,0.000049575054,0.0003152859,0.000058268623,0.000001273547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029539115,0.0000948316,0.00047976724,0.00023279042,0.000041746745,0.0000018309771,0.0006408341,0.00001966332,0.0007172256,0.9757377,0.00003439456,0.021996291],"study_design_scores_gemma":[0.0025697865,0.00023181108,0.012638089,0.0004415895,0.0003851852,0.0000046493506,0.0060504396,0.12312019,0.02391258,0.8290955,0.0008152052,0.0007349765],"about_ca_topic_score_codex":0.000033010376,"about_ca_topic_score_gemma":0.0000096690865,"teacher_disagreement_score":0.60543925,"about_ca_system_score_codex":0.000011647437,"about_ca_system_score_gemma":0.000019265122,"threshold_uncertainty_score":0.29474825},"labels":[],"label_agreement":null},{"id":"W4414542636","doi":"10.1007/s00454-025-00771-0","title":"A Stability Theorem for Bigraded Persistence Barcodes","year":2025,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea; Serbian Academy of Sciences and Arts; Simons Foundation","keywords":"Homology (biology); Persistent homology; Filtration (mathematics); Stability (learning theory); Persistence (discontinuity)","score_opus":0.03165396604230301,"score_gpt":0.28327984864798067,"score_spread":0.25162588260567764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414542636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03343524,0.00036700725,0.96033084,0.003296496,0.00017720851,0.00021460936,0.00012791817,0.00014147462,0.0019092152],"genre_scores_gemma":[0.914184,0.000006164458,0.08449617,0.00079674734,0.000029773833,0.000039504936,0.00012487278,0.0000037620966,0.00031900595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821144,0.00008511423,0.00034461083,0.00065764895,0.00036649173,0.0003346725],"domain_scores_gemma":[0.99779665,0.0012847882,0.00009430004,0.0004654942,0.00025649872,0.00010225467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005535773,0.00017780208,0.00028055918,0.0005568231,0.00029254443,0.00021770809,0.0011327461,0.00006947063,0.00008448901],"category_scores_gemma":[0.0006226362,0.00014222502,0.00028374998,0.003584985,0.0001747072,0.00034871997,0.0003731338,0.00011668927,0.0000232244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027943106,0.0001483769,0.005149411,0.000051018804,0.0001538402,0.000002789944,0.00012241825,0.0053203744,0.000047738657,0.9520402,0.0010612461,0.035874654],"study_design_scores_gemma":[0.0007680384,0.00015424729,0.07753077,0.00002753352,0.00006656036,0.000004094961,0.00032833964,0.34316245,0.00038779422,0.5707606,0.006391754,0.00041779323],"about_ca_topic_score_codex":0.000020118345,"about_ca_topic_score_gemma":0.0000031859483,"teacher_disagreement_score":0.88074875,"about_ca_system_score_codex":0.00005628001,"about_ca_system_score_gemma":0.0001063143,"threshold_uncertainty_score":0.5799768},"labels":[],"label_agreement":null},{"id":"W4414572703","doi":"10.1142/s1793525326500032","title":"An exploration of LS category and topological complexity of Dold manifolds of toric type","year":2025,"lang":"en","type":"article","venue":"Journal of Topology and Analysis","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Board for Higher Mathematics; Pacific Institute for the Mathematical Sciences","keywords":"Topological complexity; Equivariant map; Torus; Equivariant cohomology; Cohomology; Type (biology); Topology (electrical circuits); Manifold (fluid mechanics)","score_opus":0.06205592483827626,"score_gpt":0.3252304033145952,"score_spread":0.2631744784763189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414572703","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7815433,0.0015491919,0.21521683,0.0013108955,0.000100744706,0.000025852525,0.000008132692,0.000004415048,0.00024065412],"genre_scores_gemma":[0.9933444,0.0006003239,0.0059202136,0.00006066629,0.000016602196,2.4330436e-7,0.0000035307753,7.921639e-7,0.00005319785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99876714,0.00018789755,0.0006276619,0.00016481531,0.00015075628,0.00010170316],"domain_scores_gemma":[0.9986466,0.00017693489,0.00057005655,0.00024124866,0.00030426777,0.00006088161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006224274,0.00008469264,0.0006870514,0.0009120498,0.000048895974,0.0000120994,0.00038775988,0.000109608365,0.00006837607],"category_scores_gemma":[0.00014933108,0.000058088728,0.00016409419,0.0021513856,0.0004293518,0.00041156277,0.00013135848,0.00010893996,1.6173362e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018565876,0.00072044577,0.22281048,0.000085759064,0.0027090467,0.000025961124,0.00051755673,0.00053574104,0.0048123365,0.7502673,0.00014970242,0.017179988],"study_design_scores_gemma":[0.0011154019,0.0033420525,0.6107735,0.000032040105,0.004006984,0.000038362265,0.0016018493,0.011585296,0.010777496,0.35608914,0.0003394926,0.00029839113],"about_ca_topic_score_codex":0.00020340804,"about_ca_topic_score_gemma":0.00005318511,"teacher_disagreement_score":0.39417818,"about_ca_system_score_codex":0.000008545277,"about_ca_system_score_gemma":0.000034150155,"threshold_uncertainty_score":0.23687896},"labels":[],"label_agreement":null},{"id":"W4414693351","doi":"10.1109/tdsc.2025.3616852","title":"An Algorithm for Persistent Homology Computation Using Homomorphic Encryption","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Homomorphic encryption; Correctness; Persistent homology; Plaintext; Encryption; Topological data analysis; Robustness (evolution)","score_opus":0.024047477243892276,"score_gpt":0.2898076227512733,"score_spread":0.26576014550738103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414693351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041291304,0.00019084243,0.9574108,0.00020088615,0.00048542116,0.00019559907,0.000020841715,0.00017727539,0.000026998792],"genre_scores_gemma":[0.82589304,0.000017775914,0.17380169,0.00020401434,0.000030064082,0.000006133658,0.000008439605,0.0000061233786,0.000032740907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867094,0.000098503355,0.0002712118,0.00053263607,0.00013768431,0.00028902618],"domain_scores_gemma":[0.9992293,0.00023867576,0.000081949984,0.0002360982,0.00012631156,0.00008766681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003093421,0.00016320968,0.00025119682,0.00048969925,0.00070691056,0.0001876579,0.000304955,0.0001201872,0.000007266269],"category_scores_gemma":[0.0000056297986,0.00015229161,0.00014608598,0.00095429766,0.0000541126,0.0003272341,0.000007921279,0.00018091779,0.000003340026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010938647,0.0002467195,0.000016418333,0.00002714975,0.00012750064,0.000009054639,0.00021667447,0.18325473,0.00041970573,0.0021232304,0.000041783973,0.81350607],"study_design_scores_gemma":[0.00044656047,0.0002745483,0.000065862674,0.000023327137,0.00009168992,0.000040325718,0.00014561188,0.9962809,0.0006607175,0.0016393217,0.0001683912,0.000162737],"about_ca_topic_score_codex":0.00011128329,"about_ca_topic_score_gemma":0.000014322183,"teacher_disagreement_score":0.81334335,"about_ca_system_score_codex":0.000053422067,"about_ca_system_score_gemma":0.000046545363,"threshold_uncertainty_score":0.6210272},"labels":[],"label_agreement":null},{"id":"W4414786423","doi":"10.4171/ecr/21/4","title":"Exact structures for persistence modules","year":2025,"lang":"en","type":"book-chapter","venue":"EMS series of congress reports","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bishop's University; Université de Sherbrooke","funders":"","keywords":"Adjunction; Morphism; Dimension (graph theory); Algebra over a field; Representation (politics); Closure (psychology); Projective plane; Projective module","score_opus":0.023512373424527902,"score_gpt":0.24487120702009538,"score_spread":0.22135883359556746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414786423","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004042698,0.016612407,0.11038657,0.0024645163,0.008124272,0.0015821275,0.0009346715,0.00053232856,0.85895884],"genre_scores_gemma":[0.02363451,0.00056543865,0.018947285,0.000116275296,0.00013949625,0.000028401711,0.00018259317,0.00001865919,0.9563673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978242,0.000011161112,0.0007221314,0.0007633816,0.00043268502,0.00024642883],"domain_scores_gemma":[0.99706465,0.00018554376,0.000887273,0.0013507432,0.0004231254,0.00008865004],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001883802,0.00033022833,0.0007803285,0.0003785078,0.00012096151,0.00012640585,0.00090296584,0.0002797883,0.00020573617],"category_scores_gemma":[0.00032427657,0.00026374683,0.00045430608,0.0001580303,0.0002984385,0.00037470364,0.00053151685,0.00015970918,0.0000017505322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024487985,0.00001850796,0.00006465776,0.00025208193,0.00049293495,0.00040391684,0.000050626164,0.0000560638,0.000015523232,0.89420354,0.021273669,0.083143994],"study_design_scores_gemma":[0.00007969618,0.00015666292,0.00022157317,0.00012520661,0.00014121285,0.00013810945,0.000013341705,0.00009293649,0.00061875774,0.29496896,0.70304567,0.000397872],"about_ca_topic_score_codex":0.000037614347,"about_ca_topic_score_gemma":0.000025667297,"teacher_disagreement_score":0.681772,"about_ca_system_score_codex":0.000024915307,"about_ca_system_score_gemma":0.00011465023,"threshold_uncertainty_score":0.99998146},"labels":[],"label_agreement":null},{"id":"W4414879330","doi":"10.4153/s000843952510129x","title":"Hartshorne’s question on cofiniteness of complexes","year":2025,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Noetherian; Commutative property; Ideal (ethics); Noetherian ring; Homology (biology); Radical of a ring; Commutative ring","score_opus":0.012753113686249467,"score_gpt":0.248837122060063,"score_spread":0.23608400837381355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414879330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02882602,0.00020868993,0.7152813,0.06554898,0.0002574015,0.00035400517,0.00009828309,0.00016561507,0.18925968],"genre_scores_gemma":[0.9865871,0.0000050244025,0.0073841447,0.002240625,0.000013746645,0.000011585553,0.000010664784,0.0000031437173,0.003743969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990625,0.00006410703,0.0002531467,0.00023460182,0.0001529498,0.00023274499],"domain_scores_gemma":[0.9988477,0.00038232203,0.000044165998,0.00045084045,0.000072626535,0.00020232724],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00031139443,0.00009662958,0.00024013902,0.00042892626,0.00007494131,0.000058702313,0.00063616637,0.00006463983,0.0024746736],"category_scores_gemma":[0.00065555697,0.000076070464,0.00007208175,0.000840296,0.0000969928,0.000027773318,0.00007508451,0.00008749973,0.0020560222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014147528,0.00004267178,0.00007175305,0.000024627878,0.0000143912785,0.000009114839,0.000013935748,0.000015168261,0.000011318837,0.9793444,0.0150400605,0.0054111294],"study_design_scores_gemma":[0.00036158555,0.00016655894,0.0061945464,0.00025973457,0.000049774106,0.000007682009,0.00005332426,0.0056206617,0.0011726932,0.6056057,0.38014364,0.00036409352],"about_ca_topic_score_codex":0.0012356534,"about_ca_topic_score_gemma":0.00036073988,"teacher_disagreement_score":0.95776105,"about_ca_system_score_codex":0.000050739734,"about_ca_system_score_gemma":0.00008801668,"threshold_uncertainty_score":0.998721},"labels":[],"label_agreement":null},{"id":"W4414978487","doi":"10.48550/arxiv.2510.05693","title":"Exploring Quantum Spacetime with Topological Data Analysis","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Colleges and Universities; Institut Périmètre de physique théorique; Radboud Universiteit; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Government of Canada","keywords":"Spacetime; Quantum; Class (philosophy); Topology (electrical circuits); Observable; Euclidean geometry; Quantum operation; Path integral formulation; Fractal; Quantum spacetime","score_opus":0.34017548281953,"score_gpt":0.3286918650638368,"score_spread":0.011483617755693176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414978487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36897,0.00059089117,0.6224853,0.0047753216,0.0004369255,0.00019617712,0.00031917944,0.00047756283,0.0017486602],"genre_scores_gemma":[0.97084194,0.0007563251,0.024957767,0.0004644868,0.00018784766,0.000070052505,0.0008281249,0.000009030722,0.0018844471],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9955917,0.00021132163,0.0005531866,0.002434825,0.00059332635,0.0006156359],"domain_scores_gemma":[0.9926832,0.0003733082,0.00031435696,0.0062560556,0.00014282373,0.00023026025],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00072899077,0.00048499752,0.0011114978,0.0011920227,0.00021226972,0.0003162743,0.00756888,0.00026707942,0.0002447573],"category_scores_gemma":[0.00041826518,0.00033024655,0.00035327478,0.006314525,0.00018737727,0.0007418908,0.015635367,0.0009183676,0.0001801467],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004354005,0.0005634696,0.9289666,0.00010466324,0.006901037,0.00047543942,0.0002443628,0.0066362787,0.000010186279,0.03501289,0.0023084038,0.018733166],"study_design_scores_gemma":[0.00057696336,0.0003778151,0.80962926,0.00014914841,0.0051230155,0.000011246475,0.00022292661,0.15113813,0.00015939769,0.0061472557,0.024410062,0.0020547786],"about_ca_topic_score_codex":0.001279856,"about_ca_topic_score_gemma":0.00018103755,"teacher_disagreement_score":0.6018719,"about_ca_system_score_codex":0.00006559024,"about_ca_system_score_gemma":0.00014525378,"threshold_uncertainty_score":0.99991494},"labels":[],"label_agreement":null},{"id":"W4415202877","doi":"10.1093/comnet/cnaf021","title":"Counting simplicial pairs in hypergraphs","year":2025,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Toronto","funders":"","keywords":"Simplicial manifold; Simplicial homology; h-vector; Simplicial complex; Simplicial approximation theorem; Abstract simplicial complex","score_opus":0.015927756605140543,"score_gpt":0.26407577445249164,"score_spread":0.2481480178473511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415202877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02999748,0.0009202975,0.96206903,0.0025583832,0.0005338943,0.000040660772,7.905608e-7,0.00002154596,0.0038579002],"genre_scores_gemma":[0.9918594,0.000092122864,0.0067382054,0.0010821893,0.0001627289,5.66539e-7,9.670543e-7,0.000001847187,0.0000620154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875385,0.00008401593,0.0005496337,0.00014063847,0.00022517999,0.00024667478],"domain_scores_gemma":[0.99903077,0.0003165889,0.00025317108,0.0002132563,0.00012648717,0.000059720183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007305619,0.00009238781,0.00032580987,0.0006156807,0.000073966505,0.00012088479,0.0009957167,0.000062906925,0.000038643077],"category_scores_gemma":[0.00012472703,0.000069716705,0.0001618034,0.002956953,0.00004080461,0.00027258787,0.00021674445,0.0003058324,0.0000024772116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006485769,0.00040174634,0.13185193,0.000014880484,0.00024699766,0.0002584664,0.00009792227,0.11606985,0.00009418333,0.21283185,0.05455587,0.48351145],"study_design_scores_gemma":[0.0010259888,0.00017854737,0.3597928,0.000090850655,0.00004668785,0.000056677763,0.000073979005,0.50278556,0.0000100724,0.04895902,0.08672464,0.0002551603],"about_ca_topic_score_codex":0.00003017779,"about_ca_topic_score_gemma":0.00003195158,"teacher_disagreement_score":0.96186185,"about_ca_system_score_codex":0.000034074248,"about_ca_system_score_gemma":0.000042293035,"threshold_uncertainty_score":0.28429648},"labels":[],"label_agreement":null},{"id":"W4415293464","doi":"10.1101/2025.10.16.682912","title":"State dependent shifts in large scale functional topographies","year":2025,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Montreal Neurological Institute and Hospital","funders":"Fonds de recherche du Québec – Nature et technologies; Canadian Institutes of Health Research; Hospital for Sick Children; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Default mode network; Human Connectome Project; Functional connectivity; Resting state fMRI; Connectome; Cognition; Neuroimaging; Sensory system; Functional magnetic resonance imaging; Magnetoencephalography","score_opus":0.012694439538809544,"score_gpt":0.21685839429372614,"score_spread":0.20416395475491658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415293464","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59268206,0.0026053807,0.39691323,0.0017319828,0.003001975,0.0006958763,0.0013553925,0.00091505377,0.00009905512],"genre_scores_gemma":[0.9876525,0.00047010582,0.010925949,0.00061532174,0.000120866585,0.00013763184,0.0000010800572,0.000016409227,0.000060160342],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9963598,0.00018319656,0.0006284902,0.001466694,0.00063407596,0.00072773814],"domain_scores_gemma":[0.9973856,0.0001337991,0.0002658327,0.0017038963,0.00028238323,0.0002284675],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009648665,0.00046871157,0.0006325185,0.0017712394,0.00016992146,0.00045065442,0.0018279967,0.00036398935,0.00008383384],"category_scores_gemma":[0.0001835217,0.00044772425,0.00025078526,0.004135228,0.000091931404,0.0003650937,0.0027475501,0.00084214605,0.00007595076],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002551797,0.007324614,0.7684323,0.002116177,0.00283186,0.0018038047,0.00026145778,0.012392043,0.028552972,0.16358572,0.012012988,0.00043087458],"study_design_scores_gemma":[0.0009512904,0.000057552996,0.97216904,0.00024655313,0.00009588942,1.0521048e-8,0.0000049227806,0.005958724,0.0076962723,0.00037538845,0.011132108,0.0013122361],"about_ca_topic_score_codex":0.00017301111,"about_ca_topic_score_gemma":0.00011179505,"teacher_disagreement_score":0.39497042,"about_ca_system_score_codex":0.0001657347,"about_ca_system_score_gemma":0.0003592282,"threshold_uncertainty_score":0.99979746},"labels":[],"label_agreement":null},{"id":"W4416228481","doi":"10.1021/acs.jcim.5c02266","title":"A Review of Topological Data Analysis and Topological Deep Learning in Molecular Sciences","year":2025,"lang":"en","type":"review","venue":"Journal of Chemical Information and Modeling","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Division of Information and Intelligent Systems; Division of Mathematical Sciences; Michigan State University Foundation","keywords":"Topological data analysis; Deep learning; Topology (electrical circuits); Transformative learning; Sequence (biology); TRACE (psycholinguistics); Big data","score_opus":0.07976611656877461,"score_gpt":0.3711833016736606,"score_spread":0.291417185104886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416228481","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040471517,0.68602246,0.31361368,0.00015809713,0.000014607752,0.00005330769,0.0000045274846,0.000005013904,0.000087822635],"genre_scores_gemma":[0.0005845515,0.97806317,0.02094633,0.00035593065,0.000009784246,0.0000015757226,0.000036252477,8.877984e-7,0.0000015210064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757546,0.00014866977,0.001566284,0.00022418324,0.0003235042,0.00016191264],"domain_scores_gemma":[0.9982727,0.00036579982,0.00085783465,0.00026601212,0.00014367075,0.000093969815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020018597,0.00017098036,0.0015522368,0.0010736001,0.00004027887,0.000103175495,0.0011769622,0.0001819725,0.000013197516],"category_scores_gemma":[0.0017711262,0.00010352258,0.00027680144,0.0029166832,0.00012689276,0.00092401437,0.0010288262,0.00048504234,4.237001e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017504001,0.000024215475,0.00001465151,0.008376026,0.00016746673,0.0000049784453,0.000019750241,0.000366374,5.4142754e-7,0.0034784896,0.000011412715,0.98753434],"study_design_scores_gemma":[0.00057952385,0.00030531012,0.000005870364,0.050751302,0.0055307904,0.00030569287,0.00013170882,0.7888534,0.000008649014,0.004390492,0.14829798,0.0008392988],"about_ca_topic_score_codex":0.000011115543,"about_ca_topic_score_gemma":4.0148558e-7,"teacher_disagreement_score":0.98669505,"about_ca_system_score_codex":0.000021904663,"about_ca_system_score_gemma":0.000116815594,"threshold_uncertainty_score":0.42215282},"labels":[],"label_agreement":null},{"id":"W4416414390","doi":"10.48550/arxiv.2511.09902","title":"Incremental Generation is Necessary and Sufficient for Universality in Flow-Based Modelling","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Canada; Canadian Institute for Advanced Research","keywords":"Lipschitz continuity; Universality (dynamical systems); Class (philosophy); Logarithm; Smoothness; Observer (physics); Probability measure; Domain (mathematical analysis)","score_opus":0.10962438791844206,"score_gpt":0.2949769099698941,"score_spread":0.18535252205145206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416414390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4809786,0.00038430165,0.5162924,0.0013346561,0.00028680736,0.00036994115,0.00025717757,0.000025185616,0.00007091605],"genre_scores_gemma":[0.9744049,0.00036882042,0.023336507,0.0010742872,0.00012128718,0.00004778885,0.00033657116,0.0000071959466,0.00030266534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996092,0.00024476752,0.0008515541,0.0018465684,0.0004169109,0.00054817833],"domain_scores_gemma":[0.99796325,0.00032932652,0.00031986658,0.0009822308,0.00022881843,0.00017651991],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012270523,0.0004554535,0.0006836823,0.0008458548,0.0003800948,0.00031444893,0.0011520468,0.00038108593,0.000101157195],"category_scores_gemma":[0.00010652766,0.00044723816,0.00028411922,0.0019736772,0.00016914704,0.00038230527,0.0017403062,0.0004952341,0.000011277028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000861506,0.0007633376,0.16344,0.00027848146,0.00016947315,0.000018006738,0.000849608,0.8126788,0.0001585101,0.0021258523,0.0004368704,0.01899488],"study_design_scores_gemma":[0.00083656213,0.00013550685,0.01151823,0.00009117658,0.00013329046,4.1070743e-7,0.00013391141,0.98429585,0.0010127731,0.00041758514,0.0009818093,0.0004429226],"about_ca_topic_score_codex":0.002765912,"about_ca_topic_score_gemma":0.00019442734,"teacher_disagreement_score":0.49342626,"about_ca_system_score_codex":0.0002844935,"about_ca_system_score_gemma":0.00032793536,"threshold_uncertainty_score":0.99979794},"labels":[],"label_agreement":null},{"id":"W4416428295","doi":"10.1177/03010066251384492","title":"Multiscale structural complexity as a quantitative measure of visual complexity","year":2025,"lang":"en","type":"article","venue":"Perception","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Structural complexity; Computational complexity theory; Measure (data warehouse); Perception; Computational model; Complexity index; Worst-case complexity","score_opus":0.0675149873754459,"score_gpt":0.3628207742742187,"score_spread":0.29530578689877285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416428295","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6243059,0.000040549796,0.37304562,0.00073950377,0.00011440401,0.00008705609,0.000024269557,0.00006470726,0.001577989],"genre_scores_gemma":[0.9583835,0.0000055929618,0.041218493,0.00014575133,0.0000129571845,0.0000035265366,0.0000358633,0.0000014861677,0.00019285701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9988762,0.00013787861,0.00024002272,0.0003154879,0.0002694566,0.00016096809],"domain_scores_gemma":[0.99934036,0.000087303124,0.00008777978,0.00027111833,0.00016459146,0.000048844282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021739613,0.00010519961,0.00024260145,0.00022608592,0.00014237237,0.00004951112,0.00047446994,0.00005701812,0.0003642466],"category_scores_gemma":[0.00017803063,0.00008287887,0.00011335581,0.0012180373,0.00028530983,0.0002862968,0.00024742394,0.000108152984,0.00007993709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089012654,0.00034496514,0.01943393,0.000057954036,0.00014659083,0.0000041261446,0.0018069706,0.00015895526,0.011157009,0.8158571,0.0008734165,0.15006998],"study_design_scores_gemma":[0.00033505875,0.00018748187,0.80147237,0.000016049687,0.000026524542,0.0000026464918,0.00031320655,0.12564217,0.0002355033,0.071389146,0.00024196148,0.00013787171],"about_ca_topic_score_codex":0.0011790687,"about_ca_topic_score_gemma":0.00020399474,"teacher_disagreement_score":0.78203845,"about_ca_system_score_codex":0.000043869135,"about_ca_system_score_gemma":0.000025354864,"threshold_uncertainty_score":0.39882448},"labels":[],"label_agreement":null},{"id":"W4416716417","doi":"10.48550/arxiv.2410.01778","title":"TopER: Topological Embeddings in Graph Representation Learning","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Department of Mechanical Engineering, University of Texas at Austin; University of Texas at Austin; National Science Foundation","keywords":"Interpretability; Topological data analysis; Graph; Graph embedding; Embedding; Topological graph theory; Cluster analysis; Feature learning; Representation (politics)","score_opus":0.08002898316307643,"score_gpt":0.221564961347544,"score_spread":0.14153597818446756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416716417","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72339785,0.00028024442,0.26556456,0.00074250525,0.000521186,0.00017686943,0.00000958402,0.0004489579,0.008858219],"genre_scores_gemma":[0.994834,0.00037349167,0.0009144294,0.00008288645,0.000048243684,0.0000012811735,0.000028278882,0.0000064431883,0.0037109342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976795,0.00020997424,0.00024625807,0.0014065325,0.00011622249,0.0003415172],"domain_scores_gemma":[0.99879974,0.00017929576,0.0001292534,0.00070786814,0.00006289654,0.00012094496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035482465,0.00024011421,0.0003764763,0.00094145647,0.00009531031,0.00022099096,0.001526504,0.0003179952,0.0001498783],"category_scores_gemma":[0.0001867998,0.00022256521,0.00028692393,0.0034615493,0.00011400547,0.0002489057,0.0044248463,0.0011549238,0.00023180204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018950173,0.00012728044,0.02204736,0.000049280832,0.00011359418,0.0019483017,0.00031057658,0.2597256,0.000018959348,0.7091652,0.0004417015,0.0060331705],"study_design_scores_gemma":[0.00024837162,0.00008351134,0.006995115,0.0000601549,0.00008216784,0.000007344313,0.00026142458,0.42376345,0.000044667533,0.5668756,0.0010847899,0.00049342465],"about_ca_topic_score_codex":0.0006859117,"about_ca_topic_score_gemma":0.00006174812,"teacher_disagreement_score":0.27143613,"about_ca_system_score_codex":0.00012648109,"about_ca_system_score_gemma":0.000048718342,"threshold_uncertainty_score":0.9075946},"labels":[],"label_agreement":null},{"id":"W4416733381","doi":"10.1016/j.aim.2025.110708","title":"Deformation quantization via categorical factorization homology","year":2025,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Research Council; Horizon 2020 Framework Programme; Deutsche Forschungsgemeinschaft; Ministry of Colleges and Universities; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Innovation, Science and Economic Development Canada; Simons Foundation","keywords":"Categorical variable; Factorization; Homology (biology); Quantization (signal processing); Deformation (meteorology); Algebra over a field","score_opus":0.009045355549890374,"score_gpt":0.2811311759232693,"score_spread":0.2720858203733789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416733381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011411755,0.00048181723,0.9948792,0.00028152295,0.00021096705,0.00007547171,8.7279136e-7,0.00006588072,0.0028630793],"genre_scores_gemma":[0.919748,0.0005299127,0.07937452,0.00011169071,0.000011829504,0.000013461946,0.000025180787,0.0000021854894,0.00018322887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992231,0.000035493955,0.0003066225,0.00016652084,0.0001296258,0.00013862501],"domain_scores_gemma":[0.9993847,0.00018266565,0.000100331104,0.0002615151,0.00005172417,0.000019068797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018583823,0.00007693856,0.00015629141,0.00033827583,0.00005370579,0.00003991884,0.00040238778,0.000059694674,0.000015164808],"category_scores_gemma":[0.00025619892,0.000060420916,0.000028076201,0.0021075315,0.00002868859,0.0008411874,0.00011153897,0.00006992813,0.000032443502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.9691773e-7,0.000101745885,0.00149466,0.000039027556,0.000004921566,0.0000019564018,0.00014631244,0.0017981528,0.000023986597,0.9256008,0.00002987557,0.07075771],"study_design_scores_gemma":[0.00011577538,0.00001977882,0.0017509612,0.000009073625,0.0000068950226,0.0000034712448,0.000036707497,0.2223751,0.00018728596,0.7720433,0.0033661579,0.00008550295],"about_ca_topic_score_codex":0.0000072619514,"about_ca_topic_score_gemma":0.000014250591,"teacher_disagreement_score":0.9186068,"about_ca_system_score_codex":0.00004756431,"about_ca_system_score_gemma":0.000013889229,"threshold_uncertainty_score":0.24638934},"labels":[],"label_agreement":null},{"id":"W4416785446","doi":"10.28924/2291-8639-23-2025-306","title":"Categorical Foundations of Persistent Homology: Bridging Classical Topology and Topological Data Analysis with Applications","year":2025,"lang":"","type":"article","venue":"International Journal of Analysis and Applications","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"University of Petra","keywords":"Categorical variable; Persistent homology; Topological data analysis; Algebraic topology; Topology (electrical circuits); Computational topology; Category theory; Sheaf","score_opus":0.027241159282333033,"score_gpt":0.32431720299121036,"score_spread":0.2970760437088773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416785446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007856665,0.0035883803,0.96859556,0.018821862,0.0000764077,0.00022744144,0.00030127427,0.000013100357,0.00051931944],"genre_scores_gemma":[0.9783805,0.0028788587,0.017475955,0.00031487102,0.0002017611,0.00004210226,0.0002875916,0.0000052210394,0.00041312186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99613625,0.00023689072,0.0015997334,0.000999322,0.000709166,0.00031865996],"domain_scores_gemma":[0.99480146,0.0008805464,0.0013072795,0.0012211467,0.00151093,0.00027860617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010003124,0.00031098942,0.0012979287,0.0038630664,0.00038420467,0.00037254867,0.0027960485,0.0002203128,0.00016675254],"category_scores_gemma":[0.00018674544,0.00023606434,0.0008575686,0.010017757,0.0013488362,0.00050687464,0.0014955968,0.000475177,0.0000029110743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012881513,0.001967468,0.09747527,0.000034963927,0.09091598,0.00003883138,0.00018687232,0.006494171,0.00006265268,0.6286695,0.0004534141,0.17357206],"study_design_scores_gemma":[0.002544354,0.0009996092,0.2722429,0.000057121535,0.15182953,0.00051004963,0.0018928839,0.45746356,0.000065414126,0.032774985,0.078487955,0.0011316302],"about_ca_topic_score_codex":0.00032008495,"about_ca_topic_score_gemma":0.00023610622,"teacher_disagreement_score":0.97052383,"about_ca_system_score_codex":0.00010171677,"about_ca_system_score_gemma":0.00027670193,"threshold_uncertainty_score":0.96264243},"labels":[],"label_agreement":null},{"id":"W4417068584","doi":"10.1093/mnras/staf2152","title":"Dark Energy Survey Year 3 results: <i>w</i> CDM cosmology from simulation-based inference with persistent homology on the sphere","year":2025,"lang":"en","type":"article","venue":"Monthly Notices of the Royal Astronomical Society","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Fermilab; Integrated Electronics Engineering Center, Binghamton University; University of Illinois at Urbana-Champaign; Financiadora de Estudos e Projetos; Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Deutsche Forschungsgemeinschaft; Argonne National Laboratory; European Regional Development Fund; U.S. Department of Energy; European Commission; Ministério da Ciência, Tecnologia e Inovação; Higher Education Funding Council for England; Science and Technology Facilities Council; University College London; National Centre for Supercomputing Applications; Ohio State University; University of Illinois System; University of Chicago; Ministerio de Ciencia e Innovación; Generalitat de Catalunya; National Science Foundation","keywords":"Dark energy; Weak gravitational lensing; Cosmology; Dark matter; Redshift; Galaxy; Topological data analysis; Persistent homology; Smoothing","score_opus":0.014315997112188082,"score_gpt":0.22035158520191747,"score_spread":0.20603558808972938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417068584","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9496715,0.00009527335,0.042160187,0.006537044,0.0001922667,0.0001334616,0.0004452094,0.000037751735,0.0007272866],"genre_scores_gemma":[0.994881,1.5726259e-7,0.0038464144,0.00093178614,0.00002335389,0.000007742169,0.00005181293,0.0000036497133,0.00025409422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983496,0.000394457,0.0003231801,0.0004610412,0.00020836575,0.00026334205],"domain_scores_gemma":[0.9938223,0.004948107,0.00023279495,0.0008501154,0.00009278988,0.000053916443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040573813,0.00016895053,0.00030371489,0.00002295311,0.00020428248,0.0000686191,0.0017385532,0.00011609806,0.000036683523],"category_scores_gemma":[0.00043895288,0.00008619738,0.0003269293,0.00054408296,0.00039122446,0.000052487056,0.00048458052,0.0002275001,0.00000738915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011552112,0.000120053635,0.025847716,0.00000157625,0.00018200453,1.563709e-7,0.00003322083,0.96974146,5.3134085e-7,0.0010470751,0.0020226997,0.00088797504],"study_design_scores_gemma":[0.00048553795,0.00016952475,0.20488523,0.000014000913,0.000058683858,1.2891028e-9,0.00006244161,0.7925797,0.000041345455,0.00022742311,0.0013756601,0.000100434794],"about_ca_topic_score_codex":0.0045928466,"about_ca_topic_score_gemma":0.0004504016,"teacher_disagreement_score":0.17903753,"about_ca_system_score_codex":0.00007053007,"about_ca_system_score_gemma":0.000107993175,"threshold_uncertainty_score":0.69430405},"labels":[],"label_agreement":null},{"id":"W4417299209","doi":"10.1016/j.mlwa.2025.100820","title":"Deep learning and the geometry of compactness in stability and generalization","year":2025,"lang":"en","type":"article","venue":"Machine Learning with Applications","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Generalization; Stability (learning theory); Compact space; Deep learning; Set (abstract data type)","score_opus":0.006746168656278905,"score_gpt":0.24716165481968583,"score_spread":0.2404154861634069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417299209","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10297964,0.0009521906,0.8940587,0.0013248665,0.0000036600004,0.00016276802,0.0000011976002,0.00003315342,0.00048384897],"genre_scores_gemma":[0.9940736,0.0001308853,0.005583759,0.000051020157,0.0000034996478,0.00004763531,0.00001527045,0.0000017477587,0.000092581395],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992716,0.00015801407,0.00016159248,0.00022545585,0.0000903891,0.00009297212],"domain_scores_gemma":[0.99924994,0.000404133,0.000087906155,0.00018753248,0.000045645447,0.000024845687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004914327,0.00006671573,0.00016377807,0.00020649025,0.00018149917,0.000054334712,0.00020266739,0.000025403815,0.0000099947965],"category_scores_gemma":[0.00016210994,0.000040082028,0.000014762913,0.002117685,0.00018427405,0.0000806679,0.00017772285,0.00019392138,4.6188308e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001572763,0.000044355354,0.7494861,0.000026810667,0.000021147041,1.873039e-7,0.00023651062,0.008394242,0.00003197722,0.18005459,0.0000014387845,0.061686948],"study_design_scores_gemma":[0.0009545969,0.00004110989,0.31687465,0.000010824428,0.000031512864,0.0000027026656,0.00015652186,0.6718778,0.00006640361,0.005019051,0.0048630005,0.00010184325],"about_ca_topic_score_codex":0.00041255698,"about_ca_topic_score_gemma":0.000117391755,"teacher_disagreement_score":0.89109397,"about_ca_system_score_codex":0.000009299108,"about_ca_system_score_gemma":0.000009994385,"threshold_uncertainty_score":0.16344976},"labels":[],"label_agreement":null},{"id":"W6926425860","doi":"10.25318/2210000701-fra","title":"Accès d'un ménage à Internet au domicile, selon le quartile de revenu du ménage et la géographie, inactif","year":2019,"lang":"fr","type":"dataset","venue":"Statistics Canada Dissemination","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"The Internet; Quartile; Context (archaeology); Unemployment","score_opus":0.009323005874322677,"score_gpt":0.2562751908053489,"score_spread":0.24695218493102622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6926425860","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014173966,0.00020988786,0.28020594,0.0011796914,0.0011216055,0.00028877385,0.7151005,0.00002882329,0.0004473728],"genre_scores_gemma":[0.07327687,0.00070491317,0.012453038,0.0006254056,0.00017821405,0.00005134281,0.90706515,0.00003860031,0.005606483],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9954135,0.0008355019,0.0008517979,0.0010625338,0.0009993598,0.00083735073],"domain_scores_gemma":[0.99473447,0.002569606,0.0008235376,0.0011128255,0.00036193384,0.0003976506],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013881965,0.00060310727,0.00076058577,0.0006525941,0.00031714412,0.00061379257,0.0019040721,0.0004030185,0.00040427214],"category_scores_gemma":[0.001960272,0.0006223229,0.00013353585,0.002491037,0.0003212991,0.00055440067,0.00067138753,0.00079554145,0.000113385744],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002012948,0.00023618633,0.00028363153,0.00021031141,0.0001594666,0.00057537766,0.00021485203,0.00007069394,0.000017726254,0.040856466,0.8898077,0.067547485],"study_design_scores_gemma":[0.000475292,0.00020707707,0.062956706,0.00031782774,0.000409306,0.00011156509,0.00040139747,0.0074931993,0.0001466448,0.004377986,0.92202705,0.0010759719],"about_ca_topic_score_codex":0.56053185,"about_ca_topic_score_gemma":0.73300767,"teacher_disagreement_score":0.2677529,"about_ca_system_score_codex":0.00073308346,"about_ca_system_score_gemma":0.0014067808,"threshold_uncertainty_score":0.9996228},"labels":[],"label_agreement":null},{"id":"W6928583286","doi":"10.36330/kmj.v21.i1.18575","title":"Assessing the Impact of Task-Shifting on Infant, Maternal and Child Health Outcomes in Rural Nigeria","year":2025,"lang":"en","type":"article","venue":"Kufa Medical journal","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Christian ministry; Child mortality; Socioeconomic status; Health care; Infant mortality; Child health; Rural area; Developing country; Longitudinal study","score_opus":0.013510308423225719,"score_gpt":0.3561097071564424,"score_spread":0.3425993987332167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6928583286","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95142674,0.0004995276,0.025609376,0.021583838,0.00022380259,0.000046333553,0.0000032917426,0.00001354791,0.00059355877],"genre_scores_gemma":[0.9977388,0.00018759482,0.00058540184,0.0014081325,0.000058560297,8.2661717e-7,7.284033e-7,0.0000018691542,0.000018125991],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99818474,0.00026210773,0.0005292874,0.00015262217,0.00055854354,0.00031271766],"domain_scores_gemma":[0.9988863,0.00043239965,0.00023423419,0.00020128798,0.000029793206,0.0002159723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001940107,0.00011335378,0.00036568125,0.00036329127,0.00022291421,0.00030974476,0.0008165878,0.00006246171,0.00007611618],"category_scores_gemma":[0.000995837,0.000053083757,0.0001307885,0.0008925167,0.00011219482,0.00030304978,0.00029501694,0.0006329772,0.00000196207],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006428573,0.00008005702,0.7272418,0.00000742516,0.000079850135,0.000043852335,0.00014712634,0.000044142587,0.0000039345377,0.0017811204,0.0003550466,0.2702092],"study_design_scores_gemma":[0.0004058204,0.00010067982,0.99320894,0.00022271539,0.0000038756616,0.00011992587,0.00008001365,0.003597147,0.000008449406,0.0021327473,0.00006526313,0.00005442733],"about_ca_topic_score_codex":0.00055316836,"about_ca_topic_score_gemma":0.000027851112,"teacher_disagreement_score":0.27015477,"about_ca_system_score_codex":0.000060058323,"about_ca_system_score_gemma":0.00021808986,"threshold_uncertainty_score":0.29868758},"labels":[],"label_agreement":null},{"id":"W6929786031","doi":"10.5281/zenodo.10127353","title":"Convening for a Cause Workshop Report","year":2023,"lang":"en","type":"report","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Carleton University","funders":"","keywords":"Psychological intervention; Iron-deficiency anemia; Foundation (evidence); Iron deficiency; MEDLINE","score_opus":0.20336079307991692,"score_gpt":0.34831455241720755,"score_spread":0.14495375933729063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929786031","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020416063,0.0005749697,0.7913576,0.004387273,0.0019356295,0.0014777575,0.0016359055,0.006151937,0.19227481],"genre_scores_gemma":[0.07412077,0.0096159885,0.038776834,0.0015325263,0.008433024,0.0000046508785,0.14735264,0.01937891,0.7007847],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961642,0.0002138546,0.0006513732,0.0011781867,0.0011565039,0.0006358854],"domain_scores_gemma":[0.99551594,0.00019956294,0.00048622477,0.0015234427,0.0019972501,0.0002776039],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0029929066,0.00027906222,0.00047077,0.0009277353,0.0019831762,0.0019206625,0.0034606766,0.00024699577,0.0025649385],"category_scores_gemma":[0.010315638,0.00026268195,0.00025260716,0.0030267895,0.0001415906,0.00034702706,0.0044411123,0.00050630386,0.00518756],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009025334,0.00006151111,0.0000015686273,0.00009616137,0.00021373681,0.00042011947,0.0001392641,0.00003295772,0.000018248007,0.0029371865,0.8542965,0.14177375],"study_design_scores_gemma":[0.0001949484,0.00011409495,0.00009803667,0.000057165507,0.00006816053,0.00070991286,0.000057096364,0.00092414033,0.000015101174,0.0006425034,0.9968076,0.00031126756],"about_ca_topic_score_codex":0.00006198566,"about_ca_topic_score_gemma":0.0000012011361,"teacher_disagreement_score":0.7525807,"about_ca_system_score_codex":0.00030768086,"about_ca_system_score_gemma":0.000037857248,"threshold_uncertainty_score":0.99998254},"labels":[],"label_agreement":null},{"id":"W6930331383","doi":"10.5281/zenodo.14187991","title":"LA GENEALOGIA DEI RUGGERI DI SAN PIER NICETO E SAPONARA","year":2024,"lang":"it","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Pier; Tree (set theory); Royal family","score_opus":0.0380812103210281,"score_gpt":0.26275191989081603,"score_spread":0.22467070956978794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930331383","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024286492,0.009502633,0.39874882,0.011459141,0.0018841558,0.0012526216,0.0029841268,0.0071615237,0.5427205],"genre_scores_gemma":[0.9841286,0.001251643,0.0011670191,0.00043727804,0.00053715875,8.277116e-8,0.0017279551,0.0011741179,0.009576122],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99553066,0.0010250554,0.0005183123,0.0012761769,0.00083372416,0.0008160447],"domain_scores_gemma":[0.9976372,0.00018955384,0.000110908266,0.0011699842,0.00042796854,0.0004643831],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0017413626,0.00033739518,0.00035199334,0.0008528271,0.0022020605,0.006061462,0.0036866646,0.00021892131,0.03998927],"category_scores_gemma":[0.00097201753,0.0003060899,0.00022624982,0.005025354,0.00044611696,0.00082475884,0.0052021695,0.00077700196,0.05300785],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024112238,0.00022870353,0.000007364122,0.00011402252,0.00022804663,0.0003699248,0.001184206,0.00011832227,0.0006315378,0.051145907,0.32381383,0.62213403],"study_design_scores_gemma":[0.00021464794,0.00031147036,0.0012907771,0.00006646446,0.00007343611,0.00026793123,0.00016816358,0.012472104,0.000083680214,0.0008237585,0.98384905,0.00037852876],"about_ca_topic_score_codex":0.000056080262,"about_ca_topic_score_gemma":5.9326914e-7,"teacher_disagreement_score":0.95984215,"about_ca_system_score_codex":0.00023163842,"about_ca_system_score_gemma":0.000016563272,"threshold_uncertainty_score":0.99993914},"labels":[],"label_agreement":null},{"id":"W6930419848","doi":"10.5281/zenodo.13755122","title":"Synchrony of water quality across mixed landscapes in Southern Ontario stream network","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Trent University","funders":"","keywords":"Water quality; STREAMS; Land use; Hydrology (agriculture); Quality (philosophy); Land cover","score_opus":0.03160754561500609,"score_gpt":0.26399272942419494,"score_spread":0.23238518380918885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930419848","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073053744,0.0014883036,0.027536595,0.0011374098,0.00070908084,0.00083445717,0.0024877782,0.0026826141,0.9558184],"genre_scores_gemma":[0.091661006,0.00014592992,0.0016276082,0.00010707831,0.00046552802,1.3171721e-7,0.0040735123,0.0038167476,0.89810246],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99784863,0.00031639214,0.0003617848,0.00061556976,0.000394855,0.00046276528],"domain_scores_gemma":[0.99888724,0.000021243692,0.00013245677,0.0007472012,0.000108192165,0.00010367397],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00096406764,0.00019109173,0.0003545488,0.00034779776,0.00023369543,0.0005704914,0.0019916447,0.00015591644,0.02372191],"category_scores_gemma":[0.00011434866,0.00012832129,0.0001039226,0.0010651603,0.000100862046,0.0000969746,0.0029796136,0.00034605653,0.01375222],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017300308,0.00017872742,0.00004101764,0.00016850818,0.00018643714,0.000044689263,0.0041392683,0.00013478297,0.000029463672,0.0028023538,0.929277,0.062980466],"study_design_scores_gemma":[0.0001882948,0.00007715344,0.00019922928,0.000071233786,0.000013731709,0.0000074633563,0.00019182803,0.00012646166,0.000014462614,0.00057706085,0.9983448,0.00018827562],"about_ca_topic_score_codex":0.007862388,"about_ca_topic_score_gemma":0.0023603775,"teacher_disagreement_score":0.08435564,"about_ca_system_score_codex":0.00010782051,"about_ca_system_score_gemma":0.000004675128,"threshold_uncertainty_score":0.99874437},"labels":[],"label_agreement":null},{"id":"W6930807152","doi":"10.5281/zenodo.16883660","title":"napari: a multi-dimensional image viewer for Python","year":2025,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Innovation Cluster (Canada)","funders":"","keywords":"Scripting language; Python (programming language); Focus (optics); Window (computing); Installation; Image editing; Feature (linguistics)","score_opus":0.034393146479173284,"score_gpt":0.26853709148925187,"score_spread":0.23414394501007857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930807152","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000017943113,0.00044106212,0.5852284,0.001121225,0.00024003927,0.00053429144,0.0011887002,0.0014925356,0.40975195],"genre_scores_gemma":[0.00026457154,0.0002722174,0.086376876,0.0009019031,0.00036295407,3.2948844e-7,0.0059123253,0.0034101254,0.9024987],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979249,0.00021196497,0.00026395137,0.0008065812,0.0003865832,0.00040601945],"domain_scores_gemma":[0.9982568,0.000059409555,0.0001719941,0.00088242686,0.00046577695,0.00016356507],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005266914,0.00023016788,0.00031346732,0.00083044055,0.0008994231,0.00083605706,0.0025907878,0.00016706629,0.02376458],"category_scores_gemma":[0.0011814459,0.00020503184,0.00015525772,0.0014383307,0.00013497539,0.00017292939,0.0028334355,0.00024726902,0.008478607],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000756324,0.00013017868,1.1003017e-7,0.000053679967,0.00008368143,0.0000085926995,0.000027167951,0.0000041592034,0.00007714092,0.012085661,0.90174025,0.08578184],"study_design_scores_gemma":[0.0004158908,0.0001002746,0.000020432042,0.000047689653,0.000030693795,0.000011787087,0.000008246039,0.0020412775,0.000032923283,0.00036761572,0.9966938,0.00022938529],"about_ca_topic_score_codex":0.000052603362,"about_ca_topic_score_gemma":0.0000010356474,"teacher_disagreement_score":0.49885154,"about_ca_system_score_codex":0.00007228327,"about_ca_system_score_gemma":0.000008935057,"threshold_uncertainty_score":0.9922934},"labels":[],"label_agreement":null},{"id":"W6948804608","doi":"10.5281/zenodo.10627623","title":"Simulated assemblies for \"Multi-genome synteny detection using minimizer graph mappings\"","year":2024,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada's Michael Smith Genome Sciences Centre","funders":"","keywords":"Synteny; Indel; Human genome; Genome; Graph; 1000 Genomes Project","score_opus":0.08191654489971602,"score_gpt":0.29111977824948254,"score_spread":0.20920323334976654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948804608","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000111939,0.00028769698,0.27311245,0.0002090608,0.00038497895,0.0005433718,0.7242743,0.00086108345,0.00021513735],"genre_scores_gemma":[0.0018264847,0.00026166317,0.0037771154,0.00017583385,0.0002525983,1.5679197e-7,0.9924788,0.0006541166,0.0005732343],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970589,0.00028321237,0.0004883959,0.0010872714,0.00051116874,0.0005710514],"domain_scores_gemma":[0.9976786,0.00008919961,0.00024821062,0.0010423898,0.0007257879,0.00021584757],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008455426,0.0003392384,0.00041005967,0.0016200993,0.0018496678,0.0027124402,0.0030851404,0.00026552196,0.0018140965],"category_scores_gemma":[0.0013328589,0.00031168843,0.00024668145,0.003438511,0.0001430515,0.00045539573,0.003187035,0.00050567946,0.008534727],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002533097,0.00014563135,4.8219203e-8,0.00021146538,0.00026204888,0.0000334915,0.00006423284,0.00041746162,0.00077188766,0.00015752367,0.97980917,0.01810172],"study_design_scores_gemma":[0.00029602813,0.00019384033,0.00001092783,0.000042856154,0.00013120963,0.00006315489,0.00004309868,0.023759471,0.000055519773,0.00021552992,0.97482526,0.00036311164],"about_ca_topic_score_codex":0.00010200942,"about_ca_topic_score_gemma":0.0000020279886,"teacher_disagreement_score":0.26933533,"about_ca_system_score_codex":0.00019260761,"about_ca_system_score_gemma":0.000007924374,"threshold_uncertainty_score":0.99993354},"labels":[],"label_agreement":null},{"id":"W6979381247","doi":"","title":"Interpreting Multipartite Entanglement through Topological Summaries","year":2025,"lang":"en","type":"article","venue":"ArXiv.org","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Office of Science; U.S. Department of Energy","keywords":"Multipartite entanglement; Quantum entanglement; Multipartite; Topology (electrical circuits); Generalization; Bipartite graph; Class (philosophy); State (computer science)","score_opus":0.036501425777765224,"score_gpt":0.3035043526815142,"score_spread":0.267002926903749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6979381247","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.659088,0.00059211603,0.3184164,0.009532507,0.0004985019,0.00011979466,0.000010318741,0.00027716983,0.01146522],"genre_scores_gemma":[0.987478,0.000062605664,0.0075920485,0.003198174,0.000037754155,0.000018227074,0.000011298953,0.0000022737086,0.0015995862],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99858665,0.00008826383,0.00031359462,0.0004871554,0.00017124022,0.0003530922],"domain_scores_gemma":[0.9989886,0.00028565887,0.00007189287,0.00054474705,0.00005181592,0.000057271667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002486115,0.00014566263,0.0002304973,0.00012041066,0.00020333553,0.00011948759,0.0009964916,0.00007272655,0.00026618072],"category_scores_gemma":[0.0004714178,0.00010478902,0.00012600339,0.0012412177,0.0001375098,0.00038388564,0.0011089308,0.00016000774,0.0002125479],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009593463,0.00015394487,0.8256605,0.000008474103,0.00009080753,0.000033451885,0.00029733632,0.000023282075,0.00025847656,0.14883097,0.0043210867,0.020312076],"study_design_scores_gemma":[0.0010127554,0.0004090764,0.45981258,0.00009684734,0.00010602793,0.000007196697,0.00077003054,0.007824083,0.0150004495,0.036990043,0.47719404,0.0007768869],"about_ca_topic_score_codex":0.00019021606,"about_ca_topic_score_gemma":0.000035688543,"teacher_disagreement_score":0.47287294,"about_ca_system_score_codex":0.000044449276,"about_ca_system_score_gemma":0.000020648898,"threshold_uncertainty_score":0.4273172},"labels":[],"label_agreement":null},{"id":"W6982199341","doi":"","title":"Hemodynamics of an anatomically realistic human aorta","year":2005,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"McGill University","keywords":"Hemodynamics; Disease; Ethnic group; Aorta; Blood pressure","score_opus":0.014640739445307386,"score_gpt":0.26622941298927183,"score_spread":0.25158867354396447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6982199341","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92946255,0.00015030951,0.00003461127,0.00002736796,0.0005306564,0.00034421438,0.0019724073,0.000385053,0.067092836],"genre_scores_gemma":[0.9816074,0.00012111246,0.009377491,0.00020426772,0.000058417038,0.000032506585,0.004184105,0.000072462906,0.004342241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946151,0.00034544215,0.0013987506,0.0016716361,0.0011985799,0.00077049504],"domain_scores_gemma":[0.99542856,0.00023430798,0.0010248523,0.0022355528,0.00054692273,0.00052980793],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009591918,0.0007350101,0.0011900868,0.0011591382,0.00074993615,0.00017911094,0.003980128,0.0008789137,0.00025239983],"category_scores_gemma":[0.0007144413,0.0007025855,0.0005320969,0.0025731472,0.00010728736,0.0013693334,0.00045188383,0.0012073329,0.00011461607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032969016,0.0005285315,0.000017939054,0.0001096056,0.00020637855,0.00008068521,0.000004423682,0.00011854857,0.004403374,0.73131907,0.0000059378403,0.26317257],"study_design_scores_gemma":[0.0043047,0.0027906224,0.035743885,0.00083395594,0.0023394157,0.00016539758,0.00046893588,0.019385735,0.04109502,0.8079408,0.075842,0.009089529],"about_ca_topic_score_codex":0.00086107966,"about_ca_topic_score_gemma":0.005062941,"teacher_disagreement_score":0.25408304,"about_ca_system_score_codex":0.00035882942,"about_ca_system_score_gemma":0.00006152978,"threshold_uncertainty_score":0.99954253},"labels":[],"label_agreement":null},{"id":"W6983431702","doi":"","title":"Miniatures inuit et variations d'échelles","year":2010,"lang":"fr","type":"book-chapter","venue":"Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B))","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"","score_opus":0.015465466949692893,"score_gpt":0.21564969462493994,"score_spread":0.20018422767524705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6983431702","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05996874,0.0037594207,0.083781056,0.076250315,0.0012672878,0.0028397043,0.005988893,0.0012421361,0.7649025],"genre_scores_gemma":[0.42773765,0.0052476414,0.011020957,0.008130879,0.0005810826,0.00001517977,0.0014774764,0.0002921227,0.545497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99247056,0.0006321942,0.00088208145,0.0026429906,0.0012905684,0.0020816133],"domain_scores_gemma":[0.99111843,0.002563003,0.0012294794,0.0023751713,0.000786509,0.0019273789],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity"],"category_scores_codex":[0.0010768066,0.0019214858,0.0020583826,0.003050885,0.003875147,0.0046781646,0.008317625,0.0020976365,0.0025349662],"category_scores_gemma":[0.00057183136,0.0018770271,0.0014164872,0.0033970878,0.0033058973,0.0034440432,0.013534154,0.0028011191,0.00039759572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012143065,0.00023599924,0.00095003634,0.000117387855,0.001239493,0.0024152186,0.049841393,0.00034190578,0.00006635088,0.9229267,0.0024324795,0.018218705],"study_design_scores_gemma":[0.0033530935,0.00042288413,0.0061651184,0.00026310844,0.0013844944,0.00064027566,0.0013086493,0.002179612,0.00012108418,0.053995628,0.92781335,0.0023527052],"about_ca_topic_score_codex":0.0033581778,"about_ca_topic_score_gemma":0.0013510016,"teacher_disagreement_score":0.9253809,"about_ca_system_score_codex":0.0021328607,"about_ca_system_score_gemma":0.0013523337,"threshold_uncertainty_score":0.99949944},"labels":[],"label_agreement":null},{"id":"W6988376537","doi":"","title":"Про число бондів непланарних 3-реберно зв’язних графів","year":2023,"lang":"uk","type":"dissertation","venue":"Electronic Institutional Repository of the National Aviation University of Ukraine (National Aviation University, Ukraine)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Graph; Graph theory; Calculus (dental); Directed graph","score_opus":0.015349240691983507,"score_gpt":0.2249535414864343,"score_spread":0.20960430079445078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6988376537","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5865378,0.0029331034,0.14808294,0.04417609,0.01416778,0.0083979275,0.01120255,0.0019046246,0.18259722],"genre_scores_gemma":[0.94799984,0.00056956016,0.0012803181,0.00021143386,0.0005113203,0.0000024645583,0.0042041233,0.00003896282,0.045181975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.98942524,0.0007012625,0.0013795896,0.0015730758,0.006053844,0.0008670109],"domain_scores_gemma":[0.9865651,0.0012227378,0.003409875,0.00065260264,0.007860224,0.00028943233],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0019767394,0.00083280215,0.0010475199,0.0030440718,0.0032063595,0.00012675652,0.003727296,0.0009099484,0.00033053724],"category_scores_gemma":[0.0015838918,0.00091300183,0.0013871023,0.0072014118,0.001105743,0.001890363,0.0009516776,0.0012223624,0.00021321508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.0006632841,0.0012639327,0.0015423935,0.00029786685,0.0018975183,0.000041780233,0.0020344688,0.042963594,0.0030859767,0.9382535,0.0066801226,0.0012755444],"study_design_scores_gemma":[0.014326081,0.00156552,0.49753192,0.0014801082,0.0031504226,0.000290724,0.004437039,0.12694593,0.0041190227,0.12148605,0.2195232,0.0051439838],"about_ca_topic_score_codex":0.0019771173,"about_ca_topic_score_gemma":0.00089107757,"teacher_disagreement_score":0.81676745,"about_ca_system_score_codex":0.00450958,"about_ca_system_score_gemma":0.008830251,"threshold_uncertainty_score":0.9993321},"labels":[],"label_agreement":null},{"id":"W7006079613","doi":"","title":"Sorting Algorithms on Manifolds","year":2025,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"McGill University","keywords":"Probabilistic logic; Grid; Sorting; Time complexity; Tree (set theory); Sorting algorithm; Sequence (biology); Probabilistic analysis of algorithms","score_opus":0.02171053714656779,"score_gpt":0.25822125842694943,"score_spread":0.23651072128038164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7006079613","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19744001,0.0008790239,0.00021238001,0.00025514062,0.0065204096,0.0010593701,0.0019333375,0.0019414213,0.7897589],"genre_scores_gemma":[0.8536623,0.0005727131,0.014667587,0.0021628952,0.00018039547,0.00022018891,0.0025831177,0.00012496838,0.1258258],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9941343,0.00031165607,0.0011236959,0.0020653373,0.001272343,0.0010926711],"domain_scores_gemma":[0.99618,0.00054317276,0.0007236409,0.0018133322,0.0003726258,0.00036724418],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011615462,0.00085176295,0.0010083024,0.0015041536,0.0014741373,0.00037335846,0.0034334646,0.00088608335,0.00028795892],"category_scores_gemma":[0.0014243941,0.00077523704,0.00068256026,0.0038761138,0.0000319816,0.00093021954,0.0007181084,0.0016662761,0.0009340422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019090952,0.00017322923,0.0000057515254,0.00007487157,0.00018504434,0.0001247348,0.0000019388901,0.00003553847,0.00031039957,0.42292395,0.0000279687,0.57611746],"study_design_scores_gemma":[0.0023200791,0.0012247971,0.0046046167,0.0014570801,0.0010653782,0.00005516881,0.00037516002,0.0033680773,0.057461895,0.45161146,0.47060695,0.005849314],"about_ca_topic_score_codex":0.00038809964,"about_ca_topic_score_gemma":0.00037672726,"teacher_disagreement_score":0.6639331,"about_ca_system_score_codex":0.00041555363,"about_ca_system_score_gemma":0.00006642783,"threshold_uncertainty_score":0.99984384},"labels":[],"label_agreement":null},{"id":"W7016291873","doi":"","title":"When Beruriah Met 'A'isha: Textual Intersections and Interactions Among Jewish and Muslim Women Engaged with Religious Law","year":2013,"lang":"en","type":"dissertation","venue":"TSpace (University of Toronto)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Social Sciences and Humanities Research Council of Canada; University of Toronto","keywords":"Judaism; Islam; Interpretation (philosophy); Ethnography; Religious law; Sociology of religion","score_opus":0.009676768136154128,"score_gpt":0.217253241693547,"score_spread":0.2075764735573929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7016291873","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9655017,0.00048393107,0.0048252763,0.000330599,0.000152563,0.00023169554,0.00004396716,0.00011597801,0.028314274],"genre_scores_gemma":[0.9811472,0.00043612692,0.0035412125,0.000028087903,0.000021812713,0.0000024524163,0.00010022636,0.000007962046,0.01471488],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9987394,0.00016371877,0.00011933984,0.0005248672,0.0002094503,0.00024317647],"domain_scores_gemma":[0.9987627,0.00022967793,0.0002606124,0.00039617866,0.00015250001,0.0001983303],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020948268,0.00021796089,0.00041617337,0.0001836367,0.00052920164,0.00012384212,0.00051749015,0.00015399797,0.0017256083],"category_scores_gemma":[0.000051789095,0.00021311079,0.00007834888,0.00021786374,0.00020897973,0.0014077732,0.0002671317,0.00038484065,0.0000076077827],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027067694,0.0005300549,0.0018401205,0.00028501722,0.0028285761,0.00013430027,0.7055014,0.000022192251,0.00037653575,0.014063656,0.015066829,0.25908068],"study_design_scores_gemma":[0.0015136828,0.0012267276,0.20798407,0.00019524357,0.0006252448,0.00003394017,0.7793537,0.0017863202,0.00003326998,0.00077836943,0.005460678,0.0010087951],"about_ca_topic_score_codex":0.1827175,"about_ca_topic_score_gemma":0.35963723,"teacher_disagreement_score":0.2580719,"about_ca_system_score_codex":0.00016906223,"about_ca_system_score_gemma":0.000031352283,"threshold_uncertainty_score":0.99918693},"labels":[],"label_agreement":null},{"id":"W7020945005","doi":"","title":"Long period return level estimates of extreme precipitation","year":2020,"lang":"en","type":"other","venue":"University Library (University of Saskatchewan)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Precipitation; Return period; Period (music); Climate change","score_opus":0.02218066960572724,"score_gpt":0.18127751176517917,"score_spread":0.15909684215945194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7020945005","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031433562,0.00092434866,0.7701446,0.005468253,0.00035954497,0.00056895014,0.0027127003,0.0012490809,0.21542919],"genre_scores_gemma":[0.0666464,0.0003759736,0.2514899,0.00006697747,0.000064509404,2.879583e-8,0.0005516897,0.00007336567,0.6807312],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986706,0.000084863736,0.00013546972,0.00056149944,0.00033576792,0.00021179185],"domain_scores_gemma":[0.9986584,0.00008853479,0.00047156413,0.00056331954,0.000040237843,0.00017792058],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000048387225,0.00024177806,0.00058236683,0.0008607626,0.00010388829,0.000026808304,0.0021752445,0.0002955306,0.0037172586],"category_scores_gemma":[0.000016949969,0.00029075617,0.00029010753,0.0018165613,0.0003097253,0.001248532,0.0012443196,0.00020853737,0.000060931958],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048289608,0.0011577506,0.0445277,0.0017096882,0.003322562,0.0028013715,0.06140449,0.000090692854,0.00041993486,0.013486139,0.7871922,0.083404556],"study_design_scores_gemma":[0.0049929256,0.0013062872,0.041090444,0.0011494335,0.0017425698,0.000028855153,0.12768188,0.009027703,0.00094276265,0.004687957,0.80387306,0.0034761056],"about_ca_topic_score_codex":0.0017117425,"about_ca_topic_score_gemma":0.000571066,"teacher_disagreement_score":0.51865464,"about_ca_system_score_codex":0.000027266722,"about_ca_system_score_gemma":0.00020201491,"threshold_uncertainty_score":0.99995446},"labels":[],"label_agreement":null},{"id":"W7021110726","doi":"","title":"Multicentric osteolysis with nodulosis, arthritis, and cardiac defect syndrome: loss of MMP2 leads to increased apoptosis with alteration of apoptotic regulators and caspases and embryonic lethality","year":2014,"lang":"en","type":"other","venue":"Dove Medical Press (Taylor and Francis Group)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"MMP2; Apoptosis; Matrix metalloproteinase; Embryonic stem cell; Osteolysis; Caspase; Phenotype; Caspase 8","score_opus":0.004989951751962419,"score_gpt":0.20640604382960984,"score_spread":0.2014160920776474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7021110726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3454443,0.03370147,0.6185453,0.00029337904,0.0001442442,0.00090390485,0.00046276615,0.00009430519,0.00041036532],"genre_scores_gemma":[0.99720603,0.00039283116,0.002049345,0.00009648547,0.000058153088,0.000039206094,0.00006379489,0.000044128912,0.00005000973],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99700475,0.00035157628,0.00046306613,0.00097293983,0.0008472567,0.00036042868],"domain_scores_gemma":[0.9977116,0.00064737035,0.00035566953,0.00063194946,0.000086292624,0.0005670966],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076253794,0.00042547635,0.0013808049,0.00047504404,0.000087276225,0.00009849804,0.00035076585,0.0003251461,0.000069908296],"category_scores_gemma":[0.00044885377,0.00028391316,0.00010112951,0.00084300997,0.00077591627,0.00016490536,0.00037169916,0.00024805136,0.0000010620832],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046463512,0.0005836761,0.11914887,0.0030260088,0.0021281068,0.00012388514,0.0005013651,0.000028455068,0.00015991807,0.0031296383,0.00040979823,0.87029564],"study_design_scores_gemma":[0.038589153,0.021869998,0.6795793,0.0034309223,0.015307399,0.0016163383,0.0006070307,0.21039583,0.0059615523,0.0010402438,0.01027007,0.011332127],"about_ca_topic_score_codex":0.0028996149,"about_ca_topic_score_gemma":0.00028260096,"teacher_disagreement_score":0.8589635,"about_ca_system_score_codex":0.000012646558,"about_ca_system_score_gemma":0.000005040404,"threshold_uncertainty_score":0.9999613},"labels":[],"label_agreement":null},{"id":"W7022649450","doi":"","title":"Canonical Maps","year":2017,"lang":"en","type":"article","venue":"PhilPapers (PhilPapers Foundation)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Categorical variable; Element (criminal law); Identification (biology); State (computer science); Category theory; Algebra over a field; Point (geometry)","score_opus":0.025876450349324752,"score_gpt":0.27816891357360973,"score_spread":0.252292463224285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7022649450","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06510695,0.00049567554,0.06728016,0.20376433,0.0048339902,0.00096950296,0.0000775009,0.001712291,0.6557596],"genre_scores_gemma":[0.9859134,0.00014617683,0.008295618,0.001975462,0.00033292087,0.000032606633,0.00007773337,0.000015722653,0.003210389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973717,0.000079047444,0.00041743903,0.0008998061,0.0006401543,0.00059189746],"domain_scores_gemma":[0.9965618,0.00018036454,0.00032602117,0.002469108,0.0001477143,0.00031498336],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00048672815,0.00029895626,0.00037761894,0.0002524328,0.0019485463,0.001497726,0.0038002757,0.00014005546,0.0011066631],"category_scores_gemma":[0.0008598738,0.00024881194,0.00022082684,0.0005454689,0.00044987872,0.0021923324,0.00087727624,0.00028149746,0.0021176285],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014861602,0.00016517514,0.004604944,0.000009730714,0.00017492942,0.00006190556,0.00015898839,0.000024280824,0.0006501716,0.6524143,0.00234544,0.3393753],"study_design_scores_gemma":[0.0017936873,0.00024474185,0.12523478,0.000027886155,0.00013983774,0.00008148648,0.000073554176,0.0020305216,0.0006066199,0.08615743,0.7822122,0.001397261],"about_ca_topic_score_codex":0.00032447252,"about_ca_topic_score_gemma":0.00015885882,"teacher_disagreement_score":0.9208064,"about_ca_system_score_codex":0.00011856232,"about_ca_system_score_gemma":0.00013311442,"threshold_uncertainty_score":0.9999964},"labels":[],"label_agreement":null},{"id":"W7025097355","doi":"","title":"Topics in higher dimensional algebra","year":2019,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"McGill University","keywords":"Convex hull; Homotopy; Dimension (graph theory); Regular polygon; Algebra over a field; Curvature; Entropy (arrow of time)","score_opus":0.022884890933191383,"score_gpt":0.24323898079760656,"score_spread":0.22035408986441518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7025097355","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8467188,0.0009920363,0.000006207944,0.0005648798,0.006571046,0.0007261444,0.0007626797,0.00049415714,0.14316405],"genre_scores_gemma":[0.8805907,0.0001527614,0.0038472768,0.0018004706,0.00010116505,0.00007291331,0.0015136765,0.00007360759,0.11184746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.995496,0.000263975,0.0008567476,0.0015494626,0.0010655095,0.00076830934],"domain_scores_gemma":[0.99740124,0.00030128562,0.000409308,0.0013856861,0.00022893291,0.00027353925],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00064616854,0.0006225089,0.00087644754,0.0010307202,0.00035862435,0.0001706151,0.0023169266,0.0008247656,0.0010735826],"category_scores_gemma":[0.00036147868,0.00055631675,0.0004071524,0.0026777745,0.00003643179,0.0010974642,0.0005858635,0.0013904902,0.0015471065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003654148,0.00030697428,0.00012815565,0.00008817611,0.00014483831,0.00018550454,0.0000036826748,0.00007542819,0.0007459656,0.74467546,0.000052745796,0.25355652],"study_design_scores_gemma":[0.0021238152,0.0004457124,0.04794683,0.00040853673,0.0002508246,0.000030869436,0.000064055654,0.0007457994,0.0072103757,0.22192286,0.71547645,0.0033738716],"about_ca_topic_score_codex":0.00034289237,"about_ca_topic_score_gemma":0.00039776973,"teacher_disagreement_score":0.7154237,"about_ca_system_score_codex":0.0003499538,"about_ca_system_score_gemma":0.000053592088,"threshold_uncertainty_score":0.99983954},"labels":[],"label_agreement":null},{"id":"W7025215182","doi":"","title":"Vers une politique jeunesse! : éléments de réflexion en vue du Sommet du Québec et de la jeunesse /","year":2000,"lang":"fr","type":"other","venue":"Bibliothèque et Archives nationales du Québec (Québec government)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Context (archaeology); Politics; Relation (database)","score_opus":0.008370767029108522,"score_gpt":0.24107674826090789,"score_spread":0.23270598123179936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7025215182","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06287745,0.0073611913,0.06079046,0.24581508,0.00045780477,0.00095201924,0.001498267,0.0005770454,0.6196707],"genre_scores_gemma":[0.6959084,0.01489166,0.0053307735,0.014737035,0.0013371994,0.00036877475,0.0002378406,0.00033397967,0.2668543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9910364,0.0027018394,0.001257518,0.0017861425,0.0018641473,0.001353929],"domain_scores_gemma":[0.9743136,0.022501916,0.0010088681,0.0012280693,0.00010198972,0.00084554224],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.0015819147,0.0012756535,0.0012264771,0.0027900434,0.0005806055,0.0014176593,0.0037174919,0.00056357123,0.020666966],"category_scores_gemma":[0.0053611347,0.0012071303,0.0008700265,0.0041390886,0.0012305395,0.0014473824,0.0015781923,0.0012575698,0.0012323464],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.00041787443,0.0034042909,0.124035195,0.00037302292,0.0017346235,0.00060466223,0.017653173,0.0033170995,0.00036680102,0.603449,0.2391404,0.0055038915],"study_design_scores_gemma":[0.0014218175,0.00023169302,0.15294178,0.0002742758,0.00027171875,0.0002620466,0.00021165166,0.0034145033,0.00014825103,0.0051118284,0.8345734,0.0011370378],"about_ca_topic_score_codex":0.88823724,"about_ca_topic_score_gemma":0.9734897,"teacher_disagreement_score":0.633031,"about_ca_system_score_codex":0.012479096,"about_ca_system_score_gemma":0.08941467,"threshold_uncertainty_score":0.9999995},"labels":[],"label_agreement":null},{"id":"W7025487902","doi":"","title":"Visuomotor adaptation to a small mirror reversal perturbation","year":2023,"lang":"en","type":"article","venue":"","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Ottawa","funders":"","keywords":"Cursor (databases); Visual feedback; Adaptation (eye); Motor control; Visual perception; Perturbation (astronomy); Movement (music)","score_opus":0.05485781718206285,"score_gpt":0.2676966949350037,"score_spread":0.21283887775294086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7025487902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05997161,0.000006758282,0.927464,0.00973365,0.00017347923,0.00011018947,0.0000046486853,0.0004874291,0.0020482508],"genre_scores_gemma":[0.74885803,0.00001423062,0.19155061,0.0028897447,0.000059568094,0.000041489126,0.000057057416,0.000005927168,0.056523338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925035,0.000027787308,0.000117732394,0.000270668,0.00016952859,0.00016396037],"domain_scores_gemma":[0.99947584,0.00009771317,0.00002386052,0.00025470974,0.000053394026,0.000094461546],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020614114,0.00005982443,0.000080995545,0.00034226786,0.0000635619,0.00008946247,0.00042083353,0.000030703355,0.0001338406],"category_scores_gemma":[0.0002468019,0.00004412575,0.00004734932,0.0032156275,0.000007033328,0.00020490937,0.0001910354,0.000033400604,0.0023237136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023772156,0.0001775499,0.0009131097,0.00001692006,0.000081370024,0.00006094121,0.0032002793,0.00083494803,0.0047378535,0.29400158,0.044491343,0.65146035],"study_design_scores_gemma":[0.00049791706,0.00056999,0.12030086,0.000011818441,0.000030202014,0.000005977055,0.0006323787,0.73631245,0.0013225392,0.023016328,0.11668579,0.0006137531],"about_ca_topic_score_codex":0.00028853843,"about_ca_topic_score_gemma":0.000068003705,"teacher_disagreement_score":0.7359134,"about_ca_system_score_codex":0.000018076988,"about_ca_system_score_gemma":0.000012956141,"threshold_uncertainty_score":0.9984531},"labels":[],"label_agreement":null},{"id":"W7028466721","doi":"","title":"ERIC ED466494: The Learning Equation (TLE) Final Report.","year":2002,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Remedial education; Curriculum; Product (mathematics); Academic achievement; Mastery learning; Problem-based learning","score_opus":0.01797488538927789,"score_gpt":0.20111148229859982,"score_spread":0.18313659690932194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7028466721","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004012031,0.00043473713,0.000558557,0.0006908515,0.00023762896,0.00018406619,0.000017958342,0.00022983947,0.99764234],"genre_scores_gemma":[0.00040470468,0.00033678478,0.0032362163,0.00022551128,0.00015175871,0.000011093209,0.00013563689,0.00002970183,0.9954686],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979994,0.00013162561,0.00065635156,0.00029059034,0.00063299877,0.00028898928],"domain_scores_gemma":[0.9979124,0.00022505093,0.00095726183,0.0006916062,0.00013060935,0.000083053485],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00045463262,0.00026302325,0.00035215076,0.00015556895,0.0001426379,0.00015981814,0.0010139674,0.0002642441,0.27924502],"category_scores_gemma":[0.00055724493,0.0001845793,0.0002013677,0.00006621075,0.00011399816,6.1527743e-7,0.0002842478,0.0003754091,0.01412088],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036025624,0.000026080475,0.0000026219209,0.000046695684,0.0000404865,0.000050432805,0.00004832455,0.001170725,2.2874483e-8,0.00020551337,0.98666775,0.011737734],"study_design_scores_gemma":[0.00015349947,0.00008729693,0.000017104385,0.000047167137,0.00004241754,0.00016786289,0.000023864051,0.0016421663,8.5595127e-7,0.000039585793,0.9975515,0.00022668252],"about_ca_topic_score_codex":0.002592086,"about_ca_topic_score_gemma":0.00012973709,"teacher_disagreement_score":0.26512414,"about_ca_system_score_codex":0.000031727035,"about_ca_system_score_gemma":0.000017633225,"threshold_uncertainty_score":0.9866467},"labels":[],"label_agreement":null},{"id":"W7028975089","doi":"","title":"High-dimensional graphical models for noisy data","year":2023,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Estimator; Covariance; Covariance matrix; Estimation of covariance matrices; Bounded function; Consistency (knowledge bases); Multiplicative function; Lasso (programming language); Observational error; Missing data","score_opus":0.050429614250805714,"score_gpt":0.27769265866184817,"score_spread":0.22726304441104245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7028975089","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80629754,0.0025287776,0.00439124,0.0019059954,0.027277814,0.0063385745,0.12128007,0.008276879,0.021703145],"genre_scores_gemma":[0.825109,0.0006154932,0.07112029,0.0015122368,0.00034530822,0.0005692455,0.07275535,0.000344389,0.027628673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99306536,0.00024854217,0.0011332006,0.002956355,0.0015258475,0.0010707127],"domain_scores_gemma":[0.9937055,0.0010758524,0.0005699368,0.0035546122,0.0005644902,0.00052961055],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017314047,0.0008258323,0.0011493171,0.0013223746,0.0013146324,0.0003022746,0.006673662,0.0009874809,0.00010392163],"category_scores_gemma":[0.0016165702,0.0007365983,0.0005846259,0.0039377604,0.000080647485,0.0022868176,0.0019809543,0.0012795684,0.00054158736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089377194,0.00027528673,0.0000019248569,0.00012042789,0.00046307937,0.000093559436,0.0000018649117,0.0007547548,0.0005250381,0.8030969,0.00041972075,0.19415809],"study_design_scores_gemma":[0.0013201033,0.00033371325,0.000581629,0.00018045392,0.00058006065,0.000022456317,0.000039644114,0.038176443,0.0018003011,0.9075224,0.047400296,0.0020425252],"about_ca_topic_score_codex":0.00073410495,"about_ca_topic_score_gemma":0.0011538718,"teacher_disagreement_score":0.19211556,"about_ca_system_score_codex":0.00016967731,"about_ca_system_score_gemma":0.00008395845,"threshold_uncertainty_score":0.9999855},"labels":[],"label_agreement":null},{"id":"W7039916395","doi":"","title":"A Multiple Perspective Study of Specific Language Impairment and Verbal Communication: Exploring Perceptions of Collaborative Learning","year":2021,"lang":"en","type":"dissertation","venue":"QSpace (Queen's University Library)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Queen's University","funders":"","keywords":"Perspective (graphical); Perception; Point (geometry); Government (linguistics); Qualitative research","score_opus":0.012264464057977842,"score_gpt":0.22346337925733414,"score_spread":0.2111989151993563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7039916395","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9951513,0.00037429904,0.0006298675,0.0012931632,0.0000568777,0.00028805315,0.00006346383,0.000081196544,0.0020617936],"genre_scores_gemma":[0.9819714,0.001670928,0.0040004035,0.0000037230332,0.000012832526,0.000003005323,0.00028279322,0.000008977319,0.012045962],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99853665,0.00038405656,0.00018681736,0.00046122816,0.00028409,0.00014717654],"domain_scores_gemma":[0.99855626,0.00025112057,0.00031108598,0.00056555175,0.00022937011,0.00008659095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000059868387,0.0001892963,0.00044212866,0.00056004355,0.00023813942,0.00007289598,0.0007188446,0.00009698126,0.00016033203],"category_scores_gemma":[0.000049070324,0.00019830943,0.00010723473,0.002452549,0.00007867615,0.0011427875,0.0005863961,0.00032580763,0.0000027263327],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059016625,0.0049906867,0.11806126,0.0002932251,0.0019096729,0.00045035826,0.8259996,0.0010691754,0.0001693929,0.033112675,0.00837685,0.0049769413],"study_design_scores_gemma":[0.0006321276,0.00050641224,0.106302544,0.0000771513,0.00009616925,1.8398951e-7,0.8902998,0.000043069,0.00036837521,0.00004505272,0.0013972739,0.00023186031],"about_ca_topic_score_codex":0.005433141,"about_ca_topic_score_gemma":0.00036728484,"teacher_disagreement_score":0.06430018,"about_ca_system_score_codex":0.00007629415,"about_ca_system_score_gemma":0.00011108855,"threshold_uncertainty_score":0.821332},"labels":[],"label_agreement":null},{"id":"W7069355261","doi":"","title":"Canonical Maps","year":2017,"lang":"en","type":"article","venue":"PhilPapers (PhilPapers Foundation)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Categorical variable; Element (criminal law); Identification (biology); State (computer science); Category theory; Algebra over a field; Point (geometry)","score_opus":0.025876450349324752,"score_gpt":0.27816891357360973,"score_spread":0.252292463224285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7069355261","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06510695,0.00049567554,0.06728016,0.20376433,0.0048339902,0.00096950296,0.0000775009,0.001712291,0.6557596],"genre_scores_gemma":[0.9859134,0.00014617683,0.008295618,0.001975462,0.00033292087,0.000032606633,0.00007773337,0.000015722653,0.003210389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973717,0.000079047444,0.00041743903,0.0008998061,0.0006401543,0.00059189746],"domain_scores_gemma":[0.9965618,0.00018036454,0.00032602117,0.002469108,0.0001477143,0.00031498336],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00048672815,0.00029895626,0.00037761894,0.0002524328,0.0019485463,0.001497726,0.0038002757,0.00014005546,0.0011066631],"category_scores_gemma":[0.0008598738,0.00024881194,0.00022082684,0.0005454689,0.00044987872,0.0021923324,0.00087727624,0.00028149746,0.0021176285],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014861602,0.00016517514,0.004604944,0.000009730714,0.00017492942,0.00006190556,0.00015898839,0.000024280824,0.0006501716,0.6524143,0.00234544,0.3393753],"study_design_scores_gemma":[0.0017936873,0.00024474185,0.12523478,0.000027886155,0.00013983774,0.00008148648,0.000073554176,0.0020305216,0.0006066199,0.08615743,0.7822122,0.001397261],"about_ca_topic_score_codex":0.00032447252,"about_ca_topic_score_gemma":0.00015885882,"teacher_disagreement_score":0.9208064,"about_ca_system_score_codex":0.00011856232,"about_ca_system_score_gemma":0.00013311442,"threshold_uncertainty_score":0.9999964},"labels":[],"label_agreement":null},{"id":"W7070878820","doi":"","title":"On the scale-dependence of the predictability of precipitation patterns by numerical weather prediction models","year":2015,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Oceanic and Atmospheric Administration; Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Predictability; Quantitative precipitation forecast; Precipitation; Forecast skill; Quantitative precipitation estimation; Numerical weather prediction; Mesoscale meteorology; Forcing (mathematics)","score_opus":0.019385626358324682,"score_gpt":0.23692521936642888,"score_spread":0.2175395930081042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7070878820","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9825521,0.00015104724,0.0007227841,0.000112578826,0.0008661537,0.0008123567,0.005252684,0.00012600196,0.009404282],"genre_scores_gemma":[0.9980067,0.00005989729,0.00030857424,0.000090174784,0.000016452557,0.000095134485,0.0003004282,0.000028923987,0.0010937036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99477553,0.00088185235,0.0010278982,0.0009956432,0.0019328997,0.0003861941],"domain_scores_gemma":[0.99551994,0.00075406785,0.0010486128,0.0017929806,0.00071338227,0.000171023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017717488,0.00044581987,0.0006305425,0.00022660758,0.00041533465,0.000059681002,0.002825591,0.0004950374,0.000112925205],"category_scores_gemma":[0.0014677146,0.00026402282,0.00043820756,0.0017484132,0.0001273315,0.00087352924,0.00038748313,0.00096800865,0.000021635122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007819608,0.0045001926,0.004809267,0.00076818076,0.0013289797,0.000007686278,0.0004416382,0.009248515,0.014648809,0.5325806,0.00063620263,0.43024793],"study_design_scores_gemma":[0.0016168484,0.0018546254,0.04940565,0.0010057543,0.0009302645,0.000014518621,0.00086362025,0.033590905,0.078465946,0.827647,0.002918737,0.0016861386],"about_ca_topic_score_codex":0.00061948615,"about_ca_topic_score_gemma":0.00020676115,"teacher_disagreement_score":0.42856178,"about_ca_system_score_codex":0.00026403574,"about_ca_system_score_gemma":0.000064083615,"threshold_uncertainty_score":0.9999812},"labels":[],"label_agreement":null},{"id":"W7071775308","doi":"","title":"Vanishing of the second L2-Betti number for (p, q, r)-complexes","year":2020,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Property (philosophy); Energy (signal processing); Sequence (biology); Intersection (aeronautics)","score_opus":0.0219378341851656,"score_gpt":0.2519652334747049,"score_spread":0.2300273992895393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7071775308","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81094325,0.0005765727,0.0002763045,0.0005909407,0.004753777,0.0021572018,0.00996583,0.0006716028,0.17006454],"genre_scores_gemma":[0.97082627,0.00004038389,0.010511526,0.001066371,0.00008662122,0.000120269375,0.00073634426,0.00007920682,0.016533013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99589205,0.00027211962,0.00100543,0.0012963167,0.00089840917,0.0006356837],"domain_scores_gemma":[0.996305,0.0007093748,0.0009493496,0.001362139,0.00041198143,0.00026215584],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007143929,0.0005936721,0.0009692919,0.00024178914,0.0009864888,0.00022870176,0.0040914803,0.0005159867,0.0006613966],"category_scores_gemma":[0.0013728404,0.00044732034,0.00094688404,0.0023852147,0.00007665437,0.0010270345,0.00069811364,0.0010163015,0.00016475913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006947266,0.00022593228,0.00010004125,0.00060015294,0.0005712961,0.000017559421,0.000030186584,0.000016603248,0.014087681,0.8460936,0.00025655937,0.1379309],"study_design_scores_gemma":[0.0009209793,0.00020846011,0.0028776368,0.00021098173,0.00040191266,0.00001904053,0.00022077304,0.00036416773,0.14775573,0.2342651,0.6113955,0.0013597169],"about_ca_topic_score_codex":0.00012379643,"about_ca_topic_score_gemma":0.0006840381,"teacher_disagreement_score":0.6118285,"about_ca_system_score_codex":0.00015001345,"about_ca_system_score_gemma":0.000058008634,"threshold_uncertainty_score":0.9997979},"labels":[],"label_agreement":null},{"id":"W7096559614","doi":"","title":"Author manuscript, published in &amp;quot;17th Canadian Conference on Computational Geometry- CCCG&amp;apos;2005 (2005)&amp;quot; An Experimental Assessment of the 2D Visibility Complex","year":2005,"lang":"en","type":"article","venue":"","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Asymptote; Visibility; Disjoint sets; Notice; Range (aeronautics); Function (biology); Plane (geometry)","score_opus":0.18759750287943236,"score_gpt":0.38931378521366,"score_spread":0.20171628233422764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096559614","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.795917,0.00009629249,0.15708753,0.028395753,0.0005957704,0.00088362186,0.0005272249,0.00021382142,0.016283015],"genre_scores_gemma":[0.90385157,0.0000028955053,0.08916298,0.0023406933,0.000076523196,0.00002639084,0.00041453482,0.000011203124,0.004113186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9949431,0.0004884937,0.001018163,0.0012509,0.0012665933,0.0010327771],"domain_scores_gemma":[0.9965605,0.0002605479,0.0003143204,0.0018217512,0.00026534268,0.000777538],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016883473,0.0004239942,0.0006446621,0.0011865014,0.00034853647,0.0006297452,0.002885013,0.00019498453,0.008633384],"category_scores_gemma":[0.00023305588,0.00029935644,0.00022918396,0.002738471,0.0003198355,0.0012578386,0.000649625,0.0005022292,0.00014303578],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010102149,0.010270541,0.11063734,0.000061874125,0.00041769422,0.000023281209,0.0029300936,0.044733364,0.0027363603,0.6058173,0.18012533,0.04214579],"study_design_scores_gemma":[0.0017869733,0.00028438485,0.6377863,0.000032370077,0.000036804777,0.000025041845,0.00047738143,0.13597526,0.0002999653,0.0074663293,0.21472071,0.0011084271],"about_ca_topic_score_codex":0.053223986,"about_ca_topic_score_gemma":0.38492224,"teacher_disagreement_score":0.598351,"about_ca_system_score_codex":0.00083469826,"about_ca_system_score_gemma":0.00069330883,"threshold_uncertainty_score":0.9999459},"labels":[],"label_agreement":null},{"id":"W7098205207","doi":"","title":"A NEW COMPARISON METHOD FOR STABILITY THEORY OF DIFFERENTIAL SYSTEMS WITH TIME-VARYING DELAYS Int. J. Bifurcation Chaos 2008.18:169-186. Downloaded from www.worldscientific.com by UNIVERSITY OF WESTERN ONTARIO WESTERN LIBRARIES on 07/25/12. For personal u","year":2006,"lang":"en","type":"article","venue":"","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Equilibrium point; Exponential stability; Convergence (economics); Stability (learning theory); Differential equation; Differential (mechanical device); Polynomial chaos; Polynomial; CHAOS (operating system); Bifurcation","score_opus":0.03134000163170345,"score_gpt":0.23352799879537933,"score_spread":0.2021879971636759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7098205207","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12636915,0.00009906385,0.87173253,0.00022223897,0.000107504704,0.0005560919,0.00067110156,0.000065153,0.00017719237],"genre_scores_gemma":[0.9326098,0.0000020110272,0.056417707,0.000031493357,0.000054452572,0.000010842247,0.000922419,0.000010869293,0.009940426],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976937,0.00023035362,0.00050626893,0.000780389,0.00046213774,0.0003271278],"domain_scores_gemma":[0.9975426,0.0011418354,0.00047903127,0.000519486,0.00018852136,0.00012851265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052624324,0.00026023787,0.00070687523,0.0002651773,0.00021816243,0.00020256918,0.00090943504,0.00013121891,0.00059483177],"category_scores_gemma":[0.000031244264,0.00019600717,0.00020599832,0.00058286,0.00015668123,0.00061229395,0.0002498997,0.00013539167,0.000012784376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.012976557,0.010297248,0.6252113,0.001168114,0.0036849421,0.000010559755,0.026389973,0.004425809,0.028383385,0.05516552,0.14821519,0.08407142],"study_design_scores_gemma":[0.013268561,0.0041525145,0.14078417,0.0004167638,0.0015041253,0.000006815596,0.0023670755,0.7663689,0.036257155,0.010490073,0.022034552,0.0023492442],"about_ca_topic_score_codex":0.044676084,"about_ca_topic_score_gemma":0.010922975,"teacher_disagreement_score":0.81531477,"about_ca_system_score_codex":0.00010499463,"about_ca_system_score_gemma":0.00017928457,"threshold_uncertainty_score":0.9616855},"labels":[],"label_agreement":null},{"id":"W7100554239","doi":"","title":"Guidelines for the Care and Treatment of Breast Cancer:","year":2002,"lang":"en","type":"article","venue":"","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Health care; MEDLINE; Steering committee; Primary care; Guideline","score_opus":0.09379572713163546,"score_gpt":0.321448458221463,"score_spread":0.22765273108982753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100554239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019091057,0.089804836,0.73787963,0.14698546,0.000371236,0.0007049365,0.0006682894,0.00015619882,0.0043383795],"genre_scores_gemma":[0.9415085,0.011197375,0.04177709,0.000800367,0.00014285988,0.00006482162,0.0000034341876,0.0000025840611,0.004502968],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996888,0.0000040550403,0.000083511964,0.00010748861,0.00005280877,0.00006333182],"domain_scores_gemma":[0.99957585,0.00008990894,0.000022130913,0.00017532456,0.00011641271,0.000020353262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000020767717,0.000038885053,0.00007696363,0.000029038885,0.000048772647,0.000019571951,0.00017969744,0.000010791589,0.00011712623],"category_scores_gemma":[0.0000137516445,0.000016042844,0.000041783078,0.00024840984,0.00002325962,0.0000457161,0.00003871275,0.000004783418,0.0000016362642],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.3049043e-7,0.000016147067,0.0009502404,0.0000013859116,0.00002204775,1.701526e-7,0.00009290821,0.000026697413,0.0000034153773,0.0037601853,0.0036818841,0.9914443],"study_design_scores_gemma":[0.0014114383,0.00096787105,0.036664758,0.000009340738,0.00021320216,0.000022529419,0.0009063695,0.34386855,0.0007632311,0.0013078754,0.6135625,0.00030232436],"about_ca_topic_score_codex":0.00080143637,"about_ca_topic_score_gemma":0.00011710103,"teacher_disagreement_score":0.991142,"about_ca_system_score_codex":0.000007351569,"about_ca_system_score_gemma":0.0000025963361,"threshold_uncertainty_score":0.128245},"labels":[],"label_agreement":null},{"id":"W7104439993","doi":"10.71781/15053","title":"Inférence topologique","year":2014,"lang":"fr","type":"dissertation","venue":"Papyrus : Institutional Repository (Université de Montréal)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Statistical analysis; Bonferroni correction; Image matching","score_opus":0.008420722983824276,"score_gpt":0.18366756390662414,"score_spread":0.17524684092279988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104439993","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5043881,0.056862324,0.19079718,0.005902069,0.008236187,0.0008911748,0.00026820897,0.0007713125,0.23188344],"genre_scores_gemma":[0.7697124,0.0013936714,0.007224905,0.0005594094,0.00035008497,0.00002786351,0.00058322283,0.000020125317,0.22012831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961114,0.00038513224,0.00061361276,0.0012286679,0.0008990943,0.00076208595],"domain_scores_gemma":[0.9969521,0.00039105496,0.00062025146,0.0009658789,0.00049669325,0.0005739811],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0004539566,0.00060501345,0.0007048537,0.00064800837,0.0078652855,0.00024119107,0.0020208969,0.0008482386,0.0002632632],"category_scores_gemma":[0.00039101287,0.00061459193,0.0005607091,0.0016724372,0.00057817064,0.0008133918,0.0007621597,0.000757696,0.00060779834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002678929,0.0005093586,0.023720792,0.00019531649,0.0006487742,0.004172781,0.01592351,0.0057808384,0.002191153,0.8853091,0.00275893,0.058521584],"study_design_scores_gemma":[0.001603675,0.00079390826,0.17500044,0.00043910136,0.001005948,0.001953058,0.013189745,0.040146515,0.010079132,0.008766151,0.744471,0.0025513219],"about_ca_topic_score_codex":0.09046222,"about_ca_topic_score_gemma":0.011638082,"teacher_disagreement_score":0.8765429,"about_ca_system_score_codex":0.0028703462,"about_ca_system_score_gemma":0.0015665777,"threshold_uncertainty_score":0.9996306},"labels":[],"label_agreement":null},{"id":"W7110347528","doi":"10.4230/lipics.socg.2025.69","title":"Computing Betti Tables and Minimal Presentations of Zero-Dimensional Persistent Homology","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université de Sherbrooke","funders":"Engineering and Physical Sciences Research Council; University of Oxford; National Science Foundation","keywords":"Betti number; Persistent homology; Topological data analysis; Homology (biology); Simplicial homology; Simplicial complex; Singular homology; Bottleneck","score_opus":0.014067612155145789,"score_gpt":0.2670925453594432,"score_spread":0.2530249332042974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110347528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4273801,0.0004113016,0.5663712,0.0015668866,0.00046766398,0.000509028,0.0005416057,0.000093182534,0.0026590044],"genre_scores_gemma":[0.945942,0.000019085659,0.052570786,0.0006611401,0.000022040143,0.000015667198,0.00026413947,0.00000521903,0.00049990945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982183,0.000039690723,0.0008032453,0.0002570589,0.0002742118,0.000407496],"domain_scores_gemma":[0.99849296,0.00042893455,0.00028844108,0.0004353338,0.00024657793,0.00010777894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036838796,0.00019883164,0.0004164967,0.00052962353,0.00030118413,0.00014808649,0.0007502645,0.00012338479,0.000020727713],"category_scores_gemma":[0.00016715257,0.00016350261,0.0002225798,0.0008662339,0.00023213623,0.00061673066,0.00090999634,0.0001693851,0.000010062651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025244718,0.0024500722,0.18417645,0.0020418505,0.0033902326,0.00002378065,0.011954565,0.0068002837,0.00033856378,0.57144266,0.09991976,0.117209315],"study_design_scores_gemma":[0.006621144,0.0011211793,0.06298671,0.00023854163,0.00054129364,0.00015161975,0.0033480774,0.82218784,0.0013248406,0.012344397,0.08797266,0.0011617221],"about_ca_topic_score_codex":0.00005244855,"about_ca_topic_score_gemma":0.000006450309,"teacher_disagreement_score":0.81538755,"about_ca_system_score_codex":0.000021955897,"about_ca_system_score_gemma":0.000057752703,"threshold_uncertainty_score":0.66674435},"labels":[],"label_agreement":null},{"id":"W7128638066","doi":"10.1109/focs63196.2025.00097","title":"Optimal Trickle-Down Theorems for Path Complexes via C-Lorentzian Polynomials with Applications to Sampling and Log-Concave Sequences","year":2025,"lang":"","type":"article","venue":"","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Generalization; Distributive property; Path (computing); Sampling (signal processing); Mixing (physics); Distribution (mathematics); Modular design","score_opus":0.0331413154006528,"score_gpt":0.30351574957237143,"score_spread":0.27037443417171864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128638066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076501654,0.000958005,0.9814249,0.006402928,0.00012827945,0.0016472728,0.0002971278,0.00010883818,0.0013824838],"genre_scores_gemma":[0.6980026,0.00011097119,0.29830867,0.0016001546,0.00011873827,0.00039086601,0.000053345164,0.000009250494,0.0014054145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964542,0.000117280346,0.0008005832,0.0014994792,0.00033795674,0.000790541],"domain_scores_gemma":[0.9967459,0.001402547,0.0002531449,0.0008900854,0.00029794642,0.00041039256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008191166,0.00045645787,0.00082285143,0.0008590667,0.0008889571,0.00090261677,0.0015319,0.00015486965,0.00018496285],"category_scores_gemma":[0.00016523304,0.0003098359,0.000191018,0.004706688,0.00057669135,0.0004266348,0.0008152226,0.0001736255,0.000027915836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017233769,0.00033306913,0.0029534248,0.000088945904,0.00048261601,0.000003696463,0.00038714963,0.002607165,0.00069531245,0.48504072,0.00091107027,0.50632447],"study_design_scores_gemma":[0.008782688,0.00865082,0.037285835,0.0005268953,0.003023372,0.00012620099,0.006286946,0.42085636,0.012504956,0.22764267,0.26821408,0.0060991934],"about_ca_topic_score_codex":0.0007946324,"about_ca_topic_score_gemma":0.00014062662,"teacher_disagreement_score":0.69035244,"about_ca_system_score_codex":0.00007634651,"about_ca_system_score_gemma":0.00019028464,"threshold_uncertainty_score":0.9999354},"labels":[],"label_agreement":null},{"id":"W7133039606","doi":"","title":"Topological data analysis of open-ended responses","year":2023,"lang":"en","type":"dissertation","venue":"TSpace","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Topological data analysis; Topology (electrical circuits); Algebra over a field; Class (philosophy); Population","score_opus":0.15851696479068828,"score_gpt":0.4500762321169465,"score_spread":0.2915592673262582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133039606","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6419773,0.006324225,0.16352016,0.015472735,0.0055673164,0.0023440171,0.0045743687,0.0026390713,0.15758081],"genre_scores_gemma":[0.38192353,0.0014664946,0.037106913,0.00040803684,0.0001426067,0.000061592145,0.03184775,0.00004376356,0.54699934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9973668,0.00022771543,0.0004550762,0.001119934,0.0005363061,0.00029416528],"domain_scores_gemma":[0.99522597,0.0008073424,0.00041523704,0.0033068112,0.00013527198,0.0001093538],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.000942884,0.00023368449,0.00096400565,0.0016003555,0.00010431804,0.00029267967,0.009870986,0.00026276388,0.0005915423],"category_scores_gemma":[0.001678179,0.00017598487,0.00023454527,0.011686235,0.00005981272,0.0003474604,0.003025905,0.00024468658,0.00013237288],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014241501,0.002368063,0.0061950325,0.00035233228,0.035295695,0.0010484842,0.010997724,0.00070095994,0.002131394,0.4721374,0.2514911,0.21585768],"study_design_scores_gemma":[0.0014932562,0.0010291331,0.7510396,0.00016588616,0.018207718,0.000008016419,0.015681047,0.07383871,0.0020738912,0.031229878,0.10174237,0.003490501],"about_ca_topic_score_codex":0.002459175,"about_ca_topic_score_gemma":0.001804904,"teacher_disagreement_score":0.74484456,"about_ca_system_score_codex":0.000021641401,"about_ca_system_score_gemma":0.00012661355,"threshold_uncertainty_score":0.9954861},"labels":[],"label_agreement":null},{"id":"W7133355104","doi":"10.20382/jocg.v17i1a1","title":"Relating interleaving and Fréchet distances via ordered merge trees","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Interleaving; Merge (version control); Monotone polygon; Topology (electrical circuits); Binary number","score_opus":0.0072092613714521804,"score_gpt":0.21682045112091128,"score_spread":0.2096111897494591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133355104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1499054,0.00047223258,0.8454072,0.0012398566,0.00019578577,0.000027581606,0.0000047927497,0.000022427235,0.0027247278],"genre_scores_gemma":[0.9694328,0.00006371579,0.029081086,0.00014105559,0.00003296054,4.5688687e-8,0.0000036167653,0.0000022142553,0.0012425542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.998879,0.000094669485,0.00033849996,0.00021354445,0.00031877335,0.00015546812],"domain_scores_gemma":[0.9985558,0.00056238024,0.0003514454,0.00012468388,0.00030673397,0.000098947516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030720927,0.00011696934,0.00028535113,0.0018170528,0.00018851404,0.00011397905,0.000665391,0.00005935204,0.00003227944],"category_scores_gemma":[0.00018421438,0.000103791666,0.00013808713,0.0037566668,0.0000864654,0.0008307249,0.00031321312,0.00022258598,0.0000024813735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019095407,0.0004699472,0.07170415,0.00008409544,0.001481857,0.0006613304,0.0006354948,0.08787103,0.00045998482,0.44087327,0.0036615112,0.39190638],"study_design_scores_gemma":[0.005627957,0.0011635303,0.36202186,0.00053675007,0.00064584106,0.00032808498,0.0029140657,0.25391406,0.0003687944,0.19913605,0.172019,0.001324006],"about_ca_topic_score_codex":0.00002478793,"about_ca_topic_score_gemma":0.000010757036,"teacher_disagreement_score":0.8195273,"about_ca_system_score_codex":0.00007790346,"about_ca_system_score_gemma":0.00007491753,"threshold_uncertainty_score":0.42325014},"labels":[],"label_agreement":null},{"id":"W79648173","doi":"","title":"On Generalizing Motzkin Numbers using k-Trees.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.035643078530386396,"score_gpt":0.2574134179686212,"score_spread":0.22177033943823482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W79648173","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9839056,0.00011100412,0.011432012,0.00030391704,0.0010485703,0.000055850673,0.000002746764,0.00016145126,0.0029788632],"genre_scores_gemma":[0.9926175,0.000027874428,0.006538704,0.0004867918,0.000010763361,0.0000025379002,0.000004249334,0.00000640534,0.00030520116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863493,0.000067691224,0.0002008911,0.0004123485,0.00036041086,0.00032369874],"domain_scores_gemma":[0.9990007,0.00011864384,0.00008144905,0.00061734766,0.00004972781,0.0001320803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015928944,0.00014581309,0.00021125471,0.00022014527,0.00028686516,0.00006492206,0.0008480262,0.00006951218,0.00006168804],"category_scores_gemma":[0.00011185993,0.00012224738,0.00011100153,0.001587702,0.00006667451,0.00031786558,0.0002714741,0.00014070523,0.00016704881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027513204,0.00013632674,0.0037228153,0.0000014206953,0.00003336754,0.00019615734,0.00010187666,0.0006242679,0.00016589183,0.9886734,0.0044945986,0.0018471266],"study_design_scores_gemma":[0.0014014416,0.0002942574,0.015114846,0.000022279552,0.00003739679,0.000181154,0.000025563731,0.059646536,0.0018431464,0.91161066,0.008975856,0.00084687356],"about_ca_topic_score_codex":0.00034832343,"about_ca_topic_score_gemma":0.0000040270734,"teacher_disagreement_score":0.07706275,"about_ca_system_score_codex":0.0000645306,"about_ca_system_score_gemma":0.000031871972,"threshold_uncertainty_score":0.49851033},"labels":[],"label_agreement":null}]}