{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72906667,0.0011820986,0.14139034,0.008484536,0.0004057427,0.00004973087,0.00036583142,0.0005327846,0.118522346],"genre_scores_gemma":[0.9856963,0.00037756827,0.008347794,0.00041487088,0.00020768556,0.000021540232,0.00014236402,0.00005322008,0.0047387155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988028,0.0003547072,0.000048823087,0.00022195888,0.00039220406,0.00017955693],"domain_scores_gemma":[0.9949243,0.0031203693,0.00033791063,0.0006516132,0.00052013696,0.0004457374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001528323,0.00050494756,0.0006393349,0.001476175,0.001201025,0.0014786574,0.0008920455,0.0008191125,0.006288123],"category_scores_gemma":[0.008783658,0.000390732,0.000708262,0.0011138964,0.004129646,0.005230017,0.0036292868,0.002916597,0.0004492394],"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.00003678609,0.000027645416,0.0007697881,0.00004208353,0.000008567704,0.00014330735,0.00028806692,0.0017099488,0.001753611,0.9904739,0.0009775875,0.0037686292],"study_design_scores_gemma":[0.000009665511,0.000017783208,0.0007050222,0.000017036684,0.00000784078,0.00013570834,0.00012718489,0.007903603,0.0010607948,0.9866997,0.0033018775,0.000013791938],"about_ca_topic_score_codex":0.0011758774,"about_ca_topic_score_gemma":0.00087259535,"teacher_disagreement_score":0.006288123,"about_ca_system_score_codex":0.0009790064,"about_ca_system_score_gemma":0.000424252,"threshold_uncertainty_score":0.02103585},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010897632,0.018272733,0.033169515,0.0038495695,0.0011963315,0.00003138335,0.00023919578,0.00022052566,0.93212306],"genre_scores_gemma":[0.46192032,0.019395288,0.02184078,0.0016434059,0.003395899,0.00015710534,0.00084779225,0.00030269567,0.49049664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997384,0.000060910228,0.000009343407,0.00005731364,0.00010467957,0.000029406183],"domain_scores_gemma":[0.99974865,0.00008931279,0.00001605564,0.00004816667,0.00006144622,0.00003632158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035756174,0.00046966504,0.00050508184,0.0019870761,0.001042609,0.0034143897,0.0005926755,0.00074721186,0.012973836],"category_scores_gemma":[0.0009830433,0.00026728626,0.00027877896,0.0015501124,0.0030200318,0.003840438,0.0015161283,0.0018308093,0.0024649068],"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.0000018613925,0.0000026060497,0.000025685049,0.000014943357,0.0000015358986,0.000008155816,0.0001425101,0.000080420665,0.00008960134,0.9880336,0.005121467,0.006477667],"study_design_scores_gemma":[0.0000024322667,0.000003731879,0.00012792405,0.000018484354,0.000002319553,0.000048964863,0.0000737025,0.00033238207,0.0001105667,0.90329075,0.09598611,0.0000025923441],"about_ca_topic_score_codex":0.0013313993,"about_ca_topic_score_gemma":0.00097119616,"teacher_disagreement_score":0.012973836,"about_ca_system_score_codex":0.0016400284,"about_ca_system_score_gemma":0.0007618774,"threshold_uncertainty_score":0.043401837},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69949394,0.0007026064,0.26611638,0.0013233764,0.00010981161,0.000068901376,0.0010250036,0.0016637394,0.029496176],"genre_scores_gemma":[0.97972083,0.0003372423,0.013086216,0.00007051456,0.00006876728,0.00004402029,0.00043370796,0.00040380232,0.0058348286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996685,0.00004408436,0.000019225046,0.00006362749,0.00012775592,0.00007688853],"domain_scores_gemma":[0.9967135,0.0012064092,0.00049707456,0.000382604,0.0006611453,0.00053922314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051915116,0.00030390435,0.00047559355,0.0040419647,0.00085781765,0.0035966241,0.0007240867,0.0009640832,0.01065876],"category_scores_gemma":[0.00535579,0.00036963122,0.0003007333,0.0016690951,0.0010631274,0.0041741095,0.001314928,0.00095199404,0.0009938495],"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.0000915099,0.000027892605,0.0017437094,0.000063411484,0.000008676456,0.0002464987,0.00036179373,0.004142167,0.0053573647,0.9621891,0.0023773026,0.02339054],"study_design_scores_gemma":[0.000021934242,0.000025833764,0.0013207652,0.00002266403,0.000011156089,0.00037704033,0.0002326696,0.05672427,0.0022807634,0.9337746,0.005187487,0.000020835265],"about_ca_topic_score_codex":0.0013999075,"about_ca_topic_score_gemma":0.0011352239,"teacher_disagreement_score":0.01065876,"about_ca_system_score_codex":0.0008065727,"about_ca_system_score_gemma":0.0004883973,"threshold_uncertainty_score":0.035657167},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4320956,0.0017812242,0.46803823,0.0039500967,0.00060118956,0.0001553018,0.00035362004,0.00054112094,0.09248362],"genre_scores_gemma":[0.92509633,0.0008755148,0.045252316,0.0004468776,0.00033169464,0.0000941013,0.00032821362,0.00025770275,0.02731731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988901,0.00026723294,0.0000745759,0.00021509065,0.00039032073,0.00016276388],"domain_scores_gemma":[0.9982926,0.0006191208,0.00019107087,0.00034230552,0.00026285954,0.0002919488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010475931,0.0007284762,0.0009299186,0.0035982942,0.0026118786,0.0044356533,0.001736941,0.0014397502,0.008072435],"category_scores_gemma":[0.00430344,0.0005628019,0.00097586313,0.0021467358,0.0035382241,0.0078581935,0.0069939494,0.0032452662,0.0008905279],"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.000008150578,0.000010195094,0.00011179169,0.000014192347,0.0000040935474,0.00003826825,0.00021827528,0.0006392324,0.0002199908,0.99548113,0.0003941614,0.0028605345],"study_design_scores_gemma":[0.00000459539,0.0000072146445,0.00006934469,0.000006436426,0.000005793062,0.00005196645,0.00013117374,0.004405178,0.00022986319,0.9928691,0.002213863,0.0000054154775],"about_ca_topic_score_codex":0.001513682,"about_ca_topic_score_gemma":0.0012158534,"teacher_disagreement_score":0.008072435,"about_ca_system_score_codex":0.001629959,"about_ca_system_score_gemma":0.0005418334,"threshold_uncertainty_score":0.027005017},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01245524,0.00061450066,0.97755414,0.001826494,0.00006624346,0.00018208747,0.000051378942,0.00024372317,0.0070061497],"genre_scores_gemma":[0.46265098,0.0016422357,0.52416855,0.0010168556,0.000102008846,0.0015128572,0.00012954873,0.0002619212,0.00851503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939346,0.00020677282,0.00002422784,0.00010710509,0.00020954547,0.00005886745],"domain_scores_gemma":[0.99921954,0.00036366968,0.00013492542,0.00007792793,0.00012931821,0.00007450352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014054077,0.0007138773,0.00065348507,0.0007991445,0.0005625287,0.001232601,0.0015478462,0.0011098398,0.0035923817],"category_scores_gemma":[0.002474448,0.00055006216,0.00096283667,0.00035008613,0.0015506595,0.0013743057,0.0015076194,0.0012345732,0.00076804514],"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.00007973092,0.00011446541,0.001207336,0.00033849257,0.0000825106,0.00015707925,0.00017810448,0.76123196,0.015933074,0.1583604,0.0035820832,0.058734708],"study_design_scores_gemma":[0.00005399503,0.00016885513,0.00032562081,0.00004159092,0.0000367867,0.00013029871,0.000054580214,0.8598491,0.0025034882,0.12823378,0.008579932,0.00002192068],"about_ca_topic_score_codex":0.00079540623,"about_ca_topic_score_gemma":0.001189642,"teacher_disagreement_score":0.0035923817,"about_ca_system_score_codex":0.0016208815,"about_ca_system_score_gemma":0.0015952771,"threshold_uncertainty_score":0.012017667},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75406736,0.0010963805,0.16135456,0.0008875103,0.0002504171,0.00007562868,0.0005834631,0.00045760025,0.08122705],"genre_scores_gemma":[0.9759143,0.0003242745,0.016862493,0.00009169796,0.00008121301,0.00005388687,0.00022830686,0.00007360393,0.0063702962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955887,0.00006080568,0.000017617867,0.00008927966,0.00015695869,0.00011646728],"domain_scores_gemma":[0.99893755,0.00034309062,0.00012894777,0.000091826536,0.00025072004,0.00024787796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060427526,0.00033902988,0.000317336,0.0017758615,0.001235632,0.0023863977,0.00066143484,0.0005185147,0.0046338467],"category_scores_gemma":[0.002233901,0.00023553344,0.00029480335,0.0009953926,0.0017548717,0.0028804974,0.0008351742,0.0010346663,0.00023711426],"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.000050824798,0.000015029857,0.0006276411,0.000026380661,0.0000034615944,0.00005256307,0.00013585463,0.003010328,0.0031925447,0.98576933,0.0011670566,0.0059490805],"study_design_scores_gemma":[0.00002168982,0.000035632536,0.0017598665,0.000036146892,0.000010631334,0.00022568423,0.00019879958,0.036182396,0.003535457,0.94503194,0.012929451,0.000032452303],"about_ca_topic_score_codex":0.0028685657,"about_ca_topic_score_gemma":0.0024006274,"teacher_disagreement_score":0.0046338467,"about_ca_system_score_codex":0.0018456595,"about_ca_system_score_gemma":0.00048202198,"threshold_uncertainty_score":0.015501738},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09910262,0.0013647891,0.49190012,0.002619674,0.0016533899,0.00028590596,0.0012413191,0.0014979423,0.40033424],"genre_scores_gemma":[0.5172011,0.0015906312,0.13971192,0.0007242084,0.0006768175,0.00020660419,0.0013307089,0.0010615996,0.33749637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975866,0.000032351065,0.000013045061,0.000056948873,0.000104106155,0.00003492927],"domain_scores_gemma":[0.9996737,0.000037444024,0.000051225325,0.00005977766,0.00011250452,0.000065297616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029452212,0.0006465178,0.00064260646,0.0027037824,0.0013010981,0.0015372752,0.0008273858,0.0011339244,0.025340071],"category_scores_gemma":[0.0009955444,0.0004003721,0.0005321507,0.0010407462,0.0013023347,0.001424865,0.0013106407,0.0014204849,0.0064715357],"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.000009469595,0.000016972568,0.000102831335,0.000026357186,0.0000072261478,0.00005396788,0.00008889089,0.0013710943,0.0013506035,0.9674494,0.0050358707,0.0244873],"study_design_scores_gemma":[0.000015032763,0.000018524624,0.0004240849,0.000012345499,0.0000052873074,0.0002142378,0.00009220556,0.012393217,0.0005927208,0.96073407,0.025481582,0.000016681506],"about_ca_topic_score_codex":0.0016107468,"about_ca_topic_score_gemma":0.0027011363,"teacher_disagreement_score":0.025340071,"about_ca_system_score_codex":0.0007092604,"about_ca_system_score_gemma":0.0008051566,"threshold_uncertainty_score":0.08477104},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29440922,0.00072462077,0.7002751,0.00018268505,0.00005153527,0.00011868445,0.0001745006,0.0002959999,0.0037677144],"genre_scores_gemma":[0.84811425,0.0002449257,0.15077384,0.000053654447,0.0000464628,0.000089413894,0.00019593105,0.000042050007,0.000439344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970746,0.0007486014,0.00030228007,0.00059800537,0.0011511657,0.00012536289],"domain_scores_gemma":[0.9903983,0.004787312,0.0020009882,0.0013993256,0.0009191253,0.00049497007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023722325,0.00045372537,0.00088471174,0.0053815013,0.00076599565,0.0018730859,0.0011001324,0.00090734736,0.0010221555],"category_scores_gemma":[0.018155253,0.00035793654,0.00084149657,0.0022204872,0.0021062463,0.004268149,0.002883881,0.0008761407,0.00024992452],"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.0013872954,0.00042187108,0.07690644,0.001074129,0.0006523918,0.0009149625,0.0068146866,0.099022076,0.063362926,0.08749901,0.0015620572,0.66038215],"study_design_scores_gemma":[0.000070101916,0.0019376806,0.15889642,0.00029380474,0.00036844905,0.003368673,0.0047418796,0.49612105,0.028284619,0.29528117,0.010246104,0.000390098],"about_ca_topic_score_codex":0.00082720455,"about_ca_topic_score_gemma":0.00056812627,"teacher_disagreement_score":0.0053815013,"about_ca_system_score_codex":0.0006020809,"about_ca_system_score_gemma":0.00032390893,"threshold_uncertainty_score":0.012545705},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40381944,0.0017426425,0.5083519,0.0011445844,0.00023864892,0.00013872677,0.00064568507,0.00053899124,0.08337941],"genre_scores_gemma":[0.9480305,0.0005560465,0.044147458,0.00023517157,0.00018458758,0.0001291125,0.00035863998,0.000119393015,0.0062391334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820817,0.0004124531,0.00015152378,0.0005369347,0.000450093,0.00024092571],"domain_scores_gemma":[0.9886696,0.0067208107,0.0010621182,0.0016148699,0.0008174535,0.0011151633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024831635,0.0005084557,0.0006277556,0.0043632956,0.0020378868,0.005577143,0.0013323919,0.0007102844,0.0046529765],"category_scores_gemma":[0.011216037,0.0005309623,0.0008915463,0.0024626898,0.004416667,0.00789235,0.0036632265,0.0021506033,0.0006304952],"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.000015968015,0.000009415436,0.000527824,0.000015970576,0.000004581755,0.000037713926,0.00021094443,0.00043604823,0.00046838334,0.9940526,0.00030725883,0.003913385],"study_design_scores_gemma":[0.000010739291,0.000016004196,0.00041486186,0.000011682665,0.0000114679815,0.00017407161,0.000119222284,0.0049000457,0.0014084649,0.9879843,0.00493601,0.000013062445],"about_ca_topic_score_codex":0.0006595621,"about_ca_topic_score_gemma":0.00049875426,"teacher_disagreement_score":0.005577143,"about_ca_system_score_codex":0.0017921592,"about_ca_system_score_gemma":0.00054276147,"threshold_uncertainty_score":0.015565753},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6348752,0.0023561323,0.30645064,0.004739082,0.00021288711,0.00005564042,0.0005187781,0.00024840984,0.050543208],"genre_scores_gemma":[0.9698799,0.0010324647,0.016430404,0.00024045742,0.00029223965,0.000039319202,0.00024399384,0.000068807836,0.01177229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964845,0.000092436036,0.000018620107,0.00010127396,0.00008346394,0.000055855504],"domain_scores_gemma":[0.9987074,0.0004522786,0.0002872772,0.00017609353,0.00016879155,0.00020805161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081740064,0.00037034263,0.00044274886,0.0019196413,0.0010871813,0.0023091587,0.00055112666,0.0008742115,0.0043542194],"category_scores_gemma":[0.00335349,0.00029074182,0.0003906748,0.0012129303,0.0027355005,0.0057780766,0.0018722714,0.0013922481,0.00033982168],"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.000011211074,0.000009900666,0.00046382652,0.000016499984,0.000004664712,0.000032884218,0.00016464453,0.00085639785,0.00037723038,0.9921221,0.00064776826,0.0052927732],"study_design_scores_gemma":[0.0000052257533,0.0000059166655,0.0003215624,0.0000044497738,0.0000033533347,0.00004162928,0.00006720199,0.004038209,0.00016363764,0.99369085,0.0016521364,0.0000058019114],"about_ca_topic_score_codex":0.00095372245,"about_ca_topic_score_gemma":0.00063704065,"teacher_disagreement_score":0.0043542194,"about_ca_system_score_codex":0.00076739327,"about_ca_system_score_gemma":0.00056691567,"threshold_uncertainty_score":0.014566302},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040057064,0.14969978,0.55170107,0.010887562,0.0062637357,0.00009114507,0.0011971811,0.0012048667,0.27494898],"genre_scores_gemma":[0.2294313,0.16219197,0.3153512,0.0054644607,0.016882734,0.0008210453,0.0025365022,0.0017041309,0.26561671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988961,0.0003463138,0.000055272172,0.00015797271,0.00049393525,0.000050367224],"domain_scores_gemma":[0.99768484,0.00151541,0.00009530892,0.0003106076,0.00033016995,0.00006373859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001636025,0.001210087,0.0011396061,0.0023261309,0.00072559604,0.002999555,0.00082817936,0.0008853877,0.011400564],"category_scores_gemma":[0.004396275,0.00048127407,0.0009161539,0.0028282623,0.0027999016,0.0034959705,0.0011766443,0.0044837296,0.005055972],"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.0000064520095,0.000010595174,0.00015944567,0.00017284819,0.000030486772,0.00004741807,0.00012994155,0.0022737633,0.00023262484,0.90847695,0.04852118,0.039938334],"study_design_scores_gemma":[0.0000039743704,0.000007866747,0.0002974827,0.00008344283,0.000008727732,0.00010295199,0.000040808784,0.00500309,0.00010735311,0.8605081,0.13382614,0.000009927975],"about_ca_topic_score_codex":0.0012309215,"about_ca_topic_score_gemma":0.0011020362,"teacher_disagreement_score":0.011400564,"about_ca_system_score_codex":0.0020194645,"about_ca_system_score_gemma":0.0015099805,"threshold_uncertainty_score":0.038138628},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09207696,0.00078037224,0.8665072,0.00039185505,0.00013753053,0.000228926,0.00041561885,0.00075394043,0.038707614],"genre_scores_gemma":[0.27145556,0.0006535948,0.71577495,0.00015268814,0.000063407904,0.0003077859,0.00080354826,0.0003563854,0.010432132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983981,0.00046433602,0.00013022583,0.00033808817,0.00048785974,0.00018135757],"domain_scores_gemma":[0.99738735,0.0013152134,0.00026760792,0.00043577253,0.00044196553,0.000152115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087186816,0.0005876295,0.0007408278,0.0013239855,0.0011090561,0.0022996606,0.0009603258,0.00092168956,0.00956649],"category_scores_gemma":[0.009904562,0.00042957236,0.0005485595,0.001655081,0.00133604,0.0038573293,0.0013961901,0.00094118586,0.0013761315],"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.00021451319,0.000058944956,0.001640978,0.0003126633,0.00003290347,0.0001748833,0.00044611274,0.051039692,0.010521914,0.7589428,0.0054604462,0.17115413],"study_design_scores_gemma":[0.00007461823,0.00012077488,0.0010022267,0.00014218687,0.00003384227,0.00058459,0.0004162382,0.16722098,0.013876181,0.7487044,0.06775191,0.000072152165],"about_ca_topic_score_codex":0.0012347491,"about_ca_topic_score_gemma":0.0022108266,"teacher_disagreement_score":0.00956649,"about_ca_system_score_codex":0.0009920591,"about_ca_system_score_gemma":0.0008083154,"threshold_uncertainty_score":0.032003105},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99533194,0.000020600704,0.002463485,0.00006325302,0.000004066365,0.000003819417,0.000008285668,0.000012116894,0.0020924818],"genre_scores_gemma":[0.99904233,0.000012155616,0.00054131873,0.0000062877666,0.000003973106,0.0000025972433,0.000008716871,0.0000027611966,0.0003798924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998864,0.000024419425,0.0000051711077,0.000019935229,0.000034524044,0.000029531953],"domain_scores_gemma":[0.99970067,0.00006478466,0.00007098639,0.00004106951,0.000031025822,0.000091446534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033640087,0.00024364576,0.00030590605,0.00059118465,0.0007404248,0.0011326746,0.0004034125,0.0006002331,0.0014393068],"category_scores_gemma":[0.0007770631,0.0001811906,0.00023509414,0.00022323539,0.0018682267,0.0009851622,0.0007769246,0.00038962334,0.000074830095],"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.00035645065,0.00018909479,0.007207292,0.00008695254,0.000069715046,0.0030816875,0.0016730749,0.06157403,0.0772506,0.8429628,0.0006596973,0.0048885792],"study_design_scores_gemma":[0.00015421199,0.00031539245,0.00915367,0.000025705896,0.000037508846,0.000648328,0.00073212007,0.60619664,0.009922696,0.3718703,0.0008861095,0.000057279907],"about_ca_topic_score_codex":0.0014123949,"about_ca_topic_score_gemma":0.001011335,"teacher_disagreement_score":0.0014393068,"about_ca_system_score_codex":0.00057365844,"about_ca_system_score_gemma":0.00036235942,"threshold_uncertainty_score":0.004814923},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29345268,0.0002505044,0.69752234,0.00047218977,0.000032164557,0.00009662918,0.000370219,0.0007491429,0.0070541636],"genre_scores_gemma":[0.78625983,0.0001700658,0.20982203,0.0000630131,0.000019950068,0.00010751908,0.0007120091,0.00012683243,0.002718708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991326,0.0002745038,0.00004592475,0.00019411718,0.00020205812,0.00015082739],"domain_scores_gemma":[0.99861526,0.00056892727,0.00017001017,0.00039229577,0.00013706584,0.00011653657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006591603,0.00058320037,0.0008040817,0.00047806822,0.000613893,0.0014755243,0.001086248,0.00084465084,0.0037621204],"category_scores_gemma":[0.0035019226,0.0004652796,0.0005967066,0.00066365843,0.00095587346,0.0023269365,0.0014006017,0.00093226513,0.0005849303],"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.0006519315,0.0001636637,0.0020214405,0.00024648107,0.000067608824,0.0004384515,0.00048572026,0.56987,0.02334653,0.30004174,0.004864255,0.09780219],"study_design_scores_gemma":[0.000066404,0.00020611107,0.00048188303,0.000018711486,0.000022795919,0.00021496027,0.00019681292,0.8128141,0.008083116,0.17286424,0.0050003766,0.00003055124],"about_ca_topic_score_codex":0.001230203,"about_ca_topic_score_gemma":0.0015521825,"teacher_disagreement_score":0.0037621204,"about_ca_system_score_codex":0.000826497,"about_ca_system_score_gemma":0.0005054477,"threshold_uncertainty_score":0.01258558},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6609606,0.0021345825,0.15314844,0.023436274,0.00078218774,0.000113069946,0.0011924221,0.0012053032,0.15702714],"genre_scores_gemma":[0.9691871,0.0009737344,0.015334209,0.0016756568,0.0007992773,0.0000820686,0.0008066431,0.00023239986,0.010908907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803096,0.0006297266,0.00009668948,0.0005423765,0.00038685824,0.000313299],"domain_scores_gemma":[0.98946244,0.0069888406,0.00064781477,0.0015616006,0.00068385503,0.0006554976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023681724,0.00070725335,0.0023488957,0.0023572329,0.0033550824,0.0052455007,0.0021013492,0.0036175908,0.014590461],"category_scores_gemma":[0.014689126,0.0010774374,0.0012902995,0.0025176841,0.004524586,0.0131394565,0.004236839,0.005964805,0.0015907169],"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.00008457554,0.000038836446,0.0007875312,0.00007122165,0.000015668851,0.000118734504,0.00031996894,0.0019325077,0.00036476212,0.98819643,0.004030503,0.004039139],"study_design_scores_gemma":[0.000016426966,0.000006173203,0.00021101988,0.000014128177,0.000011363184,0.000071283524,0.00012186937,0.00492782,0.00013300584,0.9930662,0.0014105177,0.000010191082],"about_ca_topic_score_codex":0.0011511319,"about_ca_topic_score_gemma":0.0011323188,"teacher_disagreement_score":0.014590461,"about_ca_system_score_codex":0.0015147055,"about_ca_system_score_gemma":0.000769496,"threshold_uncertainty_score":0.048810005},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8328247,0.0007720864,0.12919065,0.000979476,0.000067787754,0.00006873106,0.00041045007,0.00032940012,0.035356652],"genre_scores_gemma":[0.9862942,0.000147975,0.011773398,0.00009119719,0.00005282132,0.000050657858,0.00010626412,0.00006312282,0.0014202715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990158,0.00028514102,0.000059111757,0.0002888485,0.0002081756,0.00014296788],"domain_scores_gemma":[0.9840831,0.009995642,0.0020294883,0.0014069657,0.0010005906,0.0014841604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018411769,0.00043048838,0.00040357042,0.0026421656,0.0011134614,0.0027714649,0.0010531151,0.00053352857,0.004063907],"category_scores_gemma":[0.012982382,0.00024798574,0.00026625211,0.0015253085,0.0030542284,0.0033757156,0.0014142859,0.0013106632,0.00032601345],"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.0006082347,0.00017124174,0.013725011,0.00017007238,0.00006172992,0.00042887116,0.00045194093,0.028372955,0.020120727,0.90509826,0.0023836414,0.02840733],"study_design_scores_gemma":[0.00006642208,0.0001649053,0.006529842,0.00007520638,0.00006835992,0.0009692309,0.00032349196,0.08511689,0.011079399,0.89108175,0.00442702,0.000097551856],"about_ca_topic_score_codex":0.00087173644,"about_ca_topic_score_gemma":0.00081315154,"teacher_disagreement_score":0.004063907,"about_ca_system_score_codex":0.0015613493,"about_ca_system_score_gemma":0.00044156137,"threshold_uncertainty_score":0.013595104},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63788885,0.0011408023,0.29451436,0.0024078905,0.00013134204,0.000057171743,0.0006546873,0.000642313,0.06256267],"genre_scores_gemma":[0.9630621,0.00059089763,0.021875199,0.00020268155,0.00013049626,0.000070370734,0.00048555344,0.00014340605,0.013439249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934775,0.000110209556,0.00003222863,0.00023764615,0.00013104094,0.00014111889],"domain_scores_gemma":[0.9953856,0.0023030553,0.0005558709,0.00079039054,0.00044074925,0.0005243559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012247897,0.00048495835,0.0007415172,0.002281333,0.0025787458,0.003226989,0.0012846458,0.0007246773,0.006736306],"category_scores_gemma":[0.0042948932,0.0004294313,0.00059450575,0.0026700725,0.003977968,0.0061728284,0.0019782316,0.0016014354,0.0005143143],"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.00011234151,0.00003535559,0.0035076204,0.00005261687,0.0000103579905,0.000068467074,0.00037705348,0.006231276,0.001166951,0.97330374,0.0024984921,0.012635734],"study_design_scores_gemma":[0.000023461285,0.000019589332,0.0015488937,0.000019393263,0.00002749743,0.00015704807,0.0002545697,0.026117684,0.0012335193,0.9648445,0.005724899,0.000029038645],"about_ca_topic_score_codex":0.0046258564,"about_ca_topic_score_gemma":0.0047442475,"teacher_disagreement_score":0.006736306,"about_ca_system_score_codex":0.0025600756,"about_ca_system_score_gemma":0.0009442605,"threshold_uncertainty_score":0.022535205},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8834182,0.00029500367,0.06653151,0.0006404783,0.00009752795,0.000057054353,0.00021144433,0.00030251022,0.04844632],"genre_scores_gemma":[0.99204695,0.00009814658,0.0042995913,0.00005222945,0.000048406535,0.000039547696,0.00009774865,0.000060231763,0.003257215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836046,0.00027310147,0.00008500265,0.00043222652,0.00044044846,0.000408778],"domain_scores_gemma":[0.9932807,0.0029640547,0.0008498259,0.00093921047,0.0006497285,0.0013164998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014843456,0.00051608286,0.0006476877,0.0028334525,0.0018249474,0.0037637057,0.0012972456,0.0010503763,0.008252301],"category_scores_gemma":[0.0066721602,0.0003641812,0.00066486764,0.0013474257,0.006650012,0.0059221494,0.0035274087,0.0016469416,0.00059128297],"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.00019190117,0.000053473374,0.0028350542,0.00007542838,0.000018586092,0.0001691035,0.00052230526,0.00409823,0.0048325206,0.98049736,0.0006556136,0.0060504843],"study_design_scores_gemma":[0.00006233896,0.00016550986,0.005424128,0.00004300652,0.00006451181,0.00041840688,0.0008476894,0.029499557,0.007489106,0.9498436,0.006040714,0.000101405894],"about_ca_topic_score_codex":0.0013792274,"about_ca_topic_score_gemma":0.0014225623,"teacher_disagreement_score":0.008252301,"about_ca_system_score_codex":0.0019297593,"about_ca_system_score_gemma":0.0006112293,"threshold_uncertainty_score":0.027606666},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09658669,0.004870146,0.7234269,0.007419658,0.0014793131,0.00013038183,0.000611259,0.0009234446,0.16455221],"genre_scores_gemma":[0.8806794,0.0055124615,0.072887875,0.0021669336,0.0022020573,0.00019598665,0.0006406886,0.0004917617,0.035222888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999114,0.000301773,0.000052511397,0.00016883803,0.00024327403,0.00011950211],"domain_scores_gemma":[0.99677235,0.0017271397,0.00024033862,0.0006903375,0.0003072313,0.00026251381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013580103,0.0005232291,0.00068606355,0.002672143,0.0018310777,0.0030613015,0.0018572138,0.0015320589,0.010561206],"category_scores_gemma":[0.008896299,0.00036987494,0.0006721251,0.0025339033,0.005320039,0.012304761,0.0030730388,0.0030890398,0.0019844386],"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.000013846322,0.000010492558,0.0001051447,0.000024795474,0.000003428653,0.000036741254,0.00009373613,0.0008866756,0.00024727784,0.98672557,0.0017562498,0.010096011],"study_design_scores_gemma":[0.0000020377545,0.000005233833,0.000052584506,0.000008084524,0.0000025431757,0.000053001226,0.000036758945,0.0031309638,0.00013025667,0.9945754,0.0019989726,0.000004207392],"about_ca_topic_score_codex":0.00079390686,"about_ca_topic_score_gemma":0.0004719952,"teacher_disagreement_score":0.010561206,"about_ca_system_score_codex":0.0010312112,"about_ca_system_score_gemma":0.00045845774,"threshold_uncertainty_score":0.035330713},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9157621,0.00045832526,0.045953546,0.0004393398,0.00008118309,0.00004449561,0.00014569526,0.00018719315,0.03692811],"genre_scores_gemma":[0.99003524,0.00016670086,0.0041832644,0.00006447517,0.000039299157,0.000027080276,0.00007542226,0.000041642637,0.00536685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991455,0.00013040125,0.00006104567,0.00023811297,0.00027705036,0.00014783995],"domain_scores_gemma":[0.9977514,0.00077221985,0.00035351096,0.0003071986,0.00037492593,0.000440729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010671172,0.0005547923,0.00055907725,0.004029216,0.0018791059,0.0037809107,0.00091110065,0.00081748125,0.0066963513],"category_scores_gemma":[0.0028450098,0.0006602961,0.0005637183,0.0012356678,0.0040342514,0.007823743,0.003668125,0.0011116152,0.0004894989],"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.00006319413,0.000031048054,0.0041991295,0.00005267584,0.000014815299,0.00041217182,0.0019823427,0.0007131011,0.0036038777,0.9786524,0.00064154225,0.009633749],"study_design_scores_gemma":[0.000022446258,0.000052950443,0.0049645617,0.000042385243,0.00003293825,0.00096150127,0.0014278865,0.0059753573,0.004574275,0.97450066,0.0074054757,0.000039435232],"about_ca_topic_score_codex":0.0012256462,"about_ca_topic_score_gemma":0.0010781079,"teacher_disagreement_score":0.0066963513,"about_ca_system_score_codex":0.0012121571,"about_ca_system_score_gemma":0.00034750032,"threshold_uncertainty_score":0.022401512},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6105416,0.0016670387,0.3428187,0.0022921239,0.00017797864,0.00006209124,0.00033361162,0.00025892133,0.041848026],"genre_scores_gemma":[0.9530051,0.0009273448,0.02570782,0.00019317913,0.00022679467,0.000050415132,0.00018621564,0.00008404128,0.01961919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993905,0.00017040943,0.00003124477,0.00013152533,0.00020303835,0.00007331553],"domain_scores_gemma":[0.99748343,0.0010569302,0.00041460182,0.00034006717,0.0003091263,0.00039585243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010322153,0.00058338494,0.000604582,0.002775407,0.0011534278,0.0027365738,0.0007607743,0.0010135488,0.0043668146],"category_scores_gemma":[0.005423825,0.0004147864,0.000524101,0.0010694508,0.0032964088,0.005191023,0.002067117,0.0017476609,0.0004981276],"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.00002950524,0.000012665985,0.00048474132,0.00001739825,0.000011196693,0.00006150176,0.00022528293,0.0026859806,0.0011338659,0.98662996,0.00038062842,0.008327207],"study_design_scores_gemma":[0.0000058225323,0.000017062075,0.0005391221,0.0000075854296,0.0000063122575,0.000061354825,0.0000902643,0.011442969,0.0006927015,0.98497033,0.0021543978,0.000012073718],"about_ca_topic_score_codex":0.0012165814,"about_ca_topic_score_gemma":0.00079382176,"teacher_disagreement_score":0.0043668146,"about_ca_system_score_codex":0.0011504173,"about_ca_system_score_gemma":0.0007304762,"threshold_uncertainty_score":0.014608443},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9617808,0.00018568426,0.018112794,0.00025949584,0.000022392873,0.000016949598,0.0003178415,0.00013441747,0.019169621],"genre_scores_gemma":[0.9926813,0.00011881382,0.0026595362,0.000028209883,0.00003232296,0.000015145409,0.00030736328,0.00005715147,0.0041001635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995339,0.00007785965,0.000019383517,0.00013060993,0.00012180291,0.00011642994],"domain_scores_gemma":[0.9976909,0.0010251605,0.00038839114,0.00027359088,0.000204128,0.00041786634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005139719,0.00046051765,0.00045539121,0.0028141206,0.0014072292,0.0038243434,0.0012410218,0.0006419136,0.013287584],"category_scores_gemma":[0.002606208,0.00033672046,0.00031950438,0.0019953384,0.0024820475,0.0027149932,0.0013598546,0.0009908467,0.00070818985],"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.0005959601,0.00011425188,0.0158498,0.00016009065,0.0000436151,0.00028867836,0.0012859297,0.021152312,0.013441696,0.9165222,0.0037843548,0.026761146],"study_design_scores_gemma":[0.00006884505,0.00010612338,0.014168763,0.000051255058,0.000075867334,0.00045596433,0.0011996934,0.087006524,0.008570133,0.880661,0.007565127,0.00007065876],"about_ca_topic_score_codex":0.0027177227,"about_ca_topic_score_gemma":0.0040297345,"teacher_disagreement_score":0.013287584,"about_ca_system_score_codex":0.0018483822,"about_ca_system_score_gemma":0.00045851563,"threshold_uncertainty_score":0.044451356},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023859246,0.0075099426,0.9037301,0.002274558,0.00051495386,0.0001277402,0.0007784434,0.002734164,0.058470737],"genre_scores_gemma":[0.42506075,0.0071071773,0.48273095,0.0014055425,0.001168212,0.00026482096,0.0040391684,0.001206375,0.077016994],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807525,0.0003801981,0.00010406386,0.0005869684,0.0006937005,0.00015978042],"domain_scores_gemma":[0.998351,0.00039361394,0.00009038618,0.00077153667,0.00031214906,0.000081425685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012651526,0.00076155073,0.001394279,0.0038149978,0.0011604036,0.00313112,0.0022689085,0.0017795304,0.023727415],"category_scores_gemma":[0.0045183445,0.0006383166,0.00088918017,0.0040593278,0.0019362192,0.0067402665,0.0041345176,0.001971039,0.009295168],"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.00014336476,0.0001088575,0.000976947,0.0003521542,0.00010286605,0.000104302286,0.00015199008,0.010852589,0.0057943333,0.44252178,0.024642091,0.5142487],"study_design_scores_gemma":[0.000033889864,0.000073492185,0.0008298506,0.000083023166,0.000057558616,0.00053665094,0.00013328927,0.104970545,0.0066003525,0.7832909,0.103354655,0.000035784353],"about_ca_topic_score_codex":0.0010430764,"about_ca_topic_score_gemma":0.0011129403,"teacher_disagreement_score":0.023727415,"about_ca_system_score_codex":0.0012742705,"about_ca_system_score_gemma":0.0011975858,"threshold_uncertainty_score":0.0793761},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08753421,0.20627064,0.6345006,0.008205081,0.0015813078,0.00010171783,0.0005524266,0.00029864316,0.060955387],"genre_scores_gemma":[0.6841999,0.14802225,0.14490688,0.0012212329,0.006068303,0.00028716633,0.00079069886,0.0002477002,0.014255796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994698,0.0001946555,0.000038428105,0.00011056844,0.00015572364,0.000030784257],"domain_scores_gemma":[0.99829966,0.001006183,0.00020217753,0.000094396746,0.0002429221,0.00015475035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009881369,0.00082396343,0.00089699443,0.004610546,0.00097288314,0.0022619404,0.0006720841,0.0013553746,0.0021475009],"category_scores_gemma":[0.003429301,0.00038143262,0.0008485949,0.004402574,0.0029728822,0.003426118,0.0016333868,0.0020885943,0.00064147083],"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.00001491099,0.000022061888,0.000510964,0.00026404712,0.000021246738,0.00018510321,0.00019610494,0.0090032425,0.001154106,0.95578307,0.0018129695,0.03103215],"study_design_scores_gemma":[0.0000046691644,0.000043094118,0.00045630353,0.00006132181,0.0000085685515,0.00036173672,0.0000693877,0.024895784,0.00032721166,0.9575103,0.016237482,0.000024099443],"about_ca_topic_score_codex":0.0005665686,"about_ca_topic_score_gemma":0.0002917748,"teacher_disagreement_score":0.004610546,"about_ca_system_score_codex":0.0008877702,"about_ca_system_score_gemma":0.0004352066,"threshold_uncertainty_score":0.007184088},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56374234,0.0018674249,0.18695186,0.03178634,0.0015211747,0.00013782812,0.0013124893,0.00066447596,0.21201602],"genre_scores_gemma":[0.9501672,0.0009216183,0.020672556,0.0013853956,0.000590815,0.00007871198,0.00064472185,0.00012561955,0.025413338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858093,0.00028996696,0.00007032636,0.00040323017,0.00032622702,0.000329391],"domain_scores_gemma":[0.9941175,0.00282281,0.0004534372,0.001697202,0.0004730048,0.00043612745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022397235,0.00057508016,0.0015428786,0.0014939408,0.00295033,0.004087895,0.00190797,0.0035637314,0.013665509],"category_scores_gemma":[0.0131515125,0.00062117283,0.0012082602,0.0026985595,0.006946512,0.014692363,0.0049271137,0.004725289,0.0014890685],"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.000059908783,0.000011442136,0.00033334614,0.000019940962,0.0000037567318,0.00004366457,0.00013810047,0.00093135895,0.00020549142,0.9938415,0.0018192574,0.0025920933],"study_design_scores_gemma":[0.000014733064,0.000005674807,0.00017850427,0.000008680951,0.0000039190295,0.00003767742,0.00006614106,0.0029219135,0.00016773706,0.99386346,0.002722984,0.000008629676],"about_ca_topic_score_codex":0.0026259255,"about_ca_topic_score_gemma":0.001557413,"teacher_disagreement_score":0.013665509,"about_ca_system_score_codex":0.0021511384,"about_ca_system_score_gemma":0.0011920672,"threshold_uncertainty_score":0.04571563},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.733309,0.0017248987,0.22253859,0.00062321563,0.000104432336,0.00006317058,0.00076613744,0.00026142268,0.040609162],"genre_scores_gemma":[0.95174426,0.0011910441,0.03660497,0.000082136045,0.000097514974,0.00006354038,0.0007025599,0.00007186731,0.009442255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955493,0.000089487636,0.00003276987,0.00011479104,0.00012422766,0.00008377342],"domain_scores_gemma":[0.99777514,0.00092523947,0.00048252073,0.0003223158,0.00026478685,0.00022996309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028379678,0.0003622677,0.0007945736,0.0019093868,0.0015385016,0.005016295,0.00091307424,0.00081864896,0.0037806018],"category_scores_gemma":[0.0038578256,0.0007373695,0.00058821565,0.0025556206,0.0026172542,0.0030928203,0.0014409751,0.0011917839,0.0007131698],"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.000050417544,0.000012676438,0.0013943345,0.000037755162,0.000008328011,0.00011896862,0.00048744303,0.009256741,0.0013135069,0.9763199,0.0010275164,0.009972455],"study_design_scores_gemma":[0.000020835278,0.00001607071,0.0011037204,0.000019163921,0.000018260636,0.00019709342,0.0004333472,0.031295482,0.0012283891,0.9571679,0.008480735,0.000019070758],"about_ca_topic_score_codex":0.004569778,"about_ca_topic_score_gemma":0.0039891168,"teacher_disagreement_score":0.005016295,"about_ca_system_score_codex":0.0010551729,"about_ca_system_score_gemma":0.00063088856,"threshold_uncertainty_score":0.01264739},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4926771,0.0033513696,0.0949629,0.11405478,0.005524587,0.00016319538,0.0031846603,0.0022868407,0.28379458],"genre_scores_gemma":[0.9489705,0.0011260583,0.016515302,0.006500838,0.0019402549,0.00016279565,0.0021386978,0.00041959473,0.022225862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969465,0.00074888655,0.00020885385,0.0010391892,0.00051685126,0.00053972076],"domain_scores_gemma":[0.9781608,0.015435299,0.0010614371,0.0028324255,0.001322657,0.0011873861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025055204,0.0009912768,0.0019550482,0.0020214731,0.006383322,0.005555826,0.0025770268,0.00486211,0.019698491],"category_scores_gemma":[0.020600356,0.0010599066,0.0018081528,0.0030206093,0.007943091,0.010835761,0.0056572924,0.0066998196,0.0022868945],"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.00036596096,0.00011551336,0.0015929696,0.00017015268,0.000053658892,0.00074115227,0.0010081728,0.0017875838,0.0007766509,0.93251824,0.052882593,0.007987414],"study_design_scores_gemma":[0.00014977892,0.00003757677,0.000930211,0.00005726321,0.000048579932,0.0007655462,0.0004723242,0.0056106844,0.00065899146,0.9727842,0.018433716,0.000051114785],"about_ca_topic_score_codex":0.0032057196,"about_ca_topic_score_gemma":0.002840421,"teacher_disagreement_score":0.019698491,"about_ca_system_score_codex":0.0024289917,"about_ca_system_score_gemma":0.0012985473,"threshold_uncertainty_score":0.06589806},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0109807085,0.0005016695,0.98730356,0.00026931425,0.00004613161,0.00004171107,0.000049022947,0.00019017943,0.00061757915],"genre_scores_gemma":[0.33015814,0.00080731546,0.6654142,0.00030220835,0.0002892659,0.00043066827,0.00020773984,0.00027936755,0.0021110978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948414,0.003140081,0.000247418,0.0008714623,0.0006775082,0.000222127],"domain_scores_gemma":[0.90771854,0.081801996,0.0041276654,0.0029802178,0.0019833473,0.0013883298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017075287,0.0008408449,0.0016194498,0.0033127265,0.00091319386,0.0020492987,0.0024827784,0.0019218507,0.002823837],"category_scores_gemma":[0.08671987,0.0010543504,0.0018211909,0.00186435,0.0064117447,0.004277626,0.0034071172,0.002845367,0.00028035606],"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.00049202406,0.000061650724,0.007584016,0.0006812764,0.00024080354,0.0010552278,0.0012418655,0.14556755,0.0102323005,0.74620456,0.002293585,0.08434516],"study_design_scores_gemma":[0.000048011054,0.00016686157,0.0029146848,0.00009570402,0.000049689665,0.00051437045,0.00011045202,0.5970961,0.0034956695,0.39225286,0.0031705087,0.00008514048],"about_ca_topic_score_codex":0.0021335394,"about_ca_topic_score_gemma":0.0018331488,"teacher_disagreement_score":0.017075287,"about_ca_system_score_codex":0.0014525626,"about_ca_system_score_gemma":0.000904128,"threshold_uncertainty_score":0.09030384},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75360096,0.0019558917,0.19675726,0.0039112354,0.000355288,0.000054290962,0.00040633482,0.0003225606,0.04263617],"genre_scores_gemma":[0.97226644,0.00065142126,0.017888155,0.00030803317,0.00032874144,0.000045456265,0.00022410639,0.00006236512,0.008225247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986185,0.00047055536,0.000086539,0.00027381105,0.00039502032,0.000155618],"domain_scores_gemma":[0.9957145,0.0019256726,0.0005183426,0.00050658133,0.00067944406,0.00065549277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014073966,0.0005084254,0.0006805219,0.0027761948,0.0016256968,0.004578541,0.0011011316,0.0010772722,0.0029147826],"category_scores_gemma":[0.0037068918,0.0005911911,0.00077646424,0.0018808686,0.0038623014,0.006797673,0.0028653038,0.0018713634,0.00031590852],"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.00002350332,0.000017756709,0.00066780415,0.00001569812,0.000006577512,0.00007509552,0.0003275308,0.0003582908,0.0007232611,0.9943041,0.00033042597,0.0031497881],"study_design_scores_gemma":[0.000010265445,0.000019522515,0.0006269646,0.00000794549,0.000009195849,0.0002418159,0.00021578555,0.0025206327,0.00030806704,0.9932268,0.0027998604,0.000013155348],"about_ca_topic_score_codex":0.0009412182,"about_ca_topic_score_gemma":0.0007905693,"teacher_disagreement_score":0.004578541,"about_ca_system_score_codex":0.0010955088,"about_ca_system_score_gemma":0.00070890656,"threshold_uncertainty_score":0.009750903},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09690848,0.00031202834,0.90106606,0.00033874295,0.0000121783305,0.000024995508,0.00007065064,0.00042867212,0.00083813904],"genre_scores_gemma":[0.78927255,0.00044193366,0.20891397,0.000073802556,0.000060528713,0.00006038705,0.00027643054,0.00030841967,0.0005919995],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971635,0.001607018,0.00012380841,0.00043873698,0.00047723314,0.00018958129],"domain_scores_gemma":[0.9742711,0.019819437,0.0011037647,0.0031147234,0.0010845496,0.0006063499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006887475,0.0005048217,0.0010369794,0.0034276491,0.0011196166,0.004336006,0.0018083991,0.00093815936,0.002015398],"category_scores_gemma":[0.026874367,0.00058819435,0.0013773706,0.0036012032,0.0033858018,0.0055420194,0.0047621126,0.0015287728,0.00040751835],"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.000724364,0.00031188797,0.021753812,0.0003392697,0.00038626464,0.00060886936,0.002938332,0.14178097,0.02130306,0.36482945,0.0014562218,0.4435675],"study_design_scores_gemma":[0.00002573872,0.00015832846,0.002910847,0.000027852124,0.00006109318,0.00024798562,0.0005791641,0.72050005,0.002961636,0.2707116,0.0017700648,0.000045679637],"about_ca_topic_score_codex":0.002349347,"about_ca_topic_score_gemma":0.002070138,"teacher_disagreement_score":0.006887475,"about_ca_system_score_codex":0.00061864767,"about_ca_system_score_gemma":0.0014322986,"threshold_uncertainty_score":0.036424935},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24320297,0.002008136,0.6915953,0.003196195,0.0003859288,0.00009945949,0.0006267231,0.0010543294,0.057830893],"genre_scores_gemma":[0.81545615,0.0016658218,0.15357468,0.0011278321,0.00059308717,0.00013694844,0.0014263076,0.00057230634,0.025446938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975197,0.00081350014,0.00013709786,0.00063180295,0.00064529415,0.0002525919],"domain_scores_gemma":[0.9932941,0.004083861,0.000564651,0.0007755752,0.0007772063,0.0005045267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002006011,0.0009977967,0.0016725966,0.002450813,0.0016510637,0.0053807944,0.002261991,0.0018973056,0.0067977635],"category_scores_gemma":[0.011748393,0.0008036535,0.0018766632,0.0025105462,0.0039219013,0.008210649,0.0048219813,0.0044433903,0.0010247964],"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.00007994975,0.000029049646,0.00028138104,0.00008912484,0.000022110495,0.0001324497,0.0002001152,0.0031722242,0.0009714067,0.9772026,0.0017649496,0.016054716],"study_design_scores_gemma":[0.000010249515,0.000017734488,0.00013046616,0.000017364058,0.000020707415,0.00022829144,0.000082974344,0.0157801,0.0012204677,0.9807717,0.0017034991,0.000016418902],"about_ca_topic_score_codex":0.0010517852,"about_ca_topic_score_gemma":0.000797295,"teacher_disagreement_score":0.0067977635,"about_ca_system_score_codex":0.0014643387,"about_ca_system_score_gemma":0.000945197,"threshold_uncertainty_score":0.022740781},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40093127,0.0018129922,0.3706722,0.0043137125,0.00063038286,0.00030117307,0.0009873437,0.0008585372,0.21949248],"genre_scores_gemma":[0.9377562,0.00073515833,0.043432627,0.0012882026,0.00055073,0.00022342683,0.00042270293,0.00023577004,0.015355161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938357,0.00012540958,0.00003453556,0.00011073354,0.00024615857,0.00009959914],"domain_scores_gemma":[0.99651045,0.0019269178,0.00032138554,0.0003340549,0.00049923826,0.000407982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012288293,0.00063844625,0.00069697783,0.0019724315,0.0016618369,0.0015048004,0.0010414331,0.0014282377,0.013721914],"category_scores_gemma":[0.006068864,0.00050408527,0.00095239445,0.0009236412,0.0026599043,0.003299658,0.0031471578,0.002985573,0.0011654117],"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.000015013781,0.000032653927,0.00060163444,0.00005534516,0.000006899924,0.0002739211,0.00022287772,0.00065291824,0.0021942242,0.99041665,0.0018000482,0.0037277592],"study_design_scores_gemma":[0.000028273022,0.000026981446,0.0005524454,0.000026425081,0.000008059409,0.00029883045,0.00009975213,0.009563546,0.0017025995,0.9824854,0.0051881135,0.000019628464],"about_ca_topic_score_codex":0.00064732763,"about_ca_topic_score_gemma":0.0006245706,"teacher_disagreement_score":0.013721914,"about_ca_system_score_codex":0.00063399674,"about_ca_system_score_gemma":0.00050672767,"threshold_uncertainty_score":0.045904398},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85024613,0.00039745227,0.13539729,0.00033148404,0.00003538928,0.00006274141,0.0003141343,0.0002671197,0.012948276],"genre_scores_gemma":[0.98754334,0.00017870861,0.009890984,0.000055106557,0.0000444391,0.0000971974,0.0002750093,0.00009043065,0.0018248942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866796,0.00020790396,0.00007366832,0.00026695622,0.0005776294,0.00020589198],"domain_scores_gemma":[0.9868335,0.006983726,0.0024070966,0.0010479805,0.0014801286,0.0012474451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017250295,0.0005454976,0.00078454224,0.0044663227,0.0014358856,0.0033350347,0.0016740885,0.0011279726,0.004794687],"category_scores_gemma":[0.015028428,0.00084991223,0.0008022441,0.0014241394,0.004180852,0.0042834263,0.0031432111,0.0014189131,0.00041707835],"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.00025324765,0.00006385419,0.016379694,0.00017070514,0.000064581625,0.0005606036,0.0010369837,0.033372432,0.018673068,0.9155821,0.0009343591,0.012908383],"study_design_scores_gemma":[0.000023351296,0.00007969947,0.0078040906,0.000055083572,0.00005156357,0.00067981164,0.00043725534,0.17607462,0.010583316,0.8017726,0.0023720542,0.00006657433],"about_ca_topic_score_codex":0.0007540657,"about_ca_topic_score_gemma":0.00061843335,"teacher_disagreement_score":0.004794687,"about_ca_system_score_codex":0.0016383764,"about_ca_system_score_gemma":0.0006932644,"threshold_uncertainty_score":0.016039848},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021974677,0.00015360054,0.97176784,0.00019249167,0.00006067316,0.00004456984,0.00022959539,0.0031914294,0.0023851204],"genre_scores_gemma":[0.3703381,0.00076879177,0.6227004,0.00012628052,0.00006929877,0.00010024808,0.0007619787,0.0025829046,0.002551995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948394,0.000110943816,0.000038976676,0.000057158675,0.0002632249,0.000045754157],"domain_scores_gemma":[0.99819607,0.0006931979,0.00009561583,0.0006294009,0.00027049292,0.00011522082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094992144,0.00087434484,0.0011195382,0.0020142116,0.00064993266,0.0040614973,0.0013392027,0.0008258231,0.006217632],"category_scores_gemma":[0.005513053,0.0006302122,0.0008327489,0.0022205524,0.0009742086,0.0037887478,0.0030599877,0.0016842938,0.0014660228],"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.00059106335,0.00014709015,0.0019101618,0.00042425861,0.000069246955,0.0006829637,0.0016384581,0.11895994,0.053087004,0.2143753,0.0154403215,0.5926742],"study_design_scores_gemma":[0.000054204625,0.00008579629,0.00052446395,0.00006261965,0.000033739652,0.00038939924,0.00026050123,0.7982465,0.026643408,0.14706582,0.026555007,0.00007851313],"about_ca_topic_score_codex":0.0012852001,"about_ca_topic_score_gemma":0.0014235121,"teacher_disagreement_score":0.006217632,"about_ca_system_score_codex":0.00044264275,"about_ca_system_score_gemma":0.00068581384,"threshold_uncertainty_score":0.020800054},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19530769,0.0011475893,0.6592507,0.00060499954,0.00046208192,0.0001545176,0.0006738632,0.001038778,0.14135972],"genre_scores_gemma":[0.7637871,0.0008953899,0.17300066,0.00027280336,0.0002273795,0.00016020192,0.0013407794,0.00043266275,0.059883013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995072,0.000074199175,0.00003588931,0.00015213534,0.00015872298,0.000071847746],"domain_scores_gemma":[0.999014,0.00026228745,0.00018102281,0.00017755333,0.00020950424,0.00015559117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045441923,0.00060007896,0.0006427884,0.0019456466,0.00089147326,0.0026673921,0.0009663809,0.0007902804,0.011444296],"category_scores_gemma":[0.0020146929,0.00036483712,0.00048244392,0.0011495091,0.0014350367,0.0017621659,0.0016150152,0.0019078065,0.003231331],"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.00020456291,0.000031799394,0.00044790827,0.00006908111,0.000014245311,0.0002830654,0.00039156605,0.004858851,0.0061231493,0.93728477,0.0027406702,0.047550254],"study_design_scores_gemma":[0.000052475796,0.00015860092,0.0010696647,0.00006661704,0.00003251684,0.00097257923,0.00064566464,0.030273747,0.0074841357,0.88529664,0.07389905,0.00004825439],"about_ca_topic_score_codex":0.0004856023,"about_ca_topic_score_gemma":0.00035597017,"teacher_disagreement_score":0.011444296,"about_ca_system_score_codex":0.00059689744,"about_ca_system_score_gemma":0.00020746331,"threshold_uncertainty_score":0.038285017},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36904705,0.0064070183,0.5742204,0.011720541,0.0004105531,0.00030981365,0.0044622724,0.003782252,0.029640038],"genre_scores_gemma":[0.7866234,0.0026518714,0.18719676,0.0016998478,0.000531247,0.0006072478,0.0069657345,0.0011254547,0.012598425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951847,0.0011236682,0.00029654958,0.0017364299,0.0010414907,0.00061706494],"domain_scores_gemma":[0.9852196,0.0098929955,0.0011395577,0.0023578522,0.0007174815,0.0006725257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030345414,0.0032474524,0.0031046176,0.001191915,0.001577043,0.0052165263,0.0044772,0.003243715,0.008070049],"category_scores_gemma":[0.01962855,0.0013211595,0.0034507234,0.002412258,0.0033360906,0.01106333,0.0049524717,0.0067992895,0.00306923],"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.004372701,0.000713091,0.008858296,0.0021477535,0.0006126481,0.0006507763,0.0012149431,0.5684925,0.020700986,0.21463776,0.03451874,0.14307982],"study_design_scores_gemma":[0.00027510576,0.00048945274,0.0020309882,0.00011469865,0.0001727777,0.00096419593,0.00034064899,0.66205347,0.015301458,0.3067338,0.011417203,0.00010620644],"about_ca_topic_score_codex":0.0029276768,"about_ca_topic_score_gemma":0.0021729935,"teacher_disagreement_score":0.008070049,"about_ca_system_score_codex":0.0051431577,"about_ca_system_score_gemma":0.0018807326,"threshold_uncertainty_score":0.037316322},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53871703,0.0010119122,0.3945767,0.0015599139,0.00028801663,0.0001066569,0.0007662471,0.00051258237,0.062460892],"genre_scores_gemma":[0.95192987,0.00035415732,0.032341234,0.00024556526,0.00019190798,0.000059266396,0.00048427747,0.00014046984,0.014253246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992669,0.0001678386,0.000045390618,0.0001722887,0.00023630152,0.00011126521],"domain_scores_gemma":[0.99727637,0.0009766269,0.00035561502,0.00024261618,0.00052782934,0.00062093924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086648413,0.0007470844,0.0006992422,0.0020588965,0.0011717533,0.003261975,0.0009025245,0.00062791386,0.0058076424],"category_scores_gemma":[0.0039880523,0.00050121895,0.00056949357,0.0010144433,0.0027072423,0.003200429,0.002226266,0.0022571266,0.00056366296],"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.000065745844,0.00002050899,0.00052239303,0.000027585731,0.000007956897,0.00013816536,0.00016939276,0.0008717135,0.0019596813,0.9900355,0.0011100189,0.0050713303],"study_design_scores_gemma":[0.000021349602,0.000037555794,0.00092746457,0.000016813618,0.000009963621,0.00029124608,0.00021109135,0.014915254,0.0015011083,0.9786936,0.0033564076,0.000018165765],"about_ca_topic_score_codex":0.0007920612,"about_ca_topic_score_gemma":0.00064537453,"teacher_disagreement_score":0.0058076424,"about_ca_system_score_codex":0.00064475887,"about_ca_system_score_gemma":0.00035263167,"threshold_uncertainty_score":0.019428492},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46747708,0.0012993884,0.45126414,0.0023612627,0.00047262115,0.000102275546,0.0003255683,0.00031668157,0.07638095],"genre_scores_gemma":[0.9322658,0.00061725423,0.05251031,0.0006352236,0.00038529508,0.00011914913,0.0005121348,0.00035691838,0.012597853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99539596,0.000970724,0.00030196202,0.0013332538,0.001522151,0.00047592813],"domain_scores_gemma":[0.986623,0.0058831633,0.001124286,0.001855095,0.003544959,0.0009696214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055918046,0.0005788835,0.0010725852,0.0025100424,0.00234551,0.0031699375,0.0022795007,0.0015935821,0.0037820428],"category_scores_gemma":[0.023324946,0.0006782684,0.0012978795,0.0012093448,0.0072321477,0.005773561,0.0048527983,0.0053151716,0.00047783062],"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.000028577173,0.000010227864,0.00093341654,0.000024063338,0.000008477006,0.000093329756,0.00023487145,0.00086906384,0.0007842361,0.9931096,0.0003300322,0.003574287],"study_design_scores_gemma":[0.000026459415,0.000072047784,0.0016283336,0.000039168375,0.000015690594,0.00030063518,0.00024064994,0.020649051,0.0028823856,0.9686081,0.0054872106,0.00005022417],"about_ca_topic_score_codex":0.0020691345,"about_ca_topic_score_gemma":0.0012358475,"teacher_disagreement_score":0.0055918046,"about_ca_system_score_codex":0.0018399041,"about_ca_system_score_gemma":0.0010502522,"threshold_uncertainty_score":0.029572666},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31098652,0.019273318,0.41924366,0.024198612,0.0014101279,0.00009127069,0.0012790208,0.0006450848,0.2228724],"genre_scores_gemma":[0.9503269,0.0027825162,0.033839323,0.0009037678,0.0003508736,0.000036978297,0.00020564992,0.0000906279,0.011463321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997063,0.00006978807,0.000015869777,0.00008523868,0.000088682056,0.00003413993],"domain_scores_gemma":[0.9989957,0.00040393413,0.00008159055,0.00013138476,0.00023810065,0.00014933049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062079437,0.0003558682,0.00031413054,0.0015364285,0.0010209866,0.0022212204,0.0005810457,0.0006527179,0.0049617672],"category_scores_gemma":[0.001639205,0.00025997145,0.00034155758,0.0010860824,0.004223189,0.004793085,0.0018492258,0.0020108635,0.00073032867],"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.000006488872,0.0000030363983,0.00009501687,0.000019424528,0.0000018741762,0.00002043278,0.00014326145,0.00043932127,0.00043252917,0.9959735,0.00092095166,0.0019441126],"study_design_scores_gemma":[0.0000028557245,0.00000465332,0.00014325714,0.000014847588,0.0000030907206,0.00004392609,0.000098163015,0.0018218627,0.0002828094,0.9827769,0.014800196,0.0000074017557],"about_ca_topic_score_codex":0.002073418,"about_ca_topic_score_gemma":0.0017404974,"teacher_disagreement_score":0.0049617672,"about_ca_system_score_codex":0.0015930322,"about_ca_system_score_gemma":0.00040998272,"threshold_uncertainty_score":0.016598761},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95417863,0.00051022304,0.0285309,0.0006537566,0.000094770505,0.0000123655145,0.00006126773,0.00006847867,0.015889708],"genre_scores_gemma":[0.9968611,0.00010755717,0.0013084259,0.00003107209,0.00007682104,0.0000055795217,0.00004651679,0.0000064725555,0.0015565121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998992,0.00022580942,0.00006010915,0.00025407856,0.00029665162,0.00017131197],"domain_scores_gemma":[0.99806505,0.000518644,0.0003920699,0.00031146858,0.00023713343,0.00047562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001227422,0.00036968407,0.00054099684,0.001612592,0.0010032911,0.0024167853,0.00052364316,0.0005111334,0.0026753678],"category_scores_gemma":[0.0030223902,0.00023875377,0.00033721665,0.0009457235,0.004180709,0.0068257716,0.0034635568,0.0012302441,0.00023813017],"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.00005937772,0.000025116513,0.0024685261,0.00003135139,0.000015223596,0.00019010059,0.0008902625,0.0012484895,0.0018292355,0.9869206,0.00023319948,0.0060885875],"study_design_scores_gemma":[0.00001875754,0.00007122713,0.002119594,0.000014464613,0.000011488024,0.00023707173,0.00055640336,0.0053075473,0.0014250916,0.9860254,0.004194459,0.0000184971],"about_ca_topic_score_codex":0.0003393757,"about_ca_topic_score_gemma":0.00022111893,"teacher_disagreement_score":0.0026753678,"about_ca_system_score_codex":0.00065602263,"about_ca_system_score_gemma":0.00041109495,"threshold_uncertainty_score":0.008949935},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.212162,0.0075793574,0.66098726,0.0060188673,0.00046647302,0.00008858501,0.00035585035,0.0003218494,0.11201976],"genre_scores_gemma":[0.92218727,0.0021056226,0.06584709,0.00032656835,0.0005239152,0.00005523419,0.0001705272,0.00006609116,0.008717733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993266,0.00020342908,0.000034957957,0.000112807575,0.00024505818,0.0000772694],"domain_scores_gemma":[0.99797994,0.00110424,0.00016221967,0.00024907687,0.0002806112,0.00022385248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001842468,0.000313912,0.0005145788,0.002457294,0.0012730398,0.0025005736,0.00074590853,0.0006307284,0.0040318402],"category_scores_gemma":[0.003376866,0.0002723729,0.00055466464,0.0018034283,0.005817295,0.0051719225,0.002605002,0.0021742356,0.0004642053],"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.0000049197283,0.0000035290657,0.00012888471,0.000018690489,0.000002079073,0.000030575047,0.00018779728,0.0012925545,0.00019387394,0.9950649,0.0003691783,0.0027030522],"study_design_scores_gemma":[0.0000035050589,0.000008746713,0.00016246419,0.000011044994,0.0000019026387,0.000059731,0.000094691175,0.0068530375,0.00018721462,0.9876232,0.004987462,0.0000070703263],"about_ca_topic_score_codex":0.0016225955,"about_ca_topic_score_gemma":0.00089496945,"teacher_disagreement_score":0.0040318402,"about_ca_system_score_codex":0.0013685824,"about_ca_system_score_gemma":0.0005546736,"threshold_uncertainty_score":0.013487816},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013911839,0.002022476,0.9599435,0.0011233062,0.00014437459,0.000100705154,0.00057554734,0.012373658,0.00980463],"genre_scores_gemma":[0.19397716,0.0024636611,0.79533994,0.00023883814,0.00023088837,0.00013835751,0.0007592294,0.0017238182,0.0051280037],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997385,0.00006377028,0.000011292142,0.000031649157,0.00013058334,0.000024082894],"domain_scores_gemma":[0.99948955,0.00027710793,0.000020570349,0.00007109652,0.00006568747,0.000075944445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047429441,0.0006170604,0.0004690612,0.0010550924,0.00029202638,0.0011694373,0.0010165026,0.000718614,0.014320921],"category_scores_gemma":[0.0016286776,0.00031635998,0.00042872984,0.0011230267,0.0005378556,0.0014382121,0.0025522523,0.0006644834,0.0018408465],"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.00038800164,0.00008864272,0.0012080752,0.0006446592,0.00009247673,0.00056876923,0.0008612528,0.03758583,0.08429837,0.053539947,0.06225342,0.75847054],"study_design_scores_gemma":[0.00013796825,0.00013684314,0.0025933804,0.00022760061,0.000058627047,0.0016186453,0.00042553866,0.57299125,0.05059011,0.10675197,0.26435772,0.000110430505],"about_ca_topic_score_codex":0.00046617436,"about_ca_topic_score_gemma":0.000860539,"teacher_disagreement_score":0.014320921,"about_ca_system_score_codex":0.0002948666,"about_ca_system_score_gemma":0.00019941172,"threshold_uncertainty_score":0.047908187},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30529085,0.00046952092,0.59522504,0.0012425332,0.00067898846,0.0003049079,0.00027648054,0.001198163,0.095313594],"genre_scores_gemma":[0.8045013,0.00030104516,0.17179702,0.00026864596,0.00010655267,0.00017705516,0.0004244522,0.00054440903,0.021879561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999485,0.0000709114,0.00002381749,0.00015522426,0.0001528632,0.000112117115],"domain_scores_gemma":[0.999218,0.00015257932,0.00005777285,0.00012215895,0.00021832333,0.00023119169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003927793,0.00064437796,0.00080782874,0.002562924,0.0020980071,0.0021421064,0.0011232381,0.0014632222,0.009658351],"category_scores_gemma":[0.0016524997,0.0005443863,0.00072476495,0.0010733743,0.0026762227,0.0021943727,0.004176429,0.0021952009,0.0015708901],"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.00006298938,0.000045139685,0.00046274374,0.00006187311,0.00000930112,0.00055161654,0.000759018,0.0016335194,0.013550899,0.96319324,0.0015442542,0.0181254],"study_design_scores_gemma":[0.000041389358,0.00014279375,0.0010200404,0.00007312191,0.000030346811,0.0014508028,0.0010760055,0.023700438,0.016694847,0.8960794,0.059632376,0.00005832756],"about_ca_topic_score_codex":0.0013467387,"about_ca_topic_score_gemma":0.00097029767,"teacher_disagreement_score":0.009658351,"about_ca_system_score_codex":0.00084472843,"about_ca_system_score_gemma":0.0007621962,"threshold_uncertainty_score":0.032310367},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7690257,0.0017892746,0.16821983,0.0013755409,0.00017451796,0.000055469543,0.00017226546,0.0001824269,0.05900509],"genre_scores_gemma":[0.9832328,0.00033115892,0.0108150225,0.00009895861,0.00009593785,0.000026173078,0.00007662551,0.000018704324,0.0053045447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958664,0.00011165388,0.000021660477,0.00007431016,0.00012179157,0.000083974606],"domain_scores_gemma":[0.9995216,0.00012349483,0.00007487205,0.000070690505,0.00008372558,0.00012562083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069575437,0.00032900213,0.00046964549,0.001943124,0.0012384462,0.002522103,0.00041890886,0.00066599966,0.0031875158],"category_scores_gemma":[0.0011505915,0.00024412363,0.00042678867,0.00091838295,0.0027316618,0.0032110065,0.0021382621,0.00084140274,0.00028872892],"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.000006602727,0.000005466904,0.00029280514,0.00000807738,0.0000035505357,0.00007043977,0.00019332688,0.0005368678,0.00055045425,0.9966624,0.00016007596,0.0015100164],"study_design_scores_gemma":[0.000008382908,0.00003069775,0.00119121,0.000019076815,0.000011182162,0.00015932856,0.00032081152,0.008574766,0.00071057887,0.98096704,0.0079946,0.0000123593945],"about_ca_topic_score_codex":0.0012107897,"about_ca_topic_score_gemma":0.001054678,"teacher_disagreement_score":0.0031875158,"about_ca_system_score_codex":0.0012687093,"about_ca_system_score_gemma":0.00032004493,"threshold_uncertainty_score":0.010663271},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98096234,0.00050678954,0.008346133,0.0005590641,0.0000500148,0.000024100294,0.000071903814,0.00010201229,0.009377602],"genre_scores_gemma":[0.9972331,0.00016058945,0.0013340379,0.000024908268,0.0000522491,0.000026482468,0.000074897434,0.000027770015,0.0010658393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998292,0.00004203534,0.000010403008,0.00003135794,0.00003744731,0.000049657814],"domain_scores_gemma":[0.997561,0.001030147,0.0005550385,0.00012356116,0.00019280378,0.00053756894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084195967,0.00042002872,0.0005280501,0.0035324825,0.0017263439,0.0020531456,0.0007093107,0.000672021,0.0037437964],"category_scores_gemma":[0.00627671,0.0003343602,0.00047301422,0.0007955055,0.0028594134,0.0021822127,0.0012046765,0.0010069855,0.00026302558],"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.0001921506,0.000051741747,0.005958245,0.00010925267,0.000033046006,0.00045178854,0.0011485601,0.039748713,0.0052104346,0.9410199,0.0022655458,0.003810654],"study_design_scores_gemma":[0.000081168044,0.000095422496,0.008411936,0.00009502437,0.00004242901,0.00051407673,0.00066152884,0.34388697,0.0027836666,0.6411878,0.0021766145,0.00006338596],"about_ca_topic_score_codex":0.0014517261,"about_ca_topic_score_gemma":0.0011509516,"teacher_disagreement_score":0.0037437964,"about_ca_system_score_codex":0.0020538676,"about_ca_system_score_gemma":0.00049575255,"threshold_uncertainty_score":0.014901936},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8466998,0.0006315011,0.14619292,0.00060694077,0.00013618302,0.000034894365,0.0008156897,0.0002345101,0.0046475735],"genre_scores_gemma":[0.93895215,0.00069368305,0.053040422,0.00008050821,0.00020559001,0.000074099626,0.0010172417,0.00017407743,0.0057620862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994679,0.000096934295,0.00004465716,0.00012900663,0.00021921321,0.00004227027],"domain_scores_gemma":[0.99612373,0.0012973322,0.0008652354,0.00022833614,0.0006283851,0.00085694634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066108385,0.00066261314,0.0006777679,0.0027801504,0.0007502232,0.0016544146,0.0011094919,0.0014119712,0.002593239],"category_scores_gemma":[0.006052669,0.0004042427,0.0003745336,0.0015040189,0.001784552,0.003912355,0.0016257671,0.0009016632,0.000434311],"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.00076491886,0.00022349993,0.028460275,0.0006974902,0.00026668186,0.0011172504,0.0014351786,0.115667924,0.06811513,0.68141806,0.004655625,0.09717792],"study_design_scores_gemma":[0.000037788468,0.00047045673,0.009399565,0.000105727806,0.00007704093,0.0008618602,0.00056010985,0.3611473,0.009798794,0.6093086,0.008104389,0.00012834542],"about_ca_topic_score_codex":0.0007580326,"about_ca_topic_score_gemma":0.00093938113,"teacher_disagreement_score":0.0027801504,"about_ca_system_score_codex":0.0009884593,"about_ca_system_score_gemma":0.0005595677,"threshold_uncertainty_score":0.008675277},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48988524,0.0019754816,0.50553674,0.00042399575,0.00004859677,0.0002308747,0.00037710962,0.0007122841,0.00080957473],"genre_scores_gemma":[0.8594135,0.00045861106,0.13892145,0.000067998415,0.000074858566,0.0001143166,0.00052520283,0.00007672688,0.00034731752],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813086,0.00038943606,0.00021557813,0.00040538295,0.0006642965,0.00019448744],"domain_scores_gemma":[0.9732519,0.018392792,0.003572119,0.001617196,0.0021517512,0.0010142318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032617578,0.00077252055,0.0015574812,0.008629472,0.0011103245,0.0030089584,0.0014010592,0.0016721444,0.0010270772],"category_scores_gemma":[0.022862058,0.0010112652,0.00092770974,0.0025859305,0.0020556424,0.0037051402,0.0031470053,0.0014172379,0.00021567616],"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.004564397,0.0008564752,0.17361319,0.002180346,0.00061341503,0.0060000126,0.0039267195,0.15740986,0.120216034,0.13927795,0.00772338,0.38361818],"study_design_scores_gemma":[0.00012105965,0.0004068038,0.018418971,0.00019339597,0.00017534767,0.0022061272,0.00090674125,0.8384024,0.038821325,0.09695916,0.0033125838,0.000076173186],"about_ca_topic_score_codex":0.0011796852,"about_ca_topic_score_gemma":0.0010837797,"teacher_disagreement_score":0.008629472,"about_ca_system_score_codex":0.0010036831,"about_ca_system_score_gemma":0.0009416819,"threshold_uncertainty_score":0.017250061},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.785199,0.0007216506,0.19564681,0.0010108383,0.000036913163,0.00002255966,0.000112052076,0.00009243313,0.017157944],"genre_scores_gemma":[0.98338586,0.00026198968,0.013074244,0.000067400506,0.000041814343,0.000019605146,0.00010567941,0.000023596642,0.0030198616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992982,0.00021367593,0.000035850815,0.00011722508,0.00022645472,0.000108591805],"domain_scores_gemma":[0.9973109,0.0012655408,0.0005153983,0.00052695785,0.00020308034,0.00017814965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007337197,0.00031210957,0.0005806266,0.0012851567,0.00088513247,0.001553083,0.00054180756,0.0004956583,0.0017359746],"category_scores_gemma":[0.0032311126,0.00026909815,0.0004422973,0.0008877817,0.0029874456,0.0030176553,0.0018184668,0.0010258798,0.00017118361],"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.000021711012,0.000010213858,0.0019265743,0.000022422291,0.000011764535,0.00017015745,0.000503773,0.002230227,0.0018400504,0.9890427,0.00029153808,0.003928885],"study_design_scores_gemma":[0.0000072420066,0.000030744217,0.0012292546,0.000011631758,0.000017517845,0.0004180661,0.00034134876,0.015111477,0.001962265,0.9773859,0.0034722935,0.00001227241],"about_ca_topic_score_codex":0.00042675468,"about_ca_topic_score_gemma":0.0005349225,"teacher_disagreement_score":0.0017359746,"about_ca_system_score_codex":0.00055039284,"about_ca_system_score_gemma":0.00019955305,"threshold_uncertainty_score":0.0058074594},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5123687,0.0019734984,0.4686118,0.0030448444,0.00011341665,0.00007407931,0.0016202668,0.0004288725,0.011764431],"genre_scores_gemma":[0.9466381,0.00058836833,0.050386563,0.00009211321,0.00012275971,0.000089408095,0.0011225641,0.00009539797,0.00086464995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767524,0.0011265061,0.00011400784,0.00037402113,0.00059472997,0.00011540059],"domain_scores_gemma":[0.9843456,0.009922092,0.0024092328,0.001730412,0.001139881,0.00045274943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034399063,0.00037124968,0.0005939048,0.004091278,0.0009982641,0.0026626075,0.0006122531,0.000491481,0.0025239247],"category_scores_gemma":[0.02652614,0.00021511364,0.0005361951,0.0034498707,0.003468702,0.0025801864,0.002548401,0.0011609863,0.00026856732],"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.00039787093,0.000080824866,0.04427773,0.00023554813,0.00019188554,0.00032815227,0.0011293815,0.06285038,0.005241539,0.6672089,0.007582287,0.21047547],"study_design_scores_gemma":[0.000040495845,0.00016148473,0.039697453,0.00009742764,0.00005960849,0.00062448817,0.00093120866,0.20923384,0.0022947132,0.7335328,0.013234355,0.00009211632],"about_ca_topic_score_codex":0.0012114507,"about_ca_topic_score_gemma":0.0012795987,"teacher_disagreement_score":0.004091278,"about_ca_system_score_codex":0.00094914477,"about_ca_system_score_gemma":0.0009933175,"threshold_uncertainty_score":0.018192172},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96291196,0.00006025024,0.034726225,0.00006268524,0.000008623689,0.000015067387,0.000051145027,0.00006113528,0.002102945],"genre_scores_gemma":[0.9897982,0.000060026323,0.008632415,0.000015965285,0.000008277429,0.000008800789,0.00014983506,0.000015928603,0.0013105893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922025,0.00014907887,0.00006904017,0.00018979704,0.00023921562,0.00013262736],"domain_scores_gemma":[0.99805164,0.0007716935,0.00031164533,0.0002970189,0.0002815312,0.00028657127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075780915,0.00032670167,0.00045854322,0.0011647596,0.00072050083,0.0020949228,0.0006351038,0.0007077172,0.0035957783],"category_scores_gemma":[0.0043114424,0.0004455914,0.00041880982,0.00061306276,0.0015975923,0.0028177868,0.0014334148,0.00075710786,0.00035625364],"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.0013802666,0.00016249435,0.05907312,0.000287869,0.00009009988,0.0025944335,0.003262845,0.0597902,0.03655979,0.7804117,0.0016933659,0.054693896],"study_design_scores_gemma":[0.00009507586,0.00038550663,0.015113839,0.00008596148,0.000059348593,0.0016810502,0.0042703995,0.31319478,0.028595842,0.62882984,0.0076241815,0.00006425754],"about_ca_topic_score_codex":0.0023042304,"about_ca_topic_score_gemma":0.0016230133,"teacher_disagreement_score":0.0035957783,"about_ca_system_score_codex":0.0009201431,"about_ca_system_score_gemma":0.00020229603,"threshold_uncertainty_score":0.012029052},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74966675,0.0007559972,0.17126034,0.00073759834,0.00032565245,0.000093622744,0.0003692569,0.001433293,0.07535752],"genre_scores_gemma":[0.92283297,0.0005491016,0.047422726,0.00021479168,0.00010283404,0.000050501905,0.0003665404,0.00078669237,0.027673906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995028,0.00014043238,0.000027922282,0.00011580078,0.000100602556,0.00011258724],"domain_scores_gemma":[0.9975829,0.0007780063,0.00043791952,0.00054374646,0.0002658511,0.00039151032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043950742,0.00083504815,0.0011648823,0.0025850171,0.0022502225,0.0030293798,0.0010186271,0.0023649728,0.0109842485],"category_scores_gemma":[0.0038135264,0.00088794075,0.00084595976,0.0019098723,0.0021939394,0.0033872616,0.0025495868,0.0018559421,0.0026318005],"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.00020548303,0.00006483829,0.0011350211,0.00007602125,0.000020488884,0.00067835307,0.0008515305,0.008668534,0.005888833,0.95853496,0.0028786885,0.020997291],"study_design_scores_gemma":[0.000023447015,0.00006490731,0.0007252126,0.000052690524,0.000018160088,0.00041643868,0.00049321866,0.030416401,0.0018904479,0.9604343,0.0054463777,0.000018362365],"about_ca_topic_score_codex":0.001114278,"about_ca_topic_score_gemma":0.0015996294,"teacher_disagreement_score":0.0109842485,"about_ca_system_score_codex":0.0006048659,"about_ca_system_score_gemma":0.0002555677,"threshold_uncertainty_score":0.036745965},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5601833,0.0016137168,0.32164454,0.0027040371,0.0004113526,0.00016709122,0.0017253062,0.00039079855,0.11115982],"genre_scores_gemma":[0.90094256,0.00073130167,0.07777031,0.00038515247,0.00026862565,0.00019033538,0.00068651786,0.00012574234,0.018899554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925286,0.00014629208,0.00004057541,0.00024038723,0.00018473856,0.00013508726],"domain_scores_gemma":[0.9986058,0.00047407713,0.00018103479,0.0002040052,0.00031271714,0.00022237864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000682674,0.0003040681,0.00033388843,0.0018912347,0.0014174526,0.0018575179,0.00058063766,0.0004892108,0.004510925],"category_scores_gemma":[0.0026462614,0.0002231241,0.00041105694,0.0012309221,0.0027631407,0.004205212,0.0017656292,0.0016257757,0.00062402076],"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.000050486775,0.000013477997,0.00048020354,0.000034147673,0.0000047016974,0.000034681387,0.00023881438,0.00064268045,0.0030034713,0.98684156,0.0009923312,0.007663422],"study_design_scores_gemma":[0.000017213211,0.00006224508,0.0015755307,0.00003105102,0.000012312502,0.00032528918,0.0002872866,0.009937781,0.0035247041,0.941318,0.042873923,0.00003457684],"about_ca_topic_score_codex":0.0007493093,"about_ca_topic_score_gemma":0.00086219236,"teacher_disagreement_score":0.004510925,"about_ca_system_score_codex":0.0011109117,"about_ca_system_score_gemma":0.0005224344,"threshold_uncertainty_score":0.015090585},"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020555392,0.0347496,0.0016257606,0.7823526,0.17384829,0.000018909886,0.00018395798,0.00012225377,0.0068930034],"genre_scores_gemma":[0.014541462,0.038927115,0.004247451,0.58745277,0.21659243,0.00007977471,0.00023552927,0.0005609702,0.13736258],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978669,0.00046817114,0.00025729937,0.00057413656,0.00074067764,0.000092814786],"domain_scores_gemma":[0.98583543,0.003854136,0.0006759892,0.00083355705,0.007000586,0.0018002532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036296146,0.0011295516,0.001568188,0.0017899121,0.0024014602,0.0046871696,0.001594921,0.0068303766,0.01980488],"category_scores_gemma":[0.03522952,0.00048613374,0.00067941897,0.0012708736,0.0070829783,0.006552239,0.0031950714,0.016432391,0.019698234],"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.000021257876,0.0000058064056,0.00014024567,0.000041330615,0.000013148585,0.000056702538,0.00003740903,0.00002880676,0.000029189943,0.0029278602,0.9778495,0.018848661],"study_design_scores_gemma":[0.0000121295525,0.000011190885,0.00042659137,0.00020313558,0.000010023516,0.00043206985,0.00011004758,0.00008558826,0.00011028523,0.008053773,0.9905158,0.00002932771],"about_ca_topic_score_codex":0.008333382,"about_ca_topic_score_gemma":0.012181044,"teacher_disagreement_score":0.01980488,"about_ca_system_score_codex":0.0023981677,"about_ca_system_score_gemma":0.002816703,"threshold_uncertainty_score":0.0662539},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09640822,0.00343312,0.6089604,0.011660194,0.0010625678,0.000055545857,0.0004999888,0.00054495817,0.277375],"genre_scores_gemma":[0.8946375,0.0014941996,0.072001025,0.001284095,0.0016918645,0.000075282296,0.00031885545,0.00021134816,0.028285779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990521,0.00033736113,0.000055556528,0.00023663587,0.00023301116,0.000085442676],"domain_scores_gemma":[0.99862206,0.0005992803,0.00015069985,0.0002734861,0.00023838141,0.00011618204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012396614,0.00053213316,0.000549837,0.0024827549,0.0016927184,0.0025555624,0.0013166042,0.001619544,0.013546511],"category_scores_gemma":[0.0041055074,0.00047788164,0.0007466687,0.0019328026,0.0073757404,0.006793496,0.0032387467,0.0028171246,0.0011224161],"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.0000039688075,0.0000027377002,0.000035916433,0.000009782516,0.0000014936949,0.000027193724,0.00009877147,0.00021938312,0.0001347747,0.99703974,0.00038287666,0.00204332],"study_design_scores_gemma":[0.0000038107305,0.0000060801704,0.000093256225,0.000005098869,0.0000023514272,0.00006800697,0.00004702213,0.0010527782,0.00007475803,0.9948703,0.003772394,0.0000042498273],"about_ca_topic_score_codex":0.00065414776,"about_ca_topic_score_gemma":0.00052773894,"teacher_disagreement_score":0.013546511,"about_ca_system_score_codex":0.00082728616,"about_ca_system_score_gemma":0.00039977388,"threshold_uncertainty_score":0.04531753},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124804944,0.001104927,0.7880805,0.0027903996,0.00033957683,0.00008785042,0.0012891777,0.00294968,0.078552976],"genre_scores_gemma":[0.7331636,0.001028458,0.214554,0.0010335526,0.00032198703,0.0001538135,0.0016701368,0.0018020879,0.04627229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991099,0.00011654038,0.000045489218,0.00040297813,0.00019305584,0.00013192915],"domain_scores_gemma":[0.99830306,0.0003032014,0.0001638037,0.0007233054,0.00038475177,0.000121923425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008954407,0.0007736374,0.00093720166,0.0015342883,0.000990522,0.0042317864,0.0008684641,0.0008688966,0.01648782],"category_scores_gemma":[0.004618917,0.0003751082,0.0008876387,0.0014406869,0.0022439985,0.010648924,0.002354141,0.002040734,0.005081688],"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.00007527291,0.000041593325,0.0047581773,0.00015307554,0.000055794808,0.00027805025,0.0009941054,0.008167132,0.0062055076,0.8893907,0.009450157,0.08043034],"study_design_scores_gemma":[0.000015107901,0.00004060906,0.0020425592,0.00008976991,0.00006304974,0.00031300372,0.0005877059,0.045152195,0.0062847883,0.9100967,0.03525203,0.00006250208],"about_ca_topic_score_codex":0.0033595818,"about_ca_topic_score_gemma":0.0040344526,"teacher_disagreement_score":0.01648782,"about_ca_system_score_codex":0.0012114033,"about_ca_system_score_gemma":0.0011140582,"threshold_uncertainty_score":0.055157185},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73188037,0.0026040555,0.18527909,0.00078899553,0.00013470968,0.000091715745,0.00029775314,0.00032340843,0.07859985],"genre_scores_gemma":[0.9549103,0.0005445323,0.04251588,0.000057137648,0.00006088968,0.000039644652,0.00015000095,0.00003660361,0.0016850311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996493,0.000092084345,0.000029028814,0.000064151296,0.000114879855,0.000050575705],"domain_scores_gemma":[0.99895585,0.0005419013,0.0001528053,0.00013909976,0.00009837178,0.00011200434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039010687,0.00042388838,0.0004260084,0.0027915877,0.0019104577,0.0010880361,0.0003667528,0.0007484348,0.0020876543],"category_scores_gemma":[0.0025186962,0.000274168,0.00031715483,0.0016539374,0.0021705446,0.0022835918,0.0009769691,0.0008871893,0.00013808373],"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.0000711462,0.000029568706,0.00166535,0.000118126816,0.000013429333,0.0013144762,0.0018456436,0.005387558,0.007899922,0.9667518,0.0015999646,0.013302911],"study_design_scores_gemma":[0.000029483177,0.00006650108,0.0047370135,0.000084174746,0.000025377334,0.0028999716,0.001434671,0.036129236,0.0064105876,0.9267431,0.021342397,0.00009740975],"about_ca_topic_score_codex":0.0010181057,"about_ca_topic_score_gemma":0.001558113,"teacher_disagreement_score":0.0027915877,"about_ca_system_score_codex":0.000497031,"about_ca_system_score_gemma":0.00012399493,"threshold_uncertainty_score":0.006983876},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7638748,0.0013030032,0.2117766,0.005497378,0.0000881292,0.00019087717,0.0039203814,0.0008053407,0.012543456],"genre_scores_gemma":[0.95984757,0.00053463434,0.03405684,0.0002951017,0.00016254596,0.00013164515,0.0023283246,0.00012522376,0.0025181363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99721247,0.00065302337,0.00017174766,0.00050446263,0.0009272477,0.000531002],"domain_scores_gemma":[0.95616996,0.036322247,0.0022476313,0.0022138385,0.0013153304,0.0017309268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022345802,0.00063685095,0.0019667242,0.0019997938,0.0012037834,0.00519612,0.0022114506,0.0019665968,0.008021026],"category_scores_gemma":[0.023378091,0.0007583198,0.0015196003,0.0026353274,0.001904438,0.010024414,0.0021152636,0.0033825326,0.00045875192],"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.0017089256,0.0007107006,0.022028118,0.00073008955,0.0003239263,0.00059603323,0.000903891,0.20113118,0.0070939166,0.64946485,0.02162479,0.093683615],"study_design_scores_gemma":[0.00009995323,0.000090569214,0.0025241533,0.00003283827,0.00008545181,0.0003718717,0.00015231442,0.42589343,0.00153423,0.5675629,0.0016263473,0.000026000955],"about_ca_topic_score_codex":0.002274257,"about_ca_topic_score_gemma":0.0027137655,"teacher_disagreement_score":0.008021026,"about_ca_system_score_codex":0.0027831926,"about_ca_system_score_gemma":0.0018984798,"threshold_uncertainty_score":0.026832998},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1020686,0.06666248,0.12186881,0.057786755,0.012395994,0.00015163979,0.0018854968,0.0010351769,0.63614506],"genre_scores_gemma":[0.7020942,0.03989943,0.0355505,0.004983887,0.009349447,0.0002804062,0.0019192958,0.00063267216,0.20529026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996418,0.000091951406,0.000018099123,0.00006903762,0.00015322158,0.000025823443],"domain_scores_gemma":[0.99948287,0.00027009667,0.000031320815,0.000040053666,0.00012604089,0.000049533355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008794842,0.00058118085,0.0004230487,0.0016496794,0.0006596703,0.0012713011,0.0005259968,0.00061645784,0.014914677],"category_scores_gemma":[0.0026183135,0.00035308936,0.00056422496,0.0015604782,0.0016254754,0.003282679,0.0017562339,0.0020762912,0.002293983],"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.000023462837,0.00005272371,0.0003820991,0.00020109607,0.000014556406,0.00012392194,0.0004078414,0.0013344985,0.0014708042,0.91469365,0.048751377,0.032544028],"study_design_scores_gemma":[0.000012688591,0.000022691525,0.0012839825,0.00011638116,0.000012065362,0.000119862234,0.00016962418,0.0019380358,0.00075202587,0.8698818,0.12566496,0.000025798638],"about_ca_topic_score_codex":0.0024844052,"about_ca_topic_score_gemma":0.001571024,"teacher_disagreement_score":0.014914677,"about_ca_system_score_codex":0.0016805393,"about_ca_system_score_gemma":0.0007470495,"threshold_uncertainty_score":0.04989451},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10480651,0.00020316287,0.8887126,0.00039818085,0.000061426246,0.00006810162,0.0001520774,0.0001693439,0.0054287296],"genre_scores_gemma":[0.8197587,0.0002530832,0.17448185,0.00011536461,0.00009722237,0.00016235167,0.00028484355,0.00013349768,0.0047130906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996407,0.00011092439,0.000019416913,0.00009671935,0.000090076974,0.000042142805],"domain_scores_gemma":[0.9984925,0.0006160618,0.00021575353,0.00016307566,0.0002213877,0.00029114247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010526272,0.00043718377,0.0007264695,0.0019718758,0.0011263507,0.0016657409,0.0015719037,0.0010759194,0.0037447838],"category_scores_gemma":[0.0040298514,0.0004974979,0.00076284254,0.0006447377,0.0020351335,0.0026899073,0.0021813035,0.0018752428,0.00031960433],"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.000024576597,0.00002024222,0.00042787014,0.000030423651,0.0000111497175,0.00008546768,0.00015597547,0.025006758,0.0018795423,0.9672113,0.0004419341,0.004704671],"study_design_scores_gemma":[0.000019095793,0.000029220364,0.00026168546,0.000012715543,0.00000767838,0.00006138081,0.000057157304,0.39716792,0.0006706166,0.6003538,0.0013423087,0.000016504153],"about_ca_topic_score_codex":0.00160126,"about_ca_topic_score_gemma":0.0014913604,"teacher_disagreement_score":0.0037447838,"about_ca_system_score_codex":0.0013743555,"about_ca_system_score_gemma":0.0008308776,"threshold_uncertainty_score":0.012527525},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84607655,0.00018320794,0.1426925,0.000115272975,0.000033412376,0.00004929151,0.00012072995,0.00012375621,0.010605225],"genre_scores_gemma":[0.9757238,0.00007864235,0.021195289,0.000024191424,0.000013031776,0.000036718026,0.00020790419,0.00004874272,0.002671649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884593,0.00016127464,0.00008264186,0.00020875626,0.00055908336,0.00014231353],"domain_scores_gemma":[0.9978326,0.0003997613,0.00041585488,0.00051236583,0.00036670396,0.0004727499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057830085,0.0002951974,0.0006305373,0.0015210623,0.0010384396,0.0026542898,0.00084951794,0.0004903918,0.0018622857],"category_scores_gemma":[0.0033124038,0.00037813705,0.000655641,0.00086230744,0.0026487994,0.0017740494,0.0027017454,0.0011296398,0.00035715703],"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.000168457,0.000084813735,0.007095089,0.00006500037,0.000045503282,0.00038201924,0.0018238871,0.017959222,0.025373664,0.924032,0.00059331657,0.022377087],"study_design_scores_gemma":[0.000051729487,0.00017966615,0.009633368,0.0000642102,0.00004705072,0.0012498437,0.0014391143,0.16775005,0.016503604,0.78584117,0.017162964,0.0000771992],"about_ca_topic_score_codex":0.0018347026,"about_ca_topic_score_gemma":0.0015527575,"teacher_disagreement_score":0.0026542898,"about_ca_system_score_codex":0.00093908986,"about_ca_system_score_gemma":0.0002982327,"threshold_uncertainty_score":0.0068135858},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34938467,0.00055935176,0.6455761,0.00015399845,0.000020305,0.00007043144,0.00010369193,0.00035463768,0.0037767172],"genre_scores_gemma":[0.9234452,0.00027327574,0.07509113,0.000024060733,0.000022732695,0.00003361303,0.00010074243,0.00006270751,0.0009463872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997737,0.000050217335,0.00001415493,0.00004801121,0.000071143666,0.000042803786],"domain_scores_gemma":[0.9985297,0.0006914488,0.00025570544,0.00010949228,0.00024823588,0.00016547336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091264845,0.0004136046,0.00045835023,0.0049991813,0.00062176277,0.001257204,0.00047392526,0.00047564073,0.0018025537],"category_scores_gemma":[0.0027494845,0.00021330509,0.00031069372,0.0009116569,0.0016627223,0.0018747046,0.0012027291,0.0005244234,0.00018896241],"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.0005286259,0.00012983136,0.010970165,0.0004470805,0.00006574635,0.0010040186,0.0014550972,0.13933702,0.11950861,0.5932567,0.0017109743,0.13158615],"study_design_scores_gemma":[0.000023046901,0.0001257304,0.005510228,0.000056393957,0.000021888794,0.00060463324,0.00033786267,0.732418,0.026626352,0.23082846,0.0033863268,0.00006108466],"about_ca_topic_score_codex":0.0009391888,"about_ca_topic_score_gemma":0.00034410163,"teacher_disagreement_score":0.0049991813,"about_ca_system_score_codex":0.00060944026,"about_ca_system_score_gemma":0.00041280108,"threshold_uncertainty_score":0.006030202},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8702848,0.0009948241,0.10309489,0.0005379572,0.000032282478,0.00004039194,0.00020931587,0.00010933797,0.02469623],"genre_scores_gemma":[0.97502565,0.0005452531,0.021452608,0.00007382852,0.000047338654,0.000048591945,0.0001901882,0.000050819515,0.0025657418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997491,0.00007032415,0.000008546686,0.00007215646,0.000046581226,0.000053262967],"domain_scores_gemma":[0.9984604,0.0008400244,0.00027747414,0.0001263728,0.00011950026,0.00017624047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049714337,0.0005259479,0.0004065572,0.001902935,0.0010040036,0.0011630196,0.00070125394,0.0006069139,0.0030658946],"category_scores_gemma":[0.0021848965,0.00023582013,0.00030752606,0.0015745373,0.0019731629,0.002239262,0.00089763314,0.0007979129,0.00029204588],"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.000146774,0.000050531617,0.0030738784,0.00013930954,0.00002373314,0.00016644412,0.00037663218,0.03490758,0.011071012,0.9305,0.0017063655,0.017837692],"study_design_scores_gemma":[0.000030598938,0.000065261665,0.002064881,0.000037401216,0.000023910561,0.00032346888,0.00033866012,0.09073763,0.0042379857,0.89863193,0.003473783,0.000034391927],"about_ca_topic_score_codex":0.0009944784,"about_ca_topic_score_gemma":0.0015226252,"teacher_disagreement_score":0.0030658946,"about_ca_system_score_codex":0.0011544906,"about_ca_system_score_gemma":0.00027678444,"threshold_uncertainty_score":0.01025641},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06943831,0.00005685957,0.92844313,0.000110841924,0.000016743952,0.000043645494,0.00006411797,0.00053447514,0.0012918798],"genre_scores_gemma":[0.72126466,0.00006242739,0.27722475,0.000031144275,0.000018973931,0.000072244446,0.00016421893,0.00008775407,0.001073823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980396,0.00004145943,0.000008231799,0.000052342097,0.000063530366,0.00003052063],"domain_scores_gemma":[0.9989188,0.0005992889,0.0001363265,0.00008948844,0.00018772535,0.00006847048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055230333,0.00048062074,0.0007045097,0.0009897844,0.000518175,0.00078011764,0.00091183535,0.00063933554,0.0011307131],"category_scores_gemma":[0.0033002244,0.0003396094,0.00038940596,0.000641318,0.0008960151,0.0012295013,0.0008040809,0.0005642857,0.00015512385],"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.00008241401,0.000023725186,0.0016700883,0.000037721806,0.000010998231,0.000080017235,0.00007076017,0.95705205,0.0027056888,0.01214532,0.00061736454,0.02550389],"study_design_scores_gemma":[0.0000056086133,0.0000074479553,0.00011333444,0.0000013803833,9.335082e-7,0.000009983018,0.0000084716285,0.99586344,0.0003707242,0.0035071725,0.0001092693,0.0000023543355],"about_ca_topic_score_codex":0.0056305295,"about_ca_topic_score_gemma":0.00706783,"teacher_disagreement_score":0.0056305295,"about_ca_system_score_codex":0.0010156682,"about_ca_system_score_gemma":0.0010504354,"threshold_uncertainty_score":0.011195481},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34314495,0.0009820038,0.6153131,0.0014442065,0.0002913857,0.000106244384,0.00041326866,0.0011434718,0.037161324],"genre_scores_gemma":[0.77221155,0.0011046138,0.18398266,0.00050031306,0.0005724122,0.00028665946,0.00080176035,0.00070006115,0.039840043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977106,0.0005042701,0.00014958164,0.0006074794,0.0006386826,0.00038929065],"domain_scores_gemma":[0.9879203,0.0072945985,0.0011816727,0.0014444187,0.0012098163,0.0009491294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018830746,0.0010184258,0.0015196045,0.006013991,0.0031700807,0.00539878,0.0025547405,0.0018656568,0.007526094],"category_scores_gemma":[0.01692954,0.0013528005,0.0009994416,0.006095762,0.0043315226,0.011317968,0.005112795,0.0029448646,0.0010788837],"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.00003285056,0.000018345256,0.0004799049,0.000032504304,0.0000069821253,0.000060716717,0.0002322082,0.0016558913,0.00053437863,0.98782,0.0009078197,0.00821831],"study_design_scores_gemma":[0.000007679621,0.0000126078985,0.00025196857,0.000016848673,0.000012886051,0.00011415718,0.00012478132,0.017047193,0.00077906216,0.97794616,0.0036724494,0.000014229076],"about_ca_topic_score_codex":0.002934653,"about_ca_topic_score_gemma":0.0023044804,"teacher_disagreement_score":0.007526094,"about_ca_system_score_codex":0.0022560616,"about_ca_system_score_gemma":0.0009854246,"threshold_uncertainty_score":0.0251773},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87544227,0.0002926618,0.095972255,0.00081568817,0.000055311997,0.00006351108,0.0004915996,0.00093069405,0.025935952],"genre_scores_gemma":[0.9709986,0.0002264755,0.020017806,0.00019282122,0.000052644456,0.000047976857,0.0005833187,0.00015982971,0.007720535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926084,0.00017003834,0.00004347391,0.00019896071,0.00020733933,0.00011925086],"domain_scores_gemma":[0.9952749,0.002330305,0.00080041133,0.00058911834,0.00034745358,0.00065789383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005894307,0.0004863219,0.0007268029,0.002249877,0.0019294932,0.003180501,0.0011067195,0.001313034,0.0057352614],"category_scores_gemma":[0.004723576,0.00087933935,0.00063799793,0.0023871604,0.0017166277,0.0043953005,0.0017570574,0.0014324083,0.00065785897],"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.00028606315,0.00014991287,0.0055541354,0.00017371419,0.000037225807,0.00081012776,0.0017200938,0.008757829,0.007494241,0.95160496,0.0031557602,0.02025593],"study_design_scores_gemma":[0.000028779346,0.000032042277,0.0015190201,0.000021621174,0.000047048947,0.0006749491,0.00045135833,0.018858278,0.0020562478,0.97358465,0.00270128,0.000024651612],"about_ca_topic_score_codex":0.0012584686,"about_ca_topic_score_gemma":0.0026582477,"teacher_disagreement_score":0.0057352614,"about_ca_system_score_codex":0.00070958625,"about_ca_system_score_gemma":0.0004555349,"threshold_uncertainty_score":0.019186318},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071690106,0.0024184028,0.97835356,0.0012975838,0.00029843513,0.00003868531,0.00017541154,0.0001784563,0.01007052],"genre_scores_gemma":[0.412377,0.01290118,0.5325448,0.0009150952,0.0026749086,0.00066165614,0.0011282119,0.00078325527,0.036013834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852943,0.00057536515,0.00009084951,0.00026033007,0.00047698396,0.000067084635],"domain_scores_gemma":[0.9869964,0.009188562,0.00047645636,0.0013500054,0.0014767795,0.0005118428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045149615,0.0012691377,0.0019493159,0.005118569,0.0015144271,0.0031817486,0.0018988567,0.0022998136,0.009263627],"category_scores_gemma":[0.016381191,0.00091944507,0.0013260065,0.0051241373,0.0055330703,0.009824557,0.0038953626,0.0060729673,0.0015566598],"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.000011878134,0.000012218263,0.00012555667,0.00005859377,0.000010540679,0.00001972175,0.00007490777,0.0025507389,0.00022297696,0.98365885,0.001542866,0.011711242],"study_design_scores_gemma":[0.0000080709515,0.0000123416385,0.000072518196,0.000020561602,0.000011588303,0.0000273376,0.0000264734,0.038046326,0.00026320355,0.9566564,0.004847051,0.00000802918],"about_ca_topic_score_codex":0.0023518966,"about_ca_topic_score_gemma":0.0016173804,"teacher_disagreement_score":0.009263627,"about_ca_system_score_codex":0.0017660235,"about_ca_system_score_gemma":0.0014499167,"threshold_uncertainty_score":0.030989945},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026514309,0.00013733283,0.9655029,0.000094287425,0.000051597,0.00008791724,0.000105853,0.0013443513,0.006161393],"genre_scores_gemma":[0.2938677,0.00028555773,0.6933138,0.00017464293,0.000053060197,0.00019343733,0.0015443312,0.00076898513,0.00979846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928635,0.000083400846,0.000053379288,0.00020209866,0.0002628937,0.00011195359],"domain_scores_gemma":[0.99912626,0.00023675952,0.000044328932,0.0002613496,0.00026079538,0.00007047545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000652107,0.00039614952,0.0006475516,0.0018062363,0.00061324093,0.0017002474,0.0017352451,0.0005459189,0.011487311],"category_scores_gemma":[0.002162361,0.00032157387,0.0006269538,0.001140124,0.0010936898,0.0036343026,0.0032876846,0.0014775764,0.0027309682],"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.0002194237,0.00014914252,0.0018969973,0.0002717703,0.00004491886,0.00032637073,0.00052248855,0.020988217,0.026008097,0.4945177,0.0100810975,0.44497386],"study_design_scores_gemma":[0.00008540473,0.00021154612,0.0014997469,0.000076005395,0.000045460787,0.00091841596,0.0004533128,0.39983514,0.06779111,0.47154233,0.057460483,0.00008103945],"about_ca_topic_score_codex":0.0008860708,"about_ca_topic_score_gemma":0.0008648855,"teacher_disagreement_score":0.011487311,"about_ca_system_score_codex":0.00069005496,"about_ca_system_score_gemma":0.00078879116,"threshold_uncertainty_score":0.038428843},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5490596,0.00060027407,0.43601617,0.0012537524,0.00003640001,0.00012801812,0.0013695289,0.00063295075,0.010903206],"genre_scores_gemma":[0.92964864,0.00049488776,0.0646879,0.00016692565,0.000057955516,0.00015390325,0.002264585,0.00014216494,0.0023830978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994142,0.00019816139,0.000029379664,0.0001481869,0.0001301818,0.00007983859],"domain_scores_gemma":[0.99331266,0.0032749255,0.0014487574,0.00069613336,0.0008639094,0.00040352135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057164306,0.0003507787,0.0004695891,0.0038113152,0.0008352455,0.0013282729,0.00092902326,0.00084258657,0.0032298076],"category_scores_gemma":[0.009536933,0.0004489175,0.0005797305,0.0021572332,0.0017824755,0.0033421237,0.0011782494,0.00073401065,0.00050199614],"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.00015587677,0.00009021274,0.012032651,0.00044006726,0.000078406825,0.0005555369,0.0010342484,0.11996111,0.01141943,0.8055854,0.0038873116,0.044759806],"study_design_scores_gemma":[0.00003666154,0.0000890244,0.0054129353,0.00004574317,0.0000405082,0.0005168408,0.0003757693,0.3015423,0.0028109418,0.6820936,0.0069952128,0.000040442617],"about_ca_topic_score_codex":0.0016295523,"about_ca_topic_score_gemma":0.001937587,"teacher_disagreement_score":0.0038113152,"about_ca_system_score_codex":0.00092784624,"about_ca_system_score_gemma":0.00048922666,"threshold_uncertainty_score":0.010804772},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95706546,0.0005322252,0.026379267,0.00013858975,0.000017730134,0.000016330601,0.0001102475,0.00009277681,0.015647357],"genre_scores_gemma":[0.9966011,0.00014720381,0.0025732412,0.0000143018315,0.000026986541,0.000008683025,0.000081410115,0.000012025113,0.0005349962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970335,0.00005085447,0.00002015945,0.000082910476,0.000092434064,0.000050183833],"domain_scores_gemma":[0.99825925,0.0008978554,0.00037090282,0.00013969821,0.00014417725,0.00018801907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024728474,0.00018094991,0.00036026584,0.0018331286,0.0009920052,0.0010394027,0.00029140312,0.00038239104,0.0021854432],"category_scores_gemma":[0.0033098953,0.00021187203,0.00021895989,0.0006660739,0.001233325,0.0018284041,0.00048996985,0.00046791107,0.0001324935],"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.00015984348,0.00003981795,0.009734494,0.00014817291,0.000024812387,0.0019442749,0.0015299864,0.017007211,0.01820765,0.9313263,0.0012779676,0.018599486],"study_design_scores_gemma":[0.00004849937,0.00023340518,0.028701823,0.000101513666,0.00008162696,0.010838554,0.0013807715,0.10737015,0.0107924435,0.81888884,0.021433974,0.00012839041],"about_ca_topic_score_codex":0.00063279516,"about_ca_topic_score_gemma":0.00054717204,"teacher_disagreement_score":0.0021854432,"about_ca_system_score_codex":0.0003311602,"about_ca_system_score_gemma":0.000117208016,"threshold_uncertainty_score":0.0073109865},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003654184,0.9875387,0.004466578,0.0005496836,0.00061451196,0.000012923554,0.00014174871,0.00003621643,0.0062741814],"genre_scores_gemma":[0.0022781666,0.99003476,0.0035344195,0.000347991,0.00089455093,0.000025617204,0.00018168584,0.00001596438,0.0026868836],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994318,0.00007722508,0.00007142724,0.00015947432,0.00022342152,0.00003660166],"domain_scores_gemma":[0.9990264,0.0005334808,0.000074218384,0.00004254986,0.0002901301,0.00003323569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009823106,0.0017023571,0.002320261,0.00559878,0.00058996404,0.0013470338,0.0016787258,0.0014514793,0.0038300974],"category_scores_gemma":[0.0021598511,0.0007867159,0.0008766372,0.008876035,0.0011563496,0.0040596593,0.0007615791,0.0018783638,0.0041825813],"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.000062813866,0.00012487527,0.00043689334,0.015148776,0.00012986892,0.00035547436,0.00012609844,0.0026622394,0.0024501805,0.08665669,0.10256216,0.78928393],"study_design_scores_gemma":[0.000012530306,0.00006672243,0.0011234039,0.0022185235,0.00009800792,0.0016690951,0.00006747893,0.00095217343,0.0012366939,0.03468433,0.9577951,0.000075980104],"about_ca_topic_score_codex":0.002337619,"about_ca_topic_score_gemma":0.0020465332,"teacher_disagreement_score":0.00559878,"about_ca_system_score_codex":0.0016260528,"about_ca_system_score_gemma":0.0015747839,"threshold_uncertainty_score":0.012812972},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1378894,0.00053392013,0.8498673,0.00021231882,0.00007853647,0.000077911696,0.00020701236,0.0009717786,0.010161843],"genre_scores_gemma":[0.41801152,0.0005125878,0.57769483,0.00007414854,0.00009497164,0.00023149166,0.0003428749,0.00018591106,0.0028515894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995167,0.00008681631,0.000042461914,0.00010211751,0.00019906463,0.00005277213],"domain_scores_gemma":[0.99777347,0.0013306099,0.0002500885,0.00028487283,0.00024755514,0.00011336494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007073992,0.00064557785,0.0006763148,0.0035757634,0.00091198226,0.0017830185,0.0011535392,0.0005286381,0.0038489504],"category_scores_gemma":[0.0061231907,0.00048102552,0.000845477,0.0019140737,0.0018671667,0.0040912977,0.0014216203,0.0015545409,0.00070667255],"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.00015904641,0.00012419441,0.0033789885,0.00027350496,0.000114016875,0.0002489783,0.00034240133,0.18775003,0.010136096,0.66218084,0.002502761,0.13278925],"study_design_scores_gemma":[0.00003191881,0.00004488157,0.0004803186,0.000023499279,0.000015785248,0.000092374496,0.000051450985,0.43299377,0.004474823,0.5582722,0.0034698714,0.000049126535],"about_ca_topic_score_codex":0.0010839878,"about_ca_topic_score_gemma":0.0019164727,"teacher_disagreement_score":0.0038489504,"about_ca_system_score_codex":0.0008543891,"about_ca_system_score_gemma":0.00071953196,"threshold_uncertainty_score":0.012875974},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06594741,0.0024352397,0.9073835,0.0015006319,0.00017226057,0.00017615249,0.0022834023,0.0022070454,0.017894331],"genre_scores_gemma":[0.662356,0.0034408974,0.32266364,0.00028204042,0.00031664272,0.00044640235,0.0028983718,0.0006043869,0.006991631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988549,0.00021508739,0.00008877222,0.00035932733,0.00036359346,0.00011829034],"domain_scores_gemma":[0.9973801,0.0010264525,0.0004333656,0.0005126285,0.00043757795,0.00020994179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006926404,0.00072266214,0.0007914474,0.0075892126,0.0009864386,0.008363293,0.0010750224,0.001270743,0.0086169],"category_scores_gemma":[0.010093888,0.00049352687,0.0007800995,0.006413257,0.002280747,0.01689815,0.0049621393,0.0011904961,0.0018369937],"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.00031997223,0.00007056401,0.002507689,0.00047683684,0.00006705716,0.00021997569,0.0017138857,0.011240557,0.011603329,0.5633559,0.010098898,0.3983253],"study_design_scores_gemma":[0.000024908693,0.00009039947,0.003559362,0.00009125988,0.00003946395,0.0003709318,0.00064525177,0.10243408,0.0041106446,0.86366063,0.024887582,0.00008540415],"about_ca_topic_score_codex":0.0027050881,"about_ca_topic_score_gemma":0.0015026904,"teacher_disagreement_score":0.0086169,"about_ca_system_score_codex":0.0016832968,"about_ca_system_score_gemma":0.0006659711,"threshold_uncertainty_score":0.028826356},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067339174,0.0035076907,0.8860738,0.0093113,0.0006474544,0.00005048137,0.00053372956,0.0003251432,0.03221118],"genre_scores_gemma":[0.80553424,0.0039121653,0.16888876,0.0019686543,0.0026831466,0.00013506699,0.0005864363,0.0002672236,0.016024258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964477,0.0018132714,0.00023366892,0.0005839114,0.00071513536,0.00020642285],"domain_scores_gemma":[0.9899955,0.0056089056,0.0011789252,0.0014686998,0.0011689469,0.00057912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004523937,0.0009434938,0.0010682091,0.0032385264,0.00161823,0.005656815,0.0015760162,0.0014105741,0.005892543],"category_scores_gemma":[0.018358802,0.00061042357,0.0010163035,0.0032852197,0.010130082,0.010305902,0.0041854247,0.003123396,0.0008353505],"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.000015860884,0.000007819061,0.00018398659,0.000031148247,0.0000056098265,0.000051781702,0.00012603184,0.0010994804,0.0003378804,0.9903701,0.000964786,0.006805493],"study_design_scores_gemma":[0.0000046901278,0.0000111155205,0.00013613899,0.000014753899,0.000005111645,0.000091068934,0.00005320775,0.007794332,0.00014381172,0.98914486,0.0025852532,0.000015805454],"about_ca_topic_score_codex":0.0013657309,"about_ca_topic_score_gemma":0.0010405722,"teacher_disagreement_score":0.005892543,"about_ca_system_score_codex":0.0011651403,"about_ca_system_score_gemma":0.0013472692,"threshold_uncertainty_score":0.023925126},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98982304,0.00022597215,0.008355036,0.0000773433,0.000018113693,0.000006032605,0.00011913224,0.000031744352,0.0013434722],"genre_scores_gemma":[0.9920437,0.00026287677,0.0063636024,0.00001936219,0.000019788618,0.00001827715,0.00030408887,0.000016661543,0.00095177063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989348,0.00014429161,0.00010456691,0.00026222342,0.00032191005,0.0002322114],"domain_scores_gemma":[0.99455357,0.001695492,0.0016553142,0.00083976454,0.00049798784,0.0007578859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072223874,0.00036445784,0.00057046546,0.0018396281,0.001116815,0.002062047,0.001153035,0.00076681987,0.0018827708],"category_scores_gemma":[0.0047405586,0.00031299217,0.0005896914,0.0013353849,0.0026138679,0.0031156377,0.002270664,0.00086375023,0.00019023365],"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.0023973635,0.00030130704,0.081045404,0.0010401102,0.00026460306,0.0042250757,0.0029861263,0.096973814,0.093847394,0.5800562,0.003416279,0.13344628],"study_design_scores_gemma":[0.00006715758,0.000465854,0.04626435,0.000118663986,0.00015156626,0.006518492,0.0022987484,0.21142481,0.05364272,0.66565615,0.013177693,0.00021378632],"about_ca_topic_score_codex":0.00050566427,"about_ca_topic_score_gemma":0.0005651747,"teacher_disagreement_score":0.002062047,"about_ca_system_score_codex":0.00054595585,"about_ca_system_score_gemma":0.00029392858,"threshold_uncertainty_score":0.0062984824},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013777559,0.00028938756,0.9273479,0.00019481477,0.00019225062,0.00037065335,0.0010743833,0.05463226,0.0021207745],"genre_scores_gemma":[0.04205138,0.00024391714,0.9419804,0.00025774533,0.000060055245,0.0007540928,0.0038572196,0.005696155,0.0050989767],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765587,0.0004229766,0.00024930775,0.00065841665,0.00079451303,0.00021885126],"domain_scores_gemma":[0.99811006,0.0005311118,0.0001635919,0.0007357506,0.00027617236,0.00018333274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002282726,0.0016072699,0.0018246198,0.0016342432,0.0008225278,0.0018760427,0.0027885071,0.0012182067,0.0099850455],"category_scores_gemma":[0.0063893106,0.0014380319,0.00085661496,0.0017703361,0.0006110144,0.0026020182,0.0025420357,0.0027363903,0.009640096],"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.0016433424,0.00038196886,0.0026265346,0.0008952788,0.00021345123,0.00049669767,0.00032246535,0.0026140949,0.46982017,0.011588046,0.049398333,0.45999968],"study_design_scores_gemma":[0.0005336692,0.0007214532,0.0035192373,0.000101277066,0.00013650379,0.002558076,0.00013134204,0.14124632,0.7127826,0.016178975,0.12181474,0.0002758991],"about_ca_topic_score_codex":0.0004803636,"about_ca_topic_score_gemma":0.0009404728,"teacher_disagreement_score":0.0099850455,"about_ca_system_score_codex":0.00048170827,"about_ca_system_score_gemma":0.0010911537,"threshold_uncertainty_score":0.033403337},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27028984,0.00043627233,0.7191356,0.00032469246,0.000088275076,0.00012904932,0.00019155102,0.00060153444,0.008803229],"genre_scores_gemma":[0.8604627,0.0005002431,0.13020265,0.000100693665,0.00009488803,0.00010848859,0.0003420207,0.00017841293,0.008010024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929833,0.00009747931,0.000040130304,0.0002333773,0.00024786417,0.00008280207],"domain_scores_gemma":[0.9987367,0.0004180591,0.0002080835,0.00020600964,0.0002157098,0.00021547315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010542907,0.0006235303,0.0006131384,0.0063857483,0.0013894638,0.0026790039,0.0006757588,0.0009106282,0.004791107],"category_scores_gemma":[0.0044916417,0.00039882187,0.0006731238,0.0013904176,0.002303037,0.0037062948,0.002700986,0.0014157817,0.00055751676],"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.00016464111,0.00008177186,0.005281318,0.00011337989,0.000045494842,0.0006605716,0.0012241513,0.026521271,0.013497822,0.81656855,0.0020437771,0.13379724],"study_design_scores_gemma":[0.000021245305,0.00014788317,0.0041577034,0.00007816057,0.000028719305,0.000665613,0.00045534308,0.28410682,0.010433717,0.68710583,0.012736342,0.000062677354],"about_ca_topic_score_codex":0.0016643822,"about_ca_topic_score_gemma":0.0009851125,"teacher_disagreement_score":0.0063857483,"about_ca_system_score_codex":0.001337943,"about_ca_system_score_gemma":0.0004626027,"threshold_uncertainty_score":0.016027868},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7433187,0.00045937582,0.24541442,0.00014344683,0.000034247918,0.000058474026,0.0002018213,0.00018429954,0.010185222],"genre_scores_gemma":[0.958782,0.00019261641,0.039276104,0.0000353282,0.000039675702,0.00002220661,0.00031061657,0.000030363897,0.0013112088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996338,0.00005103419,0.00003737774,0.00006967116,0.00014687469,0.00006111949],"domain_scores_gemma":[0.9978662,0.00092500186,0.00046263874,0.00022028563,0.0002712918,0.0002545643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055687735,0.00047114154,0.00054922525,0.004207309,0.0010999873,0.0016654426,0.00037240755,0.00042116217,0.0009254624],"category_scores_gemma":[0.0032083949,0.00021806153,0.00041783703,0.0011486012,0.0021496702,0.0026955418,0.00097206223,0.0008182902,0.00017721816],"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.00044376837,0.00012688375,0.033162944,0.00027646346,0.000068776804,0.002129613,0.0039219474,0.05688924,0.036089428,0.7446909,0.0019789764,0.120221086],"study_design_scores_gemma":[0.000035234916,0.0002952905,0.019710325,0.00012047093,0.00005989118,0.003218561,0.0021058638,0.24279603,0.014464874,0.70218307,0.014840273,0.00017014093],"about_ca_topic_score_codex":0.0010969521,"about_ca_topic_score_gemma":0.0010040567,"teacher_disagreement_score":0.004207309,"about_ca_system_score_codex":0.00051880174,"about_ca_system_score_gemma":0.00020813735,"threshold_uncertainty_score":0.0037641525},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13135833,0.00042786347,0.86397314,0.00029397992,0.0000325243,0.00004224436,0.00038396308,0.00042328786,0.00306465],"genre_scores_gemma":[0.79186404,0.00044216285,0.20504934,0.0000695797,0.00011943489,0.000117743,0.0004760726,0.00026024136,0.0016013727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995234,0.00016028214,0.000038859514,0.00012615218,0.00010357459,0.000047746402],"domain_scores_gemma":[0.99741167,0.0013617529,0.00043495814,0.00020000471,0.00036960669,0.00022193846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001205291,0.0004807381,0.00067261106,0.004182204,0.00065293565,0.0026128003,0.00070929684,0.0006476979,0.0035273232],"category_scores_gemma":[0.0051862723,0.0003257801,0.0006419191,0.0015019816,0.0011475747,0.0033649555,0.0009558361,0.0007017245,0.00035142805],"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.0008406925,0.000108316905,0.0069193165,0.00052775024,0.000097654236,0.00045843664,0.00086882536,0.06038169,0.05350438,0.69141394,0.0022535722,0.18262543],"study_design_scores_gemma":[0.00003053973,0.00024670074,0.006745433,0.000072555486,0.00007566805,0.0012416368,0.0003217882,0.47714537,0.02006777,0.48644885,0.0075285775,0.00007503582],"about_ca_topic_score_codex":0.00042801336,"about_ca_topic_score_gemma":0.00036194889,"teacher_disagreement_score":0.004182204,"about_ca_system_score_codex":0.00074016344,"about_ca_system_score_gemma":0.000399607,"threshold_uncertainty_score":0.011800051},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30342278,0.0028222697,0.68155444,0.0011018038,0.00008672634,0.00007029987,0.00021249118,0.00021075596,0.010518486],"genre_scores_gemma":[0.9087874,0.002384188,0.07708847,0.00047573104,0.0005398372,0.0005096372,0.000472209,0.00029010442,0.0094523495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99718624,0.0011195109,0.00014169843,0.0005235578,0.00066937594,0.00035957375],"domain_scores_gemma":[0.9711121,0.02116852,0.0019294466,0.0012430694,0.0028128568,0.00173397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011342661,0.0009161282,0.0014974567,0.0050590527,0.0022427826,0.004758595,0.0024401115,0.0015732523,0.004081405],"category_scores_gemma":[0.04103697,0.0007244691,0.0021477174,0.002146219,0.006853709,0.009788903,0.00418587,0.0036492986,0.0005335451],"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.000024220186,0.000018303499,0.0008480905,0.00005296566,0.000021271466,0.00009713025,0.0005694951,0.0030060238,0.00077124906,0.99180025,0.00022975812,0.0025611862],"study_design_scores_gemma":[0.000020001098,0.00004895675,0.0011900055,0.000062773885,0.000019269346,0.00026229976,0.00022795824,0.05139239,0.0007696427,0.94448286,0.0014741921,0.000049583603],"about_ca_topic_score_codex":0.0024551817,"about_ca_topic_score_gemma":0.0016671005,"teacher_disagreement_score":0.011342661,"about_ca_system_score_codex":0.0029261948,"about_ca_system_score_gemma":0.0015005177,"threshold_uncertainty_score":0.059986413},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18693045,0.0025354146,0.5963766,0.0063524707,0.0008279646,0.00017230741,0.0016159585,0.0008741989,0.20431466],"genre_scores_gemma":[0.88090515,0.0020982937,0.073204234,0.0014814126,0.0004507307,0.00024104305,0.0011657699,0.00048142357,0.039971992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989189,0.00021016746,0.000107811684,0.00030076402,0.0002749599,0.00018751709],"domain_scores_gemma":[0.99784136,0.0009774521,0.00014125732,0.00036836512,0.0004795872,0.00019193323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013691592,0.00062741525,0.00088145706,0.0025831994,0.0024936148,0.003455988,0.0010077817,0.0010484539,0.010679919],"category_scores_gemma":[0.0053437096,0.00060056016,0.0012184026,0.0021046493,0.00345246,0.00800819,0.005122363,0.004528365,0.0017865144],"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.000042396303,0.000014545129,0.00038293816,0.00005261156,0.000011175165,0.00012503489,0.00036652194,0.00031448939,0.001617318,0.9868312,0.0021082754,0.008133367],"study_design_scores_gemma":[0.000012019261,0.000015057168,0.00060878944,0.000024361168,0.000020809768,0.00025086213,0.00022379778,0.0026089328,0.001377397,0.9818958,0.01294126,0.000020789257],"about_ca_topic_score_codex":0.0009927299,"about_ca_topic_score_gemma":0.000862224,"teacher_disagreement_score":0.010679919,"about_ca_system_score_codex":0.0010250884,"about_ca_system_score_gemma":0.0007366753,"threshold_uncertainty_score":0.03572792},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001043177,0.014713021,0.96059936,0.0012770599,0.0010042585,0.000025684432,0.0005598679,0.0015261502,0.019251373],"genre_scores_gemma":[0.04847442,0.026239406,0.85865074,0.00094890216,0.003092773,0.00023548519,0.0020955205,0.0013091716,0.05895364],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994122,0.00013204926,0.00005334377,0.00015777964,0.00021664616,0.00002802109],"domain_scores_gemma":[0.9988513,0.0006268963,0.000046141562,0.00022128443,0.00021698848,0.00003738882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008978627,0.0014943257,0.0012497398,0.0014930064,0.00056086155,0.0033011166,0.0015364066,0.00122539,0.012823719],"category_scores_gemma":[0.0031999135,0.00059788924,0.0009231168,0.0031139068,0.0016532188,0.0030935174,0.0018100414,0.0029760455,0.010428874],"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.000029448387,0.000030225441,0.0001656231,0.00041762754,0.00006141429,0.00005578019,0.00011493677,0.011834864,0.003289293,0.29501042,0.07014849,0.6188418],"study_design_scores_gemma":[0.0000050415456,0.000016240278,0.00033466023,0.00014267373,0.000020642203,0.00019027638,0.000035659898,0.10220865,0.003901069,0.7797862,0.11331369,0.000045190678],"about_ca_topic_score_codex":0.001347651,"about_ca_topic_score_gemma":0.0018874417,"teacher_disagreement_score":0.012823719,"about_ca_system_score_codex":0.0010824713,"about_ca_system_score_gemma":0.0008252662,"threshold_uncertainty_score":0.04289967},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03235305,0.0018085259,0.9327184,0.0008900734,0.00023649285,0.00010018408,0.00014742349,0.000231354,0.0315145],"genre_scores_gemma":[0.25633267,0.0022830619,0.72002125,0.000520835,0.00056705764,0.0004155788,0.00047590124,0.0003842087,0.018999455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99673045,0.0010487792,0.00021228626,0.0009046338,0.0008889303,0.00021491238],"domain_scores_gemma":[0.99715304,0.0011233697,0.0002028206,0.0009184682,0.0004534019,0.00014896947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027148356,0.00074670545,0.0010343514,0.001568943,0.0012355385,0.0020748996,0.0019173167,0.0010770131,0.0054036495],"category_scores_gemma":[0.009420721,0.00035007746,0.0011426742,0.003249818,0.0038264424,0.009021712,0.003785028,0.0026130714,0.0017114051],"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.00006923767,0.000015938991,0.00027925146,0.00008040877,0.000028874725,0.000041765754,0.00017220253,0.0026721226,0.0009879216,0.9372854,0.0017821551,0.05658469],"study_design_scores_gemma":[0.000038337697,0.00009805301,0.0005104695,0.000047488782,0.000032146618,0.00043788957,0.00013778826,0.018926438,0.0028995639,0.9303495,0.04647582,0.00004648241],"about_ca_topic_score_codex":0.00064447284,"about_ca_topic_score_gemma":0.0007853452,"teacher_disagreement_score":0.0054036495,"about_ca_system_score_codex":0.0007787072,"about_ca_system_score_gemma":0.0013559026,"threshold_uncertainty_score":0.018076956},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4991832,0.006500202,0.4068556,0.0046948977,0.00040737688,0.000105161314,0.00094643293,0.00051085814,0.08079632],"genre_scores_gemma":[0.9508179,0.0018146553,0.038147278,0.00021831245,0.00024861406,0.000050810042,0.00038633664,0.0000970969,0.008218999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988512,0.00034677927,0.00006900486,0.00025531862,0.00035655484,0.000121104764],"domain_scores_gemma":[0.99578756,0.0022466893,0.0005059129,0.0004207875,0.00043993385,0.00059915055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010959943,0.0005466221,0.0008973629,0.004718065,0.0019185815,0.0056272014,0.0010383659,0.0012104558,0.006193624],"category_scores_gemma":[0.0068926434,0.0006421657,0.0007301209,0.0023137487,0.004950104,0.0069160764,0.003157132,0.0017706217,0.0007734022],"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.0000154207,0.000011106553,0.00026038347,0.000020956375,0.0000054359007,0.00003887797,0.0003812342,0.00075523223,0.00040847037,0.9937065,0.00044336586,0.0039530676],"study_design_scores_gemma":[0.0000029435362,0.000002881902,0.00013736081,0.000008884524,0.0000026436617,0.00005376875,0.0001661657,0.00304261,0.000101171914,0.99489576,0.0015812409,0.0000045599727],"about_ca_topic_score_codex":0.0016349077,"about_ca_topic_score_gemma":0.0011735215,"teacher_disagreement_score":0.006193624,"about_ca_system_score_codex":0.0011304688,"about_ca_system_score_gemma":0.0005305442,"threshold_uncertainty_score":0.020719767},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027529782,0.024890894,0.059829947,0.003588133,0.0009445758,0.00003935541,0.00020978335,0.00025041588,0.8827171],"genre_scores_gemma":[0.581761,0.02070448,0.020940015,0.0012372173,0.002071133,0.00010144996,0.00039832687,0.00014065241,0.37264574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99987316,0.000036203746,0.0000041252015,0.00002423131,0.00003598839,0.000026276637],"domain_scores_gemma":[0.9999304,0.000021329086,0.000008218188,0.000014578391,0.000012386769,0.000013063973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020243302,0.00047172396,0.00020096278,0.00070150394,0.00071684626,0.0012803656,0.00028934647,0.00044942336,0.009325564],"category_scores_gemma":[0.00024723075,0.00009273763,0.00017528284,0.00078446744,0.0020919193,0.002037022,0.0007453479,0.00076963066,0.001477748],"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.0000015591299,0.0000028169989,0.000023210541,0.000012594584,0.000001121024,0.000016721608,0.00019577013,0.00009988058,0.00024080115,0.9891117,0.0038769715,0.006416742],"study_design_scores_gemma":[0.0000023272278,0.000015963054,0.00022847131,0.000018038038,0.000003207736,0.000077486766,0.0002016858,0.000363798,0.00033839906,0.84431446,0.15443319,0.0000029054804],"about_ca_topic_score_codex":0.0007857225,"about_ca_topic_score_gemma":0.00088142435,"teacher_disagreement_score":0.009325564,"about_ca_system_score_codex":0.0005495902,"about_ca_system_score_gemma":0.00027013305,"threshold_uncertainty_score":0.03119713},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013675734,0.00047058714,0.97908807,0.00037934404,0.00020102937,0.00010819814,0.00035546315,0.0021830294,0.0035384882],"genre_scores_gemma":[0.32085124,0.00073529105,0.6640671,0.0003784586,0.00032485367,0.00028992587,0.0024989417,0.00043928853,0.010414973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877435,0.0002262855,0.0000706735,0.00033274063,0.0004916021,0.00010422478],"domain_scores_gemma":[0.998243,0.0003674129,0.000111046415,0.00048156249,0.0006759066,0.00012112536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001723809,0.00088884734,0.0010724615,0.001930689,0.0009869763,0.0022655495,0.001799536,0.0014405148,0.00434023],"category_scores_gemma":[0.0057771318,0.0003120694,0.0008192202,0.0018343689,0.00096776016,0.003928425,0.0016672671,0.0021424755,0.0029675683],"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.00017626,0.00016997736,0.004579694,0.0001257989,0.00011434399,0.0001703121,0.00019013719,0.055838875,0.0075246305,0.10795747,0.03348371,0.78966886],"study_design_scores_gemma":[0.000012795266,0.00009490701,0.0007669345,0.00003744676,0.00002709218,0.00019871321,0.00005651607,0.92006004,0.00642559,0.058224726,0.0140690915,0.000026065103],"about_ca_topic_score_codex":0.0033580624,"about_ca_topic_score_gemma":0.0028098659,"teacher_disagreement_score":0.00434023,"about_ca_system_score_codex":0.0010503783,"about_ca_system_score_gemma":0.001918001,"threshold_uncertainty_score":0.014519513},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8804739,0.00041623035,0.09550742,0.00074404484,0.00004368682,0.00006551792,0.0011847059,0.0002657193,0.021298816],"genre_scores_gemma":[0.96930987,0.00035648726,0.021866059,0.00009916832,0.00008601172,0.00007676388,0.0011440058,0.00011054376,0.006951235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908996,0.00012267046,0.000056726443,0.00036177336,0.00022908945,0.00013991902],"domain_scores_gemma":[0.9908354,0.005140197,0.001196298,0.0013474921,0.0005877025,0.0008927869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095797953,0.0004886206,0.00070261955,0.0041162674,0.0023496868,0.00357569,0.0015481942,0.0009858669,0.008156187],"category_scores_gemma":[0.008178436,0.0005651865,0.000693172,0.0040261154,0.0032994086,0.006065132,0.0016183772,0.0019330296,0.00058302697],"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.00030201316,0.00011981012,0.011991964,0.00013707548,0.000028641614,0.00018366374,0.0012665186,0.01590773,0.0060560764,0.93446976,0.0024004441,0.02713615],"study_design_scores_gemma":[0.000031734948,0.000047084242,0.0051791505,0.00004485429,0.000049779646,0.00035988764,0.00046585797,0.047970194,0.0041976953,0.9372219,0.0043938262,0.000038163373],"about_ca_topic_score_codex":0.0021699467,"about_ca_topic_score_gemma":0.0035784845,"teacher_disagreement_score":0.008156187,"about_ca_system_score_codex":0.002271988,"about_ca_system_score_gemma":0.0009024707,"threshold_uncertainty_score":0.027285159},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010617307,0.000059099937,0.9882062,0.000037090253,0.000012435959,0.000026870768,0.000028364573,0.0002509725,0.0007616285],"genre_scores_gemma":[0.16624768,0.00011774267,0.8319624,0.000042888852,0.000023004919,0.000075375436,0.00021892042,0.0001984693,0.0011134669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982205,0.0004086139,0.00011233851,0.0003337832,0.000775839,0.00014888654],"domain_scores_gemma":[0.9976242,0.0010850804,0.00021675663,0.0005333329,0.00042122038,0.0001192874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011554015,0.00040797895,0.0007827888,0.0010707449,0.00071593386,0.0016805539,0.0011104754,0.000525199,0.0019905383],"category_scores_gemma":[0.005706627,0.0004322883,0.0008081637,0.0009674057,0.0016571553,0.0023175285,0.002374677,0.0012025853,0.0005316665],"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.00044292788,0.00007896137,0.0033891434,0.00029907216,0.00008555349,0.0003725797,0.00081586716,0.1759241,0.035118166,0.40250993,0.0029546653,0.37800896],"study_design_scores_gemma":[0.000043733882,0.00012428527,0.00064156216,0.000043302138,0.000025693376,0.0007082045,0.0003037753,0.72992736,0.038506996,0.20511492,0.024517234,0.000042901655],"about_ca_topic_score_codex":0.0014887325,"about_ca_topic_score_gemma":0.0020325417,"teacher_disagreement_score":0.0019905383,"about_ca_system_score_codex":0.00058449083,"about_ca_system_score_gemma":0.00073175266,"threshold_uncertainty_score":0.0066589713},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7312347,0.003339929,0.17842048,0.0014661342,0.0005473031,0.00008110541,0.000647631,0.000531523,0.08373107],"genre_scores_gemma":[0.9833924,0.001123765,0.008159026,0.00010319788,0.0001551863,0.000029760471,0.0003891421,0.00014382366,0.0065036826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990392,0.00016692856,0.00006278534,0.0002050894,0.00036620218,0.0001598323],"domain_scores_gemma":[0.99378586,0.0026528146,0.0006133374,0.0012086967,0.0011538378,0.00058542145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017068083,0.00042891048,0.000836525,0.004884798,0.0016606885,0.0060346574,0.0015047066,0.0012811286,0.012799625],"category_scores_gemma":[0.015283703,0.00029150816,0.0005526467,0.0032899715,0.0041669486,0.010235242,0.0040151626,0.0022220067,0.00080310996],"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.00016191359,0.000035008987,0.0022575217,0.00009805806,0.000017349625,0.000107350956,0.0008091881,0.0022596335,0.0011640408,0.9635314,0.0008385115,0.028720073],"study_design_scores_gemma":[0.000029165294,0.00014403286,0.0036989518,0.0000778758,0.000033411332,0.00039521971,0.0017512976,0.018442538,0.0018334519,0.9671396,0.0064159185,0.00003859281],"about_ca_topic_score_codex":0.0007289321,"about_ca_topic_score_gemma":0.00049061293,"teacher_disagreement_score":0.012799625,"about_ca_system_score_codex":0.0012698566,"about_ca_system_score_gemma":0.0007372051,"threshold_uncertainty_score":0.042819023},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007380527,0.00007143505,0.9902721,0.00005324162,0.000026010875,0.000050971423,0.000078038094,0.0007056935,0.0013619077],"genre_scores_gemma":[0.10224191,0.00012368031,0.8926747,0.000078993566,0.000034216755,0.0002145763,0.000588532,0.0003996001,0.003643731],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989379,0.000139516,0.000101547215,0.0003271554,0.00038016727,0.00011373638],"domain_scores_gemma":[0.99878544,0.00027069394,0.00009037853,0.00047466665,0.00030318508,0.00007568055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010043178,0.00061954366,0.0009725764,0.0026529839,0.0009830114,0.0022629716,0.0024518054,0.0013209456,0.0076632234],"category_scores_gemma":[0.004004028,0.00043523582,0.0011600395,0.0027706374,0.0010943704,0.0046847253,0.0038109026,0.0015284322,0.0021559945],"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.000149627,0.00011682616,0.0013054889,0.00019919382,0.00006319247,0.00009552749,0.00027962084,0.042666238,0.014761611,0.2789694,0.0044771256,0.65691614],"study_design_scores_gemma":[0.000056912242,0.00015988947,0.00061192963,0.000060671926,0.000048688627,0.0003241697,0.00018593871,0.5754623,0.017151548,0.37084004,0.035037465,0.00006043124],"about_ca_topic_score_codex":0.001840865,"about_ca_topic_score_gemma":0.0013442227,"teacher_disagreement_score":0.0076632234,"about_ca_system_score_codex":0.0011720016,"about_ca_system_score_gemma":0.00097499316,"threshold_uncertainty_score":0.025636017},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04448342,0.0006089275,0.92780316,0.0004556578,0.00029044336,0.0000995355,0.00015296826,0.000691684,0.02541421],"genre_scores_gemma":[0.32009396,0.0010843587,0.64490604,0.00030086018,0.000303606,0.00018576169,0.00046813342,0.0006267488,0.03203057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949026,0.00010895981,0.000031767348,0.00013148754,0.0001898237,0.00004766007],"domain_scores_gemma":[0.99893516,0.00038184907,0.00005986558,0.00031740637,0.00017591058,0.00012976179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070535013,0.0005811127,0.00056557666,0.0022133053,0.00093192444,0.0012041447,0.0013280293,0.0004929911,0.0115011595],"category_scores_gemma":[0.0031598795,0.00033516763,0.0005940667,0.0022280896,0.001808641,0.002534412,0.00312817,0.0013293745,0.0022142036],"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.00006330168,0.00010133423,0.0010298486,0.00013784188,0.000027481727,0.00016998815,0.0003728278,0.008396691,0.009806447,0.62371784,0.0062311725,0.3499453],"study_design_scores_gemma":[0.000031032512,0.00008538789,0.0010452494,0.00005214781,0.000037802725,0.0006059093,0.000359267,0.11066138,0.01000144,0.83270496,0.044371456,0.000044023433],"about_ca_topic_score_codex":0.00093985436,"about_ca_topic_score_gemma":0.0014188604,"teacher_disagreement_score":0.0115011595,"about_ca_system_score_codex":0.000634591,"about_ca_system_score_gemma":0.0005006548,"threshold_uncertainty_score":0.038475215},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06930483,0.006490307,0.32892606,0.002911484,0.0031757148,0.00017657822,0.0010827638,0.001021049,0.58691126],"genre_scores_gemma":[0.6549673,0.0045904876,0.12037375,0.0011914968,0.0022463992,0.00032914523,0.0013421744,0.00080586656,0.21415336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920815,0.00010723209,0.000047340884,0.0003035559,0.00021956585,0.0001142256],"domain_scores_gemma":[0.99941766,0.00010235454,0.00006206649,0.00013909825,0.0001591486,0.000119627846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004562165,0.0014240844,0.0013175431,0.0024255707,0.0021901722,0.0043415492,0.0012726664,0.0013058224,0.012341702],"category_scores_gemma":[0.0011187296,0.00055763446,0.0008989221,0.0016262679,0.00411755,0.0062978165,0.004455648,0.0032149574,0.0050579943],"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.00001963383,0.0000056140657,0.000028989754,0.00004099983,0.000005355819,0.000030826133,0.000087081025,0.0002116758,0.0006288343,0.98480105,0.0035173965,0.010622586],"study_design_scores_gemma":[0.00001217706,0.000028607592,0.000083943305,0.000022692322,0.000012366332,0.000340086,0.00012905397,0.0011242592,0.0015132284,0.9458293,0.050888233,0.00001604921],"about_ca_topic_score_codex":0.00029016112,"about_ca_topic_score_gemma":0.0002349991,"teacher_disagreement_score":0.012341702,"about_ca_system_score_codex":0.00095632306,"about_ca_system_score_gemma":0.0006519942,"threshold_uncertainty_score":0.041287124},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12495754,0.0009193585,0.86326844,0.0010861552,0.00019764365,0.00004543615,0.00048284198,0.0005669507,0.008475591],"genre_scores_gemma":[0.6431514,0.00060802366,0.34837043,0.00014353526,0.00013780646,0.00006489632,0.0010849577,0.00022987409,0.0062091677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984484,0.0004692114,0.00010360735,0.00031182304,0.0005175098,0.00014944121],"domain_scores_gemma":[0.99558216,0.0021587163,0.0002566701,0.0010156186,0.0006878221,0.00029898112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001868527,0.00050219474,0.0011910377,0.0017294004,0.001101493,0.0031450805,0.0016739124,0.001249068,0.004644021],"category_scores_gemma":[0.014114974,0.00046522284,0.00061788724,0.0014905332,0.0017180535,0.0061277305,0.0035644406,0.00209449,0.0015364592],"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.000442688,0.00012427759,0.003918,0.00041328554,0.00015708436,0.00013294973,0.0004712897,0.09476773,0.0051951376,0.7005479,0.00831392,0.18551582],"study_design_scores_gemma":[0.000024600118,0.00006689033,0.0006670124,0.000039165687,0.000019204232,0.00014092273,0.00013533924,0.26184297,0.0034870384,0.7279592,0.0055806627,0.000036989743],"about_ca_topic_score_codex":0.0013835483,"about_ca_topic_score_gemma":0.0018080154,"teacher_disagreement_score":0.004644021,"about_ca_system_score_codex":0.0011613446,"about_ca_system_score_gemma":0.0016271067,"threshold_uncertainty_score":0.015535772},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06226761,0.0049122716,0.9012866,0.010674021,0.0009864002,0.0002601113,0.0038373135,0.002812635,0.012962988],"genre_scores_gemma":[0.6593349,0.0039375033,0.3041054,0.0044666314,0.0016891473,0.00074167695,0.007347997,0.0017540667,0.016622595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98755336,0.002461583,0.0009799768,0.004231135,0.0039593643,0.0008146409],"domain_scores_gemma":[0.9686928,0.010297485,0.0025347068,0.012777894,0.0045200856,0.00117707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071026096,0.0011371949,0.0033460748,0.0057202303,0.0049040117,0.009535353,0.0032745462,0.0030026054,0.0071812323],"category_scores_gemma":[0.04891966,0.0018516302,0.0016472458,0.007366506,0.009772219,0.014762052,0.012117394,0.0041694683,0.003382007],"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.0010872616,0.00012475965,0.011930506,0.0010182576,0.0004992471,0.0008712256,0.00405891,0.072111964,0.004598791,0.6860215,0.05460425,0.16307329],"study_design_scores_gemma":[0.000049313934,0.000078878555,0.0030976871,0.00020350896,0.00006439463,0.0005715022,0.0010612225,0.10897892,0.0031859668,0.83329296,0.049303014,0.000112557784],"about_ca_topic_score_codex":0.0036436094,"about_ca_topic_score_gemma":0.002410341,"teacher_disagreement_score":0.009535353,"about_ca_system_score_codex":0.003139345,"about_ca_system_score_gemma":0.002328901,"threshold_uncertainty_score":0.03756261},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024531502,0.0009968063,0.99335504,0.00087691477,0.00008847467,0.00006685995,0.00013463439,0.0004994516,0.0015287307],"genre_scores_gemma":[0.081975594,0.0018125136,0.9115683,0.0004359836,0.0004057993,0.00049027137,0.0007355936,0.00030174453,0.0022742427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958383,0.0017245383,0.00034738908,0.0007720045,0.0011455114,0.00017234721],"domain_scores_gemma":[0.98768693,0.008214968,0.00064022944,0.0022845673,0.00091925974,0.00025407452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004763604,0.0012925133,0.001795314,0.0052106115,0.0017448107,0.0049888385,0.00273238,0.0018906676,0.0057097664],"category_scores_gemma":[0.025396157,0.0008280768,0.002066819,0.0048379907,0.0040294034,0.0083122635,0.005438586,0.0048494465,0.001670487],"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.00007215412,0.000072866445,0.00081981637,0.00037588846,0.00014522961,0.00007358397,0.00024242625,0.059720006,0.0010933621,0.74082863,0.006721266,0.18983482],"study_design_scores_gemma":[0.000014813174,0.000013321784,0.00011732593,0.000026742071,0.000011105055,0.00003674998,0.000038686332,0.2193877,0.0003831933,0.77609277,0.0038631882,0.000014452319],"about_ca_topic_score_codex":0.0026140185,"about_ca_topic_score_gemma":0.002278873,"teacher_disagreement_score":0.0057097664,"about_ca_system_score_codex":0.0032157458,"about_ca_system_score_gemma":0.002238426,"threshold_uncertainty_score":0.025192618},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012252646,0.000113243295,0.98488706,0.000042406464,0.000021337855,0.000050069153,0.00006763079,0.000924551,0.001641068],"genre_scores_gemma":[0.20608601,0.00018820334,0.7887383,0.00006785233,0.000048083086,0.00020107221,0.0008633686,0.00048718983,0.003319953],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958104,0.00006383604,0.000025767116,0.0001392147,0.00013754242,0.000052630923],"domain_scores_gemma":[0.99955493,0.00015036236,0.000025874764,0.00013056747,0.00010740257,0.000030955664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004331143,0.0005847783,0.0008214708,0.0015949544,0.00055494835,0.0010199624,0.0013604027,0.0005896563,0.0061025405],"category_scores_gemma":[0.0013628425,0.00032890958,0.0007238714,0.00089140574,0.0009619628,0.0021913801,0.0020035286,0.0013553275,0.0014059712],"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.00024354777,0.00015955004,0.0017116185,0.00034247272,0.00012771577,0.00026002855,0.000375748,0.12648132,0.042639315,0.17336763,0.0067600184,0.647531],"study_design_scores_gemma":[0.00010062815,0.00024133868,0.0007740923,0.000037644153,0.00006903248,0.00026796595,0.00016095968,0.7753513,0.03183508,0.17579249,0.0153176915,0.00005170866],"about_ca_topic_score_codex":0.00096674374,"about_ca_topic_score_gemma":0.0012254618,"teacher_disagreement_score":0.0061025405,"about_ca_system_score_codex":0.0005697987,"about_ca_system_score_gemma":0.0007010167,"threshold_uncertainty_score":0.020415008},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87113315,0.00070670433,0.06884412,0.00037538406,0.000077919285,0.000057616053,0.0002723533,0.00027734574,0.058255345],"genre_scores_gemma":[0.97443026,0.00032430177,0.011317631,0.00007220785,0.0000452232,0.000035836445,0.0005115391,0.00005229784,0.013210803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917394,0.00008231561,0.00005252301,0.00016973127,0.00035128344,0.00017017926],"domain_scores_gemma":[0.99921477,0.00021802988,0.000088816734,0.0001228059,0.00020256056,0.00015284927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060530874,0.000291028,0.0003313298,0.0017143585,0.0014822743,0.0027129373,0.0005392804,0.00049798045,0.0040401705],"category_scores_gemma":[0.0017924084,0.00034511188,0.00046749736,0.0006740003,0.0033318505,0.003171754,0.0034911262,0.0013802731,0.00043595894],"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.00005983351,0.00003078303,0.007212889,0.00006939485,0.000012096129,0.00040164767,0.0018855375,0.0006682541,0.0044870432,0.96591973,0.0006249535,0.018627973],"study_design_scores_gemma":[0.000046727495,0.00017387402,0.022330824,0.00017479727,0.00005146455,0.0020837034,0.0031472077,0.008741748,0.014948045,0.84634537,0.10187996,0.000076292294],"about_ca_topic_score_codex":0.001025892,"about_ca_topic_score_gemma":0.0007069491,"teacher_disagreement_score":0.0040401705,"about_ca_system_score_codex":0.001133947,"about_ca_system_score_gemma":0.0003546679,"threshold_uncertainty_score":0.01351577},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79780716,0.0049800663,0.13019478,0.0057406235,0.00025075025,0.00007829627,0.0003875381,0.00045028597,0.060110502],"genre_scores_gemma":[0.9882839,0.0007517673,0.0067259073,0.0002874672,0.00014915495,0.000053914737,0.00015580436,0.00006820683,0.003523881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993747,0.00020643478,0.000022924161,0.00009969071,0.00017919703,0.00011717626],"domain_scores_gemma":[0.9962835,0.0020687557,0.00042897757,0.00022195884,0.00024924704,0.00074762094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011532991,0.0004261894,0.0006932836,0.0025480809,0.0013359758,0.0031847684,0.0010253956,0.0012499058,0.005698305],"category_scores_gemma":[0.00906703,0.00036428275,0.0005865652,0.000779169,0.0037992443,0.0039393757,0.0023061652,0.0015618972,0.00045195167],"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.000027130776,0.000017117662,0.00067587127,0.00004006038,0.000007880093,0.00007371696,0.00017352813,0.0040222467,0.0007608336,0.9918956,0.00076281046,0.0015432115],"study_design_scores_gemma":[0.000018264018,0.000018370472,0.00084721803,0.000032372096,0.000005353613,0.00010982056,0.00011938451,0.069792636,0.00046349684,0.92717516,0.0014000719,0.000017828925],"about_ca_topic_score_codex":0.0017352791,"about_ca_topic_score_gemma":0.0009161823,"teacher_disagreement_score":0.005698305,"about_ca_system_score_codex":0.0018156681,"about_ca_system_score_gemma":0.0005237068,"threshold_uncertainty_score":0.019062698},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97316736,0.00009887506,0.018933501,0.00018523276,0.00002269596,0.00001964048,0.00007492706,0.00004679667,0.007450841],"genre_scores_gemma":[0.99411494,0.000054084347,0.00404323,0.00003516947,0.000015404958,0.00001707663,0.00009134576,0.000016106764,0.0016126437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950635,0.000108596396,0.000030286923,0.00009113131,0.00012638317,0.00013723002],"domain_scores_gemma":[0.9972127,0.0009630421,0.0007317779,0.0003532973,0.00034869826,0.00039048516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049305573,0.00028008758,0.000366131,0.001653613,0.001154985,0.0022845077,0.0006155728,0.00076563837,0.0033157836],"category_scores_gemma":[0.002725392,0.00032664157,0.00035560844,0.0008404961,0.0027879623,0.0031964504,0.0019988718,0.00077678135,0.00022436073],"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.00025501195,0.00006483797,0.011638442,0.00007824414,0.000024884403,0.0006305287,0.0013474678,0.006755228,0.01756105,0.9484316,0.0006315136,0.012581264],"study_design_scores_gemma":[0.000033171513,0.00006498471,0.0055673765,0.00003867646,0.000035724435,0.0006280171,0.0009908694,0.02325205,0.010396549,0.94964117,0.00929649,0.00005486747],"about_ca_topic_score_codex":0.0011958446,"about_ca_topic_score_gemma":0.001374555,"teacher_disagreement_score":0.0033157836,"about_ca_system_score_codex":0.0009982507,"about_ca_system_score_gemma":0.00067009527,"threshold_uncertainty_score":0.011092365},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4902268,0.0022846828,0.47667187,0.0009804973,0.00035299556,0.000093195085,0.0006204763,0.00035456932,0.02841504],"genre_scores_gemma":[0.9377472,0.0007090901,0.05539228,0.00019572621,0.00048800954,0.00006932962,0.00043023235,0.00009076759,0.0048774825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993387,0.000110955625,0.00004904178,0.00012267457,0.0002850257,0.00009344424],"domain_scores_gemma":[0.996635,0.0012942873,0.0006904268,0.00038903177,0.000636426,0.00035479086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005297339,0.0003586224,0.0005104766,0.0027262657,0.00073016825,0.0021580718,0.0005328186,0.00072089536,0.0019198039],"category_scores_gemma":[0.003641228,0.00025913873,0.0003928682,0.0015751702,0.0025353692,0.0025775651,0.0014326042,0.0012429701,0.0004463413],"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.000039046758,0.00002170537,0.00158867,0.00007276878,0.000008620726,0.0001347096,0.00046226915,0.0041951765,0.0059066173,0.96875507,0.0010729006,0.01774247],"study_design_scores_gemma":[0.000019212439,0.000088880806,0.0021359425,0.000060505296,0.000017348404,0.0008487463,0.00026680483,0.07770492,0.0033386075,0.9005297,0.014930065,0.000059261947],"about_ca_topic_score_codex":0.00038701892,"about_ca_topic_score_gemma":0.0002662798,"teacher_disagreement_score":0.0027262657,"about_ca_system_score_codex":0.00047080894,"about_ca_system_score_gemma":0.000394636,"threshold_uncertainty_score":0.0064224005},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8704682,0.0011975233,0.060235746,0.00087868556,0.0003198302,0.000055218297,0.0003926962,0.00013246774,0.06631967],"genre_scores_gemma":[0.9786759,0.00050811365,0.0071529276,0.00016922534,0.00013583692,0.0000257105,0.00024396212,0.000048529717,0.013039736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99981266,0.000026228981,0.0000060287607,0.000045518216,0.000050268885,0.00005924258],"domain_scores_gemma":[0.999713,0.000055175646,0.000055307723,0.000018698276,0.000055639637,0.00010210162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017086008,0.00030070462,0.00022277822,0.0016091089,0.00068231137,0.0021808033,0.00030151563,0.00026736603,0.005874287],"category_scores_gemma":[0.00053585053,0.00021024984,0.0002536345,0.0008384523,0.0016426663,0.0012909356,0.0009224183,0.00067349663,0.00047834514],"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.000059504895,0.000023189697,0.00203834,0.00006472465,0.000015379186,0.0002604173,0.000622215,0.0038815371,0.0081793135,0.97198445,0.002505718,0.010365114],"study_design_scores_gemma":[0.000021338494,0.00007758646,0.0062278565,0.000040004874,0.000017218374,0.00057222176,0.0006087,0.023257665,0.005931669,0.9436777,0.019517252,0.000050695766],"about_ca_topic_score_codex":0.0028662195,"about_ca_topic_score_gemma":0.002657124,"teacher_disagreement_score":0.005874287,"about_ca_system_score_codex":0.0013924438,"about_ca_system_score_gemma":0.00036834885,"threshold_uncertainty_score":0.019651413},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76757634,0.00048260036,0.2092503,0.0009102175,0.00009099888,0.00006318547,0.00060070434,0.00056624325,0.020459326],"genre_scores_gemma":[0.9401204,0.00027978828,0.047814384,0.00014901989,0.000068248395,0.000066320055,0.0014229419,0.00011328319,0.009965575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984547,0.00036744543,0.0001437078,0.00031711036,0.00053772045,0.00017932682],"domain_scores_gemma":[0.9888469,0.0056825997,0.0013163816,0.0015833471,0.0015805938,0.0009900617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012978808,0.00031887266,0.00092763413,0.0032101248,0.0027179655,0.0062032966,0.0015422534,0.0012402683,0.0061713043],"category_scores_gemma":[0.014946636,0.00048118713,0.0006946023,0.0028330472,0.0026220519,0.0069277775,0.0028164738,0.0015566783,0.00075863715],"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.00029531654,0.000111022244,0.0046230583,0.00011909232,0.000034529312,0.00022243542,0.00094640197,0.009367441,0.003957565,0.95167273,0.001357466,0.027292782],"study_design_scores_gemma":[0.000022798433,0.000076092816,0.001541439,0.000057675992,0.000036797348,0.00038654072,0.00086534576,0.033882987,0.0037578442,0.9526066,0.0067337016,0.000032153916],"about_ca_topic_score_codex":0.0011115078,"about_ca_topic_score_gemma":0.0012857039,"teacher_disagreement_score":0.0062032966,"about_ca_system_score_codex":0.001835825,"about_ca_system_score_gemma":0.0014196498,"threshold_uncertainty_score":0.020645082},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.572205,0.011079726,0.2512962,0.008666097,0.0006285913,0.00015117256,0.00064896996,0.00025251464,0.1550718],"genre_scores_gemma":[0.9429529,0.003700609,0.03345179,0.00062040833,0.0005628553,0.000072872266,0.0004439848,0.0001037907,0.018090846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992384,0.0002725334,0.000044153738,0.00012610792,0.00019609787,0.00012278445],"domain_scores_gemma":[0.9971969,0.0016310057,0.00029263576,0.00018057691,0.00031167764,0.00038718613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001134203,0.0007501535,0.00077344757,0.0033474106,0.0017553463,0.0030594743,0.0013123475,0.0010622921,0.0069140326],"category_scores_gemma":[0.0067663854,0.0004820615,0.0007184275,0.0024399802,0.0034698218,0.006391618,0.0029871033,0.0017256227,0.0008449258],"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.000021250604,0.00003709439,0.0007535363,0.00010652881,0.000017073811,0.00018520503,0.0005017836,0.0031693582,0.0006844622,0.98414224,0.0022249112,0.008156436],"study_design_scores_gemma":[0.0000074215163,0.000021875047,0.000538666,0.000039396004,0.000011609242,0.000262683,0.00033024317,0.012589229,0.00029802893,0.9790375,0.0068471683,0.000016074395],"about_ca_topic_score_codex":0.0017636821,"about_ca_topic_score_gemma":0.0018539106,"teacher_disagreement_score":0.0069140326,"about_ca_system_score_codex":0.0013502834,"about_ca_system_score_gemma":0.0006249886,"threshold_uncertainty_score":0.023129702},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.387077,0.0011781841,0.42677903,0.0008152384,0.0001701088,0.00016113858,0.0050611775,0.0028434652,0.17591459],"genre_scores_gemma":[0.8247431,0.0004881235,0.13965407,0.00016006138,0.00006488334,0.000091114845,0.006637252,0.00053704705,0.02762431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945825,0.00008248915,0.00003129759,0.000093690214,0.00020851204,0.00012568141],"domain_scores_gemma":[0.9986053,0.00049643684,0.000098512784,0.00038062027,0.00028468375,0.0001344375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030277157,0.00035088672,0.000521382,0.0014578772,0.0011591678,0.0021159258,0.0008448645,0.0005240721,0.0114649],"category_scores_gemma":[0.0029225105,0.00027277754,0.00042020032,0.0019994332,0.0007468979,0.0024068865,0.0019635425,0.0009977838,0.0028020313],"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.00034824747,0.00015054007,0.0061262106,0.0004985461,0.000037899386,0.0004407663,0.0009073119,0.011782613,0.010997873,0.68203753,0.028445613,0.25822684],"study_design_scores_gemma":[0.00002769653,0.000042029904,0.0031241796,0.00010346482,0.00004186908,0.0009098086,0.00064194784,0.07577152,0.01285345,0.8450129,0.06143537,0.000035841087],"about_ca_topic_score_codex":0.0038300706,"about_ca_topic_score_gemma":0.0070399893,"teacher_disagreement_score":0.0114649,"about_ca_system_score_codex":0.00076886057,"about_ca_system_score_gemma":0.0007924307,"threshold_uncertainty_score":0.03835392},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7919188,0.0008873988,0.17270201,0.0028348868,0.000110320085,0.00008159052,0.001121081,0.0007298889,0.029614002],"genre_scores_gemma":[0.98140717,0.0003580336,0.011602978,0.0001782848,0.00015104045,0.000055621094,0.00042597315,0.0001220717,0.005698822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877065,0.00041539545,0.00004979587,0.0001855474,0.00026915007,0.00030944523],"domain_scores_gemma":[0.99064976,0.0053672884,0.001284662,0.0011991325,0.000543383,0.0009558404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019218122,0.00050381076,0.0013863457,0.0026188528,0.0019965607,0.0040793777,0.002126207,0.0020478112,0.008825951],"category_scores_gemma":[0.013804171,0.00067643984,0.0007616099,0.0019430713,0.0033400962,0.0073001646,0.0026359465,0.0022938552,0.0008020931],"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.00007212363,0.000032808035,0.0014249755,0.00003980812,0.000015217672,0.00016857065,0.00019252383,0.012445285,0.00058286026,0.9785186,0.0020106693,0.0044965744],"study_design_scores_gemma":[0.000022350596,0.000013762083,0.0008032667,0.000018314819,0.0000148823465,0.00014545149,0.00012159871,0.103919335,0.00035518312,0.8935731,0.0009887349,0.000024049545],"about_ca_topic_score_codex":0.0040411586,"about_ca_topic_score_gemma":0.004842805,"teacher_disagreement_score":0.008825951,"about_ca_system_score_codex":0.0017446473,"about_ca_system_score_gemma":0.0010732362,"threshold_uncertainty_score":0.029525757},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61093634,0.00044606073,0.3740622,0.0003115063,0.00002768274,0.00016209942,0.0018557349,0.000412095,0.011786309],"genre_scores_gemma":[0.861342,0.00020910027,0.13300024,0.00007498978,0.00007051312,0.00016682156,0.002715301,0.00012572481,0.002295301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901867,0.00017908862,0.000053097152,0.00024541855,0.00036504853,0.00013871823],"domain_scores_gemma":[0.9906283,0.0063136704,0.0012557759,0.001000769,0.00033555244,0.00046594127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007144344,0.00040843812,0.00059601257,0.001498346,0.0011744591,0.001565423,0.0009875933,0.00068361795,0.003946014],"category_scores_gemma":[0.007685487,0.00058349397,0.0010296641,0.0012161615,0.0012202774,0.0021806215,0.0011413204,0.0010002261,0.00038795237],"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.0012820072,0.00044092076,0.05312849,0.0008364342,0.00028883465,0.0010378135,0.0018436869,0.14319362,0.054071482,0.55393785,0.007840524,0.18209845],"study_design_scores_gemma":[0.000074317984,0.00024322051,0.015011687,0.00011341945,0.00013506094,0.0019651614,0.0006818222,0.31987876,0.029455401,0.6190303,0.013352257,0.00005859351],"about_ca_topic_score_codex":0.0007797367,"about_ca_topic_score_gemma":0.0012437606,"teacher_disagreement_score":0.003946014,"about_ca_system_score_codex":0.0007042824,"about_ca_system_score_gemma":0.000512949,"threshold_uncertainty_score":0.0132007},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30165213,0.0013290144,0.65160704,0.002598244,0.0002029975,0.00007911363,0.0010007031,0.0008387981,0.04069198],"genre_scores_gemma":[0.9298108,0.0011320933,0.056028068,0.0006916132,0.00055622566,0.00009833035,0.0010921968,0.00030094566,0.010289799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990526,0.0002528117,0.000056543875,0.00020395659,0.00028688522,0.00014715218],"domain_scores_gemma":[0.9955942,0.0018527771,0.0005349831,0.0007677453,0.0006575698,0.00059262523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010291267,0.00050858344,0.0007746554,0.0036559086,0.0015328526,0.0032467735,0.0012973116,0.001228889,0.0066778734],"category_scores_gemma":[0.010025512,0.0003236697,0.0007059856,0.003789131,0.0029110862,0.0054363455,0.0024155488,0.0022109835,0.0015586829],"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.000053485113,0.000039668525,0.0013154125,0.000053913136,0.000012376037,0.00017868388,0.00044529932,0.005521956,0.002671742,0.9593915,0.00427584,0.026040204],"study_design_scores_gemma":[0.0000070272777,0.000019623958,0.00068069086,0.000025110416,0.000009957532,0.0003198834,0.00031615456,0.044005685,0.0006190401,0.9497491,0.0042257546,0.000022016495],"about_ca_topic_score_codex":0.0014303665,"about_ca_topic_score_gemma":0.0011771214,"teacher_disagreement_score":0.0066778734,"about_ca_system_score_codex":0.0009296103,"about_ca_system_score_gemma":0.0006150074,"threshold_uncertainty_score":0.022339702},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2596666,0.011823094,0.42194515,0.011514504,0.0022154332,0.00022088447,0.001673751,0.0015198507,0.28942063],"genre_scores_gemma":[0.81051916,0.0049660914,0.14559898,0.0015499387,0.0012820385,0.00010658126,0.0013787753,0.00051649177,0.034082048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948883,0.00011494262,0.000028961831,0.00014567653,0.00014995504,0.000071558],"domain_scores_gemma":[0.9973303,0.0014598286,0.00018637111,0.00050383975,0.0002049353,0.00031460702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006151329,0.00059027004,0.00066606654,0.0028147306,0.0025449696,0.0020623205,0.0016362291,0.0012903645,0.010531501],"category_scores_gemma":[0.005112793,0.000465108,0.00074249797,0.0024909214,0.0040680217,0.0063233166,0.0034426225,0.0029502697,0.0014422457],"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.00016491419,0.000024261226,0.0014639704,0.00019200091,0.000019684961,0.0018603307,0.00096835924,0.0031493884,0.0026855832,0.94687283,0.0153431995,0.027255464],"study_design_scores_gemma":[0.000009557571,0.000031941927,0.0011912753,0.000059566893,0.000023632329,0.0018169327,0.000500425,0.007454607,0.0012754024,0.94948286,0.0381279,0.000026009944],"about_ca_topic_score_codex":0.003100973,"about_ca_topic_score_gemma":0.004391177,"teacher_disagreement_score":0.010531501,"about_ca_system_score_codex":0.0011242587,"about_ca_system_score_gemma":0.0003979304,"threshold_uncertainty_score":0.03523141},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8092643,0.00043859525,0.1878188,0.00012709288,0.000013761917,0.00003080988,0.00027315711,0.00034228465,0.0016911499],"genre_scores_gemma":[0.98968935,0.00008428341,0.009666608,0.000014322448,0.000013364397,0.000021234575,0.0001985713,0.000021743903,0.0002905595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948585,0.00016282337,0.000033511413,0.00012124622,0.00013302254,0.00006363511],"domain_scores_gemma":[0.99695563,0.0014962157,0.00084171526,0.0002750305,0.0001366685,0.00029472713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090907066,0.00030475532,0.0005056833,0.0035691333,0.00041865258,0.00080826075,0.0004844885,0.00061498344,0.0010885441],"category_scores_gemma":[0.0054115485,0.00018725582,0.00037568723,0.0016505466,0.0011264322,0.00165743,0.0012758571,0.0005277417,0.00021025202],"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.00081733963,0.00028022157,0.06901796,0.00029623785,0.0004605738,0.00045687016,0.00065259065,0.6441825,0.05130532,0.12558784,0.0011578035,0.10578465],"study_design_scores_gemma":[0.000014722268,0.00014671174,0.012916994,0.0000069753764,0.000015865735,0.000159372,0.000086779706,0.925951,0.0036163388,0.05636876,0.00067372195,0.000042723896],"about_ca_topic_score_codex":0.0017813738,"about_ca_topic_score_gemma":0.00097619963,"teacher_disagreement_score":0.0035691333,"about_ca_system_score_codex":0.00076012465,"about_ca_system_score_gemma":0.00033138634,"threshold_uncertainty_score":0.0055150986},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009722613,0.0009227567,0.98213136,0.00043640344,0.00016356548,0.000031502783,0.00023902289,0.00039469142,0.005958086],"genre_scores_gemma":[0.4116867,0.0027115147,0.56593025,0.0008138583,0.0007565204,0.00022982334,0.0011132407,0.00082098803,0.015937185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983852,0.00045103574,0.00008632066,0.00039494364,0.00046641636,0.00021610758],"domain_scores_gemma":[0.9962203,0.0013221708,0.00040169383,0.0011317286,0.00064638443,0.00027780636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023078488,0.0008144978,0.0009924402,0.0019362246,0.0008953626,0.0029332747,0.0019459096,0.0014302643,0.0056520165],"category_scores_gemma":[0.016855625,0.0004811413,0.0011120893,0.0014783787,0.0018145897,0.0050807795,0.0029924163,0.0026044757,0.0026493892],"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.0000617847,0.000034124823,0.0018672114,0.000109156645,0.00003769389,0.00013973282,0.00016214269,0.027237454,0.001826019,0.8860742,0.0076303547,0.0748201],"study_design_scores_gemma":[0.000010996895,0.00003630902,0.0010652023,0.00006828717,0.000019316594,0.00043101277,0.000054847682,0.3537257,0.0016891883,0.6051092,0.03774202,0.000047931833],"about_ca_topic_score_codex":0.0017567715,"about_ca_topic_score_gemma":0.0013998363,"teacher_disagreement_score":0.0056520165,"about_ca_system_score_codex":0.0009055402,"about_ca_system_score_gemma":0.0010675184,"threshold_uncertainty_score":0.018907845},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5779067,0.00026030795,0.41055945,0.00036505595,0.00006479083,0.00006296564,0.0010459024,0.0010181915,0.008716698],"genre_scores_gemma":[0.8551599,0.0002608683,0.13485314,0.000101120255,0.00007962455,0.00005677073,0.0023137499,0.00055391126,0.0066209617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958414,0.0000947308,0.000027835009,0.00011778179,0.00011750591,0.0000579501],"domain_scores_gemma":[0.9980854,0.00071459915,0.00033652494,0.00040041667,0.0002273067,0.00023592851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037051726,0.00083347526,0.0006643539,0.0012610249,0.00051393395,0.0028053082,0.0013066323,0.0009825812,0.004405675],"category_scores_gemma":[0.0031248408,0.0007482116,0.0008277521,0.0007908209,0.0012032762,0.0022832723,0.0018884084,0.0019139979,0.0014803649],"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.0013235605,0.0003837763,0.009502663,0.0006364099,0.00012108231,0.002065303,0.0033447286,0.06116212,0.07262877,0.68782514,0.010280098,0.1507264],"study_design_scores_gemma":[0.00005316465,0.000119080956,0.002470729,0.00007757396,0.000044609984,0.0010882923,0.0007184011,0.27075014,0.011602089,0.7039037,0.009119189,0.000053070577],"about_ca_topic_score_codex":0.0005752597,"about_ca_topic_score_gemma":0.0007061229,"teacher_disagreement_score":0.004405675,"about_ca_system_score_codex":0.0004196923,"about_ca_system_score_gemma":0.00025949895,"threshold_uncertainty_score":0.0147384405},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3493554,0.002088695,0.2862863,0.0016601068,0.004043766,0.0002661162,0.0006330423,0.0012774295,0.3543891],"genre_scores_gemma":[0.69072866,0.002364851,0.06839899,0.00058396085,0.0010196484,0.0001918789,0.0005711471,0.00092247355,0.2352185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995596,0.00009525064,0.000034092856,0.000096839794,0.00014420117,0.00007001453],"domain_scores_gemma":[0.99963117,0.0000846974,0.000044986482,0.000100427,0.00006679815,0.00007185289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043284206,0.0008808501,0.00055562396,0.0016675545,0.0011953583,0.0020870266,0.0006590174,0.00056219473,0.01541585],"category_scores_gemma":[0.0008185488,0.0005257447,0.0008185796,0.0009087502,0.0022532137,0.0032106664,0.0022395572,0.0019852037,0.0027924546],"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.000018578266,0.000014548744,0.00008403038,0.000023160308,0.0000073393976,0.00013278687,0.00037299364,0.00045525227,0.0026343472,0.97740763,0.0025459535,0.016303234],"study_design_scores_gemma":[0.000009859914,0.000053571523,0.00035639244,0.000015072129,0.0000064456394,0.00054858753,0.00030988842,0.0034535378,0.0020803148,0.9698193,0.023334177,0.000012940925],"about_ca_topic_score_codex":0.00033308726,"about_ca_topic_score_gemma":0.0004070311,"teacher_disagreement_score":0.01541585,"about_ca_system_score_codex":0.00047317296,"about_ca_system_score_gemma":0.0002901069,"threshold_uncertainty_score":0.05157113},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39186916,0.0025929005,0.51986146,0.016810963,0.0008783225,0.000079550584,0.00060977344,0.0007136757,0.06658427],"genre_scores_gemma":[0.9279403,0.0010269579,0.058589898,0.0018860016,0.00059462746,0.00009174512,0.0004736131,0.00009793404,0.009298967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782324,0.00044425135,0.00017450521,0.0006206171,0.0005887889,0.0003486307],"domain_scores_gemma":[0.9903594,0.005368849,0.000605094,0.001870072,0.0011265964,0.00066996197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004279604,0.00045456892,0.0011517984,0.0030471177,0.003142262,0.0036494583,0.0015421852,0.0027425624,0.0067391843],"category_scores_gemma":[0.013568678,0.00065079855,0.0012401597,0.0028488243,0.0070963916,0.01847403,0.0060362793,0.003945632,0.0004828451],"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.000020357773,0.00001614606,0.0008147568,0.000032375607,0.0000068020927,0.00009460479,0.00026401263,0.0006358044,0.0003065961,0.99244505,0.00096229,0.004401263],"study_design_scores_gemma":[0.0000055051805,0.000011760636,0.00037477826,0.000019219933,0.0000063781113,0.0001008146,0.00015053284,0.003176841,0.00027906135,0.9928591,0.0030051204,0.000010864556],"about_ca_topic_score_codex":0.0012119232,"about_ca_topic_score_gemma":0.0011090349,"teacher_disagreement_score":0.0067391843,"about_ca_system_score_codex":0.0014975893,"about_ca_system_score_gemma":0.00096347247,"threshold_uncertainty_score":0.022632957},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004627992,0.0029990359,0.9745341,0.0006058569,0.00024587088,0.000053771113,0.0009099353,0.0035392742,0.012484084],"genre_scores_gemma":[0.12009711,0.008053202,0.81677926,0.00049552304,0.0008217591,0.00023272487,0.0069814865,0.0023360343,0.044202957],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994043,0.000067627705,0.00004194957,0.00016999528,0.0002773849,0.000038746985],"domain_scores_gemma":[0.99921095,0.0003416481,0.000048647697,0.0002552241,0.00010820099,0.000035418794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006900471,0.0007912291,0.0007141672,0.0023031763,0.00051441375,0.0026654138,0.0015683187,0.00075178733,0.010399085],"category_scores_gemma":[0.0021632214,0.00042458417,0.00080470333,0.0032794413,0.001365829,0.0038507406,0.002559933,0.0017038016,0.0049959538],"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.000043475073,0.000039815874,0.0010810859,0.00044176768,0.000052853862,0.0001966051,0.00042108787,0.011495709,0.007936693,0.2805206,0.048007425,0.6497629],"study_design_scores_gemma":[0.0000070907186,0.000040090443,0.0016405955,0.00014853674,0.00003647792,0.00069792964,0.00020630703,0.18002646,0.0088654235,0.6360013,0.17228055,0.00004934657],"about_ca_topic_score_codex":0.0012976731,"about_ca_topic_score_gemma":0.0016820929,"teacher_disagreement_score":0.010399085,"about_ca_system_score_codex":0.0007038054,"about_ca_system_score_gemma":0.00059043657,"threshold_uncertainty_score":0.03478837},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42376685,0.003838742,0.21249713,0.0025377243,0.00041615876,0.00006909828,0.00063113216,0.0002064519,0.35603672],"genre_scores_gemma":[0.9471087,0.0013754771,0.021017317,0.0003613934,0.000318794,0.000074524665,0.0005053902,0.00014962775,0.029088708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949634,0.000090955094,0.000027468954,0.00013045153,0.00019071836,0.00006397141],"domain_scores_gemma":[0.99803656,0.0010234552,0.00015324495,0.00019774336,0.00038951365,0.00019949794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071674417,0.00044812032,0.0005346554,0.0019504525,0.001006752,0.0036210436,0.0009974198,0.00072123174,0.007026645],"category_scores_gemma":[0.003547457,0.00043164505,0.00052737084,0.0009175844,0.002963811,0.0045783906,0.0015309469,0.002600703,0.00066555355],"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.000011779217,0.000004854037,0.00008207616,0.000014159076,0.0000021873807,0.000026378371,0.00008840111,0.00036172956,0.0005731334,0.99608886,0.00046471605,0.0022816737],"study_design_scores_gemma":[0.0000074952363,0.000010254626,0.00016541529,0.000013578632,0.0000051078373,0.0001294444,0.00009337358,0.004229516,0.0007708818,0.989589,0.0049772845,0.000008731853],"about_ca_topic_score_codex":0.0011713983,"about_ca_topic_score_gemma":0.00071413454,"teacher_disagreement_score":0.007026645,"about_ca_system_score_codex":0.001356529,"about_ca_system_score_gemma":0.0004161655,"threshold_uncertainty_score":0.023506463},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048006754,0.00031065935,0.05739825,0.0003581643,0.0004641891,0.00010737717,0.0761999,0.85353893,0.011142542],"genre_scores_gemma":[0.0053577367,0.0003753406,0.042926148,0.0007070371,0.00012300708,0.0005069469,0.1567379,0.77704966,0.016216148],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974425,0.00046775205,0.00025110968,0.00055708305,0.0008573806,0.00042407733],"domain_scores_gemma":[0.99509674,0.0015442246,0.00023010031,0.0015828874,0.0012253954,0.00032054968],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0044511324,0.004940343,0.0039445693,0.0037052596,0.0016570843,0.0075303377,0.009505801,0.0033183834,0.47465542],"category_scores_gemma":[0.018074138,0.0052953577,0.0058591333,0.0033517533,0.0011678943,0.0065098093,0.0063760593,0.0063137333,0.5774596],"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.00015116135,0.000028018307,0.0004791516,0.00057388825,0.00008676592,0.00007082047,0.00009779807,0.00076116965,0.0006440119,0.0026095605,0.98110193,0.0133957425],"study_design_scores_gemma":[0.00030243368,0.0000491365,0.0012824504,0.0003756491,0.000096576434,0.0003802782,0.0001162067,0.007847968,0.0063071884,0.01947078,0.96356213,0.0002091918],"about_ca_topic_score_codex":0.005853872,"about_ca_topic_score_gemma":0.0046334923,"teacher_disagreement_score":0.47465542,"about_ca_system_score_codex":0.0017084813,"about_ca_system_score_gemma":0.0026255297,"threshold_uncertainty_score":0.7493403},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6845153,0.0046824208,0.17506716,0.0056200647,0.00031419648,0.00012507966,0.0012614588,0.00049213745,0.12792234],"genre_scores_gemma":[0.971291,0.001245181,0.017757388,0.00037592102,0.00024708724,0.00007708026,0.00048175632,0.00014508424,0.008379577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986192,0.00031071564,0.0000644669,0.0003489173,0.00034357942,0.0003131296],"domain_scores_gemma":[0.9848534,0.009402337,0.0013947331,0.001925923,0.00087908393,0.0015444774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022282552,0.0010418141,0.001181341,0.0049838913,0.0023235558,0.0054748277,0.0029824588,0.0018647023,0.010129876],"category_scores_gemma":[0.012714241,0.00096795516,0.0009778161,0.0042411643,0.006804228,0.011496839,0.0049719242,0.005462685,0.00089015934],"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.00009609973,0.00002682356,0.0014224749,0.00007054898,0.000012010444,0.000042549706,0.00026054544,0.0035428263,0.00088040525,0.9875507,0.0014221033,0.004672895],"study_design_scores_gemma":[0.00001590098,0.000014193361,0.0009407131,0.00003281029,0.000023719951,0.000061251405,0.0001122518,0.012167981,0.00049065985,0.9841686,0.0019506348,0.000021298672],"about_ca_topic_score_codex":0.0018164141,"about_ca_topic_score_gemma":0.0031719727,"teacher_disagreement_score":0.010129876,"about_ca_system_score_codex":0.0037834116,"about_ca_system_score_gemma":0.0012140585,"threshold_uncertainty_score":0.033887804},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46363717,0.0022193932,0.38499153,0.0013353219,0.0002841549,0.00017892642,0.0003759336,0.0006748801,0.14630263],"genre_scores_gemma":[0.9371616,0.00060680707,0.046400115,0.00026965202,0.00013814692,0.00012993641,0.00033056797,0.0001891007,0.014773958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958974,0.000061684965,0.000027805978,0.000100956844,0.0001320095,0.00008782465],"domain_scores_gemma":[0.9992962,0.00032782907,0.00006501154,0.00006700145,0.00013371803,0.00011021731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005867061,0.00046232916,0.000605241,0.002291039,0.0010461954,0.002701906,0.0011425763,0.0013309612,0.009540807],"category_scores_gemma":[0.0034971382,0.00034229457,0.0005645386,0.0010072672,0.002028803,0.0044656675,0.0020610334,0.0016685186,0.0010472628],"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.000011491898,0.000011447181,0.00027453646,0.000034935765,0.0000023330647,0.00010676853,0.00021418963,0.00068304036,0.00093180785,0.99079645,0.00054490677,0.0063879625],"study_design_scores_gemma":[0.000010335838,0.000013657887,0.00034593762,0.0000235804,0.000008199685,0.0001838984,0.0001297422,0.018463982,0.0015305493,0.97426313,0.0050106207,0.000016374404],"about_ca_topic_score_codex":0.0012851114,"about_ca_topic_score_gemma":0.0016364518,"teacher_disagreement_score":0.009540807,"about_ca_system_score_codex":0.0014848122,"about_ca_system_score_gemma":0.00040875986,"threshold_uncertainty_score":0.031917155},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44469482,0.0013514656,0.49308544,0.010081635,0.00031487507,0.0010945359,0.012903316,0.0064893244,0.029984541],"genre_scores_gemma":[0.60691077,0.0008896222,0.35760272,0.0013023315,0.00021497489,0.00068538537,0.021430032,0.0009218199,0.010042397],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974275,0.0002883359,0.000293663,0.000989109,0.0006560915,0.0003452134],"domain_scores_gemma":[0.979226,0.016069222,0.0009886313,0.0020216217,0.0010649764,0.0006295664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010061,0.0011226604,0.0018918891,0.00066941587,0.0022290589,0.0056823418,0.0027639712,0.002498827,0.0110140955],"category_scores_gemma":[0.00943801,0.0013741283,0.003131866,0.0016870832,0.0022399705,0.009712851,0.0035892122,0.0040168064,0.0018017602],"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.0018639592,0.0010515032,0.015669858,0.004416839,0.0006714817,0.003250744,0.0028401471,0.250739,0.069578074,0.2302473,0.07874491,0.34092614],"study_design_scores_gemma":[0.0002894736,0.00017676935,0.0028146096,0.00016660923,0.00023653348,0.001556791,0.0023029326,0.31053227,0.028492449,0.61978316,0.03350829,0.00014011347],"about_ca_topic_score_codex":0.0044145035,"about_ca_topic_score_gemma":0.007593211,"teacher_disagreement_score":0.0110140955,"about_ca_system_score_codex":0.001608288,"about_ca_system_score_gemma":0.0018217751,"threshold_uncertainty_score":0.036845863},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6022115,0.0021828006,0.38559017,0.0009909092,0.000027903858,0.00006969936,0.0006957116,0.00024632478,0.007984992],"genre_scores_gemma":[0.96728534,0.0008120225,0.030648038,0.000048310114,0.00007394285,0.00006731874,0.00045617015,0.00005567799,0.0005531394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991499,0.0003428132,0.000040253428,0.00020285924,0.00020693072,0.000057280555],"domain_scores_gemma":[0.99185467,0.0047680624,0.0018277215,0.0005730551,0.00055768015,0.000418772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015526629,0.00070983515,0.00049293664,0.0037452995,0.0005096821,0.0015333483,0.0005922534,0.0007026068,0.0019033914],"category_scores_gemma":[0.012637836,0.00033565273,0.0004357894,0.0018288672,0.0025420322,0.004822032,0.0018787769,0.00083571795,0.00022869956],"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.0002241347,0.00007683938,0.029067248,0.0003667718,0.0001772076,0.00035679215,0.0023501136,0.17352657,0.013463639,0.7023649,0.0013139552,0.0767119],"study_design_scores_gemma":[0.0000114063,0.00011906307,0.022071566,0.000046595407,0.000036373393,0.00030320862,0.00044768187,0.25011346,0.0015928071,0.72269297,0.002517339,0.00004760028],"about_ca_topic_score_codex":0.0014828001,"about_ca_topic_score_gemma":0.0017123325,"teacher_disagreement_score":0.0037452995,"about_ca_system_score_codex":0.0008645028,"about_ca_system_score_gemma":0.0003822642,"threshold_uncertainty_score":0.008211315},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7660534,0.0009873522,0.20761992,0.0026103177,0.000077871664,0.00019006943,0.00068544224,0.0009605423,0.020815132],"genre_scores_gemma":[0.9767259,0.0006559312,0.015263458,0.00029646224,0.00008090131,0.00028427606,0.00056669535,0.00024104991,0.00588548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976743,0.0009021632,0.00007114263,0.000501176,0.00047704612,0.00037422663],"domain_scores_gemma":[0.9783513,0.014315929,0.0021995464,0.0024949796,0.0011797504,0.001458585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027219208,0.0007577333,0.0011526488,0.0018513456,0.0014175943,0.001964825,0.002592302,0.0014139445,0.0047324933],"category_scores_gemma":[0.022020945,0.00093852327,0.0010279783,0.0009578026,0.0030699726,0.0052988003,0.0022918526,0.0019526427,0.00078494305],"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.0009874012,0.00022621537,0.017619595,0.00039736845,0.0002398861,0.00073688896,0.00081642123,0.30930588,0.026649343,0.59032476,0.010767982,0.04192824],"study_design_scores_gemma":[0.000096741125,0.00028219182,0.0050697424,0.000059372527,0.00008723927,0.0008888855,0.00020921665,0.7730019,0.0064140046,0.20983462,0.0039686807,0.00008730669],"about_ca_topic_score_codex":0.0014627554,"about_ca_topic_score_gemma":0.0013946593,"teacher_disagreement_score":0.0047324933,"about_ca_system_score_codex":0.0025460143,"about_ca_system_score_gemma":0.00095269305,"threshold_uncertainty_score":0.018472672},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.895867,0.00061374664,0.07969256,0.00029003978,0.000061772706,0.00003618193,0.0001337613,0.000065019616,0.023239987],"genre_scores_gemma":[0.9809333,0.0003532122,0.010764899,0.0000439941,0.000061855695,0.00003417039,0.00015645009,0.00002689013,0.0076251323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968934,0.000034348588,0.00001146,0.000065808024,0.000113113696,0.00008603529],"domain_scores_gemma":[0.9994567,0.0001328099,0.00012388763,0.00003620565,0.000089934314,0.00016036502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027891586,0.00039978608,0.0002855242,0.002411877,0.0007410111,0.0020964474,0.00045535347,0.00033301645,0.0039363997],"category_scores_gemma":[0.0013884373,0.00019568794,0.00028613323,0.0007368877,0.0020538461,0.0025856367,0.0012230008,0.0010258631,0.00026471316],"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.00003111491,0.000014928796,0.0016058284,0.000033432432,0.0000067368596,0.0000963072,0.0005191932,0.003265308,0.0045004473,0.98036504,0.0002927633,0.009268857],"study_design_scores_gemma":[0.00002077552,0.00007235522,0.0034037072,0.00004734355,0.00001579361,0.00036250282,0.0011554445,0.03381238,0.008280535,0.9407627,0.012029375,0.000037090802],"about_ca_topic_score_codex":0.0016121031,"about_ca_topic_score_gemma":0.0011337023,"teacher_disagreement_score":0.0039363997,"about_ca_system_score_codex":0.00093237567,"about_ca_system_score_gemma":0.00032172073,"threshold_uncertainty_score":0.013168573},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14117254,0.022157349,0.11519521,0.013641328,0.0016241894,0.000044851055,0.0003883448,0.0003528862,0.7054233],"genre_scores_gemma":[0.89007163,0.007753342,0.019630654,0.00053710386,0.0032072288,0.000083988176,0.00046321386,0.00015673782,0.078096114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938476,0.00018789497,0.00002580233,0.00009476883,0.0002355677,0.00007114434],"domain_scores_gemma":[0.9988028,0.00085905526,0.000051347113,0.00012115192,0.0001108366,0.00005480774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090799946,0.000641849,0.00088887656,0.0016512005,0.0021557729,0.0038961656,0.0012203407,0.0011742712,0.010305075],"category_scores_gemma":[0.0022851883,0.0004432609,0.0007824763,0.0026401796,0.005160967,0.00911657,0.0014022626,0.003261862,0.0008802585],"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.0000032431576,0.000004774695,0.000036458223,0.000014131379,0.000001793698,0.00001348661,0.0000687658,0.00028592802,0.000041528452,0.99624074,0.0012023575,0.00208686],"study_design_scores_gemma":[0.000002021908,0.0000016540572,0.00006276424,0.0000053015656,0.0000017236205,0.000022396249,0.000021177606,0.00066932425,0.000044388027,0.9942378,0.004928639,0.0000029050127],"about_ca_topic_score_codex":0.00092643156,"about_ca_topic_score_gemma":0.0011228557,"teacher_disagreement_score":0.010305075,"about_ca_system_score_codex":0.0022811997,"about_ca_system_score_gemma":0.000746163,"threshold_uncertainty_score":0.034473896},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046260484,0.083232924,0.18372841,0.024087995,0.0031905521,0.000047597878,0.0005370833,0.00023562828,0.65867937],"genre_scores_gemma":[0.6740375,0.04766417,0.03243823,0.0029853403,0.005913935,0.0001308148,0.0006463321,0.00033833372,0.23584528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998068,0.0000521018,0.000012512782,0.000046509427,0.00006227401,0.00001990401],"domain_scores_gemma":[0.99977213,0.00012305829,0.000019450605,0.000035390996,0.000031646567,0.000018298273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005677503,0.0005148997,0.00034347794,0.00082338107,0.00058684027,0.0019494828,0.00045194797,0.0008374422,0.00550638],"category_scores_gemma":[0.0016662016,0.00020946047,0.00024181519,0.001152061,0.0026455203,0.00431987,0.0009543293,0.0014966149,0.00095537095],"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.0000071453137,0.0000045989877,0.000074587646,0.00003986982,0.000003090207,0.000025597921,0.00013392897,0.0002798068,0.0003724751,0.9714659,0.008513812,0.019079175],"study_design_scores_gemma":[0.0000033261072,0.000005324901,0.00016379927,0.000015866077,0.0000025990628,0.00008652326,0.00006533685,0.00048711727,0.0001673279,0.94044894,0.058550015,0.000003916194],"about_ca_topic_score_codex":0.0010234845,"about_ca_topic_score_gemma":0.0006664866,"teacher_disagreement_score":0.00550638,"about_ca_system_score_codex":0.0010347043,"about_ca_system_score_gemma":0.00045900696,"threshold_uncertainty_score":0.018420637},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009300913,0.0013325681,0.88846993,0.0015571382,0.00056849944,0.00012336487,0.007250995,0.030131577,0.061265],"genre_scores_gemma":[0.16481672,0.0032169006,0.72616327,0.00064385805,0.00032762685,0.0004093813,0.011111144,0.011225502,0.08208568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99947006,0.0001165826,0.000030447069,0.00015103264,0.00018020249,0.000051686027],"domain_scores_gemma":[0.99912876,0.0003879732,0.00008760793,0.00017101855,0.00015388698,0.000070733106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005506376,0.0010052128,0.0006178218,0.003177044,0.0007519381,0.002087138,0.0008422551,0.0008349705,0.063342854],"category_scores_gemma":[0.003114933,0.00047106904,0.00073876005,0.002452552,0.00093326316,0.0032192005,0.0020908744,0.0013234692,0.015081231],"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.00024610464,0.00004312702,0.002014668,0.0007077648,0.000071285314,0.0005547633,0.0011150234,0.020042343,0.01297579,0.49670538,0.12095206,0.34457174],"study_design_scores_gemma":[0.000041821717,0.000031794687,0.0010079716,0.00016836514,0.00003029857,0.00067625305,0.00018969865,0.08615861,0.009963629,0.23865728,0.663006,0.00006831712],"about_ca_topic_score_codex":0.003288427,"about_ca_topic_score_gemma":0.004318617,"teacher_disagreement_score":0.063342854,"about_ca_system_score_codex":0.0006477047,"about_ca_system_score_gemma":0.0009193517,"threshold_uncertainty_score":0.21190298},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052993424,0.08662723,0.13505203,0.15185115,0.01389029,0.00011106499,0.0008476764,0.00060912484,0.55801797],"genre_scores_gemma":[0.6210181,0.07562261,0.06559893,0.029201206,0.019934926,0.0003024501,0.00087650894,0.00036736016,0.18707792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993405,0.00022184299,0.000049456023,0.000119198616,0.00019077209,0.00007827412],"domain_scores_gemma":[0.99858934,0.00072946015,0.00007836506,0.00015790327,0.00028727116,0.00015770536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001573417,0.0007793063,0.00051334157,0.0013378222,0.0023804202,0.003102828,0.002078282,0.001619106,0.021977741],"category_scores_gemma":[0.0036806013,0.00022310663,0.0005947072,0.0016749924,0.0033162045,0.009700351,0.0027792752,0.0030438749,0.0030503976],"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.000015183334,0.000013481587,0.00027056344,0.0001360459,0.0000042620804,0.00018157547,0.0002570132,0.00042071083,0.00025857778,0.973749,0.012666562,0.012027083],"study_design_scores_gemma":[0.000002433783,0.0000134530865,0.00022689965,0.00006628147,0.0000024807607,0.0002502844,0.00033830412,0.00051341736,0.00023303548,0.90471715,0.09362816,0.00000812324],"about_ca_topic_score_codex":0.0011256482,"about_ca_topic_score_gemma":0.0009126455,"teacher_disagreement_score":0.021977741,"about_ca_system_score_codex":0.00079997646,"about_ca_system_score_gemma":0.0003754141,"threshold_uncertainty_score":0.073522925},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0918629,0.05208975,0.30504492,0.019557368,0.008403153,0.00011418078,0.0018086659,0.0013489282,0.51977015],"genre_scores_gemma":[0.68624204,0.0284348,0.08796998,0.002865735,0.0076740617,0.00036129108,0.0011845459,0.0005218926,0.18474568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992231,0.00019032176,0.000028613122,0.00015877762,0.0002641837,0.00013504743],"domain_scores_gemma":[0.99923337,0.0002883705,0.00005423708,0.00009747966,0.00021390774,0.00011265966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016472082,0.0010385935,0.001261583,0.003741958,0.002023686,0.004759327,0.0010356698,0.0014547616,0.011059361],"category_scores_gemma":[0.0034255176,0.00042204958,0.0012627894,0.002738943,0.005210811,0.0061995266,0.0024415674,0.0058426606,0.0022212574],"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.00001755448,0.000007529106,0.00014503732,0.00006984957,0.000019776448,0.00007674885,0.00032770121,0.00031804538,0.000683357,0.98335326,0.0045287227,0.010452418],"study_design_scores_gemma":[0.000042821044,0.00003440512,0.0022344922,0.00008546834,0.00002790812,0.00058022776,0.00037069098,0.002568272,0.001116435,0.8407512,0.15213871,0.000049427985],"about_ca_topic_score_codex":0.022770576,"about_ca_topic_score_gemma":0.012962238,"teacher_disagreement_score":0.022770576,"about_ca_system_score_codex":0.004792483,"about_ca_system_score_gemma":0.002333478,"threshold_uncertainty_score":0.045276105},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09751464,0.0059945663,0.8463254,0.006458037,0.0007266584,0.000036298596,0.00031500217,0.0003851176,0.04224425],"genre_scores_gemma":[0.7922114,0.004840885,0.15256421,0.002909467,0.0021281124,0.00024869302,0.00040929957,0.0009887349,0.04369916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842393,0.00038826859,0.00006638642,0.00052053353,0.0003987328,0.00020210035],"domain_scores_gemma":[0.992462,0.004381071,0.0006828588,0.000711274,0.0010121271,0.0007506681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004894801,0.000710348,0.0011093054,0.0017519438,0.001382538,0.0039037184,0.0022658284,0.0018957087,0.0073090615],"category_scores_gemma":[0.018089287,0.0006096302,0.0015061242,0.0010515507,0.0065523945,0.008930587,0.0037442462,0.005002631,0.001414057],"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.000035426845,0.0000146518805,0.00046030473,0.00006843887,0.000017910817,0.000091766764,0.00019455522,0.0020142659,0.0013701888,0.98915267,0.00082763867,0.005752265],"study_design_scores_gemma":[0.0000197594,0.00004834389,0.0006601965,0.000066272325,0.000015540438,0.00024213339,0.00010353619,0.022186108,0.0014363704,0.9677881,0.0074004084,0.00003328837],"about_ca_topic_score_codex":0.0028878285,"about_ca_topic_score_gemma":0.0019108651,"teacher_disagreement_score":0.0073090615,"about_ca_system_score_codex":0.0024264073,"about_ca_system_score_gemma":0.0011308074,"threshold_uncertainty_score":0.025886536},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011234394,0.06946547,0.15505181,0.0049955975,0.002063226,0.000079867685,0.0004947168,0.0006100455,0.7560049],"genre_scores_gemma":[0.2501222,0.061194107,0.08891059,0.0016219858,0.00391824,0.00031655948,0.0015696338,0.0007254927,0.59162116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976295,0.00005523584,0.00001289423,0.000038363127,0.00011471752,0.000015846566],"domain_scores_gemma":[0.999566,0.00021561794,0.000026497277,0.00006458928,0.00008752282,0.00003973716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003671915,0.00089164905,0.0006289617,0.0025924437,0.0012410891,0.004687105,0.00068542245,0.0010713445,0.01760077],"category_scores_gemma":[0.0013721256,0.0005368883,0.00030713223,0.0036395213,0.0026015195,0.0047911024,0.0011587997,0.0020851505,0.0044005746],"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.000002628121,0.0000058316755,0.000029989664,0.000045327844,0.0000020852776,0.000017396691,0.0001822204,0.00022958235,0.0001780115,0.966962,0.014281873,0.018062998],"study_design_scores_gemma":[0.0000018786637,0.0000032334897,0.00006999177,0.000034309433,0.0000027320193,0.00006981491,0.00007702135,0.0008711335,0.00014065472,0.84327877,0.1554455,0.000005098922],"about_ca_topic_score_codex":0.0012767353,"about_ca_topic_score_gemma":0.0017087604,"teacher_disagreement_score":0.01760077,"about_ca_system_score_codex":0.0013439385,"about_ca_system_score_gemma":0.00059036905,"threshold_uncertainty_score":0.05888045},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09445851,0.021143563,0.090100564,0.008621859,0.0022235774,0.00004894947,0.0002049398,0.0005561817,0.7826418],"genre_scores_gemma":[0.8159352,0.011967322,0.018156026,0.00055532466,0.003973813,0.000074725314,0.0002160814,0.00021376979,0.14890766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995683,0.00013028423,0.00001545175,0.00004829881,0.00019303447,0.00004460125],"domain_scores_gemma":[0.9995055,0.00018320396,0.000040638886,0.00006563461,0.00012329643,0.000081700106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082927896,0.00083573273,0.0008288397,0.002443194,0.0015351622,0.0028272981,0.000732643,0.0009516662,0.005698689],"category_scores_gemma":[0.0020222813,0.0003614367,0.0005146867,0.0013696575,0.0031166524,0.0034261765,0.0011363314,0.0027495394,0.0010035235],"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.0000036053245,0.00000604638,0.000029623874,0.00001732184,0.0000024648064,0.000017067117,0.00009948296,0.00030344917,0.0001489611,0.99368817,0.0018283518,0.0038555253],"study_design_scores_gemma":[0.0000033078775,0.0000037241225,0.000083126375,0.000010012969,0.0000017951921,0.00003879977,0.000027510823,0.00096110115,0.000062220905,0.9887737,0.010030981,0.0000036225927],"about_ca_topic_score_codex":0.0009662492,"about_ca_topic_score_gemma":0.0006107943,"teacher_disagreement_score":0.005698689,"about_ca_system_score_codex":0.0021969706,"about_ca_system_score_gemma":0.0008476276,"threshold_uncertainty_score":0.01906401},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039275452,0.00010366943,0.957944,0.00026822573,0.000025791267,0.0001716841,0.00028414163,0.00037897893,0.0015480989],"genre_scores_gemma":[0.53482145,0.00024280057,0.4588061,0.00030127587,0.000101593905,0.0007902372,0.0023262654,0.00032644978,0.0022838747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983387,0.0007378876,0.000076125514,0.00027745645,0.00040919348,0.00016064581],"domain_scores_gemma":[0.9903052,0.006687773,0.00044127222,0.0012638206,0.00075742835,0.00054451893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042128647,0.0006068589,0.0015517422,0.0018926394,0.0012451273,0.0018855508,0.0035001356,0.0015294789,0.0053619],"category_scores_gemma":[0.023120128,0.00084307237,0.0010454796,0.0014030808,0.0021199319,0.0021490648,0.0037459917,0.0023240899,0.00084122515],"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.00018467192,0.00011115586,0.0060732123,0.00013817249,0.000080627346,0.00036227627,0.00036498153,0.43954328,0.0028039578,0.511114,0.0032099406,0.036013667],"study_design_scores_gemma":[0.000020319716,0.000014923212,0.000192787,0.000011427532,0.0000064463848,0.000040748506,0.000023585339,0.8983652,0.00036873133,0.100357495,0.0005866965,0.0000116288065],"about_ca_topic_score_codex":0.00470535,"about_ca_topic_score_gemma":0.006509553,"teacher_disagreement_score":0.0053619,"about_ca_system_score_codex":0.0016965719,"about_ca_system_score_gemma":0.0025807668,"threshold_uncertainty_score":0.022280037},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22506082,0.0022406722,0.69295496,0.0038618525,0.00064092886,0.00004688722,0.00017051442,0.0003286333,0.07469475],"genre_scores_gemma":[0.9150938,0.0011913835,0.05814698,0.00064263324,0.00083762355,0.00007178516,0.00013513274,0.00015813632,0.023722643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891615,0.00040944575,0.000078235214,0.00013156385,0.00030972506,0.00015495108],"domain_scores_gemma":[0.9969848,0.0015379102,0.0002921121,0.00042489416,0.0004748991,0.00028530724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002188391,0.00078253594,0.001002119,0.0043503223,0.001967766,0.0038732472,0.0015804891,0.0015724525,0.0069174385],"category_scores_gemma":[0.007132337,0.0004751223,0.00089572533,0.0026552496,0.004794029,0.007819351,0.0025091423,0.0026706352,0.0005821663],"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.0000020899054,0.0000025413474,0.000023452429,0.0000037741224,9.781709e-7,0.000007940049,0.000031210508,0.00024918656,0.00006487828,0.9988432,0.000077083154,0.00069366314],"study_design_scores_gemma":[0.0000012354534,0.000002074306,0.000018181745,0.0000029911994,0.0000012658264,0.00001130083,0.000012080554,0.0037604538,0.000043425902,0.9957444,0.00039967604,0.0000030237147],"about_ca_topic_score_codex":0.0011940087,"about_ca_topic_score_gemma":0.001415068,"teacher_disagreement_score":0.0069174385,"about_ca_system_score_codex":0.0020547553,"about_ca_system_score_gemma":0.001002287,"threshold_uncertainty_score":0.023141146},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9801257,0.00015283181,0.018386735,0.00006190152,0.00000579037,0.000021332859,0.00028574697,0.00007687644,0.00088302203],"genre_scores_gemma":[0.9967475,0.000032557353,0.0028918365,0.0000036242275,0.0000031574589,0.000006626291,0.00016597798,0.0000066853668,0.00014182586],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9998814,0.00002222813,0.000010488848,0.000035728306,0.000032566753,0.00001763359],"domain_scores_gemma":[0.9993931,0.00012426452,0.00025773686,0.00008052234,0.00006065545,0.00008380564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023052582,0.00019383279,0.0002695881,0.0014037697,0.00024448932,0.00084066385,0.00022493223,0.0003712182,0.0017686094],"category_scores_gemma":[0.0011682125,0.00010567446,0.00030055016,0.0006572824,0.000399503,0.0006236546,0.00072122726,0.0002660212,0.00017621693],"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.0018037052,0.00025033441,0.5985015,0.00026585287,0.00038166708,0.0027398227,0.0014324437,0.06335648,0.14492626,0.02879502,0.002689686,0.15485714],"study_design_scores_gemma":[0.000026350024,0.00043299305,0.6310425,0.00004159523,0.00013601311,0.0047221533,0.0009621504,0.31455192,0.014100206,0.031221291,0.0026907134,0.000072170464],"about_ca_topic_score_codex":0.0014074899,"about_ca_topic_score_gemma":0.0012480625,"teacher_disagreement_score":0.0017686094,"about_ca_system_score_codex":0.00028936274,"about_ca_system_score_gemma":0.00017282911,"threshold_uncertainty_score":0.0059165955},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07443257,0.0141993435,0.8065833,0.018498875,0.0015035145,0.00037253313,0.006781309,0.0022085102,0.075420044],"genre_scores_gemma":[0.6395682,0.014074615,0.27482048,0.0010726543,0.0012402377,0.00088690635,0.004754855,0.0007624487,0.06281963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953483,0.0019603006,0.0002698612,0.0011958322,0.0009843074,0.00024140651],"domain_scores_gemma":[0.9875729,0.0062741986,0.0012705384,0.0026172753,0.0016850563,0.0005800425],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0051309313,0.0013888294,0.0011354197,0.005939614,0.0020175655,0.012451483,0.0023139436,0.0026822789,0.016526131],"category_scores_gemma":[0.020372627,0.00074397406,0.0028742657,0.009405683,0.004023057,0.014605744,0.0032427607,0.0030321907,0.003958952],"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.00009107688,0.0001403291,0.012543782,0.0006490794,0.0002566002,0.0002990752,0.0025202332,0.026731627,0.0012106836,0.87454593,0.009097811,0.07191376],"study_design_scores_gemma":[0.00003652798,0.00010341291,0.0057448857,0.0004707314,0.00017809201,0.00057158776,0.0024976716,0.11093411,0.0016021659,0.71682346,0.16091101,0.00012633651],"about_ca_topic_score_codex":0.018086756,"about_ca_topic_score_gemma":0.0132918805,"teacher_disagreement_score":0.9940604,"about_ca_system_score_codex":0.0036838797,"about_ca_system_score_gemma":0.0036342128,"threshold_uncertainty_score":0.055285394},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47222683,0.0011824361,0.471488,0.001497696,0.00026204114,0.00011585074,0.00032976817,0.00066916423,0.052228235],"genre_scores_gemma":[0.9590953,0.00058627385,0.032446183,0.00013698408,0.0001816429,0.000055864406,0.00019002131,0.00008635384,0.0072212433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986229,0.00036268248,0.000114489376,0.00024126659,0.00037795893,0.0002806388],"domain_scores_gemma":[0.99836653,0.00046580555,0.00029954946,0.00026338818,0.00026655494,0.00033813762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017092647,0.00045786225,0.00048759233,0.003162957,0.0017667271,0.004826592,0.0005530616,0.0007653911,0.0044191773],"category_scores_gemma":[0.0042410735,0.00038051067,0.00063268386,0.0016928368,0.00433594,0.011095732,0.0044926247,0.0013610694,0.00047003245],"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.0000060501047,0.0000054452426,0.00051651837,0.000008523639,0.0000020743496,0.000039317547,0.0003937986,0.00038846335,0.0003790044,0.9952651,0.00021708522,0.0027786274],"study_design_scores_gemma":[0.0000045188285,0.000015317559,0.0004356662,0.000017255647,0.0000056953954,0.00007634037,0.00038416657,0.0060230573,0.00076855335,0.98720413,0.0050525293,0.000012739494],"about_ca_topic_score_codex":0.001715671,"about_ca_topic_score_gemma":0.0010439318,"teacher_disagreement_score":0.004826592,"about_ca_system_score_codex":0.00160964,"about_ca_system_score_gemma":0.0007618429,"threshold_uncertainty_score":0.014783621},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76262504,0.0006108093,0.16546033,0.00074426,0.00012516108,0.00002893808,0.00011645743,0.00010354728,0.07018528],"genre_scores_gemma":[0.98902065,0.00012612386,0.007852732,0.00007353576,0.000045114833,0.000014364241,0.000048233658,0.000016847398,0.0028024197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995552,0.00008531817,0.000021601929,0.000120890116,0.00013007085,0.000086951324],"domain_scores_gemma":[0.9990532,0.0002284248,0.00020193573,0.00016891811,0.00015614134,0.00019136346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051234657,0.00024345162,0.0003080742,0.001367878,0.0008043334,0.0022822905,0.00041495546,0.00047312788,0.0032432354],"category_scores_gemma":[0.0019139105,0.00014887779,0.00031661193,0.0006846814,0.0027371827,0.0033009315,0.0014223922,0.00091804314,0.00022542171],"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.000004748301,0.000007941585,0.00040187105,0.0000066586185,0.000002572206,0.0000412454,0.00014681464,0.00091358024,0.00062245823,0.9958669,0.00014985673,0.0018353695],"study_design_scores_gemma":[0.0000034075094,0.000008368866,0.00070210156,0.000010229019,0.0000031132308,0.000094547264,0.00016862623,0.014412017,0.00069228554,0.9815118,0.0023826838,0.00001079727],"about_ca_topic_score_codex":0.0012432194,"about_ca_topic_score_gemma":0.0011359709,"teacher_disagreement_score":0.0032432354,"about_ca_system_score_codex":0.0010345855,"about_ca_system_score_gemma":0.00035295676,"threshold_uncertainty_score":0.010849714},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064053856,0.00044442242,0.9317281,0.00065335084,0.000056999288,0.00009075338,0.0003177586,0.00060856325,0.0020461055],"genre_scores_gemma":[0.685314,0.00038421675,0.31106192,0.0002489137,0.00014178436,0.00028342422,0.00079926284,0.00026039913,0.0015059505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99473,0.002803376,0.00024011987,0.0009476045,0.0010542976,0.00022460085],"domain_scores_gemma":[0.95357037,0.03268858,0.004260772,0.006267045,0.00215855,0.0010546754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008502813,0.00074033876,0.0016608238,0.009303791,0.0015527095,0.0045261066,0.0025754317,0.002106878,0.0030994597],"category_scores_gemma":[0.060308877,0.0008507619,0.0014529936,0.004605878,0.0052754753,0.006562306,0.005290076,0.0026430252,0.00054214493],"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.0004030127,0.00014775181,0.031387534,0.00063109375,0.0004155928,0.00057094794,0.0019464099,0.1925487,0.006642,0.5489775,0.00584282,0.21048671],"study_design_scores_gemma":[0.000020577616,0.00009371409,0.003651566,0.0000789763,0.000037319252,0.00030911362,0.000372074,0.6243324,0.0012281926,0.36695117,0.0028578404,0.00006701418],"about_ca_topic_score_codex":0.001632475,"about_ca_topic_score_gemma":0.0011234023,"teacher_disagreement_score":0.009303791,"about_ca_system_score_codex":0.0015476097,"about_ca_system_score_gemma":0.0012114807,"threshold_uncertainty_score":0.04496771},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7855153,0.0008375645,0.19969782,0.0007590239,0.000059113965,0.000051191968,0.00025609802,0.00025384128,0.012570011],"genre_scores_gemma":[0.9866853,0.00026385172,0.008880953,0.000079059646,0.00006287383,0.000058616366,0.00013156774,0.000052224892,0.0037854738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994116,0.00020059141,0.00002115886,0.000108533925,0.00013845856,0.0001196642],"domain_scores_gemma":[0.9972717,0.0012761046,0.0005082322,0.00021351977,0.00025791483,0.000472559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009886624,0.00033857944,0.0007495746,0.00147232,0.00076848734,0.001784998,0.0012118823,0.0008053458,0.0027424346],"category_scores_gemma":[0.0066440045,0.00035815247,0.0007112619,0.0006673307,0.0026159286,0.0019014983,0.0014809212,0.00082412944,0.00029813606],"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.00008436806,0.00002344685,0.002105893,0.000037712336,0.000023179344,0.0002625453,0.00022295793,0.108882695,0.0018782245,0.882884,0.00071080093,0.002884064],"study_design_scores_gemma":[0.0000472159,0.000047061127,0.0019096044,0.000025942769,0.000015437969,0.0002485081,0.00020603911,0.590846,0.00072075555,0.4039883,0.0019036885,0.000041497562],"about_ca_topic_score_codex":0.0057799206,"about_ca_topic_score_gemma":0.00305433,"teacher_disagreement_score":0.0057799206,"about_ca_system_score_codex":0.0019221735,"about_ca_system_score_gemma":0.00048738648,"threshold_uncertainty_score":0.013946414},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33955365,0.0012975454,0.62966007,0.0026106357,0.0001652341,0.00021004582,0.001271751,0.001242262,0.023988742],"genre_scores_gemma":[0.7250112,0.000680681,0.26055416,0.00069138367,0.00012651438,0.0007582817,0.0021051934,0.00048691445,0.009585611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961694,0.0015967475,0.00021805282,0.00083227456,0.0007737518,0.00040979293],"domain_scores_gemma":[0.9853044,0.008124989,0.000996708,0.004083858,0.000790748,0.00069929357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025162664,0.00058631453,0.0010329614,0.0018348868,0.0020220387,0.0035960877,0.0027518403,0.0015596412,0.0066855955],"category_scores_gemma":[0.018626384,0.001056482,0.0009062803,0.0025477635,0.002690533,0.007091344,0.0051834215,0.0022664152,0.0011049686],"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.0002266209,0.00010114277,0.002351069,0.00017453017,0.000040823455,0.000114404254,0.00035205463,0.0440853,0.0047660256,0.90613323,0.0062525477,0.035402283],"study_design_scores_gemma":[0.00008144342,0.00006156149,0.0004364044,0.00005742289,0.00002025059,0.000227663,0.00016074575,0.21026435,0.0047164815,0.7753361,0.008599239,0.000038341193],"about_ca_topic_score_codex":0.0008483241,"about_ca_topic_score_gemma":0.0012992071,"teacher_disagreement_score":0.0066855955,"about_ca_system_score_codex":0.0025685923,"about_ca_system_score_gemma":0.001287875,"threshold_uncertainty_score":0.02236551},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70549196,0.001127406,0.26512092,0.0014438423,0.00015121333,0.00008061343,0.00039040687,0.00016288848,0.026030624],"genre_scores_gemma":[0.980316,0.00041378578,0.014558226,0.00013584556,0.00017867346,0.00005090256,0.0002498668,0.000069188594,0.0040273885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912924,0.00022359214,0.000060764476,0.00021917008,0.00026317872,0.00010407852],"domain_scores_gemma":[0.9951851,0.0024591244,0.0007613952,0.00041801026,0.0005982472,0.0005780993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013121233,0.00045021408,0.00089984667,0.0038526887,0.0011843364,0.0035178196,0.001438834,0.0016038723,0.0061606914],"category_scores_gemma":[0.009945556,0.0004020561,0.00039350917,0.0023166498,0.0033591269,0.008433867,0.0038617875,0.0016324344,0.0005551145],"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.00008098829,0.00004575149,0.0015052513,0.000059315906,0.000010599247,0.000105208106,0.00028946347,0.005794805,0.0025501444,0.9769474,0.00064176595,0.011969387],"study_design_scores_gemma":[0.00001731875,0.00008943341,0.0014395763,0.000022228513,0.000012929548,0.00022521325,0.00027077756,0.06635327,0.0010496383,0.92884547,0.0016435664,0.0000304868],"about_ca_topic_score_codex":0.00065391086,"about_ca_topic_score_gemma":0.00043188155,"teacher_disagreement_score":0.0061606914,"about_ca_system_score_codex":0.00091553264,"about_ca_system_score_gemma":0.00048511417,"threshold_uncertainty_score":0.020609617},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9679748,0.0001406596,0.027840154,0.00018953,0.000012639242,0.000011806285,0.00018376148,0.000102256534,0.0035443543],"genre_scores_gemma":[0.9983021,0.000021427664,0.0014661365,0.00000752595,0.000005598265,0.0000034081136,0.000061937404,0.000009301341,0.00012258776],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99982905,0.000042712894,0.000009383332,0.000055054898,0.000039538398,0.000024130852],"domain_scores_gemma":[0.9990337,0.00037065093,0.00025444734,0.00015478647,0.00007229749,0.00011410887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025892264,0.00014916382,0.00018931895,0.00059234037,0.00013886025,0.00070939655,0.00018854524,0.00026590252,0.0025109127],"category_scores_gemma":[0.0027866766,0.000116549556,0.00012359217,0.00037039316,0.0009078013,0.001122608,0.0006642906,0.00037730992,0.00013333226],"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.0013941977,0.00016598759,0.050878268,0.00045022444,0.00017891655,0.00069985294,0.0034193976,0.010688243,0.7797183,0.05133285,0.0011489585,0.099924825],"study_design_scores_gemma":[0.0000356374,0.00040779109,0.7726489,0.000040474148,0.00006941942,0.0014499825,0.001300627,0.062004995,0.05175774,0.10790889,0.0023089866,0.00006647646],"about_ca_topic_score_codex":0.00026655436,"about_ca_topic_score_gemma":0.0002449165,"teacher_disagreement_score":0.0025109127,"about_ca_system_score_codex":0.0001706803,"about_ca_system_score_gemma":0.00009024631,"threshold_uncertainty_score":0.008399844},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010199853,0.008185221,0.1824034,0.0028642842,0.0038694271,0.00008520516,0.0046932013,0.0018095574,0.7858899],"genre_scores_gemma":[0.26813486,0.01601798,0.12325574,0.00079150667,0.002213236,0.0001855245,0.011550227,0.002734572,0.57511646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976,0.00003650918,0.000008705348,0.00004652153,0.00013289771,0.000015470758],"domain_scores_gemma":[0.99961567,0.00009474139,0.000018060942,0.000099362,0.000110631096,0.00006150458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004065913,0.00037501505,0.0003091832,0.0019222843,0.00060026796,0.0028320125,0.0004938309,0.000555188,0.055306986],"category_scores_gemma":[0.0014051093,0.00022016028,0.00038497485,0.0015146572,0.0008560479,0.0014399443,0.001178905,0.0007697215,0.013592709],"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.00002459314,0.000009278341,0.000325117,0.0002755356,0.000011116705,0.0001963413,0.00023001035,0.0063519888,0.0023435417,0.7440687,0.13624008,0.10992361],"study_design_scores_gemma":[0.0000033803624,0.000012511797,0.0005849472,0.00007122732,0.000003875039,0.0006435364,0.00012362159,0.008292638,0.0011258391,0.18372668,0.8053975,0.000014153069],"about_ca_topic_score_codex":0.0005614437,"about_ca_topic_score_gemma":0.0007633738,"teacher_disagreement_score":0.055306986,"about_ca_system_score_codex":0.0008902836,"about_ca_system_score_gemma":0.00045318573,"threshold_uncertainty_score":0.18502033},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064303065,0.000057395202,0.9915074,0.00013592216,0.000030336285,0.00002185172,0.00002580568,0.00041132787,0.0013796752],"genre_scores_gemma":[0.282048,0.0002090116,0.7107968,0.00020262582,0.00020206234,0.0001575949,0.00024101614,0.0007060613,0.0054368395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985494,0.00041496434,0.0000699285,0.00026997982,0.0005648707,0.00013095536],"domain_scores_gemma":[0.99758863,0.0011079349,0.00022585849,0.0005874884,0.00031357733,0.00017649008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016169308,0.0010333208,0.0012455893,0.0012866601,0.00062033336,0.0014700013,0.0018620683,0.0009381469,0.0035988789],"category_scores_gemma":[0.0071164407,0.00045892404,0.0010621161,0.0010819054,0.0026392569,0.0030054145,0.003319819,0.0027481643,0.0008807284],"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.000118886914,0.00012199909,0.000753583,0.00017863676,0.000052945565,0.00015628464,0.00020187092,0.22099064,0.011332878,0.56221986,0.005980508,0.19789189],"study_design_scores_gemma":[0.000010555583,0.00003499647,0.00009684431,0.0000050884287,0.0000040085265,0.00003160196,0.000011741804,0.8437718,0.0021540874,0.15258142,0.0012862394,0.000011642099],"about_ca_topic_score_codex":0.0018233393,"about_ca_topic_score_gemma":0.002251709,"teacher_disagreement_score":0.0035988789,"about_ca_system_score_codex":0.0011217945,"about_ca_system_score_gemma":0.0013811107,"threshold_uncertainty_score":0.012039423},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017533984,0.00009242002,0.97908425,0.00007264931,0.000034364326,0.00007003026,0.00020676195,0.00032581185,0.0025796918],"genre_scores_gemma":[0.1942239,0.00024509255,0.79940635,0.00006074942,0.00011962413,0.00024235267,0.0011527872,0.00025565608,0.004293447],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748033,0.0002514931,0.00021324979,0.0006267587,0.0011160668,0.0003121723],"domain_scores_gemma":[0.99562645,0.0015903289,0.00042941482,0.001132817,0.0010259654,0.00019508442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012048968,0.0010919397,0.0011884731,0.004702729,0.001348402,0.0019658033,0.003542352,0.0008519637,0.0067917206],"category_scores_gemma":[0.0074517573,0.0005388357,0.0012429317,0.0041258843,0.001237163,0.0057131727,0.0019507367,0.0017236705,0.001475423],"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.00033774995,0.0002764897,0.007838037,0.0004932244,0.00012036806,0.00034790018,0.00042560263,0.120411046,0.023703389,0.41042134,0.0049529197,0.43067193],"study_design_scores_gemma":[0.000048147198,0.00023994705,0.0030838442,0.000043515753,0.00011290259,0.00068026345,0.00021929466,0.7383744,0.016634813,0.22045614,0.019996705,0.00011003308],"about_ca_topic_score_codex":0.00257135,"about_ca_topic_score_gemma":0.003975129,"teacher_disagreement_score":0.0067917206,"about_ca_system_score_codex":0.0013535422,"about_ca_system_score_gemma":0.0020027624,"threshold_uncertainty_score":0.022720516},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10690695,0.00014318894,0.8894469,0.0001538853,0.000025912681,0.0000784687,0.00062250276,0.00074372743,0.0018784148],"genre_scores_gemma":[0.5538693,0.00013577737,0.44360703,0.000049359394,0.00003872099,0.00023086998,0.0012042995,0.0003345806,0.00053013343],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986143,0.00040233447,0.00011678756,0.00034885984,0.00040929552,0.00010838241],"domain_scores_gemma":[0.9939528,0.0027882764,0.0009467531,0.0012473874,0.00072283496,0.000342001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024001617,0.0005473154,0.00078679726,0.009159858,0.0010647147,0.0034969987,0.0009423003,0.0006427474,0.00232453],"category_scores_gemma":[0.009300654,0.00035014187,0.0012249348,0.0051934267,0.0025091136,0.0024479344,0.0030418914,0.0013348979,0.000561604],"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.0003602754,0.00022801038,0.084938556,0.000936437,0.0005729568,0.00037348559,0.0047525815,0.08502931,0.097694784,0.22072925,0.003966994,0.5004174],"study_design_scores_gemma":[0.000056335914,0.00043387897,0.09797745,0.00016513812,0.00017552258,0.0013008531,0.0027322222,0.6461157,0.03148174,0.19989145,0.019387005,0.00028272433],"about_ca_topic_score_codex":0.0016151989,"about_ca_topic_score_gemma":0.0018946455,"teacher_disagreement_score":0.009159858,"about_ca_system_score_codex":0.00094026054,"about_ca_system_score_gemma":0.0010593423,"threshold_uncertainty_score":0.012693405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08307096,0.0032207542,0.86660767,0.004218874,0.0010073206,0.0000901559,0.0009063535,0.0021989918,0.03867897],"genre_scores_gemma":[0.7562999,0.0054459814,0.18033314,0.00161015,0.0016247476,0.0002553895,0.003128341,0.0014622589,0.04984001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998987,0.00022225232,0.00005917435,0.00028139705,0.0003608597,0.00008930162],"domain_scores_gemma":[0.9952684,0.0020235842,0.00057124597,0.00059175456,0.0010560913,0.0004888437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007738939,0.0011414536,0.0010690688,0.0028165502,0.0010029183,0.0035146032,0.0013611335,0.0016431342,0.00909774],"category_scores_gemma":[0.009217593,0.0005748396,0.000732858,0.0027041673,0.0018600178,0.006397962,0.0043566055,0.0034489052,0.002315744],"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.000057879406,0.00003690952,0.00053054426,0.00018086823,0.000018189268,0.00013757669,0.0003556809,0.008733865,0.0016944823,0.9203421,0.010286391,0.05762554],"study_design_scores_gemma":[0.000006458901,0.000029091469,0.00029426796,0.00005316452,0.000008719205,0.00018013082,0.00009558103,0.03466611,0.0009186325,0.94718826,0.016532958,0.00002660601],"about_ca_topic_score_codex":0.0016813107,"about_ca_topic_score_gemma":0.001251926,"teacher_disagreement_score":0.00909774,"about_ca_system_score_codex":0.0014050531,"about_ca_system_score_gemma":0.00060034497,"threshold_uncertainty_score":0.030434906},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92718774,0.00032689117,0.057401262,0.000097398035,0.000019601446,0.00002354723,0.00013386307,0.0001328544,0.014676816],"genre_scores_gemma":[0.98942494,0.0001124371,0.008862471,0.000020717309,0.000028266235,0.000012356615,0.0001816342,0.000025252679,0.0013319327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999658,0.00005094118,0.000020910786,0.00008474751,0.00013172826,0.000053783784],"domain_scores_gemma":[0.9987447,0.000527727,0.00031694994,0.00014682763,0.000120447236,0.00014323473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023728005,0.00025513506,0.0004562337,0.0019197863,0.000828018,0.0011646326,0.00032946066,0.00033463477,0.0025267103],"category_scores_gemma":[0.002276996,0.00029934823,0.00035655434,0.00055327866,0.0017106696,0.0018350388,0.0005582386,0.00064281386,0.00024012146],"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.00022390662,0.000072118106,0.0076916586,0.00016786602,0.000037765767,0.0021073746,0.0015296777,0.023993859,0.034863017,0.8977796,0.0014926924,0.030040389],"study_design_scores_gemma":[0.00006395242,0.0003740898,0.034889806,0.00010234676,0.00008460475,0.008053917,0.0020295316,0.21416938,0.024155907,0.68820196,0.027712272,0.00016210275],"about_ca_topic_score_codex":0.0009581726,"about_ca_topic_score_gemma":0.0007247947,"teacher_disagreement_score":0.0025267103,"about_ca_system_score_codex":0.00039573965,"about_ca_system_score_gemma":0.00012943667,"threshold_uncertainty_score":0.008452654},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5351376,0.00034935903,0.46070278,0.00018837306,0.000052416373,0.00010025114,0.0012950576,0.0006533746,0.0015207744],"genre_scores_gemma":[0.9443266,0.00015358526,0.053347144,0.000021258196,0.000028936134,0.00008413202,0.001683276,0.000050594375,0.00030455567],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992362,0.00025203076,0.00007027017,0.0001696789,0.00019712553,0.00007469956],"domain_scores_gemma":[0.99530596,0.0026320026,0.0006619441,0.0006740516,0.00055462576,0.00017143205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012633438,0.00039465743,0.00045841315,0.002723515,0.00032949867,0.00070102065,0.00052943884,0.00038915878,0.0014135379],"category_scores_gemma":[0.010536909,0.00011141963,0.0005785851,0.001517828,0.00076293346,0.0010563718,0.0008638753,0.00047487576,0.00022955048],"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.0015948989,0.0003283516,0.065154366,0.0011184132,0.00069520844,0.0011091076,0.0010817158,0.2287464,0.11051172,0.045102097,0.0039230073,0.5406347],"study_design_scores_gemma":[0.000029775874,0.0006138701,0.069146164,0.000041812847,0.00010928675,0.0008303504,0.0004757445,0.8630608,0.02288131,0.03917649,0.0035228122,0.00011165086],"about_ca_topic_score_codex":0.0006619696,"about_ca_topic_score_gemma":0.00071082107,"teacher_disagreement_score":0.002723515,"about_ca_system_score_codex":0.00030470363,"about_ca_system_score_gemma":0.00039706146,"threshold_uncertainty_score":0.006681323},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004749461,0.0007529297,0.0007590051,0.00041586277,0.00021278716,0.00009547201,0.9891523,0.001926491,0.0019356624],"genre_scores_gemma":[0.0053539923,0.0002341,0.001662341,0.00013613857,0.000045349258,0.00020889465,0.9909093,0.00012064372,0.0013291893],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977331,0.00037660458,0.0002722181,0.0006251044,0.00060524244,0.00038764824],"domain_scores_gemma":[0.9970009,0.0007356079,0.00028916766,0.0011533177,0.00054011395,0.00028094315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016765329,0.004070047,0.0017831511,0.007192705,0.0013275399,0.003683085,0.0038580382,0.0034168295,0.02826486],"category_scores_gemma":[0.011192081,0.00054873887,0.0030879958,0.006054118,0.0011222899,0.0018075755,0.0028543412,0.0024661056,0.03711627],"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.00042485076,0.00019643897,0.0056060036,0.0017721169,0.00017013807,0.00009145808,0.000052173804,0.0014141933,0.0004793896,0.0014789847,0.97152966,0.016784513],"study_design_scores_gemma":[0.0010427809,0.00028630212,0.018677983,0.00094762107,0.0003207181,0.0007810962,0.00047559987,0.007051547,0.0030732625,0.009394279,0.9578341,0.00011462634],"about_ca_topic_score_codex":0.014293156,"about_ca_topic_score_gemma":0.029190734,"teacher_disagreement_score":0.02826486,"about_ca_system_score_codex":0.0014254438,"about_ca_system_score_gemma":0.0028836122,"threshold_uncertainty_score":0.09455532},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44055405,0.0038721412,0.5269041,0.003790147,0.00016223983,0.00008469616,0.00079743465,0.00039562635,0.023439461],"genre_scores_gemma":[0.9625107,0.0014870389,0.031192042,0.00019782648,0.0004202061,0.00008019108,0.00034643506,0.00017540266,0.0035901144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730515,0.00085849635,0.00014069809,0.00059695914,0.00075614563,0.00034261003],"domain_scores_gemma":[0.963841,0.025910854,0.0040198816,0.002436172,0.0019730604,0.001819106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031155325,0.000989924,0.0013988034,0.003267398,0.0015444042,0.0034734162,0.0016715346,0.0017541326,0.004745932],"category_scores_gemma":[0.038971793,0.0008313496,0.0009100019,0.0020268124,0.005784512,0.007922598,0.0037178264,0.003730072,0.00088808377],"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.00009403853,0.000028451297,0.0031925219,0.00011991176,0.000024465158,0.0002856618,0.0010520549,0.038457364,0.0016207343,0.94122535,0.0019871169,0.01191228],"study_design_scores_gemma":[0.000012807384,0.00003277499,0.0009556418,0.000035906593,0.000013759948,0.00032208802,0.0002775876,0.11696997,0.00065947673,0.8774257,0.003258053,0.00003626833],"about_ca_topic_score_codex":0.0019238996,"about_ca_topic_score_gemma":0.000722408,"teacher_disagreement_score":0.004745932,"about_ca_system_score_codex":0.0019164135,"about_ca_system_score_gemma":0.0005112296,"threshold_uncertainty_score":0.01647669},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52664894,0.00095354463,0.43943238,0.00082582596,0.00013682865,0.000031775304,0.00011412429,0.00021954105,0.031637106],"genre_scores_gemma":[0.9698257,0.0003891311,0.025462488,0.000104622806,0.0001654662,0.00006824616,0.00007375447,0.00009179496,0.003818849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890137,0.0002418901,0.000049284132,0.00022426418,0.00042142812,0.00016179291],"domain_scores_gemma":[0.9951375,0.0022497152,0.0008193017,0.00046336322,0.0007536442,0.0005764884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015600667,0.0006377134,0.00049165415,0.0029781372,0.00094824034,0.0015953569,0.0012678964,0.00086069806,0.003421073],"category_scores_gemma":[0.008137926,0.00025158754,0.00042723236,0.00082882633,0.0035630388,0.0067783524,0.0030534137,0.0018713439,0.0003558221],"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.000013559792,0.000018443514,0.0005759181,0.000028849834,0.000006539227,0.00004418306,0.00015471752,0.0033997209,0.002350852,0.9884035,0.0001612771,0.0048424127],"study_design_scores_gemma":[0.00000389706,0.000061435996,0.0010857504,0.000026214066,0.0000074286354,0.00013431492,0.00012697764,0.056940645,0.0039389674,0.9359443,0.0017020988,0.000027913351],"about_ca_topic_score_codex":0.00029735288,"about_ca_topic_score_gemma":0.0003277986,"teacher_disagreement_score":0.003421073,"about_ca_system_score_codex":0.0009014811,"about_ca_system_score_gemma":0.00033859492,"threshold_uncertainty_score":0.011444628},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052609738,0.15365365,0.5565191,0.028176665,0.0028879591,0.00010973343,0.0006639633,0.00037612836,0.20500308],"genre_scores_gemma":[0.6643765,0.15196939,0.114333816,0.0061522257,0.012361888,0.00041906867,0.0019133418,0.00042276087,0.04805093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977482,0.00073501153,0.00016930136,0.00049185636,0.00064854923,0.00020707087],"domain_scores_gemma":[0.993614,0.004861651,0.00027364265,0.0005077001,0.0005501816,0.00019289684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002939489,0.0008060153,0.001202713,0.0029626554,0.0022008365,0.006053653,0.0012500385,0.0025776362,0.0091428915],"category_scores_gemma":[0.0088496255,0.0005530875,0.0012094693,0.0032764177,0.0059304056,0.013313706,0.0037754492,0.0041843974,0.0014056085],"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.0000050105145,0.000010083614,0.00020469898,0.00020767085,0.000009373907,0.000058426114,0.00018753519,0.00061315624,0.00009240718,0.9850026,0.0025594367,0.01104954],"study_design_scores_gemma":[0.0000025851357,0.000011100535,0.00014563178,0.00011095969,0.0000076310835,0.0002600469,0.00020533496,0.0019027861,0.00011317246,0.9666022,0.030626457,0.0000120446575],"about_ca_topic_score_codex":0.0007009292,"about_ca_topic_score_gemma":0.00058828486,"teacher_disagreement_score":0.0091428915,"about_ca_system_score_codex":0.0018129892,"about_ca_system_score_gemma":0.0012396721,"threshold_uncertainty_score":0.030586064},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87054867,0.0021059844,0.0819398,0.0013764492,0.00014634481,0.000050218365,0.00026461895,0.0004366009,0.043131247],"genre_scores_gemma":[0.97807765,0.0007207824,0.010912388,0.0001605993,0.00017994693,0.00007042383,0.00021985284,0.00020355647,0.009454896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986889,0.00040068687,0.00007361158,0.00024009903,0.0003802512,0.00021647513],"domain_scores_gemma":[0.99016845,0.0050260182,0.0014693423,0.00073011965,0.00097182073,0.0016342632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016846587,0.0007268854,0.0012712816,0.0060038376,0.0021816802,0.004344553,0.0020219504,0.0014250944,0.00538032],"category_scores_gemma":[0.019131515,0.0009342453,0.00084807875,0.0019072283,0.0043483814,0.0056905835,0.0059902733,0.002451079,0.00054424955],"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.000119024466,0.00005365784,0.0021694507,0.000093357994,0.000024633282,0.00033172974,0.00085100887,0.005329511,0.001622335,0.98360586,0.0009592205,0.0048401635],"study_design_scores_gemma":[0.000035363635,0.0000598226,0.0023026813,0.00007864838,0.000037134214,0.0006019172,0.00065099966,0.04859231,0.0012584797,0.943527,0.0028262148,0.000029426023],"about_ca_topic_score_codex":0.0017577325,"about_ca_topic_score_gemma":0.0018955113,"teacher_disagreement_score":0.0060038376,"about_ca_system_score_codex":0.0020348772,"about_ca_system_score_gemma":0.0005030394,"threshold_uncertainty_score":0.017998993},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36808276,0.0013142388,0.5752957,0.0009625746,0.00024117103,0.00012283592,0.001466735,0.0016826291,0.050831404],"genre_scores_gemma":[0.9093658,0.0006717883,0.06690836,0.00021659568,0.0001636198,0.00007901089,0.0011973539,0.00035638092,0.02104132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985789,0.00027716983,0.00016019361,0.00042915478,0.00032312475,0.00023150149],"domain_scores_gemma":[0.99589866,0.001272426,0.0006592303,0.00079831143,0.0006714476,0.00069986423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011263137,0.0005501859,0.0006652517,0.0032179216,0.0015347089,0.0053729094,0.00094479416,0.0008477313,0.007158456],"category_scores_gemma":[0.005423511,0.00059380353,0.0009956231,0.0023478465,0.002229986,0.0075932145,0.0026555664,0.0015651718,0.0015582986],"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.000056539375,0.000046816855,0.0014543907,0.000079360136,0.000023551369,0.00019503899,0.00053156726,0.0018806387,0.0014719747,0.9787893,0.0021418186,0.013329088],"study_design_scores_gemma":[0.000009355244,0.00004285572,0.0008996731,0.000044953118,0.00004494476,0.00050662673,0.00033538562,0.023772402,0.0018667866,0.9619119,0.010535654,0.000029367246],"about_ca_topic_score_codex":0.0020729878,"about_ca_topic_score_gemma":0.0019098351,"teacher_disagreement_score":0.007158456,"about_ca_system_score_codex":0.0015875379,"about_ca_system_score_gemma":0.00067547645,"threshold_uncertainty_score":0.023947418},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011902856,0.00009010626,0.9816538,0.0002115153,0.00008709186,0.00017355339,0.00075907074,0.0043845237,0.00073744147],"genre_scores_gemma":[0.15216957,0.000092603645,0.8430839,0.00009194278,0.00011111462,0.0006610562,0.002007949,0.00054928113,0.001232641],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99497235,0.00081773615,0.0005153478,0.0010553286,0.002394318,0.00024495658],"domain_scores_gemma":[0.9811818,0.008068382,0.0023447964,0.0023547057,0.0054312386,0.00061909494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051800543,0.0014697403,0.0014776622,0.011606472,0.0011082423,0.0038495006,0.0025942395,0.0017785152,0.0060637635],"category_scores_gemma":[0.024658483,0.00057501276,0.0019976108,0.005099569,0.0012267814,0.002817583,0.002164217,0.0024314448,0.002783395],"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.00045500422,0.00033521667,0.019476954,0.0005375534,0.0003512597,0.00030979008,0.0003759512,0.07997842,0.020377489,0.0187701,0.014889394,0.84414285],"study_design_scores_gemma":[0.000022372025,0.00008687359,0.002836376,0.00003631899,0.000036817826,0.00027893292,0.000087685556,0.96793604,0.0083545325,0.01448463,0.005791457,0.000048076046],"about_ca_topic_score_codex":0.0020094193,"about_ca_topic_score_gemma":0.002035095,"teacher_disagreement_score":0.011606472,"about_ca_system_score_codex":0.0017791376,"about_ca_system_score_gemma":0.0018138489,"threshold_uncertainty_score":0.02739513},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023679292,0.00023217099,0.972368,0.00039130313,0.00004606142,0.000037450027,0.00039854491,0.0011649467,0.001682186],"genre_scores_gemma":[0.6595457,0.0005976085,0.32754713,0.00036961853,0.00018141078,0.00026717634,0.0017535738,0.0012119915,0.008525759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986652,0.0006197521,0.000041090014,0.00031851575,0.0002709692,0.000084454565],"domain_scores_gemma":[0.99322575,0.003330635,0.00086056127,0.0016837558,0.0005748241,0.00032448897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024204624,0.0012149678,0.0009436053,0.002391838,0.00061580515,0.002609702,0.0018488888,0.0015939896,0.005923062],"category_scores_gemma":[0.018911446,0.0010313154,0.0010798378,0.0011901746,0.0021848008,0.0043339496,0.0044270726,0.0024722186,0.0017838216],"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.00031481535,0.00006844703,0.0058143144,0.00037707042,0.00019086196,0.00047015998,0.0011371826,0.26455054,0.0074718855,0.5688124,0.015229629,0.1355628],"study_design_scores_gemma":[0.000010793928,0.000030490606,0.00039400888,0.000027557424,0.0000103694065,0.00008145598,0.000071509065,0.80990696,0.0014959913,0.18524796,0.0026978941,0.000024945779],"about_ca_topic_score_codex":0.0015671125,"about_ca_topic_score_gemma":0.0014146004,"teacher_disagreement_score":0.005923062,"about_ca_system_score_codex":0.0009380445,"about_ca_system_score_gemma":0.0007344934,"threshold_uncertainty_score":0.01981461},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27303836,0.0012650429,0.71015465,0.00028867743,0.00026572304,0.00021273886,0.0016036388,0.0020034572,0.011167628],"genre_scores_gemma":[0.7398621,0.00072731066,0.25556573,0.000080181,0.000116151554,0.000087619796,0.0007554491,0.00011017384,0.0026952284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974126,0.000028435068,0.000010342899,0.00006387094,0.000111415204,0.000044636967],"domain_scores_gemma":[0.99919575,0.00023349136,0.00017306142,0.00010938073,0.00020216245,0.00008618583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026221108,0.00042961066,0.00034214454,0.0033401977,0.00038938515,0.00090798474,0.00054790056,0.00068337243,0.0026091225],"category_scores_gemma":[0.0028968167,0.00019095567,0.00021461971,0.0019591798,0.0007154295,0.001142676,0.0009166909,0.00052621495,0.0004926637],"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.00095614075,0.00010994769,0.014908054,0.00053747103,0.000060374336,0.0013881277,0.0011458932,0.053231016,0.1310882,0.07704665,0.004060793,0.7154673],"study_design_scores_gemma":[0.000018969893,0.000257876,0.01690239,0.00018256056,0.00003351556,0.0016837307,0.000875541,0.85332996,0.061174486,0.044367593,0.02107704,0.00009638283],"about_ca_topic_score_codex":0.0029290551,"about_ca_topic_score_gemma":0.0036248874,"teacher_disagreement_score":0.0033401977,"about_ca_system_score_codex":0.0007531199,"about_ca_system_score_gemma":0.000286917,"threshold_uncertainty_score":0.008728445},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9128103,0.00026652915,0.05481841,0.00034818274,0.0000472926,0.00005405849,0.00027394455,0.00017442541,0.031206781],"genre_scores_gemma":[0.98781735,0.00017675615,0.0061804643,0.000053696032,0.000032275388,0.00005429734,0.00037314583,0.000051772106,0.0052602026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988952,0.00014172864,0.00006710921,0.00028182182,0.00041865592,0.00019546637],"domain_scores_gemma":[0.9964952,0.0012673303,0.0004999916,0.00041703688,0.0005643139,0.0007562041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078507955,0.00043327056,0.0004247038,0.0043807435,0.0021462976,0.0027889328,0.0011325943,0.0009320004,0.008143409],"category_scores_gemma":[0.004176507,0.00071288715,0.00063837867,0.0014570742,0.0024390668,0.004810492,0.0025416878,0.0016355071,0.00048052784],"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.00010781795,0.00007030073,0.009244304,0.00006373422,0.0000365556,0.000841675,0.0017678003,0.0027418926,0.006770909,0.96497834,0.0014842758,0.011892356],"study_design_scores_gemma":[0.000049573307,0.00007774055,0.017072914,0.000048735397,0.00006854537,0.002630303,0.0016989192,0.03264786,0.01301141,0.91851395,0.014088922,0.00009109018],"about_ca_topic_score_codex":0.0014588728,"about_ca_topic_score_gemma":0.0011716383,"teacher_disagreement_score":0.008143409,"about_ca_system_score_codex":0.0014761342,"about_ca_system_score_gemma":0.00032373326,"threshold_uncertainty_score":0.027242362},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34792066,0.028255658,0.4834177,0.0042638397,0.0009979969,0.00015045515,0.000508917,0.0010757186,0.13340904],"genre_scores_gemma":[0.9362502,0.0048634307,0.051463548,0.00049539626,0.00062159245,0.00012950832,0.00018644716,0.00012592027,0.005863959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947137,0.00015071858,0.000026554111,0.00015596584,0.00015105186,0.000044303622],"domain_scores_gemma":[0.99878854,0.0006058919,0.00021540152,0.00019477285,0.000113012524,0.00008247398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006470806,0.00028674497,0.0005157666,0.0018555403,0.000675593,0.0018166025,0.00044390175,0.0009257063,0.0024743173],"category_scores_gemma":[0.0019696362,0.00022874297,0.00031218873,0.00090883597,0.003484431,0.002989699,0.0011304789,0.0009869199,0.00039848726],"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.000012812153,0.000009630771,0.00031547094,0.00013120032,0.0000070645056,0.000102278645,0.00013893787,0.0017667952,0.0033882556,0.98244375,0.00075096067,0.01093296],"study_design_scores_gemma":[0.0000052180644,0.000033447293,0.0010181648,0.000038133767,0.0000050219983,0.00021981666,0.00005965571,0.014055439,0.0021646053,0.9739667,0.008415492,0.00001826538],"about_ca_topic_score_codex":0.00019223886,"about_ca_topic_score_gemma":0.00015339204,"teacher_disagreement_score":0.0024743173,"about_ca_system_score_codex":0.00065039675,"about_ca_system_score_gemma":0.00028105752,"threshold_uncertainty_score":0.008277357},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01001669,0.0011349974,0.9793099,0.0009912897,0.00011794663,0.00005659686,0.0013832935,0.0016434703,0.005345776],"genre_scores_gemma":[0.49463898,0.0051305657,0.47029018,0.00095943914,0.0006017086,0.00051656476,0.010747775,0.0009654653,0.01614941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916553,0.00022533015,0.000044470322,0.00021590287,0.00027239893,0.000076371005],"domain_scores_gemma":[0.9984882,0.00053898996,0.00021329311,0.0004070551,0.00025660844,0.000095766576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011135578,0.0015001799,0.0006508937,0.0019396704,0.0006260134,0.0020158514,0.0015835282,0.0011474709,0.006686159],"category_scores_gemma":[0.0059178057,0.00063104223,0.00093655364,0.0021800315,0.0014022205,0.0042518727,0.0022838167,0.0032501316,0.002230961],"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.00012374127,0.00011650707,0.0026783417,0.00030770383,0.0001200946,0.00010677799,0.00016566402,0.24095748,0.0041733696,0.43998954,0.027318401,0.2839424],"study_design_scores_gemma":[0.000007196185,0.000026513497,0.00047526744,0.00004441518,0.000016501179,0.00005674128,0.000034627377,0.6015401,0.0020162829,0.38339216,0.012372733,0.000017438062],"about_ca_topic_score_codex":0.0035862853,"about_ca_topic_score_gemma":0.00665211,"teacher_disagreement_score":0.006686159,"about_ca_system_score_codex":0.0021003594,"about_ca_system_score_gemma":0.0009177611,"threshold_uncertainty_score":0.022367418},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95681995,0.00021446742,0.04195507,0.000056211637,0.000004748793,0.000015916123,0.0003541233,0.00013650437,0.00044307247],"genre_scores_gemma":[0.9951651,0.00006173883,0.004360455,0.0000032355433,0.000004161487,0.0000099262425,0.0002814335,0.0000064236956,0.000107460844],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99986553,0.000038110044,0.000009414151,0.000042488882,0.00002388669,0.00002061889],"domain_scores_gemma":[0.9995229,0.00019311944,0.00014056546,0.00005309407,0.000055679,0.00003464274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004885035,0.0002975074,0.00026234836,0.0020255696,0.00015933446,0.0005164482,0.00021808855,0.0002880594,0.00058696006],"category_scores_gemma":[0.0016170024,0.00009372203,0.0003274204,0.0010616103,0.00024413178,0.0007387699,0.00033995794,0.00020783355,0.0000914721],"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.0020792473,0.0003794581,0.41274655,0.00026563834,0.0006181589,0.0007852345,0.0004959814,0.17231497,0.073103815,0.0047402917,0.0013683453,0.3311023],"study_design_scores_gemma":[0.00001749569,0.00023970913,0.28435534,0.0000139557915,0.000109475994,0.0005463802,0.00018345655,0.69866276,0.009606053,0.005688761,0.0005416786,0.00003500755],"about_ca_topic_score_codex":0.0022410385,"about_ca_topic_score_gemma":0.002397139,"teacher_disagreement_score":0.0022410385,"about_ca_system_score_codex":0.0003751785,"about_ca_system_score_gemma":0.0001731803,"threshold_uncertainty_score":0.004455924},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8075751,0.00040001122,0.14023156,0.00064968184,0.000044027933,0.00005413907,0.00041370912,0.0008259006,0.049805902],"genre_scores_gemma":[0.9772348,0.00022097405,0.017767368,0.00012881278,0.000034490877,0.00005151138,0.00028313865,0.000052921056,0.0042259474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996257,0.00008645298,0.000018087168,0.000119646116,0.000090487265,0.000059631187],"domain_scores_gemma":[0.99849033,0.0007454936,0.00027401754,0.00019999714,0.0001244941,0.00016564905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003333274,0.00033399826,0.00033760458,0.0012778096,0.0011046891,0.0015214542,0.0005720581,0.00065701717,0.0041140066],"category_scores_gemma":[0.0023953584,0.00050807104,0.00048015875,0.0011445971,0.0014316094,0.002438125,0.0012212604,0.00077315315,0.00038337108],"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.00008565905,0.00004754504,0.0021822779,0.0001437062,0.000023620873,0.00048391943,0.00077642465,0.009801823,0.0074170916,0.960528,0.001999836,0.01651016],"study_design_scores_gemma":[0.000022321272,0.00002871506,0.001420382,0.000020589163,0.000026616319,0.0006877184,0.00027434682,0.02149569,0.002849555,0.9694672,0.0036852763,0.000021634725],"about_ca_topic_score_codex":0.0007498322,"about_ca_topic_score_gemma":0.0013102788,"teacher_disagreement_score":0.0041140066,"about_ca_system_score_codex":0.00042963482,"about_ca_system_score_gemma":0.00022470862,"threshold_uncertainty_score":0.0137627125},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50523466,0.0015483246,0.37527442,0.0018390694,0.00035693834,0.00015535954,0.00020937945,0.0003707206,0.11501116],"genre_scores_gemma":[0.9349053,0.00078227074,0.04057103,0.00028784364,0.00028992366,0.000120401906,0.00020420302,0.000117349075,0.02272176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994765,0.00009247507,0.000025137844,0.0001261962,0.00017406757,0.00010559735],"domain_scores_gemma":[0.99908125,0.00024181372,0.00014752342,0.0001384853,0.00019320888,0.00019772771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004703321,0.0005988208,0.00031922673,0.0027030676,0.0013367229,0.0022469843,0.0006077879,0.0005697303,0.0044744206],"category_scores_gemma":[0.0018326071,0.00019010094,0.00054776116,0.000750927,0.003397726,0.003721265,0.0023583914,0.0010481122,0.0005175967],"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.000004364854,0.000004980918,0.000283016,0.0000143859725,0.0000030196738,0.000052757267,0.00040150163,0.00062442187,0.001219541,0.9937452,0.0002751821,0.003371624],"study_design_scores_gemma":[0.0000058695946,0.000017214916,0.000298804,0.000015442658,0.000005717332,0.00013984414,0.0003974215,0.004288928,0.0016539296,0.97516143,0.018003779,0.0000116149395],"about_ca_topic_score_codex":0.0010305302,"about_ca_topic_score_gemma":0.00096527475,"teacher_disagreement_score":0.0044744206,"about_ca_system_score_codex":0.0014169377,"about_ca_system_score_gemma":0.00063180894,"threshold_uncertainty_score":0.014968455},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89165205,0.00017313911,0.0719682,0.00017081447,0.00005898857,0.000064322936,0.00023568285,0.0004531772,0.035223585],"genre_scores_gemma":[0.9878351,0.00010956099,0.008430099,0.000035234803,0.00003827296,0.000023192833,0.00018733928,0.00009219021,0.003249033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99981004,0.000017961007,0.0000037943487,0.000049665956,0.00005947968,0.0000590752],"domain_scores_gemma":[0.99982625,0.000025534653,0.000046221146,0.000028910006,0.000029414488,0.000043595268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025417822,0.000549053,0.00046013197,0.0025582816,0.0005313605,0.0019640399,0.00066733325,0.0004447391,0.0037230225],"category_scores_gemma":[0.000915527,0.00021480581,0.000439249,0.00089677604,0.0016065883,0.0019443459,0.0009057183,0.0009085239,0.0005595117],"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.00022076243,0.000096502205,0.0017928443,0.00006750214,0.000034696888,0.00065261615,0.0004886743,0.026671479,0.030888408,0.9075718,0.0013454857,0.030169317],"study_design_scores_gemma":[0.00007077762,0.00016013923,0.0028786599,0.00003149316,0.000041091826,0.00041338097,0.0003924371,0.22585888,0.021295078,0.7413246,0.0074464767,0.00008703015],"about_ca_topic_score_codex":0.002109507,"about_ca_topic_score_gemma":0.0016391338,"teacher_disagreement_score":0.0037230225,"about_ca_system_score_codex":0.0007890144,"about_ca_system_score_gemma":0.00038881725,"threshold_uncertainty_score":0.012454748},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9564302,0.00018149454,0.030079152,0.00034540985,0.00002278855,0.000025143974,0.00014106113,0.00012043719,0.012654361],"genre_scores_gemma":[0.9960223,0.0000632833,0.002797744,0.000021748163,0.000022588365,0.000018938339,0.000113487615,0.000020183186,0.0009197535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984774,0.00026598747,0.000089406516,0.0003929599,0.00039368405,0.0003806062],"domain_scores_gemma":[0.9874895,0.0060591805,0.0018534391,0.001613364,0.0008984837,0.0020859106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016646769,0.00047534204,0.0006320752,0.0037963106,0.001662735,0.00332729,0.0011395268,0.0010031807,0.0044374713],"category_scores_gemma":[0.008782973,0.00039738734,0.00062945107,0.0016684931,0.006115143,0.0053966017,0.0034186633,0.0017466597,0.00028475377],"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.0007130313,0.00018110157,0.03927438,0.00023587818,0.00010005691,0.00050502183,0.0018576368,0.023087826,0.029222148,0.88692033,0.001095465,0.016807064],"study_design_scores_gemma":[0.000117731324,0.00037041865,0.038147334,0.00009652467,0.0002518634,0.0011575617,0.0023878615,0.097404346,0.024816241,0.8274466,0.007553107,0.00025052956],"about_ca_topic_score_codex":0.0014964296,"about_ca_topic_score_gemma":0.002271843,"teacher_disagreement_score":0.0044374713,"about_ca_system_score_codex":0.0016074008,"about_ca_system_score_gemma":0.0005733228,"threshold_uncertainty_score":0.014844835},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22558482,0.00047224725,0.7571892,0.00056304806,0.000092405244,0.00010019509,0.00014993016,0.00047507053,0.015373011],"genre_scores_gemma":[0.74441606,0.00043620766,0.24287245,0.00018655043,0.000072875926,0.00013968785,0.00040981083,0.00024210171,0.0112242615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987664,0.00025861987,0.000082104256,0.00028576204,0.00047480004,0.00013219647],"domain_scores_gemma":[0.9986553,0.0005247746,0.00010225121,0.00042340904,0.00017546258,0.000118750766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010944987,0.0003972602,0.00066681317,0.0016926958,0.001350232,0.0028297123,0.0010818244,0.0007917058,0.00414919],"category_scores_gemma":[0.0044680326,0.00038226257,0.00088106876,0.0011459204,0.0019801182,0.0042046406,0.004245972,0.0015911479,0.00065213564],"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.000038961487,0.00004086721,0.0007001687,0.00006743424,0.000015257873,0.000083901024,0.00063210167,0.013665004,0.0042529795,0.9415649,0.00095432444,0.03798409],"study_design_scores_gemma":[0.000011252334,0.00004845011,0.00044024407,0.000018770754,0.000012485512,0.00014877146,0.000320338,0.057831015,0.0055590034,0.9245955,0.010993578,0.000020562666],"about_ca_topic_score_codex":0.0015254696,"about_ca_topic_score_gemma":0.0010990016,"teacher_disagreement_score":0.00414919,"about_ca_system_score_codex":0.0013784992,"about_ca_system_score_gemma":0.00046520153,"threshold_uncertainty_score":0.013880432},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63414127,0.0020433143,0.28058022,0.015323691,0.00044575764,0.00005572906,0.00059185986,0.00050774874,0.06631036],"genre_scores_gemma":[0.9916751,0.00019428517,0.007084228,0.00009967798,0.00009098437,0.0000118978,0.000053877055,0.000034714187,0.000755236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9994993,0.00015485166,0.000024694644,0.00013598205,0.00012063322,0.00006464277],"domain_scores_gemma":[0.99726653,0.0011414458,0.00032751035,0.0008330299,0.00020020708,0.00023126979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085456745,0.00029154567,0.0004357323,0.0010053469,0.0006107684,0.0026250766,0.00068620936,0.0012614423,0.0048192316],"category_scores_gemma":[0.006604234,0.00026171055,0.00033357885,0.0006190762,0.00475801,0.0056695184,0.0019844237,0.001656089,0.00021409935],"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.00025403837,0.00003548842,0.0039648195,0.0001231499,0.000053098982,0.0013465236,0.0011318026,0.0037301148,0.014249733,0.9446034,0.0014552339,0.029052692],"study_design_scores_gemma":[0.000018788127,0.00006698861,0.008697191,0.000023739321,0.000020681175,0.0013067778,0.00046564543,0.01971219,0.002120232,0.96499866,0.0025453158,0.00002381247],"about_ca_topic_score_codex":0.00097118603,"about_ca_topic_score_gemma":0.00060648774,"teacher_disagreement_score":0.0048192316,"about_ca_system_score_codex":0.00047281405,"about_ca_system_score_gemma":0.0003850521,"threshold_uncertainty_score":0.016121984},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022981701,0.0004255785,0.9724582,0.0005058526,0.000112745365,0.000039895363,0.00017834664,0.00030876134,0.0029889753],"genre_scores_gemma":[0.55762106,0.0014743337,0.41811278,0.00053614145,0.0003799192,0.00021192525,0.0020604841,0.00046641502,0.019136908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986584,0.000524114,0.00009245261,0.00030739224,0.00032052046,0.000097102915],"domain_scores_gemma":[0.9967145,0.001307583,0.00025993495,0.00073871395,0.0007130152,0.00026629536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002465092,0.0006777537,0.0010871704,0.0014644655,0.00086684455,0.002309416,0.002254495,0.001298687,0.0051316833],"category_scores_gemma":[0.011084834,0.00045353643,0.0009056708,0.001546281,0.0018179881,0.0045080977,0.0038825895,0.002803688,0.0016082712],"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.00020595378,0.00011354211,0.0015879953,0.00017854304,0.000073801646,0.000057545498,0.00023883337,0.11314796,0.002430392,0.6428525,0.007152941,0.23195998],"study_design_scores_gemma":[0.000015721256,0.00007070893,0.0002594662,0.000019813633,0.000010089671,0.000036619065,0.000060018017,0.61194426,0.00077628694,0.38284996,0.003933269,0.000023721213],"about_ca_topic_score_codex":0.0036847165,"about_ca_topic_score_gemma":0.0031238354,"teacher_disagreement_score":0.0051316833,"about_ca_system_score_codex":0.0016078653,"about_ca_system_score_gemma":0.001540823,"threshold_uncertainty_score":0.01716721},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16091439,0.00064508885,0.82565874,0.0014320714,0.00015496905,0.0000968521,0.00029711254,0.00037358957,0.01042713],"genre_scores_gemma":[0.95113784,0.0008454952,0.038378656,0.00035734105,0.000380458,0.00017418184,0.00043226584,0.0002576638,0.0080361655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998064,0.0009390918,0.000075072436,0.0003077016,0.00038433768,0.00022985884],"domain_scores_gemma":[0.9813114,0.011688575,0.0018823987,0.0014518788,0.00209859,0.0015671956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038417059,0.0009182727,0.0011134057,0.003192794,0.0011414086,0.0022986105,0.002221384,0.0016586604,0.0076949117],"category_scores_gemma":[0.026081331,0.0007297418,0.0011004306,0.0010615628,0.0036916342,0.004763539,0.002855642,0.0022136823,0.00081953726],"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.0000403138,0.000050590832,0.00061337923,0.00004684061,0.00002495661,0.00006464578,0.00011563196,0.03513284,0.0008495854,0.9583467,0.0007598332,0.0039546974],"study_design_scores_gemma":[0.000010717764,0.000018319983,0.0003694079,0.000023909377,0.000009816337,0.000049141687,0.000058334328,0.4606852,0.00031765123,0.53783387,0.0006034978,0.000020121064],"about_ca_topic_score_codex":0.0017128844,"about_ca_topic_score_gemma":0.0012685203,"teacher_disagreement_score":0.0076949117,"about_ca_system_score_codex":0.0018644717,"about_ca_system_score_gemma":0.0011982505,"threshold_uncertainty_score":0.025741994},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5055053,0.0004917519,0.48320532,0.0006213189,0.000036718287,0.00016442787,0.0006300844,0.0010254796,0.0083195465],"genre_scores_gemma":[0.6918324,0.00037384694,0.29954585,0.000092882925,0.000043454544,0.00022239656,0.0020191094,0.00028919417,0.005580832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995989,0.00007782908,0.000017075467,0.000111498084,0.00010972666,0.000084985135],"domain_scores_gemma":[0.99873513,0.00064157794,0.00014619746,0.00017946429,0.0001582728,0.00013936404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037200857,0.00061971194,0.0008053485,0.0012584949,0.000690473,0.0012436191,0.0016495389,0.000994314,0.00398461],"category_scores_gemma":[0.0031263283,0.0004948272,0.0005652854,0.0012022377,0.0008831624,0.00285136,0.0016139445,0.0011422884,0.0007371162],"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.00046573722,0.00028902086,0.004213291,0.00043657454,0.00007385757,0.00027770063,0.000885281,0.3693293,0.02647547,0.32952258,0.0073987534,0.2606325],"study_design_scores_gemma":[0.00005546597,0.00007393822,0.00056797906,0.000030429239,0.000013486022,0.000083039,0.00020573821,0.6315353,0.006915691,0.35744682,0.003048824,0.000023218992],"about_ca_topic_score_codex":0.002231923,"about_ca_topic_score_gemma":0.0024930146,"teacher_disagreement_score":0.00398461,"about_ca_system_score_codex":0.0009874259,"about_ca_system_score_gemma":0.0007644155,"threshold_uncertainty_score":0.013329804},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45970377,0.0020216673,0.38756198,0.007029111,0.00079855236,0.00024939963,0.0010971806,0.0035688481,0.1379695],"genre_scores_gemma":[0.95881534,0.0009831933,0.014215761,0.0006383764,0.00048780354,0.00028402384,0.0006568898,0.0008320255,0.023086581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982615,0.0003276099,0.00009249778,0.00039961212,0.00050481583,0.00041402478],"domain_scores_gemma":[0.9900699,0.004608586,0.0010560894,0.00072832126,0.0009824039,0.0025545927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029454597,0.000946585,0.0015140863,0.006826787,0.0018985838,0.0060292454,0.0026719486,0.0020364358,0.023095207],"category_scores_gemma":[0.018736333,0.0005462416,0.0013798132,0.0015062317,0.0055134743,0.008734466,0.004070178,0.0027072784,0.0030650701],"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.00009915977,0.000024801056,0.0010047196,0.00017389428,0.000019277892,0.00011419044,0.0002568756,0.0031059666,0.0012042812,0.98028755,0.0042452677,0.009463954],"study_design_scores_gemma":[0.00003780572,0.000056356585,0.0023824156,0.0001270736,0.00003118254,0.0003523802,0.00019560888,0.060427487,0.003075538,0.9292713,0.0039590616,0.0000837524],"about_ca_topic_score_codex":0.002969502,"about_ca_topic_score_gemma":0.0013397927,"teacher_disagreement_score":0.023095207,"about_ca_system_score_codex":0.0045927037,"about_ca_system_score_gemma":0.0013470356,"threshold_uncertainty_score":0.07726121},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02651263,0.0042283353,0.95068544,0.0053211157,0.00015051762,0.00007835135,0.00024655444,0.0004103423,0.012366692],"genre_scores_gemma":[0.7234767,0.0033712105,0.26372772,0.0014878274,0.0011194365,0.0005218307,0.00049913407,0.0005693287,0.005226836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97871053,0.006004469,0.0014281843,0.0043978714,0.008043058,0.001415934],"domain_scores_gemma":[0.86166257,0.09741894,0.010449648,0.021652384,0.006627856,0.002188578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018939236,0.0024547204,0.0030540046,0.0039709797,0.002107368,0.0076304697,0.003561981,0.004299086,0.0040284083],"category_scores_gemma":[0.12640841,0.0017128893,0.002463178,0.0035667892,0.014488872,0.025836691,0.013293944,0.009580063,0.00066021306],"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.000107274915,0.000058336926,0.0012303798,0.00029354513,0.00009104824,0.00016417373,0.0004381769,0.05696853,0.0015148262,0.90028375,0.0019340584,0.03691583],"study_design_scores_gemma":[0.000020414625,0.00014111935,0.000982905,0.000120547025,0.000045552388,0.00028504882,0.00009046672,0.15135783,0.0032189484,0.840311,0.0033403365,0.000085772495],"about_ca_topic_score_codex":0.0011945833,"about_ca_topic_score_gemma":0.00056881655,"teacher_disagreement_score":0.018939236,"about_ca_system_score_codex":0.005162223,"about_ca_system_score_gemma":0.0015104797,"threshold_uncertainty_score":0.10016149},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40184548,0.00029271905,0.5909354,0.00013761623,0.000026805994,0.00004676609,0.0003332427,0.00062969775,0.0057522403],"genre_scores_gemma":[0.9209528,0.000108152926,0.07615606,0.000031444295,0.000026612825,0.00005589382,0.0003526425,0.00014103299,0.0021754005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945897,0.00009861769,0.000036086734,0.00014271274,0.00017631697,0.00008723522],"domain_scores_gemma":[0.99859077,0.0005876166,0.00020554569,0.00030837968,0.00017509288,0.00013253382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007769957,0.00044212176,0.00066776265,0.001592995,0.0004273822,0.0015587586,0.0009310113,0.0006383647,0.004309189],"category_scores_gemma":[0.0050405716,0.00025552238,0.00033253865,0.0010726466,0.00094944553,0.0050472314,0.0022279953,0.00086224044,0.00069690845],"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.00030437871,0.00010974529,0.0054853577,0.00030185786,0.00005727013,0.0002930522,0.00040555277,0.11539662,0.01675232,0.7470638,0.0024839223,0.11134612],"study_design_scores_gemma":[0.000024287425,0.00009769535,0.0015319275,0.000020916194,0.000011701075,0.00016317185,0.00010422751,0.47612014,0.006809817,0.5122952,0.0027862207,0.000034637447],"about_ca_topic_score_codex":0.00040959168,"about_ca_topic_score_gemma":0.00052867434,"teacher_disagreement_score":0.004309189,"about_ca_system_score_codex":0.00086366467,"about_ca_system_score_gemma":0.00044524198,"threshold_uncertainty_score":0.014415622},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1942846,0.0003549282,0.7986446,0.00053154863,0.000065372835,0.000058125064,0.00028972482,0.00084769906,0.004923359],"genre_scores_gemma":[0.7362458,0.0002121147,0.2586857,0.00018838848,0.00008506921,0.000093866176,0.0007908211,0.00037299856,0.003325283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925286,0.00012706792,0.000038914182,0.00020684351,0.000267882,0.00010638876],"domain_scores_gemma":[0.99761534,0.001209559,0.00023804075,0.00044688565,0.0002777315,0.00021247249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001132801,0.0005952612,0.00092772476,0.0012790541,0.0006632159,0.002042616,0.0011383579,0.0008569525,0.0031296231],"category_scores_gemma":[0.007585435,0.00038571577,0.000793382,0.0011543564,0.0017586456,0.00529168,0.0023335668,0.0014555341,0.00039063662],"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.00022534795,0.00010279536,0.005072513,0.0002241932,0.000054209653,0.00021229038,0.00048234776,0.3230723,0.007862638,0.5672138,0.0038003176,0.09167722],"study_design_scores_gemma":[0.000009563614,0.000034616067,0.00047043356,0.0000123341715,0.000007403959,0.000063690975,0.00010688929,0.7060736,0.0024259926,0.289065,0.0017145122,0.000016048178],"about_ca_topic_score_codex":0.0028861128,"about_ca_topic_score_gemma":0.0034583483,"teacher_disagreement_score":0.0031296231,"about_ca_system_score_codex":0.0012727876,"about_ca_system_score_gemma":0.00058276864,"threshold_uncertainty_score":0.010469675},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.809317,0.00031644633,0.16565,0.0002696398,0.000023747963,0.000038109003,0.00028060656,0.00019789,0.023906581],"genre_scores_gemma":[0.97986275,0.0001817884,0.016716689,0.00004165357,0.000028166642,0.000030860923,0.00047444715,0.00006475001,0.0025989665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999005,0.00015469201,0.0000877706,0.00027347435,0.0003242083,0.000154883],"domain_scores_gemma":[0.99470514,0.0025946982,0.0008304261,0.0008737386,0.0003784293,0.0006176325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076003873,0.0004364923,0.00048093428,0.0015716763,0.0013302382,0.0023122896,0.0006335256,0.00041765723,0.004518784],"category_scores_gemma":[0.005116879,0.00047914172,0.0005305242,0.0014251351,0.0037603693,0.004761762,0.002137841,0.0014515718,0.00035581374],"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.000262209,0.00007361323,0.01045345,0.000079541154,0.00003411945,0.0014155505,0.0016372503,0.006997523,0.012864985,0.93925697,0.0010163625,0.02590851],"study_design_scores_gemma":[0.000016399272,0.00006443805,0.0045771664,0.000030469631,0.000038063758,0.0016948297,0.0006857511,0.026603572,0.016405623,0.9425492,0.0072877384,0.000046808374],"about_ca_topic_score_codex":0.0011461556,"about_ca_topic_score_gemma":0.001248786,"teacher_disagreement_score":0.004518784,"about_ca_system_score_codex":0.00060336426,"about_ca_system_score_gemma":0.0003854888,"threshold_uncertainty_score":0.015116811},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6774396,0.0014865542,0.21240893,0.0013504942,0.00016887706,0.0000896641,0.0005642441,0.00026895074,0.10622278],"genre_scores_gemma":[0.9836256,0.0004684655,0.008244742,0.00007466268,0.000090804926,0.000032325042,0.00009920305,0.000056790137,0.0073074326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996557,0.00008647618,0.00002095432,0.00008155808,0.000100656915,0.00005460969],"domain_scores_gemma":[0.99863297,0.00053256424,0.0002641264,0.00015976593,0.00021512165,0.00019545252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076175947,0.00031535243,0.00056479446,0.002721996,0.0011395551,0.003199533,0.00071316265,0.0006726246,0.005077257],"category_scores_gemma":[0.0038285227,0.00024500434,0.00031246117,0.0011999193,0.0029931334,0.0049584745,0.0013281767,0.0011123848,0.00041247968],"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.000018404135,0.00000484873,0.0002697742,0.000010384394,0.0000037462155,0.000019956402,0.00009355809,0.0021714915,0.00038466827,0.9943094,0.00029935103,0.0024144035],"study_design_scores_gemma":[0.0000047954545,0.0000059961185,0.00025774873,0.0000087324925,0.0000033272274,0.000033627595,0.000061064486,0.011935799,0.00022696667,0.98616415,0.0012899574,0.000007928021],"about_ca_topic_score_codex":0.0016332445,"about_ca_topic_score_gemma":0.0009912051,"teacher_disagreement_score":0.005077257,"about_ca_system_score_codex":0.0016509986,"about_ca_system_score_gemma":0.00074046577,"threshold_uncertainty_score":0.016985059},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79028374,0.0013720425,0.16633408,0.0026266864,0.00013256726,0.000040130373,0.00030565233,0.0003207233,0.038584355],"genre_scores_gemma":[0.99075246,0.00029749097,0.0058533656,0.00009256852,0.00010373295,0.00002643353,0.00007312222,0.000076656564,0.0027242557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993155,0.00021911436,0.000019429559,0.00017743897,0.00016148793,0.00010704925],"domain_scores_gemma":[0.98493737,0.011355341,0.0014769966,0.00086075003,0.0006767596,0.0006928445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015821974,0.00043251395,0.0006437786,0.0023838696,0.00077878253,0.0019051324,0.0009842161,0.0007242626,0.0077588027],"category_scores_gemma":[0.017785937,0.0003412666,0.00033172267,0.0009540375,0.004282523,0.0049364013,0.001616158,0.0018273479,0.0005721884],"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.00019456033,0.000031792886,0.0019149744,0.00011553104,0.00001644512,0.00013948814,0.00027708273,0.016381374,0.0072569405,0.9639293,0.0014771685,0.008265369],"study_design_scores_gemma":[0.000029094303,0.000047107493,0.0014243572,0.00003859592,0.0000115079465,0.00021852653,0.000146549,0.04983461,0.0020512121,0.9445364,0.0016316224,0.000030480653],"about_ca_topic_score_codex":0.00043290047,"about_ca_topic_score_gemma":0.00035904007,"teacher_disagreement_score":0.0077588027,"about_ca_system_score_codex":0.0011253688,"about_ca_system_score_gemma":0.00035695327,"threshold_uncertainty_score":0.025955737},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86091363,0.00058838225,0.11342621,0.0025127928,0.00007208811,0.000043700595,0.00025198393,0.00016573,0.022025518],"genre_scores_gemma":[0.99174666,0.00026864812,0.003992441,0.00016930906,0.000116943134,0.000027895623,0.00012834997,0.000050109556,0.003499661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995509,0.00015222051,0.000014911473,0.00009060345,0.00010061248,0.00009080136],"domain_scores_gemma":[0.9910262,0.0050268304,0.0013202231,0.00044782544,0.0007307308,0.0014482192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012395013,0.0003981087,0.0007735814,0.004323251,0.0013024098,0.0029799913,0.0011589548,0.0015166686,0.0050819316],"category_scores_gemma":[0.009726088,0.00050933537,0.0005377603,0.0011359948,0.003069786,0.0053576673,0.0017958131,0.0015671954,0.0003560226],"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.000023561111,0.000024263047,0.001144391,0.000027721744,0.000005503081,0.00006562334,0.00030359183,0.003967764,0.0006824936,0.99086994,0.0004821054,0.0024029696],"study_design_scores_gemma":[0.000008096573,0.000013286275,0.00097644265,0.000018516314,0.0000065426807,0.0000820786,0.00011712496,0.04714505,0.00028639176,0.9508256,0.00050916563,0.0000117308],"about_ca_topic_score_codex":0.0012200803,"about_ca_topic_score_gemma":0.0011363616,"teacher_disagreement_score":0.0050819316,"about_ca_system_score_codex":0.0013262471,"about_ca_system_score_gemma":0.00064125133,"threshold_uncertainty_score":0.017000735},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11288757,0.0008052016,0.77732086,0.0010401905,0.0004423036,0.00017748188,0.0009487449,0.0049708756,0.10140678],"genre_scores_gemma":[0.66951394,0.0007701865,0.2826716,0.0005181386,0.00031854372,0.00021167287,0.0024916995,0.0020406998,0.041463546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999385,0.00008246014,0.000034983714,0.00018316193,0.00017832806,0.00013602733],"domain_scores_gemma":[0.9985567,0.00059383,0.0000651651,0.00040798858,0.00024998683,0.00012644648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005801655,0.0006857707,0.001081619,0.0021717264,0.0019087183,0.0040423586,0.0016800442,0.00092865154,0.025144186],"category_scores_gemma":[0.0030595877,0.00047843956,0.0008148999,0.0030836484,0.0016180127,0.0093429815,0.004270091,0.0017684991,0.0043672724],"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.00013303067,0.000045653254,0.00063895044,0.00011799448,0.000012626761,0.00005926559,0.00040695892,0.002969748,0.002174863,0.884082,0.010731043,0.09862786],"study_design_scores_gemma":[0.000015839694,0.000018895109,0.00014145488,0.00003510686,0.000018226301,0.00005899619,0.0001767333,0.012838587,0.0021570446,0.9646286,0.019897783,0.000012713019],"about_ca_topic_score_codex":0.0018399425,"about_ca_topic_score_gemma":0.0020516044,"teacher_disagreement_score":0.025144186,"about_ca_system_score_codex":0.0012753506,"about_ca_system_score_gemma":0.00068459794,"threshold_uncertainty_score":0.084115684},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9371591,0.00049136835,0.052959055,0.0005764566,0.000021598462,0.000026192727,0.0014121835,0.00018084825,0.0071731918],"genre_scores_gemma":[0.98448426,0.00029848955,0.012895475,0.0000404132,0.00002138157,0.000029249706,0.0013881669,0.000035352405,0.00080735236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991806,0.0002378889,0.000052083768,0.00015816862,0.00027429668,0.00009691762],"domain_scores_gemma":[0.99667346,0.0013385937,0.00077167625,0.0003328879,0.00044453444,0.00043891364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080883864,0.00028400467,0.00042915816,0.005150917,0.0007196684,0.0028923207,0.0005868082,0.00054216996,0.0034113682],"category_scores_gemma":[0.005326657,0.0002404305,0.00040143894,0.0022357586,0.00186947,0.0023674278,0.0020702307,0.00077162334,0.00035941834],"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.0005588849,0.000089767884,0.058847636,0.00044618227,0.00014634672,0.0012489378,0.0018008295,0.06297076,0.029607065,0.78590655,0.0029607713,0.05541631],"study_design_scores_gemma":[0.000034772158,0.00019355789,0.03177109,0.00009481096,0.000067572284,0.002082617,0.0014920665,0.13905326,0.009412361,0.8019024,0.013822549,0.000072982286],"about_ca_topic_score_codex":0.000698655,"about_ca_topic_score_gemma":0.0004217039,"teacher_disagreement_score":0.005150917,"about_ca_system_score_codex":0.00074975396,"about_ca_system_score_gemma":0.00035991397,"threshold_uncertainty_score":0.011412203},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014576572,0.2414457,0.3868022,0.010692765,0.008098513,0.00009936207,0.00087182707,0.0013158215,0.34921622],"genre_scores_gemma":[0.038046718,0.19968335,0.17829311,0.0027817367,0.016337147,0.000395838,0.0013490224,0.0015174253,0.56159556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992193,0.00013410182,0.000043636002,0.00011661706,0.00046386602,0.00002250357],"domain_scores_gemma":[0.9983571,0.001068928,0.0000702176,0.00016710309,0.00027916106,0.000057460864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010040245,0.0015994263,0.0014189421,0.0031787993,0.0009912876,0.004026563,0.0014395617,0.0012444343,0.02658763],"category_scores_gemma":[0.003166876,0.00082969357,0.00056573463,0.006301333,0.0029836686,0.006420056,0.0013851534,0.0037840554,0.0124499],"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.000009580746,0.000022612761,0.00007301229,0.00044264074,0.000017689712,0.00003041835,0.00013194104,0.0011607578,0.00035537616,0.7069769,0.1493028,0.14147633],"study_design_scores_gemma":[0.000005253637,0.000011910168,0.00022779978,0.00014673395,0.000010514716,0.00020225256,0.000039210427,0.0032188105,0.00019431007,0.5329924,0.4629358,0.000014932045],"about_ca_topic_score_codex":0.0012165074,"about_ca_topic_score_gemma":0.0019135852,"teacher_disagreement_score":0.02658763,"about_ca_system_score_codex":0.0013906632,"about_ca_system_score_gemma":0.0014465986,"threshold_uncertainty_score":0.088944495},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.938561,0.0007053123,0.052635834,0.00026292732,0.000028099874,0.00008552477,0.0055363346,0.0006437345,0.0015412152],"genre_scores_gemma":[0.9793745,0.00033340082,0.014534615,0.00002693539,0.000017900775,0.000055890465,0.0054386524,0.000052951316,0.00016517007],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99949336,0.00012080047,0.00006677506,0.00014880889,0.00010423259,0.00006605528],"domain_scores_gemma":[0.9956256,0.0018480391,0.0010947427,0.0007142037,0.0004946897,0.0002226613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016324198,0.0005715112,0.0004394293,0.005975182,0.0003415595,0.001409053,0.00038474333,0.0006100048,0.00080659456],"category_scores_gemma":[0.010166188,0.00019843246,0.0007399942,0.002923511,0.000636631,0.0014537845,0.00077173585,0.00063897244,0.00041939213],"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.0008867025,0.0001845618,0.794773,0.00056346256,0.000724031,0.0005830233,0.001100048,0.05185901,0.030492688,0.004313778,0.0037766816,0.11074299],"study_design_scores_gemma":[0.000039512262,0.0002705323,0.7312957,0.00013320099,0.00027450093,0.0021085148,0.00092410966,0.22436363,0.01041215,0.026439684,0.0035957424,0.00014274089],"about_ca_topic_score_codex":0.002340699,"about_ca_topic_score_gemma":0.0051830383,"teacher_disagreement_score":0.005975182,"about_ca_system_score_codex":0.00049877685,"about_ca_system_score_gemma":0.0005017216,"threshold_uncertainty_score":0.008633196},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7985308,0.0008922771,0.17886141,0.0033201254,0.00017089033,0.00003714688,0.00023296806,0.00022614001,0.017728217],"genre_scores_gemma":[0.98918366,0.00023408246,0.008019637,0.00013322386,0.00012518099,0.000015953456,0.00009046905,0.00003088181,0.0021668575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991986,0.00029516045,0.000055056924,0.000135774,0.00019648692,0.000118835655],"domain_scores_gemma":[0.99681693,0.0015645165,0.00049106235,0.0004689527,0.00033486105,0.0003237905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018061841,0.0003855742,0.00042901517,0.002226232,0.001199248,0.0033263098,0.000593161,0.00093352277,0.003951434],"category_scores_gemma":[0.00919517,0.0003034822,0.00048252995,0.001487436,0.0044801403,0.005556379,0.0015966721,0.0015382092,0.00022294268],"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.000028111035,0.000011823416,0.0005378846,0.000009730204,0.0000031247655,0.000036691858,0.00015727778,0.00053420436,0.00035452732,0.9951917,0.00021290971,0.0029220262],"study_design_scores_gemma":[0.000005916808,0.0000057015836,0.00011369191,0.000004399255,0.0000028105976,0.000031779447,0.000059913713,0.0047474047,0.00020320417,0.9945263,0.00029512792,0.00000371553],"about_ca_topic_score_codex":0.000846531,"about_ca_topic_score_gemma":0.0007445879,"teacher_disagreement_score":0.003951434,"about_ca_system_score_codex":0.0010458685,"about_ca_system_score_gemma":0.00078138575,"threshold_uncertainty_score":0.01321888},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8989496,0.00012431735,0.080220394,0.00031665523,0.000049789694,0.0000615857,0.00061486615,0.000572006,0.019090666],"genre_scores_gemma":[0.9923419,0.000024651164,0.0064042937,0.000031112962,0.000025132187,0.00002147506,0.00026023376,0.0000396312,0.0008516514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970592,0.0004273394,0.00019883992,0.00093704474,0.00093705015,0.00044044046],"domain_scores_gemma":[0.9913583,0.0031407902,0.001305202,0.0017652226,0.0017171624,0.0007134504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010539953,0.0004911895,0.0006782322,0.003281626,0.0014241217,0.0027160612,0.0011160759,0.0009395423,0.00796355],"category_scores_gemma":[0.010777621,0.0003927089,0.00060165615,0.0016055531,0.002793764,0.005341341,0.0027580985,0.0015095824,0.0006272096],"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.0008045327,0.00015695678,0.08779651,0.0002806719,0.00012675377,0.0014677776,0.0019232122,0.010129004,0.0445041,0.77727276,0.0029747565,0.07256297],"study_design_scores_gemma":[0.000056757548,0.0003309005,0.023203194,0.000095753756,0.0000988162,0.0027857032,0.0018417466,0.051153336,0.069468364,0.8352143,0.015637113,0.00011395204],"about_ca_topic_score_codex":0.0009943135,"about_ca_topic_score_gemma":0.00066988944,"teacher_disagreement_score":0.00796355,"about_ca_system_score_codex":0.00078148785,"about_ca_system_score_gemma":0.00045488554,"threshold_uncertainty_score":0.026640713},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67692703,0.001544969,0.1458934,0.0015620972,0.00067798677,0.00011504486,0.00061517657,0.00079225533,0.17187195],"genre_scores_gemma":[0.9370399,0.0010380537,0.01663863,0.00021874871,0.0006806611,0.00008239637,0.00059998024,0.00020506138,0.043496575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966884,0.00004625585,0.000019317664,0.00007507636,0.00012629176,0.00006426939],"domain_scores_gemma":[0.9991467,0.00038738933,0.000121517,0.00011804707,0.00009220031,0.00013422617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029480614,0.0005241518,0.00056138594,0.0033949967,0.0012359434,0.003796879,0.0005843215,0.000740118,0.007612156],"category_scores_gemma":[0.00129757,0.0004180231,0.00039776292,0.0018102635,0.0025198273,0.0032939592,0.0015262165,0.0015553841,0.0011421976],"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.000030335777,0.000021432208,0.00057693856,0.000029129014,0.000004181926,0.000034117453,0.00035988732,0.0006884614,0.0021856725,0.97662306,0.0025146706,0.016932193],"study_design_scores_gemma":[0.00001222124,0.000031113617,0.00073856086,0.000019780244,0.000008046868,0.00010207145,0.00024822517,0.0061136284,0.0015510938,0.98126537,0.009897775,0.000012028394],"about_ca_topic_score_codex":0.00045625892,"about_ca_topic_score_gemma":0.00052756467,"teacher_disagreement_score":0.007612156,"about_ca_system_score_codex":0.0008190083,"about_ca_system_score_gemma":0.00022620759,"threshold_uncertainty_score":0.02546525},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05220672,0.0011198987,0.9415087,0.0015038843,0.00008753189,0.000022571909,0.00006483012,0.00015741009,0.0033284395],"genre_scores_gemma":[0.9161248,0.0009762551,0.07909088,0.00025998597,0.00024768742,0.00007684891,0.00010650253,0.00008009823,0.0030368855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977138,0.0010960295,0.000120223114,0.00035770683,0.0005658009,0.00014637955],"domain_scores_gemma":[0.98256576,0.013844443,0.00094772404,0.001259196,0.0010602472,0.0003226634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003908969,0.00085214386,0.0013615984,0.0013633585,0.0010906351,0.0019905732,0.0014764168,0.0017752993,0.001376682],"category_scores_gemma":[0.03164338,0.0007564274,0.00084938854,0.0012770169,0.0028915093,0.0052526067,0.0035015214,0.0026531694,0.00018857131],"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.000120270735,0.000042442927,0.0012328003,0.00013506164,0.00010572516,0.00009626064,0.00023698686,0.6375123,0.0011051683,0.28183168,0.0011950637,0.07638619],"study_design_scores_gemma":[0.000005782371,0.000020458723,0.00014960836,0.000013479758,0.000013332438,0.00001641456,0.000019422094,0.6431356,0.00030709678,0.35587183,0.0004379905,0.000009078694],"about_ca_topic_score_codex":0.0036144862,"about_ca_topic_score_gemma":0.0029682668,"teacher_disagreement_score":0.003908969,"about_ca_system_score_codex":0.0014178272,"about_ca_system_score_gemma":0.0009935886,"threshold_uncertainty_score":0.020672798},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051964237,0.00041982287,0.99230087,0.000075151926,0.000057152723,0.000037138947,0.0004356623,0.0010719387,0.00040583452],"genre_scores_gemma":[0.12121461,0.00046950625,0.8712096,0.00012310864,0.00013254442,0.0003028605,0.0042281346,0.00026726568,0.0020524233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997143,0.00063700415,0.0001683994,0.00069536373,0.0011648984,0.00019127884],"domain_scores_gemma":[0.99538726,0.0016115378,0.000290071,0.0015256708,0.0010363297,0.00014904786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019528498,0.0010965274,0.0025777281,0.0018596576,0.0008463467,0.0018688135,0.0036616342,0.0018923872,0.0036457288],"category_scores_gemma":[0.01562459,0.0009112939,0.0013671786,0.0026298212,0.0008230445,0.0032787542,0.0031738728,0.001990041,0.0034957693],"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.0005465184,0.00020294191,0.004168186,0.00060508354,0.0003431548,0.00026964856,0.00025554,0.39154798,0.01072699,0.036304127,0.018499766,0.53653014],"study_design_scores_gemma":[0.000024603914,0.000033356944,0.0006364815,0.000017364026,0.000014569192,0.00015194816,0.00003668644,0.9740751,0.0026848621,0.018457193,0.0038389252,0.000028853798],"about_ca_topic_score_codex":0.00599102,"about_ca_topic_score_gemma":0.007090702,"teacher_disagreement_score":0.00599102,"about_ca_system_score_codex":0.00079360505,"about_ca_system_score_gemma":0.0016761969,"threshold_uncertainty_score":0.012196124},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19911721,0.000752574,0.7867295,0.00095458445,0.00011191718,0.00006108658,0.0015191028,0.0010622717,0.009691732],"genre_scores_gemma":[0.87215495,0.0008360362,0.123549394,0.00008280485,0.0001425182,0.000090987756,0.0009059794,0.0001669488,0.002070303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9998586,0.000046503585,0.00000855666,0.00003562722,0.00003071692,0.000019852185],"domain_scores_gemma":[0.9990527,0.00039413953,0.00018072588,0.0001276743,0.00013229591,0.000112522044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003566191,0.00046636412,0.0001917468,0.003643308,0.00041880406,0.0019281666,0.00040865914,0.0004732535,0.0033793512],"category_scores_gemma":[0.0018284494,0.00023821829,0.00031846494,0.0010647781,0.0015018507,0.0020120803,0.00076832,0.00054978987,0.00032144116],"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.0003846451,0.00008015871,0.013234702,0.00059993577,0.000107022744,0.0010167273,0.00214677,0.17456989,0.08648399,0.6204041,0.0054738508,0.09549814],"study_design_scores_gemma":[0.000033055898,0.0002867194,0.033131417,0.00012382865,0.00006872137,0.0013867543,0.0013698682,0.5653659,0.012382982,0.36376512,0.021948207,0.00013742955],"about_ca_topic_score_codex":0.0012533041,"about_ca_topic_score_gemma":0.00098862,"teacher_disagreement_score":0.003643308,"about_ca_system_score_codex":0.0003965338,"about_ca_system_score_gemma":0.0003196025,"threshold_uncertainty_score":0.011305034},"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":"editorial","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027903342,0.0069529545,0.014877752,0.10180765,0.86569357,0.00005822953,0.0006244642,0.00037739341,0.006817669],"genre_scores_gemma":[0.060429953,0.012391321,0.014328437,0.040853165,0.717514,0.00019117378,0.0015241114,0.0006875332,0.15208039],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99646384,0.0005413841,0.00043279535,0.00059613714,0.0016974285,0.00026842396],"domain_scores_gemma":[0.9831014,0.0055707716,0.0004839538,0.0008563431,0.008772453,0.0012151002],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.003879559,0.001323175,0.0017708373,0.0044236463,0.002425237,0.0036386342,0.0051262523,0.006701679,0.035429187],"category_scores_gemma":[0.03062357,0.00045036452,0.0013149142,0.002570615,0.0030549718,0.0049589383,0.002573971,0.0056104087,0.011733045],"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.00022387829,0.00007096226,0.00044225488,0.0006560756,0.000081321865,0.0020368504,0.000279746,0.00032347805,0.0011237256,0.014030578,0.92760444,0.053126696],"study_design_scores_gemma":[0.00012367533,0.00028081704,0.0031440558,0.0006016305,0.00023256852,0.0073364256,0.0005478456,0.005157505,0.004174847,0.05174019,0.9264906,0.00016994076],"about_ca_topic_score_codex":0.0029512781,"about_ca_topic_score_gemma":0.0026349213,"teacher_disagreement_score":0.9932983,"about_ca_system_score_codex":0.0026031532,"about_ca_system_score_gemma":0.0016985913,"threshold_uncertainty_score":0.118522406},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059544552,0.00006930546,0.9388896,0.00009764674,0.000009545697,0.000034240373,0.00007989527,0.00039341432,0.0008816569],"genre_scores_gemma":[0.5630906,0.00036662127,0.43371502,0.000044738943,0.000027211883,0.00012324999,0.0004012823,0.00024086183,0.0019903136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998017,0.000052190804,0.0000086004475,0.00005828749,0.00005960155,0.000019730413],"domain_scores_gemma":[0.9996044,0.00018135189,0.00007503001,0.000065453685,0.00004728808,0.000026415586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003308153,0.0007062676,0.0003980256,0.0013210985,0.00031825888,0.00070159143,0.00077766343,0.0008405817,0.000761492],"category_scores_gemma":[0.0013055874,0.00041946652,0.0007848395,0.00056176964,0.00065200694,0.0008021363,0.0007668527,0.00051159697,0.00024095213],"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.00002710386,0.000017690218,0.0012636349,0.000043381126,0.000017381542,0.00012889014,0.0000925119,0.93754834,0.014083851,0.011157841,0.0004600953,0.03515934],"study_design_scores_gemma":[0.0000021613926,0.000010849706,0.00026298693,0.0000026766154,0.0000037156235,0.00005105269,0.000013629334,0.9936877,0.0015353569,0.0038323004,0.00059141737,0.0000061876553],"about_ca_topic_score_codex":0.0032270274,"about_ca_topic_score_gemma":0.004421912,"teacher_disagreement_score":0.0032270274,"about_ca_system_score_codex":0.00048932276,"about_ca_system_score_gemma":0.0007191772,"threshold_uncertainty_score":0.0064164996},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1289175,0.00068268494,0.8638783,0.0005470964,0.000048812697,0.000083482286,0.00021465795,0.00017145765,0.0054561123],"genre_scores_gemma":[0.9575437,0.0004919903,0.039268974,0.00015352837,0.00018145249,0.00017148883,0.0003350224,0.000090707865,0.001763154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963973,0.0015120154,0.00016074601,0.0006046769,0.0010824545,0.00024289198],"domain_scores_gemma":[0.9707218,0.022149475,0.0023244123,0.0020757099,0.0013966484,0.0013318895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060387435,0.0008430065,0.0017115925,0.0050273524,0.0014082849,0.0029838616,0.002081445,0.0016080369,0.0038346925],"category_scores_gemma":[0.036583032,0.0005105345,0.0012933009,0.0021735292,0.0054177498,0.0061182734,0.0033086846,0.0020138859,0.00030101443],"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.00014636802,0.000067544126,0.0058239256,0.00020046395,0.00016575216,0.00022864138,0.00050828024,0.21579383,0.0023368686,0.74254847,0.0010325857,0.031147284],"study_design_scores_gemma":[0.0000097493385,0.000057093795,0.0012282009,0.000026179809,0.000019125011,0.000093136296,0.00005337183,0.5306595,0.00086829584,0.46629322,0.000666572,0.00002557416],"about_ca_topic_score_codex":0.0010402893,"about_ca_topic_score_gemma":0.0006793549,"teacher_disagreement_score":0.0060387435,"about_ca_system_score_codex":0.002728228,"about_ca_system_score_gemma":0.0008771586,"threshold_uncertainty_score":0.031936288},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14539237,0.00053531444,0.83995986,0.0004994876,0.00007300668,0.00020891856,0.0036551785,0.006194393,0.0034814167],"genre_scores_gemma":[0.78061265,0.00037937224,0.2089741,0.00008049357,0.000065296306,0.00020695114,0.007312135,0.00023621401,0.0021327129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992581,0.000168936,0.000057669367,0.00016213277,0.00025631915,0.0000967792],"domain_scores_gemma":[0.9970239,0.0010624331,0.00053251756,0.00064432295,0.000498205,0.00023867817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079141883,0.0010430475,0.00091668527,0.0040434813,0.0008561164,0.0015659857,0.0012516786,0.00097509346,0.0032275366],"category_scores_gemma":[0.006320977,0.00035063777,0.0006547837,0.002775539,0.00073273515,0.0026840996,0.0019535879,0.0011628739,0.0016306116],"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.0006991457,0.0004622854,0.07230674,0.00042586343,0.0002077574,0.0011378637,0.0006653178,0.41966936,0.01623009,0.05621832,0.016797528,0.4151798],"study_design_scores_gemma":[0.0000068380377,0.000037232214,0.0016897932,0.00001755257,0.0000070821193,0.00011009607,0.00009746049,0.9806354,0.0015270865,0.014117721,0.0017404236,0.000013273327],"about_ca_topic_score_codex":0.0042200782,"about_ca_topic_score_gemma":0.0066910856,"teacher_disagreement_score":0.0042200782,"about_ca_system_score_codex":0.00064351934,"about_ca_system_score_gemma":0.0010013365,"threshold_uncertainty_score":0.010797143},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10632962,0.0011022142,0.8244504,0.0043344824,0.0001862563,0.000051344017,0.00032617716,0.00034144658,0.06287796],"genre_scores_gemma":[0.9066024,0.00067949336,0.07603947,0.0004696154,0.0002686017,0.00014563206,0.00027387904,0.00006537263,0.015455532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945146,0.00015637872,0.000022096943,0.00008632159,0.00022274085,0.00006105434],"domain_scores_gemma":[0.999255,0.0002894066,0.00008088454,0.00012756577,0.00014674106,0.000100383186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008259007,0.00032839418,0.00026143,0.001236306,0.0007481096,0.001776017,0.0010864934,0.0007990215,0.0041918033],"category_scores_gemma":[0.0019848081,0.00017020298,0.0004915328,0.00078784314,0.002940484,0.005627487,0.0017159438,0.0011533628,0.00044300323],"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.0000018050644,0.0000025137576,0.00004244945,0.000005830677,0.0000014573676,0.000013085299,0.000056350516,0.0014873565,0.00017579879,0.99701023,0.00013100964,0.0010721607],"study_design_scores_gemma":[0.0000021433273,0.0000044445133,0.000054384658,0.000004312164,0.0000012816188,0.000019178075,0.00003482152,0.0147076575,0.00013635789,0.98243034,0.0026021237,0.0000028939128],"about_ca_topic_score_codex":0.0013090563,"about_ca_topic_score_gemma":0.0010020913,"teacher_disagreement_score":0.0041918033,"about_ca_system_score_codex":0.0013353105,"about_ca_system_score_gemma":0.0006044394,"threshold_uncertainty_score":0.014023006},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23211205,0.0014628366,0.7273267,0.0012386071,0.0004463372,0.000034509103,0.00031724205,0.00044348044,0.036618207],"genre_scores_gemma":[0.89499116,0.0016651403,0.0730811,0.00019748465,0.0006589103,0.000039610775,0.0004198006,0.00039170453,0.028555078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995382,0.00011048324,0.000023637818,0.0001127108,0.00017577522,0.000039307328],"domain_scores_gemma":[0.99891067,0.00035929395,0.00019315822,0.00019901754,0.00021110242,0.00012680411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062127144,0.0005123031,0.0005397327,0.0019478146,0.00035835156,0.0023022066,0.00050232664,0.0007063349,0.0055111866],"category_scores_gemma":[0.0024726114,0.0003226668,0.0005286431,0.0010201286,0.0013148567,0.0041410923,0.0019595248,0.0022063334,0.0008869015],"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.000035376208,0.000024317307,0.0002727827,0.000034198943,0.000010321233,0.00006739365,0.00016635003,0.00277936,0.002662784,0.9717301,0.0012338847,0.020983117],"study_design_scores_gemma":[0.000015831723,0.000078192454,0.00087054056,0.000019797677,0.000023470424,0.00039778848,0.00013804257,0.08794067,0.0036304349,0.8942653,0.012585569,0.00003451094],"about_ca_topic_score_codex":0.00030602742,"about_ca_topic_score_gemma":0.00021491971,"teacher_disagreement_score":0.0055111866,"about_ca_system_score_codex":0.0006089322,"about_ca_system_score_gemma":0.0002613779,"threshold_uncertainty_score":0.01843679},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24581163,0.001054104,0.6893247,0.0016264718,0.00021549006,0.00008887041,0.00042902262,0.0005739911,0.060875703],"genre_scores_gemma":[0.9292088,0.00070175476,0.05148724,0.0006058765,0.00028353522,0.00017403963,0.00042112032,0.00025068974,0.016866885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806625,0.00047014534,0.00008232023,0.00051087554,0.000626619,0.00024370404],"domain_scores_gemma":[0.9900566,0.0054255533,0.0010516219,0.0015563931,0.0009847778,0.00092504785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019083449,0.0005019067,0.00090317824,0.0019310924,0.0010749466,0.0023847837,0.0014977654,0.0013344047,0.0104887895],"category_scores_gemma":[0.012499578,0.0004296598,0.00080920244,0.00097088394,0.0025243352,0.0065201637,0.004354976,0.0026608761,0.00091504725],"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.000023314913,0.000013361446,0.0006972765,0.000039281662,0.000010201211,0.00019533628,0.00012252916,0.0028114347,0.0019280699,0.98847765,0.00070096325,0.00498056],"study_design_scores_gemma":[0.000013397824,0.000039642608,0.0010695515,0.000035429082,0.000022627477,0.00095257105,0.00010755115,0.08789488,0.003317871,0.899325,0.007189739,0.000031745647],"about_ca_topic_score_codex":0.00058783847,"about_ca_topic_score_gemma":0.00058861525,"teacher_disagreement_score":0.0104887895,"about_ca_system_score_codex":0.0007409263,"about_ca_system_score_gemma":0.0003471669,"threshold_uncertainty_score":0.03508848},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01679986,0.0002506387,0.9624642,0.00035168757,0.00010746373,0.00014612504,0.0024058619,0.010102431,0.007371692],"genre_scores_gemma":[0.11856355,0.00022664151,0.861575,0.00019327801,0.00009937522,0.00027096193,0.012225658,0.0018263621,0.005019185],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977842,0.00042150455,0.00019712518,0.0006647051,0.0007511795,0.00018134443],"domain_scores_gemma":[0.99519473,0.0015549537,0.00041631554,0.0019501556,0.00076727115,0.00011656782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010156168,0.0017048467,0.001064013,0.0015016127,0.0013218398,0.0022093619,0.0032233114,0.0015561662,0.026592076],"category_scores_gemma":[0.010197371,0.0007277161,0.0014245734,0.0033910675,0.00094730937,0.005323482,0.0034294492,0.0021140974,0.011131814],"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.0013352903,0.00037828606,0.0029217983,0.0014452621,0.000092976734,0.0006137212,0.0006153507,0.054909438,0.04375671,0.14258936,0.05114232,0.70019954],"study_design_scores_gemma":[0.00018706548,0.0002631444,0.0013611984,0.00012668884,0.00009551537,0.0010327629,0.0002589354,0.58493054,0.042206664,0.3042632,0.06517833,0.00009596257],"about_ca_topic_score_codex":0.0007918254,"about_ca_topic_score_gemma":0.0016290622,"teacher_disagreement_score":0.026592076,"about_ca_system_score_codex":0.0010753425,"about_ca_system_score_gemma":0.0015033645,"threshold_uncertainty_score":0.08895934},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7110832,0.00037468976,0.28023985,0.00046439064,0.000055741304,0.00004947386,0.0012173459,0.0032525621,0.0032625857],"genre_scores_gemma":[0.9258566,0.00008893572,0.071187146,0.00009439057,0.000039865005,0.000044703826,0.0019197303,0.0004291037,0.00033951583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992999,0.0003282479,0.000025752794,0.00012846052,0.0001396145,0.00007801339],"domain_scores_gemma":[0.9953042,0.0026774174,0.0005791486,0.00080394093,0.00027629753,0.00035901545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028242734,0.00097134936,0.0009117351,0.0031510824,0.0007247784,0.0017464544,0.0015726973,0.00112014,0.001986057],"category_scores_gemma":[0.015101977,0.0006043412,0.00096753374,0.0017821676,0.0012617613,0.0025017753,0.0027544964,0.0012755607,0.00047805344],"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.00034873176,0.00014329035,0.05578289,0.00016890107,0.00024828437,0.0002021034,0.00042246794,0.84106994,0.0047236085,0.031431295,0.0027089713,0.06274958],"study_design_scores_gemma":[0.00001705369,0.000026128362,0.0026639178,0.000012430238,0.000009814819,0.000029333543,0.000043150467,0.9766499,0.0010777087,0.01882052,0.0006283058,0.000021761387],"about_ca_topic_score_codex":0.0044859606,"about_ca_topic_score_gemma":0.0046060137,"teacher_disagreement_score":0.0044859606,"about_ca_system_score_codex":0.0008124316,"about_ca_system_score_gemma":0.0007796082,"threshold_uncertainty_score":0.014936388},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042523188,0.00018430573,0.9939346,0.00008530321,0.00004549374,0.000084973326,0.000090264475,0.0006376443,0.0006851064],"genre_scores_gemma":[0.038592976,0.00016377619,0.95980036,0.000065214546,0.0000307181,0.00014625842,0.00020827499,0.00008382807,0.00090871495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987872,0.00017538604,0.00006496046,0.00031593192,0.0005816965,0.00007475035],"domain_scores_gemma":[0.9991086,0.00022112581,0.00009768813,0.00013995114,0.0003963764,0.000036221696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014525591,0.0011974599,0.0010779512,0.0043367636,0.0014308747,0.0010344938,0.001759653,0.0015288375,0.0016895867],"category_scores_gemma":[0.0035869004,0.00044114064,0.0015542692,0.0037058073,0.0012187776,0.0017752335,0.0011226032,0.0012614904,0.00075085653],"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.00018654169,0.00008902865,0.0018156293,0.00035033186,0.0001823496,0.00013981403,0.00046328158,0.111053206,0.02080828,0.023648283,0.007898902,0.8333644],"study_design_scores_gemma":[0.000049850092,0.00012143709,0.0015592744,0.00007200964,0.000054341428,0.00039160732,0.00013307983,0.93278474,0.020051586,0.027619379,0.017068375,0.0000942909],"about_ca_topic_score_codex":0.009452054,"about_ca_topic_score_gemma":0.008530741,"teacher_disagreement_score":0.009452054,"about_ca_system_score_codex":0.0014020476,"about_ca_system_score_gemma":0.0025729917,"threshold_uncertainty_score":0.01879406},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07332581,0.012061939,0.7941821,0.10375627,0.0021355515,0.00017696555,0.0006729335,0.0012140003,0.0124743655],"genre_scores_gemma":[0.67460424,0.004536223,0.30615735,0.0071748532,0.0010700976,0.00032072832,0.00037183065,0.0005756133,0.005189022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944819,0.0022602505,0.0004656268,0.0010070314,0.0014994353,0.0002857223],"domain_scores_gemma":[0.9647726,0.015075936,0.0024596124,0.006915962,0.009166102,0.0016098566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013876868,0.0010999144,0.0015563738,0.002805032,0.001528192,0.009109073,0.002606607,0.0049663265,0.002744449],"category_scores_gemma":[0.05973617,0.00080884283,0.0010794881,0.0024782727,0.020073308,0.0338815,0.004798698,0.005523395,0.001576173],"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.00019573979,0.000096700205,0.01477964,0.0008251617,0.00014443355,0.00029592885,0.004240607,0.0076193535,0.004686975,0.83946216,0.01687158,0.11078172],"study_design_scores_gemma":[0.0000158799,0.000035871777,0.0015808196,0.00016027123,0.000027293268,0.00026773708,0.0015148922,0.008680908,0.0021440117,0.9659415,0.019566221,0.00006457301],"about_ca_topic_score_codex":0.0028051254,"about_ca_topic_score_gemma":0.001845554,"teacher_disagreement_score":0.013876868,"about_ca_system_score_codex":0.0020632118,"about_ca_system_score_gemma":0.0021880318,"threshold_uncertainty_score":0.073388755},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88316673,0.00046502583,0.090504326,0.001788535,0.000053869575,0.00006868727,0.0002738247,0.0002466034,0.023432286],"genre_scores_gemma":[0.99490607,0.00007654909,0.0027517232,0.00006146424,0.000020706639,0.000035034696,0.00009577173,0.000023323455,0.0020293358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877137,0.0003659658,0.0000403095,0.00020035701,0.00041796837,0.00020401413],"domain_scores_gemma":[0.99538946,0.0018405687,0.00090024306,0.0005181507,0.0004396798,0.0009118752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013709638,0.00038540922,0.0008928095,0.0018127665,0.0015143033,0.0030298163,0.0018889506,0.0015835877,0.005060178],"category_scores_gemma":[0.009157569,0.00042943092,0.0005788126,0.0006635098,0.0040272013,0.002844136,0.0023477615,0.0012091697,0.00034012424],"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.00008829283,0.000032135966,0.0019603134,0.000062058876,0.000019012332,0.00028342087,0.0002865772,0.055166338,0.0016130343,0.93751276,0.0009797707,0.001996268],"study_design_scores_gemma":[0.000060337774,0.000058833568,0.0013238955,0.000028700277,0.000011457847,0.000485465,0.00025025918,0.454733,0.0013973593,0.5389367,0.0026698946,0.00004402159],"about_ca_topic_score_codex":0.005439858,"about_ca_topic_score_gemma":0.0031068632,"teacher_disagreement_score":0.005439858,"about_ca_system_score_codex":0.002177443,"about_ca_system_score_gemma":0.00072398665,"threshold_uncertainty_score":0.016927958},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013917073,0.0030658687,0.009588394,0.011874627,0.03046005,0.00049280655,0.02399215,0.0054941475,0.91364026],"genre_scores_gemma":[0.0108237965,0.0034108304,0.0033003835,0.00089789386,0.0045436923,0.00019569152,0.009740469,0.0017303553,0.96535695],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99946636,0.00007568233,0.00002245095,0.00014600831,0.00019118299,0.00009832898],"domain_scores_gemma":[0.99763,0.00048096167,0.00004383499,0.0004510278,0.00041421648,0.000979892],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001022773,0.0016901394,0.002846662,0.0011705613,0.0026939898,0.006116406,0.001786045,0.0032915273,0.8915867],"category_scores_gemma":[0.0027770572,0.00042387628,0.0014766811,0.0023660464,0.0006288859,0.0031378816,0.0032120508,0.0031276704,0.76808476],"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.0001205934,0.000067997265,0.00008256729,0.00017090059,0.000007682547,0.00004483984,0.000032932734,0.00009934596,0.00075855386,0.0033263706,0.96247196,0.032816242],"study_design_scores_gemma":[0.000039451068,0.00006269726,0.0003289309,0.000054182194,0.000009424868,0.000087234184,0.000050141076,0.0002930305,0.00039282834,0.0029415705,0.9957301,0.000010448548],"about_ca_topic_score_codex":0.0014705858,"about_ca_topic_score_gemma":0.003686471,"teacher_disagreement_score":0.10841328,"about_ca_system_score_codex":0.0010818389,"about_ca_system_score_gemma":0.0014985393,"threshold_uncertainty_score":0.15463841},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.535465,0.01370115,0.22722696,0.0045233187,0.00035165422,0.00009619645,0.0012142159,0.00040915684,0.21701232],"genre_scores_gemma":[0.9541823,0.0045954445,0.026025372,0.00021290367,0.00043068343,0.00011254674,0.0009447269,0.000080944716,0.013415098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947697,0.00012502148,0.000025039064,0.00013052241,0.00019558282,0.000046896832],"domain_scores_gemma":[0.99747,0.001803963,0.00022877823,0.00017880894,0.00016235016,0.00015618648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005088312,0.0005222223,0.0004915705,0.0052737314,0.0010558959,0.003088439,0.0006730821,0.00079188455,0.005795285],"category_scores_gemma":[0.003198095,0.000525555,0.000507548,0.0052130017,0.0037307031,0.0031237288,0.0015520022,0.0014233711,0.00054465357],"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.000026580266,0.000014086172,0.00096999906,0.00009089744,0.000020521702,0.000103717095,0.00067728275,0.004644638,0.0006862228,0.9687858,0.0022440935,0.021736078],"study_design_scores_gemma":[0.0000046618547,0.0000065323584,0.0011450846,0.000033107808,0.000010705749,0.00014034119,0.00018071431,0.006402106,0.00019923404,0.98510146,0.006766849,0.0000091823595],"about_ca_topic_score_codex":0.000958211,"about_ca_topic_score_gemma":0.0008346599,"teacher_disagreement_score":0.005795285,"about_ca_system_score_codex":0.0010349577,"about_ca_system_score_gemma":0.0002650862,"threshold_uncertainty_score":0.019387126},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31324288,0.00596862,0.080050714,0.0025233834,0.0004062051,0.00006737572,0.00036754104,0.0004994739,0.59687376],"genre_scores_gemma":[0.93557346,0.0015744708,0.006713627,0.00022552337,0.00029637534,0.000044565455,0.00022769722,0.00008952743,0.05525476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934345,0.000107986154,0.000025978616,0.00013555496,0.00021384074,0.00017316906],"domain_scores_gemma":[0.9997423,0.000058785037,0.000037844664,0.00003999184,0.00007952295,0.000041514322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048003727,0.00044663905,0.00028841445,0.0013021866,0.0013347855,0.0020185902,0.00041605422,0.0005121144,0.0065737935],"category_scores_gemma":[0.0011115518,0.00013868757,0.00035860055,0.0014536863,0.0030162253,0.0032997977,0.0015507672,0.0011479728,0.0010775975],"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.0000049014966,0.0000017717845,0.000065952096,0.000009409343,9.666634e-7,0.000015082504,0.00014400427,0.00024320185,0.00025148704,0.9960115,0.00047659775,0.0027751413],"study_design_scores_gemma":[0.0000072848648,0.00004451325,0.0013508695,0.000034926394,0.000007410093,0.00018015888,0.00044876646,0.0027527255,0.0020085024,0.9195933,0.07355028,0.000021332327],"about_ca_topic_score_codex":0.002195533,"about_ca_topic_score_gemma":0.0009805994,"teacher_disagreement_score":0.0065737935,"about_ca_system_score_codex":0.0024211013,"about_ca_system_score_gemma":0.00061484013,"threshold_uncertainty_score":0.02199155},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1345273,0.0008330367,0.82728446,0.00096459244,0.00038507182,0.00024347097,0.0004954054,0.0074342275,0.027832476],"genre_scores_gemma":[0.37895957,0.00042063877,0.603414,0.0002486922,0.0002760884,0.00028192252,0.001332712,0.00075090275,0.014315446],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985415,0.00017314036,0.00009630501,0.00024756734,0.00055058644,0.0003909354],"domain_scores_gemma":[0.9979387,0.00080003706,0.00012047657,0.0007304455,0.00029462893,0.00011556478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073428976,0.0012232175,0.0010498175,0.00096104934,0.001175541,0.0026068091,0.0018469513,0.0009637425,0.016257178],"category_scores_gemma":[0.0034649197,0.00064442743,0.0010376801,0.002015164,0.0009195843,0.004480053,0.0025217216,0.0017349017,0.003584607],"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.0016582514,0.00049769564,0.001903288,0.00038592416,0.000096943855,0.00026443406,0.00043917962,0.034156572,0.04522687,0.11893819,0.02418583,0.7722468],"study_design_scores_gemma":[0.0005348502,0.0004431694,0.0019433893,0.00006998186,0.00017019083,0.00054119376,0.00046109388,0.74355423,0.06541899,0.16451603,0.022216046,0.00013086645],"about_ca_topic_score_codex":0.0036093965,"about_ca_topic_score_gemma":0.007927416,"teacher_disagreement_score":0.016257178,"about_ca_system_score_codex":0.0013905679,"about_ca_system_score_gemma":0.0023021302,"threshold_uncertainty_score":0.054385662},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21454309,0.00056651153,0.78121996,0.0004936258,0.00003967496,0.000060651437,0.000282124,0.0015731179,0.0012212878],"genre_scores_gemma":[0.8035701,0.00038273126,0.19263144,0.0002799748,0.00012953677,0.00011773632,0.00083338993,0.000252616,0.0018025187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934584,0.0001569631,0.00005629232,0.0001960176,0.0001759371,0.000068835754],"domain_scores_gemma":[0.99610645,0.0017798179,0.0006413519,0.0008312717,0.00043202663,0.00020907227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016259452,0.00081500475,0.0014408345,0.0024728242,0.0006394141,0.0013619615,0.0020544727,0.0012994318,0.0010872999],"category_scores_gemma":[0.006457604,0.00051980605,0.0009741176,0.001547732,0.0015954875,0.0024438703,0.001957409,0.0018340442,0.00048192963],"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.00019624608,0.00018173178,0.005628811,0.00016758306,0.000121271616,0.00011967282,0.00017269145,0.8467401,0.010950181,0.013917266,0.0010505364,0.120753884],"study_design_scores_gemma":[0.00000336689,0.000013689863,0.00022979607,0.0000035432672,0.0000033578829,0.0000077662235,0.0000060292377,0.9948791,0.0008096864,0.0039458573,0.00009313972,0.000004547299],"about_ca_topic_score_codex":0.00367799,"about_ca_topic_score_gemma":0.0037842798,"teacher_disagreement_score":0.00367799,"about_ca_system_score_codex":0.0009990452,"about_ca_system_score_gemma":0.00081751554,"threshold_uncertainty_score":0.008598924},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021694047,0.012712577,0.67569256,0.27253404,0.0030891763,0.00017927894,0.000862255,0.000892071,0.012343961],"genre_scores_gemma":[0.4004819,0.012735531,0.5526754,0.022283675,0.004302951,0.00063694216,0.0009327464,0.0007118086,0.0052389964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9888369,0.0067974264,0.00079752284,0.0013469235,0.001883807,0.00033739465],"domain_scores_gemma":[0.91259044,0.0579341,0.0034184773,0.012882652,0.010367615,0.002806654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.025273371,0.0012701965,0.0017534106,0.006032953,0.0032507898,0.012347486,0.0035761541,0.006412629,0.0039349287],"category_scores_gemma":[0.09043627,0.0009782853,0.0013597239,0.005703,0.036318026,0.047131393,0.00773027,0.010815062,0.0019140409],"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.000055699078,0.00004046853,0.0032173283,0.00040370296,0.00006154822,0.00013159859,0.002384127,0.001990982,0.00043671555,0.9337116,0.01659781,0.04096848],"study_design_scores_gemma":[0.000010270337,0.000014204092,0.00032893597,0.00016151894,0.000009965209,0.00010670325,0.0011462931,0.0038441536,0.0003230297,0.9750455,0.018975494,0.000033935245],"about_ca_topic_score_codex":0.0030565104,"about_ca_topic_score_gemma":0.002962933,"teacher_disagreement_score":0.025273371,"about_ca_system_score_codex":0.0033933744,"about_ca_system_score_gemma":0.0032346651,"threshold_uncertainty_score":0.13365996},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6640897,0.00034970653,0.33164406,0.000437931,0.00002426558,0.000052282507,0.0011511315,0.0011187723,0.0011320696],"genre_scores_gemma":[0.9283818,0.00020420316,0.06977921,0.000021923988,0.000017974446,0.00005508185,0.0010803984,0.000104465995,0.00035501472],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999605,0.00010647548,0.00002783657,0.000103119506,0.00010398221,0.000053512136],"domain_scores_gemma":[0.9950293,0.0023283407,0.0010635895,0.00085690815,0.00048268843,0.00023917631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007329283,0.00027847826,0.00035480267,0.0031073948,0.0005655211,0.0009728405,0.000445454,0.00046660536,0.0010047418],"category_scores_gemma":[0.0077265,0.0002158753,0.00049445144,0.0022398576,0.00075173785,0.0010471193,0.0009934518,0.00063051895,0.00024059402],"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.0012062569,0.00028907234,0.15492985,0.0007834067,0.00039378396,0.0013529646,0.0042784163,0.23376115,0.15405405,0.05008873,0.005047513,0.39381483],"study_design_scores_gemma":[0.00002480326,0.00018145579,0.09077914,0.000045556786,0.000060067443,0.00074106967,0.00077515363,0.8351877,0.013213793,0.05368204,0.0052124257,0.00009680771],"about_ca_topic_score_codex":0.003918868,"about_ca_topic_score_gemma":0.0054646283,"teacher_disagreement_score":0.003918868,"about_ca_system_score_codex":0.0005114626,"about_ca_system_score_gemma":0.00079216686,"threshold_uncertainty_score":0.007792115},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15823029,0.0006852912,0.82346123,0.0020781436,0.00014624877,0.00017112572,0.0010767818,0.006442865,0.007707997],"genre_scores_gemma":[0.5816039,0.00037594573,0.40745413,0.0004930049,0.00025431067,0.00033875072,0.0034605335,0.0009790744,0.0050403215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99532205,0.00071794033,0.0003397927,0.0010172228,0.0019148344,0.0006881587],"domain_scores_gemma":[0.97450715,0.015559276,0.0011525642,0.0064052506,0.001733679,0.000642088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003313142,0.0015150973,0.0019378692,0.0021348018,0.0013298088,0.00560058,0.0050240997,0.0019618857,0.007672733],"category_scores_gemma":[0.026233984,0.000997065,0.0018921312,0.0033914575,0.003015107,0.020399025,0.0069086356,0.0035772843,0.0029749395],"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.0019238897,0.00059573184,0.015544651,0.0014047805,0.00045560402,0.00041260294,0.0015892924,0.12001016,0.0285297,0.4118009,0.020336283,0.39739648],"study_design_scores_gemma":[0.000110170564,0.00010888943,0.0010126663,0.000040778083,0.00007234305,0.0002556576,0.00028013097,0.36370322,0.012559322,0.61743194,0.0043708025,0.00005417045],"about_ca_topic_score_codex":0.0013859253,"about_ca_topic_score_gemma":0.0024753404,"teacher_disagreement_score":0.007672733,"about_ca_system_score_codex":0.0027092383,"about_ca_system_score_gemma":0.0028229419,"threshold_uncertainty_score":0.025667846},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71494937,0.00048184642,0.27445656,0.00054670667,0.000064803884,0.000050744507,0.0014752425,0.0036009678,0.004373883],"genre_scores_gemma":[0.93254036,0.00011094506,0.063838206,0.00011461068,0.00004737467,0.00004804812,0.0023247134,0.0005878701,0.00038796893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992316,0.00034365733,0.000027609443,0.0001502763,0.00016444652,0.00008235907],"domain_scores_gemma":[0.9948501,0.0030090397,0.00056531496,0.00090553315,0.00029773556,0.00037213738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031257353,0.0010700149,0.0009358783,0.002977155,0.0007885668,0.0017880771,0.0016601369,0.0011303842,0.002464758],"category_scores_gemma":[0.016977891,0.00060809706,0.0010478606,0.0018147565,0.0013568928,0.0025735262,0.002759804,0.0013730773,0.0005843198],"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.0003682128,0.00014206716,0.059543557,0.00020040663,0.00027218802,0.00024091858,0.00048649608,0.8314317,0.0048323427,0.041490495,0.0033383165,0.057653323],"study_design_scores_gemma":[0.000022915041,0.0000309677,0.0031534308,0.000018177803,0.000012611323,0.0000413324,0.00005052165,0.96913046,0.0013209705,0.025232475,0.0009605468,0.000025550074],"about_ca_topic_score_codex":0.0045948885,"about_ca_topic_score_gemma":0.004697148,"teacher_disagreement_score":0.0045948885,"about_ca_system_score_codex":0.00085386174,"about_ca_system_score_gemma":0.00081836974,"threshold_uncertainty_score":0.016530693},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21327049,0.00041334206,0.7835022,0.00040466234,0.000027684242,0.000053836215,0.00017655414,0.0012002395,0.0009509511],"genre_scores_gemma":[0.79929614,0.00029190865,0.19790146,0.00022508453,0.00008893911,0.00010422716,0.000495173,0.00016717661,0.0014300464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940586,0.00015092402,0.0000550041,0.00016802482,0.00015953316,0.00006066085],"domain_scores_gemma":[0.99662495,0.0015640563,0.00054332864,0.0007118274,0.00038889004,0.00016704496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016139377,0.0006840071,0.001293139,0.0022038124,0.0006163125,0.0011057319,0.0018271095,0.0010686213,0.0008538528],"category_scores_gemma":[0.005626209,0.00045504255,0.0008718863,0.0013328119,0.0015338418,0.0020978975,0.001768041,0.0016125015,0.00033418907],"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.00017891814,0.0001724534,0.00552882,0.0001293939,0.00011064913,0.000105065956,0.00018688513,0.8302491,0.011471955,0.013097373,0.0007592821,0.13801016],"study_design_scores_gemma":[0.0000029471028,0.000014589141,0.00024494797,0.0000028411885,0.000003319412,0.000007181817,0.0000059088075,0.9952846,0.0008428,0.0035091208,0.00007740202,0.0000042542824],"about_ca_topic_score_codex":0.0038408192,"about_ca_topic_score_gemma":0.0038454267,"teacher_disagreement_score":0.0038408192,"about_ca_system_score_codex":0.0009991642,"about_ca_system_score_gemma":0.0008129586,"threshold_uncertainty_score":0.008535445},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009397705,0.0012904,0.95875436,0.0019148203,0.00012752332,0.00003252296,0.00023604622,0.0004444107,0.027802223],"genre_scores_gemma":[0.602478,0.002166694,0.37167865,0.0011117546,0.0004874599,0.00021688097,0.00051959953,0.00046770897,0.020873245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984634,0.0005148461,0.00009272203,0.0002622214,0.000569162,0.00009760502],"domain_scores_gemma":[0.9981275,0.00081881485,0.000115356044,0.00027517605,0.0005081638,0.00015498225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001912501,0.0004245065,0.0004411316,0.0020783679,0.0006806883,0.0035545083,0.0011481576,0.0009708067,0.0062952866],"category_scores_gemma":[0.004779829,0.0002743053,0.0006402108,0.0013835799,0.0046627275,0.0046521192,0.0023475618,0.0024259605,0.0012767129],"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.0000031503703,0.0000030010112,0.00005359382,0.000018659995,0.0000028380966,0.0000114965505,0.000042374453,0.0014883248,0.00015516969,0.99159473,0.0005474549,0.006079165],"study_design_scores_gemma":[0.0000032600706,0.000007752083,0.00008860383,0.00001678058,0.0000023597083,0.00003222641,0.000018429017,0.016932776,0.00028990084,0.9735657,0.009034769,0.000007325756],"about_ca_topic_score_codex":0.0014276536,"about_ca_topic_score_gemma":0.0008572494,"teacher_disagreement_score":0.0062952866,"about_ca_system_score_codex":0.0016353216,"about_ca_system_score_gemma":0.00066309195,"threshold_uncertainty_score":0.02105987},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004679136,0.0015270911,0.9871061,0.0014363347,0.00011873987,0.000056177392,0.00045492212,0.0002848215,0.0043366314],"genre_scores_gemma":[0.23804665,0.0038726104,0.7493458,0.0007331751,0.0009169348,0.0006145657,0.0023679158,0.0002871344,0.0038152302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931457,0.0032932512,0.00056187826,0.0010005836,0.0017702277,0.00022836389],"domain_scores_gemma":[0.9858849,0.008776911,0.001195112,0.0021091332,0.0016001489,0.0004338282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006583541,0.0013502582,0.0015303959,0.010325984,0.0019587434,0.008996645,0.0017474906,0.0015941731,0.0046209935],"category_scores_gemma":[0.02463559,0.0006712625,0.0022534248,0.010089325,0.006640764,0.009787669,0.005496086,0.0036681078,0.0012283039],"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.000013309428,0.000012738883,0.00039702305,0.00012650125,0.000041786403,0.00006551992,0.00025077147,0.010532607,0.00020378015,0.96919405,0.0018307143,0.017331252],"study_design_scores_gemma":[0.000004626919,0.00001508783,0.00018997006,0.00004295754,0.000013224858,0.000073670024,0.000109739245,0.038359612,0.00021517479,0.9518196,0.009141433,0.000014945736],"about_ca_topic_score_codex":0.0022914577,"about_ca_topic_score_gemma":0.0011645228,"teacher_disagreement_score":0.010325984,"about_ca_system_score_codex":0.0031838317,"about_ca_system_score_gemma":0.0017485721,"threshold_uncertainty_score":0.034817517},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03574146,0.006083803,0.8715752,0.0076541067,0.00068047753,0.0009020487,0.011373315,0.0034215257,0.06256815],"genre_scores_gemma":[0.49333233,0.009468522,0.4344153,0.0017095631,0.00070528727,0.0026007248,0.016951716,0.001026508,0.039790004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975389,0.0007453176,0.00028086163,0.00050890923,0.00072421035,0.00020175142],"domain_scores_gemma":[0.99270236,0.00275108,0.0011553486,0.0020680428,0.00087981555,0.00044327744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002397797,0.000813767,0.0009989867,0.004443416,0.003074379,0.008428796,0.0019035155,0.0017122525,0.011924985],"category_scores_gemma":[0.014796108,0.00084034225,0.0009935838,0.007408002,0.0040858476,0.019003808,0.0035970358,0.003061089,0.0028713974],"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.000070906994,0.000028404385,0.0009102594,0.00014505832,0.000018428418,0.00016703788,0.00045327074,0.0071953963,0.00041157496,0.95243615,0.008001956,0.030161588],"study_design_scores_gemma":[0.000019470897,0.000022734193,0.00033312372,0.00017984478,0.000017370457,0.00024523702,0.00019927668,0.034911234,0.0010650335,0.87044436,0.092524335,0.000038018115],"about_ca_topic_score_codex":0.005704311,"about_ca_topic_score_gemma":0.005650478,"teacher_disagreement_score":0.011924985,"about_ca_system_score_codex":0.0024201549,"about_ca_system_score_gemma":0.0027954413,"threshold_uncertainty_score":0.03989303},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018319992,0.07782807,0.07379594,0.012118272,0.0020296425,0.000034593108,0.0004799383,0.0005314738,0.81486213],"genre_scores_gemma":[0.41199082,0.059637025,0.03516854,0.0024521495,0.0046172244,0.000114770126,0.00073740334,0.00055840076,0.4847237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998043,0.000042342646,0.0000067394963,0.000033493012,0.00009732407,0.000015708401],"domain_scores_gemma":[0.9997265,0.0001242863,0.000017931918,0.000056676687,0.00004687772,0.000027804876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028147615,0.00034306655,0.00032113757,0.0011596566,0.00072070886,0.002977448,0.0003535776,0.00035598356,0.008175636],"category_scores_gemma":[0.0008205386,0.00017753002,0.00023814087,0.0015990805,0.002900007,0.0034262484,0.00094905973,0.0013490379,0.002229657],"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.0000020115717,0.0000016255194,0.000061320054,0.000041257637,0.0000023080695,0.0000138057985,0.00018645455,0.00021585773,0.00019580022,0.9673423,0.016538702,0.01539845],"study_design_scores_gemma":[0.0000016084247,0.0000072585135,0.00028217645,0.000037796148,0.0000024782814,0.00009115775,0.00012528324,0.00069804286,0.00013465487,0.7629152,0.23569983,0.0000044276985],"about_ca_topic_score_codex":0.0007133516,"about_ca_topic_score_gemma":0.0007331326,"teacher_disagreement_score":0.008175636,"about_ca_system_score_codex":0.0013448482,"about_ca_system_score_gemma":0.00054575107,"threshold_uncertainty_score":0.027350247},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90171045,0.0002991417,0.045842253,0.00040704382,0.00010557545,0.000054516833,0.0003551828,0.0005503774,0.05067547],"genre_scores_gemma":[0.97407454,0.0002068357,0.0142256655,0.00015407089,0.00004184602,0.00004923017,0.0007294363,0.00019620066,0.010322206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894017,0.00012629868,0.000061072715,0.00024833885,0.00036357075,0.00026060757],"domain_scores_gemma":[0.99874425,0.0003555963,0.000104098865,0.00045758093,0.00017473391,0.00016373473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000347759,0.00058178155,0.00042502276,0.0011871307,0.0015502202,0.0021761174,0.0010088288,0.0008294995,0.0074946457],"category_scores_gemma":[0.001972486,0.000508542,0.001120014,0.00057718856,0.0016999543,0.0020702789,0.003886189,0.0017678265,0.0011777579],"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.00023354893,0.00022733108,0.0038376134,0.0002087548,0.00009093516,0.00196814,0.002389275,0.007709093,0.04990678,0.8952758,0.0036493328,0.034503438],"study_design_scores_gemma":[0.000077683064,0.000093133924,0.0030408234,0.00004661693,0.0001284764,0.0019376421,0.0015875866,0.013374584,0.058075313,0.8885886,0.032981277,0.000068280955],"about_ca_topic_score_codex":0.0011012795,"about_ca_topic_score_gemma":0.0015639546,"teacher_disagreement_score":0.0074946457,"about_ca_system_score_codex":0.0010495436,"about_ca_system_score_gemma":0.00041115945,"threshold_uncertainty_score":0.025072157},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23926328,0.00016430287,0.75684017,0.0001460763,0.00005290765,0.00012071361,0.00081167393,0.0010861792,0.0015148153],"genre_scores_gemma":[0.64848185,0.0001556667,0.3482969,0.000027625969,0.00006574913,0.000094339135,0.0011842279,0.00013332629,0.0015602141],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99962044,0.000054585376,0.000025849502,0.00013393245,0.000113903676,0.000051190655],"domain_scores_gemma":[0.9993049,0.00019007685,0.00010486885,0.00010998339,0.00020348598,0.00008678078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007045282,0.00047083496,0.0005152173,0.0026772895,0.00048244512,0.0010955303,0.00070385035,0.00052431994,0.0019727845],"category_scores_gemma":[0.001711564,0.0001555709,0.0006670967,0.002401092,0.00035962314,0.0010127549,0.0006744286,0.00048866484,0.0004930616],"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.000796418,0.00030217288,0.061085213,0.00027431542,0.000211636,0.00057502463,0.00069910585,0.07143315,0.13606863,0.020067021,0.0029455977,0.7055419],"study_design_scores_gemma":[0.000021376029,0.0001704014,0.052841462,0.000015632862,0.00007893213,0.00044084512,0.0005019798,0.91306704,0.017074505,0.012771571,0.0029643255,0.00005198709],"about_ca_topic_score_codex":0.0047829784,"about_ca_topic_score_gemma":0.005083856,"teacher_disagreement_score":0.0047829784,"about_ca_system_score_codex":0.0003924299,"about_ca_system_score_gemma":0.0007895274,"threshold_uncertainty_score":0.009510279},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025676487,0.0009093629,0.9936174,0.0009856499,0.00009380019,0.00007629997,0.0002027822,0.00025661124,0.0012904325],"genre_scores_gemma":[0.03589858,0.0020957445,0.9594969,0.0002853088,0.00034186064,0.0002449502,0.0007082253,0.00019114946,0.0007372203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9904373,0.005489192,0.0006205106,0.0012673183,0.0020396719,0.00014604775],"domain_scores_gemma":[0.96468306,0.021342868,0.001753432,0.009205579,0.0026143407,0.0004006985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011425759,0.0028064395,0.0026007548,0.0058185393,0.0023640639,0.0069522047,0.0024562832,0.0016827679,0.0033692454],"category_scores_gemma":[0.05095567,0.000994062,0.0030921104,0.008841168,0.0052564647,0.012360205,0.0064684986,0.0077974214,0.0022574414],"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.00013248967,0.00015263523,0.0048125777,0.0008732235,0.00046437202,0.00023918477,0.0012118046,0.073095046,0.004076317,0.5781768,0.012132474,0.32463303],"study_design_scores_gemma":[0.00002409676,0.000085936575,0.0013252292,0.00019388244,0.00006222806,0.00023719457,0.00031162868,0.20898545,0.0018426009,0.7615986,0.025238415,0.000094655814],"about_ca_topic_score_codex":0.0021588556,"about_ca_topic_score_gemma":0.0029346156,"teacher_disagreement_score":0.011425759,"about_ca_system_score_codex":0.001374044,"about_ca_system_score_gemma":0.0023603556,"threshold_uncertainty_score":0.060425937},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064970374,0.00022136536,0.93260247,0.00011839515,0.000014863703,0.00003594234,0.00018421271,0.001361517,0.00049087655],"genre_scores_gemma":[0.58844376,0.00037222187,0.4068897,0.00013246019,0.000072322946,0.00012562374,0.0017066995,0.00045545292,0.0018017308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913186,0.00024695633,0.00004697319,0.00031580924,0.00018502686,0.00007355158],"domain_scores_gemma":[0.9979892,0.0008118899,0.0004120069,0.00041688458,0.00028191955,0.000088102046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00153646,0.001008245,0.0009816259,0.0014616387,0.0003754028,0.0013070437,0.0016828785,0.0019152672,0.0005907048],"category_scores_gemma":[0.004224248,0.0006790668,0.00084619515,0.0010333237,0.0012627533,0.0014967752,0.0015597133,0.001039724,0.000464092],"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.00027861824,0.00012513656,0.004712044,0.00028174827,0.00014121181,0.00023804065,0.00026896503,0.6891836,0.08076248,0.004847509,0.0018732476,0.21728748],"study_design_scores_gemma":[0.0000028266513,0.000026602815,0.00074563344,0.00000971095,0.000007162775,0.000072615876,0.000018888197,0.9865143,0.009389803,0.0028925082,0.00031212598,0.0000079397505],"about_ca_topic_score_codex":0.0014808951,"about_ca_topic_score_gemma":0.0033951502,"teacher_disagreement_score":0.0019152672,"about_ca_system_score_codex":0.0006540371,"about_ca_system_score_gemma":0.00083838357,"threshold_uncertainty_score":0.008125663},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.889094,0.0012410117,0.095049754,0.00061981,0.000058948048,0.000030957803,0.00015398803,0.00009693869,0.01365456],"genre_scores_gemma":[0.9871941,0.00033943678,0.00954084,0.000045770637,0.000054564942,0.00002414576,0.00007589201,0.000027161585,0.0026980995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965787,0.00007396864,0.000019993344,0.00008884689,0.00010178694,0.000057566467],"domain_scores_gemma":[0.99859065,0.0003173426,0.00048009655,0.00012934212,0.00016702936,0.00031556655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005208766,0.00040940117,0.0003067635,0.002743983,0.00062971597,0.0014292519,0.0005280408,0.0006497499,0.0023784607],"category_scores_gemma":[0.0023499795,0.00018647646,0.00027503198,0.0008608482,0.0026123319,0.0034366387,0.0018717741,0.00067875726,0.00023322967],"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.000022498842,0.000019803307,0.0021714724,0.00004624284,0.000010111106,0.0001276393,0.0002608004,0.0034538207,0.0036162073,0.98262215,0.00041179688,0.0072373413],"study_design_scores_gemma":[0.000013445042,0.0001136425,0.00617332,0.000035256744,0.000015438914,0.0007059198,0.00035996706,0.053956404,0.003648659,0.92947656,0.0054494166,0.000051856834],"about_ca_topic_score_codex":0.00045838655,"about_ca_topic_score_gemma":0.00027421274,"teacher_disagreement_score":0.002743983,"about_ca_system_score_codex":0.00058835215,"about_ca_system_score_gemma":0.00025138253,"threshold_uncertainty_score":0.007956743},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048218783,0.0063483235,0.60226315,0.0017997349,0.0014132074,0.00049994944,0.063670896,0.25698462,0.018801294],"genre_scores_gemma":[0.15307935,0.0034256012,0.5559325,0.001278032,0.00040752924,0.0027245355,0.15518846,0.12186795,0.006096074],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9858526,0.005790334,0.0014252197,0.0026379747,0.003545307,0.0007485717],"domain_scores_gemma":[0.9704304,0.017113324,0.0016919285,0.0063765026,0.0035977713,0.00079015404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014269722,0.003864696,0.0031815714,0.005187719,0.0015178394,0.0045177354,0.0058469884,0.0014975971,0.022375165],"category_scores_gemma":[0.06693185,0.0014618594,0.0038777366,0.0066495896,0.0014113736,0.0035823614,0.0053532147,0.0035111932,0.028284045],"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.002163176,0.00041742044,0.029836575,0.0064647924,0.003749654,0.00068479346,0.0012433465,0.118949965,0.011052185,0.07485013,0.48342058,0.2671674],"study_design_scores_gemma":[0.0007288118,0.0007359043,0.021682004,0.0011863954,0.001109983,0.0013751984,0.000791822,0.47403604,0.026969558,0.13608964,0.33460075,0.00069388887],"about_ca_topic_score_codex":0.0043708403,"about_ca_topic_score_gemma":0.00371872,"teacher_disagreement_score":0.022375165,"about_ca_system_score_codex":0.0013882391,"about_ca_system_score_gemma":0.0030330846,"threshold_uncertainty_score":0.075466394},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20365104,0.0031214287,0.65138865,0.003641536,0.00058278796,0.00007010173,0.0010173895,0.00048462953,0.13604233],"genre_scores_gemma":[0.8905682,0.0017558079,0.08446403,0.0008917664,0.0015260049,0.00028518078,0.00093734043,0.0003668669,0.019204807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983347,0.00029510586,0.00008950814,0.00042636998,0.0005232972,0.00033103535],"domain_scores_gemma":[0.99250704,0.004404838,0.00046454862,0.0010242728,0.00076479994,0.0008345818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018447714,0.0011622964,0.0010673103,0.003224171,0.001357991,0.0029876346,0.002174726,0.0009681783,0.012056897],"category_scores_gemma":[0.01050971,0.00048636989,0.0011841011,0.0017270731,0.003841969,0.008500699,0.004042846,0.003107754,0.0013839456],"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.000051973177,0.000018082721,0.0007144783,0.00008465027,0.000015441708,0.00006572557,0.00013185498,0.0033413887,0.0030872496,0.9794447,0.001820267,0.011224194],"study_design_scores_gemma":[0.000011441533,0.000042620955,0.0013060663,0.0000395164,0.000024559842,0.00013299634,0.000063784355,0.035765737,0.0028166664,0.9531764,0.0065929075,0.00002735308],"about_ca_topic_score_codex":0.00072548166,"about_ca_topic_score_gemma":0.000956626,"teacher_disagreement_score":0.012056897,"about_ca_system_score_codex":0.0019062917,"about_ca_system_score_gemma":0.000754028,"threshold_uncertainty_score":0.040334284},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035816476,0.00004328536,0.961301,0.000086849526,0.000008521451,0.000026951902,0.00016466093,0.0017650685,0.0007871289],"genre_scores_gemma":[0.26598573,0.00009895932,0.7311515,0.000049415405,0.00001670311,0.00005169162,0.0008143926,0.0006196972,0.001211872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995011,0.00008146641,0.000031503103,0.00014401517,0.00019603498,0.00004589024],"domain_scores_gemma":[0.9971276,0.0012626625,0.000424618,0.00063119695,0.0004243425,0.00012956688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012255213,0.0005866071,0.00063210406,0.0011187594,0.00047873263,0.0017612409,0.00086911937,0.0011107166,0.0019108506],"category_scores_gemma":[0.008030783,0.00069273374,0.0006236831,0.00097592914,0.0008812139,0.0012997815,0.0011370579,0.0013043067,0.0012634991],"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.0002292897,0.00009848949,0.010997124,0.00023889013,0.000080819,0.0006267897,0.00062058365,0.6522243,0.05774221,0.035714243,0.0057477597,0.23567958],"study_design_scores_gemma":[0.000006020973,0.000015631716,0.0006705802,0.00001020686,0.00000805156,0.00017806928,0.000033726013,0.970982,0.0108122025,0.015925946,0.0013469125,0.000010510673],"about_ca_topic_score_codex":0.0026828018,"about_ca_topic_score_gemma":0.0058839354,"teacher_disagreement_score":0.0026828018,"about_ca_system_score_codex":0.000669966,"about_ca_system_score_gemma":0.0011896646,"threshold_uncertainty_score":0.0064812303},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45765552,0.0019320775,0.49929047,0.0008487195,0.000092627895,0.00006311971,0.00028180826,0.00020402668,0.03963157],"genre_scores_gemma":[0.94763273,0.00041290314,0.045572467,0.00012073865,0.00007613962,0.000064121494,0.00016391964,0.000035187317,0.005921803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877924,0.000307021,0.00008496996,0.00037036435,0.0003453122,0.00011308543],"domain_scores_gemma":[0.9974686,0.0011166797,0.00037858816,0.00043607494,0.000327818,0.00027227524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013947105,0.0004036839,0.0006002786,0.0017869304,0.0012299891,0.0026074639,0.00082443934,0.0007758582,0.0029562805],"category_scores_gemma":[0.0067583174,0.00036761336,0.00067122857,0.0010279567,0.0035143292,0.004808098,0.0036853256,0.0014717705,0.00035296957],"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.000015522033,0.0000057723146,0.00047209612,0.000020082787,0.000006042184,0.000060665996,0.00024643837,0.0015970663,0.0005603509,0.9929731,0.00015565472,0.0038871157],"study_design_scores_gemma":[0.000006992715,0.000032188404,0.0005042023,0.000019132971,0.0000071311915,0.00024471642,0.00018991185,0.016427837,0.0009326222,0.97720045,0.0044172197,0.000017547509],"about_ca_topic_score_codex":0.0010287523,"about_ca_topic_score_gemma":0.00061418617,"teacher_disagreement_score":0.0029562805,"about_ca_system_score_codex":0.0013702046,"about_ca_system_score_gemma":0.00033081058,"threshold_uncertainty_score":0.009941578},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94047004,0.0003621789,0.045862786,0.00021393025,0.000046217152,0.00003706371,0.00015056667,0.0000616654,0.012795642],"genre_scores_gemma":[0.99149513,0.0001631573,0.005546713,0.000034196397,0.000045213994,0.00002713819,0.0001450451,0.000029928176,0.0025134594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999032,0.00016855278,0.0000648736,0.00018443425,0.00037916278,0.00017093384],"domain_scores_gemma":[0.9951048,0.0018494431,0.000671966,0.00056542945,0.00084703113,0.0009612805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012803772,0.00043035645,0.0006128004,0.0066725616,0.0018996911,0.0034911116,0.0009653157,0.00076656777,0.0058441814],"category_scores_gemma":[0.0074737477,0.00050402666,0.0006477044,0.0016111172,0.0030483871,0.0047574434,0.00318507,0.0011181377,0.0005468946],"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.00014206495,0.00006348922,0.021248585,0.00006056052,0.000060319417,0.00054678624,0.0017540462,0.0041254247,0.0077358764,0.9461456,0.00085708493,0.01726007],"study_design_scores_gemma":[0.00003492096,0.00010095863,0.018204667,0.00008753613,0.000069017275,0.0014268201,0.0023314601,0.048406653,0.011227312,0.906672,0.011344769,0.00009390656],"about_ca_topic_score_codex":0.0013225192,"about_ca_topic_score_gemma":0.0009301867,"teacher_disagreement_score":0.0066725616,"about_ca_system_score_codex":0.0011788326,"about_ca_system_score_gemma":0.0002706992,"threshold_uncertainty_score":0.01955074},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08466586,0.0004961195,0.9089587,0.000376349,0.0000607599,0.000058709436,0.0004384831,0.00023177445,0.004713241],"genre_scores_gemma":[0.75900984,0.0008104805,0.23059523,0.00015761265,0.0001377872,0.00025612523,0.0007510213,0.00018137385,0.008100428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884474,0.00032005482,0.00009493747,0.00031863866,0.00031972627,0.000101874124],"domain_scores_gemma":[0.99530965,0.0016860251,0.0012380267,0.0006436226,0.0006641047,0.00045866086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014883605,0.00052226713,0.00040307498,0.002519064,0.0007153647,0.0022943388,0.0009107157,0.0009143997,0.003939729],"category_scores_gemma":[0.008532285,0.00028622302,0.0008721788,0.0015569087,0.002395966,0.0053784424,0.00270365,0.0014888934,0.0004350303],"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.000027920198,0.000014191742,0.0012259292,0.000049625683,0.000013949485,0.00008160874,0.00020225674,0.010392109,0.001428742,0.96436244,0.0005241179,0.021677118],"study_design_scores_gemma":[0.000006189095,0.00004294482,0.0009367321,0.000020778603,0.000007713642,0.00015914858,0.00007837808,0.08516281,0.0011469412,0.9066994,0.0057164743,0.000022616154],"about_ca_topic_score_codex":0.0010536772,"about_ca_topic_score_gemma":0.00074989436,"teacher_disagreement_score":0.003939729,"about_ca_system_score_codex":0.0011499407,"about_ca_system_score_gemma":0.0009990999,"threshold_uncertainty_score":0.01317966},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9867887,0.00010991406,0.010308046,0.00015075151,0.000007208776,0.000009904055,0.000095235875,0.00006788355,0.0024624856],"genre_scores_gemma":[0.9983164,0.00003528333,0.0013760416,0.000009887836,0.0000044487288,0.000007812782,0.000048972925,0.000010262307,0.00019105611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984086,0.000066096276,0.0000061892556,0.000032936237,0.000027824211,0.0000260985],"domain_scores_gemma":[0.99911505,0.00028176073,0.00021481825,0.0001419682,0.000074820324,0.00017156277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055802555,0.00017357641,0.00034698058,0.0013655677,0.0006550948,0.0016306054,0.00046694596,0.00047139605,0.001257758],"category_scores_gemma":[0.0028535107,0.00020970468,0.00042434872,0.0006307837,0.0013682779,0.001373575,0.0009838224,0.00052306225,0.00007970493],"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.00017876836,0.000103295395,0.06595886,0.000090605245,0.00010780058,0.0003689664,0.00057217793,0.5750835,0.0061769774,0.33938888,0.0011935965,0.010776574],"study_design_scores_gemma":[0.00003281818,0.00004754351,0.020251676,0.000021891625,0.000020861142,0.00007884055,0.00015875202,0.86732984,0.00088811375,0.11012683,0.0010158148,0.000026994005],"about_ca_topic_score_codex":0.0047235624,"about_ca_topic_score_gemma":0.0026051558,"teacher_disagreement_score":0.0047235624,"about_ca_system_score_codex":0.0011151312,"about_ca_system_score_gemma":0.0004202694,"threshold_uncertainty_score":0.009392083},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0575033,0.010770894,0.6309155,0.06901787,0.008798987,0.0045316117,0.0324236,0.01086818,0.17517006],"genre_scores_gemma":[0.2742432,0.0036421083,0.51897275,0.011763967,0.0032660414,0.010019233,0.09013105,0.0063074427,0.08165423],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9728679,0.009802381,0.00083209143,0.0038847185,0.010401218,0.0022116832],"domain_scores_gemma":[0.9577235,0.0139871575,0.00072760106,0.00855386,0.010876113,0.008131721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021731459,0.0022094208,0.002717163,0.001575386,0.0024056905,0.0091140885,0.0059304005,0.004722337,0.020021692],"category_scores_gemma":[0.05311464,0.00077663595,0.0017786412,0.0019342684,0.004934205,0.007267606,0.014300339,0.0077615394,0.016854463],"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.0013494613,0.0011788497,0.0015457742,0.0015778394,0.00014051762,0.00017147674,0.0005858162,0.022690844,0.004921449,0.2284596,0.60157394,0.13580447],"study_design_scores_gemma":[0.0008013104,0.0010798546,0.0025574553,0.00045026754,0.000086846776,0.00038918774,0.0010692197,0.15084697,0.013018866,0.27635357,0.55318487,0.00016152395],"about_ca_topic_score_codex":0.0052487934,"about_ca_topic_score_gemma":0.0051348615,"teacher_disagreement_score":0.021731459,"about_ca_system_score_codex":0.0060265455,"about_ca_system_score_gemma":0.010005628,"threshold_uncertainty_score":0.114928246},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9108129,0.00040246564,0.07003594,0.00031659423,0.0000777222,0.000027683911,0.00013549357,0.00012458954,0.018066496],"genre_scores_gemma":[0.98458415,0.0002206993,0.006885294,0.000066124725,0.00006358043,0.000029500781,0.00012499884,0.000033576216,0.007992113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996799,0.00004384454,0.000017957282,0.000060774662,0.00008769815,0.00010975743],"domain_scores_gemma":[0.9992353,0.0002189637,0.0001427419,0.00007041326,0.00010393215,0.00022867657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005761478,0.00032746192,0.00028949935,0.002048743,0.0012904746,0.001975726,0.00040046635,0.00058974343,0.00647398],"category_scores_gemma":[0.0016082413,0.0002038697,0.0005081139,0.00055793935,0.0017841171,0.00325519,0.0017662866,0.0010643967,0.00043032054],"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.000028025419,0.000019180658,0.0013925777,0.000023211784,0.000004770579,0.00018797521,0.00049565977,0.00082121504,0.0033775347,0.98466957,0.00030269186,0.008677682],"study_design_scores_gemma":[0.000015345648,0.00011586437,0.0053330534,0.00003564522,0.000013989865,0.0005920886,0.0006585203,0.01997742,0.0037880917,0.962511,0.006921145,0.00003782332],"about_ca_topic_score_codex":0.00086512323,"about_ca_topic_score_gemma":0.000612496,"teacher_disagreement_score":0.00647398,"about_ca_system_score_codex":0.00075317227,"about_ca_system_score_gemma":0.00029244262,"threshold_uncertainty_score":0.021657646},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031046043,0.000032772445,0.9989968,0.000049883776,0.000019600026,0.000009890508,0.00003214102,0.00035934683,0.00018900109],"genre_scores_gemma":[0.02545099,0.00013591931,0.9725945,0.00008756325,0.0000760416,0.00022442009,0.00022912437,0.0002613844,0.0009401044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994474,0.00016159275,0.00006479846,0.00013522313,0.00016422311,0.000026815385],"domain_scores_gemma":[0.9985796,0.00081312674,0.00009987118,0.00026231774,0.00019440832,0.000050724353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014529964,0.0010202762,0.0007718204,0.0011477213,0.00044516582,0.0011559598,0.0012453395,0.0009149785,0.0036207943],"category_scores_gemma":[0.006517004,0.0004582347,0.0010125122,0.001206969,0.0006957982,0.0014071736,0.0016386549,0.0019539031,0.002163808],"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.0001068965,0.00007759995,0.00083700044,0.00027104345,0.00018187836,0.00024078497,0.000107913205,0.37402457,0.009980362,0.18995069,0.0134576885,0.41076362],"study_design_scores_gemma":[0.0000121495,0.000017103488,0.000076164506,0.000010722521,0.000008739231,0.00006802691,0.0000055604737,0.94250506,0.0012643486,0.04976812,0.006251854,0.000012170908],"about_ca_topic_score_codex":0.001184188,"about_ca_topic_score_gemma":0.0014420054,"teacher_disagreement_score":0.0036207943,"about_ca_system_score_codex":0.00040522715,"about_ca_system_score_gemma":0.00095556484,"threshold_uncertainty_score":0.012112796},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79693925,0.0008692178,0.12394118,0.0011507953,0.00019716343,0.00006456604,0.0005574512,0.00038202,0.07589842],"genre_scores_gemma":[0.9636196,0.00033019786,0.020916838,0.0002703112,0.000086081,0.00006882921,0.00052191596,0.000089876616,0.0140964985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993919,0.00012449485,0.000032343978,0.00014950529,0.00016461022,0.00013711241],"domain_scores_gemma":[0.9990777,0.00024619824,0.00021030995,0.00012371645,0.00013844478,0.0002036985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037958025,0.00049628876,0.00032786236,0.001523122,0.0010628647,0.0023874228,0.000859581,0.00064214185,0.0059496923],"category_scores_gemma":[0.001602484,0.00044400478,0.00041479766,0.0015575227,0.0015984693,0.0031748493,0.0012376279,0.0012620239,0.0005981181],"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.000036285357,0.000019885465,0.00092518004,0.000023956502,0.0000043638224,0.00006222466,0.00019981706,0.0016710671,0.0018070525,0.98398966,0.0012763911,0.009984191],"study_design_scores_gemma":[0.00001354918,0.000029610757,0.0012250568,0.00002339225,0.000008602598,0.0002438328,0.00035998336,0.018704215,0.0030605372,0.9646927,0.011606937,0.000031710166],"about_ca_topic_score_codex":0.0023186742,"about_ca_topic_score_gemma":0.0029363239,"teacher_disagreement_score":0.0059496923,"about_ca_system_score_codex":0.0011225278,"about_ca_system_score_gemma":0.00030355743,"threshold_uncertainty_score":0.01990372},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21944015,0.00043408995,0.7759272,0.0004128602,0.000059732072,0.000104620216,0.00058985327,0.0012537902,0.0017777466],"genre_scores_gemma":[0.7436316,0.00043963364,0.25261793,0.000060854087,0.000066384506,0.000058847407,0.0010396541,0.00026575613,0.0018192782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996151,0.00013840094,0.000021360134,0.00009806555,0.0000797964,0.000047253736],"domain_scores_gemma":[0.99734926,0.0011625283,0.00034460807,0.0003420202,0.00058950006,0.00021215688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009427076,0.00069387845,0.00070303114,0.0040304484,0.0012392642,0.0011797183,0.0010810035,0.0010926953,0.00116831],"category_scores_gemma":[0.0050140107,0.00031692753,0.0008352546,0.0038603751,0.00095604704,0.0008337628,0.0011719977,0.0007152461,0.0004303058],"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.00030905395,0.00023440413,0.012145236,0.00028425775,0.00013393354,0.00052182586,0.00068626733,0.6967021,0.0115029095,0.041539516,0.0043662824,0.23157416],"study_design_scores_gemma":[0.0000063803514,0.000021992604,0.001264699,0.000008833127,0.000011639052,0.00008007361,0.00011772955,0.98297346,0.0013390938,0.013403913,0.00075926457,0.000012927959],"about_ca_topic_score_codex":0.011242626,"about_ca_topic_score_gemma":0.010858482,"teacher_disagreement_score":0.011242626,"about_ca_system_score_codex":0.0010755438,"about_ca_system_score_gemma":0.0010811939,"threshold_uncertainty_score":0.022354364},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3697561,0.0059301145,0.46560904,0.0035438186,0.0006682927,0.00021556021,0.0017143603,0.00036129163,0.15220146],"genre_scores_gemma":[0.9118742,0.0025358489,0.06101962,0.0010855293,0.0006576798,0.000275664,0.0012684087,0.00020961872,0.021073524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900585,0.00031799029,0.000058494414,0.00022113089,0.00021462483,0.00018193948],"domain_scores_gemma":[0.99798596,0.00091302267,0.00032021027,0.00036093808,0.00018951666,0.0002303438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013982088,0.00070182484,0.0010126748,0.002163977,0.0021951036,0.0032804452,0.0013120028,0.0012610747,0.009383796],"category_scores_gemma":[0.006309771,0.0005441181,0.00082501024,0.0030101058,0.0028900427,0.008786947,0.0036242895,0.002167163,0.0010178898],"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.000017386636,0.000005823832,0.000117196214,0.000021791615,0.000004333513,0.000031703647,0.00010990243,0.00093140895,0.00017821767,0.9941508,0.0010394057,0.0033918985],"study_design_scores_gemma":[0.000006649162,0.000005872892,0.000184086,0.00001673277,0.000003952907,0.000062472536,0.000070984686,0.0035291233,0.000093092865,0.9934269,0.0025918114,0.000008271315],"about_ca_topic_score_codex":0.0016796299,"about_ca_topic_score_gemma":0.0019763233,"teacher_disagreement_score":0.009383796,"about_ca_system_score_codex":0.0013087577,"about_ca_system_score_gemma":0.0006145911,"threshold_uncertainty_score":0.03139192},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55325073,0.026627608,0.35891572,0.0025877508,0.00035794117,0.0003491325,0.00082492456,0.0017372558,0.05534892],"genre_scores_gemma":[0.9387563,0.0033166714,0.053541586,0.00008032111,0.00011014995,0.000029010615,0.0008384295,0.00008665614,0.0032408775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989201,0.00022400332,0.000052520536,0.0001919334,0.00048514738,0.00012630012],"domain_scores_gemma":[0.99646026,0.0012513032,0.00023939788,0.00049084215,0.0013401848,0.00021808925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019655488,0.00035068273,0.0006550505,0.004420407,0.0006446252,0.0018260777,0.00091714994,0.0005046983,0.0025795642],"category_scores_gemma":[0.0053487606,0.0001342887,0.00072476605,0.0031052849,0.0010650393,0.002232677,0.0011351136,0.0005718234,0.00065521564],"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.00055137917,0.00028066488,0.022751331,0.00051773037,0.00013656342,0.00019746374,0.0005855924,0.061689455,0.0062979036,0.03255536,0.0073652565,0.86707133],"study_design_scores_gemma":[0.000021680096,0.00024489377,0.021565286,0.00006882191,0.000069668895,0.0005018362,0.0006020538,0.9365022,0.0070587914,0.020967321,0.012338919,0.000058535876],"about_ca_topic_score_codex":0.0126563,"about_ca_topic_score_gemma":0.0053147227,"teacher_disagreement_score":0.0126563,"about_ca_system_score_codex":0.0014425438,"about_ca_system_score_gemma":0.001293294,"threshold_uncertainty_score":0.02516526},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013884483,0.00055706664,0.13315132,0.004697806,0.0029790758,0.0004476127,0.18869801,0.18491238,0.48316827],"genre_scores_gemma":[0.017027572,0.0016752371,0.0810816,0.0027385978,0.0011855918,0.00068036525,0.2552497,0.16084857,0.47951266],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900395,0.00014172231,0.000074373726,0.00015168522,0.0005225487,0.00010562879],"domain_scores_gemma":[0.9974407,0.0007915883,0.00010712298,0.0006209711,0.0007885289,0.0002510537],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009853491,0.0019975852,0.0015524102,0.002857917,0.0012369974,0.0059932014,0.0035256776,0.0017123854,0.755619],"category_scores_gemma":[0.0055944514,0.0012343363,0.0015953773,0.0052508377,0.0008102865,0.005745644,0.0035551232,0.0032189863,0.5953328],"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.00007360742,0.000030466615,0.000112255584,0.00018203008,0.000008327068,0.00004005838,0.0000677092,0.00031863296,0.0008537003,0.012389778,0.95368725,0.032236163],"study_design_scores_gemma":[0.0000541779,0.000012340503,0.0004923296,0.00011414128,0.000007043057,0.000092742855,0.00005381671,0.0020216682,0.0024609098,0.016439456,0.97822034,0.000031090007],"about_ca_topic_score_codex":0.011460313,"about_ca_topic_score_gemma":0.015340479,"teacher_disagreement_score":0.755619,"about_ca_system_score_codex":0.0026776295,"about_ca_system_score_gemma":0.0015143848,"threshold_uncertainty_score":0.34857982},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3263538,0.00036710277,0.66913265,0.00037175237,0.000031510608,0.00007393996,0.00038248498,0.0013427022,0.001944147],"genre_scores_gemma":[0.9268988,0.00012562747,0.07076993,0.00008024608,0.000019599727,0.00006083122,0.0005374022,0.00005619094,0.0014514581],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997944,0.000052518753,0.000011199176,0.000057756806,0.000045958237,0.000038075294],"domain_scores_gemma":[0.99953306,0.00017200423,0.000104928215,0.00005003547,0.0001020593,0.00003787754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053771463,0.00066131854,0.0003968556,0.001109975,0.0002836442,0.0008512707,0.00074327143,0.0006052921,0.0006322065],"category_scores_gemma":[0.0014773913,0.00024951165,0.00068031636,0.0004932668,0.0005143436,0.000671337,0.00080667995,0.0007323009,0.00023222648],"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.00029393798,0.00013270554,0.011371987,0.00007390297,0.000095275966,0.0001797699,0.00015813415,0.7540747,0.023489477,0.0060684644,0.0012863973,0.20277525],"study_design_scores_gemma":[0.000002042473,0.000017857095,0.00072176685,0.0000038193734,0.0000050585354,0.000020209478,0.000009225944,0.99397355,0.0027577807,0.0023560445,0.00012710481,0.0000055283153],"about_ca_topic_score_codex":0.003923215,"about_ca_topic_score_gemma":0.004659608,"teacher_disagreement_score":0.003923215,"about_ca_system_score_codex":0.0010018655,"about_ca_system_score_gemma":0.00061432936,"threshold_uncertainty_score":0.007800758},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007382434,0.086886376,0.3327532,0.034249406,0.0072515295,0.00031771624,0.0042389287,0.0014967181,0.52542365],"genre_scores_gemma":[0.34379297,0.12428606,0.25275,0.017610483,0.019988365,0.0010421817,0.00897955,0.0013469148,0.23020343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99732333,0.00073308294,0.00016033526,0.0007306205,0.000869274,0.0001833188],"domain_scores_gemma":[0.99673873,0.0015395827,0.00016109519,0.0006963,0.00067553547,0.00018878514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00196244,0.001107961,0.001355181,0.0037065449,0.0021352617,0.005097073,0.0016975251,0.0018672834,0.026704947],"category_scores_gemma":[0.0054231663,0.0006054158,0.0012715402,0.0036314977,0.0054319208,0.0056330687,0.0030720923,0.004859179,0.0117713455],"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.000006226624,0.000007914426,0.00011286659,0.00016813689,0.000012356036,0.0000418351,0.00013667776,0.00062109705,0.00014513006,0.9438735,0.026951741,0.027922573],"study_design_scores_gemma":[0.000004141608,0.00000688836,0.00014092443,0.0000740344,0.000004730654,0.00012393606,0.00003728574,0.0008072729,0.000090654874,0.826194,0.1725072,0.000008957542],"about_ca_topic_score_codex":0.0026517655,"about_ca_topic_score_gemma":0.0015808601,"teacher_disagreement_score":0.026704947,"about_ca_system_score_codex":0.003426312,"about_ca_system_score_gemma":0.0015594874,"threshold_uncertainty_score":0.08933693},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002097874,0.06263121,0.013074093,0.0039551733,0.0024820738,0.00003061289,0.0007990359,0.0005182478,0.91441166],"genre_scores_gemma":[0.046708353,0.07413284,0.011771126,0.0024669433,0.005782969,0.00025115733,0.0017101514,0.00072376605,0.8564527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967515,0.000051877294,0.000019464005,0.000112618574,0.00011465112,0.000026304077],"domain_scores_gemma":[0.99975675,0.000060492974,0.000021950116,0.00007299964,0.00006468958,0.000023051794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038881466,0.0016884907,0.0013362418,0.0026901003,0.0013738183,0.005034931,0.0011346386,0.0014159334,0.060271896],"category_scores_gemma":[0.0012131631,0.0006764144,0.00043387918,0.0046349596,0.0025669546,0.0065165786,0.0014701658,0.0034002042,0.03073078],"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.000009109188,0.000017409502,0.000121966434,0.0003593144,0.000009296621,0.0000845951,0.00036716065,0.00035065148,0.0004230796,0.72734684,0.18255308,0.08835746],"study_design_scores_gemma":[0.0000065136533,0.0000063726993,0.00033311156,0.000109773864,0.000009638534,0.00027313843,0.00012955225,0.00038959231,0.00007215167,0.35201535,0.6466482,0.0000065301165],"about_ca_topic_score_codex":0.003597706,"about_ca_topic_score_gemma":0.005397615,"teacher_disagreement_score":0.060271896,"about_ca_system_score_codex":0.0018947518,"about_ca_system_score_gemma":0.0010249004,"threshold_uncertainty_score":0.20162958},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36131105,0.003857618,0.60404426,0.0027015633,0.000083732404,0.00003991848,0.00049750495,0.0005583688,0.026905943],"genre_scores_gemma":[0.92191124,0.0017009752,0.07030087,0.00015268609,0.0000867123,0.000048807175,0.00041100231,0.00022553233,0.0051620854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997422,0.00012268187,0.000010830255,0.000042709587,0.000055708744,0.000025862391],"domain_scores_gemma":[0.9970692,0.0023572538,0.00018648851,0.00013551254,0.00015179784,0.00009981212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009151171,0.00052162784,0.0005300607,0.0014344887,0.000384665,0.0022927828,0.00096531113,0.0010252281,0.0028730389],"category_scores_gemma":[0.00807761,0.0005912016,0.00035484968,0.0008162355,0.00096817606,0.0030104993,0.0010745391,0.0012846243,0.00034874768],"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.00009651923,0.00005417234,0.0032278325,0.00017265292,0.000054428205,0.00024048885,0.00029111962,0.6746045,0.0043319464,0.25691324,0.003711037,0.056302115],"study_design_scores_gemma":[0.00000604369,0.000022845963,0.0006774706,0.000021921729,0.0000065154472,0.00008245504,0.0000705743,0.78673387,0.00045989617,0.21081181,0.0010952951,0.000011349332],"about_ca_topic_score_codex":0.0012263363,"about_ca_topic_score_gemma":0.0015345783,"teacher_disagreement_score":0.0028730389,"about_ca_system_score_codex":0.0008492104,"about_ca_system_score_gemma":0.00029378792,"threshold_uncertainty_score":0.009611249},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025587859,0.001099724,0.9684992,0.000571539,0.00006215014,0.000063583226,0.00019728759,0.0013093578,0.0026093584],"genre_scores_gemma":[0.5543499,0.0014610639,0.43850058,0.000246035,0.00014919105,0.00012777865,0.0007965203,0.00021347104,0.004155376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954575,0.000105508225,0.0000246763,0.00012318292,0.0001555848,0.000045249228],"domain_scores_gemma":[0.9985172,0.00059409114,0.00019846995,0.00024405216,0.0003540729,0.00009207274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001073269,0.00043376914,0.0007568507,0.0023735417,0.00053032045,0.0010136473,0.0011421503,0.00073590555,0.0020831958],"category_scores_gemma":[0.003151956,0.00025967814,0.0007906333,0.002330354,0.0014068861,0.001513176,0.0014199385,0.0011661751,0.0007081095],"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.00014161528,0.00012362075,0.0046405974,0.00029815026,0.00007625239,0.00017186545,0.00028904714,0.2763415,0.011468924,0.10096919,0.007975438,0.5975037],"study_design_scores_gemma":[0.0000042549414,0.000029085593,0.00054900954,0.000010233771,0.0000061751884,0.000056551697,0.000020339963,0.96838343,0.0023279751,0.026212186,0.0023881504,0.0000125464885],"about_ca_topic_score_codex":0.0070866644,"about_ca_topic_score_gemma":0.004788927,"teacher_disagreement_score":0.0070866644,"about_ca_system_score_codex":0.001214752,"about_ca_system_score_gemma":0.0011894527,"threshold_uncertainty_score":0.014090836},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3982969,0.018905878,0.11524784,0.087556355,0.010249053,0.00021453465,0.0009336551,0.00048787388,0.36810794],"genre_scores_gemma":[0.8455104,0.0064097713,0.015555282,0.0032693308,0.0031563167,0.00017107294,0.0004397612,0.00027736914,0.12521079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920624,0.00027831396,0.000027106933,0.00018177234,0.00020132092,0.00010525004],"domain_scores_gemma":[0.9984108,0.0005385002,0.00009345503,0.00011265036,0.00031989688,0.0005246926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013283531,0.00064274034,0.00037738797,0.00090376195,0.0017879945,0.0039250636,0.0004123185,0.0009887754,0.010461526],"category_scores_gemma":[0.0032245817,0.00022541678,0.00032873687,0.0005964888,0.0022954457,0.004435329,0.0027098272,0.0023565488,0.0010335925],"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.000033727676,0.0000081854605,0.00026112527,0.00006971309,0.000005902432,0.0001052798,0.0017093057,0.00043938222,0.0022034305,0.9671243,0.019141024,0.008898586],"study_design_scores_gemma":[0.000016126452,0.00005288145,0.0012087375,0.00008596982,0.000012111616,0.00048294637,0.001755395,0.002308312,0.0026570258,0.73569465,0.25567922,0.000046649606],"about_ca_topic_score_codex":0.0004260145,"about_ca_topic_score_gemma":0.0006052156,"teacher_disagreement_score":0.010461526,"about_ca_system_score_codex":0.0013706355,"about_ca_system_score_gemma":0.0008853029,"threshold_uncertainty_score":0.034997344},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8160406,0.00053001475,0.1328528,0.0006282902,0.000097600576,0.000045569086,0.0001856792,0.00036384223,0.049255688],"genre_scores_gemma":[0.9938933,0.000068708076,0.0035044495,0.000038069287,0.00006560067,0.000014130939,0.00007977143,0.00002250634,0.0023134563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987457,0.00019705617,0.00005597082,0.00025185346,0.0005196222,0.00022989698],"domain_scores_gemma":[0.9978532,0.00057357067,0.0004801638,0.00039822032,0.00035817927,0.0003365558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088572985,0.0002311412,0.00043180725,0.00213296,0.0009180142,0.002514247,0.0006790328,0.0004333379,0.0041298773],"category_scores_gemma":[0.0041417847,0.00013887932,0.0003813939,0.0011062588,0.003754702,0.004193388,0.0028111276,0.0012290278,0.00029674993],"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.000022835502,0.0000176435,0.001548352,0.000017693952,0.000007668882,0.000085963744,0.00045460553,0.0016244658,0.0010053841,0.98883027,0.00031453287,0.006070594],"study_design_scores_gemma":[0.0000117540685,0.00004908611,0.0020499579,0.000016105072,0.000010380767,0.00017469331,0.00049085263,0.013265016,0.0015429473,0.9767695,0.0056005567,0.000019078336],"about_ca_topic_score_codex":0.0008310244,"about_ca_topic_score_gemma":0.00036017742,"teacher_disagreement_score":0.0041298773,"about_ca_system_score_codex":0.0012220459,"about_ca_system_score_gemma":0.00035940568,"threshold_uncertainty_score":0.01381582},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022725163,0.0001455412,0.96903294,0.00012603735,0.00003898093,0.000085809384,0.00034684845,0.00659299,0.0009056184],"genre_scores_gemma":[0.48449886,0.00026501843,0.5080245,0.00031252127,0.00006133042,0.00025958547,0.0025161747,0.0013025608,0.0027593614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964297,0.00003348103,0.000013580685,0.00011050463,0.00014207003,0.00005738856],"domain_scores_gemma":[0.99965155,0.000074451826,0.00004294443,0.00011165953,0.00007913748,0.000040317136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045953252,0.0010575479,0.0010360611,0.0012150528,0.0005473752,0.0011576059,0.0023901558,0.0016204232,0.002851852],"category_scores_gemma":[0.0017832937,0.0006523818,0.0010611463,0.0011917243,0.00093353516,0.001975398,0.0027058395,0.0012952609,0.0011090422],"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.00028176626,0.000106424915,0.0024029114,0.00014844067,0.000129811,0.00019437716,0.00015819792,0.5881257,0.028965805,0.011087814,0.008810601,0.35958815],"study_design_scores_gemma":[0.000007601113,0.000020628042,0.00025742807,0.0000049752043,0.000005817613,0.00004257846,0.000011332917,0.9897856,0.004531296,0.004408807,0.0009170013,0.0000069439184],"about_ca_topic_score_codex":0.0051770597,"about_ca_topic_score_gemma":0.0066719265,"teacher_disagreement_score":0.0051770597,"about_ca_system_score_codex":0.0010903095,"about_ca_system_score_gemma":0.0009378654,"threshold_uncertainty_score":0.010293841},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07688809,0.018862693,0.35939518,0.040583268,0.0047668507,0.00004463449,0.0009217413,0.0004920564,0.49804547],"genre_scores_gemma":[0.73771566,0.010419119,0.10042117,0.010755344,0.0075026746,0.0000935543,0.0009013588,0.000976399,0.13121477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994165,0.00015784262,0.000020317117,0.0001497874,0.00018743899,0.00006815512],"domain_scores_gemma":[0.99925774,0.00035683287,0.000048375852,0.00014519905,0.00012367399,0.000068197405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013521423,0.00070561835,0.00070829573,0.0017286465,0.0012180958,0.002241955,0.0007347843,0.0013869724,0.014682944],"category_scores_gemma":[0.0029095986,0.00018977385,0.0008726964,0.0014726901,0.0026900214,0.007665533,0.001316749,0.003392133,0.0020565689],"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.000008764018,0.000010399066,0.00007975313,0.000030317187,0.0000032818496,0.00003285437,0.00015069962,0.00033158078,0.00031080135,0.9895762,0.0044955104,0.004969698],"study_design_scores_gemma":[0.000006394871,0.00001736939,0.0001812058,0.000034428474,0.0000050285907,0.0000673618,0.000066983004,0.0019551795,0.0002732014,0.9672665,0.0301087,0.000017695507],"about_ca_topic_score_codex":0.0013028955,"about_ca_topic_score_gemma":0.0012644322,"teacher_disagreement_score":0.014682944,"about_ca_system_score_codex":0.0010625377,"about_ca_system_score_gemma":0.00036903232,"threshold_uncertainty_score":0.049119353},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011952658,0.022723641,0.077907436,0.05813287,0.0029063965,0.00010889548,0.00027224224,0.0003104585,0.8256853],"genre_scores_gemma":[0.5660575,0.05458649,0.054220304,0.035810627,0.004905981,0.00063834316,0.0010128729,0.0014618874,0.281306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99465126,0.0022154038,0.00025130893,0.0013128644,0.0011362875,0.00043295798],"domain_scores_gemma":[0.99640465,0.0018883827,0.00014235778,0.00093938934,0.00051222875,0.00011312621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059704767,0.0007981418,0.00073307706,0.0029232774,0.0044128485,0.012067966,0.0014448727,0.00247349,0.009341599],"category_scores_gemma":[0.009286574,0.00044224612,0.0013846495,0.0044106385,0.022832055,0.01991648,0.008505819,0.0064233746,0.0021420065],"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.0000016089823,0.0000022799284,0.00009682564,0.000026827216,0.0000026902553,0.000019686018,0.002269635,0.00015704127,0.000020377429,0.9867655,0.0046671187,0.0059704743],"study_design_scores_gemma":[0.0000024623648,0.0000064388723,0.0002757318,0.00020069368,0.0000075261537,0.000082780796,0.0030393843,0.0003051043,0.00009272149,0.6762329,0.31974688,0.0000073116694],"about_ca_topic_score_codex":0.009432421,"about_ca_topic_score_gemma":0.008405367,"teacher_disagreement_score":0.012067966,"about_ca_system_score_codex":0.0065106046,"about_ca_system_score_gemma":0.005155623,"threshold_uncertainty_score":0.047237933},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83819973,0.0014294552,0.129261,0.00069118105,0.00008007505,0.000049249935,0.00038293953,0.00018344962,0.029722983],"genre_scores_gemma":[0.9767948,0.00036978384,0.014347213,0.00007702066,0.000051542327,0.000049270897,0.00030707158,0.000059454156,0.007943841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994615,0.00013751614,0.000024970164,0.00014857331,0.00013269114,0.00009468658],"domain_scores_gemma":[0.9988587,0.0003189675,0.00020864747,0.00015897893,0.00017975904,0.00027492573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005390648,0.0003893666,0.00042648017,0.0023053545,0.0010172606,0.0020191532,0.0007367009,0.00066899654,0.0056991535],"category_scores_gemma":[0.002121072,0.00021598236,0.00048715822,0.00096312567,0.0022443014,0.0031836636,0.0014898301,0.0010010106,0.00039859422],"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.000033092776,0.000010850864,0.00038454632,0.000016167662,0.0000066804155,0.000049976225,0.00026596815,0.0012650656,0.0011988811,0.9913005,0.00030533242,0.0051629343],"study_design_scores_gemma":[0.000011427591,0.000049550985,0.0006028687,0.000021846547,0.000011173756,0.00015147773,0.00025882636,0.0174979,0.0012886766,0.9738591,0.006225244,0.000021885042],"about_ca_topic_score_codex":0.001697101,"about_ca_topic_score_gemma":0.00086494896,"teacher_disagreement_score":0.0056991535,"about_ca_system_score_codex":0.0008018616,"about_ca_system_score_gemma":0.00028740978,"threshold_uncertainty_score":0.019065559},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003178203,0.019904248,0.057615034,0.003439016,0.0017356555,0.000044192402,0.00034695002,0.0005611284,0.9131756],"genre_scores_gemma":[0.07468988,0.01737403,0.02712994,0.0011091098,0.00226973,0.0001297819,0.0010695362,0.00048320755,0.8757448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979764,0.000026279891,0.0000068996283,0.000045635847,0.00010849728,0.000015137122],"domain_scores_gemma":[0.999801,0.000056700374,0.000008021341,0.000060345836,0.00005312667,0.000020844107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020661388,0.0006290816,0.0006358945,0.001505613,0.0009320785,0.0024908313,0.00068031147,0.0005182469,0.027837154],"category_scores_gemma":[0.0007045362,0.00030619872,0.00032703634,0.0020566199,0.0019885718,0.0034802873,0.0010630413,0.0015846014,0.009460308],"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.0000056544422,0.000010780506,0.000059142905,0.00007807749,0.000005497434,0.000018526769,0.00013191489,0.0005978938,0.00027942922,0.8062582,0.11436323,0.078191675],"study_design_scores_gemma":[0.0000030261508,0.000005251508,0.00015394311,0.000048531117,0.00000459523,0.00009312684,0.00004698068,0.0013196506,0.00025777964,0.5616057,0.43645644,0.0000049440123],"about_ca_topic_score_codex":0.001156776,"about_ca_topic_score_gemma":0.0019504284,"teacher_disagreement_score":0.027837154,"about_ca_system_score_codex":0.0014701133,"about_ca_system_score_gemma":0.00093856704,"threshold_uncertainty_score":0.09312457},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12220365,0.014123513,0.59877205,0.016466713,0.0006528694,0.00013638783,0.0017992639,0.00063785736,0.24520773],"genre_scores_gemma":[0.89591473,0.0073954384,0.061499253,0.0007461477,0.001075859,0.00028848223,0.0017227547,0.0002820829,0.0310753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720746,0.0006018907,0.00018006566,0.00037631983,0.0014163424,0.00021797964],"domain_scores_gemma":[0.99438065,0.0038796787,0.0002697408,0.0006814615,0.00056072365,0.00022774102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001426906,0.00078263436,0.0010779558,0.0022801915,0.0013674222,0.0065641096,0.0014617014,0.00097612984,0.007525368],"category_scores_gemma":[0.006846607,0.00080660224,0.0013206481,0.0026802092,0.004243688,0.012345166,0.003505227,0.0052385833,0.0008230853],"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.00000880773,0.000007293458,0.000100426754,0.00005494966,0.000008284954,0.00001627801,0.00012573435,0.0018765829,0.00015553732,0.98926485,0.0015570577,0.006824094],"study_design_scores_gemma":[0.0000025362206,0.00000266752,0.00005462047,0.000009128004,0.000003518072,0.000021685948,0.000025295405,0.0033773961,0.000086862085,0.99322414,0.0031879365,0.0000042209053],"about_ca_topic_score_codex":0.0011894205,"about_ca_topic_score_gemma":0.00075269694,"teacher_disagreement_score":0.007525368,"about_ca_system_score_codex":0.003970876,"about_ca_system_score_gemma":0.001178443,"threshold_uncertainty_score":0.028810859},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07366148,0.0012195397,0.9154586,0.00032653555,0.00012048562,0.000081806356,0.00065039383,0.0007977581,0.0076834066],"genre_scores_gemma":[0.7565443,0.0010077419,0.23240764,0.00025622352,0.00026598526,0.0001711777,0.0020785292,0.0002849939,0.0069834604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994842,0.000070344075,0.000036725574,0.000121756086,0.00022215881,0.000064780026],"domain_scores_gemma":[0.9992355,0.0001280446,0.00012216272,0.00020189921,0.00020430154,0.00010806938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044015603,0.00035819225,0.0008762843,0.003955321,0.00043161464,0.0018103826,0.000892519,0.0008375431,0.0033753675],"category_scores_gemma":[0.0016745134,0.00019910812,0.0005485433,0.002538882,0.0012664807,0.0033924342,0.0020709934,0.0011321823,0.0012697224],"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.00020585721,0.00012309758,0.00688146,0.0002973682,0.00010173702,0.00046330335,0.000547355,0.036956653,0.06915504,0.49441588,0.007863495,0.38298866],"study_design_scores_gemma":[0.000020832098,0.0002909512,0.008013893,0.0000867721,0.000058226815,0.0020416423,0.00086641335,0.6695383,0.022784835,0.25604537,0.040106546,0.00014619107],"about_ca_topic_score_codex":0.0008260529,"about_ca_topic_score_gemma":0.00063801283,"teacher_disagreement_score":0.003955321,"about_ca_system_score_codex":0.00058528996,"about_ca_system_score_gemma":0.00033269753,"threshold_uncertainty_score":0.011291802},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13320045,0.0153841805,0.58001465,0.0149602555,0.0005224509,0.0001391222,0.0017627876,0.00054826576,0.25346783],"genre_scores_gemma":[0.8995021,0.0075454847,0.06324464,0.000613584,0.00096463045,0.000279114,0.0015695299,0.00021876572,0.026062204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743927,0.0005415801,0.00017818075,0.000336558,0.0013130716,0.00019123772],"domain_scores_gemma":[0.99507153,0.0033890372,0.00025184368,0.00060461083,0.00048729585,0.00019571155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013476388,0.0007098466,0.0009963271,0.0021725895,0.0012722355,0.0060379505,0.0014014062,0.0008796687,0.006626325],"category_scores_gemma":[0.006054408,0.00073812396,0.0011947955,0.002639051,0.004089833,0.011438083,0.0029416883,0.0045266137,0.00069326744],"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.000008240994,0.0000076058527,0.000113656395,0.00005365779,0.000008046708,0.000017715549,0.00013464184,0.0019051253,0.00017031234,0.9890616,0.001407556,0.0071117715],"study_design_scores_gemma":[0.0000026431487,0.0000025976626,0.000061413135,0.00000861067,0.0000032912778,0.000024344568,0.000027726986,0.0034469003,0.00009079752,0.9932278,0.0030996816,0.000004212018],"about_ca_topic_score_codex":0.0011356956,"about_ca_topic_score_gemma":0.0007443651,"teacher_disagreement_score":0.006626325,"about_ca_system_score_codex":0.0036091066,"about_ca_system_score_gemma":0.0010613737,"threshold_uncertainty_score":0.02618599},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029147344,0.007397149,0.019422036,0.0019255282,0.0010482372,0.000023455865,0.00017370176,0.00024277283,0.9668523],"genre_scores_gemma":[0.14764531,0.010135872,0.015987482,0.0013151852,0.0030486216,0.000121201454,0.00054562296,0.00033277008,0.82086796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997702,0.000057853256,0.000009668406,0.000043074273,0.00009989628,0.000019270712],"domain_scores_gemma":[0.9998447,0.000036437275,0.000009922646,0.00004445771,0.00005024538,0.0000141893315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002896835,0.0005240064,0.0006054579,0.0015462715,0.0013240423,0.0026095405,0.0005840587,0.0005447465,0.03413207],"category_scores_gemma":[0.0006475417,0.0002416331,0.00026362814,0.0018330632,0.0022615413,0.0035219237,0.0010459756,0.0017203791,0.008394409],"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.0000021776002,0.0000043475375,0.000015664344,0.00003352161,0.0000020459743,0.000011417538,0.00011438382,0.00008084893,0.00013019238,0.9624758,0.020431684,0.016697828],"study_design_scores_gemma":[0.0000030709468,0.000005810757,0.00010137634,0.000021583426,0.0000031002612,0.00009255729,0.00006166997,0.0003547708,0.00016347952,0.7005246,0.2986641,0.000003863721],"about_ca_topic_score_codex":0.0007960807,"about_ca_topic_score_gemma":0.0010119578,"teacher_disagreement_score":0.03413207,"about_ca_system_score_codex":0.0015317022,"about_ca_system_score_gemma":0.00075553055,"threshold_uncertainty_score":0.11418313},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012903208,0.0004004956,0.9825606,0.001102937,0.00009344397,0.00013818528,0.0005820151,0.00059761346,0.0016215858],"genre_scores_gemma":[0.48044768,0.0018911783,0.50828904,0.0004690016,0.0005672923,0.00052743143,0.0031887242,0.00027677312,0.0043428647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9913867,0.0033711256,0.0005913672,0.0011153285,0.0032265775,0.0003087661],"domain_scores_gemma":[0.96339357,0.014825727,0.0030473536,0.014852062,0.0029973749,0.00088396634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006164795,0.0007255984,0.0014508365,0.004681169,0.0021297287,0.0039609945,0.0038148419,0.0023007484,0.0023595765],"category_scores_gemma":[0.037899032,0.00067626964,0.001370328,0.008967862,0.0024526382,0.013048174,0.006007213,0.0022996494,0.0011430221],"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.00043505276,0.00025365478,0.005833835,0.00059540593,0.00029111342,0.0009230498,0.0013405157,0.1765909,0.008783259,0.44434676,0.012893821,0.34771255],"study_design_scores_gemma":[0.000050418377,0.0002557099,0.0012104404,0.000070792914,0.00010268041,0.0016138598,0.0007724535,0.55527866,0.013374172,0.39424026,0.032941166,0.000089393725],"about_ca_topic_score_codex":0.00059869385,"about_ca_topic_score_gemma":0.0008002559,"teacher_disagreement_score":0.006164795,"about_ca_system_score_codex":0.0015041893,"about_ca_system_score_gemma":0.0015949019,"threshold_uncertainty_score":0.032602906},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2691571,0.0018607139,0.41734838,0.009676595,0.001096127,0.00013478272,0.0018961732,0.0023906466,0.2964395],"genre_scores_gemma":[0.89151627,0.00088296586,0.03824558,0.0021673306,0.0005291807,0.00024864604,0.0017087213,0.0013559201,0.063345425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983486,0.00019404516,0.00006665088,0.00053886115,0.00031645433,0.0005354581],"domain_scores_gemma":[0.99592555,0.0017990487,0.00046536003,0.00038351715,0.00059646886,0.0008300985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001988411,0.00088782364,0.0014004243,0.0023402225,0.0029593024,0.005367177,0.0026084858,0.0018886664,0.032096528],"category_scores_gemma":[0.0104777645,0.00049286144,0.0013761309,0.0009137927,0.004224505,0.008683979,0.0061888266,0.004439913,0.0055758655],"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.00006984645,0.00002992438,0.00086403836,0.00008193539,0.000015048773,0.00014997978,0.0002970693,0.002096082,0.00078767986,0.98323613,0.0060288804,0.006343283],"study_design_scores_gemma":[0.000020437741,0.00003190484,0.0010686626,0.00006478626,0.000022509877,0.00027256637,0.00026252106,0.034516327,0.0021938619,0.9517882,0.009723239,0.000035029185],"about_ca_topic_score_codex":0.0034020706,"about_ca_topic_score_gemma":0.0023644294,"teacher_disagreement_score":0.032096528,"about_ca_system_score_codex":0.0031503325,"about_ca_system_score_gemma":0.0015554352,"threshold_uncertainty_score":0.107373595},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11721363,0.00007668226,0.88174784,0.00015769633,0.000016650627,0.000057262114,0.00007638549,0.00026467812,0.00038901193],"genre_scores_gemma":[0.88369256,0.00007670744,0.115262024,0.00006670867,0.00004558173,0.00022471063,0.00029597152,0.00007024451,0.00026543543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9912101,0.0063304477,0.0003348227,0.0010014895,0.0008448924,0.00027826673],"domain_scores_gemma":[0.7955059,0.18750936,0.005648932,0.0074229455,0.0026332503,0.0012795907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017043209,0.00036999362,0.0010377953,0.0020817916,0.00078617665,0.0012854995,0.0019424862,0.0013792923,0.0016787521],"category_scores_gemma":[0.11853099,0.00043103163,0.0009039178,0.001234392,0.0032088645,0.0026691444,0.0025709218,0.0018067608,0.00014930642],"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.0006598599,0.0002490759,0.029322809,0.00018324224,0.00035497686,0.00033323793,0.00048384836,0.67873985,0.004440066,0.2144174,0.00080861605,0.07000704],"study_design_scores_gemma":[0.00001480703,0.000071807444,0.0012458916,0.0000063268785,0.00000883632,0.000029611418,0.000020974883,0.9581091,0.0006663367,0.039695565,0.00012106031,0.000009694134],"about_ca_topic_score_codex":0.0021522432,"about_ca_topic_score_gemma":0.0014734848,"teacher_disagreement_score":0.017043209,"about_ca_system_score_codex":0.001148628,"about_ca_system_score_gemma":0.0016193135,"threshold_uncertainty_score":0.090134144},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8376747,0.0005316285,0.14146943,0.0001821168,0.00007205192,0.00004099158,0.00021479547,0.00024498152,0.01956932],"genre_scores_gemma":[0.9853162,0.00017828196,0.01146719,0.00005224756,0.00007192732,0.000025535699,0.00017266483,0.00005114434,0.0026648655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936825,0.000090042384,0.00004010602,0.00012410796,0.00025195442,0.00012546401],"domain_scores_gemma":[0.9956606,0.0021114356,0.0010730963,0.0003582527,0.00044588905,0.0003506946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004043275,0.00036477885,0.0005144292,0.0021308772,0.0008470502,0.0015082512,0.0005959879,0.00058428757,0.0042381026],"category_scores_gemma":[0.006253041,0.00033152947,0.00043719664,0.0010645717,0.0019641651,0.0031966541,0.0010801947,0.0011148332,0.00045752153],"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.00017438525,0.000047176498,0.002387175,0.00011655313,0.000010459174,0.0006689883,0.0007685578,0.01927604,0.005855682,0.9534153,0.0012272175,0.016052466],"study_design_scores_gemma":[0.000029338142,0.00012447531,0.003216362,0.00006518467,0.000017492093,0.0016847887,0.00048974605,0.1771647,0.005802931,0.8044093,0.0069154776,0.000080256395],"about_ca_topic_score_codex":0.0013609579,"about_ca_topic_score_gemma":0.0010141119,"teacher_disagreement_score":0.0042381026,"about_ca_system_score_codex":0.0006175731,"about_ca_system_score_gemma":0.00024142725,"threshold_uncertainty_score":0.014177859},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7840095,0.00064029725,0.17982727,0.001080362,0.00012856348,0.00004659237,0.00022590681,0.00023645179,0.033804923],"genre_scores_gemma":[0.98220277,0.0002694873,0.011872549,0.00009481489,0.00008890588,0.0000358089,0.00014429308,0.00006943067,0.005221949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949324,0.00011730891,0.0000285297,0.00015030749,0.00012742363,0.000083259],"domain_scores_gemma":[0.99815065,0.0009236657,0.00024641072,0.00023013346,0.00021402082,0.00023504917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061274815,0.0005519197,0.00044084806,0.0017403987,0.0009657633,0.0022061141,0.0009496685,0.00078875956,0.0045103235],"category_scores_gemma":[0.0031029503,0.00039542324,0.00053370325,0.00082948926,0.0026989756,0.0052512786,0.002229811,0.0009941359,0.00035016524],"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.000033791133,0.000017478324,0.0015471792,0.00007822238,0.000009331449,0.00012131274,0.00046338636,0.002205398,0.0032368565,0.9819177,0.0010208745,0.00934857],"study_design_scores_gemma":[0.000006950982,0.00001916031,0.00060233724,0.000020948251,0.0000118026355,0.0001468756,0.0001480952,0.0186953,0.0022508246,0.975399,0.0026808137,0.000017922193],"about_ca_topic_score_codex":0.0006663339,"about_ca_topic_score_gemma":0.0009075531,"teacher_disagreement_score":0.0045103235,"about_ca_system_score_codex":0.00081987155,"about_ca_system_score_gemma":0.00027419886,"threshold_uncertainty_score":0.015088499},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031612135,0.008713701,0.71660215,0.003300967,0.0009802863,0.00007911233,0.0013423486,0.00059261016,0.23677668],"genre_scores_gemma":[0.6018029,0.011646526,0.18298304,0.0014966482,0.004719725,0.00034272767,0.0046366393,0.0010981436,0.19127364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993548,0.00011358273,0.00003055088,0.00018848605,0.00026832076,0.000044325247],"domain_scores_gemma":[0.9984238,0.00067994726,0.000118237826,0.00032317505,0.00035475122,0.000100083074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007673681,0.0008124251,0.0007901121,0.0029262018,0.0006003493,0.002012376,0.0006263398,0.00085449783,0.014002428],"category_scores_gemma":[0.004275628,0.00035550233,0.00038316977,0.0023398118,0.0014452409,0.003571522,0.0014975985,0.002275811,0.0031661054],"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.000020053043,0.000017347214,0.0002576769,0.00007777849,0.000013854934,0.000035465484,0.000091206806,0.0032510182,0.0020496212,0.8782968,0.016395947,0.09949319],"study_design_scores_gemma":[0.0000043533505,0.000026051443,0.0006015679,0.00003494203,0.0000123798945,0.00022006716,0.000058161266,0.02059338,0.0018259023,0.93917817,0.03742924,0.00001575805],"about_ca_topic_score_codex":0.00041150313,"about_ca_topic_score_gemma":0.00033673816,"teacher_disagreement_score":0.014002428,"about_ca_system_score_codex":0.00067130086,"about_ca_system_score_gemma":0.00027274035,"threshold_uncertainty_score":0.046842813},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7210692,0.00021014197,0.26941347,0.00026754275,0.000020161713,0.000023288329,0.00091111305,0.0007263708,0.0073587387],"genre_scores_gemma":[0.9818392,0.000056558532,0.017177306,0.000034579043,0.000022718837,0.000014021733,0.00037556092,0.000079835656,0.00040016358],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992119,0.00023764173,0.00003393638,0.00023689636,0.00016338266,0.00011614239],"domain_scores_gemma":[0.99164915,0.0041470123,0.001675955,0.0016045743,0.00045725435,0.00046608303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015081234,0.00030806893,0.0004024547,0.0030241206,0.0006493104,0.00190897,0.0006213931,0.00047463478,0.0035522562],"category_scores_gemma":[0.015674805,0.00030507514,0.00046442926,0.0021905338,0.0015886999,0.0023152032,0.0025190578,0.00072310027,0.00046540823],"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.0004368815,0.00010782549,0.33637038,0.00018610366,0.00023707325,0.0006112238,0.0019906622,0.16704352,0.013631947,0.32630908,0.0028737658,0.15020145],"study_design_scores_gemma":[0.000021845508,0.000113361704,0.09223874,0.000058758294,0.000045646815,0.0005511549,0.0004394366,0.57827103,0.0070632757,0.31401262,0.0071074464,0.00007661714],"about_ca_topic_score_codex":0.004058707,"about_ca_topic_score_gemma":0.004061536,"teacher_disagreement_score":0.004058707,"about_ca_system_score_codex":0.0007186952,"about_ca_system_score_gemma":0.0005058605,"threshold_uncertainty_score":0.011883497},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26353076,0.000736872,0.7226973,0.0023300836,0.00007652679,0.000100709665,0.0005402744,0.0004332025,0.009554226],"genre_scores_gemma":[0.9625941,0.0005175553,0.033253036,0.00018760437,0.0001811278,0.00016274078,0.00033402402,0.0001522093,0.0026176486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816614,0.0009011673,0.000063080224,0.00034792416,0.00033428363,0.00018743244],"domain_scores_gemma":[0.9516122,0.039759785,0.0032961734,0.0022780476,0.0016749578,0.0013788723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044995523,0.0008059826,0.0009020301,0.0038964178,0.0010199172,0.0021039345,0.002239068,0.0017520081,0.004694006],"category_scores_gemma":[0.038913134,0.00076656597,0.0007105742,0.0024016532,0.0049678683,0.0053295125,0.0023435904,0.0019870412,0.00030131216],"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.00010013085,0.000055309793,0.0035543728,0.0000737235,0.000027600685,0.0001409785,0.000224054,0.21187444,0.0019784989,0.7753395,0.001529345,0.005102095],"study_design_scores_gemma":[0.000025894376,0.000029038321,0.0014175207,0.000034139004,0.0000139365,0.00011128459,0.00007350357,0.7022556,0.0009710549,0.29413435,0.0008883811,0.000045302033],"about_ca_topic_score_codex":0.0035246192,"about_ca_topic_score_gemma":0.003682896,"teacher_disagreement_score":0.004694006,"about_ca_system_score_codex":0.0031519847,"about_ca_system_score_gemma":0.000876775,"threshold_uncertainty_score":0.0237962},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01043543,0.00042878714,0.982126,0.000524621,0.0001250204,0.000068403024,0.0011602157,0.0022755587,0.0028558795],"genre_scores_gemma":[0.53427535,0.00072860334,0.4482566,0.0009694947,0.0004089804,0.0005094622,0.008020222,0.00053437636,0.006296892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986513,0.00035904275,0.00006747533,0.00037808833,0.00037982938,0.00016416743],"domain_scores_gemma":[0.99762005,0.0011079665,0.00020133475,0.00036888008,0.00056044606,0.00014119555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015441049,0.0010905027,0.0011967032,0.0023764127,0.0007799285,0.0017735874,0.0033797657,0.001515707,0.0075861933],"category_scores_gemma":[0.007041139,0.0005568476,0.0015313531,0.0020135026,0.00085712934,0.0043941736,0.001716216,0.0016611819,0.0027979026],"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.0003684946,0.0001866716,0.005351267,0.0002296356,0.00021672671,0.00020432707,0.00009884824,0.610123,0.002866331,0.061532598,0.01949363,0.29932857],"study_design_scores_gemma":[0.000015263146,0.00003819844,0.00021448208,0.000017069784,0.0000236126,0.00006618378,0.000011583992,0.96503884,0.0005428084,0.030971242,0.003047947,0.000012720391],"about_ca_topic_score_codex":0.004866593,"about_ca_topic_score_gemma":0.006938904,"teacher_disagreement_score":0.0075861933,"about_ca_system_score_codex":0.0008959702,"about_ca_system_score_gemma":0.0014162746,"threshold_uncertainty_score":0.025378287},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058158305,0.00815751,0.5581792,0.008691454,0.0012065484,0.0003774897,0.0015284418,0.0009181905,0.36278284],"genre_scores_gemma":[0.52551574,0.007418925,0.3894115,0.0006222058,0.0006862564,0.0009863959,0.0009851094,0.0007227739,0.07365113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953643,0.0014175168,0.00030649317,0.0007731084,0.0018542166,0.00028432618],"domain_scores_gemma":[0.99338716,0.0025288211,0.0006079009,0.00146057,0.0016938684,0.00032176223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031470784,0.00062716566,0.00057508267,0.0036214653,0.0029950438,0.008821447,0.0009544643,0.0015091219,0.024240544],"category_scores_gemma":[0.014015536,0.0008379319,0.0008100272,0.0033966333,0.006215107,0.004979729,0.0027127746,0.00251186,0.0070243464],"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.00007790204,0.000059323444,0.0025477288,0.00034933753,0.000042359854,0.0003517388,0.0027807802,0.002524042,0.006696856,0.86799175,0.0061082137,0.11047009],"study_design_scores_gemma":[0.00003334233,0.00007074887,0.0050232927,0.0003099806,0.000074077674,0.0011516775,0.0035519106,0.005887938,0.0082058115,0.6426689,0.33287996,0.00014233463],"about_ca_topic_score_codex":0.004056784,"about_ca_topic_score_gemma":0.0049536987,"teacher_disagreement_score":0.024240544,"about_ca_system_score_codex":0.0022974168,"about_ca_system_score_gemma":0.004910508,"threshold_uncertainty_score":0.081092715},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60460126,0.00025407923,0.3833709,0.00089214486,0.0000805055,0.00008617965,0.0005188023,0.00049693004,0.00969917],"genre_scores_gemma":[0.9423047,0.00019003187,0.04402058,0.0001549413,0.00013291893,0.00009548261,0.0010107937,0.00018638547,0.011904294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923134,0.00014613054,0.00004394716,0.00026725847,0.00019369548,0.00011762204],"domain_scores_gemma":[0.99579155,0.0019034506,0.0006523553,0.00047322016,0.0004660902,0.0007133499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008728024,0.00064111326,0.001102858,0.00292007,0.0023423142,0.002967062,0.0015225187,0.001686412,0.006332125],"category_scores_gemma":[0.007369941,0.0008691666,0.00078778306,0.0018559643,0.003164792,0.0037243473,0.0040093013,0.0018760229,0.00061521766],"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.0002620316,0.00010393675,0.0043949797,0.00010702007,0.00004193853,0.00026204708,0.0009095491,0.0554891,0.0039267913,0.91708827,0.002990482,0.014423929],"study_design_scores_gemma":[0.000029755935,0.0000503014,0.0016435931,0.000017103454,0.000019662575,0.00011853766,0.0003866625,0.21112026,0.0016722922,0.7826924,0.0022226365,0.000026840158],"about_ca_topic_score_codex":0.0045516263,"about_ca_topic_score_gemma":0.00404414,"teacher_disagreement_score":0.006332125,"about_ca_system_score_codex":0.0016655744,"about_ca_system_score_gemma":0.00088529487,"threshold_uncertainty_score":0.021183074},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7719878,0.0012042809,0.09096429,0.024573272,0.0003895116,0.000053292675,0.000629069,0.00037934713,0.10981905],"genre_scores_gemma":[0.98203504,0.00024493726,0.0110690845,0.0008702135,0.00015538499,0.00006978082,0.00022071648,0.000034033503,0.005300938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979674,0.00054436986,0.00009415804,0.00049511704,0.0005212419,0.0003777368],"domain_scores_gemma":[0.9869265,0.009245264,0.0007879328,0.0013331842,0.0007892365,0.00091794686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023973065,0.00034019526,0.0008346543,0.0015502735,0.002556986,0.002970918,0.0014900622,0.0018406792,0.007327712],"category_scores_gemma":[0.015977891,0.00043442112,0.00072313094,0.0015180056,0.0066165808,0.0068584788,0.0037846628,0.0031152838,0.00034062853],"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.00010744058,0.000039908602,0.0015599481,0.000044390858,0.000010716494,0.00019584333,0.00048703,0.0021635895,0.0006382092,0.9884375,0.0027952648,0.0035201763],"study_design_scores_gemma":[0.000054811313,0.000019696783,0.00090304436,0.0000272513,0.000011216875,0.0003055098,0.00056544604,0.014882993,0.0011574914,0.9748185,0.0072305757,0.000023429777],"about_ca_topic_score_codex":0.0015400838,"about_ca_topic_score_gemma":0.0019654927,"teacher_disagreement_score":0.007327712,"about_ca_system_score_codex":0.0021774927,"about_ca_system_score_gemma":0.00062841165,"threshold_uncertainty_score":0.024513602},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040018488,0.0006398239,0.9550326,0.00091724086,0.00008307719,0.000066975415,0.00021613126,0.00080678717,0.0022189706],"genre_scores_gemma":[0.8561802,0.0005666054,0.13944183,0.00043846975,0.00018310816,0.0001797293,0.00090651127,0.00029665543,0.0018068077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720144,0.001480998,0.00011595482,0.00038195602,0.0006823042,0.00013730818],"domain_scores_gemma":[0.98419094,0.012144462,0.0009200358,0.0011804913,0.0011015347,0.00046243847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076197786,0.0017358433,0.0014612358,0.0023107675,0.00054244365,0.0019488974,0.0022894943,0.0023374432,0.0022859462],"category_scores_gemma":[0.024909744,0.0006185383,0.0009156762,0.0010314623,0.0024967622,0.003429539,0.003261169,0.002521664,0.0003742977],"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.000059566377,0.000027300724,0.0011857469,0.000051742692,0.000062503066,0.000042405743,0.000019213607,0.96014476,0.00051580445,0.017599557,0.0006004739,0.01969092],"study_design_scores_gemma":[0.0000031450475,0.000027648626,0.00007721153,0.0000061826177,0.0000045273655,0.000011779557,0.000003970309,0.9892757,0.00032056257,0.0101451855,0.00011966764,0.000004467614],"about_ca_topic_score_codex":0.0016661698,"about_ca_topic_score_gemma":0.001806056,"teacher_disagreement_score":0.0076197786,"about_ca_system_score_codex":0.0019148597,"about_ca_system_score_gemma":0.0009624,"threshold_uncertainty_score":0.040297747},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018403152,0.0005011858,0.9763199,0.0003459047,0.00004593609,0.000040635263,0.0010746905,0.0022455247,0.0010230299],"genre_scores_gemma":[0.49094194,0.0011697065,0.49808702,0.00029031746,0.00012558929,0.00029832593,0.0044833682,0.0006676059,0.0039361604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997842,0.000055537723,0.000011109929,0.00006899157,0.000057566274,0.000022613602],"domain_scores_gemma":[0.9995127,0.00017039842,0.00010332663,0.000108520675,0.00006151983,0.00004366913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059276697,0.001346097,0.00057887245,0.0016460771,0.00044566597,0.000894694,0.0011949491,0.0008331672,0.0019717962],"category_scores_gemma":[0.00250543,0.0004028117,0.0008371534,0.001230278,0.00085251225,0.00177198,0.0013896377,0.0013785003,0.00049367134],"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.00022639174,0.00014488115,0.0045814323,0.00030820208,0.00035503847,0.00025741858,0.00015428258,0.5849689,0.027998317,0.08531079,0.014572761,0.28112152],"study_design_scores_gemma":[0.0000075984976,0.000029636587,0.00060372567,0.000010706651,0.0000131546685,0.000050816976,0.000012578528,0.96296215,0.0025332337,0.031887516,0.0018733072,0.00001555273],"about_ca_topic_score_codex":0.0043121283,"about_ca_topic_score_gemma":0.00760854,"teacher_disagreement_score":0.0043121283,"about_ca_system_score_codex":0.001049596,"about_ca_system_score_gemma":0.001215021,"threshold_uncertainty_score":0.008574069},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6707065,0.0015500615,0.28796557,0.0004617503,0.00009230228,0.00008565304,0.00019774993,0.00017103778,0.038769398],"genre_scores_gemma":[0.9623282,0.00057458715,0.026629793,0.000066035966,0.00010259297,0.000058661557,0.00015450016,0.000049191607,0.0100366045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994448,0.00009335805,0.0000259426,0.00014812249,0.00017700945,0.00011074697],"domain_scores_gemma":[0.9990527,0.00024129977,0.000183082,0.00012784536,0.0001585159,0.00023656785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005160351,0.0003806926,0.0004533957,0.0019870724,0.0015316227,0.0016378906,0.0005085599,0.00066913036,0.0036851873],"category_scores_gemma":[0.00243774,0.00034576163,0.0007565983,0.0009528175,0.0020377191,0.0031831644,0.00252734,0.0009794786,0.00040386905],"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.000026067764,0.000009849084,0.00091292255,0.000030991152,0.000008029808,0.00024145567,0.0005229154,0.002755171,0.0018157009,0.98249346,0.00035543242,0.010827863],"study_design_scores_gemma":[0.000011009509,0.00008239662,0.0022497931,0.000029798053,0.000017813622,0.0007575895,0.0005326431,0.03257479,0.0029420438,0.944021,0.016745565,0.000035656692],"about_ca_topic_score_codex":0.0014675369,"about_ca_topic_score_gemma":0.000978474,"teacher_disagreement_score":0.0036851873,"about_ca_system_score_codex":0.0008784948,"about_ca_system_score_gemma":0.0004313354,"threshold_uncertainty_score":0.012328148},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011478678,0.0007096325,0.9811772,0.0010679996,0.000095021336,0.000015178727,0.000112886366,0.00016705145,0.0051763626],"genre_scores_gemma":[0.6246267,0.0031540133,0.35391957,0.0014245805,0.0007335378,0.0002638478,0.0006068748,0.00038735283,0.014883522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870646,0.00044399285,0.00006962405,0.00023739017,0.00042353975,0.00011896236],"domain_scores_gemma":[0.9972383,0.0015974353,0.00023844803,0.00043999893,0.00028635276,0.0001994091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024253456,0.0012602324,0.001108057,0.0018050496,0.0007163754,0.0028463304,0.0023717484,0.0019787976,0.0032267235],"category_scores_gemma":[0.008946162,0.00066462875,0.0017317893,0.0015781807,0.0036751078,0.007034121,0.003777498,0.0056031165,0.0008110926],"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.000014032039,0.00001164619,0.00014773183,0.000045922316,0.00001468656,0.000021345679,0.00005004779,0.016639428,0.0005020643,0.9760365,0.000715647,0.0058010737],"study_design_scores_gemma":[0.000005982255,0.000026137095,0.00010775379,0.0000210833,0.000009829089,0.000030449202,0.000015192699,0.21358706,0.00039993034,0.78366333,0.0021239463,0.000009328635],"about_ca_topic_score_codex":0.0016584655,"about_ca_topic_score_gemma":0.001279525,"teacher_disagreement_score":0.0032267235,"about_ca_system_score_codex":0.0025658794,"about_ca_system_score_gemma":0.0008944094,"threshold_uncertainty_score":0.018616796},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021801287,0.000097507334,0.97663146,0.0003285266,0.000012537652,0.000020384707,0.000057133537,0.00025000685,0.00080113433],"genre_scores_gemma":[0.81341237,0.00038193734,0.18390848,0.00032320345,0.000051483927,0.00010302222,0.0001787836,0.00014047668,0.0015002753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988556,0.0005193459,0.000060085353,0.00022242959,0.00023606147,0.00010648733],"domain_scores_gemma":[0.9965149,0.0020276904,0.00043366823,0.00060429826,0.00022989309,0.00018948436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004053812,0.0007373962,0.000935004,0.0010538719,0.00038079152,0.001357647,0.0018693997,0.0012560681,0.0023652643],"category_scores_gemma":[0.012857936,0.00076066697,0.00091895374,0.0007632566,0.002863332,0.005148833,0.004154476,0.0019290908,0.0003538698],"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.00009652486,0.000050392147,0.0012585872,0.000093232855,0.000045470406,0.00007861393,0.00009969,0.49937767,0.002165897,0.46367216,0.0009753083,0.0320864],"study_design_scores_gemma":[0.000008938933,0.000024530675,0.00005989375,0.000008151777,0.0000061888895,0.000018028371,0.00001107962,0.8602727,0.00071319303,0.13846265,0.00040926455,0.0000052352243],"about_ca_topic_score_codex":0.0012691208,"about_ca_topic_score_gemma":0.0012351783,"teacher_disagreement_score":0.004053812,"about_ca_system_score_codex":0.0016183618,"about_ca_system_score_gemma":0.00096382503,"threshold_uncertainty_score":0.021438897},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6657702,0.002078485,0.15353537,0.0031199402,0.000404835,0.000060523045,0.00041905325,0.0005113811,0.17410024],"genre_scores_gemma":[0.9718561,0.0007490419,0.010029915,0.00022128441,0.00028404596,0.000030288582,0.00017925662,0.0001117386,0.016538316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990175,0.00029377063,0.00006562321,0.0001733151,0.00024840664,0.00020135393],"domain_scores_gemma":[0.9967583,0.0018048888,0.00039686167,0.0003141547,0.00036544033,0.000360354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011401153,0.0005918595,0.0007644114,0.004554572,0.0025576295,0.00437088,0.0009864569,0.0012142366,0.008357671],"category_scores_gemma":[0.007179128,0.00044070248,0.00072224176,0.0033977197,0.004246863,0.007586678,0.0031166123,0.00304384,0.0010549608],"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.000009797541,0.000004850047,0.00014149417,0.000008824193,0.0000010378928,0.000031280426,0.00020750744,0.00019175257,0.00018955149,0.9973985,0.00021384712,0.0016015333],"study_design_scores_gemma":[0.0000035945232,0.0000064180585,0.00013663911,0.000007330841,0.0000027610597,0.000056782243,0.000099472505,0.0016753433,0.00017800614,0.9964238,0.0014038491,0.0000060478314],"about_ca_topic_score_codex":0.0013823385,"about_ca_topic_score_gemma":0.0010655305,"teacher_disagreement_score":0.008357671,"about_ca_system_score_codex":0.0019509502,"about_ca_system_score_gemma":0.0007466719,"threshold_uncertainty_score":0.027959228},"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":"editorial","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029442963,0.15758592,0.0027108626,0.27083835,0.546321,0.000110327645,0.0006706286,0.00018423892,0.021284321],"genre_scores_gemma":[0.008221979,0.26712596,0.0024500303,0.09927189,0.49487072,0.0002107357,0.0016339815,0.0006049308,0.1256097],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99494076,0.0012751268,0.0005010909,0.0005509798,0.0024754766,0.00025658373],"domain_scores_gemma":[0.97016484,0.007453263,0.0016275324,0.0015854172,0.01611132,0.003057569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063582268,0.0008577389,0.0014061079,0.004737284,0.0017998907,0.005421253,0.0024693767,0.0035198377,0.051364653],"category_scores_gemma":[0.04034778,0.0005347048,0.00086708943,0.0031316513,0.003750044,0.0055860565,0.0031519919,0.005942596,0.025436135],"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.0000065528557,0.000003634162,0.00003205817,0.00050818396,0.0000065759127,0.00003444145,0.000046534045,0.00003496088,0.000041800737,0.0060202423,0.9704239,0.022841128],"study_design_scores_gemma":[0.0000029203902,0.000006972539,0.00013997,0.0007858487,0.0000053359863,0.00012523614,0.000039481638,0.000034780867,0.00003649905,0.002417998,0.9963981,0.0000069036337],"about_ca_topic_score_codex":0.002283106,"about_ca_topic_score_gemma":0.0038469543,"teacher_disagreement_score":0.051364653,"about_ca_system_score_codex":0.004062834,"about_ca_system_score_gemma":0.007911695,"threshold_uncertainty_score":0.1718319},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07916544,0.0007636076,0.9132941,0.00071989646,0.000051636005,0.00007146656,0.00018275574,0.00023426498,0.0055167964],"genre_scores_gemma":[0.85759187,0.0012788855,0.13370526,0.0002502671,0.00020900552,0.00019788773,0.00039826683,0.00021744205,0.006151136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989011,0.00025979042,0.000062669955,0.00032983872,0.000327933,0.00011867526],"domain_scores_gemma":[0.99456716,0.0026443216,0.0009068715,0.0007137469,0.0006859423,0.00048190186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019868768,0.0006718699,0.0007983091,0.002615149,0.0010639622,0.0028349403,0.0010693291,0.0015042608,0.0020061687],"category_scores_gemma":[0.009635554,0.00041102993,0.0010750721,0.001231725,0.004619553,0.0046192547,0.002991439,0.0016422888,0.0004375162],"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.00004242582,0.000020514182,0.0012637483,0.00009945648,0.000028266055,0.00021861875,0.00050823786,0.07701121,0.010105729,0.89915925,0.0006653613,0.010877144],"study_design_scores_gemma":[0.00001721734,0.000072528506,0.0014253177,0.000029986735,0.000020178775,0.00029553374,0.00013489896,0.43770424,0.0054070055,0.5485632,0.006280011,0.000049924904],"about_ca_topic_score_codex":0.00166324,"about_ca_topic_score_gemma":0.0009280979,"teacher_disagreement_score":0.0028349403,"about_ca_system_score_codex":0.0019206282,"about_ca_system_score_gemma":0.0007566383,"threshold_uncertainty_score":0.013935208},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8030462,0.00058364455,0.068340845,0.0011876777,0.00033578178,0.00011579622,0.0026974767,0.0006473375,0.12304518],"genre_scores_gemma":[0.93878037,0.0004230629,0.026428942,0.00015068095,0.000097345124,0.00011795667,0.001993952,0.00016596368,0.031841636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931264,0.00008359671,0.000034518293,0.00023412923,0.0001626369,0.00017244914],"domain_scores_gemma":[0.9981918,0.0007570009,0.0002718152,0.00025868535,0.0002916883,0.00022914188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061644963,0.00075694267,0.00040692207,0.001955709,0.0014355062,0.0030316534,0.0012033817,0.0009373003,0.026225844],"category_scores_gemma":[0.001678216,0.00037147768,0.0006967464,0.0015432694,0.0017044303,0.002635276,0.001085114,0.0010664612,0.0026732627],"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.0008169313,0.00022302795,0.019043535,0.000375985,0.0001539491,0.0005333921,0.00091215264,0.011571919,0.039150782,0.83206934,0.013368783,0.0817803],"study_design_scores_gemma":[0.00010712498,0.00032777523,0.037056416,0.00020710629,0.00030098404,0.0016561411,0.001380903,0.06689514,0.04077203,0.736534,0.11455041,0.00021209534],"about_ca_topic_score_codex":0.002157108,"about_ca_topic_score_gemma":0.0044705803,"teacher_disagreement_score":0.026225844,"about_ca_system_score_codex":0.0015280342,"about_ca_system_score_gemma":0.0008507967,"threshold_uncertainty_score":0.08773416},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48204368,0.00033618507,0.5017697,0.00040933545,0.00005729531,0.00006355915,0.00022905298,0.00024136885,0.014849844],"genre_scores_gemma":[0.95704067,0.0001801299,0.037366897,0.00011076081,0.000048691854,0.00005981717,0.00018388349,0.000060382583,0.0049488274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917525,0.00020437164,0.000044866072,0.00018755179,0.00026238034,0.00012549004],"domain_scores_gemma":[0.99809164,0.00068376306,0.00039811115,0.00022020745,0.00037294067,0.00023331745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001548539,0.00044346633,0.00073922414,0.002640241,0.00090748694,0.0027937284,0.0009217603,0.0012239465,0.0038047722],"category_scores_gemma":[0.0052080387,0.00030335956,0.00056863716,0.001144081,0.0018831617,0.0025554565,0.0018867913,0.00091180677,0.0006999209],"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.00016857967,0.000074099305,0.0027282746,0.000059383605,0.000033221593,0.00022977813,0.00020668253,0.052560605,0.00609733,0.91264445,0.00093057175,0.024267],"study_design_scores_gemma":[0.000037970953,0.00017591061,0.0033182388,0.000031513657,0.000017158714,0.00043721433,0.00018786591,0.4907153,0.0041751666,0.4967654,0.0040855086,0.000052696385],"about_ca_topic_score_codex":0.0012293755,"about_ca_topic_score_gemma":0.0004691305,"teacher_disagreement_score":0.0038047722,"about_ca_system_score_codex":0.0016746082,"about_ca_system_score_gemma":0.00043437906,"threshold_uncertainty_score":0.012728214},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17925224,0.0005518866,0.80444264,0.0008492058,0.00006957794,0.00012774942,0.00024418018,0.0006144672,0.01384811],"genre_scores_gemma":[0.8403467,0.00054965535,0.14874892,0.00036103497,0.00017453499,0.00022917023,0.0005742907,0.00045063207,0.00856507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974496,0.00089770014,0.00012641499,0.000549067,0.0007053121,0.0002719446],"domain_scores_gemma":[0.9854702,0.010238652,0.0013829246,0.0017191549,0.0007189406,0.00047014008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026526672,0.000854879,0.0009381531,0.0012484726,0.0013800984,0.0028675662,0.0009726542,0.0014728374,0.0052746],"category_scores_gemma":[0.01924967,0.00088980235,0.0014883612,0.0012326203,0.0043965927,0.006304535,0.004629417,0.0024669594,0.0012171697],"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.00020833875,0.000045601184,0.0014598502,0.0001549712,0.00004316227,0.00042180996,0.0006204795,0.04322742,0.00983752,0.92154545,0.0012179359,0.021217406],"study_design_scores_gemma":[0.000044783395,0.0001517079,0.00076694094,0.000053072465,0.00003005861,0.0006186828,0.00019792496,0.21163969,0.015371465,0.76715434,0.003915364,0.000055969904],"about_ca_topic_score_codex":0.00035673997,"about_ca_topic_score_gemma":0.0002681917,"teacher_disagreement_score":0.0052746,"about_ca_system_score_codex":0.0010952762,"about_ca_system_score_gemma":0.00059088867,"threshold_uncertainty_score":0.0176453},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034772564,0.021546297,0.63520765,0.037207328,0.0021039539,0.00008832889,0.00025532764,0.0005999122,0.26821864],"genre_scores_gemma":[0.8596071,0.009252842,0.10366118,0.0027573463,0.0019485817,0.00015142818,0.0001440216,0.00028075997,0.022196729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978532,0.0010315991,0.000094471216,0.00027525972,0.0006187788,0.00012666058],"domain_scores_gemma":[0.99533796,0.003360675,0.00015069208,0.0007947555,0.00023390539,0.00012207421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032593948,0.0006864821,0.0011821064,0.0009902805,0.0021634889,0.0067416904,0.0022988971,0.0024636972,0.004460918],"category_scores_gemma":[0.009974049,0.00077129283,0.0008273346,0.0017460214,0.017341146,0.016278071,0.0038499285,0.006894383,0.00063385],"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.000003073904,0.000003823602,0.000011451259,0.000014693852,0.0000023274586,0.000009201951,0.000101709295,0.00032484552,0.00006117845,0.9967685,0.0006561775,0.0020431038],"study_design_scores_gemma":[0.000001025762,0.0000010633453,0.0000056551307,0.0000047682192,7.7594746e-7,0.0000052296177,0.000014749527,0.0007684306,0.000032857657,0.99797696,0.0011866189,0.0000019355623],"about_ca_topic_score_codex":0.00080085435,"about_ca_topic_score_gemma":0.0008908521,"teacher_disagreement_score":0.0067416904,"about_ca_system_score_codex":0.0017933795,"about_ca_system_score_gemma":0.0012193943,"threshold_uncertainty_score":0.017237484},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29522994,0.005860847,0.28830928,0.056117598,0.0028823884,0.000037355698,0.0007533048,0.00049678044,0.35031247],"genre_scores_gemma":[0.9099031,0.0021318358,0.03166607,0.0042143865,0.0021296716,0.00007982602,0.0002584578,0.00033476538,0.04928187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992478,0.0001940013,0.00004356618,0.00020275262,0.00022364684,0.000088343724],"domain_scores_gemma":[0.99651283,0.0022982345,0.00019163181,0.00040579482,0.0003533594,0.00023809083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018429188,0.0006719262,0.0007360469,0.001697884,0.0016279691,0.0019901092,0.0014328811,0.0017047501,0.014313424],"category_scores_gemma":[0.0064964322,0.00029175283,0.0007034755,0.001293411,0.004853742,0.0051409057,0.002975956,0.0029502357,0.0008536458],"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.00001955032,0.000007303052,0.00046868352,0.000034679833,0.0000063409966,0.000114354276,0.00028537237,0.00082151627,0.0006599583,0.98936146,0.0038603279,0.004360397],"study_design_scores_gemma":[0.0000061097467,0.000010134592,0.0009709748,0.000021459657,0.0000063051884,0.00010404866,0.00016548528,0.0030029153,0.00030125427,0.9883333,0.0070633455,0.000014696706],"about_ca_topic_score_codex":0.00095171784,"about_ca_topic_score_gemma":0.00088755245,"teacher_disagreement_score":0.014313424,"about_ca_system_score_codex":0.0007381447,"about_ca_system_score_gemma":0.00020899386,"threshold_uncertainty_score":0.047883213},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20553519,0.0021016202,0.735371,0.001880772,0.0005020179,0.00004754182,0.00051985244,0.0004936936,0.0535484],"genre_scores_gemma":[0.8987963,0.0010820035,0.08766504,0.00035260542,0.00086117466,0.00013646211,0.00056308636,0.00031380943,0.0102296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982059,0.00040554124,0.000112767506,0.00032285132,0.0007463581,0.00020652731],"domain_scores_gemma":[0.9951656,0.0019130331,0.0006320382,0.0005902098,0.0010195251,0.00067959557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018859135,0.0007086175,0.0005962827,0.0026420737,0.0008510886,0.0024321978,0.001236226,0.00077989796,0.0043890136],"category_scores_gemma":[0.0082350895,0.00029419884,0.00061492395,0.0009936511,0.004504724,0.007208535,0.0038313442,0.0019519215,0.0007661924],"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.000046063167,0.000017922643,0.0007614891,0.00006820457,0.000012737378,0.000059298094,0.00018038692,0.0030993966,0.004128824,0.9786381,0.00072143105,0.012266011],"study_design_scores_gemma":[0.000006812667,0.00007890772,0.0012226724,0.00002977155,0.000011960185,0.0002447357,0.00014753082,0.026704373,0.004140407,0.96052545,0.0068631577,0.000024270275],"about_ca_topic_score_codex":0.00026290474,"about_ca_topic_score_gemma":0.00026501445,"teacher_disagreement_score":0.0043890136,"about_ca_system_score_codex":0.00070877624,"about_ca_system_score_gemma":0.0004333061,"threshold_uncertainty_score":0.01468271},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049444695,0.21490738,0.0027128067,0.32073045,0.4362234,0.00009449942,0.00045741128,0.00011724818,0.024262276],"genre_scores_gemma":[0.012576026,0.33529213,0.0025359646,0.08831104,0.44118398,0.00014020862,0.00096869137,0.0004102965,0.11858164],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99577445,0.0011966288,0.0003749185,0.00045389245,0.001997809,0.00020234867],"domain_scores_gemma":[0.97769606,0.005516851,0.0012320381,0.0010246375,0.012185807,0.0023445634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052736467,0.00069594407,0.0010999212,0.0041206307,0.0016031945,0.0047005024,0.0019536475,0.0030540265,0.029774636],"category_scores_gemma":[0.031203324,0.00047938127,0.0005328468,0.002752619,0.0040467167,0.005660574,0.002648976,0.0048212195,0.012910182],"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.000008217513,0.000004491674,0.000052438154,0.0005791497,0.0000075249804,0.000038562135,0.00006700741,0.00005039034,0.00007913539,0.013264911,0.95463896,0.031209191],"study_design_scores_gemma":[0.0000038009132,0.000009062901,0.00023513241,0.0007301662,0.0000061721153,0.00015576914,0.000055440916,0.000047068883,0.000051521318,0.004686236,0.9940111,0.000008577195],"about_ca_topic_score_codex":0.0022334121,"about_ca_topic_score_gemma":0.0044861035,"teacher_disagreement_score":0.029774636,"about_ca_system_score_codex":0.003362398,"about_ca_system_score_gemma":0.0070528006,"threshold_uncertainty_score":0.0996061},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31190315,0.00020371414,0.68474424,0.00031640587,0.000015019742,0.000025645551,0.00021089954,0.00038773273,0.00219318],"genre_scores_gemma":[0.9730477,0.00012537003,0.026041443,0.000028913142,0.000015935575,0.000019512947,0.00014559775,0.00006688149,0.0005085928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999616,0.00014193186,0.000019369902,0.00009499909,0.00009445769,0.00003313725],"domain_scores_gemma":[0.99770147,0.0009728947,0.00045407354,0.00047807113,0.00022460787,0.00016887885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008709373,0.0005243524,0.00042322098,0.0015151341,0.000365081,0.0010526483,0.00058043987,0.00073874876,0.00079816265],"category_scores_gemma":[0.008462151,0.00035975757,0.00046710556,0.00056884775,0.0019408312,0.0021055068,0.0017181819,0.0008868107,0.00019833902],"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.00013095126,0.00003229226,0.016305968,0.00011233098,0.000108527114,0.00022957406,0.00059071946,0.68265,0.025652852,0.22860476,0.0010250096,0.04455699],"study_design_scores_gemma":[0.0000029610212,0.0000306034,0.0056476607,0.000009931169,0.000008758294,0.00011381848,0.000047389218,0.8979603,0.0031353175,0.09235638,0.00065692374,0.000029983214],"about_ca_topic_score_codex":0.0014390519,"about_ca_topic_score_gemma":0.0013182635,"teacher_disagreement_score":0.0015151341,"about_ca_system_score_codex":0.00090782857,"about_ca_system_score_gemma":0.00034173572,"threshold_uncertainty_score":0.0065867305},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7689163,0.0011728642,0.092364244,0.0013763962,0.00014545894,0.000050582417,0.00018373814,0.0002810176,0.13550934],"genre_scores_gemma":[0.9845532,0.00033425752,0.0040551163,0.00007786769,0.000077212295,0.000014597944,0.000062977626,0.00003625832,0.010788407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994116,0.00007558269,0.00002236147,0.00015286742,0.00022578082,0.000111770576],"domain_scores_gemma":[0.99904746,0.00023366675,0.00016215025,0.00017418177,0.00017293096,0.00020950407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055796915,0.00041592514,0.0003599193,0.0018014883,0.0017284252,0.0015618028,0.0006200307,0.0007553851,0.0067364946],"category_scores_gemma":[0.0027854394,0.0002982981,0.00035775796,0.0008051985,0.0032790068,0.0035455667,0.0022944196,0.0014622165,0.00054050854],"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.00001568089,0.000005215752,0.00051443564,0.00001951807,0.0000032224862,0.00018217538,0.00028482717,0.00068084383,0.0010171782,0.9927913,0.00020213745,0.0042834985],"study_design_scores_gemma":[0.0000143816405,0.000061458035,0.0019850724,0.00002746912,0.000011522596,0.00075714046,0.00025071445,0.0076533994,0.0024924888,0.97919387,0.007531806,0.000020732721],"about_ca_topic_score_codex":0.0022196716,"about_ca_topic_score_gemma":0.0016399738,"teacher_disagreement_score":0.0067364946,"about_ca_system_score_codex":0.0007703207,"about_ca_system_score_gemma":0.00037236445,"threshold_uncertainty_score":0.022535801},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74685204,0.00061044964,0.21204852,0.0067209657,0.00017235182,0.00028507184,0.0029816963,0.0030747647,0.02725412],"genre_scores_gemma":[0.956369,0.0003934319,0.029572312,0.00090275274,0.00020310572,0.00015901348,0.0031869295,0.00073210057,0.008481391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951865,0.00092809036,0.00042923487,0.0016903684,0.000986434,0.00077941065],"domain_scores_gemma":[0.9444982,0.04086083,0.0037248028,0.005953552,0.0014677405,0.0034948396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028985431,0.002041011,0.0032123898,0.0018567629,0.003731974,0.009363857,0.0039823004,0.0048625255,0.015413519],"category_scores_gemma":[0.029520638,0.0027298022,0.0029489389,0.0024580387,0.004345626,0.023157295,0.00682053,0.008306177,0.0023802854],"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.005831688,0.0016561088,0.018484004,0.0019167841,0.00072274654,0.0033455177,0.004004763,0.07295468,0.039973967,0.77068055,0.019574614,0.060854558],"study_design_scores_gemma":[0.00024322305,0.00013537453,0.00093170267,0.00007122235,0.00012365339,0.00061862415,0.0006803856,0.07346383,0.00711356,0.91429,0.0022664203,0.00006206338],"about_ca_topic_score_codex":0.0013362494,"about_ca_topic_score_gemma":0.0014685014,"teacher_disagreement_score":0.015413519,"about_ca_system_score_codex":0.0017571888,"about_ca_system_score_gemma":0.0013721681,"threshold_uncertainty_score":0.051563382},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90355253,0.00046749538,0.08869034,0.0003057114,0.000029953035,0.000014626509,0.00016789419,0.0001446236,0.006626838],"genre_scores_gemma":[0.9957178,0.00014811424,0.0032805721,0.000024188186,0.000075141856,0.00002017113,0.00013349942,0.00001819132,0.0005823066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992774,0.00018841504,0.000035776706,0.00018337081,0.00017149333,0.0001435234],"domain_scores_gemma":[0.9916244,0.004637418,0.0020431627,0.0007832941,0.00035924782,0.0005525174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014334011,0.00047726458,0.0008130818,0.0046425886,0.0008358461,0.0025148236,0.0007792572,0.00057428214,0.0022843892],"category_scores_gemma":[0.011746056,0.00035771294,0.00042043248,0.0021477481,0.004356591,0.003799457,0.0013675835,0.0009604508,0.00021844191],"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.00011706027,0.000047456026,0.018133678,0.00006863981,0.00004562152,0.0002330347,0.00038880383,0.01758951,0.004018596,0.948155,0.0007011464,0.010501441],"study_design_scores_gemma":[0.000016895274,0.00008476439,0.01527225,0.000030161795,0.00003222443,0.00041994947,0.00028948684,0.1231034,0.003167949,0.8561869,0.0013451845,0.000050733768],"about_ca_topic_score_codex":0.00035584683,"about_ca_topic_score_gemma":0.00023374526,"teacher_disagreement_score":0.0046425886,"about_ca_system_score_codex":0.00089526875,"about_ca_system_score_gemma":0.00026227132,"threshold_uncertainty_score":0.0076420307},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35628915,0.00022231875,0.6301664,0.00029180528,0.000034143664,0.00009760104,0.0014570685,0.0018757636,0.009565719],"genre_scores_gemma":[0.8601611,0.0001054225,0.13505916,0.00004125043,0.000039946226,0.00012715011,0.0020440358,0.00023810085,0.0021837489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886346,0.00011737954,0.00008386377,0.00028423342,0.000520617,0.00013054197],"domain_scores_gemma":[0.9958187,0.0019093977,0.0006117366,0.000855434,0.0005850144,0.00021977408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009755219,0.0006547057,0.00064986385,0.0025766923,0.0008368121,0.0018691613,0.0014964353,0.00069272687,0.006311248],"category_scores_gemma":[0.011426384,0.00034248488,0.0007509195,0.0016924582,0.0014656871,0.0057984157,0.0030969984,0.0012019897,0.00081914995],"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.00041559304,0.00013605424,0.020300573,0.00039397235,0.000073060815,0.00021659525,0.00053618214,0.20339131,0.020710746,0.60534334,0.0041117966,0.14437085],"study_design_scores_gemma":[0.000016534443,0.0000835078,0.003234531,0.000024581752,0.000015723232,0.00009666919,0.0001152157,0.5285757,0.011296502,0.4530023,0.003515183,0.00002349971],"about_ca_topic_score_codex":0.0014494868,"about_ca_topic_score_gemma":0.0022507238,"teacher_disagreement_score":0.006311248,"about_ca_system_score_codex":0.0015754378,"about_ca_system_score_gemma":0.0006043498,"threshold_uncertainty_score":0.021113217},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52355707,0.0013590679,0.37133747,0.0023789136,0.00027239276,0.000099400844,0.00038229852,0.0004804046,0.10013297],"genre_scores_gemma":[0.97028345,0.00042210898,0.018327286,0.0003166734,0.00021781027,0.0000858717,0.00021233191,0.000105576066,0.010028836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937856,0.00010099906,0.000033748438,0.00014528491,0.00018531608,0.00015600507],"domain_scores_gemma":[0.9981766,0.00063341635,0.00021872128,0.000289639,0.00033307564,0.00034858886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012344591,0.00041322727,0.00052146974,0.0025881417,0.0013015418,0.0024055156,0.00074872404,0.00093578023,0.006909398],"category_scores_gemma":[0.0040863925,0.00023827211,0.00060199137,0.00080438284,0.0028359918,0.0063499296,0.0034134407,0.0017917004,0.0006112832],"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.0000037601512,0.000006267908,0.00023802869,0.00001470137,0.000002270742,0.000052955605,0.00014606223,0.00034583744,0.0010620647,0.9963231,0.00019648974,0.0016084346],"study_design_scores_gemma":[0.000007643658,0.000031444168,0.00071419665,0.000026467585,0.000007034292,0.00018687468,0.00022898415,0.0086002,0.0014597824,0.9825017,0.0062240046,0.000011740071],"about_ca_topic_score_codex":0.00066511036,"about_ca_topic_score_gemma":0.00066955015,"teacher_disagreement_score":0.006909398,"about_ca_system_score_codex":0.0012035703,"about_ca_system_score_gemma":0.0005919732,"threshold_uncertainty_score":0.023114264},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7493494,0.0007351464,0.24054419,0.00051246467,0.000026023774,0.000044449458,0.00034338562,0.00023349251,0.008211404],"genre_scores_gemma":[0.9866411,0.00028574842,0.011641715,0.000055760207,0.00003537422,0.000036282854,0.00017830456,0.000029455472,0.0010963591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930406,0.00018588724,0.000043684588,0.0001945705,0.00015764433,0.00011413409],"domain_scores_gemma":[0.99471843,0.0021924935,0.0014326355,0.00047765058,0.0005936276,0.000585158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096984114,0.00038166085,0.0004320234,0.0033814718,0.0010147861,0.0024265803,0.0006413476,0.0008008448,0.0024319722],"category_scores_gemma":[0.0069064675,0.0003912251,0.0005097759,0.0011858292,0.0022643565,0.004550894,0.0016523013,0.00084872544,0.0003100141],"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.0001400668,0.000090144174,0.021321239,0.00022619814,0.000116026575,0.0005616935,0.0021079865,0.13088457,0.012377886,0.80394423,0.0014666833,0.02676318],"study_design_scores_gemma":[0.000012874833,0.000055512894,0.012608118,0.00004707923,0.00003671303,0.00043332283,0.000650876,0.33774596,0.0016631078,0.6436141,0.0030817804,0.000050420713],"about_ca_topic_score_codex":0.0012008002,"about_ca_topic_score_gemma":0.00093587965,"teacher_disagreement_score":0.0033814718,"about_ca_system_score_codex":0.00090345676,"about_ca_system_score_gemma":0.00029573712,"threshold_uncertainty_score":0.008135736},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5741732,0.00036497344,0.42147124,0.00016365126,0.000012086853,0.00004165475,0.0008128341,0.0008154254,0.002144895],"genre_scores_gemma":[0.9471263,0.0002632595,0.050959647,0.00001791042,0.000014596705,0.000022264641,0.0008762597,0.000060203856,0.00065948896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974984,0.00006682251,0.0000143891675,0.000061677485,0.00008181349,0.000025507074],"domain_scores_gemma":[0.9986212,0.00032827817,0.0005139171,0.00022459631,0.00018446092,0.0001274958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045657152,0.0003785139,0.00034975738,0.0035004301,0.00021785434,0.0009046329,0.000301874,0.00030864892,0.00070247194],"category_scores_gemma":[0.0022600202,0.00019316195,0.00029237266,0.0012912934,0.0008290475,0.001182732,0.0007529354,0.00042266562,0.00034332846],"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.0006687008,0.00017801835,0.104842134,0.00041184123,0.00019529734,0.00042586276,0.00073003076,0.3215334,0.1583944,0.09663715,0.004101576,0.31188166],"study_design_scores_gemma":[0.00000875301,0.000074797135,0.016315151,0.000019350557,0.000017122597,0.00021662803,0.00009098501,0.92906874,0.01689715,0.0352594,0.0019911341,0.000040785693],"about_ca_topic_score_codex":0.0009339076,"about_ca_topic_score_gemma":0.0013358212,"teacher_disagreement_score":0.0035004301,"about_ca_system_score_codex":0.00042770198,"about_ca_system_score_gemma":0.0003455319,"threshold_uncertainty_score":0.0031032562},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019517096,0.000307262,0.97563213,0.0007922049,0.0000761548,0.000049839055,0.00015731485,0.00014203879,0.003325888],"genre_scores_gemma":[0.7936043,0.0013140874,0.18072128,0.001339863,0.0005420327,0.0006188744,0.00095414266,0.0004973018,0.020408075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99447364,0.0025921161,0.00031964493,0.00083678163,0.0014145827,0.0003633209],"domain_scores_gemma":[0.9774606,0.016029593,0.0019494753,0.0012872018,0.0026501257,0.00062309747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010242374,0.0010866869,0.0015731488,0.0025107875,0.0008212336,0.0023690804,0.0021490555,0.0023680034,0.0044536367],"category_scores_gemma":[0.050086506,0.00074777316,0.0012974396,0.0011271681,0.005429685,0.0053745974,0.0043033315,0.0033020459,0.00080104935],"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.000049592716,0.000025120433,0.0016861621,0.000075830736,0.000044676905,0.00014443793,0.0001674195,0.06731703,0.0013205556,0.9169136,0.001133679,0.0111218635],"study_design_scores_gemma":[0.00001704555,0.00004240143,0.00074115477,0.000039360664,0.000015280391,0.00009381152,0.000044267726,0.6341459,0.00093042257,0.3627737,0.0011013682,0.000055329692],"about_ca_topic_score_codex":0.0028735648,"about_ca_topic_score_gemma":0.0017615117,"teacher_disagreement_score":0.010242374,"about_ca_system_score_codex":0.0021570318,"about_ca_system_score_gemma":0.0016545636,"threshold_uncertainty_score":0.05416751},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0712209,0.00070290425,0.90456516,0.000503255,0.00022388774,0.0001973074,0.010671654,0.0049725487,0.0069424063],"genre_scores_gemma":[0.55257034,0.0011465885,0.426041,0.00013769424,0.00020592744,0.00040365706,0.015130098,0.0006710832,0.003693597],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863774,0.00025964293,0.00015541931,0.00029667682,0.0005479751,0.00010251],"domain_scores_gemma":[0.99569416,0.001436153,0.00069819216,0.00091053295,0.0010253255,0.00023564356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013212407,0.0007742388,0.0006897328,0.012617455,0.0008307592,0.002956237,0.0008357168,0.00065249583,0.007813774],"category_scores_gemma":[0.0067123463,0.0002630672,0.0011076243,0.0064438637,0.001235092,0.0038847497,0.0016679562,0.0008602779,0.002213519],"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.0007269573,0.0003001517,0.037400328,0.0020931019,0.00039437495,0.00081920665,0.0018019291,0.03507771,0.07977789,0.19706248,0.019519491,0.62502646],"study_design_scores_gemma":[0.00008339973,0.0017125974,0.053909525,0.0005077117,0.00040387464,0.005081106,0.0040355837,0.40029302,0.07826729,0.304709,0.15058634,0.00041054198],"about_ca_topic_score_codex":0.000732849,"about_ca_topic_score_gemma":0.0004271079,"teacher_disagreement_score":0.012617455,"about_ca_system_score_codex":0.000684098,"about_ca_system_score_gemma":0.0006579314,"threshold_uncertainty_score":0.026139677},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026534403,0.00028176836,0.9677009,0.0009402007,0.000041683965,0.00004286842,0.000036694066,0.00014436668,0.004277176],"genre_scores_gemma":[0.8300318,0.00027777467,0.16630231,0.00029579015,0.00009941438,0.0001948809,0.000090953596,0.00009351335,0.0026135023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99407226,0.0026817918,0.00035635283,0.0013519205,0.0011340913,0.00040362985],"domain_scores_gemma":[0.9804176,0.015574203,0.0011469945,0.0015309706,0.00084756187,0.00048257515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009672222,0.0006677429,0.001218831,0.0013749733,0.001981271,0.0034973293,0.0030007588,0.0023274713,0.002376389],"category_scores_gemma":[0.026575167,0.00077981217,0.00209424,0.0008771493,0.0059379805,0.007208341,0.0056938683,0.00301321,0.00021895488],"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.00004485861,0.00002579605,0.0012697642,0.00010000602,0.00009151051,0.00024718986,0.0013118018,0.09134891,0.00082833023,0.8904584,0.0003636352,0.013909763],"study_design_scores_gemma":[0.00001198305,0.000017354281,0.00018630335,0.00002153761,0.000022343775,0.000055367913,0.00013815846,0.3434117,0.00045841967,0.65435576,0.0012977276,0.000023331902],"about_ca_topic_score_codex":0.0032312556,"about_ca_topic_score_gemma":0.0026246307,"teacher_disagreement_score":0.009672222,"about_ca_system_score_codex":0.0022957504,"about_ca_system_score_gemma":0.0016885648,"threshold_uncertainty_score":0.05115223},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7444197,0.003934873,0.18332548,0.008599292,0.00028151897,0.00009362981,0.0009373403,0.00069155026,0.05771666],"genre_scores_gemma":[0.9847408,0.0011567161,0.0072563877,0.0005170799,0.00037463862,0.00014626935,0.0005575122,0.00019949376,0.0050511463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792385,0.00066582224,0.00006872857,0.0004402449,0.00052065385,0.00038057534],"domain_scores_gemma":[0.9610134,0.027043099,0.0027753434,0.0033257958,0.0021667716,0.0036754776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037724446,0.0010578744,0.0022126155,0.0046184505,0.002391326,0.0045000906,0.0035556466,0.0020949228,0.006845496],"category_scores_gemma":[0.032669276,0.0009776736,0.00087083946,0.0018590478,0.006917698,0.008870605,0.0061300886,0.004130297,0.0008698044],"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.00013224698,0.0000710807,0.004589659,0.0001301227,0.000045005756,0.00022288124,0.0004953937,0.022052715,0.0021926097,0.9597046,0.0038247104,0.0065390165],"study_design_scores_gemma":[0.000038080805,0.000056024717,0.0026330363,0.000075640906,0.000031801563,0.00030722487,0.00017396323,0.16781834,0.0013722106,0.8248432,0.0025919431,0.000058514346],"about_ca_topic_score_codex":0.0010786683,"about_ca_topic_score_gemma":0.0012663908,"teacher_disagreement_score":0.006845496,"about_ca_system_score_codex":0.0028940414,"about_ca_system_score_gemma":0.0008680451,"threshold_uncertainty_score":0.022900522},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20648359,0.00148794,0.7682571,0.0069999504,0.00018004254,0.00009373948,0.00027347638,0.00070175965,0.015522519],"genre_scores_gemma":[0.7632802,0.0006534099,0.23240942,0.00046528646,0.00018657994,0.000105251114,0.00017402892,0.0002496658,0.0024762442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828976,0.0005675346,0.00007447154,0.0002649487,0.0006299353,0.00017333591],"domain_scores_gemma":[0.98726594,0.009165741,0.00041967919,0.0022566272,0.000638051,0.00025407667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033293525,0.00049583573,0.00081135356,0.0014279982,0.0010240824,0.0032060896,0.0014901742,0.0013924709,0.005139826],"category_scores_gemma":[0.016537527,0.0004380055,0.0008232123,0.0016543438,0.004663746,0.007879845,0.0024985727,0.0031143436,0.0005597272],"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.00019142691,0.0000695109,0.0010651174,0.000117203315,0.000031742024,0.00007443973,0.00015876522,0.04191394,0.006303442,0.9004135,0.0022753295,0.04738538],"study_design_scores_gemma":[0.000029422317,0.00004759318,0.00027802069,0.000015266207,0.000013739961,0.000051325424,0.00005105842,0.2680668,0.005936133,0.722269,0.0032212804,0.000020285403],"about_ca_topic_score_codex":0.0005937065,"about_ca_topic_score_gemma":0.000804953,"teacher_disagreement_score":0.005139826,"about_ca_system_score_codex":0.0018618292,"about_ca_system_score_gemma":0.0010360768,"threshold_uncertainty_score":0.01760751},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8359316,0.0004778,0.13970023,0.00017213421,0.000095973366,0.00005645901,0.00031597013,0.0004661882,0.02278371],"genre_scores_gemma":[0.9852084,0.00021312972,0.008396621,0.00005718655,0.00011041503,0.000058182246,0.00038713845,0.00013477737,0.0054341573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864405,0.0001519121,0.00008522731,0.00033255605,0.00047726216,0.00030901734],"domain_scores_gemma":[0.9980415,0.00046703016,0.00053232216,0.00027456807,0.00031944478,0.00036512665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007794437,0.0005963126,0.00043701916,0.003141877,0.0007230937,0.0027160612,0.00076243374,0.0005093237,0.004081141],"category_scores_gemma":[0.002336785,0.0003484443,0.0009170639,0.0010451827,0.0029952317,0.0048390124,0.0025629764,0.0014916835,0.0005465575],"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.00008395563,0.000073614196,0.0027951056,0.000080177364,0.00003110141,0.0004160267,0.0014119698,0.0032943345,0.009422198,0.96424127,0.00050393125,0.017646348],"study_design_scores_gemma":[0.000028426073,0.00019819492,0.005182377,0.000052717245,0.000055246193,0.00077918434,0.0008618519,0.020619392,0.014707711,0.9496647,0.0077771475,0.000073001735],"about_ca_topic_score_codex":0.00045917192,"about_ca_topic_score_gemma":0.00029250287,"teacher_disagreement_score":0.004081141,"about_ca_system_score_codex":0.0008608966,"about_ca_system_score_gemma":0.0004344973,"threshold_uncertainty_score":0.013652742},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18949455,0.003348738,0.7640962,0.0053892187,0.00025262192,0.000119189564,0.0016881307,0.00067541364,0.034935925],"genre_scores_gemma":[0.87787944,0.0019107499,0.11349521,0.000407133,0.00039071124,0.0002414577,0.0014143318,0.00027085104,0.0039901603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975407,0.000901737,0.00016275777,0.0006345414,0.00060860376,0.00015155971],"domain_scores_gemma":[0.99060714,0.0040048384,0.0014718345,0.001926696,0.0012828107,0.000706616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020136903,0.00050344714,0.0008646465,0.0044800364,0.0014941955,0.006543154,0.0011056835,0.0012841694,0.003944987],"category_scores_gemma":[0.013968662,0.0005991708,0.0011153951,0.0024712933,0.009263828,0.008083603,0.004269633,0.0027267651,0.0009652849],"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.00007525219,0.000014321003,0.0015423938,0.0001385103,0.000041103656,0.0001348524,0.0006071588,0.008755707,0.0034507613,0.95887506,0.0016303445,0.024734473],"study_design_scores_gemma":[0.000009303101,0.000025200672,0.0011340661,0.000026321193,0.000010850878,0.00016705044,0.00013284008,0.021488324,0.0007631504,0.9699901,0.006233029,0.00001971355],"about_ca_topic_score_codex":0.0007722843,"about_ca_topic_score_gemma":0.00047538397,"teacher_disagreement_score":0.006543154,"about_ca_system_score_codex":0.0013735755,"about_ca_system_score_gemma":0.00082848134,"threshold_uncertainty_score":0.013197303},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075898217,0.000039088412,0.9877753,0.00010128373,0.00007996768,0.00006265665,0.00011606956,0.001626794,0.0026088732],"genre_scores_gemma":[0.052274913,0.000042558182,0.9449523,0.000050068953,0.000024451627,0.0003238809,0.00026504768,0.0006363383,0.0014304526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990792,0.0002415415,0.000076301076,0.00014211805,0.00036951283,0.00009118223],"domain_scores_gemma":[0.9979056,0.00078220904,0.000118799195,0.00058026816,0.00049302826,0.00012000473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014688616,0.0006988145,0.00087361655,0.0011429437,0.00088067964,0.0010829458,0.0027148048,0.0015465292,0.009463673],"category_scores_gemma":[0.006710026,0.0006648024,0.0011043572,0.0013027691,0.0010440283,0.001943469,0.0019702644,0.0021766163,0.0023853453],"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.0002509099,0.0001382179,0.0016163295,0.00016462788,0.000110000896,0.00024547795,0.0003501323,0.61845666,0.01401907,0.23846583,0.006864676,0.11931802],"study_design_scores_gemma":[0.000055284436,0.000015681037,0.00006845055,0.000005998474,0.000005593603,0.000025958732,0.000009814496,0.9713509,0.0017662505,0.022237435,0.0044434797,0.000015049647],"about_ca_topic_score_codex":0.0038985983,"about_ca_topic_score_gemma":0.0047169253,"teacher_disagreement_score":0.009463673,"about_ca_system_score_codex":0.0011452581,"about_ca_system_score_gemma":0.0013700044,"threshold_uncertainty_score":0.031659126},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.829576,0.00038099504,0.08470923,0.0019300296,0.00051213655,0.00013592081,0.0003250409,0.0006207207,0.0818099],"genre_scores_gemma":[0.9532662,0.00015702497,0.008141991,0.0004848407,0.00021104925,0.00012912901,0.0002280803,0.00036768016,0.037014112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987153,0.00031550604,0.00004254293,0.0002075481,0.00037923493,0.00034001272],"domain_scores_gemma":[0.9977477,0.00085580547,0.00031736304,0.00022717714,0.0002488005,0.00060314586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008920702,0.00085950276,0.00076858513,0.0022859853,0.00153149,0.0038681875,0.0012354848,0.0018137255,0.0154507],"category_scores_gemma":[0.0036100617,0.0006183482,0.0006617259,0.00090407673,0.0027965952,0.0027124176,0.0027452414,0.0014290056,0.0018218689],"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.000080581136,0.000034824927,0.0001833996,0.000020693406,0.0000070587093,0.00013508732,0.00018363116,0.0010929684,0.0020504459,0.9919338,0.0016690422,0.0026084606],"study_design_scores_gemma":[0.00006130683,0.00006431485,0.0004798301,0.000016246799,0.000011041825,0.00023747924,0.00019223733,0.020375976,0.0028830448,0.9718898,0.0037503056,0.000038452927],"about_ca_topic_score_codex":0.00089880906,"about_ca_topic_score_gemma":0.00091597455,"teacher_disagreement_score":0.0154507,"about_ca_system_score_codex":0.0010710403,"about_ca_system_score_gemma":0.0006310633,"threshold_uncertainty_score":0.051687717},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026529862,0.0024439986,0.4380178,0.0009840376,0.0015575581,0.00048109266,0.12159017,0.42489296,0.007379491],"genre_scores_gemma":[0.042130712,0.0024540422,0.58109546,0.001783527,0.0007439886,0.005121219,0.115498394,0.23401596,0.017156707],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959688,0.0014873121,0.00038297477,0.0009734655,0.0008697093,0.00031776243],"domain_scores_gemma":[0.9805878,0.014395276,0.00093650364,0.0022725917,0.0013582112,0.00044964626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057376623,0.003943093,0.003976415,0.0039498014,0.0009942093,0.004117098,0.005338398,0.0016744193,0.14549538],"category_scores_gemma":[0.03468635,0.0018846187,0.004997471,0.003307153,0.0011430151,0.0041289045,0.004405079,0.0050679147,0.096867904],"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.00081830105,0.00012136588,0.005113553,0.005162085,0.002125396,0.0004890439,0.00039035146,0.009297431,0.0019266322,0.019046359,0.82556874,0.1299408],"study_design_scores_gemma":[0.0009113989,0.00025384632,0.0047677797,0.00093012204,0.0009773799,0.0008557473,0.0001949257,0.068863936,0.005996529,0.13684459,0.77906406,0.00033971464],"about_ca_topic_score_codex":0.0030826323,"about_ca_topic_score_gemma":0.0053016837,"teacher_disagreement_score":0.14549538,"about_ca_system_score_codex":0.0010164654,"about_ca_system_score_gemma":0.0041597425,"threshold_uncertainty_score":0.48673058},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009362023,0.0003007339,0.012208767,0.0005422901,0.00050429243,0.00042201285,0.9325095,0.03337666,0.010773691],"genre_scores_gemma":[0.008250907,0.00011362739,0.018791564,0.00029915426,0.000030178806,0.000646445,0.96522295,0.0027051864,0.003939897],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975007,0.00028163646,0.0003304637,0.0008179574,0.0008068401,0.00026242572],"domain_scores_gemma":[0.99517655,0.0009003398,0.00020249639,0.0023514973,0.0011578968,0.00021124196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018401929,0.0023325612,0.0009790321,0.0024196096,0.00095786917,0.0015984076,0.0034507578,0.0023932036,0.067929655],"category_scores_gemma":[0.012522882,0.0009104121,0.0018374344,0.0035634725,0.0005488011,0.0024584467,0.002137895,0.0037222109,0.08623812],"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.0006063665,0.00057016447,0.0048929453,0.0010327408,0.00007609736,0.00012591777,0.00007622717,0.0029802588,0.005286929,0.0038854855,0.93606466,0.044402298],"study_design_scores_gemma":[0.00045706215,0.00026138374,0.007856337,0.0002209048,0.0000716505,0.0004860376,0.00017504164,0.02679506,0.026475744,0.0122197885,0.92487735,0.00010349226],"about_ca_topic_score_codex":0.0033044412,"about_ca_topic_score_gemma":0.0054549295,"teacher_disagreement_score":0.067929655,"about_ca_system_score_codex":0.0010069703,"about_ca_system_score_gemma":0.0015141368,"threshold_uncertainty_score":0.22724736},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006337624,0.0003735199,0.009480321,0.0005580541,0.0006006524,0.00048080023,0.934346,0.036264103,0.011558975],"genre_scores_gemma":[0.0072529195,0.00012371752,0.015814262,0.0003427551,0.000036976024,0.0006910848,0.96879745,0.0025915566,0.00434931],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973181,0.00028700806,0.00030015007,0.00096672494,0.000810297,0.00031768775],"domain_scores_gemma":[0.9961945,0.0006228905,0.00015282126,0.0017897431,0.0010612046,0.00017887996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018362507,0.0030394313,0.0011614077,0.0025080328,0.0009639091,0.0019285961,0.004524489,0.0026633916,0.08379071],"category_scores_gemma":[0.013749341,0.0009938669,0.002448619,0.0037127854,0.0005669265,0.0030276447,0.002383518,0.004253682,0.10187255],"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.00042790367,0.00031594123,0.002128342,0.00077717646,0.00007628939,0.00007835749,0.00003839625,0.0032252464,0.0024127588,0.0027522228,0.9527912,0.03497621],"study_design_scores_gemma":[0.0005774596,0.00028015106,0.0052965665,0.00025726354,0.00007774975,0.00038226106,0.00016893604,0.035314728,0.017697517,0.01429897,0.9255432,0.00010521808],"about_ca_topic_score_codex":0.0054826066,"about_ca_topic_score_gemma":0.009460366,"teacher_disagreement_score":0.08379071,"about_ca_system_score_codex":0.0014282573,"about_ca_system_score_gemma":0.0018840457,"threshold_uncertainty_score":0.2803079},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068393755,0.0003716887,0.0065023247,0.00057505665,0.0004997175,0.00038271246,0.9471535,0.027327083,0.010348464],"genre_scores_gemma":[0.0063555306,0.000114520604,0.011515417,0.00029454145,0.000028050674,0.00051403535,0.97621197,0.0018877278,0.0030782854],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964713,0.00043166647,0.00041873357,0.0011387216,0.0011398648,0.00039971783],"domain_scores_gemma":[0.9940905,0.0009369346,0.00023812261,0.0029598048,0.0015053703,0.00026930537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020874527,0.0027904715,0.0011297286,0.0029704846,0.0011870199,0.0020229493,0.0042778896,0.002606742,0.06688227],"category_scores_gemma":[0.015385265,0.0009576953,0.0022317753,0.004921812,0.00062819547,0.003296506,0.0025305154,0.0043711993,0.08393658],"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.0003875827,0.00038769195,0.0025651439,0.000837822,0.00007095109,0.000072192364,0.000045577377,0.002597036,0.0028018744,0.0030160889,0.9605985,0.026619487],"study_design_scores_gemma":[0.00058849633,0.00029135792,0.007343279,0.00027977777,0.00007698204,0.00040874348,0.0002049222,0.025616683,0.018634,0.014821253,0.9316251,0.00010939017],"about_ca_topic_score_codex":0.00593056,"about_ca_topic_score_gemma":0.009377269,"teacher_disagreement_score":0.06688227,"about_ca_system_score_codex":0.001499485,"about_ca_system_score_gemma":0.0020467786,"threshold_uncertainty_score":0.2237435},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012802085,0.0003910901,0.016830929,0.0005751636,0.00058132823,0.00053096266,0.92680055,0.029036261,0.012451616],"genre_scores_gemma":[0.013395002,0.00014734936,0.02405466,0.00034253058,0.000037193484,0.000955191,0.95381385,0.0021944055,0.0050598197],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99806863,0.0002253721,0.00022854861,0.00069037697,0.00057505135,0.00021204524],"domain_scores_gemma":[0.9965334,0.00068737444,0.00014212914,0.0016055354,0.000876026,0.00015557533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015057821,0.002420626,0.00089023303,0.0020428677,0.0008090016,0.0013557115,0.0031868885,0.0022713135,0.06634359],"category_scores_gemma":[0.011188846,0.000770088,0.0018150856,0.0027610457,0.0005204478,0.0019668813,0.0017244081,0.003471705,0.0791089],"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.0007457926,0.0007591666,0.0059558298,0.0011038778,0.00009851854,0.00014356484,0.0000799597,0.00540311,0.0064379848,0.004525627,0.9130118,0.06173473],"study_design_scores_gemma":[0.00058360863,0.00037062264,0.009707068,0.00025435648,0.00009666112,0.0006356811,0.00020425295,0.051154453,0.032988124,0.016030371,0.8878554,0.00011936715],"about_ca_topic_score_codex":0.003462502,"about_ca_topic_score_gemma":0.005882075,"teacher_disagreement_score":0.06634359,"about_ca_system_score_codex":0.0009320723,"about_ca_system_score_gemma":0.0013585116,"threshold_uncertainty_score":0.22194141},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049285907,0.00022859301,0.006294002,0.00039354866,0.0003856542,0.0003012672,0.9580935,0.022115216,0.0072596604],"genre_scores_gemma":[0.004514984,0.00008647164,0.011719714,0.00019092493,0.00002097663,0.000514973,0.9787167,0.0018453689,0.00238997],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99702626,0.0003193004,0.00036886852,0.0010280714,0.0009406435,0.0003168146],"domain_scores_gemma":[0.995471,0.00081898866,0.00019414387,0.00208794,0.0012084416,0.00021955743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022325697,0.0026740676,0.0011677424,0.0029212323,0.0012410005,0.0020104675,0.0040174797,0.002352296,0.067593075],"category_scores_gemma":[0.014179323,0.00093008426,0.0022322363,0.004527637,0.0005505491,0.0026646191,0.0021874635,0.0038778877,0.085385695],"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.00043837485,0.00035278784,0.002993191,0.0009272487,0.00008527413,0.000076410666,0.00005741881,0.0026001204,0.0034072215,0.0032351105,0.9563458,0.029480958],"study_design_scores_gemma":[0.0004673859,0.0002047542,0.0061175576,0.00023219928,0.0000782711,0.00031051616,0.00017315822,0.020367574,0.015961,0.011350098,0.9446486,0.000088905836],"about_ca_topic_score_codex":0.0050374996,"about_ca_topic_score_gemma":0.008985458,"teacher_disagreement_score":0.067593075,"about_ca_system_score_codex":0.0013927978,"about_ca_system_score_gemma":0.0019161134,"threshold_uncertainty_score":0.22612137},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070636976,0.00033678356,0.012216159,0.0006562053,0.00058210344,0.000416323,0.9411903,0.025619434,0.011918905],"genre_scores_gemma":[0.00908919,0.00013983446,0.021350076,0.00040751896,0.000039474708,0.0009073756,0.9603363,0.0027646406,0.0049655517],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969297,0.00037223008,0.00034392625,0.0011671243,0.00086362386,0.00032335805],"domain_scores_gemma":[0.9954732,0.00092284917,0.00018685352,0.002076473,0.0011386914,0.00020193742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022443815,0.0025512897,0.0011299202,0.0025266514,0.0010961008,0.002020341,0.0039537093,0.002462858,0.0828678],"category_scores_gemma":[0.016811984,0.0009423898,0.002192004,0.003755708,0.00060948764,0.002836635,0.0022949404,0.003977488,0.095907345],"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.00046683187,0.00035932084,0.0034856074,0.00091932237,0.00009345814,0.000090144094,0.00007367485,0.0033139742,0.0031294106,0.0043597217,0.9446499,0.039058704],"study_design_scores_gemma":[0.0004457662,0.00022324144,0.006160718,0.00026849282,0.00008410726,0.00039036092,0.00023536265,0.028697928,0.015790006,0.018679993,0.92891985,0.00010418091],"about_ca_topic_score_codex":0.004747114,"about_ca_topic_score_gemma":0.008441447,"teacher_disagreement_score":0.0828678,"about_ca_system_score_codex":0.0012773325,"about_ca_system_score_gemma":0.0018312992,"threshold_uncertainty_score":0.27722043},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033724023,0.00026029168,0.0005241524,0.00011426634,0.00009162664,0.00004708365,0.9949262,0.002064931,0.0016342761],"genre_scores_gemma":[0.00091549894,0.00011842517,0.0013955472,0.00008829917,0.00001738006,0.00012904074,0.99619544,0.00020274335,0.00093761703],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984534,0.00021330744,0.00020806336,0.0005664366,0.00037324257,0.00018558737],"domain_scores_gemma":[0.99745876,0.0007327501,0.00014415412,0.00072127464,0.00077120087,0.00017193808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009678543,0.0031310678,0.0018288646,0.004512542,0.0010899501,0.0037003323,0.0031461287,0.002169443,0.11916603],"category_scores_gemma":[0.008638917,0.00073836173,0.001670814,0.005627441,0.0005330515,0.0024749448,0.0016665697,0.0023962473,0.1678765],"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.00007542682,0.000048996146,0.0006846858,0.0005858607,0.000026895876,0.000029073668,0.00001507554,0.0005329293,0.00017480656,0.0007158724,0.9881698,0.008940575],"study_design_scores_gemma":[0.00025438663,0.000048864782,0.0024125327,0.0003196513,0.000038619775,0.00021051936,0.0001153793,0.003175038,0.0010969907,0.0055961437,0.9866818,0.00004993573],"about_ca_topic_score_codex":0.009701245,"about_ca_topic_score_gemma":0.023558838,"teacher_disagreement_score":0.11916603,"about_ca_system_score_codex":0.001682531,"about_ca_system_score_gemma":0.0021838394,"threshold_uncertainty_score":0.3986501},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070636976,0.00033678356,0.012216159,0.0006562053,0.00058210344,0.000416323,0.9411903,0.025619434,0.011918905],"genre_scores_gemma":[0.00908919,0.00013983446,0.021350076,0.00040751896,0.000039474708,0.0009073756,0.9603363,0.0027646406,0.0049655517],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969297,0.00037223008,0.00034392625,0.0011671243,0.00086362386,0.00032335805],"domain_scores_gemma":[0.9954732,0.00092284917,0.00018685352,0.002076473,0.0011386914,0.00020193742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022443815,0.0025512897,0.0011299202,0.0025266514,0.0010961008,0.002020341,0.0039537093,0.002462858,0.0828678],"category_scores_gemma":[0.016811984,0.0009423898,0.002192004,0.003755708,0.00060948764,0.002836635,0.0022949404,0.003977488,0.095907345],"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.00046683187,0.00035932084,0.0034856074,0.00091932237,0.00009345814,0.000090144094,0.00007367485,0.0033139742,0.0031294106,0.0043597217,0.9446499,0.039058704],"study_design_scores_gemma":[0.0004457662,0.00022324144,0.006160718,0.00026849282,0.00008410726,0.00039036092,0.00023536265,0.028697928,0.015790006,0.018679993,0.92891985,0.00010418091],"about_ca_topic_score_codex":0.004747114,"about_ca_topic_score_gemma":0.008441447,"teacher_disagreement_score":0.0828678,"about_ca_system_score_codex":0.0012773325,"about_ca_system_score_gemma":0.0018312992,"threshold_uncertainty_score":0.27722043},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29687533,0.0020007351,0.6278658,0.00510841,0.0005200944,0.000046269648,0.00027195347,0.00039693346,0.06691447],"genre_scores_gemma":[0.9598076,0.0006517677,0.022873035,0.00027212143,0.0004057394,0.000031991705,0.00011982944,0.00014755924,0.015690384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994173,0.00017630156,0.00003140939,0.00013584502,0.00017827227,0.000060881546],"domain_scores_gemma":[0.9977081,0.00084130326,0.00036264927,0.0004922758,0.00028990034,0.00030585408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010065928,0.0006708538,0.001019058,0.00259373,0.0010623053,0.0028540657,0.0008969646,0.0014036621,0.0069669914],"category_scores_gemma":[0.0047223475,0.00044764602,0.0006110147,0.0009919448,0.0023589549,0.0053947773,0.003085472,0.0027151145,0.0006723211],"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.000007928068,0.000009693507,0.00036061063,0.0000132779005,0.000009351699,0.00006281528,0.00008138496,0.001811979,0.000593995,0.99329424,0.0005363279,0.0032184245],"study_design_scores_gemma":[0.0000039550705,0.000010658952,0.00035652527,0.000009745394,0.000006087042,0.00017065338,0.00006737623,0.032103736,0.00024258369,0.9642838,0.0027336734,0.000011112451],"about_ca_topic_score_codex":0.00023191894,"about_ca_topic_score_gemma":0.00020782067,"teacher_disagreement_score":0.0069669914,"about_ca_system_score_codex":0.0009521477,"about_ca_system_score_gemma":0.00025582197,"threshold_uncertainty_score":0.023306847},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07570048,0.0021829936,0.90123296,0.0035341976,0.00014495716,0.00009130605,0.0019645847,0.00064811663,0.014500377],"genre_scores_gemma":[0.90804327,0.003277002,0.0739051,0.0008445795,0.00047051275,0.00047627042,0.002525411,0.0004814768,0.009976355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789655,0.0008125442,0.00012568169,0.00038390912,0.0004569977,0.00032423332],"domain_scores_gemma":[0.9587469,0.0337956,0.0015788568,0.002983821,0.0017783131,0.0011166288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055993292,0.0013543308,0.0018437463,0.0022670934,0.0010106951,0.0036714275,0.004023823,0.002447428,0.010115924],"category_scores_gemma":[0.03777512,0.0010877816,0.0010711501,0.0027856284,0.0038089734,0.011624861,0.0061601135,0.006066886,0.0010715546],"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.00018797429,0.00008531392,0.0008500463,0.00031146657,0.00007481716,0.000076165066,0.00028203515,0.29802746,0.0012763949,0.66718584,0.005445531,0.02619693],"study_design_scores_gemma":[0.000007475316,0.00001087371,0.00012929284,0.000045155724,0.000010473703,0.000019003537,0.000026530797,0.61561495,0.00031792038,0.38338906,0.00041333874,0.000015873416],"about_ca_topic_score_codex":0.0042580753,"about_ca_topic_score_gemma":0.004722944,"teacher_disagreement_score":0.010115924,"about_ca_system_score_codex":0.00366038,"about_ca_system_score_gemma":0.001761028,"threshold_uncertainty_score":0.033841133},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14447328,0.0041667777,0.8004232,0.0052114087,0.00072134665,0.0001037691,0.0006865486,0.00015840202,0.044055253],"genre_scores_gemma":[0.8822285,0.0028900502,0.09868873,0.0007510356,0.00075728126,0.00016820634,0.00071398134,0.00012296056,0.013679084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985423,0.00062555406,0.00012320123,0.0002934772,0.00030863335,0.0001068449],"domain_scores_gemma":[0.9955961,0.002207849,0.00050026603,0.0006192245,0.00069373206,0.00038282818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026985698,0.00080847717,0.0010946916,0.0032981718,0.0013104054,0.004838473,0.0013708743,0.0012176185,0.0039442712],"category_scores_gemma":[0.011029834,0.0005453117,0.0010143099,0.0022238067,0.005949763,0.011554419,0.004106539,0.0029713179,0.0003992388],"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.0000046889177,0.0000047168323,0.000094959374,0.000017864966,0.0000040845043,0.000024822406,0.00011085118,0.0009672135,0.00006502996,0.99678063,0.00022203021,0.0017030428],"study_design_scores_gemma":[0.0000028551913,0.0000061465394,0.000043441392,0.000008007002,0.000001804625,0.000023304627,0.000038678936,0.005246933,0.000026508758,0.9935768,0.0010213421,0.0000040259965],"about_ca_topic_score_codex":0.0017954945,"about_ca_topic_score_gemma":0.0009787403,"teacher_disagreement_score":0.004838473,"about_ca_system_score_codex":0.001585719,"about_ca_system_score_gemma":0.0009813397,"threshold_uncertainty_score":0.014271557},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09100177,0.002107945,0.8998786,0.0011015057,0.00009926067,0.000115879164,0.00039948986,0.0027729524,0.0025225407],"genre_scores_gemma":[0.7450449,0.0010216194,0.24448615,0.00092939654,0.00017081117,0.000249571,0.0015819349,0.00067753723,0.0058381185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918073,0.00019286636,0.000050955725,0.00019365261,0.00027232282,0.00010944107],"domain_scores_gemma":[0.99873525,0.00054399204,0.00016677896,0.0001705171,0.00027361623,0.00010987888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030017917,0.0016343023,0.0012884132,0.00088365015,0.00049771584,0.0017979069,0.0016518428,0.0016957645,0.0018923917],"category_scores_gemma":[0.004976911,0.0005002836,0.0009759747,0.0006709644,0.0011211215,0.0017217123,0.0015776926,0.0014581264,0.00060488115],"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.0011856861,0.00021574822,0.0027127853,0.0003596786,0.00030933254,0.0007254443,0.00014671682,0.6610802,0.028264605,0.010233327,0.010073027,0.28469345],"study_design_scores_gemma":[0.000023390481,0.0000961496,0.0006082199,0.000019205672,0.000029403667,0.00017451936,0.0000117711115,0.98592365,0.00836405,0.003937082,0.0007955123,0.000017125412],"about_ca_topic_score_codex":0.0053339964,"about_ca_topic_score_gemma":0.0033935725,"teacher_disagreement_score":0.0053339964,"about_ca_system_score_codex":0.0020468985,"about_ca_system_score_gemma":0.0018722811,"threshold_uncertainty_score":0.01587522},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8961225,0.00055249606,0.070065945,0.0006878637,0.000087351815,0.000038564976,0.00029553726,0.00013539357,0.03201437],"genre_scores_gemma":[0.9848363,0.0003025044,0.0087222615,0.00013844854,0.00006272949,0.000045760276,0.00033485796,0.00006295658,0.0054942872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907076,0.0002169633,0.000062225736,0.00020836323,0.00024122061,0.00020057904],"domain_scores_gemma":[0.99401677,0.003301052,0.0006544512,0.0004926907,0.00052594655,0.0010090497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013663716,0.00046343464,0.0004653472,0.004726415,0.0018810584,0.0039625545,0.0012986517,0.0010419963,0.007073055],"category_scores_gemma":[0.007144852,0.0004498685,0.00059474516,0.0016213938,0.0031938215,0.0060766093,0.0026710378,0.0012075503,0.0005293152],"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.000112424015,0.000034358287,0.005470463,0.00004010705,0.000016865668,0.00029949675,0.0007927557,0.0021803048,0.0026680646,0.97963583,0.0008553237,0.007893894],"study_design_scores_gemma":[0.000029808461,0.000043277516,0.003760364,0.00005213812,0.000025650716,0.00046088692,0.00087312795,0.023758005,0.0026842756,0.96285707,0.0054137493,0.000041643958],"about_ca_topic_score_codex":0.0018567743,"about_ca_topic_score_gemma":0.0013588035,"teacher_disagreement_score":0.007073055,"about_ca_system_score_codex":0.0015569392,"about_ca_system_score_gemma":0.00038686697,"threshold_uncertainty_score":0.023661673},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08508014,0.0005440963,0.8992393,0.0012503292,0.000077261015,0.00028989505,0.0027366905,0.0032179214,0.0075644166],"genre_scores_gemma":[0.3706053,0.0003315333,0.61838275,0.00023054563,0.000091950445,0.0004877883,0.00536073,0.00047261873,0.0040368517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865097,0.00023382452,0.000107684755,0.00045511857,0.0003495267,0.00020280397],"domain_scores_gemma":[0.99398535,0.003760278,0.00047950723,0.00096009375,0.00058516825,0.00022968597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018029467,0.0011140481,0.001362424,0.0025679083,0.0009821586,0.002927134,0.00220298,0.00128553,0.010468459],"category_scores_gemma":[0.015902644,0.0007076251,0.0016504689,0.0025257536,0.0011000548,0.005297476,0.0033498933,0.0017219114,0.0014141545],"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.00076944253,0.00020206177,0.009682081,0.00091188925,0.00017472544,0.00039466377,0.00066689926,0.44572142,0.006457183,0.17503978,0.015018063,0.3449618],"study_design_scores_gemma":[0.000053016043,0.000060466533,0.00069019105,0.000031678228,0.000023301214,0.000118308395,0.000122016536,0.79284644,0.0018461032,0.20068425,0.0035101243,0.000014049181],"about_ca_topic_score_codex":0.0020617435,"about_ca_topic_score_gemma":0.003529174,"teacher_disagreement_score":0.010468459,"about_ca_system_score_codex":0.0018840571,"about_ca_system_score_gemma":0.002240994,"threshold_uncertainty_score":0.03502047},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9747312,0.00019250043,0.010725279,0.0003890131,0.000018567192,0.00022379539,0.01254719,0.00025853762,0.0009137463],"genre_scores_gemma":[0.9747096,0.000076722084,0.011728582,0.000028281169,0.000009780591,0.00017077831,0.013065724,0.000016524933,0.00019407902],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9981359,0.00067342655,0.00025238088,0.00035065322,0.00031743653,0.00027017237],"domain_scores_gemma":[0.9897563,0.0058476953,0.0015247839,0.0009077087,0.0014524801,0.00051107875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025343203,0.00061087636,0.0005909813,0.009585,0.0008996462,0.0016641422,0.00077287585,0.0006541864,0.0025331683],"category_scores_gemma":[0.016897138,0.0002205216,0.0017518472,0.005393692,0.00077518227,0.00096844457,0.0019285574,0.0005715243,0.0002896832],"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.0008535333,0.00024290042,0.9240562,0.00035350706,0.00056332257,0.0006814498,0.0014986878,0.028955234,0.0013555964,0.0033234274,0.003012531,0.03510369],"study_design_scores_gemma":[0.00007475708,0.00071199815,0.63913256,0.00012610464,0.00028431823,0.0011498987,0.008379676,0.33612636,0.0011104455,0.00741947,0.005374936,0.000109495595],"about_ca_topic_score_codex":0.027104571,"about_ca_topic_score_gemma":0.016944293,"teacher_disagreement_score":0.027104571,"about_ca_system_score_codex":0.0016474819,"about_ca_system_score_gemma":0.0016451621,"threshold_uncertainty_score":0.053893566},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.677523,0.00049709756,0.26447085,0.00077517837,0.00007693831,0.000050679166,0.00014649994,0.000254165,0.056205545],"genre_scores_gemma":[0.9636895,0.0002985303,0.030582204,0.00009634669,0.0000902438,0.000034181183,0.000079715544,0.000073851705,0.0050553097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909663,0.0002271968,0.000068912566,0.00016370365,0.0002969015,0.00014664563],"domain_scores_gemma":[0.99699676,0.0011364205,0.00046225506,0.00042204844,0.0005724836,0.00041011375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012172387,0.000447827,0.00043927957,0.002789284,0.00146356,0.002435663,0.00074805645,0.0008547185,0.003608906],"category_scores_gemma":[0.00661387,0.0002509656,0.0006255243,0.0015620763,0.0042371247,0.0058096475,0.0025845536,0.0020519344,0.00045704833],"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.000007976563,0.0000044824033,0.00030518867,0.000008856861,0.0000011387971,0.000069772585,0.00018815976,0.0005426404,0.0007996717,0.9957398,0.00008710801,0.0022451165],"study_design_scores_gemma":[0.0000064035103,0.000016521051,0.00035437223,0.000014412983,0.000003112594,0.000201028,0.00012486972,0.010102041,0.0011225817,0.98574567,0.0022949914,0.000013867321],"about_ca_topic_score_codex":0.0008738867,"about_ca_topic_score_gemma":0.00055910787,"teacher_disagreement_score":0.003608906,"about_ca_system_score_codex":0.0012191568,"about_ca_system_score_gemma":0.0005912515,"threshold_uncertainty_score":0.01207304},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6683405,0.00062597665,0.318441,0.00037042538,0.000041708874,0.00002990919,0.00013721251,0.00014747086,0.011865725],"genre_scores_gemma":[0.9837091,0.00019445014,0.014166746,0.000039288225,0.000053093943,0.000028058677,0.00006854694,0.000033623342,0.0017070073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992455,0.00012414243,0.000041270632,0.00020060282,0.00024795296,0.00014053864],"domain_scores_gemma":[0.9956885,0.0017943246,0.0008558321,0.0006973623,0.00046583355,0.0004981177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088685553,0.00028129396,0.0007129775,0.0024407047,0.00076949823,0.0018805955,0.00064235023,0.0004553699,0.0021552306],"category_scores_gemma":[0.0060689044,0.00029616515,0.00042584134,0.00089392887,0.0026899495,0.0035441467,0.0023703724,0.0009124168,0.00015501001],"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.00006365875,0.000028050523,0.005708279,0.00007223704,0.000020073874,0.00016520722,0.00043955125,0.016349737,0.0064503467,0.95299643,0.0005227363,0.017183725],"study_design_scores_gemma":[0.000016755359,0.00007723962,0.006478658,0.000041230778,0.000033930944,0.0003972059,0.00036077356,0.20441729,0.006926049,0.7764021,0.0047981245,0.000050635277],"about_ca_topic_score_codex":0.0007504369,"about_ca_topic_score_gemma":0.0006124376,"teacher_disagreement_score":0.0024407047,"about_ca_system_score_codex":0.00065075455,"about_ca_system_score_gemma":0.0003128221,"threshold_uncertainty_score":0.0072100163},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9470592,0.0019648285,0.043873437,0.00025553457,0.00004248427,0.000079703525,0.00008015417,0.00015862372,0.0064860713],"genre_scores_gemma":[0.9947463,0.00024899255,0.0044869166,0.000033510383,0.000007705794,0.00003676495,0.000033303935,0.000009647843,0.00039674027],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993599,0.00013956563,0.000042377298,0.000104856415,0.00021656069,0.00013662859],"domain_scores_gemma":[0.99849665,0.00051113486,0.00031860845,0.00024012265,0.00019052287,0.0002429316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009482287,0.00034370067,0.00043582724,0.0011974758,0.00033832085,0.0010562908,0.00065156,0.0006577862,0.0012638542],"category_scores_gemma":[0.0033056447,0.0003770647,0.0005181044,0.0003065802,0.001326949,0.0013709696,0.0015915554,0.0006879062,0.000173091],"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.0017591566,0.0003375305,0.017874898,0.00030731622,0.000113669616,0.0010546014,0.001315583,0.0070332848,0.76822704,0.08886763,0.0005711371,0.11253821],"study_design_scores_gemma":[0.00050342665,0.0018483656,0.29578936,0.00023830112,0.00024130015,0.0058823093,0.0011428302,0.12491135,0.38897443,0.17524607,0.0047468124,0.00047536098],"about_ca_topic_score_codex":0.00071654026,"about_ca_topic_score_gemma":0.0003818541,"teacher_disagreement_score":0.0012638542,"about_ca_system_score_codex":0.00059198955,"about_ca_system_score_gemma":0.0005306716,"threshold_uncertainty_score":0.005014837},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007873401,0.0006524597,0.98273945,0.00102963,0.00016932636,0.000040252686,0.00012001474,0.00020595474,0.007169518],"genre_scores_gemma":[0.30905783,0.0024911587,0.66724247,0.00065294,0.00090708566,0.00024189413,0.0006816658,0.00038517587,0.018339766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981615,0.00064977707,0.00016596857,0.0003410511,0.00055966224,0.00012208159],"domain_scores_gemma":[0.9966924,0.0012052268,0.00026924553,0.0008547756,0.0007315565,0.00024684655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019238675,0.0007269338,0.0007569351,0.0050439853,0.0018748848,0.0053394935,0.0020533635,0.0017478034,0.004868651],"category_scores_gemma":[0.007287215,0.0006138073,0.0016156652,0.0048776874,0.0044607245,0.010232151,0.0047160075,0.0036556863,0.0012055851],"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.00000929618,0.000009812901,0.00013976016,0.000027662,0.0000073076862,0.000062622574,0.00019053734,0.0018465522,0.00056892924,0.9809427,0.00069876487,0.015496007],"study_design_scores_gemma":[0.000004267474,0.00002614913,0.00011642596,0.000024641606,0.000009836027,0.0002629298,0.0001631457,0.018176269,0.0005699155,0.9624102,0.018222187,0.000014044301],"about_ca_topic_score_codex":0.0012245231,"about_ca_topic_score_gemma":0.00071830425,"teacher_disagreement_score":0.0053394935,"about_ca_system_score_codex":0.0011673049,"about_ca_system_score_gemma":0.0012315009,"threshold_uncertainty_score":0.016287267},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22913311,0.0015844767,0.72004575,0.006858419,0.00043082717,0.000059394046,0.0011942124,0.0004199634,0.04027379],"genre_scores_gemma":[0.95438933,0.001335935,0.03447279,0.0008577641,0.001064226,0.000113227725,0.0006958393,0.00018127264,0.0068895947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881625,0.000330337,0.00010369397,0.00019356333,0.00044946422,0.00010664421],"domain_scores_gemma":[0.9928663,0.0041221757,0.0006564889,0.00094163144,0.001033328,0.00038015356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027283693,0.00039435583,0.0010846612,0.0024161658,0.0013003214,0.0038920618,0.00088592723,0.0008256182,0.0030221918],"category_scores_gemma":[0.010509829,0.00039007637,0.0009207267,0.0022955877,0.0035820534,0.0070737284,0.0019458547,0.0020678667,0.00048135163],"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.000009691442,0.000008218997,0.00032864595,0.000014834447,0.000007834802,0.000023623095,0.00005380867,0.0007116414,0.00022939139,0.9955623,0.000567222,0.0024827998],"study_design_scores_gemma":[0.0000032328296,0.0000040481036,0.00014809842,0.0000042628285,0.0000032462751,0.000027555629,0.000012233089,0.007311643,0.00009349041,0.9917744,0.0006138933,0.000003974981],"about_ca_topic_score_codex":0.0011971063,"about_ca_topic_score_gemma":0.0010137237,"teacher_disagreement_score":0.0038920618,"about_ca_system_score_codex":0.0010593659,"about_ca_system_score_gemma":0.0014468369,"threshold_uncertainty_score":0.014429212},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26421613,0.00088368414,0.6718133,0.0010467657,0.00015550267,0.00007298516,0.0002780454,0.00043971254,0.061093874],"genre_scores_gemma":[0.949092,0.0003141664,0.0422193,0.00013725516,0.00011501054,0.000030402622,0.00018777131,0.00009422251,0.0078099016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917585,0.00015308241,0.000037690927,0.00018781019,0.00032426312,0.00012141188],"domain_scores_gemma":[0.9994048,0.0001597757,0.000055846147,0.00014289538,0.00014450094,0.00009218262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079132983,0.00032281296,0.0004120388,0.0018092273,0.0008464907,0.0016097617,0.00081640505,0.0005432568,0.005704574],"category_scores_gemma":[0.001670491,0.00022030012,0.0006122397,0.00078082795,0.0028229633,0.00626177,0.0023236168,0.0015651188,0.0005014562],"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.000005809868,0.0000055032438,0.0002909563,0.000013641875,0.0000026618343,0.00003819309,0.00019615648,0.0013562137,0.00082381425,0.99226475,0.00021259653,0.0047896625],"study_design_scores_gemma":[0.0000034972202,0.000020710535,0.000623626,0.000013479456,0.0000054190805,0.00015288238,0.00014950987,0.014230283,0.0013054113,0.97842216,0.0050530755,0.000019869678],"about_ca_topic_score_codex":0.0013261763,"about_ca_topic_score_gemma":0.0009141036,"teacher_disagreement_score":0.005704574,"about_ca_system_score_codex":0.0012426416,"about_ca_system_score_gemma":0.00040773206,"threshold_uncertainty_score":0.019083738},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32986036,0.0009910773,0.6205172,0.0019064002,0.0001304393,0.00004359875,0.0015089937,0.00062517304,0.044416796],"genre_scores_gemma":[0.88371277,0.0010601548,0.10233079,0.00031671964,0.000083019884,0.00007421464,0.001855735,0.00028919804,0.010277391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977165,0.00005999255,0.0000105251,0.00007002371,0.00006315662,0.000024627423],"domain_scores_gemma":[0.9991967,0.0003365381,0.000080997386,0.00016365825,0.0001260857,0.00009596385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032199905,0.00030709387,0.00034823787,0.0012902251,0.0006697761,0.0019452197,0.0005427509,0.0009217159,0.0040881843],"category_scores_gemma":[0.0029679975,0.0002889071,0.00034777174,0.00076447707,0.0016090844,0.002943304,0.00102341,0.0011554264,0.00069161964],"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.000058259004,0.00001599956,0.0017584536,0.00010744604,0.000017126953,0.00030963807,0.00056238455,0.021146031,0.009836342,0.9362741,0.003034808,0.026879398],"study_design_scores_gemma":[0.000013009534,0.000025722671,0.0016486218,0.000049746046,0.000013555218,0.00043685045,0.000259847,0.09920884,0.0018849896,0.88026726,0.01616242,0.000029128261],"about_ca_topic_score_codex":0.0016499056,"about_ca_topic_score_gemma":0.0013783671,"teacher_disagreement_score":0.0040881843,"about_ca_system_score_codex":0.0005832579,"about_ca_system_score_gemma":0.00031623215,"threshold_uncertainty_score":0.013676345},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92929125,0.00038279648,0.04340513,0.00034817174,0.000044268738,0.000051651117,0.0003705198,0.00017788332,0.025928363],"genre_scores_gemma":[0.98687786,0.00018351676,0.00859111,0.00006772415,0.000028922486,0.000033349348,0.000608873,0.000031124524,0.0035775148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990626,0.00008142857,0.00005876748,0.0002348873,0.00033385615,0.00022857275],"domain_scores_gemma":[0.99729484,0.00096862373,0.00040640638,0.00042040844,0.00025759757,0.0006521832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050236087,0.0006036116,0.0008250771,0.0013717964,0.0017542838,0.0037882167,0.0008648204,0.00072034495,0.0063522076],"category_scores_gemma":[0.003696755,0.000946492,0.00068063376,0.0013272788,0.0027203541,0.004398298,0.0026415135,0.0013393889,0.0004840952],"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.00040121682,0.00009233427,0.010592347,0.00014264969,0.00005259352,0.0009723319,0.0009874136,0.009620713,0.01629625,0.9288345,0.0021904025,0.029817328],"study_design_scores_gemma":[0.00006131433,0.00007112987,0.0058236094,0.000038341328,0.000046496476,0.0014386661,0.0009207172,0.035815537,0.009961458,0.93479216,0.010985316,0.0000453146],"about_ca_topic_score_codex":0.001393144,"about_ca_topic_score_gemma":0.0016965251,"teacher_disagreement_score":0.0063522076,"about_ca_system_score_codex":0.0013362544,"about_ca_system_score_gemma":0.00044917324,"threshold_uncertainty_score":0.021250308},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56872,0.0006424347,0.38271686,0.00033805647,0.000082890576,0.0000810772,0.0003410795,0.0008636614,0.046213932],"genre_scores_gemma":[0.95538956,0.00037728588,0.03269213,0.000088513414,0.0000867779,0.00004439682,0.00050244876,0.00018504939,0.010633884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994892,0.00006222585,0.000032463915,0.00012794831,0.00016567645,0.00012252583],"domain_scores_gemma":[0.9992964,0.00021530091,0.00007885266,0.00016348159,0.00010365817,0.00014222517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006111871,0.0004172718,0.0004823552,0.0026357323,0.00078142266,0.0030033663,0.0007871921,0.00039735704,0.0054417904],"category_scores_gemma":[0.0014753473,0.00028675728,0.00051506533,0.0012897392,0.0022469736,0.0056556887,0.0037698809,0.0014523068,0.0006447382],"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.00004347035,0.000043917673,0.0012725992,0.000082059974,0.000011887228,0.00035466408,0.0014148996,0.0026846118,0.004475301,0.95799243,0.00076595537,0.030858135],"study_design_scores_gemma":[0.0000069265902,0.000041278934,0.0009882703,0.000027457734,0.000019080515,0.00034003783,0.00048212512,0.013278151,0.003928105,0.9742202,0.006647096,0.000021215204],"about_ca_topic_score_codex":0.00075045123,"about_ca_topic_score_gemma":0.0008975382,"teacher_disagreement_score":0.0054417904,"about_ca_system_score_codex":0.0007428596,"about_ca_system_score_gemma":0.0003826007,"threshold_uncertainty_score":0.01820457},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8629229,0.00077456527,0.13100126,0.0009692238,0.00004016279,0.0002346365,0.001579665,0.00016711483,0.0023105654],"genre_scores_gemma":[0.9367695,0.00026853546,0.06192127,0.000021339667,0.000020214358,0.00007817392,0.0006861209,0.000030766743,0.00020418467],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99578094,0.0028880336,0.00025180128,0.00037869974,0.00054335105,0.0001572275],"domain_scores_gemma":[0.9412935,0.053399835,0.0014774281,0.0016172857,0.0015762945,0.0006355193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005729999,0.00050191814,0.00058786926,0.00856345,0.00088313426,0.0026110278,0.0011876237,0.0015526636,0.0017525385],"category_scores_gemma":[0.03721527,0.00020626292,0.0012820355,0.006849471,0.0013454676,0.0027063077,0.0012037342,0.0007672902,0.00015040125],"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.001936736,0.0015547262,0.3429016,0.0013835224,0.0009437561,0.005682103,0.0048988257,0.24224156,0.0054490706,0.08918914,0.0039026742,0.29991633],"study_design_scores_gemma":[0.00011824068,0.00096263253,0.1042175,0.00023417234,0.00050603907,0.00454249,0.011032737,0.7917362,0.0040417756,0.07694156,0.0055217077,0.00014498745],"about_ca_topic_score_codex":0.006478827,"about_ca_topic_score_gemma":0.0062392806,"teacher_disagreement_score":0.00856345,"about_ca_system_score_codex":0.0015407505,"about_ca_system_score_gemma":0.00088145165,"threshold_uncertainty_score":0.030303538},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9582656,0.00037839098,0.024609022,0.0006771433,0.00010134078,0.000025525795,0.00007322067,0.00017200204,0.015697846],"genre_scores_gemma":[0.99407613,0.00013907673,0.0037714788,0.00004054642,0.00008046925,0.000019656844,0.000069124886,0.00003515502,0.0017683798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995672,0.00009612503,0.000019898933,0.0000451244,0.00017496815,0.000096669355],"domain_scores_gemma":[0.999062,0.0002660052,0.00020902057,0.00013262128,0.000117300355,0.00021306123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068874954,0.0006042479,0.0006465017,0.0028677285,0.0012102834,0.0018422751,0.00073700876,0.00095572916,0.0017908716],"category_scores_gemma":[0.002022113,0.00023966265,0.0004437617,0.0010385722,0.0030264966,0.0030219376,0.0015612474,0.00095389923,0.0002497156],"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.000041036234,0.00005459991,0.0016117562,0.000040534906,0.000008233007,0.00031988646,0.00033328624,0.0056695845,0.002236872,0.98582876,0.00044523343,0.0034101636],"study_design_scores_gemma":[0.00004154679,0.00008357547,0.001562889,0.000025261626,0.0000109951425,0.00044576963,0.000227785,0.05030281,0.0013357978,0.9446251,0.0013153466,0.000023073957],"about_ca_topic_score_codex":0.0009133048,"about_ca_topic_score_gemma":0.00064381136,"teacher_disagreement_score":0.0028677285,"about_ca_system_score_codex":0.0009254127,"about_ca_system_score_gemma":0.00045458562,"threshold_uncertainty_score":0.006714344},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008616349,0.0028114005,0.9835022,0.0021720417,0.00062849507,0.000035564684,0.0004330179,0.00043008904,0.0013708468],"genre_scores_gemma":[0.17353244,0.006702168,0.80563974,0.0018297649,0.0052128704,0.0002450153,0.0012593349,0.0005022905,0.0050762403],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949479,0.0024780086,0.00023435196,0.0010818038,0.001112117,0.00014581431],"domain_scores_gemma":[0.93113434,0.057286244,0.0009749352,0.008058678,0.0018859011,0.00065994187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059517208,0.00190384,0.0028692055,0.003683927,0.001245616,0.0030024298,0.0037395072,0.003067659,0.0021129588],"category_scores_gemma":[0.073799685,0.001057365,0.0018436051,0.0035745965,0.0035661196,0.005744762,0.005117275,0.006098614,0.0011152363],"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.00062316883,0.00015468852,0.017999558,0.0008970243,0.0006739691,0.0014492226,0.00064662105,0.1465689,0.017818285,0.35240084,0.038237613,0.4225301],"study_design_scores_gemma":[0.00004877738,0.00017029849,0.0067992583,0.00013269288,0.00018463061,0.0010777339,0.00014574711,0.5133077,0.0064744814,0.44479957,0.026613152,0.00024603613],"about_ca_topic_score_codex":0.007157785,"about_ca_topic_score_gemma":0.0050931717,"teacher_disagreement_score":0.007157785,"about_ca_system_score_codex":0.0010316137,"about_ca_system_score_gemma":0.00083266594,"threshold_uncertainty_score":0.03147608},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8769075,0.00030577605,0.09304213,0.00032325092,0.00004439066,0.000029283048,0.00014229649,0.00009406398,0.029111298],"genre_scores_gemma":[0.99301517,0.000078998244,0.003754294,0.000029529314,0.000042518197,0.000022143638,0.00014567547,0.000027248469,0.0028844252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999522,0.00008778211,0.000021560585,0.00010664092,0.00016010072,0.000101936974],"domain_scores_gemma":[0.99902916,0.00033161204,0.00016976852,0.00011437834,0.00016495347,0.00019006194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052132807,0.00023552489,0.000456696,0.0024349554,0.0010819564,0.0021351317,0.0005602962,0.0005086348,0.0052666073],"category_scores_gemma":[0.0026731791,0.00026694575,0.0003298916,0.0007138498,0.0028099406,0.002853055,0.0022827631,0.0006587207,0.0003640734],"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.000039153732,0.000014476621,0.0012546958,0.00002785199,0.000008587624,0.00010994925,0.00049156003,0.0037466655,0.003433178,0.9859372,0.0004338971,0.0045028985],"study_design_scores_gemma":[0.000013388768,0.000038495076,0.002897041,0.000029498146,0.000012088064,0.0003702023,0.00074224384,0.033929326,0.0027256985,0.9549202,0.0043041455,0.000017744494],"about_ca_topic_score_codex":0.0005772227,"about_ca_topic_score_gemma":0.00040469054,"teacher_disagreement_score":0.0052666073,"about_ca_system_score_codex":0.0007737981,"about_ca_system_score_gemma":0.0002413964,"threshold_uncertainty_score":0.017618537},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04493854,0.21293356,0.7024865,0.0048798574,0.00087580184,0.00013893838,0.00112009,0.0011100229,0.03151661],"genre_scores_gemma":[0.4403797,0.3206794,0.21446314,0.0018629145,0.0043241954,0.00030370028,0.003010848,0.00058642967,0.014389632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992551,0.00013112529,0.00007603714,0.00020787804,0.0002758563,0.000054033248],"domain_scores_gemma":[0.9976337,0.0013922197,0.0001710283,0.00027053885,0.00039608352,0.0001364441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012474586,0.000783054,0.0009624482,0.0053073848,0.00078047905,0.0031791937,0.0012138219,0.0010497705,0.0030791587],"category_scores_gemma":[0.003995104,0.00044856116,0.0008856707,0.0045931377,0.0015043555,0.0056476574,0.0019132093,0.0015437213,0.0010802019],"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.0000437689,0.000107286134,0.0036028873,0.0024052311,0.00011418851,0.00038403607,0.0007548879,0.009290494,0.0038858503,0.5012658,0.0155056,0.46263996],"study_design_scores_gemma":[0.000013095508,0.00015225174,0.0029013616,0.0007267163,0.000087076005,0.0028932244,0.0007587394,0.08794167,0.0023943735,0.7027356,0.19925927,0.00013658905],"about_ca_topic_score_codex":0.00088642206,"about_ca_topic_score_gemma":0.0006663866,"teacher_disagreement_score":0.0053073848,"about_ca_system_score_codex":0.00092519086,"about_ca_system_score_gemma":0.000849599,"threshold_uncertainty_score":0.0103007555},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86317843,0.00041492068,0.11993182,0.001023756,0.00004709886,0.000015145631,0.00010394337,0.00014612541,0.015138729],"genre_scores_gemma":[0.98149776,0.00025519144,0.016173042,0.00008742042,0.000077760225,0.000021064041,0.00008726025,0.000033951717,0.001766469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999469,0.00021258468,0.000026956834,0.000086057604,0.00012866201,0.00007682994],"domain_scores_gemma":[0.9990872,0.0003449022,0.00013782839,0.0002425325,0.00009007648,0.000097520075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086080964,0.00033720201,0.0003825225,0.0020967398,0.0015484602,0.002296939,0.00047334257,0.0008642174,0.001522774],"category_scores_gemma":[0.0025013278,0.00030073532,0.00057457364,0.00091357593,0.0037558419,0.00456435,0.0020195586,0.0011025113,0.00013787033],"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.000008373697,0.0000075224725,0.0006329976,0.000011138866,0.000003944184,0.00008581774,0.00027025637,0.0017933582,0.0008768549,0.9946731,0.00018100705,0.0014556668],"study_design_scores_gemma":[0.0000033585493,0.000008904904,0.0008100035,0.0000069394127,0.0000031157363,0.00012917182,0.00013306618,0.015759546,0.00039031502,0.9814813,0.0012667269,0.0000075664643],"about_ca_topic_score_codex":0.000665532,"about_ca_topic_score_gemma":0.0005838227,"teacher_disagreement_score":0.002296939,"about_ca_system_score_codex":0.00093391695,"about_ca_system_score_gemma":0.00031174973,"threshold_uncertainty_score":0.006776035},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95048136,0.0002446366,0.029455164,0.0003216404,0.000036005284,0.000016892809,0.000032833028,0.00011459263,0.019296799],"genre_scores_gemma":[0.99292034,0.00010603331,0.0055026645,0.00004476718,0.000023781497,0.000011329684,0.00003699442,0.000020384545,0.0013337395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999306,0.000012257556,0.000002726928,0.000013271956,0.000021107515,0.00001997097],"domain_scores_gemma":[0.9998791,0.000021749725,0.000022628177,0.000019564313,0.000021614454,0.000035279398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014821293,0.00026828606,0.0003299501,0.00076602225,0.0006429468,0.00058600697,0.00036232796,0.00058617146,0.0017666145],"category_scores_gemma":[0.00045216002,0.00012119065,0.00044243605,0.0002962575,0.0011978876,0.00114099,0.00045943074,0.000586738,0.00012832045],"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.00006554718,0.000039424947,0.0021507163,0.00007783074,0.000026634287,0.0007299197,0.00057371607,0.029660426,0.033950258,0.9260012,0.00074200454,0.005982428],"study_design_scores_gemma":[0.000033366152,0.00006117049,0.0055145742,0.000023783052,0.000014386806,0.00040590417,0.00036827286,0.34172773,0.006460214,0.643374,0.0019729324,0.000043647047],"about_ca_topic_score_codex":0.0023943344,"about_ca_topic_score_gemma":0.0009877919,"teacher_disagreement_score":0.0023943344,"about_ca_system_score_codex":0.0005941726,"about_ca_system_score_gemma":0.00030966848,"threshold_uncertainty_score":0.0059099197},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34153154,0.0007296973,0.6533811,0.00092465995,0.000067978915,0.000065701,0.00017971655,0.0009877898,0.0021318647],"genre_scores_gemma":[0.9725763,0.00012357956,0.026352432,0.0000680522,0.000053439908,0.0000417968,0.0002002181,0.000031240175,0.0005528663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988147,0.00058397645,0.00007541979,0.00027008762,0.00015566092,0.00010023212],"domain_scores_gemma":[0.9915485,0.0062075937,0.0008240267,0.0006371922,0.0005504658,0.00023226185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004397229,0.0006849856,0.0010694722,0.0035853514,0.00056514045,0.0015013037,0.0013569393,0.001108934,0.0012451599],"category_scores_gemma":[0.010754717,0.0003943671,0.0013251171,0.002039377,0.0014416429,0.0030528712,0.0023899442,0.0012563188,0.00035932945],"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.000053969765,0.00008832123,0.007895045,0.00002269415,0.00009920047,0.00003946453,0.000053443084,0.9575905,0.00032898263,0.0056492467,0.00017078873,0.028008193],"study_design_scores_gemma":[7.2526495e-7,0.000008021641,0.00021150392,0.0000013555408,0.0000017764173,0.000002461741,0.000003942233,0.99799794,0.00004152651,0.0017065948,0.000022519145,0.0000016434926],"about_ca_topic_score_codex":0.008754727,"about_ca_topic_score_gemma":0.004747245,"teacher_disagreement_score":0.008754727,"about_ca_system_score_codex":0.0016689451,"about_ca_system_score_gemma":0.0010201368,"threshold_uncertainty_score":0.02325505},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34238616,0.00021425757,0.65337527,0.00040795814,0.000023147828,0.000024312705,0.00032864025,0.0006116983,0.0026286673],"genre_scores_gemma":[0.97854567,0.0001507682,0.020005234,0.000045233308,0.000018724179,0.000025293593,0.00027592314,0.00004430701,0.00088874175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979717,0.000059085818,0.000007837231,0.0000423419,0.00006208869,0.000031470932],"domain_scores_gemma":[0.9990626,0.00041685998,0.00013796386,0.00017670837,0.00013281085,0.000073147356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065766374,0.0003463819,0.00030787452,0.0012750353,0.00031536925,0.0004919101,0.000612573,0.00046444737,0.00083236344],"category_scores_gemma":[0.0025111707,0.00013936138,0.0004990926,0.0006822012,0.00080051366,0.0013575669,0.00066938874,0.0005278707,0.00020131565],"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.00007479845,0.000031503354,0.004231023,0.000045479625,0.00003118551,0.0001333714,0.00007420604,0.9271998,0.008323833,0.033272386,0.0012730618,0.025309397],"study_design_scores_gemma":[0.0000010894141,0.0000047956587,0.00033838523,8.9216076e-7,0.0000010062662,0.000010120565,0.000005513004,0.993327,0.0002900548,0.0059237205,0.00009374962,0.000003645569],"about_ca_topic_score_codex":0.0035077515,"about_ca_topic_score_gemma":0.0022418224,"teacher_disagreement_score":0.0035077515,"about_ca_system_score_codex":0.0005835799,"about_ca_system_score_gemma":0.0005394205,"threshold_uncertainty_score":0.006974697},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35991704,0.00029939765,0.6356367,0.0004590114,0.00004849236,0.00007987989,0.00031019736,0.0022337576,0.001015554],"genre_scores_gemma":[0.9605204,0.00004675116,0.038628906,0.000050854294,0.000010759413,0.000022678989,0.00022894837,0.00004630398,0.00044435082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988931,0.00024860224,0.00006627766,0.0002706005,0.00036016584,0.00016117816],"domain_scores_gemma":[0.9914799,0.003748041,0.0012497063,0.0018758585,0.0011241137,0.00052243646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020544543,0.00049193046,0.0008730095,0.0016426594,0.0007134631,0.0014887907,0.0016593623,0.0017238847,0.0009114054],"category_scores_gemma":[0.0147941625,0.00031038348,0.0005583964,0.0008098083,0.0011251963,0.0034418327,0.0033603052,0.0014323824,0.0002663364],"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.0017218647,0.00062524824,0.093901224,0.00032048632,0.00027243167,0.0013673397,0.00066764734,0.5130986,0.0239768,0.058643717,0.005092503,0.30031225],"study_design_scores_gemma":[0.00000868941,0.00007232324,0.0008968953,0.000008314741,0.000010500969,0.00017367951,0.00007406411,0.97281116,0.003921107,0.021626959,0.00038852292,0.000007845445],"about_ca_topic_score_codex":0.0018984899,"about_ca_topic_score_gemma":0.0021607308,"teacher_disagreement_score":0.0020544543,"about_ca_system_score_codex":0.0008848618,"about_ca_system_score_gemma":0.001232749,"threshold_uncertainty_score":0.010865092},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36057255,0.011528309,0.4569044,0.0037197035,0.0019134268,0.00012834599,0.0006550569,0.0007958843,0.16378231],"genre_scores_gemma":[0.89429575,0.0041084294,0.051516306,0.0004364082,0.0012473643,0.000120548626,0.00034042879,0.0003060879,0.04762868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996499,0.00008744089,0.000021764781,0.000090793386,0.00009481323,0.000055224165],"domain_scores_gemma":[0.99936146,0.00021213735,0.00012194216,0.000060758317,0.00011434199,0.00012924804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040929814,0.00101923,0.0006628074,0.0024828506,0.00095506065,0.0041786213,0.0007323868,0.0010790768,0.0063544656],"category_scores_gemma":[0.0014825601,0.00047534882,0.0005024579,0.0015942324,0.002192053,0.003958072,0.0016544998,0.0016622166,0.0012295236],"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.000013109145,0.000004653309,0.000083225015,0.000024850888,0.0000030942017,0.000041729487,0.00021633318,0.00067353307,0.0010709733,0.99167246,0.0011666917,0.0050293524],"study_design_scores_gemma":[0.0000042336915,0.000029829373,0.00024675296,0.000013040787,0.000005589251,0.00010957085,0.00013398554,0.0073114354,0.00044161605,0.9822854,0.009406809,0.0000116620495],"about_ca_topic_score_codex":0.00074110884,"about_ca_topic_score_gemma":0.00069441367,"teacher_disagreement_score":0.0063544656,"about_ca_system_score_codex":0.0010367428,"about_ca_system_score_gemma":0.00032512788,"threshold_uncertainty_score":0.021257758},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83307785,0.00045930003,0.12916902,0.000441042,0.00010503626,0.000029502215,0.00023128315,0.00013007557,0.036356926],"genre_scores_gemma":[0.98638225,0.00015214195,0.008119505,0.00004243914,0.000017714616,0.00001433989,0.00022294318,0.000025913694,0.0050227125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999608,0.00004325316,0.00002387341,0.000086328524,0.00014342583,0.00009516373],"domain_scores_gemma":[0.9993161,0.00012992855,0.00011028608,0.00007399195,0.00010639042,0.00026326682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031122143,0.0004803231,0.00037114442,0.0015922178,0.0009196557,0.0023158146,0.00062832877,0.00043531548,0.006464739],"category_scores_gemma":[0.001315783,0.00031964912,0.00028445013,0.0008424814,0.0013318869,0.0031708207,0.003507683,0.0010915134,0.00055297755],"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.00008681718,0.00003501631,0.0018575524,0.00006334948,0.000013787078,0.00086137577,0.00066623464,0.0022269308,0.011785621,0.9672678,0.0008101783,0.014325225],"study_design_scores_gemma":[0.000029509409,0.00006745939,0.0024117748,0.00004191654,0.000027531225,0.0019294283,0.001303115,0.019853467,0.01411575,0.9450004,0.015183966,0.000035710615],"about_ca_topic_score_codex":0.00048519654,"about_ca_topic_score_gemma":0.00040171822,"teacher_disagreement_score":0.006464739,"about_ca_system_score_codex":0.0004660544,"about_ca_system_score_gemma":0.00017335924,"threshold_uncertainty_score":0.02162677},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062428568,0.0077308565,0.6659765,0.0033179426,0.0010937047,0.00020016737,0.000986794,0.0008186218,0.25744674],"genre_scores_gemma":[0.38849455,0.0075831967,0.48030534,0.0007644247,0.0012103211,0.00036802527,0.0016611598,0.00091870816,0.11869422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858654,0.00034192306,0.00009448855,0.00029977408,0.0005683138,0.00010898615],"domain_scores_gemma":[0.99571216,0.0028187525,0.00020032574,0.0004586226,0.000565692,0.0002444067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014093837,0.0011356826,0.0014543198,0.0056959526,0.002414082,0.0069288043,0.0026090627,0.0014922894,0.013886236],"category_scores_gemma":[0.008894444,0.000973005,0.0008528897,0.008192391,0.0037480404,0.013433436,0.0032035275,0.003907961,0.002230438],"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.00000812638,0.000010494866,0.0002204916,0.000091795875,0.0000071260315,0.000021373193,0.0001635928,0.0012036711,0.00035324256,0.9680463,0.0052542584,0.024619551],"study_design_scores_gemma":[0.0000017780425,0.0000034628313,0.00014425348,0.0000386864,0.000008280941,0.00007805565,0.00008823725,0.0056606755,0.00044760326,0.9826471,0.010873125,0.000008724773],"about_ca_topic_score_codex":0.0014939522,"about_ca_topic_score_gemma":0.0022824046,"teacher_disagreement_score":0.013886236,"about_ca_system_score_codex":0.0025140354,"about_ca_system_score_gemma":0.0007775353,"threshold_uncertainty_score":0.04645413},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079129495,0.0006612585,0.7892797,0.0051943106,0.00037086415,0.00012306153,0.0007456059,0.0006123062,0.1238834],"genre_scores_gemma":[0.81640345,0.00054713245,0.1581852,0.0009916902,0.00031784835,0.00033884638,0.00067373994,0.00017395073,0.022368087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990576,0.0003307539,0.00005474639,0.00016117534,0.00030698153,0.00008863947],"domain_scores_gemma":[0.99906176,0.0002561691,0.00008528102,0.00021417308,0.00020930317,0.00017332542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017399009,0.000548144,0.0005241485,0.002089993,0.0022253997,0.0038126137,0.0015028099,0.0013233268,0.009282464],"category_scores_gemma":[0.0019807017,0.00045071603,0.0010121197,0.0010498381,0.004711332,0.0061250012,0.0026500116,0.002083267,0.0010587601],"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.0000011110639,0.0000032975006,0.000022468746,0.000003901609,5.6581683e-7,0.00001002921,0.000039404364,0.00020526398,0.00012797344,0.99909365,0.00017233967,0.00032000392],"study_design_scores_gemma":[0.0000054392976,0.000016213397,0.0000660412,0.000009372567,0.000002363795,0.00008174497,0.00007537862,0.006937261,0.0005085889,0.984703,0.007587542,0.0000070698807],"about_ca_topic_score_codex":0.0007325159,"about_ca_topic_score_gemma":0.0009158934,"teacher_disagreement_score":0.009282464,"about_ca_system_score_codex":0.001686811,"about_ca_system_score_gemma":0.0011285772,"threshold_uncertainty_score":0.031052947},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11236666,0.0022601031,0.8573703,0.0030632433,0.00018233055,0.00008995948,0.0011916383,0.00054417836,0.022931548],"genre_scores_gemma":[0.8050221,0.002146016,0.1860675,0.0004033956,0.0004272747,0.00026099407,0.0017045574,0.00034192542,0.0036262993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970264,0.0011700727,0.00021543654,0.000707591,0.0007334512,0.00014704827],"domain_scores_gemma":[0.9908825,0.004023299,0.0012717958,0.0019257665,0.0012877684,0.00060886337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023744905,0.00054581376,0.0009067778,0.0047601718,0.0014539257,0.006408386,0.0012412784,0.0011578283,0.0034939675],"category_scores_gemma":[0.014876363,0.0005971267,0.0010925131,0.0026724087,0.007981804,0.0085428525,0.0047074207,0.0026952429,0.0009587923],"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.0000560584,0.000012453805,0.0011014693,0.00012160772,0.00003828261,0.00010904942,0.0006048213,0.008430928,0.0025653562,0.9613893,0.0012499961,0.024320612],"study_design_scores_gemma":[0.000007530048,0.000021349106,0.0006534375,0.000024533427,0.000011082935,0.00013672128,0.000110496534,0.017402755,0.0006137137,0.97436833,0.006633496,0.000016583881],"about_ca_topic_score_codex":0.000706649,"about_ca_topic_score_gemma":0.00045703922,"teacher_disagreement_score":0.006408386,"about_ca_system_score_codex":0.0012571154,"about_ca_system_score_gemma":0.00083546474,"threshold_uncertainty_score":0.012557626},"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040042037,0.0017857101,0.06117681,0.90451705,0.01988891,0.000097730175,0.00073486543,0.0007963313,0.0069984593],"genre_scores_gemma":[0.13986726,0.0018224017,0.043686926,0.7594319,0.038705394,0.0006501878,0.00030922127,0.0004840743,0.015042629],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9917685,0.0030110877,0.00072222826,0.0014796031,0.0025557338,0.0004628836],"domain_scores_gemma":[0.9500758,0.03646395,0.0021153907,0.0037461095,0.0067610657,0.0008376987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015502207,0.001404328,0.0015184538,0.0011421894,0.003961085,0.0028709676,0.0065633445,0.02024732,0.007614934],"category_scores_gemma":[0.06491242,0.0007653291,0.0019993228,0.0012281927,0.013064949,0.007078985,0.0036178415,0.025373245,0.0037447053],"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.00032532035,0.00005079905,0.0010030487,0.00039379645,0.0000847384,0.0012452122,0.0013268027,0.0042286953,0.0020666583,0.2106611,0.76542443,0.013189424],"study_design_scores_gemma":[0.00024376294,0.0002191584,0.0016959347,0.00041635428,0.00008516552,0.0014039828,0.0010628805,0.025472766,0.0094580315,0.36000717,0.59949964,0.00043504933],"about_ca_topic_score_codex":0.005464652,"about_ca_topic_score_gemma":0.004480055,"teacher_disagreement_score":0.02024732,"about_ca_system_score_codex":0.0030970692,"about_ca_system_score_gemma":0.0021062493,"threshold_uncertainty_score":0.08198446},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7329052,0.0009709539,0.15009066,0.00079190143,0.0002465064,0.00013630922,0.00085778284,0.00031400655,0.113686725],"genre_scores_gemma":[0.9685845,0.0004118256,0.016188106,0.0001272272,0.00018162913,0.00009676869,0.00085895247,0.00009483965,0.013456154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977202,0.000258611,0.00016712617,0.00043238455,0.0010592145,0.0003624099],"domain_scores_gemma":[0.9926629,0.003297735,0.0006829062,0.0009084612,0.0012238726,0.0012241924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015801657,0.00047111174,0.0005253507,0.0058066705,0.00259103,0.004025314,0.0010703289,0.0007895906,0.008401652],"category_scores_gemma":[0.007479919,0.0009048557,0.00082095515,0.0019674243,0.0034224228,0.007606744,0.0038570245,0.0026346683,0.0007649573],"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.0000830591,0.00004204256,0.0037817203,0.00004185258,0.00002029837,0.00031831433,0.0010298012,0.0011437533,0.0032132743,0.9767437,0.0013570152,0.012225181],"study_design_scores_gemma":[0.00003003464,0.00003513033,0.0060981177,0.000035380817,0.000039386454,0.00070842594,0.0005857231,0.009275594,0.00645455,0.9617762,0.014906532,0.00005498724],"about_ca_topic_score_codex":0.001936162,"about_ca_topic_score_gemma":0.0015102344,"teacher_disagreement_score":0.008401652,"about_ca_system_score_codex":0.0015051407,"about_ca_system_score_gemma":0.0005479901,"threshold_uncertainty_score":0.028106332},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73206043,0.0019913826,0.23972116,0.0014528708,0.00007933339,0.0001539384,0.0008237076,0.00023601644,0.023481097],"genre_scores_gemma":[0.9336927,0.0007162205,0.059621386,0.00013332807,0.00004479158,0.00012217498,0.0011443577,0.00005340984,0.004471623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989598,0.00022328853,0.000064584216,0.00027957794,0.00027907608,0.00019379414],"domain_scores_gemma":[0.995624,0.0025293757,0.0005888267,0.0004951807,0.0002911581,0.00047147193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059812726,0.0005633826,0.00065119716,0.001883573,0.001068119,0.003256959,0.0010497686,0.00095490366,0.0045447135],"category_scores_gemma":[0.004590668,0.00053068955,0.0007895804,0.0020956167,0.0025688745,0.0052856295,0.002131375,0.0019239251,0.00040414714],"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.00013446997,0.00010630747,0.0038491702,0.00019488207,0.00003415295,0.00032037022,0.00097078097,0.04204352,0.006224201,0.9176111,0.002315874,0.026195152],"study_design_scores_gemma":[0.000027113243,0.00003242469,0.0015080736,0.000043230713,0.00001581645,0.00036209027,0.00057220535,0.08767785,0.0030518319,0.90040433,0.0062756664,0.00002939908],"about_ca_topic_score_codex":0.0019060449,"about_ca_topic_score_gemma":0.0013450602,"teacher_disagreement_score":0.0045447135,"about_ca_system_score_codex":0.0014403557,"about_ca_system_score_gemma":0.00044590776,"threshold_uncertainty_score":0.015203536},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008644682,0.01443421,0.0051400103,0.087129556,0.804614,0.00013331916,0.0020474934,0.0008612105,0.0847757],"genre_scores_gemma":[0.024338689,0.016479705,0.0049769655,0.035362937,0.22222781,0.00036646047,0.0034992574,0.0010615642,0.6916865],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975176,0.00048334943,0.00020530127,0.0006303554,0.00094869675,0.00021482504],"domain_scores_gemma":[0.99572694,0.00081929844,0.00017133323,0.00030419094,0.0025984724,0.00037987626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001858196,0.0022847992,0.0035063645,0.005703478,0.0036438808,0.0036409032,0.003867557,0.0045520607,0.1631611],"category_scores_gemma":[0.009388864,0.0009124164,0.0025131258,0.0034949535,0.0016526796,0.0033615208,0.003100208,0.0035826336,0.0510201],"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.000033214936,0.0000138105315,0.000064188534,0.00020406624,0.00003201645,0.00012785773,0.000039469378,0.000116032395,0.00016255109,0.016024113,0.9740133,0.009169259],"study_design_scores_gemma":[0.00004993049,0.000035720484,0.0015393145,0.00019056458,0.000087797205,0.00036826922,0.000086101034,0.00093156163,0.00044521963,0.030403944,0.96578795,0.00007364028],"about_ca_topic_score_codex":0.02112879,"about_ca_topic_score_gemma":0.028244985,"teacher_disagreement_score":0.1631611,"about_ca_system_score_codex":0.00621143,"about_ca_system_score_gemma":0.0021710857,"threshold_uncertainty_score":0.5458282},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05585304,0.00026117134,0.92728627,0.0007978211,0.00012299865,0.000100378624,0.00041310972,0.0011486782,0.014016545],"genre_scores_gemma":[0.5875705,0.00048709646,0.3981841,0.0003108428,0.00020011456,0.00034956262,0.001160136,0.00054200523,0.011195705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976012,0.0008210665,0.00014552016,0.00045396772,0.0007518509,0.00022642272],"domain_scores_gemma":[0.9969688,0.0007975235,0.0002592058,0.0007513155,0.0007002783,0.000522902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029290218,0.0005898297,0.0006115218,0.003270678,0.0017345251,0.0037115826,0.0012619201,0.0008478933,0.005048779],"category_scores_gemma":[0.0054021534,0.00071914296,0.0011010891,0.0021425528,0.004998756,0.008125427,0.0074423817,0.0024938544,0.0013111901],"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.000011547182,0.000013412017,0.0005220691,0.000034654222,0.00000878564,0.00018472655,0.00063308416,0.000767255,0.0014410282,0.98779476,0.00080295454,0.007785732],"study_design_scores_gemma":[0.000011364974,0.000031692598,0.00058055716,0.000028981925,0.000014054415,0.0003032303,0.0004299798,0.009642229,0.0022263767,0.9654998,0.02120377,0.0000279659],"about_ca_topic_score_codex":0.00067678577,"about_ca_topic_score_gemma":0.0006967636,"teacher_disagreement_score":0.005048779,"about_ca_system_score_codex":0.0012859164,"about_ca_system_score_gemma":0.0011619107,"threshold_uncertainty_score":0.01688987},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010630045,0.01316324,0.47632045,0.05494669,0.09991706,0.00028499975,0.003387674,0.0029343497,0.3384155],"genre_scores_gemma":[0.21725039,0.022471301,0.21915038,0.026208375,0.150378,0.0007720982,0.008262764,0.0034965565,0.35201013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971245,0.000535629,0.00013182618,0.0008828187,0.00110208,0.00022313585],"domain_scores_gemma":[0.9868264,0.004581267,0.00094211183,0.0034015907,0.003016407,0.0012321026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002298978,0.0015246375,0.0009983074,0.002770204,0.0019459031,0.004673639,0.0028438629,0.0022382194,0.092798516],"category_scores_gemma":[0.014581468,0.0005482495,0.0013881248,0.0037674233,0.0032141872,0.008692689,0.0065601463,0.0053114695,0.042779256],"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.00011911692,0.00012329053,0.0008853141,0.00066586863,0.000058883255,0.00047024648,0.0003931708,0.0012987339,0.0021441109,0.59575945,0.2589458,0.13913606],"study_design_scores_gemma":[0.000021017115,0.00015488517,0.00089604885,0.0001674676,0.000058191163,0.0014963003,0.000110719,0.004339643,0.0015409319,0.3264569,0.6646617,0.00009616718],"about_ca_topic_score_codex":0.0010344589,"about_ca_topic_score_gemma":0.0013231006,"teacher_disagreement_score":0.092798516,"about_ca_system_score_codex":0.0014248773,"about_ca_system_score_gemma":0.0015237267,"threshold_uncertainty_score":0.31044197},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99282855,0.000054590382,0.0058562104,0.000055389966,0.000005730718,0.0000041745616,0.00006985447,0.00003881133,0.0010867062],"genre_scores_gemma":[0.9985877,0.000026102432,0.000825092,0.0000055183937,0.000006226897,0.000005876103,0.00009231523,0.000011159587,0.0004399882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972636,0.00006661886,0.000015713693,0.00005278637,0.00007229147,0.000066198336],"domain_scores_gemma":[0.997026,0.0012764547,0.0007373996,0.00025891582,0.0002576318,0.0004436156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055535126,0.0001852918,0.0003564821,0.0013925823,0.00047386423,0.0010945528,0.00057920004,0.0004162093,0.001745811],"category_scores_gemma":[0.004022379,0.000268239,0.00024231576,0.0005849216,0.00177032,0.001654269,0.0007701827,0.0004153595,0.00012450012],"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.0010753339,0.00022989612,0.046976607,0.00018800545,0.00007376462,0.0014400898,0.00086542853,0.4101132,0.048578493,0.47381845,0.0018147334,0.014825992],"study_design_scores_gemma":[0.000012201892,0.0000838242,0.013813653,0.00002175872,0.000009845809,0.00013711076,0.0001602087,0.9130221,0.0077089337,0.06451957,0.0004646705,0.000046037207],"about_ca_topic_score_codex":0.0013555625,"about_ca_topic_score_gemma":0.0011211551,"teacher_disagreement_score":0.001745811,"about_ca_system_score_codex":0.00066522794,"about_ca_system_score_gemma":0.00025492694,"threshold_uncertainty_score":0.005840361},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2716049,0.0006289753,0.6814564,0.0014915464,0.00044628105,0.00009452848,0.00043406535,0.00084595673,0.04299744],"genre_scores_gemma":[0.9551004,0.0003307956,0.020651331,0.00047884896,0.00025973684,0.00013348994,0.0002679217,0.00025568684,0.022521807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994574,0.000050390245,0.000024209943,0.00014929338,0.0002083596,0.000110290515],"domain_scores_gemma":[0.99711573,0.0011611542,0.00033352542,0.00033077656,0.00071886316,0.00033995137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054029294,0.00062906183,0.0007368308,0.0016803992,0.0016780946,0.001961695,0.001141464,0.0013844321,0.006994361],"category_scores_gemma":[0.005193981,0.00039618544,0.00063599297,0.0006116739,0.002690694,0.0032933345,0.0038354776,0.0022173233,0.0013171855],"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.00006216885,0.000021798838,0.0003831287,0.000055908742,0.0000137769675,0.00009912779,0.00019255442,0.010228976,0.0054054954,0.96985114,0.0018894312,0.011796429],"study_design_scores_gemma":[0.000021588492,0.0000905429,0.0003031652,0.000023682749,0.00001105513,0.00016437676,0.00008475458,0.10541864,0.004794209,0.884449,0.0045929807,0.000045995577],"about_ca_topic_score_codex":0.0010828752,"about_ca_topic_score_gemma":0.00050046656,"teacher_disagreement_score":0.006994361,"about_ca_system_score_codex":0.00068055437,"about_ca_system_score_gemma":0.0005796661,"threshold_uncertainty_score":0.023398459},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9188605,0.0009409677,0.06360865,0.00048292262,0.00003174703,0.000025442836,0.00014756258,0.00008069031,0.015821578],"genre_scores_gemma":[0.9878078,0.00036811785,0.009846418,0.00003082063,0.00007221464,0.000020140196,0.00013491946,0.000017855516,0.0017017053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999703,0.000051793213,0.000013408967,0.00008194427,0.00009789766,0.00005194919],"domain_scores_gemma":[0.99901164,0.0003314858,0.00022690615,0.000107000575,0.00012405704,0.00019885116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042786694,0.00041739596,0.00043317847,0.0033104317,0.0008640918,0.001454894,0.0007880492,0.00042688448,0.0039547835],"category_scores_gemma":[0.0018331358,0.00022208388,0.00037137553,0.0013535673,0.002313007,0.0052909995,0.001813406,0.00093367713,0.00017252352],"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.00005075103,0.000036819834,0.0068980535,0.00013553977,0.000020487541,0.00023669394,0.0007221067,0.0071980166,0.005202935,0.9666189,0.0005117364,0.012367859],"study_design_scores_gemma":[0.000008884766,0.0001115441,0.011195557,0.000039728446,0.000025112444,0.0005589105,0.00088961626,0.06460699,0.004102862,0.9121712,0.0062366407,0.000052893298],"about_ca_topic_score_codex":0.00074564724,"about_ca_topic_score_gemma":0.00066702423,"teacher_disagreement_score":0.0039547835,"about_ca_system_score_codex":0.0011417211,"about_ca_system_score_gemma":0.0003409066,"threshold_uncertainty_score":0.013230145},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016926352,0.0002008726,0.97662884,0.00049083325,0.00010948701,0.00019073562,0.00022270242,0.0019595767,0.0032705774],"genre_scores_gemma":[0.43508962,0.00020397147,0.5577436,0.00030085852,0.00010778454,0.00040990478,0.0007992085,0.00034012776,0.00500494],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767786,0.00038232878,0.00021320886,0.0004256853,0.0009993922,0.00030147634],"domain_scores_gemma":[0.9962644,0.0011009319,0.0002786306,0.0016971828,0.00051056105,0.0001482655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013740499,0.0005691197,0.001091844,0.0010948475,0.001133893,0.0022476697,0.0016355398,0.0011806053,0.0047004423],"category_scores_gemma":[0.0072189136,0.00040851446,0.0012194902,0.001133839,0.0015937802,0.004669436,0.0054639135,0.002106008,0.002278332],"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.0006293499,0.00026680596,0.0018839804,0.0003159308,0.00014661255,0.00040570612,0.00081399124,0.07598656,0.028498221,0.40737176,0.017182432,0.46649873],"study_design_scores_gemma":[0.00018384634,0.0003029325,0.0005311,0.000058607926,0.00005570827,0.00070008135,0.00023746953,0.58077466,0.030575184,0.37016207,0.016330333,0.00008808719],"about_ca_topic_score_codex":0.0009843512,"about_ca_topic_score_gemma":0.0010321037,"teacher_disagreement_score":0.0047004423,"about_ca_system_score_codex":0.0012751701,"about_ca_system_score_gemma":0.002293709,"threshold_uncertainty_score":0.0157246},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18944559,0.015397622,0.25927538,0.0027472826,0.00084597606,0.0000931621,0.0004088279,0.0005515565,0.5312345],"genre_scores_gemma":[0.88252544,0.0064762114,0.026613796,0.0004644977,0.00091116905,0.00008721454,0.0003099094,0.00010303488,0.08250878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997173,0.000042916017,0.000014779363,0.00006434247,0.00011491375,0.000045767327],"domain_scores_gemma":[0.99968517,0.00010098776,0.000052045856,0.000057114816,0.0000501789,0.00005448936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003998017,0.00040935026,0.0002631209,0.0017033329,0.0008791005,0.002620495,0.00045299047,0.00041436075,0.009829443],"category_scores_gemma":[0.0008947943,0.00016553103,0.00034817762,0.0013306241,0.0019211868,0.005431284,0.0016834193,0.001351895,0.0012833585],"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.0000015041027,0.0000052162422,0.00008469063,0.000025707366,0.000001781126,0.00002429815,0.0001960779,0.00017798934,0.00036707186,0.9908358,0.0005075988,0.0077722794],"study_design_scores_gemma":[0.000001700727,0.000023543955,0.00040455087,0.00003211853,0.000005009414,0.00018104044,0.00024328334,0.0012932047,0.0008241535,0.95716846,0.039815422,0.000007490289],"about_ca_topic_score_codex":0.00023327726,"about_ca_topic_score_gemma":0.00022669727,"teacher_disagreement_score":0.009829443,"about_ca_system_score_codex":0.0007653003,"about_ca_system_score_gemma":0.00026929655,"threshold_uncertainty_score":0.03288275},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52941364,0.009757487,0.088879414,0.046080865,0.0013947584,0.000061586354,0.0005726474,0.0003472669,0.32349232],"genre_scores_gemma":[0.9817291,0.0006566939,0.0039217677,0.0015086397,0.00034329423,0.00002933198,0.00012293117,0.000038178336,0.011650117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981438,0.0006075954,0.000094630755,0.000512469,0.00035439982,0.00028724296],"domain_scores_gemma":[0.99594194,0.0025906418,0.00019053208,0.00033948722,0.00052282144,0.00041453866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002730093,0.0003784396,0.00075335393,0.0014129168,0.0021417588,0.0037920107,0.0008345143,0.0023381328,0.007848452],"category_scores_gemma":[0.008250155,0.0003243378,0.0005989259,0.0010380697,0.008092536,0.00821402,0.0029865068,0.0025139758,0.00084975356],"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.000051060597,0.000009657194,0.00057429285,0.0000245119,0.000005299453,0.00007978827,0.00044056692,0.00019675076,0.000346525,0.99336773,0.0021971248,0.0027066844],"study_design_scores_gemma":[0.000016888624,0.000012069374,0.00041572604,0.000017948929,0.0000054767193,0.00014721986,0.00049643894,0.0008421138,0.0006328489,0.9873749,0.010025893,0.000012351527],"about_ca_topic_score_codex":0.0016134175,"about_ca_topic_score_gemma":0.00075597555,"teacher_disagreement_score":0.007848452,"about_ca_system_score_codex":0.0031147655,"about_ca_system_score_gemma":0.0005965803,"threshold_uncertainty_score":0.026255667},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53651935,0.00086318067,0.45012856,0.002219771,0.00008210611,0.00003959049,0.0003856911,0.00027572314,0.009486014],"genre_scores_gemma":[0.9444969,0.00033187235,0.05414218,0.000086612396,0.000088730136,0.000041495503,0.000097756856,0.000042696014,0.00067171385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995308,0.00022221917,0.000017951934,0.00007043651,0.00011255335,0.000045954795],"domain_scores_gemma":[0.9965838,0.0018135796,0.00042341335,0.00067204155,0.00025143966,0.00025577025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014002969,0.00038883172,0.0005013695,0.0021575307,0.0008788197,0.0023320066,0.00068778923,0.000936621,0.0014898549],"category_scores_gemma":[0.0062562595,0.0003943718,0.0004795678,0.0015723252,0.004350748,0.004536997,0.0027005805,0.0011977656,0.00013313457],"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.00002235392,0.00002231958,0.0014485727,0.000057502024,0.000013733907,0.0000892218,0.00042415046,0.017048365,0.002102716,0.9730032,0.00027980495,0.0054881643],"study_design_scores_gemma":[0.0000072629095,0.000016871576,0.0006788639,0.000011996792,0.0000053639674,0.000039993654,0.00013601908,0.13103409,0.00048260676,0.8660755,0.0014992595,0.00001228609],"about_ca_topic_score_codex":0.0012043426,"about_ca_topic_score_gemma":0.00079789996,"teacher_disagreement_score":0.0023320066,"about_ca_system_score_codex":0.0010231745,"about_ca_system_score_gemma":0.0005002107,"threshold_uncertainty_score":0.007423699},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.568302,0.00037010433,0.42594495,0.000399533,0.000043481974,0.00013201963,0.00044888793,0.0003370227,0.0040220963],"genre_scores_gemma":[0.9321902,0.00011022393,0.06570084,0.000055320677,0.000027635486,0.00011843812,0.00041390443,0.000098894496,0.0012846163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99552083,0.0019172966,0.00026634298,0.00091972935,0.000986724,0.0003891528],"domain_scores_gemma":[0.96830183,0.022782436,0.002963742,0.0030570924,0.001738019,0.0011567748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003851262,0.0006184051,0.0014521928,0.005850321,0.0015719876,0.0037105246,0.0021497847,0.0015426332,0.005536622],"category_scores_gemma":[0.034291327,0.00069272815,0.0011752683,0.0027158158,0.0029035113,0.006133088,0.0030590235,0.0014152424,0.000406905],"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.0003089363,0.00013741256,0.02902657,0.0002756731,0.00022640079,0.00040836915,0.001140889,0.38361683,0.008327398,0.5412849,0.0016581245,0.03358837],"study_design_scores_gemma":[0.000011812046,0.000030751256,0.002512752,0.00003069951,0.000018336008,0.00017012129,0.00022026335,0.7427898,0.0024134705,0.2508459,0.0009149369,0.000041239142],"about_ca_topic_score_codex":0.0030804176,"about_ca_topic_score_gemma":0.0032716668,"teacher_disagreement_score":0.005850321,"about_ca_system_score_codex":0.0022078499,"about_ca_system_score_gemma":0.0007286428,"threshold_uncertainty_score":0.020367682},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9799722,0.00014981216,0.017179513,0.00010352443,0.000011523718,0.00001058081,0.000859707,0.00015360299,0.001559507],"genre_scores_gemma":[0.99758506,0.00005790131,0.0018016539,0.000011689623,0.00000581579,0.000008906406,0.0002936951,0.000019062294,0.00021617072],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999132,0.00001706768,0.0000046666532,0.000033367913,0.000015354326,0.00001626807],"domain_scores_gemma":[0.9996903,0.00012816433,0.00006393271,0.000045941448,0.000037361748,0.000034295495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019996006,0.00015179603,0.00016634066,0.0006962678,0.00015178592,0.00045361771,0.00015833277,0.00019427149,0.002021072],"category_scores_gemma":[0.0014396042,0.00013115205,0.00011614772,0.00042124809,0.00038234968,0.00044943905,0.00028476652,0.00023123047,0.00013724597],"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.0007768295,0.00009696436,0.057646733,0.00027025142,0.00032615397,0.00048213376,0.00093788083,0.017951073,0.84027153,0.0055370107,0.002733169,0.0729703],"study_design_scores_gemma":[0.000020192705,0.00013181483,0.86429644,0.000026571963,0.00009873793,0.00074107497,0.0004986491,0.06593287,0.05378553,0.0126288105,0.0017659116,0.00007336411],"about_ca_topic_score_codex":0.0013685549,"about_ca_topic_score_gemma":0.002674556,"teacher_disagreement_score":0.002021072,"about_ca_system_score_codex":0.00018897322,"about_ca_system_score_gemma":0.00011764494,"threshold_uncertainty_score":0.0067611933},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018319365,0.99372697,0.0028999923,0.0006452207,0.000470581,0.0000098372,0.000058127258,0.000030476278,0.0019755824],"genre_scores_gemma":[0.0012100881,0.9954893,0.0019150083,0.00026475,0.00041364157,0.000014802143,0.000074619646,0.000007342709,0.00061043067],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997749,0.00004349063,0.000035638477,0.0000438779,0.0000840684,0.00001808559],"domain_scores_gemma":[0.9991891,0.0005030017,0.00006712467,0.00003076393,0.0001656681,0.000044308894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007792488,0.0010576647,0.0011861145,0.0036194664,0.0003403359,0.0010537107,0.0008599402,0.001054025,0.00405361],"category_scores_gemma":[0.0017338572,0.00048053832,0.00065340626,0.005367273,0.00069482776,0.0023614427,0.00076495943,0.0018724361,0.0020702977],"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.00003582409,0.00006265656,0.00024155737,0.018700272,0.00011394312,0.00013723796,0.00007628564,0.0017727228,0.001460256,0.025574038,0.05487,0.89695513],"study_design_scores_gemma":[0.000008984463,0.0000760938,0.000648523,0.0040588235,0.000108003595,0.0007739736,0.000043540043,0.00093840883,0.00072687183,0.01174034,0.9808328,0.000043571777],"about_ca_topic_score_codex":0.0013846542,"about_ca_topic_score_gemma":0.001858618,"teacher_disagreement_score":0.00405361,"about_ca_system_score_codex":0.0007968077,"about_ca_system_score_gemma":0.0017662512,"threshold_uncertainty_score":0.013560712},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05195414,0.00021383697,0.94498754,0.0003284409,0.000016532735,0.000032074124,0.00008043702,0.0005225561,0.0018645085],"genre_scores_gemma":[0.8675061,0.00040904304,0.1283744,0.00023533312,0.00006645952,0.0001306393,0.0003048203,0.00029550862,0.002677642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986772,0.0002815277,0.000086989276,0.00047232548,0.00029198354,0.00018983523],"domain_scores_gemma":[0.98633844,0.009260644,0.0009627104,0.002170733,0.000730462,0.00053701614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036147973,0.0008690354,0.0014624073,0.0013311458,0.0008740645,0.002103126,0.0020363089,0.001825386,0.0021926297],"category_scores_gemma":[0.022512332,0.00096220017,0.0020244797,0.00058577326,0.0039095,0.0056394585,0.0048523354,0.0031293465,0.0003532348],"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.00017028266,0.000067104054,0.0036646344,0.00022285416,0.000074801035,0.00027036463,0.0006664458,0.4290916,0.007450324,0.5224924,0.000947769,0.034881435],"study_design_scores_gemma":[0.000014016912,0.000043180607,0.00042564012,0.000022305765,0.000021199612,0.00011676579,0.00003111289,0.84442097,0.0025125167,0.15152322,0.0008470001,0.00002204228],"about_ca_topic_score_codex":0.0027891942,"about_ca_topic_score_gemma":0.002072065,"teacher_disagreement_score":0.0036147973,"about_ca_system_score_codex":0.0015980889,"about_ca_system_score_gemma":0.00087116886,"threshold_uncertainty_score":0.019117117},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48699936,0.0017369601,0.48909396,0.0006752068,0.00013184319,0.00020223754,0.0033216872,0.000831077,0.01700773],"genre_scores_gemma":[0.9418564,0.00028058013,0.056073498,0.000060701524,0.0000740786,0.00009983967,0.00093160087,0.000095283845,0.00052801584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985209,0.00030915433,0.00012462371,0.0002642968,0.0006926819,0.00008831753],"domain_scores_gemma":[0.9898363,0.0052452693,0.0021779728,0.0010602087,0.0011861658,0.0004941481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017457844,0.00050983764,0.0004519762,0.005082826,0.0004230356,0.002313642,0.00046040904,0.0006444661,0.0035946083],"category_scores_gemma":[0.016291868,0.00022324601,0.0005105625,0.002545208,0.0016748465,0.0035621147,0.0015456473,0.0007999487,0.00032164867],"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.0009466089,0.000339304,0.18639098,0.002720276,0.0010563892,0.00075607974,0.005679244,0.058836028,0.23418401,0.20750184,0.012303577,0.28928566],"study_design_scores_gemma":[0.00006459338,0.00069508504,0.48344967,0.00029784252,0.00026754633,0.0021730287,0.0029463307,0.20820493,0.033868812,0.24479571,0.022819823,0.00041656825],"about_ca_topic_score_codex":0.0007707832,"about_ca_topic_score_gemma":0.00100859,"teacher_disagreement_score":0.005082826,"about_ca_system_score_codex":0.0006099996,"about_ca_system_score_gemma":0.00028168233,"threshold_uncertainty_score":0.0120251775},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068183844,0.000548444,0.98575807,0.00051769405,0.000104179555,0.00005935802,0.0006806174,0.0041685156,0.0013447423],"genre_scores_gemma":[0.26094005,0.0017469707,0.7212716,0.0006229652,0.00033589467,0.0005535702,0.006616383,0.0021739476,0.005738622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983974,0.0006233226,0.00008091137,0.00038651086,0.00042503912,0.000086778746],"domain_scores_gemma":[0.9944946,0.0028859114,0.0004568701,0.0013550357,0.00057029683,0.00023729837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021058375,0.0017053247,0.0012266735,0.0026242526,0.00072839606,0.0031095643,0.0029038468,0.0020109937,0.0050000204],"category_scores_gemma":[0.01633668,0.00073600514,0.001534891,0.0028760512,0.0014835655,0.008074042,0.003927878,0.004218884,0.0026580682],"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.00029360686,0.00025454836,0.0031348723,0.0006388943,0.00022982497,0.00021859808,0.00043911437,0.3245112,0.0049881213,0.2158669,0.037392266,0.41203195],"study_design_scores_gemma":[0.000016785783,0.000054441825,0.00019049004,0.00003520494,0.000016932656,0.0000809287,0.000040344767,0.8502118,0.0013962617,0.14208111,0.005851385,0.000024334313],"about_ca_topic_score_codex":0.0019005528,"about_ca_topic_score_gemma":0.0027413773,"teacher_disagreement_score":0.0050000204,"about_ca_system_score_codex":0.0010521464,"about_ca_system_score_gemma":0.000987043,"threshold_uncertainty_score":0.016726732},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23790105,0.002596679,0.6450527,0.009239881,0.0012197741,0.000105665946,0.0005805152,0.001251669,0.102052175],"genre_scores_gemma":[0.93010825,0.0010115638,0.039955124,0.0008233455,0.0007989951,0.000055522392,0.00032302382,0.0002576272,0.026666628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870765,0.0002757588,0.00006676482,0.00034542347,0.00044833124,0.00015599627],"domain_scores_gemma":[0.9985424,0.00046710818,0.00015837255,0.00030995038,0.00029892387,0.00022331193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013734056,0.0005270379,0.0009946736,0.002406778,0.0013128133,0.0035940106,0.0010679079,0.0012642768,0.008076769],"category_scores_gemma":[0.0036590258,0.0005077851,0.0008030908,0.0013430408,0.0043281284,0.008719026,0.003477991,0.0028925089,0.0011177761],"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.0000074173718,0.000005721526,0.00007330275,0.000008651144,0.0000021724707,0.000013799751,0.00008491663,0.00032157204,0.00021885891,0.9963492,0.0004072222,0.0025071835],"study_design_scores_gemma":[0.000004199542,0.0000069544676,0.00011100587,0.000003910937,0.0000024350163,0.00003694686,0.000042744938,0.0035816617,0.00013324988,0.99436176,0.001707566,0.0000075387734],"about_ca_topic_score_codex":0.0013042713,"about_ca_topic_score_gemma":0.00085955433,"teacher_disagreement_score":0.008076769,"about_ca_system_score_codex":0.0016703232,"about_ca_system_score_gemma":0.0006088101,"threshold_uncertainty_score":0.027019441},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054078452,0.001219121,0.9255959,0.0043121115,0.0001222811,0.000056072902,0.00022712773,0.0003907051,0.013998288],"genre_scores_gemma":[0.85445553,0.0014531941,0.13767156,0.00058417884,0.0005390162,0.00022738933,0.0004250206,0.00017642297,0.004467624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970476,0.0010345756,0.00016910472,0.0005185819,0.001016108,0.00021396259],"domain_scores_gemma":[0.98793495,0.005959382,0.0009055452,0.0027514528,0.001601446,0.0008471802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004489819,0.00057311135,0.0007767136,0.0034893006,0.0020837113,0.0064421636,0.0020866422,0.0014278725,0.0048625185],"category_scores_gemma":[0.016180458,0.000561509,0.00089952874,0.002855369,0.012435099,0.016221194,0.009135594,0.003746828,0.0006976334],"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.000006595703,0.000008580836,0.00041783042,0.000032612243,0.000004896926,0.000037071102,0.00029378154,0.0009868075,0.00033110383,0.9913556,0.00023174677,0.006293343],"study_design_scores_gemma":[0.00000355465,0.00001555346,0.00024741094,0.000020617055,0.0000048979373,0.00008589277,0.00016876608,0.00925721,0.00042945298,0.9851752,0.0045804624,0.000011181827],"about_ca_topic_score_codex":0.001145807,"about_ca_topic_score_gemma":0.0007309978,"teacher_disagreement_score":0.0064421636,"about_ca_system_score_codex":0.0019149858,"about_ca_system_score_gemma":0.00209293,"threshold_uncertainty_score":0.023744762},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8857437,0.00025598521,0.08441441,0.0007944294,0.00006430477,0.000036450714,0.012458002,0.004001013,0.0122317085],"genre_scores_gemma":[0.97800434,0.000043095617,0.014762395,0.000079555466,0.000020308624,0.000017990436,0.0062150494,0.00037361827,0.00048368124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949,0.0002273528,0.000025588877,0.000089261586,0.00011766394,0.000049987288],"domain_scores_gemma":[0.9969542,0.0013865428,0.00034253713,0.0007461406,0.00037220618,0.00019834627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023445773,0.00031557225,0.00028639362,0.0008004984,0.00030273345,0.0011443426,0.0005116128,0.00037833137,0.003768395],"category_scores_gemma":[0.008963757,0.0001693129,0.0006387645,0.00090534694,0.00046131774,0.0005376457,0.000730479,0.0005884904,0.0006452952],"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.00078154216,0.0000869149,0.28106597,0.00016529768,0.0006262885,0.00028698158,0.00028999138,0.5896216,0.004785139,0.04478701,0.026422195,0.051081024],"study_design_scores_gemma":[0.00009512074,0.00006434399,0.082136005,0.000051171093,0.00005818719,0.00010389948,0.00014217298,0.8816449,0.0046233954,0.021856593,0.009169544,0.000054693723],"about_ca_topic_score_codex":0.02431485,"about_ca_topic_score_gemma":0.02052846,"teacher_disagreement_score":0.02431485,"about_ca_system_score_codex":0.00059651723,"about_ca_system_score_gemma":0.00067098264,"threshold_uncertainty_score":0.04834664},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1107311,0.00082818384,0.8822958,0.0015128684,0.000044254193,0.000028535595,0.00012036249,0.0003392273,0.004099745],"genre_scores_gemma":[0.9211215,0.0005490003,0.07583359,0.00029089526,0.00017955959,0.00012991378,0.00018752705,0.00023709236,0.0014709878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973876,0.0012531899,0.00017283559,0.0005495425,0.00049610896,0.0001406657],"domain_scores_gemma":[0.97832096,0.014013985,0.0023749196,0.0033186194,0.0012985284,0.0006730027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062595364,0.0008019017,0.00096905656,0.002161791,0.00090289774,0.0022887483,0.0011740508,0.0013073045,0.0015212377],"category_scores_gemma":[0.03514572,0.00064633385,0.0009135319,0.00083011546,0.009064485,0.006070993,0.004487686,0.0025906973,0.00033075886],"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.00013743229,0.000030254661,0.003357722,0.00014300486,0.00006830293,0.00017496526,0.0005604898,0.15248588,0.0044146604,0.803494,0.0012902273,0.03384307],"study_design_scores_gemma":[0.000018620474,0.00010230504,0.0012965758,0.000043824875,0.000011759521,0.00014627894,0.0000603377,0.23495393,0.0020912895,0.75968975,0.0015602305,0.000025143141],"about_ca_topic_score_codex":0.00055597624,"about_ca_topic_score_gemma":0.0004002616,"teacher_disagreement_score":0.0062595364,"about_ca_system_score_codex":0.0013842428,"about_ca_system_score_gemma":0.00046542467,"threshold_uncertainty_score":0.033103943},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021013909,0.00011105627,0.00003784847,0.00013309694,0.000018600742,0.000010974667,0.9969292,0.00006091223,0.00059694645],"genre_scores_gemma":[0.008841617,0.00021656066,0.00020501595,0.00006766759,0.000015149002,0.00008011743,0.9885621,0.00002830433,0.0019834486],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.99864966,0.00009825791,0.00016782293,0.00022692996,0.0004938695,0.0003634633],"domain_scores_gemma":[0.9930361,0.0008472649,0.0008252488,0.00049824006,0.0040695737,0.0007236367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013053766,0.0012517716,0.0012126057,0.005696155,0.0010395141,0.0021631792,0.0023513082,0.0010799437,0.010734246],"category_scores_gemma":[0.011898052,0.0005107613,0.0012245465,0.014441431,0.00059533527,0.0010716761,0.0016735538,0.0018849443,0.0070896414],"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.00022821566,0.000038626193,0.063525796,0.0006089806,0.00012979165,0.000039425457,0.00017213533,0.00078252814,0.00005957979,0.00092432497,0.92854047,0.0049501536],"study_design_scores_gemma":[0.00038825336,0.00004647739,0.42143184,0.0010264297,0.00019790084,0.00016265301,0.0019211478,0.0017172579,0.0004059198,0.00092684577,0.5716469,0.00012841648],"about_ca_topic_score_codex":0.9267525,"about_ca_topic_score_gemma":0.94317734,"teacher_disagreement_score":0.07324749,"about_ca_system_score_codex":0.0087339915,"about_ca_system_score_gemma":0.019157546,"threshold_uncertainty_score":0.1473577},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99862516,0.000070537906,0.00077360444,0.00008473409,0.0000046305468,0.000012182889,0.00012515712,0.000002412057,0.00030159342],"genre_scores_gemma":[0.9993193,0.000051565,0.0003633889,0.0000152366265,0.0000036798583,0.000017157436,0.0001451518,7.4329904e-7,0.00008372676],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9975762,0.0016684076,0.00009456486,0.00021353771,0.00016782615,0.00027951627],"domain_scores_gemma":[0.9930795,0.0030407824,0.0024053135,0.0007531465,0.00037442052,0.00034674534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004104082,0.00025957567,0.0002589466,0.00057627,0.0004581303,0.0005598128,0.00039468321,0.0003203401,0.0007549882],"category_scores_gemma":[0.009141069,0.00015961837,0.00044230535,0.0007721489,0.00044763618,0.0005743571,0.0009544197,0.00047829843,0.00009844379],"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.000100889476,0.00014077878,0.98942834,0.000020299569,0.00009856826,0.00008979502,0.00057463796,0.0026611262,0.00017960143,0.00041857865,0.00009850201,0.0061888406],"study_design_scores_gemma":[0.000006267382,0.0004605626,0.987519,0.000022490252,0.00004678649,0.00006749112,0.0021648344,0.008217138,0.0002644409,0.00071678526,0.00050389935,0.000010401694],"about_ca_topic_score_codex":0.011115706,"about_ca_topic_score_gemma":0.0151863815,"teacher_disagreement_score":0.011115706,"about_ca_system_score_codex":0.0006133222,"about_ca_system_score_gemma":0.0009098289,"threshold_uncertainty_score":0.022101998},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020383336,0.0020328185,0.020898057,0.09179225,0.1162504,0.024078283,0.027602946,0.002702288,0.69425964],"genre_scores_gemma":[0.03386952,0.0010598176,0.011953775,0.0128287785,0.00396963,0.010365759,0.012720559,0.0012669673,0.9119652],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99186313,0.0017260034,0.00030814472,0.00093303743,0.002773382,0.002396315],"domain_scores_gemma":[0.97988325,0.0013089839,0.00025912898,0.00089139125,0.007268281,0.010389055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014032923,0.0016329888,0.00059719477,0.0016320521,0.006043393,0.007053899,0.002706484,0.005754348,0.1585923],"category_scores_gemma":[0.012435036,0.0007158547,0.0013518423,0.0008180033,0.00095039036,0.002731585,0.0075716246,0.0054061823,0.09062712],"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.00018977914,0.00042071188,0.0008164744,0.00021496284,0.000010964458,0.00081102573,0.0010177126,0.00023198957,0.0017475139,0.0047568968,0.9639946,0.025787229],"study_design_scores_gemma":[0.000035551737,0.000058731737,0.0010997959,0.000067667606,0.000003710792,0.00007906763,0.0022278018,0.000080661855,0.00055768556,0.0011249812,0.99464107,0.000023193003],"about_ca_topic_score_codex":0.012878893,"about_ca_topic_score_gemma":0.024727559,"teacher_disagreement_score":0.1585923,"about_ca_system_score_codex":0.0041459445,"about_ca_system_score_gemma":0.02184949,"threshold_uncertainty_score":0.5305441},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58540463,0.004133667,0.013488723,0.002496664,0.00018695394,0.00032020197,0.022548659,0.00039961137,0.3710208],"genre_scores_gemma":[0.7225537,0.0037382753,0.022280375,0.0006731873,0.00007487667,0.0002417717,0.02030701,0.00030845136,0.22982238],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99924517,0.00012014427,0.0000261754,0.0002066763,0.0002880084,0.00011377028],"domain_scores_gemma":[0.99878424,0.00031644932,0.00019209793,0.00022499297,0.0003781754,0.00010415805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069892575,0.00032937306,0.00032527142,0.0037494493,0.0011545924,0.0012816163,0.00066001265,0.0004681444,0.025713427],"category_scores_gemma":[0.002000005,0.00027771914,0.00022379459,0.0059437337,0.0010148755,0.00080669916,0.0008742173,0.0005372034,0.005088863],"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.00023727282,0.000058369238,0.40661246,0.000808132,0.00014265398,0.0015214175,0.02811022,0.0011408634,0.010056234,0.043572366,0.061649255,0.44609064],"study_design_scores_gemma":[0.000007407222,0.00005804242,0.52274895,0.00026446074,0.000044386703,0.0011395371,0.0055528325,0.00050363084,0.00213405,0.002733201,0.4647716,0.00004183215],"about_ca_topic_score_codex":0.10975501,"about_ca_topic_score_gemma":0.2885266,"teacher_disagreement_score":0.10975501,"about_ca_system_score_codex":0.00205207,"about_ca_system_score_gemma":0.0022366247,"threshold_uncertainty_score":0.21823233},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93368846,0.00008264347,0.0010863569,0.00008549559,0.000008136177,0.000060390124,0.058154922,0.00013048013,0.0067032445],"genre_scores_gemma":[0.9659282,0.00007213089,0.0012556723,0.000013790337,0.000003667076,0.00008569997,0.027566629,0.000041813895,0.005032382],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9995628,0.00003103359,0.00003744183,0.00013937821,0.00016349772,0.0000658491],"domain_scores_gemma":[0.9981325,0.00021751643,0.0004268067,0.00015089153,0.0008421304,0.00023006828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003873664,0.00012557904,0.00021632429,0.0015448123,0.0007424566,0.000635863,0.00049032265,0.00017470734,0.0032945918],"category_scores_gemma":[0.0022459198,0.00016549995,0.00016365683,0.0028399092,0.00043858794,0.00029513348,0.00066990533,0.00015153241,0.0004572314],"study_design_candidate":"observational","study_design_consensus":"observational","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.00020105725,0.000017353164,0.9707792,0.000066828405,0.000059389968,0.000099773846,0.0016810045,0.00266972,0.001672739,0.0007151467,0.010090577,0.011947114],"study_design_scores_gemma":[0.000009040599,0.000007474006,0.99408543,0.000012382573,0.00001349218,0.000018580717,0.000567358,0.0016655258,0.00032807176,0.00014007596,0.0031432896,0.000009081558],"about_ca_topic_score_codex":0.917579,"about_ca_topic_score_gemma":0.9741978,"teacher_disagreement_score":0.082421005,"about_ca_system_score_codex":0.0067377,"about_ca_system_score_gemma":0.0052113524,"threshold_uncertainty_score":0.16581273},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006013018,0.0005413882,0.12637857,0.00044617287,0.0006478752,0.00025677288,0.10135991,0.740008,0.029760014],"genre_scores_gemma":[0.009637993,0.0008328036,0.12307419,0.0014991409,0.00023296056,0.0014328107,0.22912753,0.5835463,0.050616287],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99910873,0.0001286517,0.00008428459,0.00019266845,0.00032567934,0.00016001347],"domain_scores_gemma":[0.9988275,0.00023724443,0.000069051086,0.00028836692,0.00039969766,0.00017807719],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018095676,0.0025290812,0.0015894937,0.0016792301,0.0009912777,0.0040755533,0.0056676692,0.0016980764,0.36834794],"category_scores_gemma":[0.004570513,0.0025400189,0.002319144,0.0013329643,0.0006230283,0.005357479,0.0047803987,0.0045814128,0.37984824],"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.00010647706,0.000017160355,0.00011892635,0.00033948792,0.00003403682,0.000043977496,0.000068641944,0.00036676743,0.0014770018,0.0020144987,0.9788057,0.016607225],"study_design_scores_gemma":[0.0001698967,0.00003599164,0.0010631438,0.0002276068,0.00003306255,0.0002757217,0.000060750823,0.00640484,0.0071341456,0.011554601,0.9728642,0.00017601144],"about_ca_topic_score_codex":0.003663545,"about_ca_topic_score_gemma":0.005473662,"teacher_disagreement_score":0.36834794,"about_ca_system_score_codex":0.00090322306,"about_ca_system_score_gemma":0.0017818589,"threshold_uncertainty_score":0.900975},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02685412,0.0005288122,0.010194784,0.0002557937,0.00014251706,0.00015917391,0.9371973,0.022119995,0.002547384],"genre_scores_gemma":[0.010099204,0.000085634805,0.010113579,0.000054931334,0.000008893353,0.000254146,0.97823036,0.0007035792,0.00044972397],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990012,0.00022935985,0.00007135957,0.000418303,0.0001794746,0.00010034964],"domain_scores_gemma":[0.9985493,0.0006310543,0.00009820542,0.00045971692,0.00019286713,0.00006891793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017553938,0.003212156,0.0012010861,0.0024707855,0.0012831991,0.001421994,0.003160365,0.0019710325,0.013990721],"category_scores_gemma":[0.0058767353,0.00095720135,0.0023873136,0.0035862324,0.000636331,0.00091599685,0.0015905449,0.0016811482,0.012081915],"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.0020551283,0.0004311704,0.012892678,0.0041850954,0.0011839756,0.0005489462,0.00038592407,0.06268861,0.009415077,0.00655213,0.86578375,0.033877473],"study_design_scores_gemma":[0.0035279316,0.0005773201,0.020820893,0.000453476,0.00060389534,0.0010150743,0.00043866492,0.19152635,0.022865761,0.02370417,0.734259,0.00020744633],"about_ca_topic_score_codex":0.0073656198,"about_ca_topic_score_gemma":0.0168026,"teacher_disagreement_score":0.013990721,"about_ca_system_score_codex":0.0011392175,"about_ca_system_score_gemma":0.0014531278,"threshold_uncertainty_score":0.046803653},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3413631,0.0014721185,0.6346249,0.0017838144,0.00013192261,0.00007048135,0.0011681918,0.000461848,0.018923594],"genre_scores_gemma":[0.9431626,0.00061069004,0.053080995,0.00012345251,0.00010990089,0.000057809844,0.000506121,0.00013450488,0.0022139277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989994,0.00036738007,0.000087758715,0.00019623821,0.00024056199,0.00010870033],"domain_scores_gemma":[0.9932105,0.0032576735,0.001093931,0.0013401015,0.00068624737,0.00041158276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019012993,0.0003684147,0.00043148056,0.0052510845,0.0010228251,0.0042851125,0.0007198845,0.0007396773,0.002807936],"category_scores_gemma":[0.0101572815,0.00031627738,0.00047124014,0.0028308239,0.0032161355,0.008961097,0.002551637,0.0012563536,0.00032319143],"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.000033965352,0.000009323732,0.00077334244,0.00005123976,0.000009543527,0.000092163245,0.0005023132,0.0066940556,0.0012443013,0.9814678,0.00041686662,0.008705071],"study_design_scores_gemma":[0.0000044623926,0.000015799807,0.00043526344,0.000026596847,0.0000134517095,0.00006592539,0.00026565779,0.034177724,0.0013573812,0.9583038,0.005315272,0.000018752773],"about_ca_topic_score_codex":0.0007570941,"about_ca_topic_score_gemma":0.0007994091,"teacher_disagreement_score":0.0052510845,"about_ca_system_score_codex":0.0011780368,"about_ca_system_score_gemma":0.00042956436,"threshold_uncertainty_score":0.010055125},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85472655,0.0013713104,0.118403986,0.002307725,0.00030479376,0.00013297921,0.0019267729,0.0010916318,0.019734332],"genre_scores_gemma":[0.97357506,0.00087974494,0.019369746,0.00020200641,0.00009301405,0.000089979236,0.0003431842,0.00007187815,0.0053754766],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999124,0.000031931908,0.0000050910503,0.000024545814,0.000014475969,0.000011580564],"domain_scores_gemma":[0.9997825,0.00014840419,0.00001393168,0.000019117864,0.00001594858,0.000020040317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032514834,0.00019821161,0.00022265507,0.00029898685,0.00025521926,0.0009063917,0.00021688853,0.0009141167,0.0050123194],"category_scores_gemma":[0.0010227453,0.0002395258,0.00022639443,0.00024366971,0.0004019402,0.0002621601,0.00030866248,0.0003729828,0.0005216659],"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.0036040747,0.00072758703,0.042705752,0.0010165792,0.00018501512,0.01534127,0.0026835967,0.2346796,0.39981666,0.02164089,0.024807805,0.25279123],"study_design_scores_gemma":[0.00047074212,0.0046205143,0.24398991,0.00034531724,0.00031367192,0.02504513,0.0017335837,0.60892403,0.054968428,0.019772844,0.03949935,0.0003164681],"about_ca_topic_score_codex":0.0017218556,"about_ca_topic_score_gemma":0.0016881588,"teacher_disagreement_score":0.0050123194,"about_ca_system_score_codex":0.00019537735,"about_ca_system_score_gemma":0.00034783475,"threshold_uncertainty_score":0.016767919},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1462875,0.011859302,0.33486316,0.0013212834,0.0017177078,0.00013811683,0.0008644261,0.0022680513,0.5006805],"genre_scores_gemma":[0.43686166,0.005216904,0.13013038,0.0004476134,0.0005980197,0.0001686689,0.0005926448,0.0010345421,0.42494956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994936,0.00007899875,0.000019623354,0.00017682742,0.00018368932,0.000047185986],"domain_scores_gemma":[0.9996822,0.00013934607,0.00002767542,0.00007484574,0.000057878344,0.000018102686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032376905,0.00079453504,0.0005471585,0.0008195548,0.0009921399,0.003552538,0.00084362045,0.0010219563,0.017758269],"category_scores_gemma":[0.0012265134,0.00058767514,0.000615001,0.0010310649,0.0023875874,0.002403858,0.0012293591,0.0016864295,0.0030878903],"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.00012620457,0.00004557985,0.00059836416,0.0002577312,0.000026716907,0.000579592,0.0010946261,0.009058086,0.019552423,0.77426666,0.012156273,0.18223776],"study_design_scores_gemma":[0.000042310585,0.00021766304,0.0029917283,0.00012583214,0.00004622193,0.003143815,0.0008764562,0.030372044,0.021075914,0.08971518,0.851315,0.00007787609],"about_ca_topic_score_codex":0.003219941,"about_ca_topic_score_gemma":0.002589766,"teacher_disagreement_score":0.017758269,"about_ca_system_score_codex":0.0010087005,"about_ca_system_score_gemma":0.00020457964,"threshold_uncertainty_score":0.059407353},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012058239,0.059070855,0.0878466,0.019615129,0.016021116,0.0001513286,0.002587091,0.0015611427,0.8010886],"genre_scores_gemma":[0.26228788,0.05313481,0.11331022,0.008090018,0.0063803983,0.0004658595,0.005481443,0.002141199,0.5487082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891233,0.0002118502,0.00004529479,0.0002618919,0.00042629536,0.00014241654],"domain_scores_gemma":[0.9992913,0.00012023935,0.000056331246,0.000079591606,0.0003833565,0.0000691612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084290374,0.00085821876,0.000520517,0.0017300805,0.0019981575,0.004144673,0.0010150268,0.0010864488,0.056404676],"category_scores_gemma":[0.0015727573,0.00044996032,0.001063646,0.0019005918,0.0028689546,0.003556784,0.0017510375,0.002537856,0.029806087],"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.00012198811,0.000032404896,0.00036522988,0.0003633684,0.000026216021,0.00022444388,0.000521879,0.00070586154,0.0014013562,0.72487426,0.1559037,0.115459375],"study_design_scores_gemma":[0.000009038548,0.000030352197,0.0003428538,0.00011261067,0.000015416965,0.0003018096,0.00016878833,0.0005111871,0.0009782605,0.16018859,0.8373131,0.000027964796],"about_ca_topic_score_codex":0.006471048,"about_ca_topic_score_gemma":0.0064832577,"teacher_disagreement_score":0.056404676,"about_ca_system_score_codex":0.0027603868,"about_ca_system_score_gemma":0.0014223908,"threshold_uncertainty_score":0.18869245},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2285201,0.02276797,0.5921469,0.00934404,0.0029943916,0.00029008722,0.002277192,0.011441288,0.1302181],"genre_scores_gemma":[0.51553404,0.010370158,0.28985173,0.0011198948,0.0012638018,0.00042206666,0.0059579555,0.00230453,0.17317581],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937683,0.000106154854,0.000025443342,0.00018113396,0.00018203568,0.00012838894],"domain_scores_gemma":[0.99908626,0.0003948145,0.00003313596,0.00020572495,0.0001984547,0.00008169481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050728465,0.00080957374,0.0010955422,0.0024046747,0.0016407806,0.0018668302,0.00083277945,0.0004833282,0.021423617],"category_scores_gemma":[0.0025646933,0.0004583992,0.0006155537,0.0054831915,0.0008329576,0.0025266719,0.0016909313,0.0012998291,0.0042630862],"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.00030462025,0.0001468804,0.0013787429,0.00038386686,0.00006626153,0.00007297073,0.00055351993,0.03461665,0.008237728,0.26257545,0.15984233,0.5318211],"study_design_scores_gemma":[0.00008947159,0.00018813786,0.0035889808,0.00017033446,0.00007255706,0.00024193367,0.0005179649,0.16563705,0.020606078,0.5039882,0.30482548,0.000073750634],"about_ca_topic_score_codex":0.0056372797,"about_ca_topic_score_gemma":0.0045009344,"teacher_disagreement_score":0.021423617,"about_ca_system_score_codex":0.0017315882,"about_ca_system_score_gemma":0.0011405336,"threshold_uncertainty_score":0.0716691},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.985305,0.00076979847,0.00016898902,0.003270514,0.00008869829,0.000008429587,0.000018514776,0.000009387916,0.010360711],"genre_scores_gemma":[0.99418265,0.00034286553,0.00017731909,0.00065492885,0.0000493963,0.00001081545,0.000019975907,0.0000093705585,0.004552626],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985843,0.000833442,0.000032159194,0.00008986386,0.00021710162,0.00024315016],"domain_scores_gemma":[0.9982078,0.00091844384,0.00031222962,0.0000620534,0.0002459414,0.00025354113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002424092,0.00028127278,0.00030334856,0.0009900824,0.01062641,0.00516443,0.00060522114,0.0014366151,0.0025008484],"category_scores_gemma":[0.0041510565,0.00029142952,0.00016967668,0.0009525206,0.006977018,0.0033230532,0.0035681687,0.001855338,0.00033925506],"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.000024005725,0.000018225237,0.006429583,0.00002494342,0.000003085936,0.00045817348,0.9848536,0.0000036521074,0.000892938,0.0016489261,0.0005657876,0.0050771367],"study_design_scores_gemma":[0.0000015409595,0.000017505083,0.007663091,0.000033410393,0.000004024883,0.0001356686,0.9793564,0.000015364729,0.00023082673,0.00018536804,0.012351701,0.000005022087],"about_ca_topic_score_codex":0.013347623,"about_ca_topic_score_gemma":0.038136605,"teacher_disagreement_score":0.013347623,"about_ca_system_score_codex":0.0029014521,"about_ca_system_score_gemma":0.0017001308,"threshold_uncertainty_score":0.026539862},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67225707,0.0016549209,0.12659189,0.001714354,0.0003863222,0.00009393701,0.13863048,0.003284202,0.055386838],"genre_scores_gemma":[0.88675666,0.00045813387,0.025820488,0.00007184488,0.00006454232,0.000042674557,0.06866778,0.00024464502,0.01787322],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998857,0.000030788287,0.0000059299327,0.00002110415,0.00003960702,0.000016894095],"domain_scores_gemma":[0.9993623,0.00012299095,0.00005518433,0.000121515164,0.00027620918,0.00006184721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082332024,0.00017168396,0.00018078108,0.00083932397,0.000109124456,0.0005457589,0.00043447287,0.00026636152,0.005544956],"category_scores_gemma":[0.0019216859,0.00016989055,0.00016699829,0.0012261681,0.00007978142,0.00036384285,0.0004640053,0.00028477822,0.0024996889],"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.0008377087,0.00015997849,0.30259934,0.00025905904,0.00033556425,0.00034004898,0.000253874,0.21508741,0.010810407,0.005003629,0.10342512,0.36088783],"study_design_scores_gemma":[0.00006229449,0.00012852959,0.8054777,0.00009093051,0.00007445259,0.00012633712,0.00028516122,0.14993244,0.0042264927,0.003848078,0.035657108,0.000090411595],"about_ca_topic_score_codex":0.03472945,"about_ca_topic_score_gemma":0.09749084,"teacher_disagreement_score":0.03472945,"about_ca_system_score_codex":0.00039474395,"about_ca_system_score_gemma":0.0004711876,"threshold_uncertainty_score":0.0690546},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9963291,0.00079759123,0.0015738151,0.00007613598,0.000015534915,0.000031503852,0.0002891564,0.00007537293,0.0008117647],"genre_scores_gemma":[0.9939733,0.0007932758,0.0033170597,0.000051468876,0.000014795128,0.00004406176,0.0003322518,0.00003523146,0.001438636],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997906,0.000034247394,0.000028081333,0.00005429031,0.00006713824,0.000025615594],"domain_scores_gemma":[0.99969673,0.00008491413,0.0001070858,0.000022826076,0.000012092459,0.00007641088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016965355,0.0010577212,0.00034974123,0.00059771666,0.00025098212,0.00026899888,0.000333479,0.000579446,0.0014096784],"category_scores_gemma":[0.00022249208,0.000302253,0.00028140986,0.0002736233,0.00046534857,0.00015844317,0.0003806732,0.00067926006,0.000358252],"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.00015207888,0.000085055064,0.0012211847,0.00004197137,0.000019085654,0.005082618,0.000028064558,0.00013243913,0.991531,0.00015988805,0.00006699954,0.0014795578],"study_design_scores_gemma":[0.00038667367,0.0014950716,0.078961335,0.000050089347,0.00013835324,0.102984436,0.00013684508,0.0037139102,0.8086291,0.00028206,0.0031744982,0.000047692687],"about_ca_topic_score_codex":0.0007630567,"about_ca_topic_score_gemma":0.002449784,"teacher_disagreement_score":0.0014096784,"about_ca_system_score_codex":0.00030692937,"about_ca_system_score_gemma":0.0003282946,"threshold_uncertainty_score":0.00471586},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019505585,0.0073019713,0.5866354,0.007826232,0.002459364,0.00012669715,0.001351518,0.0010941853,0.373699],"genre_scores_gemma":[0.6745558,0.0074329036,0.1847016,0.0034874366,0.002652473,0.00044664118,0.0022742548,0.000909966,0.12353898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959735,0.001142699,0.00026975686,0.001209604,0.0009816731,0.0004226999],"domain_scores_gemma":[0.9964593,0.0011285236,0.0002627687,0.00071964884,0.0011180515,0.00031167825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029293965,0.0007033451,0.0006577298,0.0034804132,0.0026892703,0.006643923,0.0010393684,0.0015336989,0.019114746],"category_scores_gemma":[0.0058853575,0.00046044675,0.0010245587,0.0025438888,0.007376198,0.012560725,0.0056514856,0.0036036663,0.004992272],"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.000003365834,0.000002159955,0.000054648222,0.000013892125,0.0000027678752,0.000013988242,0.000110050925,0.00004252519,0.000059546237,0.99487716,0.0012345499,0.003585344],"study_design_scores_gemma":[0.0000033544973,0.000008475874,0.00011063446,0.000025079438,0.0000058487853,0.0001226193,0.00014807493,0.00051011116,0.00025663932,0.9222073,0.07659286,0.000008996503],"about_ca_topic_score_codex":0.0010287641,"about_ca_topic_score_gemma":0.0008785375,"teacher_disagreement_score":0.019114746,"about_ca_system_score_codex":0.0018764962,"about_ca_system_score_gemma":0.0013691266,"threshold_uncertainty_score":0.063945174},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05901538,0.09896893,0.33857742,0.030352576,0.004261864,0.0000848799,0.0010295692,0.00072404154,0.4669854],"genre_scores_gemma":[0.71009135,0.04793531,0.09748927,0.003927256,0.012822322,0.00023658492,0.0010169322,0.00031756866,0.12616347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994247,0.00018306635,0.00002934855,0.00010911175,0.00019151827,0.000062359475],"domain_scores_gemma":[0.9988238,0.0005756659,0.00007285484,0.00018992956,0.00020658068,0.0001310772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013835911,0.00048292222,0.00051958684,0.0021319694,0.0014367767,0.0034379603,0.0005355824,0.00057153706,0.011158515],"category_scores_gemma":[0.0016789897,0.00019159474,0.0006496728,0.002990427,0.0031509884,0.0042197234,0.00139385,0.0020553293,0.0022004596],"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.000002673571,0.000008136791,0.0001554881,0.000058561156,0.0000038899634,0.000014653797,0.00021356448,0.00029630083,0.0001841673,0.9845159,0.004867986,0.009678686],"study_design_scores_gemma":[0.0000022722402,0.000009250325,0.00029099142,0.000029696641,0.0000036314834,0.000047694604,0.000071631825,0.0014098956,0.00014310204,0.94585955,0.052127767,0.0000044711046],"about_ca_topic_score_codex":0.0011613916,"about_ca_topic_score_gemma":0.0011451603,"teacher_disagreement_score":0.011158515,"about_ca_system_score_codex":0.0023105864,"about_ca_system_score_gemma":0.0009194236,"threshold_uncertainty_score":0.03732896},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08839906,0.02660368,0.013402446,0.080859885,0.001057263,0.000066666646,0.00056637794,0.00023947946,0.78880507],"genre_scores_gemma":[0.75915176,0.0047177137,0.0033522714,0.0035025536,0.00022169977,0.00006467232,0.00021015531,0.0002737875,0.22850531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975732,0.00058280025,0.00007253194,0.0004421727,0.0006967454,0.00063249277],"domain_scores_gemma":[0.9971794,0.0007228104,0.00023403841,0.00025052353,0.0012069902,0.00040619078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029795493,0.0006169366,0.00054299744,0.0027116938,0.016644344,0.016933247,0.0013610868,0.0024667752,0.017778525],"category_scores_gemma":[0.003960336,0.000609641,0.000506641,0.0052757184,0.028168673,0.006455493,0.003071742,0.0047726077,0.0009215267],"study_design_candidate":"not_applicable","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.00003533118,0.000013520563,0.0024798044,0.000068733185,0.00002293396,0.00024300611,0.042081583,0.0002556321,0.00036345742,0.9106729,0.019433476,0.024329707],"study_design_scores_gemma":[0.000018843391,0.000013678873,0.018247357,0.00057324703,0.000035767207,0.00023344935,0.051723354,0.00048890006,0.0006103434,0.08485637,0.84311026,0.0000883651],"about_ca_topic_score_codex":0.9709346,"about_ca_topic_score_gemma":0.9685726,"teacher_disagreement_score":0.0778968,"about_ca_system_score_codex":0.0778968,"about_ca_system_score_gemma":0.056564696,"threshold_uncertainty_score":0.5651835},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9844678,0.000030767224,0.014129626,0.00003053184,0.000028531524,0.00008446351,0.000064850276,0.00022824663,0.0009351411],"genre_scores_gemma":[0.9940773,0.0000188344,0.005244332,0.000028819695,0.0000031841212,0.00004402554,0.000064551496,0.000037744372,0.000481204],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995648,0.000059953603,0.00004583652,0.00010022947,0.0001747118,0.000054440156],"domain_scores_gemma":[0.998877,0.00042316952,0.00020294641,0.00028407847,0.00014271699,0.000070070884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029442078,0.00035921964,0.0003036657,0.00015721095,0.00013915704,0.00029978092,0.00028072626,0.0002885382,0.0014006664],"category_scores_gemma":[0.0051804744,0.0001486079,0.00020075517,0.00011624355,0.00031917865,0.00034264542,0.00063817244,0.00052440434,0.00016447659],"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.00050277566,0.000083882216,0.0015253566,0.000053296204,0.000017490416,0.000120859404,0.000104287516,0.0015690544,0.98426557,0.00018949753,0.000057188354,0.0115108555],"study_design_scores_gemma":[0.00013108671,0.0029148709,0.14875148,0.00003100604,0.00005360736,0.0010012987,0.00022033244,0.06801099,0.77497184,0.0019968788,0.0018482697,0.00006846599],"about_ca_topic_score_codex":0.0008270938,"about_ca_topic_score_gemma":0.000773043,"teacher_disagreement_score":0.0014006664,"about_ca_system_score_codex":0.00021721197,"about_ca_system_score_gemma":0.00027850535,"threshold_uncertainty_score":0.0046857595},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014428183,0.0013995856,0.0035934031,0.006440682,0.002766205,0.00049629103,0.032991357,0.004627501,0.94624203],"genre_scores_gemma":[0.0015388121,0.00056060374,0.0011883151,0.00031272255,0.00010656768,0.00008997104,0.010362993,0.0006926431,0.98514754],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989778,0.000120111676,0.000063461885,0.000099047866,0.00063907285,0.000100626734],"domain_scores_gemma":[0.9952744,0.0005491938,0.00014761306,0.00040034956,0.002922513,0.000705919],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0030624792,0.00081062905,0.0005008796,0.0016786898,0.0007182467,0.002546007,0.001575452,0.0014544666,0.67835695],"category_scores_gemma":[0.007337223,0.00044685605,0.00024249672,0.0019723105,0.00029174142,0.0017277375,0.0016614596,0.001166744,0.5901392],"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.000021540249,0.00003662757,0.0001732926,0.000025220139,6.0718054e-7,0.000012422427,0.000018657362,0.00002197626,0.000050995808,0.0008204629,0.95315355,0.045664705],"study_design_scores_gemma":[0.000013401856,0.00001989746,0.0010684383,0.000046360496,0.0000010960982,0.000020470363,0.00003799038,0.000058138943,0.0001563478,0.00025180308,0.99832135,0.0000046710898],"about_ca_topic_score_codex":0.016316095,"about_ca_topic_score_gemma":0.012811693,"teacher_disagreement_score":0.67835695,"about_ca_system_score_codex":0.0013464091,"about_ca_system_score_gemma":0.0035325948,"threshold_uncertainty_score":0.45878476},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071799313,0.0012128516,0.98693293,0.0015894918,0.0000824717,0.000071726485,0.0011794292,0.0004073457,0.0013438609],"genre_scores_gemma":[0.52757,0.007439659,0.44214502,0.0017793976,0.0008678524,0.0018474148,0.005733734,0.000515702,0.012101201],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98827374,0.007197122,0.00047219283,0.0022442027,0.0013513542,0.00046139635],"domain_scores_gemma":[0.94019157,0.048032977,0.0052583218,0.0037640024,0.002211537,0.00054160936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013553725,0.0018525188,0.0036077762,0.003884722,0.0010383575,0.00516107,0.00457956,0.004454647,0.0050882953],"category_scores_gemma":[0.055700768,0.0019816943,0.0028887005,0.004926967,0.0048471205,0.005431815,0.0047018654,0.0062785563,0.0012880868],"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.000076587574,0.000031802258,0.0019604934,0.00025696267,0.00015189018,0.00026349613,0.00031940828,0.5763904,0.0002744313,0.40238994,0.002580581,0.015303937],"study_design_scores_gemma":[0.000024904082,0.000015872069,0.0005714517,0.00005621167,0.00003050157,0.00006354067,0.000031172323,0.70002353,0.00006267469,0.29716158,0.0019300112,0.000028591146],"about_ca_topic_score_codex":0.010889429,"about_ca_topic_score_gemma":0.01164093,"teacher_disagreement_score":0.013553725,"about_ca_system_score_codex":0.003728309,"about_ca_system_score_gemma":0.0020596755,"threshold_uncertainty_score":0.07167977},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99396604,0.00033341584,0.0006787117,0.001293248,0.000027792405,0.00007046673,0.000024617917,0.0000069930793,0.003598706],"genre_scores_gemma":[0.9971257,0.00060023926,0.00055259303,0.00035793844,0.000013847036,0.00007824647,0.0000147565215,0.000010108088,0.0012466221],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9875026,0.008790636,0.00037593648,0.0006524621,0.0009863217,0.0016920537],"domain_scores_gemma":[0.98399264,0.009711555,0.0017095248,0.00047098426,0.0012565253,0.002858745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010801199,0.0009465804,0.0012820874,0.0027927465,0.016544059,0.007999456,0.0021954002,0.0022581029,0.0029040885],"category_scores_gemma":[0.01679885,0.0010023415,0.00088870846,0.002017434,0.010385555,0.007597599,0.010111179,0.0068881246,0.00038305327],"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.000006619726,0.00005650853,0.0025640787,0.00003196135,0.0000031575419,0.00036043036,0.99510205,0.000010026726,0.00016975346,0.00027368602,0.000081933256,0.0013398217],"study_design_scores_gemma":[0.0000023538166,0.000050224837,0.0011232442,0.000029409708,0.0000030339147,0.00015957492,0.9970692,0.000028044129,0.0000704086,0.00007687584,0.0013823104,0.00000533561],"about_ca_topic_score_codex":0.025306718,"about_ca_topic_score_gemma":0.052261587,"teacher_disagreement_score":0.025306718,"about_ca_system_score_codex":0.0059051234,"about_ca_system_score_gemma":0.008354163,"threshold_uncertainty_score":0.057122886},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019505585,0.0073019713,0.5866354,0.007826232,0.002459364,0.00012669715,0.001351518,0.0010941853,0.373699],"genre_scores_gemma":[0.6745558,0.0074329036,0.1847016,0.0034874366,0.002652473,0.00044664118,0.0022742548,0.000909966,0.12353898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959735,0.001142699,0.00026975686,0.001209604,0.0009816731,0.0004226999],"domain_scores_gemma":[0.9964593,0.0011285236,0.0002627687,0.00071964884,0.0011180515,0.00031167825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029293965,0.0007033451,0.0006577298,0.0034804132,0.0026892703,0.006643923,0.0010393684,0.0015336989,0.019114746],"category_scores_gemma":[0.0058853575,0.00046044675,0.0010245587,0.0025438888,0.007376198,0.012560725,0.0056514856,0.0036036663,0.004992272],"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.000003365834,0.000002159955,0.000054648222,0.000013892125,0.0000027678752,0.000013988242,0.000110050925,0.00004252519,0.000059546237,0.99487716,0.0012345499,0.003585344],"study_design_scores_gemma":[0.0000033544973,0.000008475874,0.00011063446,0.000025079438,0.0000058487853,0.0001226193,0.00014807493,0.00051011116,0.00025663932,0.9222073,0.07659286,0.000008996503],"about_ca_topic_score_codex":0.0010287641,"about_ca_topic_score_gemma":0.0008785375,"teacher_disagreement_score":0.019114746,"about_ca_system_score_codex":0.0018764962,"about_ca_system_score_gemma":0.0013691266,"threshold_uncertainty_score":0.063945174},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7504225,0.0042035105,0.2120441,0.006120894,0.0003546129,0.000049063,0.0005264468,0.00045580987,0.02582311],"genre_scores_gemma":[0.9857247,0.0025581322,0.008870869,0.000091968606,0.000166825,0.000030443794,0.00040328573,0.00011443659,0.002039226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972564,0.00010285241,0.000012852536,0.00004720018,0.00008426146,0.0000271621],"domain_scores_gemma":[0.9953186,0.0037780388,0.00025013523,0.00027792787,0.00029024633,0.00008506608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001243936,0.00032980257,0.00023067469,0.00045353165,0.00032779362,0.00078737555,0.00029688602,0.00021152545,0.00084121677],"category_scores_gemma":[0.015341286,0.00022031524,0.0003467959,0.0004969915,0.0006820845,0.0009850102,0.00066633674,0.0009888546,0.00020748704],"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.000072325456,0.00004607495,0.018291546,0.000076151744,0.00007318248,0.000050399616,0.00016117237,0.8899902,0.0015794937,0.040017348,0.0032693276,0.046372853],"study_design_scores_gemma":[0.0000033069714,0.000014516981,0.0042926953,0.00001863898,0.0000071276386,0.000006683261,0.000018070636,0.9817199,0.00037675642,0.012951782,0.00058206776,0.000008355551],"about_ca_topic_score_codex":0.0077598463,"about_ca_topic_score_gemma":0.0037668091,"teacher_disagreement_score":0.0077598463,"about_ca_system_score_codex":0.00045142314,"about_ca_system_score_gemma":0.0005399081,"threshold_uncertainty_score":0.015429318},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.871804,0.0010785537,0.0743139,0.00075794535,0.00012965543,0.000052817297,0.00030851748,0.00014228637,0.051412288],"genre_scores_gemma":[0.9730558,0.0004988798,0.014096024,0.00012908559,0.000118201,0.000052177675,0.00033449603,0.00006717699,0.011648117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944335,0.00006782166,0.000037317663,0.00013494509,0.0002009984,0.0001155684],"domain_scores_gemma":[0.99873954,0.00047879497,0.00024509977,0.00009388186,0.00020990461,0.00023271842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047170147,0.0005612444,0.0005241178,0.0029881997,0.0010269481,0.0025476653,0.00070736255,0.00065408694,0.0053731417],"category_scores_gemma":[0.003369822,0.00046298033,0.00040610478,0.0010608733,0.0014934778,0.0026983914,0.0012286415,0.0009940227,0.00058896735],"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.0001584534,0.00006835134,0.013155148,0.00023820862,0.000029376079,0.0012113082,0.0009012497,0.006308656,0.04458615,0.8926523,0.0043556136,0.036335245],"study_design_scores_gemma":[0.00006609654,0.00019362228,0.022734733,0.00012984354,0.0000538968,0.0037394443,0.00085595954,0.08916135,0.05827452,0.79891914,0.02571156,0.00015981725],"about_ca_topic_score_codex":0.0011361397,"about_ca_topic_score_gemma":0.0012470341,"teacher_disagreement_score":0.0053731417,"about_ca_system_score_codex":0.00093092973,"about_ca_system_score_gemma":0.00038152354,"threshold_uncertainty_score":0.017974973},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063423075,0.0067713824,0.3520386,0.024033403,0.072344966,0.00058295747,0.031580947,0.019307302,0.42991728],"genre_scores_gemma":[0.18641977,0.004938283,0.20638235,0.0020008048,0.0018459597,0.00027970766,0.018140966,0.010879503,0.5691127],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99901545,0.00011506317,0.00005357849,0.00021832426,0.0004935446,0.00010406627],"domain_scores_gemma":[0.9954472,0.001046383,0.00013943188,0.0012468324,0.0016775869,0.00044256626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020469762,0.0006646614,0.001633799,0.0013850933,0.0016306031,0.0049813264,0.0012517477,0.000817595,0.23671035],"category_scores_gemma":[0.008650587,0.0005232388,0.00041540846,0.0021856253,0.0013967415,0.0025112652,0.0022445493,0.0010342839,0.040452737],"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.00057490275,0.00013995192,0.0014440309,0.00047328466,0.0000765815,0.00029520295,0.00027314716,0.009143418,0.009879709,0.037219167,0.762415,0.17806579],"study_design_scores_gemma":[0.00018716585,0.00028206647,0.004227019,0.0002545953,0.000052149342,0.00059472444,0.000584321,0.07683925,0.027513646,0.045286436,0.8440348,0.0001438882],"about_ca_topic_score_codex":0.005822515,"about_ca_topic_score_gemma":0.017620873,"teacher_disagreement_score":0.23671035,"about_ca_system_score_codex":0.0013905625,"about_ca_system_score_gemma":0.0018141313,"threshold_uncertainty_score":0.791875},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017165404,0.0002906646,0.99695075,0.000038145776,0.00008307438,0.00003160934,0.00001778829,0.000062328756,0.0008090562],"genre_scores_gemma":[0.18952753,0.0009907953,0.80426604,0.00014562985,0.00027961557,0.0004706486,0.00016258303,0.00022827348,0.0039288406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827456,0.0007220791,0.00012093344,0.00034461048,0.0004788373,0.00005900681],"domain_scores_gemma":[0.9963552,0.002385942,0.00030121853,0.00019121834,0.0006718137,0.00009469552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00474429,0.0011016704,0.0011333654,0.0023018222,0.00064253574,0.0010465423,0.0016086363,0.0010176488,0.0036872292],"category_scores_gemma":[0.008970257,0.00038003305,0.0013412941,0.0013961855,0.001205933,0.0028016889,0.0013273149,0.0021933152,0.0005223966],"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.00032064712,0.000099097,0.0012136501,0.0009392266,0.00024307957,0.0002971973,0.00046025903,0.18136698,0.035074368,0.450598,0.0033507668,0.3260368],"study_design_scores_gemma":[0.000036755282,0.00027013847,0.000356743,0.000048775797,0.00004750136,0.00021830964,0.000035313144,0.9129361,0.005346115,0.07123284,0.0094116675,0.000059785754],"about_ca_topic_score_codex":0.00091112667,"about_ca_topic_score_gemma":0.0006710284,"teacher_disagreement_score":0.00474429,"about_ca_system_score_codex":0.0011478432,"about_ca_system_score_gemma":0.0010193348,"threshold_uncertainty_score":0.025090516},"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":"commentary","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003278159,0.09488908,0.08646574,0.6949746,0.037343208,0.006455962,0.02108804,0.0025319527,0.052973267],"genre_scores_gemma":[0.018109728,0.15799767,0.54910177,0.1499577,0.0132847745,0.009868958,0.0414408,0.0013583944,0.05888019],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9758533,0.008214157,0.00406103,0.0006126504,0.009855632,0.0014031696],"domain_scores_gemma":[0.8804343,0.0137604,0.0062600556,0.002339002,0.090202995,0.0070031844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.029554263,0.0017630543,0.002666659,0.005981663,0.0023094555,0.0041758246,0.009959469,0.007822081,0.010526985],"category_scores_gemma":[0.052593302,0.0012569298,0.0037940827,0.00685023,0.0024143113,0.0024601663,0.0029264677,0.013391867,0.0068756095],"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.00004087757,0.0001666138,0.0014537111,0.0012585506,0.000055419867,0.00009182756,0.00028525785,0.00079288107,0.00026970656,0.002205675,0.8640787,0.12930086],"study_design_scores_gemma":[0.00013966476,0.00007918885,0.010961504,0.00909497,0.00021916516,0.0003804459,0.000744398,0.0010165088,0.00041718708,0.005052169,0.9717461,0.00014875774],"about_ca_topic_score_codex":0.30583146,"about_ca_topic_score_gemma":0.3873839,"teacher_disagreement_score":0.30583146,"about_ca_system_score_codex":0.014128151,"about_ca_system_score_gemma":0.08643042,"threshold_uncertainty_score":0.6081027},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027453157,0.0014193398,0.9629901,0.0026080918,0.0005288112,0.00012978494,0.0017842954,0.00097149523,0.026822807],"genre_scores_gemma":[0.19929574,0.006377072,0.7094995,0.0038998288,0.0035655885,0.0012512879,0.009420033,0.0015093628,0.0651816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99471974,0.0016299053,0.0003490397,0.0018460469,0.0011305885,0.00032478932],"domain_scores_gemma":[0.9894705,0.0067671663,0.000434389,0.0015803619,0.0015809021,0.00016665629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00506986,0.0015493333,0.0015455311,0.0041934834,0.001862157,0.006368484,0.0026215606,0.0025143907,0.03234466],"category_scores_gemma":[0.01964916,0.0010320378,0.0042707925,0.0026852589,0.0038829066,0.006026814,0.0039195362,0.00594534,0.009539456],"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.000089437155,0.0000501083,0.001905295,0.00064003706,0.00024600813,0.00037280447,0.00043698197,0.014615602,0.0012952157,0.8370558,0.016518192,0.12677458],"study_design_scores_gemma":[0.000023322424,0.000027647558,0.0005865558,0.00013930886,0.00008275096,0.00029184562,0.00015368847,0.0507303,0.0010508922,0.89847785,0.048404638,0.00003126104],"about_ca_topic_score_codex":0.0055757463,"about_ca_topic_score_gemma":0.0031368795,"teacher_disagreement_score":0.03234466,"about_ca_system_score_codex":0.002838154,"about_ca_system_score_gemma":0.0025394931,"threshold_uncertainty_score":0.10820371},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7032005,0.0008568817,0.27724192,0.000833652,0.00011041772,0.00008589243,0.00575086,0.0036938565,0.008225959],"genre_scores_gemma":[0.9252689,0.00026991733,0.06290468,0.000100410536,0.00010662948,0.00006930299,0.00674146,0.00036205945,0.004176613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900913,0.00011377421,0.00009470503,0.00030720272,0.00031113057,0.0001640328],"domain_scores_gemma":[0.99631613,0.0017295281,0.0004031933,0.0007680738,0.00035888504,0.0004241636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010281968,0.0006582641,0.0010108863,0.0030909288,0.00082298176,0.0043561114,0.0018286565,0.00081662333,0.0087184785],"category_scores_gemma":[0.009604733,0.00052657997,0.00094065926,0.002686467,0.0012426316,0.009745542,0.003161645,0.0013854324,0.0016477666],"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.00083570526,0.00026693734,0.03404558,0.0009416073,0.00021191618,0.0006988008,0.002667901,0.06806469,0.020384979,0.5470108,0.019518336,0.30535284],"study_design_scores_gemma":[0.000025154515,0.00007055068,0.0029883594,0.00005032374,0.000035490302,0.00021185953,0.00031044477,0.08885466,0.006634033,0.89647126,0.004299966,0.00004796931],"about_ca_topic_score_codex":0.0010132992,"about_ca_topic_score_gemma":0.001622542,"teacher_disagreement_score":0.0087184785,"about_ca_system_score_codex":0.0011687807,"about_ca_system_score_gemma":0.00070562714,"threshold_uncertainty_score":0.029166281},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063176006,0.0010843157,0.9131209,0.0019270844,0.00021007637,0.00017349003,0.0004913423,0.00051493704,0.019301916],"genre_scores_gemma":[0.5970672,0.0028237659,0.3590246,0.001240404,0.00059331715,0.0008138955,0.0016680808,0.001165807,0.035602923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99639446,0.0013631965,0.0001691978,0.0006037877,0.00084649585,0.0006229038],"domain_scores_gemma":[0.97200733,0.020498436,0.0012180747,0.0020907158,0.002084905,0.002100627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00797983,0.0022902861,0.0023456248,0.0035166861,0.0021992517,0.0049535222,0.0041333637,0.0022544512,0.014495927],"category_scores_gemma":[0.044648025,0.001266357,0.0029187752,0.002528196,0.0050687054,0.009503821,0.007855231,0.0063020196,0.0018458327],"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.00019383978,0.00008718382,0.0012337479,0.00015477618,0.000050095496,0.00011189629,0.00026139923,0.04084903,0.00089204736,0.9282619,0.0055000363,0.022403961],"study_design_scores_gemma":[0.000042619682,0.00007129963,0.00031032707,0.000047813515,0.000029743602,0.00007035428,0.000091948765,0.3422277,0.00079505116,0.65337825,0.0028931955,0.000041634026],"about_ca_topic_score_codex":0.004405378,"about_ca_topic_score_gemma":0.0055021336,"teacher_disagreement_score":0.014495927,"about_ca_system_score_codex":0.0056500416,"about_ca_system_score_gemma":0.004129967,"threshold_uncertainty_score":0.048493743},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44047016,0.00077459693,0.40227523,0.0026975668,0.001158212,0.003384877,0.05454302,0.0050916173,0.08960471],"genre_scores_gemma":[0.82638675,0.00028325492,0.11919861,0.0003390596,0.00019517181,0.003619569,0.03397553,0.00075194036,0.0152501],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9675574,0.016450377,0.002826166,0.0035540473,0.008143306,0.0014686111],"domain_scores_gemma":[0.8399682,0.10607724,0.0074902964,0.013343215,0.031811118,0.0013099525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0122211175,0.0007461353,0.00074829103,0.0065681934,0.0017563886,0.0050019166,0.0015005899,0.0009959257,0.026609285],"category_scores_gemma":[0.16284974,0.0002791625,0.00072444766,0.007651926,0.0017890476,0.004564127,0.0041182716,0.0017373031,0.009350111],"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.0040399884,0.000859124,0.094916336,0.0038665486,0.0003263578,0.0010802633,0.03450746,0.009267016,0.012354475,0.24740589,0.06735513,0.5240214],"study_design_scores_gemma":[0.0002618804,0.0017793471,0.094169766,0.0024023924,0.0003895626,0.0022210425,0.116948865,0.17906651,0.037646558,0.29532975,0.2693792,0.00040515675],"about_ca_topic_score_codex":0.0014488712,"about_ca_topic_score_gemma":0.0013003417,"teacher_disagreement_score":0.026609285,"about_ca_system_score_codex":0.0018498219,"about_ca_system_score_gemma":0.0019588778,"threshold_uncertainty_score":0.089016855},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086881526,0.0011103721,0.9046676,0.0004227689,0.000083293235,0.00007397975,0.00038232363,0.00038605457,0.0059920596],"genre_scores_gemma":[0.5750048,0.0014090183,0.41622046,0.000270595,0.000229796,0.00026602607,0.0014597644,0.00033673536,0.0048028002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99666363,0.00074051507,0.0003475842,0.00079098926,0.0011825906,0.0002746742],"domain_scores_gemma":[0.98007154,0.012009575,0.0024528136,0.0025851368,0.0021774203,0.00070344075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024884513,0.0010044082,0.0010406323,0.0059643476,0.0017797481,0.003985767,0.0016409695,0.0019069468,0.0031446845],"category_scores_gemma":[0.027378047,0.00069019705,0.0010004663,0.0056478744,0.003602237,0.0138637405,0.004932082,0.0031630925,0.00077259156],"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.00017753683,0.000081729384,0.0058628465,0.00021636118,0.00006934947,0.0002523317,0.000980553,0.080211595,0.003158169,0.7908035,0.0017823587,0.11640362],"study_design_scores_gemma":[0.0000135694745,0.00010107803,0.0014916265,0.00005267778,0.000033136694,0.00028267666,0.00026475234,0.1390239,0.002557584,0.8480965,0.008023411,0.000059100606],"about_ca_topic_score_codex":0.0024760726,"about_ca_topic_score_gemma":0.0023038227,"teacher_disagreement_score":0.0059643476,"about_ca_system_score_codex":0.0022872558,"about_ca_system_score_gemma":0.0010871912,"threshold_uncertainty_score":0.016595244},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09059087,0.003977119,0.79296345,0.003547449,0.0009083279,0.00014702666,0.0005334221,0.0016025946,0.10572975],"genre_scores_gemma":[0.6599215,0.005033438,0.2979664,0.0015065488,0.0012695207,0.00024446298,0.0011554742,0.001106334,0.031796284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821174,0.0005384809,0.00013388,0.0003597848,0.0004693246,0.0002867868],"domain_scores_gemma":[0.99535155,0.0027026837,0.0003189553,0.0009660851,0.00041487213,0.00024586832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019916708,0.0011433145,0.0013409237,0.0042342204,0.0027838622,0.003840414,0.0018636333,0.0015692726,0.008408206],"category_scores_gemma":[0.013109544,0.0006583337,0.0015346402,0.004798106,0.0041629556,0.018837642,0.006472937,0.004646788,0.0026004964],"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.000036024823,0.000021823671,0.0003234356,0.000077493394,0.00001139948,0.00008022162,0.0002830061,0.0025714408,0.0004152322,0.9713319,0.0030133184,0.021834616],"study_design_scores_gemma":[0.000004987626,0.000008157998,0.00012853398,0.00002445653,0.00000824852,0.000104969135,0.000076877885,0.006061322,0.00027062924,0.9851944,0.008105165,0.000012247272],"about_ca_topic_score_codex":0.0022197245,"about_ca_topic_score_gemma":0.0030580726,"teacher_disagreement_score":0.008408206,"about_ca_system_score_codex":0.0017527597,"about_ca_system_score_gemma":0.0007931031,"threshold_uncertainty_score":0.028128266},"labels":[],"label_agreement":null}]}