{"meta":{"query_hash":"56a0dbac733f","filters":{"topic":"Advanced Graph Neural Networks"},"cohort_total":518,"direct_labels_cover":2,"predictions_cover":518,"exported":518,"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/56a0dbac733f","api":"https://metacan.xera.ac/api/v1/cohort?topic=Advanced+Graph+Neural+Networks"},"results":[{"id":"W1509961009","doi":"10.22061/jecei.2014.42","title":"DALD:-Distributed-Asynchronous-Local-Decontamination Algorithm in Arbitrary Graphs","year":2014,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Advanced Graph Neural Networks","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 Ottawa","funders":"","keywords":"Computer science; Distributed computing; Asynchronous communication; Node (physics); Distributed algorithm; Human decontamination; Computation; Algorithm; Computer network; Engineering","score_opus":0.08912439903010141,"score_gpt":0.4720683068139423,"score_spread":0.3829439077838409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509961009","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.022554547,0.00022335107,0.96866345,0.00053417176,0.00007456992,0.00019111265,0.00021200429,0.0036689604,0.0038778305],"genre_scores_gemma":[0.34006822,0.00017282601,0.6492124,0.00027771445,0.00004367176,0.00031613567,0.0009099877,0.00037985935,0.00861919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993969,0.00013567889,0.00004011279,0.00018953408,0.00012585889,0.00011188048],"domain_scores_gemma":[0.9989286,0.000354982,0.00009485946,0.0003238674,0.00019823424,0.00009931606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000796122,0.00077589473,0.00087326486,0.0007201624,0.0012075803,0.0010770321,0.002538579,0.00096824573,0.0042369273],"category_scores_gemma":[0.002568998,0.0003416792,0.00054696086,0.00072028354,0.0007480254,0.0017442021,0.0023420805,0.0011424343,0.001146604],"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.00068489247,0.0002504708,0.00244685,0.00038289995,0.00006995646,0.0002834072,0.0003442414,0.521346,0.010439183,0.04604981,0.018865993,0.39883637],"study_design_scores_gemma":[0.00010159851,0.000053038184,0.00020127061,0.000010737765,0.00001469928,0.000080872574,0.000058312526,0.970958,0.0043570125,0.019622536,0.0045290575,0.00001285814],"about_ca_topic_score_codex":0.0048415484,"about_ca_topic_score_gemma":0.009075118,"teacher_disagreement_score":0.0048415484,"about_ca_system_score_codex":0.0012475139,"about_ca_system_score_gemma":0.0016883524,"threshold_uncertainty_score":0.0141739845},"labels":[],"label_agreement":null},{"id":"W1533179233","doi":"10.1109/saci.2015.7208196","title":"A graph digital signal processing method for semantic analysis","year":2015,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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","funders":"","keywords":"Computer science; Natural language processing; Artificial intelligence; Sentence; Natural language understanding; Parsing; Graph; Theoretical computer science; Natural language","score_opus":0.03385053670813177,"score_gpt":0.31419562101317583,"score_spread":0.28034508430504407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533179233","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.0003293588,0.00014094032,0.9966993,0.00012906094,0.0000995655,0.000036470028,0.00017461462,0.0005269207,0.0018637588],"genre_scores_gemma":[0.025019443,0.00064824324,0.9652762,0.0003352014,0.00027715805,0.00024558592,0.0007855984,0.00044815653,0.006964558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992889,0.0001790923,0.000047515965,0.00022868821,0.00021294487,0.00004269792],"domain_scores_gemma":[0.9994531,0.00019842328,0.000038529768,0.00015255746,0.00013088626,0.000026491201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007556461,0.0010647705,0.0005497112,0.0030261355,0.0006894591,0.0018927266,0.0011420953,0.0012895082,0.013868239],"category_scores_gemma":[0.0025158192,0.00032687426,0.0015957169,0.0024654346,0.0011338524,0.0021527994,0.0013229077,0.0021991031,0.007596927],"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.000106298314,0.00007479669,0.00026374226,0.0003825752,0.00010943062,0.00024810247,0.00018007937,0.025910232,0.021671688,0.4146117,0.019607507,0.5168339],"study_design_scores_gemma":[0.000036780835,0.00007165004,0.00038146888,0.0000980654,0.00006878082,0.0007071727,0.0001053944,0.38492912,0.0113393115,0.46461216,0.13758501,0.00006509386],"about_ca_topic_score_codex":0.0017008431,"about_ca_topic_score_gemma":0.0017435473,"teacher_disagreement_score":0.013868239,"about_ca_system_score_codex":0.0007351002,"about_ca_system_score_gemma":0.00096312835,"threshold_uncertainty_score":0.04639387},"labels":[],"label_agreement":null},{"id":"W1562235957","doi":"","title":"Proceedings of the sixth workshop on Ph.D. students in information and knowledge management","year":2010,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Systems, Applications & Products in Data Processing (Canada)","funders":"","keywords":"Computer science; Viewpoints; Presentation (obstetrics); Point (geometry); Diversity (politics); Work (physics); Library science; Sociology","score_opus":0.006904744267530809,"score_gpt":0.25589811824680037,"score_spread":0.24899337397926954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562235957","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.013050021,0.028399395,0.03152142,0.29732046,0.22587897,0.0011922282,0.0061227595,0.0023534019,0.3941613],"genre_scores_gemma":[0.035175685,0.012853699,0.015662385,0.01567165,0.018864905,0.0007989408,0.00578526,0.0018118817,0.89337564],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9925599,0.0025467325,0.00050217914,0.0010307939,0.0021935655,0.0011668202],"domain_scores_gemma":[0.98063445,0.0018327677,0.00044094742,0.0010872467,0.004644986,0.011359643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01589531,0.0013681243,0.0010693525,0.0014603601,0.0028746717,0.012380578,0.0022391577,0.0031658872,0.16353437],"category_scores_gemma":[0.013193729,0.0007033036,0.001153965,0.0014004963,0.0016353755,0.0073344405,0.009281552,0.005550472,0.0730733],"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.00011616625,0.0001827179,0.00044496273,0.00019596712,0.000008451377,0.00011281168,0.0009893295,0.00010830324,0.00072695443,0.0050398028,0.8982732,0.09380137],"study_design_scores_gemma":[0.000012234533,0.000054535158,0.00049204746,0.00015735098,0.000004753695,0.000051534706,0.00080552406,0.00011304884,0.00028905776,0.0019234695,0.996086,0.000010423962],"about_ca_topic_score_codex":0.0018024301,"about_ca_topic_score_gemma":0.0042256443,"teacher_disagreement_score":0.16353437,"about_ca_system_score_codex":0.0026765931,"about_ca_system_score_gemma":0.008139516,"threshold_uncertainty_score":0.54707694},"labels":[],"label_agreement":null},{"id":"W1974873233","doi":"10.1142/s0219720013410059","title":"ENHANCING GENOMICS INFORMATION RETRIEVAL THROUGH DIMENSIONAL ANALYSIS","year":2013,"lang":"en","type":"article","venue":"Journal of Bioinformatics and Computational Biology","topic":"Advanced Graph Neural Networks","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":"York University","funders":"Université de Neuchâtel; University of Melbourne","keywords":"Computer science; Linear subspace; Information retrieval; Dimension (graph theory); Rank (graph theory); Homogeneity (statistics); Graph; Data mining; Set (abstract data type); Genomics; Theoretical computer science; Machine learning; Mathematics; Genome","score_opus":0.00768950690829641,"score_gpt":0.23559019145499488,"score_spread":0.22790068454669846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974873233","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.03266321,0.001573845,0.96173614,0.0004007382,0.00005896335,0.00011040331,0.00036730486,0.0015740776,0.0015152706],"genre_scores_gemma":[0.31701517,0.0014664518,0.67755115,0.00023209187,0.00023793841,0.0002689604,0.0016367582,0.00011934949,0.001472145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979005,0.0007080584,0.0001962002,0.00030438375,0.00075276307,0.00013815354],"domain_scores_gemma":[0.99819833,0.00057629275,0.00023758774,0.00034415853,0.00058676506,0.0000568046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014650848,0.0010271246,0.0016774302,0.005694883,0.0008050304,0.0020609305,0.0010095825,0.00074952364,0.0009966703],"category_scores_gemma":[0.004782307,0.0003229666,0.0012771325,0.005916039,0.00050300395,0.0032281994,0.0019936129,0.0008224032,0.0008026701],"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.00029957358,0.0003362484,0.0057223174,0.0004293605,0.00028066165,0.00017144873,0.0004913805,0.049486108,0.04260005,0.019870419,0.0083129825,0.8719995],"study_design_scores_gemma":[0.000052357966,0.00023793266,0.0039538,0.000039618968,0.00021381136,0.0004092433,0.00034556442,0.9125256,0.026962088,0.043042857,0.012038538,0.0001785667],"about_ca_topic_score_codex":0.002242022,"about_ca_topic_score_gemma":0.0024807658,"teacher_disagreement_score":0.005694883,"about_ca_system_score_codex":0.00064481935,"about_ca_system_score_gemma":0.0009876399,"threshold_uncertainty_score":0.0077481866},"labels":[],"label_agreement":null},{"id":"W2089201173","doi":"10.1145/2629530","title":"Trust Prediction via Belief Propagation","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Advanced Graph Neural Networks","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":"University of Ottawa","funders":"Ministry of Science and Technology of the People's Republic of China; National Natural Science Foundation of China","keywords":"Computer science; Belief propagation; Graphical model; Factor graph; Probabilistic logic; Inference; Exploit; Machine learning; Expectation propagation; Artificial intelligence; Solver; Propagation of uncertainty; Theoretical computer science; Approximate inference; Data mining; Algorithm","score_opus":0.00904383903233889,"score_gpt":0.21179865925749425,"score_spread":0.20275482022515537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089201173","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.03755257,0.000686564,0.95737743,0.00089278095,0.00008218361,0.00006995136,0.00038025892,0.0007686498,0.0021896795],"genre_scores_gemma":[0.87901103,0.0006888906,0.11670334,0.00016554832,0.00014740413,0.00013717529,0.0009280889,0.00008643488,0.002132107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998204,0.0006789929,0.00010840092,0.0004075074,0.00044053025,0.00016053591],"domain_scores_gemma":[0.98620194,0.010360451,0.0010239215,0.0006983111,0.0014803187,0.00023503255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027000615,0.0011626285,0.001284379,0.002131873,0.000826453,0.0020731606,0.0019140663,0.0015783972,0.0022798032],"category_scores_gemma":[0.023902064,0.0007076784,0.00091398164,0.00236327,0.0010240927,0.004046094,0.0014566401,0.0025923008,0.00076314283],"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.00023035763,0.00010453974,0.006129575,0.00014387228,0.00014573685,0.0001412612,0.000267231,0.84481925,0.0006483581,0.026699463,0.004810773,0.115859576],"study_design_scores_gemma":[0.0000060238044,0.000007668629,0.00017942274,0.000007656834,0.000009827857,0.000009443492,0.0000090885105,0.9867534,0.0001762142,0.01262876,0.00020755842,0.0000049640803],"about_ca_topic_score_codex":0.022742368,"about_ca_topic_score_gemma":0.016382903,"teacher_disagreement_score":0.022742368,"about_ca_system_score_codex":0.0017284753,"about_ca_system_score_gemma":0.001252539,"threshold_uncertainty_score":0.045219958},"labels":[],"label_agreement":null},{"id":"W2156954687","doi":"10.1609/aaai.v25i1.7917","title":"Learning Structured Embeddings of Knowledge Bases","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":66,"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":"WordNet; Computer science; Artificial intelligence; Natural language processing; Process (computing); Knowledge extraction; Natural language; Information retrieval; Information extraction; Word (group theory); Annotation","score_opus":0.08527527762667422,"score_gpt":0.2914836337513474,"score_spread":0.20620835612467317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156954687","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.090590686,0.0005276891,0.9025856,0.0007492719,0.00011083033,0.00010435185,0.0010941572,0.0016540348,0.0025834218],"genre_scores_gemma":[0.6644039,0.00073462294,0.32455492,0.00028428013,0.00010109724,0.0002706554,0.0054109325,0.00018152125,0.004058128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990889,0.00029441147,0.00008090974,0.00027554936,0.00018708418,0.000073197785],"domain_scores_gemma":[0.9960394,0.0022793792,0.00029266762,0.00064818055,0.00062839146,0.00011194103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010461989,0.00078183267,0.00062151515,0.0016960544,0.00035974607,0.0016335539,0.0013246338,0.0011863207,0.002027417],"category_scores_gemma":[0.010934589,0.0005716153,0.00066043617,0.0015153801,0.0008101854,0.0049531134,0.0019329111,0.0017267318,0.0006804998],"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.00030952232,0.00030915506,0.0053022774,0.00047002864,0.00016348166,0.0002735352,0.0007210175,0.2851052,0.0063028554,0.070184864,0.009284843,0.6215732],"study_design_scores_gemma":[0.000018546723,0.000074998636,0.00038027452,0.00004774697,0.000023312106,0.00003470176,0.00011773807,0.92005837,0.0019569572,0.074885555,0.002386892,0.000015000813],"about_ca_topic_score_codex":0.0021667504,"about_ca_topic_score_gemma":0.0037713014,"teacher_disagreement_score":0.0021667504,"about_ca_system_score_codex":0.00078900723,"about_ca_system_score_gemma":0.0007200207,"threshold_uncertainty_score":0.0067824125},"labels":[],"label_agreement":null},{"id":"W2182562048","doi":"10.1609/aaai.v28i1.8976","title":"Convex Co-embedding","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","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":"University of Alberta","funders":"","keywords":"Embedding; Ranking (information retrieval); Regular polygon; Computer science; Relation (database); Relevance (law); Convex optimization; Learning to rank; Artificial intelligence; Current (fluid); Machine learning; Theoretical computer science; Mathematical optimization; Mathematics; Data mining; Geometry","score_opus":0.056841868913256155,"score_gpt":0.3135525068299718,"score_spread":0.25671063791671567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182562048","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.0025231286,0.00024795174,0.9939818,0.00023392844,0.00004076317,0.000023641036,0.00021366666,0.00014456802,0.0025906423],"genre_scores_gemma":[0.34369305,0.0018404122,0.6252913,0.0005473413,0.00040792013,0.000553426,0.0031891675,0.0006902898,0.023787143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971282,0.0011262712,0.00014046184,0.0008279405,0.0006213238,0.00015583396],"domain_scores_gemma":[0.99471396,0.002192678,0.00045883819,0.001545351,0.0008279706,0.00026126663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021910528,0.0020078267,0.0015200626,0.0018292083,0.00078687107,0.002857981,0.0024502024,0.0017882123,0.008360722],"category_scores_gemma":[0.009926835,0.00078413717,0.0013561648,0.0023764533,0.0023645903,0.0053132335,0.004274566,0.0037449969,0.0031817453],"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.00007268694,0.00007807427,0.00097104366,0.00026648928,0.00011948081,0.00023817939,0.00021601748,0.2845281,0.0019385216,0.5923502,0.010784849,0.10843631],"study_design_scores_gemma":[0.000005993788,0.00004291432,0.00021715992,0.00002814194,0.0000130679855,0.00013515308,0.000031651634,0.7196777,0.00076815946,0.27037022,0.008691075,0.0000187264],"about_ca_topic_score_codex":0.0019183891,"about_ca_topic_score_gemma":0.0024552646,"teacher_disagreement_score":0.008360722,"about_ca_system_score_codex":0.0012432667,"about_ca_system_score_gemma":0.0009591897,"threshold_uncertainty_score":0.02796936},"labels":[],"label_agreement":null},{"id":"W2387462954","doi":"10.1145/2939672.2939751","title":"Asymmetric Transitivity Preserving Graph Embedding","year":2016,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":1293,"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":"National Natural Science Foundation of China","keywords":"Transitive relation; Embedding; Scalability; Computer science; Theoretical computer science; Transitive reduction; Graph embedding; Directed graph; Graph; Vertex (graph theory); Mathematics; Algorithm; Combinatorics; Artificial intelligence; Voltage graph; Line graph","score_opus":0.014101384185911841,"score_gpt":0.25414677896115334,"score_spread":0.2400453947752415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2387462954","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.01770383,0.00016325028,0.98019856,0.00010616255,0.000026885293,0.000045170098,0.00024587865,0.00054785586,0.0009624482],"genre_scores_gemma":[0.51420206,0.0007307158,0.47627297,0.00019871193,0.000099236466,0.00020725581,0.0019533609,0.0003036175,0.006031997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991247,0.00019958902,0.00005237003,0.00031641594,0.00024276167,0.00006419337],"domain_scores_gemma":[0.9977029,0.00073996896,0.0003421849,0.0008427343,0.00029500152,0.00007727684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063182035,0.0013128133,0.001022491,0.001307426,0.0004432495,0.0010139709,0.001546761,0.0010775514,0.0018254467],"category_scores_gemma":[0.0044802404,0.00046141096,0.0008963306,0.0019432536,0.00097096263,0.0033942065,0.0014275564,0.0021206643,0.0008960599],"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.00020085591,0.00015397478,0.002203765,0.00032599815,0.00011049163,0.00030403023,0.0003039949,0.5520424,0.017380651,0.082028754,0.0074841026,0.33746085],"study_design_scores_gemma":[0.000010440565,0.000044080676,0.000355253,0.0000120889845,0.000013999763,0.0001253467,0.000038629263,0.95794374,0.0038956606,0.03543037,0.002117732,0.000012576489],"about_ca_topic_score_codex":0.001931529,"about_ca_topic_score_gemma":0.0033014417,"teacher_disagreement_score":0.001931529,"about_ca_system_score_codex":0.0007802485,"about_ca_system_score_gemma":0.0008276575,"threshold_uncertainty_score":0.0061067343},"labels":[],"label_agreement":null},{"id":"W2546973305","doi":"10.14778/3007263.3007267","title":"GraphJet","year":2016,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":76,"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; Graph; Exploit; Theoretical computer science; Clique-width; Line graph; Voltage graph","score_opus":0.006945037593673362,"score_gpt":0.19420157507786545,"score_spread":0.18725653748419208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2546973305","genre_codex":"software","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.006090757,0.0017336098,0.2947027,0.0019296794,0.0017445185,0.0007078323,0.032835525,0.5331148,0.12714064],"genre_scores_gemma":[0.07931865,0.003195814,0.32920572,0.0035938285,0.00061564543,0.0009408201,0.20106828,0.08228715,0.29977414],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917245,0.00009135281,0.00006563095,0.00023485151,0.00033993355,0.000095839605],"domain_scores_gemma":[0.9987173,0.00021068408,0.00005881018,0.0005993309,0.00028341857,0.00013036937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006136853,0.001430846,0.000811318,0.0015686301,0.0010384743,0.003097087,0.0030908452,0.0015054389,0.11863486],"category_scores_gemma":[0.0033099896,0.00095480314,0.0012021506,0.0014695604,0.0004184545,0.0045795124,0.0037027223,0.0018791935,0.0964596],"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.0005328859,0.00013665152,0.0013711568,0.00083081855,0.000116982155,0.00037444234,0.00024009716,0.004078311,0.009014096,0.034821607,0.6133787,0.3351042],"study_design_scores_gemma":[0.00009968495,0.0000859111,0.0005865994,0.00007071216,0.00003815639,0.000366856,0.00007292995,0.03492459,0.008412727,0.022779541,0.9324914,0.00007088906],"about_ca_topic_score_codex":0.005194614,"about_ca_topic_score_gemma":0.009669951,"teacher_disagreement_score":0.11863486,"about_ca_system_score_codex":0.0008633647,"about_ca_system_score_gemma":0.0013172608,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2604314403","doi":"10.1007/978-3-319-93417-4_38","title":"Modeling Relational Data with Graph Convolutional Networks","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":5060,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; National Science Foundation","keywords":"Computer science; Inference; Predicate (mathematical logic); Encoder; Relational database; Convolutional neural network; Graph; Information retrieval; Artificial intelligence; Knowledge base; Data mining; Theoretical computer science; Programming language","score_opus":0.03535772873792242,"score_gpt":0.25225338356626403,"score_spread":0.2168956548283416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604314403","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.015398152,0.0009554745,0.9781728,0.0005188012,0.000060560742,0.00003558462,0.0014592406,0.001947594,0.0014518682],"genre_scores_gemma":[0.44129217,0.002840374,0.53327006,0.00044578858,0.00018017611,0.0001815863,0.010554966,0.0007453641,0.0104895085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950624,0.00011930506,0.000030810963,0.00017407755,0.00012289001,0.00004661875],"domain_scores_gemma":[0.9988059,0.0006763064,0.00010362824,0.00025097883,0.00012193703,0.000041369964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085971324,0.00089837407,0.00077969546,0.00124532,0.00029817328,0.0017093713,0.0016906913,0.0009444989,0.0033052298],"category_scores_gemma":[0.004476014,0.00085283443,0.0013675608,0.002115475,0.0005066765,0.0039471295,0.0012971429,0.0022781044,0.0014065866],"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.00015381299,0.00014252316,0.0038270596,0.00031094998,0.00024651407,0.00018032757,0.0002028187,0.5802531,0.0036632223,0.09073851,0.013441939,0.30683914],"study_design_scores_gemma":[0.000002577949,0.0000080529,0.00018282716,0.000014445801,0.000014813611,0.00002177385,0.000010489868,0.95098764,0.00045027686,0.04679485,0.0015070473,0.0000052048545],"about_ca_topic_score_codex":0.012269726,"about_ca_topic_score_gemma":0.024551328,"teacher_disagreement_score":0.012269726,"about_ca_system_score_codex":0.0012198746,"about_ca_system_score_gemma":0.00071828056,"threshold_uncertainty_score":0.024396658},"labels":[],"label_agreement":null},{"id":"W2604942799","doi":"10.1609/aaai.v31i1.10488","title":"Community Preserving Network Embedding","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":929,"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; National Natural Science Foundation of China; Tencent","keywords":"Computer science; Embedding; Correctness; Community structure; Modularity (biology); Theoretical computer science; Exploit; Variety (cybernetics); Representation (politics); Feature (linguistics); Feature learning; Artificial intelligence; Non-negative matrix factorization; Matrix decomposition; Algorithm; Mathematics","score_opus":0.1242917882980847,"score_gpt":0.342916314103725,"score_spread":0.2186245258056403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604942799","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.0050002136,0.0002572985,0.99243224,0.00014737413,0.000037622587,0.000039461163,0.00018724024,0.00035403317,0.0015444742],"genre_scores_gemma":[0.43993142,0.0013497648,0.5449197,0.00037137067,0.00022846561,0.0004849031,0.0018777312,0.00040086886,0.01043588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920875,0.00026946052,0.000028030485,0.00022270739,0.0002030847,0.00006808476],"domain_scores_gemma":[0.9987205,0.0005122299,0.00019478911,0.0002551455,0.0002456382,0.00007172168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088444323,0.0013408253,0.0010539145,0.001389497,0.0005329156,0.0009623161,0.0016513703,0.0013522183,0.0028194606],"category_scores_gemma":[0.0046120933,0.0003969697,0.0010930346,0.0012669837,0.000838656,0.0025429379,0.0018534308,0.0017455951,0.0008883986],"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.000091628055,0.0000798146,0.0011919392,0.00033950023,0.000116116265,0.00022185147,0.00019840265,0.59105617,0.00776476,0.15246776,0.011452022,0.23502001],"study_design_scores_gemma":[0.0000061782057,0.000018540337,0.00013691984,0.0000136042245,0.000009356023,0.000060120667,0.000015020482,0.95590395,0.0007962246,0.04056243,0.0024686514,0.000008950435],"about_ca_topic_score_codex":0.0026244735,"about_ca_topic_score_gemma":0.003462556,"teacher_disagreement_score":0.0028194606,"about_ca_system_score_codex":0.0009076539,"about_ca_system_score_gemma":0.0010362905,"threshold_uncertainty_score":0.009432018},"labels":[],"label_agreement":null},{"id":"W2766453196","doi":"10.17863/cam.48429","title":"Graph Attention Networks","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":947,"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; HEC Montréal","funders":"","keywords":"Computer science; Graph; Attention network; Theoretical computer science; Artificial neural network; Artificial intelligence; Machine learning","score_opus":0.06497125518221562,"score_gpt":0.19409011292821438,"score_spread":0.12911885774599874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766453196","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.025001792,0.0022147885,0.9534609,0.002003784,0.0002428627,0.00008737156,0.0011044322,0.0020776568,0.01380643],"genre_scores_gemma":[0.71803427,0.0031139383,0.25168434,0.0019768286,0.00039693055,0.00024891712,0.0038751883,0.00042988596,0.020239703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999435,0.00013748168,0.000018331466,0.00022159182,0.00012478218,0.00006282304],"domain_scores_gemma":[0.9989291,0.0005824553,0.000098774675,0.0001509283,0.00018037105,0.00005840269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059316034,0.0010393001,0.00051347684,0.0011774658,0.0005342965,0.0010597365,0.0018549282,0.0013599169,0.004719655],"category_scores_gemma":[0.0039397217,0.00035409356,0.00081707316,0.0014062016,0.0009791086,0.002926103,0.0015773599,0.0017711569,0.0011558727],"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.00014378688,0.0001285031,0.0027152363,0.00040034956,0.00015842583,0.00019410516,0.00024737377,0.39918512,0.0076576634,0.22097854,0.032459985,0.3357309],"study_design_scores_gemma":[0.000008565062,0.000027109143,0.00055152836,0.000027516548,0.000032251355,0.000064501626,0.00002507229,0.8171505,0.001955902,0.17044216,0.009701014,0.0000138915075],"about_ca_topic_score_codex":0.0071965815,"about_ca_topic_score_gemma":0.012227393,"teacher_disagreement_score":0.0071965815,"about_ca_system_score_codex":0.0014038513,"about_ca_system_score_gemma":0.00074126496,"threshold_uncertainty_score":0.015788794},"labels":[],"label_agreement":null},{"id":"W2783238014","doi":"10.1145/3178422.3178424","title":"How do ideas flow around SIGMM conferences?","year":2018,"lang":"en","type":"article","venue":"ACM SIGMultimedia Records","topic":"Advanced Graph Neural Networks","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":"CITES; Download; Computer science; Task (project management); Library science; World Wide Web; Citation; Quarter (Canadian coin); Academic community; Information retrieval; History; Engineering","score_opus":0.02317305913789772,"score_gpt":0.2652905193800475,"score_spread":0.24211746024214978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783238014","genre_codex":"commentary","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.0048363996,0.026807005,0.0031955417,0.846403,0.038532544,0.00009017381,0.0028600923,0.0010632649,0.076211974],"genre_scores_gemma":[0.21973649,0.11735986,0.020613384,0.36988273,0.108513825,0.00087987154,0.0101710465,0.0072880546,0.14555477],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9751213,0.009065365,0.0017412599,0.0025849626,0.008667797,0.0028192867],"domain_scores_gemma":[0.8857153,0.027176356,0.014945395,0.008553498,0.03493998,0.028669544],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.040333237,0.0010587212,0.0008369854,0.031047922,0.0076163895,0.053863812,0.0031125143,0.007348682,0.058269244],"category_scores_gemma":[0.17789952,0.0008944963,0.0012477516,0.041300356,0.0074483342,0.048377115,0.008096686,0.010013854,0.030976819],"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.0000612716,0.000039782684,0.004132636,0.00035862546,0.000042169147,0.000055802164,0.0022660014,0.0001441997,0.000077423996,0.057977166,0.81922174,0.115623206],"study_design_scores_gemma":[0.000024309134,0.000026197902,0.0042447024,0.0009378149,0.0000151982895,0.000059469436,0.0048768446,0.00010343029,0.000115262745,0.021224901,0.9683096,0.00006237356],"about_ca_topic_score_codex":0.008523307,"about_ca_topic_score_gemma":0.010697053,"teacher_disagreement_score":0.96895206,"about_ca_system_score_codex":0.010464858,"about_ca_system_score_gemma":0.0113672,"threshold_uncertainty_score":0.21330512},"labels":[],"label_agreement":null},{"id":"W2788408359","doi":"10.1609/aaai.v32i1.11548","title":"Embedding of Hierarchically Typed Knowledge Bases","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","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 Ottawa","funders":"National Key Research and Development Program of China; Beijing Advanced Innovation Center for Big Data and Brain Computing; State Key Laboratory of Software Development Environment; National Natural Science Foundation of China","keywords":"Embedding; Computer science; Set (abstract data type); Inference; Theoretical computer science; Knowledge base; Constraint (computer-aided design); Base (topology); Scheme (mathematics); Artificial intelligence; Mathematics; Programming language","score_opus":0.07006822215061718,"score_gpt":0.3312770358805869,"score_spread":0.2612088137299697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788408359","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.059582543,0.00030245664,0.9367492,0.00029344784,0.000033392662,0.000045703207,0.00042083274,0.00052360346,0.002048802],"genre_scores_gemma":[0.68555975,0.00058321183,0.3066643,0.00013734389,0.000054442255,0.00012937801,0.0015987793,0.00015822046,0.005114606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988397,0.00047381705,0.00008997115,0.0002365747,0.00027230725,0.00008756797],"domain_scores_gemma":[0.99597543,0.002056773,0.00038299905,0.00096416846,0.0004989441,0.000121739766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012228045,0.00049604685,0.00054988865,0.0018198928,0.0004487181,0.0015098756,0.0013358486,0.00088035746,0.0024583708],"category_scores_gemma":[0.0078071225,0.000498357,0.00082140195,0.0020688165,0.0008237075,0.004743036,0.0020351452,0.0011459822,0.00047365043],"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.0002201142,0.00016449763,0.0032338297,0.0003093227,0.000121190635,0.00055817113,0.00085788773,0.4894645,0.007903889,0.2621306,0.002901075,0.23213491],"study_design_scores_gemma":[0.000009884212,0.000039334398,0.000313016,0.000027638174,0.00003718811,0.000064457825,0.00008080561,0.826628,0.0021082307,0.16767488,0.0030018587,0.000014774601],"about_ca_topic_score_codex":0.0041445745,"about_ca_topic_score_gemma":0.006088307,"teacher_disagreement_score":0.0041445745,"about_ca_system_score_codex":0.0007701457,"about_ca_system_score_gemma":0.0007269401,"threshold_uncertainty_score":0.008240938},"labels":[],"label_agreement":null},{"id":"W2791941169","doi":"10.5441/002/edbt.2018.52","title":"Point-of-Interest Recommendation Using Heterogeneous Link Prediction","year":2018,"lang":"en","type":"article","venue":"Movebank","topic":"Advanced Graph Neural Networks","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Link (geometry); Point (geometry); Point of interest; Data mining; Artificial intelligence; Computer network; Mathematics","score_opus":0.0692021735810043,"score_gpt":0.2914990192153362,"score_spread":0.2222968456343319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791941169","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.12054094,0.006773153,0.84233147,0.0017398046,0.00085367943,0.00029126546,0.008424462,0.010170193,0.008875072],"genre_scores_gemma":[0.71139246,0.0017499207,0.2542421,0.00063783,0.00061344134,0.00020115165,0.013709741,0.0004451705,0.01700824],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897265,0.00017210972,0.000054854558,0.0004471609,0.0002543132,0.000098807825],"domain_scores_gemma":[0.9981499,0.00087067427,0.00011160425,0.00042622842,0.00034482285,0.000096825395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007394549,0.0014642719,0.0021948582,0.004242208,0.00073819497,0.0013381202,0.0030755524,0.002826915,0.0046474985],"category_scores_gemma":[0.004971365,0.0007151019,0.0012847908,0.004829797,0.00035252178,0.003457021,0.0011599725,0.002249484,0.0039687245],"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.0015683657,0.0016156205,0.015767494,0.0005417827,0.0008935516,0.0006524818,0.00016223098,0.15599936,0.010841602,0.007290501,0.08674848,0.71791846],"study_design_scores_gemma":[0.00003073023,0.000060881954,0.0009553819,0.000017684673,0.000093125534,0.00007988614,0.000019137125,0.99118125,0.0014819741,0.004170243,0.0018887179,0.00002097753],"about_ca_topic_score_codex":0.021044943,"about_ca_topic_score_gemma":0.04999513,"teacher_disagreement_score":0.021044943,"about_ca_system_score_codex":0.0006564855,"about_ca_system_score_gemma":0.0007934607,"threshold_uncertainty_score":0.041844904},"labels":[],"label_agreement":null},{"id":"W2808284704","doi":"10.24963/ijcai.2018/611","title":"Bootstrapping Entity Alignment with Knowledge Graph Embedding","year":2018,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":531,"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","keywords":"Bootstrapping (finance); Embedding; Computer science; Knowledge graph; Graph; Artificial intelligence; Process (computing); Graph embedding; Training set; Labeled data; Natural language processing; Theoretical computer science; Machine learning; Data mining; Mathematics; Programming language","score_opus":0.016141416615473612,"score_gpt":0.27651770015883614,"score_spread":0.2603762835433625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808284704","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.028060263,0.00033538742,0.9654039,0.000116574025,0.000060928956,0.000097348035,0.0003089451,0.004629558,0.0009871344],"genre_scores_gemma":[0.40254095,0.00033961172,0.5896798,0.00016924512,0.00006284403,0.00017059562,0.0042414223,0.00042971806,0.0023657822],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850535,0.00040149598,0.00008526734,0.000655957,0.00026354467,0.00008842672],"domain_scores_gemma":[0.99749976,0.00083863334,0.0002946887,0.0008803696,0.0004007315,0.00008588796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010237572,0.0013880307,0.0014115672,0.002292942,0.00061756285,0.0010576481,0.0017602753,0.0012828087,0.0018339072],"category_scores_gemma":[0.0062546325,0.00054466707,0.0010163418,0.0032674992,0.0006045924,0.004956424,0.0023178293,0.0018142237,0.0015184176],"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.00018767813,0.00023344206,0.00311124,0.00020005343,0.00015698525,0.00021845606,0.000274229,0.1524707,0.010156467,0.013335066,0.007939115,0.8117166],"study_design_scores_gemma":[0.000015923497,0.000065883265,0.0006166652,0.000014114273,0.000034805664,0.00011407866,0.00010161462,0.968538,0.006068089,0.021562658,0.002848069,0.000020177986],"about_ca_topic_score_codex":0.0032652772,"about_ca_topic_score_gemma":0.004992812,"teacher_disagreement_score":0.0032652772,"about_ca_system_score_codex":0.00060944725,"about_ca_system_score_gemma":0.00089983473,"threshold_uncertainty_score":0.006492555},"labels":[],"label_agreement":null},{"id":"W2808466528","doi":"10.24963/ijcai.2018/438","title":"ANRL: Attributed Network Representation Learning via Deep Neural Networks","year":2018,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":235,"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":"Zhejiang University; National Natural Science Foundation of China","keywords":"Computer science; Autoencoder; Node (physics); Representation (politics); Focus (optics); Artificial intelligence; Feature learning; Encoder; Network structure; Artificial neural network; Data mining; Theoretical computer science; Machine learning","score_opus":0.01612407182908719,"score_gpt":0.2656443981401106,"score_spread":0.2495203263110234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808466528","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.013605159,0.0005804081,0.9804529,0.0004048016,0.00008665412,0.000047154837,0.0003286325,0.002883733,0.001610466],"genre_scores_gemma":[0.633106,0.0009905652,0.35141096,0.0006870094,0.0001861343,0.00030216153,0.0027352574,0.00038896964,0.010193036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994295,0.00019861985,0.000027587694,0.00014316873,0.0001401838,0.000060804887],"domain_scores_gemma":[0.99860424,0.000644651,0.00014241402,0.00029606203,0.00024264886,0.00007008068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012930922,0.001033466,0.0009705936,0.0009878823,0.00035746238,0.0010645514,0.0024400186,0.0011685787,0.002310184],"category_scores_gemma":[0.00427131,0.0004222393,0.0007131008,0.0011642178,0.0006654559,0.002599209,0.0018078302,0.0024971694,0.0008426817],"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.0001242567,0.00016675261,0.0012135243,0.00013406758,0.00010139651,0.0000871744,0.000092790746,0.6693878,0.0021464627,0.025419865,0.008625733,0.29250017],"study_design_scores_gemma":[0.0000040751747,0.000007906189,0.000038160924,0.000003873938,0.0000038705925,0.0000056688277,0.000003855606,0.9922275,0.00022610345,0.0070899255,0.0003862748,0.0000027193003],"about_ca_topic_score_codex":0.007370059,"about_ca_topic_score_gemma":0.008782134,"teacher_disagreement_score":0.007370059,"about_ca_system_score_codex":0.0011867812,"about_ca_system_score_gemma":0.0009164136,"threshold_uncertainty_score":0.014654338},"labels":[],"label_agreement":null},{"id":"W2808483757","doi":"10.24963/ijcai.2018/475","title":"Lightweight Label Propagation for Large-Scale Network Data","year":2018,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Novelis (Canada)","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Computer science; Process (computing); Overhead (engineering); Scale (ratio); Graph; Theoretical computer science; Stochastic gradient descent; Algorithm; Data mining; Artificial intelligence; Artificial neural network","score_opus":0.03688565519832589,"score_gpt":0.29574545368964944,"score_spread":0.25885979849132357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808483757","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.010050067,0.000110733854,0.9854775,0.00033735204,0.000066754415,0.00009359284,0.00019126051,0.0031492386,0.0005234752],"genre_scores_gemma":[0.16706805,0.00016902,0.826425,0.00038324334,0.0001381169,0.0003991709,0.0016539614,0.00059643685,0.003167],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998384,0.00045666142,0.000070591464,0.00043514327,0.0004969623,0.00015662417],"domain_scores_gemma":[0.9933873,0.0033946955,0.0005171321,0.0015284391,0.00093597145,0.00023649946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002823304,0.0014906803,0.00130751,0.001821341,0.0016775555,0.0015807368,0.003724468,0.0020690488,0.0022303043],"category_scores_gemma":[0.009889581,0.0008354807,0.0010259892,0.002190118,0.0012864623,0.0039124424,0.0032367338,0.0037512558,0.0013760364],"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.0004198974,0.00039490167,0.003138322,0.00028277186,0.00018495566,0.00026063435,0.00044703175,0.35360515,0.01801423,0.022181444,0.01965416,0.5814164],"study_design_scores_gemma":[0.000023702743,0.000017161068,0.00017893245,0.000006423284,0.000008362751,0.000033486333,0.000033834436,0.97642875,0.0028926993,0.019006846,0.0013605572,0.000009214004],"about_ca_topic_score_codex":0.006988322,"about_ca_topic_score_gemma":0.014412582,"teacher_disagreement_score":0.006988322,"about_ca_system_score_codex":0.001406742,"about_ca_system_score_gemma":0.0020244939,"threshold_uncertainty_score":0.014931262},"labels":[],"label_agreement":null},{"id":"W2809156873","doi":"10.1145/3219819.3219969","title":"Arbitrary-Order Proximity Preserved Network Embedding","year":2018,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":211,"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":"Embedding; Scalability; Computer science; Node (physics); Order (exchange); Decomposition; Mathematical optimization; Algorithm; Theoretical computer science; Topology (electrical circuits); Mathematics; Artificial intelligence","score_opus":0.018157348298126093,"score_gpt":0.2724486667270325,"score_spread":0.2542913184289064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809156873","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.009956053,0.00021418079,0.9879853,0.00009139626,0.000030246601,0.000024500145,0.00012613139,0.00044192825,0.0011301996],"genre_scores_gemma":[0.40061375,0.0010568673,0.58792996,0.00014796633,0.00010790547,0.00019033763,0.0012670899,0.00036011686,0.008325925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995171,0.00011985695,0.00002432484,0.00013861337,0.00015094066,0.000049217862],"domain_scores_gemma":[0.9991159,0.00032354498,0.000121901496,0.00024843749,0.00014358385,0.00004660707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004723386,0.0012342698,0.00083701743,0.0011863846,0.000367195,0.0008266872,0.0010358952,0.00079246546,0.0022982354],"category_scores_gemma":[0.0028112677,0.00038119775,0.00078028196,0.0013117965,0.0007259494,0.0021986596,0.0014392335,0.0015870784,0.00085813453],"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.000128725,0.000083861756,0.0013111708,0.00027692347,0.00008550428,0.00023672203,0.00023669617,0.5362825,0.017052429,0.06147667,0.0062957807,0.37653306],"study_design_scores_gemma":[0.0000058201413,0.00002326543,0.00021323402,0.000010289971,0.0000098657665,0.00007859275,0.000026823534,0.9736616,0.0027653358,0.021111391,0.0020837542,0.000010047406],"about_ca_topic_score_codex":0.0021688938,"about_ca_topic_score_gemma":0.0037633232,"teacher_disagreement_score":0.0022982354,"about_ca_system_score_codex":0.00057802646,"about_ca_system_score_gemma":0.0007702745,"threshold_uncertainty_score":0.0076883435},"labels":[],"label_agreement":null},{"id":"W2811124557","doi":"","title":"Hierarchical graph representation learning with differentiable pooling","year":2018,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":909,"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":"Pooling; Differentiable function; Computer science; Graph; Artificial intelligence; Theoretical computer science; Benchmark (surveying); Pattern recognition (psychology); Mathematics","score_opus":0.014365399824819249,"score_gpt":0.2542677497504681,"score_spread":0.23990234992564888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2811124557","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.03061982,0.0006282172,0.95661753,0.00037911013,0.000087498454,0.00008938764,0.0006044134,0.007794263,0.0031798375],"genre_scores_gemma":[0.5373724,0.00065216556,0.44516322,0.00061764877,0.00010764643,0.00021049232,0.004964486,0.0007014129,0.010210466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994804,0.00008980309,0.00002308702,0.00021672319,0.00011680216,0.000073229545],"domain_scores_gemma":[0.9994129,0.00014268412,0.000068929,0.00022582721,0.00010442737,0.000045112836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007720315,0.0019571632,0.0011387202,0.0012813922,0.00045358826,0.0010096009,0.0024513926,0.0011240814,0.0040555396],"category_scores_gemma":[0.0023810738,0.00049990945,0.0014035346,0.0015991277,0.0007139161,0.003598896,0.0017996542,0.0016918258,0.0015018228],"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.00022025805,0.00018332218,0.0010954103,0.00022865502,0.00019652676,0.00015506979,0.00013310963,0.36272,0.013243839,0.0280286,0.019978726,0.5738164],"study_design_scores_gemma":[0.000013312047,0.00003903009,0.00022101533,0.000008674614,0.000021134258,0.00002884878,0.000015086436,0.9701634,0.003424375,0.024492795,0.0015636078,0.000008803861],"about_ca_topic_score_codex":0.009685178,"about_ca_topic_score_gemma":0.016223026,"teacher_disagreement_score":0.009685178,"about_ca_system_score_codex":0.0015922709,"about_ca_system_score_gemma":0.0010913439,"threshold_uncertainty_score":0.019257605},"labels":[],"label_agreement":null},{"id":"W2885592141","doi":"","title":"RecService: Distributed Real-Time Graph Processing at Twitter.","year":2018,"lang":"en","type":"article","venue":"USENIX conference on Hot Topics in Cloud Ccomputing","topic":"Advanced Graph Neural Networks","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":"University of Waterloo","funders":"","keywords":"Computer science; Graph; Theoretical computer science","score_opus":0.043533479712902966,"score_gpt":0.3036088071203162,"score_spread":0.26007532740741324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885592141","genre_codex":"software","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.017954776,0.0006725216,0.12650955,0.0013528772,0.0009612981,0.0004974715,0.053926893,0.784536,0.01358859],"genre_scores_gemma":[0.39622542,0.0012795215,0.25412524,0.0016863112,0.0007094133,0.0020081229,0.22296102,0.07115051,0.049854428],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991184,0.00014032403,0.000060284798,0.0002482025,0.00031614248,0.00011669495],"domain_scores_gemma":[0.9983417,0.00048454752,0.000072901945,0.00058641547,0.00024875853,0.00026566893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010969385,0.0026629039,0.001389299,0.0020482957,0.00082384085,0.0020571717,0.003590056,0.0011581398,0.05745967],"category_scores_gemma":[0.0054507297,0.0008515311,0.00077965466,0.0019202287,0.0005014538,0.0036284714,0.002455769,0.0014859332,0.033911936],"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.0024336905,0.0003031632,0.0027066355,0.0006619176,0.00032686276,0.00033815586,0.0002651409,0.013948379,0.015836932,0.0059170187,0.8356647,0.12159732],"study_design_scores_gemma":[0.0011060383,0.00023410044,0.0023362786,0.00006118312,0.00008612271,0.00019873418,0.00031020664,0.80609846,0.02923532,0.02980565,0.13037194,0.00015590971],"about_ca_topic_score_codex":0.009068358,"about_ca_topic_score_gemma":0.0151516395,"teacher_disagreement_score":0.05745967,"about_ca_system_score_codex":0.001027546,"about_ca_system_score_gemma":0.0012364661,"threshold_uncertainty_score":0.19222176},"labels":[],"label_agreement":null},{"id":"W2890848214","doi":"10.1109/icassp.2018.8462291","title":"A Graph-CNN for 3D Point Cloud Classification","year":2018,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":181,"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":"Computer science; Upsampling; Point cloud; Graph; Pooling; Theoretical computer science; Convolutional neural network; Topological graph theory; Artificial intelligence; Line graph; Voltage graph","score_opus":0.031463371795567595,"score_gpt":0.2832721333078607,"score_spread":0.25180876151229314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890848214","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.04501226,0.00069223717,0.9299968,0.0006236986,0.0003470636,0.00019021568,0.0024000178,0.014182655,0.0065551265],"genre_scores_gemma":[0.45208785,0.0007838304,0.52455217,0.000605597,0.0001072751,0.00021284471,0.00810577,0.00043580326,0.013108894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997719,0.000014281698,0.000008150732,0.00008567141,0.00007700722,0.0000430939],"domain_scores_gemma":[0.99983656,0.000021221624,0.00001310181,0.000043065174,0.00006577943,0.000020238655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023421778,0.0010858605,0.00048288517,0.00089352997,0.00035450057,0.0006002663,0.001888563,0.001062617,0.004688013],"category_scores_gemma":[0.00065676204,0.00048648883,0.00094441616,0.0010382442,0.00039930426,0.0013292466,0.000950749,0.00093824207,0.0020472773],"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.0002441888,0.00016040598,0.0024287947,0.00016000231,0.00016618754,0.00030355228,0.0000413442,0.3013763,0.051144186,0.009622886,0.030966932,0.6033852],"study_design_scores_gemma":[0.000006477249,0.00003158646,0.0005062854,0.0000061231444,0.000013491868,0.00005437151,0.0000058224146,0.9856778,0.008353881,0.002488495,0.0028458654,0.000009682749],"about_ca_topic_score_codex":0.025022123,"about_ca_topic_score_gemma":0.031122377,"teacher_disagreement_score":0.025022123,"about_ca_system_score_codex":0.0012690682,"about_ca_system_score_gemma":0.0008349681,"threshold_uncertainty_score":0.04975295},"labels":[],"label_agreement":null},{"id":"W2893944917","doi":"","title":"Deep Graph Infomax.","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":156,"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":"Infomax; Computer science; Graph; Artificial intelligence; Node (physics); Unsupervised learning; Machine learning; Competitive learning; Feature learning; Random walk; Theoretical computer science; Mathematics","score_opus":0.05111203280535453,"score_gpt":0.1820539192501569,"score_spread":0.13094188644480237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2893944917","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.019388683,0.0023130218,0.9324761,0.0018468113,0.00036225872,0.00017201128,0.0069800667,0.020330394,0.01613068],"genre_scores_gemma":[0.45730916,0.0021407136,0.47362986,0.001809982,0.0003147636,0.0004449168,0.033157967,0.0021645096,0.029028198],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947435,0.000094167466,0.00001851209,0.00021902633,0.00013601016,0.00005795274],"domain_scores_gemma":[0.9992613,0.00027176825,0.000079661804,0.00022291692,0.00010316037,0.00006116113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071058166,0.0017613716,0.0010063507,0.0012472621,0.00050598633,0.0014882053,0.003053189,0.0017846319,0.0096330885],"category_scores_gemma":[0.0035071278,0.00056630163,0.0011478257,0.0015185052,0.0007726932,0.0034064774,0.0018451771,0.002714136,0.005189292],"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.0003304365,0.00035005354,0.0023225367,0.00063341786,0.00034856645,0.00016916187,0.00012771187,0.32550067,0.00951042,0.079260245,0.0917727,0.4896741],"study_design_scores_gemma":[0.000015918202,0.000044137516,0.00031602182,0.000029001658,0.000034647863,0.00005160292,0.000015553136,0.90478426,0.004944231,0.07981509,0.009933916,0.000015652831],"about_ca_topic_score_codex":0.004866147,"about_ca_topic_score_gemma":0.011660097,"teacher_disagreement_score":0.0096330885,"about_ca_system_score_codex":0.0014835763,"about_ca_system_score_gemma":0.0012013024,"threshold_uncertainty_score":0.032225907},"labels":[],"label_agreement":null},{"id":"W2896398259","doi":"10.1109/bsc.2018.8494688","title":"A Hierarchical Graph Signal Processing Approach to Inference from Spatiotemporal Signals","year":2018,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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 Toronto","funders":"","keywords":"Pattern recognition (psychology); Graph; Inference; Signal processing; Feature extraction; Embedding; Leverage (statistics); Ranging; Time series","score_opus":0.03275585631511516,"score_gpt":0.28348922980777225,"score_spread":0.25073337349265706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896398259","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.0012352552,0.00008227953,0.99805236,0.00006923829,0.000010994483,0.000012805757,0.00009373016,0.0002023668,0.00024093658],"genre_scores_gemma":[0.17322345,0.0006605416,0.8218854,0.0001947083,0.00017860266,0.00015636093,0.0012013931,0.00022695315,0.002272632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992823,0.00024386536,0.000039789807,0.00023269927,0.00015670576,0.000044693603],"domain_scores_gemma":[0.9979918,0.0012264595,0.00018025577,0.00028327157,0.00025888698,0.00005936239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009842968,0.0010264115,0.000739084,0.0028093036,0.0004724976,0.000952881,0.0015584091,0.0008776104,0.0020076241],"category_scores_gemma":[0.004737277,0.0005875419,0.0014152309,0.0023656795,0.0008095125,0.0018133699,0.0010201066,0.0017828761,0.00071204174],"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.00008756026,0.00008511986,0.0012353943,0.00024776193,0.00021919238,0.00025809446,0.00020400254,0.6246561,0.009917948,0.101294816,0.004294299,0.25749972],"study_design_scores_gemma":[0.0000049314767,0.00001914738,0.00024042836,0.000006587237,0.000016575004,0.000024225106,0.000009562972,0.94128335,0.0007128863,0.05654277,0.0011302321,0.000009319974],"about_ca_topic_score_codex":0.008304968,"about_ca_topic_score_gemma":0.010006695,"teacher_disagreement_score":0.008304968,"about_ca_system_score_codex":0.00077893765,"about_ca_system_score_gemma":0.00072105444,"threshold_uncertainty_score":0.016513228},"labels":[],"label_agreement":null},{"id":"W2899568612","doi":"10.3233/fi-2018-1746","title":"A Descriptive Tolerance Nearness Measure for Performing Graph Comparison","year":2018,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Advanced Graph Neural Networks","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 Winnipeg","funders":"","keywords":"Disjoint sets; Bipartite graph; Mathematics; Enumeration; Clique; Combinatorics; Graph; Theoretical computer science; Discrete mathematics; Computer science; Algorithm","score_opus":0.037069702012035785,"score_gpt":0.28832069830113355,"score_spread":0.25125099628909775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899568612","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.01586125,0.00030499767,0.98107624,0.00009785279,0.00005967769,0.000082254985,0.00012990009,0.00037838914,0.0020094141],"genre_scores_gemma":[0.26494306,0.0002774079,0.7319276,0.00014339028,0.000118385295,0.00032591232,0.00070912234,0.00025999203,0.0012951639],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925793,0.0022210486,0.00059462694,0.0013420242,0.003059437,0.00020367876],"domain_scores_gemma":[0.9852343,0.007593634,0.0016470435,0.002839353,0.0020977005,0.00058798876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040891995,0.000858247,0.001389299,0.0071912347,0.001258941,0.0023977377,0.0026042527,0.0017137163,0.002863382],"category_scores_gemma":[0.0292639,0.0004145711,0.0012344309,0.0047294553,0.002509887,0.006375409,0.0030090555,0.0021898535,0.00079396664],"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.0003683831,0.00030456643,0.0076817446,0.00077867904,0.00033660806,0.00036322948,0.00076660933,0.15950394,0.027725486,0.35107702,0.0039026127,0.44719112],"study_design_scores_gemma":[0.000032607964,0.00057341,0.004125022,0.00012262349,0.000097151285,0.0012017785,0.00039921165,0.6193089,0.018209947,0.3425564,0.013217657,0.0001552303],"about_ca_topic_score_codex":0.00084964104,"about_ca_topic_score_gemma":0.00092876796,"teacher_disagreement_score":0.0071912347,"about_ca_system_score_codex":0.0013641722,"about_ca_system_score_gemma":0.0010872466,"threshold_uncertainty_score":0.021626055},"labels":[],"label_agreement":null},{"id":"W2903329593","doi":"10.1109/bigdata.2018.8621910","title":"dynnode2vec: Scalable Dynamic Network Embedding","year":2018,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":119,"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":"Embedding; Computer science; Graph embedding; Scalability; Random walk; Theoretical computer science; Timestamp; Dynamic network analysis; Graph; Representation (politics); Vector space; Artificial intelligence; Mathematics; Computer network","score_opus":0.008102776568752312,"score_gpt":0.2681077697511505,"score_spread":0.2600049931823982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903329593","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.039394807,0.001678843,0.8843926,0.00091011747,0.0006148609,0.00029231177,0.016002927,0.052072294,0.0046412605],"genre_scores_gemma":[0.3205199,0.0016350672,0.5807679,0.00063134707,0.00023880304,0.0008075287,0.08159665,0.0033645376,0.010438216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941444,0.00012979619,0.000034056062,0.00018693501,0.00017869115,0.000056040033],"domain_scores_gemma":[0.9992766,0.00019826888,0.000060475686,0.00020530469,0.00021494705,0.000044488927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047378294,0.0022185831,0.0010772235,0.001336145,0.0004524914,0.0011537133,0.0017935333,0.0008032894,0.003925366],"category_scores_gemma":[0.0026415272,0.00066813605,0.0008941154,0.001958683,0.00041448872,0.0027106327,0.0014069142,0.0017018903,0.0024705422],"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.00025751593,0.00028826488,0.00353312,0.0005667834,0.00042799136,0.0003271281,0.00017892927,0.31197464,0.009560062,0.016731882,0.18762654,0.4685271],"study_design_scores_gemma":[0.000020771491,0.000038138038,0.00037866572,0.000009888326,0.0000114226705,0.00006962228,0.000027781518,0.9824958,0.0026707316,0.006871191,0.007385796,0.00002020158],"about_ca_topic_score_codex":0.013138609,"about_ca_topic_score_gemma":0.027920477,"teacher_disagreement_score":0.013138609,"about_ca_system_score_codex":0.000809546,"about_ca_system_score_gemma":0.0010874843,"threshold_uncertainty_score":0.026124299},"labels":[],"label_agreement":null},{"id":"W2905284239","doi":"10.1609/aaai.v33i01.33012895","title":"LENA: Locality-Expanded Neural Embedding for Knowledge Base Completion","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","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 Ottawa","funders":"National Key Research and Development Program of China; Beijing Advanced Innovation Center for Big Data and Brain Computing; State Key Laboratory of Software Development Environment; National Natural Science Foundation of China","keywords":"Embedding; Locality; Knowledge base; Neighbourhood (mathematics); Computer science; Theoretical computer science; Graph; Artificial neural network; Artificial intelligence; Mathematics","score_opus":0.08924279712722161,"score_gpt":0.32619592035492556,"score_spread":0.23695312322770395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905284239","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.019266462,0.0010905951,0.9741241,0.0004967716,0.00006621202,0.00011120367,0.00044946524,0.0027566913,0.0016384524],"genre_scores_gemma":[0.55725574,0.0011485536,0.42788857,0.0006153155,0.00013952325,0.00047082367,0.0037719002,0.0003830853,0.008326502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990736,0.0003300376,0.00005817027,0.00023812878,0.00023379503,0.00006625638],"domain_scores_gemma":[0.99723464,0.0014358553,0.00022505819,0.00066758064,0.00032944017,0.000107491534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020011312,0.001088304,0.0011530734,0.0016470898,0.00048848114,0.0011661607,0.002543908,0.0014845732,0.0032393886],"category_scores_gemma":[0.007950501,0.00046427408,0.0011191939,0.0017306842,0.0009005037,0.004167281,0.002511596,0.003551743,0.0011741952],"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.0002223775,0.00031176934,0.0016562645,0.0002753477,0.00018800698,0.00012649715,0.00020871624,0.49152353,0.0023588333,0.022707768,0.009099047,0.47132185],"study_design_scores_gemma":[0.000007910522,0.000028774424,0.00012351938,0.000012646718,0.000010008776,0.000018090503,0.0000121460835,0.9787118,0.00058794115,0.01963091,0.00084909494,0.0000072430807],"about_ca_topic_score_codex":0.007686381,"about_ca_topic_score_gemma":0.01094579,"teacher_disagreement_score":0.007686381,"about_ca_system_score_codex":0.0012550397,"about_ca_system_score_gemma":0.0013170594,"threshold_uncertainty_score":0.015283287},"labels":[],"label_agreement":null},{"id":"W2905514808","doi":"10.1609/aaai.v33i01.33014360","title":"Learning Multi-Task Communication with Message Passing for Sequence Learning","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":20,"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; Polytechnique Montréal","funders":"Science and Technology Commission of Shanghai Municipality; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Task (project management); Sequence learning; Artificial intelligence; Graph; Multi-task learning; Machine learning; Sequence (biology); Transfer of learning; Message passing; Natural language processing; Theoretical computer science; Distributed computing","score_opus":0.07632874879394373,"score_gpt":0.30763395760968065,"score_spread":0.2313052088157369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905514808","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.009790012,0.00021578454,0.9869667,0.00045812514,0.00009672752,0.00009036829,0.00008273055,0.0014292294,0.0008703518],"genre_scores_gemma":[0.57477295,0.00033292198,0.41495222,0.00060703076,0.00024865413,0.0007692114,0.0007237966,0.0003072818,0.0072859568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998125,0.0008205807,0.000087150205,0.00047722913,0.00027883385,0.00021126615],"domain_scores_gemma":[0.9950799,0.0025289615,0.00036991693,0.0010854189,0.0005939397,0.00034187586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035962262,0.0018670008,0.0014888743,0.0010990519,0.0008395895,0.0014905739,0.004100163,0.0030866503,0.004520966],"category_scores_gemma":[0.011447868,0.0006377219,0.0013184231,0.0011635736,0.001564657,0.005269406,0.0030422618,0.0043772673,0.0014642851],"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.0006848202,0.0006844829,0.0013248286,0.00033096306,0.0001920556,0.00019999305,0.00037652737,0.62814957,0.0064342134,0.047604013,0.0074559352,0.3065625],"study_design_scores_gemma":[0.000017726052,0.000060813403,0.00006426331,0.0000060062935,0.000011306287,0.000012240668,0.000009969327,0.9710193,0.0014418274,0.026715567,0.0006306803,0.000010293894],"about_ca_topic_score_codex":0.0050392877,"about_ca_topic_score_gemma":0.005446265,"teacher_disagreement_score":0.0050392877,"about_ca_system_score_codex":0.0019112735,"about_ca_system_score_gemma":0.0020767762,"threshold_uncertainty_score":0.019018888},"labels":[],"label_agreement":null},{"id":"W2907079035","doi":"10.48550/arxiv.1901.01484","title":"LanczosNet: Multi-Scale Deep Graph Convolutional Networks","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":140,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; University of Toronto","funders":"","keywords":"Computer science; Graph; Scale (ratio); Artificial intelligence; Theoretical computer science; Cartography; Geography","score_opus":0.051265114663079224,"score_gpt":0.18529132808432733,"score_spread":0.1340262134212481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907079035","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.023960954,0.00080850464,0.94660413,0.00077828957,0.00023049217,0.00012242515,0.0018674443,0.019594628,0.0060331584],"genre_scores_gemma":[0.37479413,0.0010367271,0.59216434,0.0009477641,0.00012895308,0.00033701732,0.008528231,0.001629028,0.020433763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976915,0.000039322742,0.00000904902,0.00007005854,0.00007361731,0.00003872189],"domain_scores_gemma":[0.9996582,0.00010123797,0.00003670431,0.00009594649,0.00007015165,0.000037661146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042522658,0.0011252005,0.0007599635,0.00096865033,0.0004619754,0.0010653122,0.0026281744,0.0014475245,0.006360535],"category_scores_gemma":[0.002023448,0.00055140856,0.0008335706,0.0014969269,0.0006804924,0.0022555455,0.0015220786,0.0018046913,0.0025067136],"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.00025070694,0.00018439504,0.0012427066,0.00029385244,0.00018163152,0.00021039345,0.000093279115,0.5511374,0.009825155,0.0436103,0.055708516,0.33726168],"study_design_scores_gemma":[0.000014060894,0.000015951506,0.000082677274,0.000006225908,0.0000053606536,0.000017628072,0.00000534675,0.9835734,0.0010763654,0.012716238,0.0024804852,0.000006334611],"about_ca_topic_score_codex":0.0127275055,"about_ca_topic_score_gemma":0.03557927,"teacher_disagreement_score":0.0127275055,"about_ca_system_score_codex":0.0013896087,"about_ca_system_score_gemma":0.0013187797,"threshold_uncertainty_score":0.02530682},"labels":[],"label_agreement":null},{"id":"W2907596805","doi":"10.1109/tsipn.2018.2890231","title":"Graph-Based Compression for Distributed Particle Filters","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Advanced Graph Neural Networks","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Exploit; Overhead (engineering); Particle filter; Laplacian matrix; ENCODE; Graph; Algorithm; Theoretical computer science; Distributed computing; Filter (signal processing)","score_opus":0.008885015688578418,"score_gpt":0.2240665093562346,"score_spread":0.21518149366765618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907596805","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.004898897,0.00013007844,0.9930789,0.0002024816,0.00005736103,0.000022458384,0.00003807715,0.00031455106,0.0012571776],"genre_scores_gemma":[0.47077635,0.0005696186,0.5222436,0.0003714509,0.00016589205,0.0001933008,0.00033807993,0.00017304963,0.0051686065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995059,0.000098521916,0.00002176584,0.000093417555,0.00024557364,0.00003484041],"domain_scores_gemma":[0.9986229,0.00071321503,0.00010453097,0.00023997191,0.00027553036,0.000043828677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065166125,0.00060068205,0.0005925535,0.00064697326,0.00039655156,0.0007591875,0.0010645295,0.0011707335,0.002138072],"category_scores_gemma":[0.0039097136,0.00027030773,0.00040279017,0.0008668094,0.0007079388,0.0013659929,0.0010044369,0.0011442662,0.0006175381],"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.0001974028,0.000060676237,0.0006188073,0.00012772148,0.00004741274,0.00015266768,0.00009925885,0.693564,0.014149998,0.069628105,0.005065538,0.2162884],"study_design_scores_gemma":[0.00001930443,0.000030052543,0.00014194226,0.0000067499186,0.0000056848144,0.000055893113,0.000011184061,0.9791566,0.003169621,0.015451301,0.0019431879,0.0000085888505],"about_ca_topic_score_codex":0.0031693005,"about_ca_topic_score_gemma":0.0033347968,"teacher_disagreement_score":0.0031693005,"about_ca_system_score_codex":0.000802641,"about_ca_system_score_gemma":0.0009121851,"threshold_uncertainty_score":0.0071525574},"labels":[],"label_agreement":null},{"id":"W2916335115","doi":"10.1137/1.9781611975673.40","title":"Edge Replacement Grammars : A Formal Language Approach for Generating Graphs","year":2019,"lang":"en","type":"preprint","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Neural Networks","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 Montréal","funders":"","keywords":"Computer science; Generative grammar; Rule-based machine translation; Theoretical computer science; Probabilistic logic; Grammar; Artificial intelligence; Graph; Natural language processing; Grammar induction","score_opus":0.05247469205831674,"score_gpt":0.26549739678904605,"score_spread":0.21302270473072932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916335115","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.0013075593,0.00008191066,0.9972127,0.00012600321,0.00001735929,0.000045760113,0.00020230263,0.0005577031,0.00044871462],"genre_scores_gemma":[0.08003201,0.00052994967,0.91306156,0.0003103954,0.00007841987,0.0005179346,0.0018099481,0.0006687478,0.0029910035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978358,0.00093947,0.0001253542,0.0005042254,0.0005080342,0.00008713675],"domain_scores_gemma":[0.99257225,0.005479972,0.00033885526,0.0009904393,0.00048155623,0.00013694112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002786168,0.00092456123,0.0008358382,0.0021812608,0.00070605596,0.001476388,0.0032105134,0.0016004667,0.003912128],"category_scores_gemma":[0.012409483,0.0009954172,0.002127039,0.0019753953,0.0021903329,0.0030023656,0.0016952778,0.0027163285,0.001497545],"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.000077835866,0.00012578537,0.0020175797,0.00035344192,0.000103576036,0.00045733617,0.0006905033,0.36010206,0.0043651187,0.43124416,0.009803678,0.19065896],"study_design_scores_gemma":[0.000022547018,0.000027718843,0.00015501327,0.000049338178,0.000018675672,0.00024869593,0.0000417287,0.65111136,0.0015212956,0.3372409,0.0095349485,0.00002783774],"about_ca_topic_score_codex":0.0033311965,"about_ca_topic_score_gemma":0.00599654,"teacher_disagreement_score":0.003912128,"about_ca_system_score_codex":0.0012434023,"about_ca_system_score_gemma":0.0021418924,"threshold_uncertainty_score":0.014734864},"labels":[],"label_agreement":null},{"id":"W2929664959","doi":"","title":"Cultural Differences and Latent Profiles from the InCLASS Observational Tool","year":2019,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Graph Neural Networks","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","funders":"","keywords":"Observational study; Computer science; Statistics; Mathematics","score_opus":0.034723691066284,"score_gpt":0.23922692782903954,"score_spread":0.20450323676275553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2929664959","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.9447951,0.00017534621,0.03191346,0.00056319113,0.000035034074,0.00008897366,0.006428733,0.00009364247,0.01590655],"genre_scores_gemma":[0.9913326,0.00006584504,0.0049877237,0.000026282478,0.0000063520547,0.000088661836,0.0026350906,0.000023793336,0.00083359104],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9975775,0.0015606392,0.00015956388,0.0002858893,0.00028880945,0.0001275703],"domain_scores_gemma":[0.9836516,0.0092327455,0.0023526275,0.0027630483,0.0014285214,0.00057160994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036414496,0.00026872254,0.00028043066,0.0013887923,0.00050581346,0.00176996,0.00042031272,0.00040640705,0.0067308974],"category_scores_gemma":[0.03334368,0.00017885615,0.00035879135,0.0022853166,0.0006636869,0.0017908802,0.0017532295,0.00076981,0.0009326276],"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.000810706,0.000248056,0.8071085,0.000111573056,0.0002141658,0.0001623527,0.010349378,0.0034682192,0.0010862245,0.043882716,0.0050649415,0.12749328],"study_design_scores_gemma":[0.000101856094,0.00029031426,0.81704104,0.00029191966,0.00020853049,0.00035410444,0.016848963,0.04952331,0.00197103,0.0927476,0.020493584,0.00012775448],"about_ca_topic_score_codex":0.009151847,"about_ca_topic_score_gemma":0.01409208,"teacher_disagreement_score":0.009151847,"about_ca_system_score_codex":0.0005771368,"about_ca_system_score_gemma":0.00066988944,"threshold_uncertainty_score":0.022517025},"labels":[],"label_agreement":null},{"id":"W2942315111","doi":"10.1613/jair.1.13225","title":"Graph Kernels: A Survey","year":2021,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":85,"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":"Computer science; Graph; Theoretical computer science; Data science","score_opus":0.2937579756576601,"score_gpt":0.4530306973098932,"score_spread":0.1592727216522331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942315111","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.04465134,0.3770944,0.52945924,0.00410561,0.001490799,0.00027914176,0.0027158195,0.003212214,0.0369914],"genre_scores_gemma":[0.3505426,0.44288376,0.175054,0.0016864998,0.0027932324,0.00028132543,0.008448797,0.0011861346,0.017123625],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989674,0.0001735386,0.00009860905,0.00021637842,0.00045780826,0.00008628389],"domain_scores_gemma":[0.99701023,0.001664363,0.00021284379,0.0003489508,0.00063234026,0.00013130972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010757609,0.0012708138,0.0013747187,0.004352909,0.00058485277,0.0025386855,0.0013743397,0.0012238526,0.0041213096],"category_scores_gemma":[0.0062115947,0.00047963174,0.0012666085,0.0061699594,0.0007984134,0.005312099,0.0012254671,0.001617221,0.002272471],"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.00015275776,0.00022072432,0.005071874,0.0026773198,0.00020180261,0.00024017184,0.00020905031,0.022855721,0.0027378649,0.0808486,0.04046718,0.84431696],"study_design_scores_gemma":[0.000045382785,0.00035937683,0.0103140455,0.0012484969,0.00029033335,0.0043210625,0.00045511185,0.25728038,0.006516989,0.28407714,0.4348915,0.00020017046],"about_ca_topic_score_codex":0.003256988,"about_ca_topic_score_gemma":0.002320815,"teacher_disagreement_score":0.004352909,"about_ca_system_score_codex":0.001074099,"about_ca_system_score_gemma":0.0009823631,"threshold_uncertainty_score":0.01378715},"labels":[],"label_agreement":null},{"id":"W2948598318","doi":"10.48550/arxiv.1906.02174","title":"Break the Ceiling: Stronger Multi-scale Deep Graph Convolutional Networks","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":24,"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":"Computer science; Theoretical computer science; Graph; Deep learning; Expressive power; Convolution (computer science); Artificial intelligence; Artificial neural network","score_opus":0.052558334547358046,"score_gpt":0.18686765448412118,"score_spread":0.13430931993676315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948598318","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.09194802,0.0012669738,0.890265,0.0015992332,0.00021033424,0.00004731151,0.00026394936,0.0018478541,0.012551406],"genre_scores_gemma":[0.8684805,0.0008811467,0.12242451,0.00096575473,0.00020385139,0.00007725868,0.0005238985,0.00045073294,0.0059924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907625,0.00024757147,0.00003849534,0.0002597775,0.00023321732,0.00014477174],"domain_scores_gemma":[0.99770015,0.0008613233,0.00023163705,0.00074145704,0.0002627404,0.00020263967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020409701,0.0010521946,0.0009469096,0.00065465353,0.00049546064,0.0013718467,0.0016772457,0.0012111116,0.0050944355],"category_scores_gemma":[0.006077666,0.00045235382,0.00083522435,0.00053713145,0.0016301738,0.005022968,0.0035922762,0.0033640345,0.00085797015],"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.00048363293,0.00023471555,0.002700309,0.0003762502,0.00017599546,0.00033731,0.00025393305,0.36430046,0.02592866,0.41671878,0.01031221,0.17817779],"study_design_scores_gemma":[0.00002051188,0.00006507947,0.00040292417,0.000022466831,0.000014956163,0.000037766502,0.000021955493,0.878571,0.0020438198,0.11706755,0.0017214521,0.000010596378],"about_ca_topic_score_codex":0.0026613239,"about_ca_topic_score_gemma":0.004996333,"teacher_disagreement_score":0.0050944355,"about_ca_system_score_codex":0.0011743081,"about_ca_system_score_gemma":0.00078255386,"threshold_uncertainty_score":0.017042577},"labels":[],"label_agreement":null},{"id":"W2949865801","doi":"","title":"LanczosNet: Multi-Scale Deep Graph Convolutional Networks","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; University of Toronto","funders":"","keywords":"Computer science; Graph; Theoretical computer science; Laplacian matrix; Deep learning; Adjacency matrix; Algorithm; Artificial intelligence","score_opus":0.051265114663079224,"score_gpt":0.18529132808432733,"score_spread":0.1340262134212481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949865801","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.026602818,0.00080914487,0.94547814,0.0007948822,0.00023600404,0.00012434273,0.0017804406,0.01867555,0.0054986626],"genre_scores_gemma":[0.39348683,0.0010359911,0.5751642,0.0009426287,0.00013065113,0.00033778278,0.008253102,0.001512776,0.019136118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977165,0.000040042014,0.000008978125,0.00006819097,0.000072690054,0.000038452137],"domain_scores_gemma":[0.9996544,0.0001034763,0.000038174992,0.00009298512,0.00007216022,0.000038721137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004390866,0.0011258771,0.00077244133,0.00091317645,0.0004582004,0.0010533786,0.002539311,0.0014368301,0.005645403],"category_scores_gemma":[0.0020763068,0.00052219996,0.0008170974,0.0013991871,0.0006744328,0.0022486653,0.0014982412,0.0018422394,0.0023062],"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.00026159393,0.00020238679,0.0013363473,0.00029895545,0.00018900252,0.00022143421,0.00009619897,0.5675681,0.010218383,0.04263167,0.05183054,0.32514545],"study_design_scores_gemma":[0.000013797808,0.000017098373,0.000084936335,0.000006009494,0.00000531822,0.000017301987,0.000005206312,0.9844919,0.0010955516,0.012009817,0.002246699,0.0000064427836],"about_ca_topic_score_codex":0.01173184,"about_ca_topic_score_gemma":0.032131754,"teacher_disagreement_score":0.01173184,"about_ca_system_score_codex":0.0013431369,"about_ca_system_score_gemma":0.0012881744,"threshold_uncertainty_score":0.023327112},"labels":[],"label_agreement":null},{"id":"W2950501737","doi":"10.48550/arxiv.1905.13132","title":"Content based News Recommendation via Shortest Entity Distance over Knowledge Graphs","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","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":"York University","funders":"","keywords":"Computer science; Information retrieval; Graph traversal; Cold start (automotive); Tree traversal; Weighting; Relevance (law); Recommender system; Similarity (geometry); Graph; Set (abstract data type); Data mining; Artificial intelligence; Algorithm; Theoretical computer science","score_opus":0.09263336830495084,"score_gpt":0.20885560795810298,"score_spread":0.11622223965315215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950501737","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.08516222,0.0011746548,0.9032701,0.0003170044,0.000049643924,0.00024543682,0.0032745237,0.0037359549,0.0027704532],"genre_scores_gemma":[0.4237583,0.0006144651,0.5539968,0.00016118572,0.000072438044,0.00023203185,0.013919297,0.00037069301,0.006874772],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988599,0.00023619107,0.00006992156,0.0004240179,0.000324232,0.00008579838],"domain_scores_gemma":[0.99687386,0.0013410083,0.0004040944,0.0006106929,0.0006240773,0.00014623873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007034537,0.0010001942,0.0012533313,0.004872885,0.001001721,0.0014402864,0.0020071522,0.0014436961,0.0017705804],"category_scores_gemma":[0.005368666,0.0007292889,0.0011142025,0.0050902152,0.00046280006,0.0029831042,0.0010001633,0.0011865518,0.0012970583],"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.00081699307,0.00070492906,0.0137326885,0.00066945556,0.00062114204,0.00040585545,0.0006930203,0.32387087,0.015609603,0.027215416,0.029028859,0.5866312],"study_design_scores_gemma":[0.000056807512,0.00010027518,0.0018052357,0.00003032,0.00008897107,0.00012322572,0.00011046662,0.9624492,0.0049980744,0.025609018,0.004594665,0.000033694047],"about_ca_topic_score_codex":0.024812682,"about_ca_topic_score_gemma":0.05408785,"teacher_disagreement_score":0.024812682,"about_ca_system_score_codex":0.0015149825,"about_ca_system_score_gemma":0.0012250346,"threshold_uncertainty_score":0.049336493},"labels":[],"label_agreement":null},{"id":"W2950887295","doi":"","title":"GMNN: Graph Markov Neural Networks","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":28,"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":"Statistical relational learning; Computer science; Artificial intelligence; Conditional random field; Graph; Markov random field; Artificial neural network; Convolutional neural network; Pattern recognition (psychology); Object (grammar); Theoretical computer science; Machine learning; Relational database; Data mining","score_opus":0.0398459198662946,"score_gpt":0.17811349811419547,"score_spread":0.13826757824790087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950887295","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.01570278,0.0021001403,0.97201204,0.0011265699,0.00023016002,0.000064382715,0.0010775873,0.0030213872,0.004664823],"genre_scores_gemma":[0.6223208,0.0028434289,0.35622987,0.0010899545,0.00030891466,0.0003607169,0.004447377,0.00054526475,0.011853781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996074,0.00011604773,0.000014215163,0.0001346981,0.00008965396,0.000038098242],"domain_scores_gemma":[0.99890053,0.00064548186,0.00012432107,0.00013366279,0.00014930457,0.000046612447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065294537,0.00079823314,0.00076169334,0.0008514374,0.0004036412,0.00077882747,0.0017516187,0.0013066747,0.003398535],"category_scores_gemma":[0.0041266717,0.0004695833,0.000638683,0.0012475501,0.00088051654,0.0017300607,0.0011040443,0.0017097596,0.001115519],"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.000107538996,0.00005781653,0.0011388715,0.00018462197,0.00008389567,0.00010476173,0.00006171848,0.7603655,0.0016028034,0.066650175,0.012579036,0.15706328],"study_design_scores_gemma":[0.000003687091,0.0000063287566,0.000098104894,0.000007494063,0.0000038972566,0.000014086562,0.0000027901676,0.97011626,0.00019072255,0.028398655,0.0011540701,0.000003960956],"about_ca_topic_score_codex":0.01084119,"about_ca_topic_score_gemma":0.012816332,"teacher_disagreement_score":0.01084119,"about_ca_system_score_codex":0.0011454418,"about_ca_system_score_gemma":0.0009328444,"threshold_uncertainty_score":0.021556199},"labels":[],"label_agreement":null},{"id":"W2950907416","doi":"10.48550/arxiv.1812.02356","title":"dynnode2vec: Scalable Dynamic Network Embedding","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","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":"York University","funders":"","keywords":"Embedding; Computer science; Graph embedding; Scalability; Random walk; Theoretical computer science; Timestamp; Dynamic network analysis; Graph; Representation (politics); Vector space; Artificial intelligence; Mathematics","score_opus":0.038995503682803585,"score_gpt":0.2011969557260333,"score_spread":0.16220145204322972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950907416","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.04145361,0.0018142672,0.88405883,0.0010318757,0.0006521746,0.0002976241,0.016786199,0.048565395,0.00533998],"genre_scores_gemma":[0.34298733,0.0016487134,0.5593029,0.00068608957,0.00025916588,0.00079455937,0.07972762,0.0032781186,0.011315444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993943,0.00013517779,0.000033567194,0.0002005468,0.00017936487,0.00005691884],"domain_scores_gemma":[0.99926203,0.00020226612,0.00006137638,0.00021648724,0.00021253845,0.00004536482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046707355,0.002208516,0.0010758163,0.0013542707,0.00047487213,0.001204159,0.0018630986,0.00087458186,0.0039309333],"category_scores_gemma":[0.0027585903,0.00068247,0.0008885975,0.0020187688,0.00043958746,0.00278543,0.0014547145,0.0017338102,0.0025865235],"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.0002488,0.00029109066,0.0035941864,0.00056412345,0.00040478352,0.00031380908,0.00018296922,0.31621006,0.008860209,0.018236984,0.19229515,0.4587978],"study_design_scores_gemma":[0.00002016649,0.0000370289,0.00036204557,0.000010201912,0.000011269831,0.00006764639,0.000027573127,0.9811577,0.0024680663,0.008284504,0.007534747,0.000019070081],"about_ca_topic_score_codex":0.012925357,"about_ca_topic_score_gemma":0.027532358,"teacher_disagreement_score":0.012925357,"about_ca_system_score_codex":0.00083809724,"about_ca_system_score_gemma":0.001081623,"threshold_uncertainty_score":0.025700271},"labels":[],"label_agreement":null},{"id":"W2951774898","doi":"10.48550/arxiv.1504.01684","title":"Large Margin Nearest Neighbor Embedding for Knowledge Representation","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","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":"National Natural Science Foundation of China; National Key Research and Development Program of China; York University; National Science Foundation","keywords":"Embedding; Margin (machine learning); Benchmark (surveying); Computer science; k-nearest neighbors algorithm; Relation (database); Representation (politics); Simple (philosophy); False positive paradox; Artificial intelligence; Theoretical computer science; Algorithm; Machine learning; Data mining","score_opus":0.12440315866916889,"score_gpt":0.261012721967495,"score_spread":0.13660956329832608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951774898","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.012438966,0.001674772,0.98022467,0.0004506159,0.00010461637,0.000055369637,0.00040566106,0.0019977891,0.0026475326],"genre_scores_gemma":[0.58162844,0.0017037148,0.39949334,0.0005682527,0.00024013448,0.00030421396,0.0048190067,0.00046707902,0.010775817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862957,0.0004095579,0.000087114124,0.0004107317,0.0003714479,0.00009159744],"domain_scores_gemma":[0.9986286,0.0005382125,0.00014158925,0.00035559328,0.00028305117,0.00005299954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010015415,0.0014586152,0.0016303617,0.0014426145,0.000522024,0.0013882648,0.002106536,0.0017533287,0.0037794022],"category_scores_gemma":[0.0044011488,0.0004888258,0.00092922826,0.0024325612,0.0009006118,0.0037160795,0.0018100275,0.0023821567,0.0020764195],"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.0002024292,0.00021265584,0.0007369948,0.00034405905,0.00011517998,0.00013197731,0.00016065828,0.4883195,0.0028229393,0.04115943,0.017148575,0.4486456],"study_design_scores_gemma":[0.0000058133014,0.000018955381,0.00007834572,0.0000117306445,0.000008186515,0.000020730862,0.000016331773,0.97554094,0.0007155614,0.022322925,0.0012509455,0.000009562556],"about_ca_topic_score_codex":0.0055512697,"about_ca_topic_score_gemma":0.0057787425,"teacher_disagreement_score":0.0055512697,"about_ca_system_score_codex":0.0012469979,"about_ca_system_score_gemma":0.00095314754,"threshold_uncertainty_score":0.012643397},"labels":[],"label_agreement":null},{"id":"W2962850650","doi":"","title":"SimplE embedding for link prediction in knowledge graphs","year":2018,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":178,"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":"Simple (philosophy); Embedding; Computer science; Theoretical computer science; Factorization; Link (geometry); Graph embedding; Tying; Artificial intelligence; Algorithm","score_opus":0.02168659529710737,"score_gpt":0.30032031980681734,"score_spread":0.27863372450970997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962850650","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.018803487,0.00039404928,0.97269416,0.00054615166,0.00007842755,0.00010328267,0.0017815887,0.0032538224,0.002345041],"genre_scores_gemma":[0.42841962,0.0009389913,0.55338216,0.00046277232,0.0001886205,0.0003939879,0.008075178,0.0007471135,0.007391531],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982576,0.0004080901,0.0001385211,0.0005731507,0.0004643229,0.00015826608],"domain_scores_gemma":[0.9930328,0.0032450594,0.00061263243,0.0021410962,0.0007447319,0.00022368776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016190475,0.0016534502,0.0011113283,0.0017140026,0.0007784635,0.001907713,0.0021448357,0.0015935996,0.0105791995],"category_scores_gemma":[0.016766503,0.0009463351,0.0015394079,0.0026078408,0.0015161061,0.009229476,0.002751979,0.003067751,0.0028261193],"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.00035377586,0.00024988223,0.002743556,0.0006559499,0.00013990112,0.00030411204,0.0003850941,0.4516407,0.005090694,0.1507879,0.02419419,0.36345434],"study_design_scores_gemma":[0.000014678765,0.000023628156,0.00018547908,0.000030700558,0.000018614954,0.000046896766,0.000031303174,0.8100525,0.001010095,0.1860184,0.0025529899,0.00001471215],"about_ca_topic_score_codex":0.005079478,"about_ca_topic_score_gemma":0.0095164925,"teacher_disagreement_score":0.0105791995,"about_ca_system_score_codex":0.0017237664,"about_ca_system_score_gemma":0.0012975018,"threshold_uncertainty_score":0.035390973},"labels":[],"label_agreement":null},{"id":"W2963384510","doi":"10.1109/msp.2018.2887284","title":"Learning Graphs From Data: A Signal Representation Perspective","year":2019,"lang":"en","type":"article","venue":"IEEE Signal Processing Magazine","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":408,"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":"Computer science; Theoretical computer science; Inference; Viewpoints; Graph; Visualization; Topological graph theory; Data visualization; Signal processing; Perspective (graphical); Graph theory; Representation (politics); Artificial intelligence; Machine learning; Voltage graph; Mathematics; Digital signal processing; Line graph","score_opus":0.028404084733004303,"score_gpt":0.2936060278097968,"score_spread":0.26520194307679246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963384510","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.0017071894,0.0012259795,0.99315923,0.0021433278,0.000105354164,0.00002183827,0.00018483866,0.00019304942,0.0012591896],"genre_scores_gemma":[0.20390387,0.013223685,0.77379465,0.0019591474,0.002150667,0.00023921762,0.0015260926,0.0004136453,0.0027890508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980276,0.00093909336,0.00009093419,0.0003810311,0.00047955275,0.0000817084],"domain_scores_gemma":[0.9923431,0.0055109905,0.0004387769,0.0009523917,0.00056178996,0.0001928812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031346541,0.0010893947,0.001259819,0.0035949652,0.00053851865,0.0036704384,0.0024262376,0.0021935303,0.002356116],"category_scores_gemma":[0.013424453,0.0006198348,0.001024684,0.0036759723,0.0031717704,0.0070921257,0.0020166968,0.0041617006,0.00096115284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005417775,0.000045893186,0.000758799,0.00046142723,0.000098433775,0.00020592415,0.00029595327,0.09574911,0.0031419885,0.7545669,0.0071592364,0.13746223],"study_design_scores_gemma":[0.000008454993,0.00003027067,0.0002847839,0.00006419629,0.000021383208,0.00012209824,0.00007429401,0.2373813,0.00079378433,0.7511438,0.010052856,0.000022750002],"about_ca_topic_score_codex":0.0015785679,"about_ca_topic_score_gemma":0.0013022721,"teacher_disagreement_score":0.0036704384,"about_ca_system_score_codex":0.0011795942,"about_ca_system_score_gemma":0.0009966091,"threshold_uncertainty_score":0.01657784},"labels":[],"label_agreement":null},{"id":"W2963482403","doi":"","title":"Learning Graph Weighted Models on Pictures.","year":2018,"lang":"en","type":"article","venue":"International Colloquium on Grammatical Inference","topic":"Advanced Graph Neural Networks","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":"Generalization; Computer science; Graph; Theoretical computer science; Automaton; Artificial intelligence; Mathematics; Discrete mathematics; Combinatorics; Algorithm","score_opus":0.0283849953839748,"score_gpt":0.3009206295663356,"score_spread":0.27253563418236076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963482403","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.055165045,0.00065862975,0.9399382,0.00086624105,0.00009668115,0.000050872277,0.00039140898,0.0005747137,0.0022582242],"genre_scores_gemma":[0.75555253,0.00082104706,0.23106396,0.00054596906,0.00014637591,0.00025418217,0.0015578002,0.000314661,0.009743498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995222,0.00023119131,0.000016453414,0.00014886714,0.000049771697,0.000031462994],"domain_scores_gemma":[0.998104,0.0011674475,0.0002443912,0.00024308839,0.00015100626,0.000090136426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010430585,0.0009647117,0.00075616146,0.0013188971,0.00036278006,0.00093551906,0.0016129621,0.0016937,0.0031579742],"category_scores_gemma":[0.0070405127,0.0006507666,0.0012163498,0.0011581607,0.0010793596,0.0038572485,0.000994268,0.0020934977,0.00067150086],"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.00013886052,0.00008309979,0.0032157542,0.00021331443,0.00016750845,0.00015699388,0.00025953085,0.6700406,0.0032282588,0.21068284,0.0051737255,0.106639504],"study_design_scores_gemma":[0.000005582355,0.000018548106,0.00016832085,0.000011529441,0.0000083435825,0.000016866883,0.00001398471,0.89177763,0.00025929802,0.1070353,0.00067888707,0.000005687822],"about_ca_topic_score_codex":0.0031281225,"about_ca_topic_score_gemma":0.0075213728,"teacher_disagreement_score":0.0031579742,"about_ca_system_score_codex":0.0010285259,"about_ca_system_score_gemma":0.00037929145,"threshold_uncertainty_score":0.010564446},"labels":[],"label_agreement":null},{"id":"W2963702033","doi":"10.1109/tsipn.2017.2742940","title":"Characterization and Inference of Graph Diffusion Processes From Observations of Stationary Signals","year":2018,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":149,"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","keywords":"Laplacian matrix; Null graph; Voltage graph; Graph; Computer science; Strength of a graph; Eigenvalues and eigenvectors; Theoretical computer science; Mathematics; Algorithm; Line graph","score_opus":0.019799815997244816,"score_gpt":0.2345992929744548,"score_spread":0.21479947697721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963702033","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.084183484,0.00041164228,0.9134815,0.0006305624,0.00003521952,0.000031354357,0.00033012682,0.00034551742,0.0005505664],"genre_scores_gemma":[0.91039765,0.0010567763,0.08331915,0.00014740207,0.00027789673,0.00008366539,0.0016511444,0.00016833747,0.0028979233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913603,0.00028196935,0.000049941427,0.00032927917,0.000121562756,0.00008122846],"domain_scores_gemma":[0.9764614,0.02024039,0.0013225318,0.0008739567,0.0006623259,0.00043931033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029331842,0.0009481356,0.0012290176,0.002402502,0.0004419945,0.0018689077,0.001945228,0.002575586,0.0015103214],"category_scores_gemma":[0.02824059,0.0010484557,0.0012926783,0.001317934,0.001606739,0.002837624,0.0012888034,0.0029657574,0.00038637122],"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.0003301885,0.00014900664,0.008336233,0.00032130076,0.00019215645,0.000260038,0.00033528477,0.82092786,0.00944536,0.09084494,0.0018063425,0.06705123],"study_design_scores_gemma":[0.0000068515105,0.000010663637,0.0006005941,0.000008047286,0.000008087508,0.000019146832,0.0000080557165,0.9766035,0.00046808942,0.022124385,0.00013611563,0.0000064499295],"about_ca_topic_score_codex":0.0047190366,"about_ca_topic_score_gemma":0.0043220418,"teacher_disagreement_score":0.0047190366,"about_ca_system_score_codex":0.0011444428,"about_ca_system_score_gemma":0.0009720687,"threshold_uncertainty_score":0.015512347},"labels":[],"label_agreement":null},{"id":"W2963782635","doi":"10.17863/cam.40744","title":"Deep Graph Infomax","year":2018,"lang":"en","type":"article","venue":"Apollo (University of Cambridge)","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":332,"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":"European Commission","keywords":"Infomax; Computer science; Graph; Artificial intelligence; Unsupervised learning; Node (physics); Machine learning; Competitive learning; Feature learning; Theoretical computer science","score_opus":0.007093247053127333,"score_gpt":0.19009235821387466,"score_spread":0.18299911116074732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963782635","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.021667467,0.0014168558,0.9443838,0.0013631682,0.00026261937,0.00011508739,0.0043739523,0.01492799,0.011489076],"genre_scores_gemma":[0.52213126,0.0013577807,0.43129936,0.001641549,0.0002798479,0.00035134904,0.019545766,0.0016234894,0.021769663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995172,0.0000839478,0.000016585602,0.00019374628,0.000121499244,0.00006699518],"domain_scores_gemma":[0.9992899,0.00027913688,0.00007124751,0.00019790747,0.00010537927,0.000056432793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007064763,0.0016573233,0.0011806492,0.0011141304,0.0004822497,0.0014218586,0.003027491,0.001676335,0.008604811],"category_scores_gemma":[0.0029769808,0.0005071691,0.0011670147,0.0014277445,0.0008099319,0.0032800355,0.0018245704,0.0024998316,0.0034862044],"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.0003379139,0.00027543888,0.0018151926,0.0003982007,0.00025028488,0.00015578885,0.000099313685,0.42059657,0.009864644,0.061962396,0.057344127,0.44690016],"study_design_scores_gemma":[0.000012982417,0.000038273043,0.00024273751,0.000018050394,0.000024428029,0.000033980163,0.000010150405,0.943495,0.0041793087,0.04655071,0.0053811083,0.000013374559],"about_ca_topic_score_codex":0.0046537584,"about_ca_topic_score_gemma":0.010055876,"teacher_disagreement_score":0.008604811,"about_ca_system_score_codex":0.0014555446,"about_ca_system_score_gemma":0.0011915257,"threshold_uncertainty_score":0.028786004},"labels":[],"label_agreement":null},{"id":"W2963885834","doi":"10.1609/aaai.v32i1.11299","title":"TIMERS: Error-Bounded SVD Restart on Dynamic Networks","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":93,"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; National Natural Science Foundation of China; Tencent","keywords":"Singular value decomposition; Computer science; Margin (machine learning); Reset (finance); Algorithm; Bounded function; Dynamic network analysis; Singular value; Upper and lower bounds; Process (computing); Mathematical optimization; Mathematics; Machine learning","score_opus":0.06146482267875695,"score_gpt":0.31123523603661013,"score_spread":0.2497704133578532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963885834","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.016979016,0.00038917278,0.97787535,0.00013669135,0.00009625603,0.00008121573,0.0000898683,0.003456313,0.0008961741],"genre_scores_gemma":[0.47021547,0.00047176683,0.52337426,0.00028766316,0.00014027553,0.00025644602,0.0008805632,0.0007790729,0.0035943617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981736,0.00034161189,0.00015215829,0.00043082473,0.00072915363,0.00017257847],"domain_scores_gemma":[0.99546283,0.0018967391,0.0005147804,0.00092833565,0.0009661213,0.0002311996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019599453,0.001812462,0.0015991932,0.0012303015,0.0008616315,0.0015414908,0.0023728802,0.0011318572,0.0018500207],"category_scores_gemma":[0.011642323,0.00067442027,0.0010542705,0.00083685666,0.0012293977,0.0025298211,0.0020251377,0.0021605613,0.0008125807],"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.0007244874,0.00017570147,0.0029726564,0.00022799127,0.00012648907,0.00034698335,0.00030488675,0.52903837,0.0219413,0.011452779,0.0072575286,0.42543086],"study_design_scores_gemma":[0.000012767142,0.000039368606,0.00013424462,0.0000092101955,0.000010132422,0.00004681732,0.000022144737,0.9927585,0.0041001732,0.0021897736,0.0006671102,0.000009698439],"about_ca_topic_score_codex":0.006376291,"about_ca_topic_score_gemma":0.0072953636,"teacher_disagreement_score":0.006376291,"about_ca_system_score_codex":0.00091080077,"about_ca_system_score_gemma":0.0015187793,"threshold_uncertainty_score":0.012678385},"labels":[],"label_agreement":null},{"id":"W2964105372","doi":"10.1109/tsp.2017.2752689","title":"On the Shift Operator, Graph Frequency, and Optimal Filtering in Graph Signal Processing","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":163,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Graph energy; Adjacency matrix; Laplacian matrix; Spectral graph theory; Mathematics; Voltage graph; Line graph; Algorithm; Graph; Discrete mathematics; Computer science","score_opus":0.025219486412952064,"score_gpt":0.2665720012858287,"score_spread":0.24135251487287662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964105372","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.0064094495,0.0007471588,0.9893245,0.0002600382,0.000069405476,0.000011971526,0.000026141886,0.000055915112,0.0030953367],"genre_scores_gemma":[0.41546932,0.006573051,0.56791383,0.00062294747,0.0008013203,0.00020805649,0.00023886062,0.00025485025,0.007917789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951434,0.00016237042,0.000022989678,0.00012072906,0.00013987836,0.000039724117],"domain_scores_gemma":[0.99913293,0.0005452154,0.00008559289,0.00008795144,0.00011626565,0.000032069707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007797497,0.0007819728,0.00045220225,0.0009298712,0.00039775023,0.0010769685,0.00048326855,0.0009724786,0.0021317797],"category_scores_gemma":[0.002478829,0.00024178774,0.00062742183,0.0012100477,0.0021730245,0.0019569527,0.0009053624,0.0012473345,0.000585143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004852758,0.000034386074,0.00025316878,0.00012510552,0.00002258865,0.00012618442,0.00017816607,0.12327377,0.012273111,0.79199207,0.0018588273,0.06981415],"study_design_scores_gemma":[0.000007752136,0.00007761971,0.00027480235,0.000031973734,0.000015766514,0.00013395352,0.00005000296,0.52483284,0.0033308247,0.46524003,0.005967724,0.000036640136],"about_ca_topic_score_codex":0.0015024337,"about_ca_topic_score_gemma":0.0010350775,"teacher_disagreement_score":0.0021317797,"about_ca_system_score_codex":0.00057266996,"about_ca_system_score_gemma":0.00053364836,"threshold_uncertainty_score":0.0071315765},"labels":[],"label_agreement":null},{"id":"W2964151357","doi":"","title":"Graph Partition Neural Networks for Semi-Supervised Classification","year":2018,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","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":"Canadian Institute for Advanced Research; University of Toronto","funders":"","keywords":"Computer science; Graph partition; Artificial neural network; Partition (number theory); Graph; Artificial intelligence; Pattern recognition (psychology); Theoretical computer science; Machine learning; Mathematics; Combinatorics","score_opus":0.07654905036643554,"score_gpt":0.20110522936097025,"score_spread":0.12455617899453471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964151357","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.031648688,0.0006594001,0.9633646,0.00031635375,0.00007398046,0.00008252408,0.00025111038,0.0019050675,0.0016982199],"genre_scores_gemma":[0.6045312,0.00047986608,0.38841015,0.00035207538,0.00013700947,0.00028872845,0.0016390107,0.00031301033,0.0038490521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993666,0.00024119495,0.000024832156,0.00017053982,0.00015034292,0.000046514582],"domain_scores_gemma":[0.9981888,0.00091887265,0.00019868625,0.00031245037,0.00031492434,0.000066237924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093788095,0.0010415998,0.0008076756,0.0011879972,0.00050448184,0.00080775906,0.0017094674,0.0012663497,0.002064347],"category_scores_gemma":[0.0044705737,0.00043927223,0.00063977594,0.0013010193,0.00091011636,0.002166839,0.0011131088,0.0017331567,0.00081276265],"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.00023155019,0.00015772472,0.0015436568,0.00019834495,0.00012711303,0.00009077793,0.00016330199,0.63038445,0.0054698065,0.021431278,0.007434415,0.33276758],"study_design_scores_gemma":[0.000004053364,0.000015020945,0.00013260257,0.000005717217,0.0000053915514,0.000011672392,0.000009281712,0.985572,0.0007371061,0.013073626,0.0004294183,0.000004144172],"about_ca_topic_score_codex":0.0034432183,"about_ca_topic_score_gemma":0.0063574407,"teacher_disagreement_score":0.0034432183,"about_ca_system_score_codex":0.0009782886,"about_ca_system_score_gemma":0.00069763005,"threshold_uncertainty_score":0.007098019},"labels":[],"label_agreement":null},{"id":"W2964626625","doi":"10.24963/ijcai.2019/725","title":"Unsupervised Embedding Enhancements of Knowledge Graphs using Textual Associations","year":2019,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"University of Toronto","funders":"","keywords":"Computer science; Embedding; Knowledge graph; Graph; Artificial intelligence; Scope (computer science); Task (project management); Natural language processing; Graph embedding; Information retrieval; Theoretical computer science","score_opus":0.026127218445207878,"score_gpt":0.3061260201468075,"score_spread":0.27999880170159963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964626625","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.084021255,0.000441053,0.9107667,0.0002788208,0.00006666513,0.00008148392,0.0004949516,0.0014421116,0.0024069105],"genre_scores_gemma":[0.643048,0.00060401385,0.34655857,0.00015686137,0.00010804504,0.00015117673,0.0034420958,0.00034394686,0.0055873254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994703,0.0001722518,0.0000346741,0.00019340304,0.000095060095,0.000034358556],"domain_scores_gemma":[0.9977089,0.0011466469,0.00030031806,0.00047237021,0.00030025994,0.000071446244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067668426,0.001043902,0.00050392677,0.0014646518,0.00027420095,0.0008413358,0.00091085944,0.000808387,0.0014976613],"category_scores_gemma":[0.0051311115,0.00036010085,0.00073648256,0.0014808951,0.0005005622,0.0037971134,0.0013252735,0.0011738641,0.0006785645],"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.000281305,0.00045726288,0.0045945044,0.0003348359,0.0001987831,0.00020572433,0.0003744088,0.37231135,0.020436637,0.022816285,0.0068114917,0.57117736],"study_design_scores_gemma":[0.0000113109345,0.00006128972,0.0006412116,0.000017600505,0.000031806267,0.00006510235,0.00005635971,0.9781526,0.004443072,0.014539584,0.0019672543,0.000012839478],"about_ca_topic_score_codex":0.001723719,"about_ca_topic_score_gemma":0.0051443554,"teacher_disagreement_score":0.001723719,"about_ca_system_score_codex":0.00043460066,"about_ca_system_score_gemma":0.00041375135,"threshold_uncertainty_score":0.0050101876},"labels":[],"label_agreement":null},{"id":"W2964767742","doi":"10.1145/3292500.3330848","title":"AutoNE","year":2019,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":34,"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":"Hyperparameter; Computer science; Machine learning; Artificial intelligence; Node (physics)","score_opus":0.00355252685016396,"score_gpt":0.19966897883946264,"score_spread":0.19611645198929867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964767742","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.0115834335,0.0009392026,0.9488552,0.0003523735,0.00033953437,0.00017122772,0.0011387432,0.011714718,0.024905602],"genre_scores_gemma":[0.26700142,0.0011233209,0.6763016,0.0007796809,0.00019462209,0.0005815243,0.007153833,0.0028330043,0.04403093],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950993,0.000108853725,0.00001910671,0.0001785401,0.00013925393,0.000044360884],"domain_scores_gemma":[0.9992342,0.00025197832,0.00005158845,0.0002785026,0.00014396134,0.000039789866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006733218,0.0009258413,0.0007243793,0.00086343754,0.0005730046,0.001239607,0.0018135485,0.0010151858,0.021865934],"category_scores_gemma":[0.0025838716,0.0004286381,0.0006779462,0.00057962444,0.0005445752,0.0021318193,0.0016820023,0.001427865,0.005688315],"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.0002151883,0.00021321588,0.0015584362,0.00042267464,0.0001464587,0.00018930457,0.00011200437,0.27996394,0.006587434,0.09745034,0.052322995,0.560818],"study_design_scores_gemma":[0.000042707048,0.00008989908,0.00032199133,0.000040032723,0.000022492737,0.00016709375,0.000038788763,0.8906332,0.0057484047,0.0541862,0.04868405,0.000025209729],"about_ca_topic_score_codex":0.0023300603,"about_ca_topic_score_gemma":0.006140271,"teacher_disagreement_score":0.021865934,"about_ca_system_score_codex":0.0006115256,"about_ca_system_score_gemma":0.0008238845,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2966459188","doi":"10.24963/ijcai.2019/268","title":"TransMS: Knowledge Graph Embedding for Complex Relations by Multidirectional Semantics","year":2019,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"National Key Research and Development Program of China; Science and Technology Commission of Shanghai Municipality","keywords":"Embedding; Computer science; Knowledge graph; Scalability; Theoretical computer science; Graph; Semantics (computer science); Natural language processing; Artificial intelligence; Programming language; Database","score_opus":0.019427653600077865,"score_gpt":0.29096747698190323,"score_spread":0.27153982338182536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966459188","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.01709917,0.0010655347,0.9629184,0.0005280137,0.00014374804,0.00017502002,0.005415834,0.009239952,0.0034144016],"genre_scores_gemma":[0.30680528,0.0015465342,0.64821327,0.00043041527,0.00013324503,0.0004174183,0.031342585,0.0010106126,0.010100748],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992372,0.00015401043,0.00005271432,0.00028447103,0.0002261737,0.000045417844],"domain_scores_gemma":[0.99899465,0.00031825187,0.000103843726,0.0003862986,0.00014917801,0.000047779842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055656105,0.0016497714,0.00072652596,0.0030186293,0.0005690845,0.0011401267,0.0014314647,0.001039066,0.0052140825],"category_scores_gemma":[0.0031999515,0.00041403438,0.0014749357,0.0030189853,0.0006630654,0.003967735,0.0023158719,0.001727365,0.002343682],"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.00023674288,0.00020694463,0.0022573615,0.0007005545,0.00027538426,0.00030545492,0.00042508554,0.07096356,0.007965286,0.037739754,0.060717635,0.8182062],"study_design_scores_gemma":[0.000046509405,0.000099685756,0.0011219906,0.00008616097,0.00009258793,0.00027894467,0.00022276746,0.86071974,0.0056848493,0.09958767,0.03202045,0.000038758244],"about_ca_topic_score_codex":0.007958892,"about_ca_topic_score_gemma":0.016644508,"teacher_disagreement_score":0.007958892,"about_ca_system_score_codex":0.000780466,"about_ca_system_score_gemma":0.001107436,"threshold_uncertainty_score":0.017442882},"labels":[],"label_agreement":null},{"id":"W2967432812","doi":"10.1016/j.eswa.2019.112861","title":"A feature extraction model based on discriminative graph signals","year":2019,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":16,"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","funders":"Science and Technology Innovative Research Team in Higher Educational Institutions of Hunan Province; National Natural Science Foundation of China","keywords":"Discriminative model; Computer science; Pattern recognition (psychology); Artificial intelligence; Feature extraction; Classifier (UML); Graph; Machine learning; Data mining; Theoretical computer science","score_opus":0.013403235668727774,"score_gpt":0.27313873927255,"score_spread":0.25973550360382225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967432812","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.010722137,0.00020270141,0.9871525,0.00017578603,0.000060457347,0.000034320525,0.0002000163,0.00067972887,0.0007723072],"genre_scores_gemma":[0.5511576,0.0009784148,0.4352295,0.00038738985,0.00020048053,0.00023677638,0.0018786496,0.0002690995,0.009662006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998078,0.000027081122,0.000009181293,0.000078246296,0.0000531831,0.000024615349],"domain_scores_gemma":[0.9997565,0.000079686775,0.000031136555,0.00003775998,0.000076610566,0.000018296172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025379608,0.00061818643,0.00070305157,0.0009087849,0.00020947785,0.00062787527,0.00095637096,0.0008831317,0.0018232665],"category_scores_gemma":[0.0009969405,0.00029567396,0.0006796379,0.0012110313,0.00029014202,0.0011974359,0.0004632028,0.00087157614,0.0013176436],"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.00042640578,0.0002522916,0.0019401185,0.0002268781,0.0001312316,0.0002532744,0.000060603066,0.20292054,0.066856034,0.024527917,0.009548874,0.6928558],"study_design_scores_gemma":[0.000009306004,0.000047725982,0.0005702312,0.000006223528,0.000023179999,0.00006052071,0.0000045795246,0.9903514,0.0030814593,0.0047145495,0.001120537,0.000010359819],"about_ca_topic_score_codex":0.002709897,"about_ca_topic_score_gemma":0.003461895,"teacher_disagreement_score":0.002709897,"about_ca_system_score_codex":0.00033911312,"about_ca_system_score_gemma":0.0004829135,"threshold_uncertainty_score":0.0060994625},"labels":[],"label_agreement":null},{"id":"W2971074627","doi":"","title":"Graph Normalizing Flows","year":2019,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":42,"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; Memory footprint; Graph; Theoretical computer science; Autoencoder; Artificial neural network; Algorithm; Artificial intelligence","score_opus":0.03374732179138064,"score_gpt":0.15972172278058633,"score_spread":0.1259744009892057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971074627","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.0062482143,0.00016622954,0.9855401,0.00025865424,0.000107301,0.00008068358,0.0005213341,0.0018845763,0.005192982],"genre_scores_gemma":[0.3086632,0.0010257366,0.661145,0.000605981,0.00025528108,0.00047032122,0.0031120284,0.0015645217,0.023158005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995485,0.000098230965,0.000018783465,0.00016222382,0.00012647723,0.00004575078],"domain_scores_gemma":[0.9989184,0.0004167917,0.00011256682,0.00029267723,0.00020140674,0.000058250156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006652187,0.0009675679,0.0005897296,0.0012151258,0.0005380571,0.0011191036,0.0020944003,0.0010298652,0.0074226474],"category_scores_gemma":[0.004057017,0.00044356973,0.0009298442,0.0010812392,0.001092075,0.0029577257,0.0010764175,0.0017457919,0.0018368765],"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.000092075934,0.00008254972,0.0008760474,0.00015264054,0.000047698944,0.00016031916,0.000115172326,0.47408843,0.006619921,0.32147333,0.011224443,0.18506734],"study_design_scores_gemma":[0.000008191427,0.000019301926,0.000087743974,0.0000144224605,0.000011967021,0.000048400896,0.000007314944,0.8685583,0.0028803593,0.1203333,0.008018155,0.00001247214],"about_ca_topic_score_codex":0.0057235295,"about_ca_topic_score_gemma":0.0070632375,"teacher_disagreement_score":0.0074226474,"about_ca_system_score_codex":0.0010056573,"about_ca_system_score_gemma":0.0016588531,"threshold_uncertainty_score":0.024831235},"labels":[],"label_agreement":null},{"id":"W2972371482","doi":"10.1117/12.2530046","title":"Estimation of time-series on graphs using Bayesian graph convolutional neural networks","year":2019,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Computer science; Convolutional neural network; Series (stratigraphy); Artificial intelligence; Time series; Bayesian probability; Graph; Bayesian network; Pattern recognition (psychology); Machine learning; Data mining; Theoretical computer science","score_opus":0.00927668407840442,"score_gpt":0.23229024524895425,"score_spread":0.22301356117054982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972371482","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.05409432,0.00047701428,0.9428763,0.00044002468,0.000084605315,0.000026527508,0.00046904956,0.0007428031,0.00078941154],"genre_scores_gemma":[0.8860243,0.0009184603,0.10671863,0.00014951907,0.0001561628,0.000079841135,0.0018060607,0.00021171183,0.00393515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953496,0.00014586467,0.000020620135,0.00016626003,0.00007561055,0.000056669393],"domain_scores_gemma":[0.9959532,0.0029320617,0.0004145959,0.0002607204,0.00029236195,0.00014712101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011964889,0.0008296264,0.0009539388,0.001639663,0.00031892344,0.0011561061,0.0014056768,0.0016427477,0.001953574],"category_scores_gemma":[0.009539825,0.00090011,0.0010424252,0.0015889057,0.00081709574,0.0021717667,0.0008131291,0.0024278355,0.0006991149],"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.00011619249,0.00006690648,0.0024093643,0.00006778055,0.00009376689,0.000061994506,0.000043621414,0.9249251,0.0017605041,0.021872679,0.0018041638,0.046778068],"study_design_scores_gemma":[0.0000018164025,0.0000029132907,0.00018512584,0.0000028593302,0.0000032864834,0.0000037908162,0.0000018327797,0.9936991,0.00009993183,0.005908322,0.00008833312,0.0000027599744],"about_ca_topic_score_codex":0.015656725,"about_ca_topic_score_gemma":0.017772973,"teacher_disagreement_score":0.015656725,"about_ca_system_score_codex":0.0012579808,"about_ca_system_score_gemma":0.00078474486,"threshold_uncertainty_score":0.031131148},"labels":[],"label_agreement":null},{"id":"W2973697852","doi":"10.1371/journal.pone.0247936","title":"Learning temporal attention in dynamic graphs with bilinear interactions","year":2021,"lang":"en","type":"preprint","venue":"PLoS ONE","topic":"Advanced Graph Neural Networks","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":"Canadian Institute for Advanced Research; University of Saskatchewan; University of Guelph; Vector Institute","funders":"National Institute of Environmental Health Sciences; Defense Advanced Research Projects Agency; Canada Foundation for Innovation; Canada Research Chairs; University of Guelph; University of Saskatchewan; Government of Canada; Defense Sciences Office, DARPA; Vector Institute; Canadian Institute for Advanced Research; U.S. Department of Defense","keywords":"Computer science; Concatenation (mathematics); Node (physics); Term (time); Bilinear interpolation; Task (project management); Artificial intelligence; Feature (linguistics); Flexibility (engineering); Graph; Key (lock); Theoretical computer science; Machine learning; Mathematics","score_opus":0.02905274807875053,"score_gpt":0.2513163439872472,"score_spread":0.2222635959084967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973697852","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.13373226,0.0005502403,0.86104184,0.0009623485,0.00004866143,0.00004180759,0.0003786416,0.0012967071,0.001947497],"genre_scores_gemma":[0.94118494,0.00032443448,0.05261353,0.00034744438,0.000081715574,0.000055300912,0.00074577425,0.00016127354,0.004485615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947256,0.0001247363,0.000016174416,0.00026142073,0.00005790209,0.00006715902],"domain_scores_gemma":[0.9977174,0.0016166341,0.00022357877,0.00020593389,0.00012791202,0.00010860339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009977192,0.0009426061,0.0007746499,0.0009194262,0.00046348176,0.00085004675,0.0015357293,0.0016491415,0.0016360196],"category_scores_gemma":[0.0053687347,0.00074635824,0.0010530525,0.0009309913,0.0010924304,0.0031894087,0.0015171306,0.0023263851,0.00036042422],"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.00017448864,0.00009304375,0.003159018,0.00009125849,0.000059677677,0.00019895386,0.0002787098,0.88780195,0.0036113954,0.029319244,0.0024062023,0.07280611],"study_design_scores_gemma":[0.0000041523413,0.000007768715,0.00023718429,0.0000034586285,0.000004408904,0.000012211966,0.000007464862,0.9807162,0.0002607811,0.018555583,0.00018783823,0.0000029383134],"about_ca_topic_score_codex":0.016557796,"about_ca_topic_score_gemma":0.021636983,"teacher_disagreement_score":0.016557796,"about_ca_system_score_codex":0.0016731102,"about_ca_system_score_gemma":0.0006882941,"threshold_uncertainty_score":0.032922804},"labels":[],"label_agreement":null},{"id":"W2975795857","doi":"10.3389/fdata.2019.00006","title":"Attending Over Triads for Learning Signed Network Embedding","year":2019,"lang":"en","type":"article","venue":"Frontiers in Big Data","topic":"Advanced Graph Neural Networks","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":"HEC Montréal; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Embedding; Leverage (statistics); Sign (mathematics); Enhanced Data Rates for GSM Evolution; Computer science; Node (physics); Theoretical computer science; Network topology; Topology (electrical circuits); Mathematics; Artificial intelligence; Combinatorics; Computer network; Engineering","score_opus":0.04617225981116451,"score_gpt":0.2949449555788986,"score_spread":0.2487726957677341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975795857","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.020127049,0.0005003038,0.97588253,0.00053490285,0.000102636426,0.00008227249,0.00033502444,0.00084183185,0.0015934755],"genre_scores_gemma":[0.7281349,0.001117758,0.25342146,0.0008950349,0.00058417756,0.0005520848,0.0038094472,0.0004522622,0.011032907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887663,0.00046535095,0.00005611365,0.0003483437,0.00015616526,0.00009744923],"domain_scores_gemma":[0.9950788,0.0031860133,0.0005287093,0.00052706414,0.00040789502,0.00027150946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001728671,0.0020347522,0.001630461,0.0022422515,0.00091457623,0.0015951329,0.0022590884,0.0024704777,0.0061879912],"category_scores_gemma":[0.010436997,0.0006813961,0.0013715822,0.002374302,0.0012721397,0.0052612466,0.0025140534,0.0036572216,0.0015137908],"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.0003690463,0.00028082388,0.0027498587,0.00039963739,0.0001562378,0.0002244807,0.00034326076,0.61880624,0.0033774136,0.08268716,0.0145940175,0.2760118],"study_design_scores_gemma":[0.0000098003065,0.000034065633,0.000097248514,0.000011352399,0.00000822448,0.00002215596,0.000019378882,0.9568835,0.00034950167,0.041877437,0.00067889504,0.000008511243],"about_ca_topic_score_codex":0.0031713936,"about_ca_topic_score_gemma":0.0048787477,"teacher_disagreement_score":0.0061879912,"about_ca_system_score_codex":0.0013707784,"about_ca_system_score_gemma":0.0008300996,"threshold_uncertainty_score":0.020700932},"labels":[],"label_agreement":null},{"id":"W2975968959","doi":"10.24963/ijcai.2020/303","title":"Knowledge Hypergraphs: Prediction Beyond Binary Relations","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Neural Networks","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":"Embedding; Binary relation; Knowledge graph; Hypergraph; Computer science; Reification (Marxism); Relation (database); Theoretical computer science; Binary number; Graph; Function (biology); Data mining; Artificial intelligence; Mathematics; Discrete mathematics","score_opus":0.02723357558528301,"score_gpt":0.2654968276851004,"score_spread":0.2382632520998174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975968959","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.122332476,0.005365234,0.8310306,0.003617798,0.00027994954,0.0002083607,0.016218524,0.010863445,0.010083674],"genre_scores_gemma":[0.7217204,0.001959827,0.24142392,0.00054208527,0.00021731717,0.00015678136,0.02735222,0.0005145151,0.0061128917],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991209,0.00022613445,0.000042749776,0.00035815014,0.00019317566,0.000058821992],"domain_scores_gemma":[0.9915053,0.005540215,0.000631816,0.0013805969,0.00073007384,0.00021195745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010806785,0.0011807813,0.00058663,0.0033990976,0.00055607135,0.0013581875,0.0014994394,0.0015661891,0.0036398184],"category_scores_gemma":[0.013124545,0.00047182405,0.0007368697,0.0034756418,0.00063775777,0.006722024,0.001158143,0.0026138518,0.0019292792],"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.00052240223,0.00046085572,0.02513447,0.00078541774,0.00026535848,0.0004064021,0.00043376585,0.2846261,0.0036815002,0.03605835,0.06629464,0.58133066],"study_design_scores_gemma":[0.00002135034,0.000032094333,0.0024839423,0.000089849724,0.000052337655,0.000094839146,0.00007338343,0.90461737,0.002603118,0.08168611,0.0082276175,0.000018013303],"about_ca_topic_score_codex":0.010215851,"about_ca_topic_score_gemma":0.017074382,"teacher_disagreement_score":0.010215851,"about_ca_system_score_codex":0.0009842128,"about_ca_system_score_gemma":0.0008014361,"threshold_uncertainty_score":0.020312786},"labels":[],"label_agreement":null},{"id":"W2980593384","doi":"10.1145/3350546.3352511","title":"Deep Dynamic Mixed Membership Stochastic Blockmodel","year":2019,"lang":"en","type":"article","venue":"IEEE/WIC/ACM International Conference on Web Intelligence","topic":"Advanced Graph Neural Networks","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 Alberta","funders":"","keywords":"Computer science; Dependency (UML); Feature (linguistics); Data mining; Task (project management); Artificial intelligence; Theoretical computer science","score_opus":0.045211662971375674,"score_gpt":0.3058278037402635,"score_spread":0.26061614076888784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980593384","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.05384826,0.00032506906,0.9403645,0.0006250222,0.00006527804,0.00003658527,0.00088281656,0.0007790643,0.0030735347],"genre_scores_gemma":[0.8763165,0.00040345354,0.10467085,0.00027331832,0.00008210308,0.00021479122,0.0024392747,0.00014620386,0.015453491],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964726,0.00010091943,0.000012846125,0.000108223045,0.00007401365,0.000056747584],"domain_scores_gemma":[0.9993424,0.00029730948,0.0000899459,0.0000789999,0.00013421073,0.000057067304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006949887,0.00059318804,0.0007642927,0.0005499172,0.0003264918,0.00083083677,0.0018010135,0.0011219056,0.0035287028],"category_scores_gemma":[0.00203665,0.0004484763,0.00061346195,0.00075189193,0.0005814714,0.0023805993,0.00089126936,0.0014860159,0.00076168904],"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.00013122907,0.00006253765,0.0017969599,0.00005350955,0.00005861074,0.0000719784,0.00007270486,0.8905066,0.0022941607,0.06112042,0.0033386352,0.040492557],"study_design_scores_gemma":[0.0000021774363,0.000004373087,0.0000633823,0.0000011530227,0.0000019980077,0.0000036906367,0.0000017174845,0.99384755,0.00010480835,0.0057582674,0.00020939622,0.0000014485789],"about_ca_topic_score_codex":0.013644651,"about_ca_topic_score_gemma":0.020580148,"teacher_disagreement_score":0.013644651,"about_ca_system_score_codex":0.0012078339,"about_ca_system_score_gemma":0.0010403844,"threshold_uncertainty_score":0.027130425},"labels":[],"label_agreement":null},{"id":"W2981608876","doi":"10.48550/arxiv.1910.12132","title":"Bayesian Graph Convolutional Neural Networks Using Non-Parametric Graph Learning","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","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":"Computer science; Inference; Graph; Artificial intelligence; Random graph; Theoretical computer science; Machine learning","score_opus":0.048245072244459675,"score_gpt":0.19625729861127042,"score_spread":0.14801222636681075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981608876","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.011198793,0.00033075546,0.9855752,0.00024815946,0.000031191645,0.00003547136,0.00015785593,0.00095480896,0.0014677492],"genre_scores_gemma":[0.6129478,0.0011503905,0.37559268,0.00045716626,0.00012879445,0.00020888442,0.0019974003,0.00037162678,0.007145278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992994,0.0002618802,0.000022853284,0.00018420213,0.00016932025,0.00006229377],"domain_scores_gemma":[0.99856323,0.0007308469,0.0001867596,0.00023733078,0.0002156162,0.00006630861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011221883,0.0010042159,0.0008772622,0.001145576,0.00033636834,0.00093069376,0.0022252917,0.0015721245,0.0018977906],"category_scores_gemma":[0.0046515344,0.00064870145,0.000818603,0.0015821159,0.0009410914,0.0022746616,0.0014576418,0.0020737369,0.000713216],"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.000081680264,0.000083501625,0.0012652667,0.00010699175,0.00010114755,0.00006737192,0.000065672626,0.74567604,0.0028173833,0.0630693,0.004306875,0.18235876],"study_design_scores_gemma":[0.0000026327998,0.0000055786686,0.000090359696,0.0000040023156,0.0000040022314,0.000007674708,0.000002162642,0.9834615,0.00031767326,0.01574309,0.0003579051,0.0000033682118],"about_ca_topic_score_codex":0.011401284,"about_ca_topic_score_gemma":0.020218344,"teacher_disagreement_score":0.011401284,"about_ca_system_score_codex":0.0015427903,"about_ca_system_score_gemma":0.0011927646,"threshold_uncertainty_score":0.022669852},"labels":[],"label_agreement":null},{"id":"W2981898874","doi":"10.1109/tnnls.2020.3044146","title":"Hierarchical Representation Learning in Graph Neural Networks With Node Decimation Pooling","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks and Learning Systems","topic":"Advanced Graph Neural Networks","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 Manitoba","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Pooling; Decimation; Adjacency matrix; Computer science; Preprocessor; Graph; Theoretical computer science; Artificial intelligence; Pattern recognition (psychology); Algorithm","score_opus":0.017642194193401815,"score_gpt":0.24141664207928215,"score_spread":0.22377444788588033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981898874","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.024199897,0.00034134957,0.97275364,0.00015177052,0.00003007283,0.00003531455,0.000116475756,0.0013312768,0.0010403334],"genre_scores_gemma":[0.59963435,0.00053273456,0.39413762,0.00033957858,0.000077983605,0.00016195375,0.0010063397,0.0003006621,0.0038087948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959606,0.00009466565,0.000017806497,0.00014332827,0.0000886393,0.00005953101],"domain_scores_gemma":[0.9994992,0.00020265205,0.00006315682,0.00013253288,0.000067575966,0.000034919078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063744787,0.001154538,0.0009441359,0.00078979443,0.00034932152,0.00074142247,0.001431355,0.0008493192,0.0017753536],"category_scores_gemma":[0.0023512533,0.0004444797,0.0008501852,0.0010437091,0.000877592,0.0023732372,0.0013281988,0.0013477819,0.00048746177],"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.00013449285,0.000105862055,0.0006864616,0.00017622965,0.00010714517,0.00015050509,0.00016681873,0.6619551,0.0136185,0.033737402,0.0050183483,0.2841432],"study_design_scores_gemma":[0.0000064304477,0.00002955209,0.0001612035,0.000005273666,0.000011487546,0.000021890362,0.000015363006,0.9741275,0.0020796687,0.022866514,0.0006680687,0.000007064621],"about_ca_topic_score_codex":0.0057473765,"about_ca_topic_score_gemma":0.009264682,"teacher_disagreement_score":0.0057473765,"about_ca_system_score_codex":0.0009489386,"about_ca_system_score_gemma":0.0007475402,"threshold_uncertainty_score":0.01142782},"labels":[],"label_agreement":null},{"id":"W2985105421","doi":"","title":"Understanding Graph Neural Networks with Asymmetric Geometric Scattering Transforms","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","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":"Université de Montréal","funders":"","keywords":"Euclidean geometry; Scattering; Graph; Computer science; Deep learning; Wavelet; Wavelet transform; Stability (learning theory); Theoretical computer science; Artificial intelligence; Topology (electrical circuits); Mathematics; Machine learning; Combinatorics; Physics; Geometry; Quantum mechanics","score_opus":0.10125462123964325,"score_gpt":0.18597146810336548,"score_spread":0.08471684686372223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2985105421","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.10630025,0.0008225938,0.87656283,0.0026259513,0.00010148938,0.000026542562,0.00025656217,0.0003225566,0.012981229],"genre_scores_gemma":[0.9229712,0.0012949127,0.06769211,0.00043928044,0.00019941821,0.000069031805,0.00037280607,0.00013360666,0.006827713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997931,0.00007120328,0.0000067409123,0.00004571169,0.000057882342,0.000025238232],"domain_scores_gemma":[0.99918884,0.00042985554,0.00012420063,0.00009645332,0.00010747459,0.000053217533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005921916,0.0004363504,0.00034795032,0.00068733084,0.0003298246,0.0012650411,0.00076577195,0.0013004539,0.0021985976],"category_scores_gemma":[0.003426418,0.00035031635,0.00035730228,0.00042131395,0.001429499,0.003586805,0.0012260823,0.0015514148,0.00034031706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028513523,0.000019075647,0.00094639696,0.000054735447,0.0000152093435,0.00008633897,0.000115286886,0.13493143,0.0020924443,0.8444277,0.0021060137,0.015176919],"study_design_scores_gemma":[0.0000038061878,0.0000057005172,0.00017843618,0.000008409358,0.000002992621,0.000022446071,0.000022440141,0.41643146,0.00030363468,0.5819621,0.0010544419,0.0000041114295],"about_ca_topic_score_codex":0.0018097372,"about_ca_topic_score_gemma":0.0019625179,"teacher_disagreement_score":0.0021985976,"about_ca_system_score_codex":0.0008594246,"about_ca_system_score_gemma":0.00039014948,"threshold_uncertainty_score":0.007355094},"labels":[],"label_agreement":null},{"id":"W2991627008","doi":"10.1007/s00500-019-04451-z","title":"A network representation method based on edge information extraction","year":2019,"lang":"en","type":"article","venue":"Soft Computing","topic":"Advanced Graph Neural Networks","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 Saskatchewan","funders":"Fundamental Research Funds for the Central Universities; Civil Aviation University of China; National Natural Science Foundation of China","keywords":"Enhanced Data Rates for GSM Evolution; Computer science; Node (physics); Representation (politics); Cluster analysis; Field (mathematics); Data mining; Artificial intelligence; Graph; Theoretical computer science; Mathematics","score_opus":0.01626953300654038,"score_gpt":0.304752218662904,"score_spread":0.2884826856563636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991627008","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.0038348688,0.00015894906,0.99320495,0.000113572154,0.0000815491,0.000067210385,0.00024203645,0.0009303298,0.0013666038],"genre_scores_gemma":[0.12717247,0.0004925916,0.8632364,0.00014730373,0.00013315577,0.0002775644,0.001538968,0.00025864324,0.006742815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999619,0.000072396164,0.000027724442,0.00010324405,0.00014661391,0.00003100244],"domain_scores_gemma":[0.9994634,0.00018032214,0.000048286514,0.00009240641,0.0001900354,0.00002562739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047137047,0.00086940924,0.0009215693,0.0027619584,0.00056223385,0.0011412145,0.0012883684,0.0009829955,0.004075439],"category_scores_gemma":[0.0018968333,0.0003724427,0.0008885425,0.00265721,0.00031460047,0.001837429,0.0008493695,0.0013110184,0.0017577485],"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.00013832226,0.00014383445,0.00060989853,0.00022747401,0.00010949937,0.0001304966,0.00007137168,0.08046323,0.020990588,0.025461504,0.010182479,0.86147124],"study_design_scores_gemma":[0.000013913364,0.00003314974,0.00032407392,0.000023426544,0.000052747542,0.0000854663,0.00001698489,0.9757833,0.005848909,0.013724118,0.0040739975,0.000019972822],"about_ca_topic_score_codex":0.00322065,"about_ca_topic_score_gemma":0.00396749,"teacher_disagreement_score":0.004075439,"about_ca_system_score_codex":0.0004669055,"about_ca_system_score_gemma":0.00069171883,"threshold_uncertainty_score":0.013633668},"labels":[],"label_agreement":null},{"id":"W2991832894","doi":"10.1007/978-3-030-36802-9_61","title":"Event Prediction in Complex Social Graphs via Feature Learning of Vertex Embeddings","year":2019,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Advanced Graph Neural Networks","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 Windsor","funders":"","keywords":"Vertex (graph theory); Event (particle physics); Computer science; Feature (linguistics); Artificial intelligence; Machine learning; Theoretical computer science; Graph; Physics; Astrophysics; Linguistics; Philosophy","score_opus":0.02425630440471985,"score_gpt":0.2851043032474795,"score_spread":0.2608479988427596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991832894","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.13510062,0.0012764874,0.85769963,0.0008577269,0.00011178148,0.000060133152,0.001398732,0.0011698328,0.0023250587],"genre_scores_gemma":[0.91624135,0.000858425,0.07633477,0.000119357544,0.00018566071,0.000073658426,0.0025027997,0.00010017344,0.0035837174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969816,0.00009233517,0.0000145973445,0.00011238277,0.000043075273,0.000039572376],"domain_scores_gemma":[0.99754936,0.0018587293,0.00020798403,0.0001821098,0.00012284033,0.000078981146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058582774,0.0006652904,0.0007521871,0.001048715,0.00026211058,0.00086908543,0.001152364,0.000890757,0.0014813853],"category_scores_gemma":[0.004524002,0.00037164433,0.0006270954,0.0012383019,0.00046455543,0.002468874,0.0009213506,0.0013377367,0.00053438894],"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.00039783315,0.00026800652,0.011975951,0.000263968,0.0001692643,0.00022116497,0.00017153873,0.6823939,0.0028400945,0.03669962,0.013127904,0.25147074],"study_design_scores_gemma":[0.0000036211102,0.000009898965,0.00037904622,0.0000049496025,0.0000050169288,0.000012810848,0.0000084440835,0.98193526,0.00018479429,0.017218007,0.00023532879,0.000002893572],"about_ca_topic_score_codex":0.0030794775,"about_ca_topic_score_gemma":0.0043147164,"teacher_disagreement_score":0.0030794775,"about_ca_system_score_codex":0.00059107505,"about_ca_system_score_gemma":0.000291986,"threshold_uncertainty_score":0.0061231256},"labels":[],"label_agreement":null},{"id":"W2995590401","doi":"10.1007/s41109-020-00257-3","title":"Evolving network representation learning based on random walks","year":2020,"lang":"en","type":"article","venue":"Applied Network Science","topic":"Advanced Graph Neural Networks","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":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Random walk; Representation (politics); Computer science; Theoretical computer science; Artificial intelligence; Mathematics; Statistics","score_opus":0.017249362561230514,"score_gpt":0.24619228134597063,"score_spread":0.2289429187847401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995590401","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.018723615,0.00025211347,0.9788157,0.00023112936,0.00003037589,0.000041489,0.0001497444,0.0007457433,0.0010101123],"genre_scores_gemma":[0.64412767,0.0007362508,0.34646082,0.00035882447,0.0001076028,0.0002784626,0.001681014,0.00038738063,0.0058619766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940443,0.00017737913,0.000027993066,0.00019209717,0.0001400305,0.000058137168],"domain_scores_gemma":[0.99819285,0.0010352085,0.00021723579,0.00021118663,0.00024134859,0.00010221039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092425395,0.0008516942,0.00089695514,0.001780887,0.00037762406,0.0011225583,0.0018175079,0.0012143314,0.0019682785],"category_scores_gemma":[0.005706421,0.0005212116,0.00098265,0.001283399,0.00085895223,0.002935856,0.0011680835,0.0018116143,0.00058682746],"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.00006330128,0.000053567364,0.001836823,0.00008040985,0.00007143941,0.00013634261,0.00013201137,0.8333457,0.0026773114,0.04246344,0.003191635,0.115948014],"study_design_scores_gemma":[0.0000020494363,0.0000056002323,0.000052419782,0.0000033555455,0.0000024305348,0.0000106675125,0.0000031101872,0.9914541,0.00016153578,0.008082309,0.00021953089,0.0000028617267],"about_ca_topic_score_codex":0.0048496095,"about_ca_topic_score_gemma":0.007350205,"teacher_disagreement_score":0.0048496095,"about_ca_system_score_codex":0.0009819022,"about_ca_system_score_gemma":0.0005773869,"threshold_uncertainty_score":0.00964278},"labels":[],"label_agreement":null},{"id":"W2997242078","doi":"10.1609/aaai.v34i04.6178","title":"DGE: Deep Generative Network Embedding Based on Commonality and Individuality","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","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":"Zhejiang University; China Postdoctoral Science Foundation; Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Embedding; Computer science; Node (physics); Generative model; Network topology; Topology (electrical circuits); Artificial intelligence; Generative grammar; Focus (optics); Theoretical computer science; Variety (cybernetics); Machine learning; Mathematics; Computer network","score_opus":0.09933017429236297,"score_gpt":0.3111534523431887,"score_spread":0.21182327805082574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997242078","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.008760175,0.00032918993,0.9890478,0.00024221097,0.000026968084,0.00003169034,0.00022106015,0.00046337518,0.00087757065],"genre_scores_gemma":[0.62777704,0.0013777581,0.35733312,0.00060479966,0.00014341275,0.00036721016,0.002808666,0.00061961723,0.008968377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999393,0.00022247585,0.00002208474,0.00018102932,0.000121481586,0.00005992678],"domain_scores_gemma":[0.9985014,0.00085434405,0.00016659066,0.00022767638,0.00014595223,0.00010400221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012630564,0.0012947125,0.0011961107,0.0013846674,0.000410817,0.0012178064,0.0021825368,0.0013810371,0.002289788],"category_scores_gemma":[0.004347915,0.0007992339,0.0012889986,0.0014112876,0.0013950014,0.0029519857,0.002190637,0.0031408768,0.00072566036],"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.00007233083,0.00008064418,0.0028146901,0.00013009993,0.0001593738,0.00015561511,0.00023898024,0.78632414,0.0023010357,0.086374395,0.005173876,0.11617482],"study_design_scores_gemma":[0.0000041506723,0.000011037458,0.00015399433,0.000011061463,0.000008071258,0.000030276935,0.000009835558,0.966459,0.0002569853,0.032253645,0.0007947637,0.0000071495106],"about_ca_topic_score_codex":0.0055330102,"about_ca_topic_score_gemma":0.009571502,"teacher_disagreement_score":0.0055330102,"about_ca_system_score_codex":0.0012388864,"about_ca_system_score_gemma":0.0008875669,"threshold_uncertainty_score":0.011001587},"labels":[],"label_agreement":null},{"id":"W2997940961","doi":"10.1609/aaai.v34i05.6214","title":"Multi-Agent Actor-Critic with Hierarchical Graph Attention Network","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":124,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Ministry of Science and ICT, South Korea; National Research Foundation of Korea; National Research Foundation","keywords":"Computer science; Reinforcement learning; Transferability; Artificial intelligence; Graph; Attention network; Machine learning; Representation (politics); Theoretical computer science","score_opus":0.08352121217448213,"score_gpt":0.28645645522763924,"score_spread":0.2029352430531571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997940961","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.036225203,0.00049453456,0.95548815,0.0006288331,0.00009877664,0.0000716149,0.00007745441,0.00081702083,0.006098394],"genre_scores_gemma":[0.9301597,0.00022084704,0.0632168,0.00026536573,0.000045620585,0.00014516925,0.00011662564,0.00006822373,0.0057617603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999511,0.00015873206,0.000018037897,0.00013015009,0.00010775293,0.000074452364],"domain_scores_gemma":[0.9992144,0.00044391843,0.00008952048,0.00005104996,0.00013505139,0.00006600417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010018655,0.0011331064,0.0009258629,0.0004791618,0.00040966467,0.00078458444,0.001761681,0.0014452395,0.00213229],"category_scores_gemma":[0.002660104,0.00048792802,0.00049845607,0.00055774266,0.0008926905,0.0011047823,0.0010212313,0.0014596177,0.00038420456],"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.00003641118,0.000020197109,0.00026611856,0.000018438917,0.000019567982,0.000039301598,0.000019729468,0.9837605,0.0005146978,0.0054881023,0.0005175354,0.009299433],"study_design_scores_gemma":[0.000003645541,0.000004045719,0.000022467551,7.9000665e-7,0.0000019635204,0.000002071327,8.3503744e-7,0.99870324,0.000062548934,0.0011320217,0.00006525781,0.0000011373612],"about_ca_topic_score_codex":0.01661039,"about_ca_topic_score_gemma":0.0150256455,"teacher_disagreement_score":0.01661039,"about_ca_system_score_codex":0.0014560181,"about_ca_system_score_gemma":0.0015254783,"threshold_uncertainty_score":0.03302741},"labels":[],"label_agreement":null},{"id":"W2999909502","doi":"10.1145/3341161.3343696","title":"Water governance network analysis using graphlet mining","year":2019,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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 Northern British Columbia","funders":"","keywords":"Corporate governance; Network analysis; Urbanization; Sophistication; Centrality; Population; Business; Popularity; Environmental economics; Environmental planning; Environmental science; Engineering; Economics; Economic growth; Political science","score_opus":0.011564453424455529,"score_gpt":0.23210036825820984,"score_spread":0.22053591483375432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999909502","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.15978089,0.0003609654,0.82613325,0.000864045,0.000095208474,0.00023896723,0.0049472637,0.0020537102,0.005525657],"genre_scores_gemma":[0.74455506,0.0003735161,0.24216238,0.00016676006,0.000054605327,0.00019439805,0.009022988,0.00015527879,0.0033149004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996842,0.00009617224,0.000019325627,0.00009670954,0.00006243156,0.000041118372],"domain_scores_gemma":[0.99839514,0.00074464234,0.0002994775,0.00020832522,0.00029255322,0.00005986512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064492016,0.0005536985,0.0004028424,0.0029947457,0.00041566213,0.00084056245,0.00062299246,0.0007052745,0.0021196797],"category_scores_gemma":[0.0034159736,0.00020079307,0.00064431503,0.0018499971,0.00035598665,0.0012032624,0.00055271515,0.0006686533,0.00049128407],"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.00016015171,0.00027616962,0.039115146,0.0003272778,0.00023870479,0.0008523157,0.00042837285,0.62660605,0.008047767,0.04654447,0.022393653,0.2550099],"study_design_scores_gemma":[0.0000067484425,0.00002017239,0.002729163,0.000013892777,0.000016420194,0.00006492975,0.00009076187,0.9731601,0.0013099401,0.018774271,0.0038063398,0.0000071910135],"about_ca_topic_score_codex":0.006247082,"about_ca_topic_score_gemma":0.008356695,"teacher_disagreement_score":0.006247082,"about_ca_system_score_codex":0.00060627534,"about_ca_system_score_gemma":0.00054993347,"threshold_uncertainty_score":0.012421429},"labels":[],"label_agreement":null},{"id":"W3003775208","doi":"10.1109/tip.2020.2969052","title":"Point Cloud Denoising via Feature Graph Laplacian Regularization","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":105,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Point cloud; Laplacian matrix; Artificial intelligence; Computer science; Noise reduction; Fidelity; Algorithm; Regularization (linguistics); Graph; Mathematics; Theoretical computer science","score_opus":0.011336804226354307,"score_gpt":0.234045933363947,"score_spread":0.2227091291375927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003775208","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.005854934,0.00004666545,0.9931666,0.00008157683,0.000012767884,0.000011708225,0.000040056206,0.0002497899,0.00053589215],"genre_scores_gemma":[0.31877542,0.0004167415,0.67406696,0.00024099251,0.000094710915,0.000186287,0.0007544732,0.00036465868,0.005099758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957794,0.000052414376,0.000012763455,0.00009934347,0.00020914606,0.000048437338],"domain_scores_gemma":[0.9995334,0.00016076873,0.000060827562,0.00007595923,0.00013433461,0.00003478778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046564144,0.00068295706,0.0008548415,0.00079499965,0.00032006935,0.0006580242,0.0013271038,0.0011347157,0.0011849875],"category_scores_gemma":[0.0017280903,0.0003981512,0.0009796442,0.0009495224,0.0006357472,0.0008278649,0.0012191376,0.0013285265,0.00065932894],"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.00010771556,0.00006152262,0.0008487324,0.00011157873,0.000058931353,0.00017907904,0.00010323872,0.8060203,0.033237286,0.022130916,0.0053064427,0.13183425],"study_design_scores_gemma":[0.000003527501,0.000008043901,0.00008855886,0.0000024732215,0.0000021952837,0.000018941924,0.0000042776614,0.99436957,0.0017592007,0.0033223892,0.00041689986,0.000003901822],"about_ca_topic_score_codex":0.0048492374,"about_ca_topic_score_gemma":0.005236464,"teacher_disagreement_score":0.0048492374,"about_ca_system_score_codex":0.0006753246,"about_ca_system_score_gemma":0.0009237969,"threshold_uncertainty_score":0.009642005},"labels":[],"label_agreement":null},{"id":"W3006053005","doi":"10.48550/arxiv.1911.06962","title":"Inductive Relation Prediction by Subgraph Reasoning","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":65,"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":"Relation (database); Inductive reasoning; Mathematics; Computer science; Artificial intelligence; Data mining","score_opus":0.03719935338676308,"score_gpt":0.17199681477441398,"score_spread":0.1347974613876509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006053005","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.043041468,0.00053796294,0.943722,0.000929861,0.00008134832,0.000112311114,0.001032425,0.0043834187,0.006159203],"genre_scores_gemma":[0.70743537,0.00043891507,0.28129178,0.0005972191,0.00011763907,0.00014297114,0.004207764,0.0003318398,0.005436487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989542,0.00028439562,0.000039887127,0.0003893035,0.00025860313,0.00007356025],"domain_scores_gemma":[0.99692315,0.0018630516,0.00020289804,0.0006320251,0.00030163897,0.00007725474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088614045,0.00092090917,0.0006766223,0.0017385515,0.00045968895,0.0010930378,0.0021538383,0.0009343085,0.0046624113],"category_scores_gemma":[0.0058804913,0.00039965953,0.0010311012,0.0013573135,0.0010806677,0.0039149816,0.0015044836,0.0017754278,0.0013986276],"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.00020498739,0.000280059,0.006147975,0.00033464472,0.00012326529,0.00031757975,0.00026365824,0.3768797,0.0066546714,0.080644086,0.017931717,0.5102176],"study_design_scores_gemma":[0.000010362773,0.000016588954,0.00032944305,0.00002092244,0.000018522152,0.000041791696,0.000024135841,0.9075771,0.0025017967,0.08743826,0.002013535,0.0000075070716],"about_ca_topic_score_codex":0.0037316938,"about_ca_topic_score_gemma":0.007424028,"teacher_disagreement_score":0.0046624113,"about_ca_system_score_codex":0.0009220932,"about_ca_system_score_gemma":0.00091880135,"threshold_uncertainty_score":0.015597343},"labels":[],"label_agreement":null},{"id":"W3006544536","doi":"10.48550/arxiv.2002.05825","title":"An Inductive Bias for Distances: Neural Nets that Respect the Triangle\\n Inequality","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","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","funders":"","keywords":"Triangle inequality; Inductive bias; Subadditivity; Artificial neural network; Mathematics; Reinforcement learning; Metric space; Metric (unit); Euclidean space; Computer science; Discrete mathematics; Theoretical computer science; Artificial intelligence; Combinatorics; Multi-task learning; Task (project management)","score_opus":0.3062366027530909,"score_gpt":0.25673988863396807,"score_spread":0.04949671411912282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006544536","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.023040995,0.00042776376,0.9673379,0.0009085915,0.00008159663,0.000045271496,0.00009712377,0.0003077255,0.0077530695],"genre_scores_gemma":[0.6986225,0.00091665186,0.28531888,0.001281547,0.00027271244,0.0003654865,0.00049211236,0.0005384098,0.012191571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973611,0.00083145325,0.00015058738,0.00060823833,0.00079671055,0.00025185954],"domain_scores_gemma":[0.99054986,0.0053436933,0.0008569971,0.0015868729,0.0012380437,0.0004244635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036987544,0.0012465335,0.0011232065,0.0008494407,0.0008393803,0.0021493256,0.0028182678,0.0022533725,0.0045166374],"category_scores_gemma":[0.030216228,0.00061419123,0.00087150844,0.0010667396,0.003381451,0.007917248,0.005485655,0.005233251,0.0011386784],"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.00025756835,0.00007734055,0.0021864465,0.00024001738,0.000078506506,0.00013774433,0.0002627672,0.24246314,0.0058287247,0.649945,0.003962873,0.09455991],"study_design_scores_gemma":[0.000020723728,0.0001253891,0.00028257837,0.000044285396,0.000014631069,0.00009656699,0.00003159488,0.6961002,0.002985249,0.29758278,0.002700193,0.00001583055],"about_ca_topic_score_codex":0.0017334587,"about_ca_topic_score_gemma":0.0024593216,"teacher_disagreement_score":0.0045166374,"about_ca_system_score_codex":0.0021538094,"about_ca_system_score_gemma":0.0011725387,"threshold_uncertainty_score":0.019561112},"labels":[],"label_agreement":null},{"id":"W3008125782","doi":"10.1088/2632-2153/abf5b8","title":"Neural message passing on high order paths","year":2021,"lang":"en","type":"preprint","venue":"Machine Learning Science and Technology","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto","funders":"Office of Naval Research; Tata Steel","keywords":"Computer science; Graph; Artificial neural network; Aggregate (composite); Theoretical computer science; Message passing; Property (philosophy); Order (exchange); Topology (electrical circuits); Artificial intelligence; Mathematics; Distributed computing; Combinatorics","score_opus":0.007794981430785009,"score_gpt":0.2462904889328129,"score_spread":0.23849550750202791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008125782","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.15443495,0.0005190678,0.83558196,0.0016975048,0.00017507942,0.00005608889,0.00027613266,0.0011170609,0.006142195],"genre_scores_gemma":[0.92212725,0.00031301694,0.068504155,0.00020787351,0.0001046743,0.00007753959,0.00026394817,0.00010336211,0.008298167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993851,0.00020801654,0.00002933253,0.00015931456,0.00012654402,0.00009172122],"domain_scores_gemma":[0.99558073,0.0031404283,0.000367604,0.00033765056,0.00042004182,0.00015362843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010980065,0.00056026975,0.00069190346,0.0011962764,0.00060823443,0.0012576141,0.0011052882,0.0014394829,0.003702696],"category_scores_gemma":[0.0077745607,0.00032605662,0.00049611065,0.0011531607,0.001260993,0.003090638,0.0011560115,0.0015476348,0.0004682174],"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.00018600578,0.00006305503,0.0011248324,0.00009756435,0.000047404767,0.00015349041,0.00017168697,0.7815324,0.0032208445,0.15888251,0.0029629169,0.051557276],"study_design_scores_gemma":[0.0000075132552,0.000012265258,0.00009003805,0.000004939518,0.000004500966,0.000009830658,0.0000062621452,0.9305357,0.0006129431,0.06827482,0.00043687463,0.000004361342],"about_ca_topic_score_codex":0.0043721623,"about_ca_topic_score_gemma":0.0032668388,"teacher_disagreement_score":0.0043721623,"about_ca_system_score_codex":0.0014356546,"about_ca_system_score_gemma":0.0005907321,"threshold_uncertainty_score":0.012386739},"labels":[],"label_agreement":null},{"id":"W3009604719","doi":"10.1109/tsp.2021.3061575","title":"Graphon Filters: Graph Signal Processing in the Limit","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":31,"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":"King Abdullah University of Science and Technology; Natural Sciences and Engineering Research Council of Canada; Technische Universiteit Delft","keywords":"Adjacency matrix; Graph energy; Integral graph; Strength of a graph; Mathematics; Spectral graph theory; Graph; Voltage graph; Discrete mathematics; Computer science; Line graph; Algorithm","score_opus":0.02793251529424654,"score_gpt":0.26216168202481505,"score_spread":0.2342291667305685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009604719","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.00910059,0.00028497208,0.9866763,0.00026024473,0.00007355985,0.000022840411,0.000045246186,0.00023133494,0.0033049604],"genre_scores_gemma":[0.46265155,0.0021278216,0.5108718,0.0006753824,0.00027905963,0.0002573389,0.00034606564,0.00042669283,0.022364298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995776,0.00014259608,0.00001442854,0.000100454665,0.00012495658,0.00004000207],"domain_scores_gemma":[0.9987268,0.00075926125,0.00010781234,0.00015318312,0.0001719222,0.0000809329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011851025,0.00063054566,0.0004863312,0.00089218275,0.0004341562,0.0014952524,0.0009841865,0.0014018153,0.0030739286],"category_scores_gemma":[0.0045507364,0.00028267852,0.0005907985,0.0007080812,0.0015646971,0.0025535163,0.0009618628,0.0012131032,0.0009130756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116172705,0.000057822523,0.00062634324,0.0001408301,0.000037317437,0.00015556303,0.00017418478,0.18243854,0.0097873,0.74083704,0.00443951,0.061189417],"study_design_scores_gemma":[0.000008818192,0.000028846318,0.00015280934,0.000016292963,0.000007181252,0.000071964954,0.00002150501,0.8045925,0.0025581806,0.18944825,0.0030797927,0.0000138976875],"about_ca_topic_score_codex":0.0024945482,"about_ca_topic_score_gemma":0.002185328,"teacher_disagreement_score":0.0030739286,"about_ca_system_score_codex":0.00094277086,"about_ca_system_score_gemma":0.0007482426,"threshold_uncertainty_score":0.010283351},"labels":[],"label_agreement":null},{"id":"W3009964655","doi":"10.48550/arxiv.2003.03872","title":"Graph Clustering Via QUBO and Digital Annealing","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","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 Toronto","funders":"","keywords":"Cluster analysis; Computer science; Graph; Data science; Data mining; Theoretical computer science; Artificial intelligence","score_opus":0.05960492448063558,"score_gpt":0.17815480188883287,"score_spread":0.1185498774081973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009964655","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.11200534,0.0007796315,0.83869195,0.001186656,0.00028197162,0.00030047656,0.00028361566,0.0033081786,0.043162134],"genre_scores_gemma":[0.5633243,0.00015932693,0.429592,0.0002878604,0.00002505134,0.0002771552,0.00025706473,0.00034411708,0.0057330844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994191,0.00019560284,0.000017834152,0.00012495047,0.00016150759,0.00008096783],"domain_scores_gemma":[0.9986052,0.00078675465,0.00008994154,0.0002597115,0.00019617348,0.000062133535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011574461,0.00069943117,0.000811707,0.0007611666,0.0010180101,0.0010607793,0.0018513737,0.0016883847,0.0072158147],"category_scores_gemma":[0.0042642057,0.00051264546,0.00066837517,0.00079647644,0.0012729549,0.001421089,0.0010168323,0.0012625229,0.0008459718],"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.00013149725,0.0001013775,0.00054862414,0.00012341153,0.000033053595,0.000031205705,0.00006036676,0.9243857,0.0020839665,0.031648148,0.0027569553,0.03809573],"study_design_scores_gemma":[0.000020807078,0.000023643706,0.00010693669,0.0000068544214,0.0000048833485,0.000009602519,0.000014638532,0.9895822,0.00088514114,0.00797029,0.00137063,0.000004489892],"about_ca_topic_score_codex":0.010488829,"about_ca_topic_score_gemma":0.015135498,"teacher_disagreement_score":0.010488829,"about_ca_system_score_codex":0.0024425616,"about_ca_system_score_gemma":0.0020609812,"threshold_uncertainty_score":0.024139345},"labels":[],"label_agreement":null},{"id":"W3011257201","doi":"","title":"Scattering GCN: Overcoming Oversmoothness in Graph Convolutional Networks.","year":2020,"lang":"en","type":"preprint","venue":"PubMed","topic":"Advanced Graph Neural Networks","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":"Mila - Quebec Artificial Intelligence Institute","funders":"National Institutes of Health; Institut de Valorisation des Données","keywords":"Graph; Computer science; Scattering; Artificial intelligence; Convolutional neural network; Residual; Pattern recognition (psychology); Theoretical computer science; Algorithm; Physics","score_opus":0.03333962040462993,"score_gpt":0.2303594570777287,"score_spread":0.19701983667309877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011257201","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.04981238,0.00025338592,0.9467024,0.0002082446,0.000045248984,0.000045681398,0.00008465345,0.0011280397,0.0017199017],"genre_scores_gemma":[0.66951275,0.00041845898,0.32371503,0.00035195157,0.00006910459,0.000083479434,0.0006135824,0.00039057148,0.0048450725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996723,0.00008082146,0.000013914915,0.000085475425,0.00010763032,0.000039854036],"domain_scores_gemma":[0.9987871,0.00056245376,0.00013607643,0.00024887404,0.00018660401,0.000078863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087874633,0.00091424334,0.0005374088,0.0008766004,0.00036494635,0.00065397477,0.0013206594,0.0011328614,0.0012300923],"category_scores_gemma":[0.004137501,0.0004111469,0.000565339,0.00088342413,0.0011539673,0.0017808601,0.0012478414,0.001400049,0.00041303842],"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.00025234846,0.00009277867,0.0027411832,0.00019771558,0.00011597997,0.00030278103,0.00029971264,0.6333489,0.0326477,0.05316875,0.004781878,0.27205017],"study_design_scores_gemma":[0.0000033835954,0.00001893215,0.00016276354,0.0000050128533,0.000007238389,0.000033904835,0.0000091633765,0.9842104,0.003148938,0.011864292,0.0005320265,0.000003989131],"about_ca_topic_score_codex":0.0049881167,"about_ca_topic_score_gemma":0.01256525,"teacher_disagreement_score":0.0049881167,"about_ca_system_score_codex":0.000974781,"about_ca_system_score_gemma":0.0008726977,"threshold_uncertainty_score":0.009918153},"labels":[],"label_agreement":null},{"id":"W3011643994","doi":"10.1109/camsap45676.2019.9022508","title":"Node Copying for Protection Against Graph Neural Network Topology Attacks","year":2019,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Computer science; Copying; Adversarial system; Graph; Artificial intelligence; Theoretical computer science; Network topology; Machine learning; Computation; Topological graph theory; Data mining; Algorithm; Computer network; Line graph","score_opus":0.020075402245770323,"score_gpt":0.2617249710921488,"score_spread":0.2416495688463785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011643994","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.14748597,0.0009367631,0.8385512,0.0011062326,0.00023464067,0.00017080928,0.00019863094,0.006620125,0.004695569],"genre_scores_gemma":[0.93111676,0.0002232606,0.065667585,0.00018849889,0.00006300406,0.00006570507,0.00023313495,0.00019605437,0.0022459447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986167,0.00035363334,0.0000950824,0.00032151057,0.00043072793,0.00018235837],"domain_scores_gemma":[0.99067056,0.0025585385,0.0009767519,0.0049493383,0.0005458309,0.0002988785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019550426,0.0008494014,0.0012338074,0.0010059888,0.00087278703,0.001172278,0.0024907745,0.0014729396,0.0021192923],"category_scores_gemma":[0.013669405,0.00039766319,0.00079038023,0.0007046655,0.0014670443,0.003528334,0.0026028203,0.0017684747,0.00066598883],"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.0005099257,0.00018764863,0.004095503,0.00015716026,0.00012802458,0.0004562922,0.00033908788,0.62564975,0.019595977,0.035078675,0.006946709,0.30685526],"study_design_scores_gemma":[0.000016745258,0.00006487635,0.0003108849,0.0000121919875,0.000018472208,0.00014531915,0.000027781629,0.9720595,0.010342674,0.015555826,0.0014353431,0.000010413145],"about_ca_topic_score_codex":0.0011854842,"about_ca_topic_score_gemma":0.0017069725,"teacher_disagreement_score":0.0024907745,"about_ca_system_score_codex":0.00089826836,"about_ca_system_score_gemma":0.001068435,"threshold_uncertainty_score":0.010339379},"labels":[],"label_agreement":null},{"id":"W3012073743","doi":"10.2196/17645","title":"A Method to Learn Embedding of a Probabilistic Medical Knowledge Graph: Algorithm Development","year":2020,"lang":"en","type":"article","venue":"JMIR Medical Informatics","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":24,"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":"Embedding; Probabilistic logic; Representation (politics); Medical knowledge; Knowledge graph; Knowledge representation and reasoning; Graph","score_opus":0.027764589076377275,"score_gpt":0.34304966760358213,"score_spread":0.31528507852720483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012073743","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.0025608062,0.0001573348,0.9956435,0.00020880398,0.000030787636,0.00008371023,0.00008673131,0.00091779314,0.00031054937],"genre_scores_gemma":[0.07504817,0.00040205757,0.91993695,0.00022914754,0.00010563616,0.00047239877,0.0010066438,0.00021483946,0.0025842718],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907947,0.00022396771,0.00007857434,0.00029803737,0.00026596696,0.00005399645],"domain_scores_gemma":[0.9978116,0.0011360485,0.00015228918,0.0002765069,0.0005221352,0.00010137547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018113677,0.0010387562,0.0010077448,0.0015378519,0.00049236935,0.0012189634,0.0017500276,0.0015577007,0.0052821757],"category_scores_gemma":[0.0065453644,0.00060889736,0.0009739232,0.0015924028,0.0007220061,0.0023062606,0.0025209,0.002656059,0.0019586736],"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.000120846315,0.0001427205,0.0014393827,0.00019024401,0.00009120428,0.000100318975,0.00010392895,0.17544001,0.0029379148,0.013322763,0.008248245,0.79786247],"study_design_scores_gemma":[0.000022774942,0.0000424437,0.00016508612,0.000013334783,0.000010329195,0.00011387157,0.00002339263,0.98911464,0.0010532081,0.00789009,0.0015410378,0.000009774851],"about_ca_topic_score_codex":0.0049463706,"about_ca_topic_score_gemma":0.0053233034,"teacher_disagreement_score":0.0052821757,"about_ca_system_score_codex":0.0009776847,"about_ca_system_score_gemma":0.0017825264,"threshold_uncertainty_score":0.017670572},"labels":[],"label_agreement":null},{"id":"W3012568466","doi":"10.1145/3366423.3380134","title":"Deep Adversarial Completion for Sparse Heterogeneous Information Network Embedding","year":2020,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Université de Montréal","funders":"","keywords":"Adversarial system; Computer science; Embedding; Artificial intelligence; Theoretical computer science","score_opus":0.024173432701773405,"score_gpt":0.24932868293784682,"score_spread":0.2251552502360734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012568466","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.030543102,0.0008875331,0.96401346,0.00072867156,0.0000711611,0.0000680308,0.0004540513,0.0010590184,0.0021750254],"genre_scores_gemma":[0.8579179,0.0009111504,0.12907664,0.00055123237,0.00016701182,0.00028455138,0.0029036563,0.0002109768,0.007976884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990709,0.00036426354,0.00003218776,0.0002554593,0.0001676876,0.00010951235],"domain_scores_gemma":[0.9973826,0.0017931195,0.00021658429,0.0002981848,0.00020369353,0.00010578664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016963667,0.0016413454,0.0013639118,0.000849113,0.00043324166,0.0008887512,0.0018621136,0.0014685694,0.002292834],"category_scores_gemma":[0.004916684,0.000596449,0.0011051296,0.0009248574,0.0013144729,0.002159333,0.002108969,0.0035756496,0.0006661326],"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.000115040195,0.00007472199,0.0008431793,0.0000871387,0.00006275994,0.00011713611,0.00008168953,0.9236181,0.001099538,0.018700752,0.0042634835,0.050936386],"study_design_scores_gemma":[0.000003096053,0.000008243458,0.000052235384,0.000003139502,0.0000029764683,0.000007113438,0.0000033269284,0.9942682,0.00016529424,0.0052850065,0.00019861393,0.0000027517833],"about_ca_topic_score_codex":0.00679107,"about_ca_topic_score_gemma":0.0059284694,"teacher_disagreement_score":0.00679107,"about_ca_system_score_codex":0.0015537062,"about_ca_system_score_gemma":0.00087997137,"threshold_uncertainty_score":0.013503075},"labels":[],"label_agreement":null},{"id":"W3014017986","doi":"10.1137/1.9781611976236.55","title":"A Unified Non-Negative Matrix Factorization Framework for Semi Supervised Learning on Graphs","year":2020,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Institutes of Health; National Science Foundation","keywords":"Prior probability; Constraint (computer-aided design); Computer science; Node (physics); Key (lock); Encoding (memory); Range (aeronautics); Theoretical computer science; Artificial intelligence; Semi-supervised learning; Machine learning; Mathematics","score_opus":0.0552653009393757,"score_gpt":0.26602612358051253,"score_spread":0.21076082264113682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014017986","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.00031768772,0.000121981786,0.9986009,0.000082603234,0.000020244162,0.000012635679,0.000035755926,0.00016308154,0.0006451436],"genre_scores_gemma":[0.048710242,0.0006761614,0.94408256,0.0002352295,0.00020790196,0.0002157406,0.000520033,0.00026551736,0.005086618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988624,0.00048008387,0.000041274958,0.0002300175,0.00034097926,0.000045136643],"domain_scores_gemma":[0.99888355,0.00043940978,0.00009723555,0.00027396,0.00023993796,0.00006583837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001934785,0.0011216518,0.0009842175,0.0011418386,0.0004963791,0.0014959429,0.0021331243,0.0010797689,0.0039305487],"category_scores_gemma":[0.00339571,0.0005333788,0.0009798375,0.0014075937,0.0014389813,0.002319677,0.0019083685,0.0024757795,0.0022853198],"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.000039859962,0.000085660664,0.00039343542,0.00041455773,0.00009628883,0.00015921557,0.0002664074,0.19301644,0.0085349865,0.439656,0.02466432,0.33267286],"study_design_scores_gemma":[0.000006700165,0.000025844312,0.00010256317,0.000031047442,0.000008674776,0.000084183805,0.000018634533,0.76564765,0.0011457145,0.22136742,0.011546895,0.000014732333],"about_ca_topic_score_codex":0.0012972394,"about_ca_topic_score_gemma":0.0029835338,"teacher_disagreement_score":0.0039305487,"about_ca_system_score_codex":0.0009563139,"about_ca_system_score_gemma":0.001084854,"threshold_uncertainty_score":0.013148963},"labels":[],"label_agreement":null},{"id":"W3016358231","doi":"10.48550/arxiv.2004.08532","title":"DGL-KE: Training Knowledge Graph Embeddings at Scale","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":36,"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":"Knowledge graph; Graph; Training (meteorology); Scale (ratio); Computer science; Mathematics; Artificial intelligence; Theoretical computer science; Physics; Geography; Cartography","score_opus":0.1089707518289814,"score_gpt":0.20839990224725885,"score_spread":0.09942915041827745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016358231","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.06336527,0.0013103695,0.8147906,0.0015674785,0.00040980105,0.00028463238,0.0095106885,0.097818606,0.010942633],"genre_scores_gemma":[0.26720244,0.00063472043,0.6844902,0.00095423043,0.00009148533,0.00047959143,0.03369568,0.004302141,0.008149556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932647,0.0001305142,0.000034707085,0.00025056014,0.00017478627,0.000083036495],"domain_scores_gemma":[0.997985,0.0009311428,0.000109010696,0.000588019,0.00029242827,0.000094363204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077966653,0.0019475835,0.00092222187,0.001511127,0.0006563459,0.0014394526,0.0028478738,0.0021978198,0.009632461],"category_scores_gemma":[0.007836905,0.0009736792,0.0014425108,0.001788416,0.0007646752,0.0045661246,0.0023569714,0.0027976446,0.005429896],"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.00032077156,0.00034052564,0.0042231656,0.00088144455,0.00031203747,0.0003695412,0.0002659069,0.41019404,0.0053771054,0.017398462,0.1410942,0.4192228],"study_design_scores_gemma":[0.00005476622,0.000036813737,0.00040000209,0.000029667628,0.000023285056,0.00007172822,0.00008736798,0.9625964,0.0024999487,0.025119118,0.0090637,0.00001711136],"about_ca_topic_score_codex":0.008361597,"about_ca_topic_score_gemma":0.020222586,"teacher_disagreement_score":0.009632461,"about_ca_system_score_codex":0.0012753833,"about_ca_system_score_gemma":0.0015548007,"threshold_uncertainty_score":0.03222382},"labels":[],"label_agreement":null},{"id":"W3021155905","doi":"10.3760/cma.j.cn121430-20200225-00200","title":"[Visualization analysis on treatment of coronavirus based on knowledge graph].","year":2020,"lang":"en","type":"article","venue":"PubMed","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":5,"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":"China; Visualization; Subject (documents); Web of science; Field (mathematics); Chinese science; Data science; Bibliometrics; Medicine; Library science; Computer science; Data mining; Geography; Meta-analysis","score_opus":0.05919560618358911,"score_gpt":0.2915829110737246,"score_spread":0.23238730489013548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021155905","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.16025081,0.022019083,0.43089142,0.0105081685,0.0016139661,0.0023753205,0.20241217,0.089770645,0.080158375],"genre_scores_gemma":[0.39219463,0.012770284,0.43363395,0.0008312889,0.00040660487,0.0014092976,0.1413834,0.0024066176,0.014963943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991111,0.00022183078,0.00011461267,0.00013231173,0.00035447188,0.00006565959],"domain_scores_gemma":[0.99717367,0.0012797308,0.00046088302,0.00022020434,0.0007686803,0.00009691556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014697138,0.0009214077,0.0005117264,0.013664436,0.00066317065,0.0024441935,0.0007334044,0.000669419,0.010425607],"category_scores_gemma":[0.007649185,0.00027754364,0.0014207946,0.0118973795,0.00023547998,0.003381139,0.0010756365,0.00054595276,0.001881088],"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.00042915568,0.00017692697,0.028434936,0.008447853,0.00065566076,0.0010972427,0.004362468,0.009194472,0.009565489,0.024672335,0.21159583,0.7013677],"study_design_scores_gemma":[0.00023730483,0.0004234093,0.09643146,0.0034678944,0.0012597735,0.0024431255,0.005974498,0.16266584,0.016678376,0.11116058,0.5988529,0.0004048288],"about_ca_topic_score_codex":0.007387514,"about_ca_topic_score_gemma":0.008167277,"teacher_disagreement_score":0.013664436,"about_ca_system_score_codex":0.0007900752,"about_ca_system_score_gemma":0.0014707736,"threshold_uncertainty_score":0.03487712},"labels":[],"label_agreement":null},{"id":"W3021610249","doi":"10.1007/978-3-030-47426-3_30","title":"Retrofitting Embeddings for Unsupervised User Identity Linkage","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Neural Networks","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 Saskatchewan","funders":"Key Laboratory of Computer Network and Information Integration; China Scholarship Council; Natural Science Foundation of Jiangsu Province; Government of Jiangsu Province; National Social Science Fund of China; Ministry of Education of the People's Republic of China; National Natural Science Foundation of China; National Research Foundation","keywords":"Computer science; Discriminative model; Embedding; Retrofitting; Leverage (statistics); Matching (statistics); Identity (music); User modeling; Linkage (software); Machine learning; Data mining; Information retrieval; Artificial intelligence; User interface","score_opus":0.020793468286241075,"score_gpt":0.26716948257962636,"score_spread":0.2463760142933853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021610249","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.027550383,0.00054932,0.96472645,0.00020651349,0.00018162256,0.000057392026,0.0004823332,0.0041115223,0.0021344803],"genre_scores_gemma":[0.5140886,0.0006314839,0.45841825,0.00030272096,0.00020799397,0.00020867457,0.0045558037,0.0013257574,0.020260705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982173,0.0006342244,0.000082411876,0.00052715815,0.0003759259,0.00016291866],"domain_scores_gemma":[0.9967644,0.0012610552,0.00016973504,0.0011425479,0.00055264344,0.00010963215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016836188,0.0012439857,0.0014223271,0.0017528855,0.0007290043,0.0013575339,0.0024040157,0.0021391138,0.005332724],"category_scores_gemma":[0.007947282,0.0007314553,0.0011943505,0.0023133284,0.00079113035,0.0037142267,0.0032716838,0.0027405377,0.0055878814],"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.0003485311,0.00039205616,0.0028242047,0.00015170813,0.00014401431,0.00011561737,0.0002559678,0.09565325,0.004521243,0.015623374,0.015516826,0.8644532],"study_design_scores_gemma":[0.000007531332,0.000052336665,0.00039966078,0.000021832071,0.00001785086,0.00009702194,0.000078739315,0.97614735,0.0029646202,0.017693687,0.002505352,0.000014002805],"about_ca_topic_score_codex":0.0026764353,"about_ca_topic_score_gemma":0.0048637623,"teacher_disagreement_score":0.005332724,"about_ca_system_score_codex":0.0005608545,"about_ca_system_score_gemma":0.0007208102,"threshold_uncertainty_score":0.01783979},"labels":[],"label_agreement":null},{"id":"W3021719071","doi":"","title":"Image Classification with Hierarchical Multigraph Networks.","year":2019,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","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":"University of Guelph","funders":"","keywords":"MNIST database; Computer science; Artificial intelligence; Image translation; Convolutional neural network; Pascal (unit); Multigraph; Contextual image classification; Pattern recognition (psychology); Machine learning; Graph; Image (mathematics); Deep learning; Theoretical computer science","score_opus":0.03022378203750923,"score_gpt":0.16900810425459303,"score_spread":0.1387843222170838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021719071","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.02740556,0.0039283866,0.95050436,0.001750502,0.00021761822,0.0002298511,0.0017531943,0.007471555,0.006738947],"genre_scores_gemma":[0.48677516,0.0024084614,0.48848793,0.0012143478,0.00030957258,0.0002675882,0.008210457,0.0006139899,0.011712477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999388,0.00015618712,0.000025930787,0.00022640379,0.0001405202,0.00006295694],"domain_scores_gemma":[0.99891365,0.0003701264,0.00015546402,0.00034348216,0.00014324066,0.00007393817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094538345,0.0012824325,0.00079165073,0.0027882103,0.0005962379,0.0013658018,0.0019875104,0.0016646247,0.003345289],"category_scores_gemma":[0.0035830678,0.00061316264,0.0015416889,0.002228518,0.0007796175,0.00359064,0.001416005,0.0018094908,0.0016353521],"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.00015209972,0.00017315638,0.0030967593,0.00045230763,0.0003650592,0.00014371694,0.00014885922,0.4462427,0.0046546888,0.060491752,0.036827423,0.4472516],"study_design_scores_gemma":[0.000006795971,0.00001647596,0.00036840717,0.000020263284,0.000021452277,0.000029039185,0.000015886355,0.94210356,0.00092288863,0.05285703,0.0036317653,0.000006406748],"about_ca_topic_score_codex":0.013610487,"about_ca_topic_score_gemma":0.027064653,"teacher_disagreement_score":0.013610487,"about_ca_system_score_codex":0.002500551,"about_ca_system_score_gemma":0.0009831543,"threshold_uncertainty_score":0.027062535},"labels":[],"label_agreement":null},{"id":"W3030885106","doi":"10.1109/tkde.2020.2997938","title":"SCHAIN-IRAM: An Efficient and Effective Semi-Supervised Clustering Algorithm for Attributed Heterogeneous Information Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Advanced Graph Neural Networks","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":"Simon Fraser University","funders":"","keywords":"Cluster analysis; Computer science; Set (abstract data type); Algorithm; Theoretical computer science; Artificial intelligence; Data mining; Information retrieval; Programming language","score_opus":0.019994299086997888,"score_gpt":0.25005122190912826,"score_spread":0.23005692282213036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030885106","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.0028873992,0.000191822,0.99424803,0.00016704881,0.000039547278,0.0001394021,0.00013282434,0.0016549478,0.0005388787],"genre_scores_gemma":[0.053496603,0.00017861502,0.94133043,0.00027526222,0.00008088389,0.00039808004,0.0011703426,0.00040664073,0.0026631323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99623185,0.0014122565,0.00023895141,0.0011224968,0.0007659217,0.00022859668],"domain_scores_gemma":[0.99631554,0.0014914923,0.0003533252,0.0007091831,0.00096258405,0.00016782041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054349457,0.0025506602,0.0031141972,0.0051279794,0.0026683041,0.00246855,0.0071666557,0.00399046,0.002673245],"category_scores_gemma":[0.011299804,0.001576167,0.002924793,0.004204264,0.0018265009,0.004132398,0.0034507825,0.0037558957,0.0027528796],"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.00029386763,0.00023848061,0.0015556675,0.00031628067,0.00043778986,0.0001709206,0.0004581018,0.4910497,0.0036166867,0.021437451,0.016528767,0.46389627],"study_design_scores_gemma":[0.000017555914,0.000019364878,0.00009559173,0.000010962097,0.000015057725,0.00002759008,0.000033309236,0.9873504,0.0009337806,0.010185765,0.0012972788,0.000013406586],"about_ca_topic_score_codex":0.01407791,"about_ca_topic_score_gemma":0.02209714,"teacher_disagreement_score":0.01407791,"about_ca_system_score_codex":0.0027670588,"about_ca_system_score_gemma":0.0039293035,"threshold_uncertainty_score":0.028743088},"labels":[],"label_agreement":null},{"id":"W3030895774","doi":"10.1145/3391274.3393637","title":"What is the schema of your knowledge graph?","year":2020,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Knowledge graph; Schema (genetic algorithms); Cluster analysis; Graph; Clustering coefficient; Information retrieval; Theoretical computer science; Artificial intelligence","score_opus":0.04264118021735799,"score_gpt":0.2856134814438224,"score_spread":0.24297230122646443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030895774","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.1152475,0.0027922962,0.8018828,0.022795515,0.0005599522,0.00044359211,0.023908347,0.002515467,0.029854463],"genre_scores_gemma":[0.5380988,0.0036937655,0.4271682,0.0022706897,0.0001690372,0.00026356455,0.022395283,0.00047579632,0.0054648556],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987078,0.0003804884,0.00010647623,0.0004536377,0.00027069173,0.00008092787],"domain_scores_gemma":[0.99616843,0.0012355837,0.00044937513,0.00074337464,0.0011250444,0.0002782267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016167808,0.00031924527,0.0004401644,0.0026100483,0.00062280067,0.0030193473,0.00094987574,0.0011589836,0.002970102],"category_scores_gemma":[0.01110838,0.00025580416,0.0005800315,0.0026543734,0.001304893,0.007705142,0.0007455837,0.0011567915,0.0016063076],"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.00032993846,0.0002674587,0.05166743,0.0013081103,0.00025252666,0.0006981733,0.0036073783,0.01027811,0.010416358,0.34461662,0.06496164,0.5115963],"study_design_scores_gemma":[0.000045667854,0.00009578362,0.016737977,0.00086299604,0.00017355621,0.0016819519,0.005507484,0.08542281,0.008187055,0.7240264,0.15714785,0.00011048613],"about_ca_topic_score_codex":0.0057479627,"about_ca_topic_score_gemma":0.008319775,"teacher_disagreement_score":0.0057479627,"about_ca_system_score_codex":0.0010215918,"about_ca_system_score_gemma":0.0015009714,"threshold_uncertainty_score":0.011429012},"labels":[],"label_agreement":null},{"id":"W3034116706","doi":"10.48550/arxiv.1909.03790","title":"Graph Random Neural Features for Distance-Preserving Graph Representations","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","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":"Graph embedding; Strength of a graph; Voltage graph; Null graph; Line graph; Embedding; Graph property; Graph isomorphism; Butterfly graph; Random geometric graph; Mathematics; Complement graph; Discrete mathematics; Random graph; Computer science; Theoretical computer science; Graph; Artificial intelligence","score_opus":0.05277552369281031,"score_gpt":0.21709079579755056,"score_spread":0.16431527210474026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034116706","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.015869904,0.00036301135,0.9812199,0.00023881086,0.00005455719,0.000026953527,0.0002339965,0.00044178372,0.001551124],"genre_scores_gemma":[0.58578694,0.00074465276,0.40654314,0.00026709176,0.00015604038,0.0001845861,0.0012833377,0.0002627561,0.004771567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957865,0.0001158299,0.000020155167,0.0001249136,0.00012742005,0.0000330671],"domain_scores_gemma":[0.99908614,0.00040729382,0.0001510779,0.00018394693,0.0001328341,0.000038747763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005373478,0.00051306345,0.00047358722,0.0009742472,0.00024994285,0.00088946323,0.0012122177,0.00096153945,0.002176233],"category_scores_gemma":[0.004564638,0.00022698665,0.000426062,0.0011013834,0.0007416169,0.0027697023,0.0011682427,0.0015062899,0.00069619087],"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.00015846005,0.00010734927,0.0010516176,0.00031285977,0.000054812168,0.00018117651,0.00013385939,0.37548047,0.009567844,0.28618935,0.00751266,0.31924954],"study_design_scores_gemma":[0.0000066827715,0.00003603203,0.00021770669,0.000016993208,0.00000795528,0.00006512312,0.000012718201,0.8855689,0.0018179627,0.109737135,0.0025026614,0.00001012194],"about_ca_topic_score_codex":0.0011929247,"about_ca_topic_score_gemma":0.0015205678,"teacher_disagreement_score":0.002176233,"about_ca_system_score_codex":0.0006904395,"about_ca_system_score_gemma":0.0003415064,"threshold_uncertainty_score":0.007280171},"labels":[],"label_agreement":null},{"id":"W3034239155","doi":"10.60692/6b5x9-hbn81","title":"Inductive Relation Prediction by Subgraph Reasoning","year":2019,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":113,"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":"Computer science; Embedding; Inductive bias; Knowledge graph; Artificial intelligence; Relation (database); Theoretical computer science; Holy Grail; Graph; Set (abstract data type); Machine learning; Multi-task learning; Data mining","score_opus":0.008794174846235568,"score_gpt":0.20663636552344866,"score_spread":0.1978421906772131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034239155","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.03962722,0.00041747984,0.9475805,0.00078800577,0.00007121673,0.00011871941,0.0008952758,0.0045203795,0.005981181],"genre_scores_gemma":[0.67322993,0.00035624584,0.31623712,0.00053208886,0.00010013622,0.00014233572,0.0038079498,0.00031326327,0.0052808733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893004,0.00029467477,0.000041365238,0.0003955336,0.00026144707,0.00007694208],"domain_scores_gemma":[0.9967423,0.0020074847,0.00021030837,0.00063942146,0.00032027424,0.00008025792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009507925,0.00090256444,0.00065155723,0.0018328854,0.00047137382,0.0010729837,0.0022289706,0.000902098,0.004967524],"category_scores_gemma":[0.00592732,0.0003945397,0.0010424124,0.0012899025,0.0010496775,0.0038008273,0.0015450529,0.0017022145,0.0014266178],"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.00020057842,0.00028855732,0.0062792134,0.0002936207,0.000112599744,0.0003254222,0.00025682655,0.3625915,0.0068578385,0.06639834,0.016078725,0.54031676],"study_design_scores_gemma":[0.000009888141,0.000018438313,0.00034959838,0.000020815702,0.000017509865,0.00004373955,0.000026066198,0.9248924,0.002678776,0.069972225,0.0019627202,0.000007843469],"about_ca_topic_score_codex":0.0040374906,"about_ca_topic_score_gemma":0.008212322,"teacher_disagreement_score":0.004967524,"about_ca_system_score_codex":0.0009268497,"about_ca_system_score_gemma":0.0009559974,"threshold_uncertainty_score":0.016617954},"labels":[],"label_agreement":null},{"id":"W3034674099","doi":"10.1609/aaai.v35i11.17168","title":"Implicit Kernel Attention","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","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":"Kootenay Association for Science & Technology","funders":"National Research Foundation of Korea; National Research Foundation","keywords":"Computer science; Theoretical computer science; Transformer; Artificial intelligence; Machine learning","score_opus":0.057908882148459066,"score_gpt":0.29487738774555106,"score_spread":0.23696850559709198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034674099","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.026081026,0.0012529623,0.96082217,0.00054402306,0.00016071263,0.00007935143,0.00026437594,0.0019696727,0.008825727],"genre_scores_gemma":[0.89350194,0.0009566874,0.08803235,0.00059563573,0.00022014198,0.00011847162,0.0007494948,0.00030220175,0.0155231515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992055,0.0001994478,0.00003216043,0.00025922677,0.00016659783,0.00013702997],"domain_scores_gemma":[0.99858105,0.0006187739,0.000105010884,0.0003664719,0.000258903,0.0000697763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086146774,0.0011052986,0.0009713082,0.00074963074,0.0004060798,0.0011172275,0.0018492119,0.0013963929,0.0065303063],"category_scores_gemma":[0.005120376,0.00036576134,0.00087834615,0.0009765299,0.0007641165,0.0031324464,0.0021629496,0.001482932,0.0011131373],"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.00031308326,0.00029614803,0.0030744844,0.00032024566,0.00024084612,0.00021314657,0.00029361396,0.18222673,0.014376279,0.117639594,0.021014346,0.6599915],"study_design_scores_gemma":[0.000017384586,0.000071982104,0.000983336,0.000019797097,0.0000572374,0.000101972015,0.000031056286,0.92304957,0.0032807924,0.06772166,0.004645033,0.000020310881],"about_ca_topic_score_codex":0.0066444515,"about_ca_topic_score_gemma":0.007538735,"teacher_disagreement_score":0.0066444515,"about_ca_system_score_codex":0.0013951403,"about_ca_system_score_gemma":0.0011020557,"threshold_uncertainty_score":0.021846056},"labels":[],"label_agreement":null},{"id":"W3035403290","doi":"10.1145/3397271.3401172","title":"DGL-KE","year":2020,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":127,"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":"Computer science; Speedup; Parallel computing; Overhead (engineering); Locality; Computation; Key (lock); Theoretical computer science; Algorithm; Programming language","score_opus":0.022021934113621775,"score_gpt":0.21377063861309278,"score_spread":0.191748704499471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035403290","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.010310109,0.0016357524,0.56954944,0.001309833,0.0005853814,0.00032876633,0.022064134,0.35767528,0.036541194],"genre_scores_gemma":[0.11324436,0.0015705866,0.70418364,0.0018115853,0.00012240557,0.0012537354,0.09426552,0.046600904,0.036947228],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99919504,0.00013636888,0.000053409956,0.0002479114,0.00023800581,0.00012937783],"domain_scores_gemma":[0.9985084,0.0005710907,0.00006256877,0.00042709208,0.00035146347,0.00007931746],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00082439336,0.0026398897,0.0012879642,0.001407398,0.00082835497,0.0023997095,0.0048588095,0.0020868748,0.054721586],"category_scores_gemma":[0.005643294,0.0012333356,0.0023176067,0.0018854252,0.00083845865,0.004279052,0.003490551,0.0036721495,0.036642607],"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.0004651475,0.0003170468,0.0021109784,0.002301568,0.00038142776,0.00040107738,0.00031132,0.099074416,0.004951967,0.04763897,0.5294619,0.31258422],"study_design_scores_gemma":[0.00031245503,0.000103205,0.00074807677,0.00016777549,0.00008248971,0.0002868192,0.00017579805,0.67107046,0.008322073,0.107470706,0.21116726,0.00009284106],"about_ca_topic_score_codex":0.00632864,"about_ca_topic_score_gemma":0.017380565,"teacher_disagreement_score":0.9452784,"about_ca_system_score_codex":0.0014705089,"about_ca_system_score_gemma":0.002156218,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W3035691406","doi":"","title":"Graph Representation Learning by Maximizing Mutual Information Between Spatial and Spectral Views","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Advanced Graph Neural Networks","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 Toronto","funders":"","keywords":"Computer science; Mutual information; Graph; Representation (politics); Artificial intelligence; Theoretical computer science","score_opus":0.04797287760010207,"score_gpt":0.29932861233777697,"score_spread":0.2513557347376749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035691406","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.021660103,0.0002423229,0.97526914,0.00052884565,0.000041020103,0.00003577748,0.00015944843,0.0006813155,0.0013820151],"genre_scores_gemma":[0.6781766,0.000566071,0.3142166,0.000569475,0.00019484089,0.00018175843,0.0012766813,0.000438745,0.0043792543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989779,0.0003770753,0.000039646613,0.00027455925,0.00024218355,0.000088579334],"domain_scores_gemma":[0.99800533,0.0011012545,0.00018169121,0.00028716694,0.000316938,0.00010763197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012588006,0.0011162817,0.0013522936,0.0017920451,0.0005503194,0.0015760567,0.0018694069,0.0022015832,0.0025489111],"category_scores_gemma":[0.0062387097,0.0006523003,0.0012630137,0.0016674132,0.0009737441,0.0032841815,0.0019249665,0.0017338828,0.0010691044],"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.00047454063,0.00034368903,0.0022919206,0.00032561214,0.00035772004,0.00016690716,0.00022751518,0.46061465,0.017771674,0.06289901,0.015898138,0.43862858],"study_design_scores_gemma":[0.000013792323,0.000044413177,0.00015512518,0.0000097399825,0.000029057317,0.000038444945,0.000020776886,0.9764832,0.0011766755,0.021546517,0.0004718549,0.000010438809],"about_ca_topic_score_codex":0.0026650375,"about_ca_topic_score_gemma":0.0037306054,"teacher_disagreement_score":0.0026650375,"about_ca_system_score_codex":0.0007876941,"about_ca_system_score_gemma":0.0010071995,"threshold_uncertainty_score":0.008526921},"labels":[],"label_agreement":null},{"id":"W3035707368","doi":"10.18653/v1/2020.acl-main.526","title":"ReInceptionE: Relation-Aware Inception Network with Joint Local-Global Structural Information for Knowledge Graph Embedding","year":2020,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Embedding; Relation (database); Computer science; Theoretical computer science; Knowledge graph; Graph; Artificial intelligence; Data mining","score_opus":0.017801494211374645,"score_gpt":0.25499947446314464,"score_spread":0.23719798025177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035707368","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.055352826,0.0022135375,0.9185764,0.0010444395,0.00020080662,0.0002660928,0.003973059,0.011906065,0.0064667305],"genre_scores_gemma":[0.5304282,0.0017602257,0.424656,0.0012040385,0.00011555721,0.00049822003,0.020721603,0.0007925247,0.01982359],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995808,0.00006642602,0.000025319288,0.00019894529,0.000089794805,0.00003877523],"domain_scores_gemma":[0.999315,0.00017995834,0.000064034684,0.0002961705,0.000096126176,0.0000486253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005197374,0.0019538836,0.00094669545,0.0013738176,0.00041505473,0.0009949233,0.0026176486,0.0014335976,0.0039525474],"category_scores_gemma":[0.0027191965,0.0005926992,0.0011412264,0.0014141317,0.0007470463,0.004485771,0.0024314553,0.0025129656,0.001523296],"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.00040508292,0.00046571202,0.004450854,0.00064645574,0.00033838098,0.00038640492,0.00044038772,0.17881899,0.01814546,0.034389492,0.036904253,0.72460854],"study_design_scores_gemma":[0.000034816785,0.00010441425,0.0008646423,0.000048035567,0.000079354366,0.00017450645,0.00007311736,0.9479993,0.0057500866,0.035079878,0.00975872,0.000033126104],"about_ca_topic_score_codex":0.0067408225,"about_ca_topic_score_gemma":0.017025802,"teacher_disagreement_score":0.0067408225,"about_ca_system_score_codex":0.0010752339,"about_ca_system_score_gemma":0.0007981688,"threshold_uncertainty_score":0.013403118},"labels":[],"label_agreement":null},{"id":"W3036233147","doi":"10.1007/978-3-030-50433-5_15","title":"Node Classification in Complex Social Graphs via Knowledge-Graph Embeddings and Convolutional Neural Network","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Neural Networks","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":"University of Windsor","funders":"","keywords":"Computer science; Artificial intelligence; Social network (sociolinguistics); Classifier (UML); Machine learning; Graph; Node (physics); Social network analysis; Embedding; Theoretical computer science; World Wide Web","score_opus":0.032333963428220786,"score_gpt":0.2701564825082692,"score_spread":0.2378225190800484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036233147","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.1989538,0.0015546227,0.7902243,0.0011455518,0.00015362274,0.000113519345,0.0017038641,0.0014927652,0.004657952],"genre_scores_gemma":[0.84743696,0.0008810625,0.13980141,0.0002142702,0.0001627593,0.000087762295,0.0035089923,0.00016961535,0.007737233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964595,0.00008330541,0.000017349765,0.00014614488,0.000060426482,0.00004673776],"domain_scores_gemma":[0.998445,0.0009731789,0.0001685704,0.00017118419,0.00016069476,0.00008141968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061079516,0.0007901889,0.0007552617,0.0016226332,0.00042462122,0.0012473441,0.001260176,0.0013406388,0.0017660687],"category_scores_gemma":[0.0033072913,0.00043468253,0.0007487561,0.0016282628,0.0005473812,0.0034484086,0.0010028277,0.0014475405,0.00077879924],"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.0004018438,0.00041891038,0.013519765,0.00037406734,0.00021547622,0.00024629926,0.00033869408,0.45823556,0.0059590978,0.037768673,0.0182816,0.46424004],"study_design_scores_gemma":[0.0000027860538,0.000008750782,0.00046610614,0.000010307166,0.0000085179945,0.000013395141,0.000022577507,0.980788,0.0004288283,0.017819425,0.0004275793,0.0000036788854],"about_ca_topic_score_codex":0.007866257,"about_ca_topic_score_gemma":0.01371761,"teacher_disagreement_score":0.007866257,"about_ca_system_score_codex":0.0011172801,"about_ca_system_score_gemma":0.00047163517,"threshold_uncertainty_score":0.015640974},"labels":[],"label_agreement":null},{"id":"W3040712421","doi":"10.24963/ijcai.2020/739","title":"Social Network Analysis using RLVECN: Representation Learning via Knowledge-Graph Embeddings and Convolutional Neural-Network","year":2020,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":11,"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 Windsor","funders":"Compute Canada; International Business Machines Corporation","keywords":"Computer science; Artificial intelligence; Graph; Machine learning; Social network (sociolinguistics); Convolutional neural network; Statistical relational learning; Social network analysis; Node (physics); Theoretical computer science; Data mining; Social media; Relational database; World Wide Web","score_opus":0.03336783642512357,"score_gpt":0.30602238947383315,"score_spread":0.27265455304870956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040712421","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.05727526,0.000659052,0.9351226,0.0008170818,0.00012661223,0.000098227545,0.0009306513,0.0025643453,0.0024061599],"genre_scores_gemma":[0.68743944,0.00080449897,0.29861468,0.00045426216,0.00009941348,0.0002622627,0.004759649,0.00027849857,0.007287247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962294,0.00012621432,0.000017712704,0.00011724539,0.000067419925,0.0000483362],"domain_scores_gemma":[0.99909294,0.00039796633,0.00012834197,0.00015973237,0.00016832788,0.000052680683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080860197,0.001066383,0.0006633543,0.0013932522,0.00033695152,0.00096002535,0.0014729812,0.0010854567,0.0016206161],"category_scores_gemma":[0.0031164552,0.00040936976,0.00084411696,0.0013100691,0.0006652308,0.0020289265,0.0011342921,0.0017694833,0.000725708],"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.0001477332,0.0002502402,0.0049037426,0.0001740807,0.00019061477,0.00014524267,0.00019544405,0.5862294,0.004685788,0.031015018,0.011794825,0.36026794],"study_design_scores_gemma":[0.0000025312904,0.000012302001,0.00017799767,0.0000073555416,0.000005404388,0.000010691284,0.000012226538,0.9908832,0.0004962863,0.007763542,0.00062432844,0.000004191949],"about_ca_topic_score_codex":0.015537081,"about_ca_topic_score_gemma":0.023180664,"teacher_disagreement_score":0.015537081,"about_ca_system_score_codex":0.0013572805,"about_ca_system_score_gemma":0.00083836116,"threshold_uncertainty_score":0.030893266},"labels":[],"label_agreement":null},{"id":"W3043002554","doi":"10.1109/cbi49978.2020.00009","title":"Competitive Analysis with Graph Embedding on Patent Networks","year":2020,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"National Research Council Canada","funders":"National Research Council Canada","keywords":"Latent Dirichlet allocation; Computer science; Competitor analysis; Embedding; Graph; Topic model; Theoretical computer science; Competitive advantage; Latent semantic analysis; Network analysis; Data science; Data mining; Artificial intelligence; Business; Marketing","score_opus":0.026650532757348272,"score_gpt":0.23543933648317256,"score_spread":0.20878880372582428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043002554","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.2185187,0.002345792,0.7622885,0.0020206955,0.00013439331,0.00021612663,0.0033938745,0.0018578462,0.009224033],"genre_scores_gemma":[0.88143927,0.00087374396,0.1072385,0.00023523654,0.00017059056,0.00022896873,0.00472978,0.00014597758,0.0049379435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990952,0.00031965395,0.000042749,0.00025739477,0.00019520611,0.00008977028],"domain_scores_gemma":[0.99628085,0.0024499083,0.00040053888,0.00026793018,0.0004876829,0.00011307268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010194848,0.0011176139,0.00063287746,0.004415407,0.00071010034,0.0012505137,0.00078911363,0.001252183,0.0026530619],"category_scores_gemma":[0.0075811506,0.00034506974,0.001066979,0.0035575987,0.0007360244,0.0031198943,0.0010526432,0.0012760364,0.0007078669],"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.0002378885,0.0003009558,0.011454161,0.000344218,0.0002565084,0.0004927839,0.0004910479,0.61110103,0.0033933541,0.07428198,0.01289248,0.2847535],"study_design_scores_gemma":[0.000010297019,0.000029213097,0.0010075804,0.000012190067,0.0000171638,0.0000409674,0.000055646367,0.9623694,0.00046476175,0.03423999,0.0017433411,0.000009509827],"about_ca_topic_score_codex":0.010222207,"about_ca_topic_score_gemma":0.012887468,"teacher_disagreement_score":0.010222207,"about_ca_system_score_codex":0.001296636,"about_ca_system_score_gemma":0.0007069306,"threshold_uncertainty_score":0.020325422},"labels":[],"label_agreement":null},{"id":"W3043614790","doi":"10.48550/arxiv.2007.06704","title":"Node Copying for Protection Against Graph Neural Network Topology Attacks","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","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":"Computer science; Copying; Adversarial system; Graph; Theoretical computer science; Artificial intelligence; Computation; Network topology; Machine learning; Node (physics); Topology (electrical circuits); Algorithm; Computer network; Mathematics","score_opus":0.10061097543101094,"score_gpt":0.21523857364977123,"score_spread":0.11462759821876028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043614790","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.15353599,0.0010074156,0.830611,0.0013948033,0.0002521928,0.00017077454,0.00024685898,0.0073920493,0.005388933],"genre_scores_gemma":[0.9251958,0.0002472415,0.07103613,0.00023069629,0.000072066534,0.00007492277,0.0002987545,0.0002447832,0.0025996054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851054,0.00040057214,0.00009549721,0.0003587632,0.00044740184,0.00018725086],"domain_scores_gemma":[0.9903044,0.002636068,0.0009891957,0.0052092234,0.0005465369,0.0003145734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00206095,0.0008640594,0.0012466914,0.0010375867,0.00092574593,0.0012289803,0.0025959183,0.0015814232,0.002177706],"category_scores_gemma":[0.014185511,0.00043463608,0.00082848995,0.000765769,0.0016085482,0.0038481955,0.0028343094,0.0019988061,0.00074734684],"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.00051759847,0.0001913935,0.00425878,0.00016328965,0.00012628279,0.00042746222,0.0003606823,0.62454104,0.016875103,0.04209543,0.008496599,0.3019463],"study_design_scores_gemma":[0.000016873126,0.00005757045,0.00028411503,0.0000125268625,0.000017548002,0.00013197513,0.000026641093,0.9682952,0.009069312,0.020551022,0.0015270808,0.000010042892],"about_ca_topic_score_codex":0.0012744186,"about_ca_topic_score_gemma":0.0018233793,"teacher_disagreement_score":0.0025959183,"about_ca_system_score_codex":0.0010073152,"about_ca_system_score_gemma":0.0011229663,"threshold_uncertainty_score":0.010899484},"labels":[],"label_agreement":null},{"id":"W3044604502","doi":"10.1145/3480243","title":"Time-Aware Graph Embedding: A Temporal Smoothness and Task-Oriented Approach","year":2021,"lang":"en","type":"preprint","venue":"ACM Transactions on Knowledge Discovery from Data","topic":"Advanced Graph Neural Networks","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":"Embedding; Computer science; Granularity; Theoretical computer science; Graph embedding; Graph; Smoothing; Artificial intelligence; Machine learning","score_opus":0.038241671914906405,"score_gpt":0.2946700430901839,"score_spread":0.2564283711752775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044604502","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.012272867,0.00029941532,0.9859934,0.00018845533,0.000032403044,0.00004306302,0.00013002196,0.0005526141,0.0004877389],"genre_scores_gemma":[0.46358025,0.000868818,0.5289403,0.00026141937,0.00019716563,0.0002121404,0.0016109612,0.0003725995,0.0039562974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895597,0.00025442563,0.00007038875,0.00040705362,0.00023727246,0.00007498383],"domain_scores_gemma":[0.99708384,0.0012929261,0.0003649219,0.0006855264,0.00042015134,0.00015258849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012793861,0.001256676,0.0011496893,0.0019089617,0.0004874457,0.0010085703,0.0022253066,0.0014588346,0.0013754691],"category_scores_gemma":[0.0061427276,0.00051068637,0.0011076302,0.0026215306,0.000873297,0.0039623603,0.002074467,0.0020947272,0.00046968582],"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.0003223035,0.0003286632,0.0035123534,0.00030249616,0.00017521167,0.00019481343,0.00041673606,0.43508935,0.013710253,0.035510514,0.0056475555,0.50478965],"study_design_scores_gemma":[0.000012056995,0.000055889817,0.00044089725,0.0000099143335,0.0000296135,0.0000557201,0.000036930556,0.97500086,0.0014535381,0.021338977,0.0015486577,0.000016985228],"about_ca_topic_score_codex":0.0042020283,"about_ca_topic_score_gemma":0.006217894,"teacher_disagreement_score":0.0042020283,"about_ca_system_score_codex":0.00070941885,"about_ca_system_score_gemma":0.0010698799,"threshold_uncertainty_score":0.008355141},"labels":[],"label_agreement":null},{"id":"W3046554155","doi":"10.1145/3400903.3400928","title":"Node Classification and Link Prediction in Social Graphs using RLVECN","year":2020,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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 Windsor","funders":"","keywords":"Computer science; Node (physics); Artificial intelligence; Social network (sociolinguistics); Machine learning; Link (geometry); Context (archaeology); Graph; Enhanced Data Rates for GSM Evolution; Social network analysis; Feature (linguistics); Link analysis; Theoretical computer science; Social media; World Wide Web","score_opus":0.06589696179850675,"score_gpt":0.2793493648002963,"score_spread":0.21345240300178958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046554155","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.40041515,0.0006770593,0.58946055,0.0013272628,0.0001899674,0.00011501256,0.0012022756,0.0022001858,0.0044125104],"genre_scores_gemma":[0.93551767,0.00015807778,0.05931836,0.00016563185,0.00004423465,0.000070234004,0.0014477223,0.000072903764,0.0032051485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996784,0.000111422756,0.000014432967,0.00009303179,0.00005384955,0.000048934293],"domain_scores_gemma":[0.99888116,0.0005793754,0.0001219111,0.00013999188,0.00021900848,0.00005853611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008284154,0.000632227,0.00044055778,0.0011010771,0.00028976912,0.0006309556,0.0009833561,0.00078312674,0.0012205836],"category_scores_gemma":[0.0030929102,0.00024328505,0.00043542942,0.0009123842,0.0005309329,0.0014613611,0.0006397783,0.0009662235,0.00043955204],"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.00019636712,0.00020373377,0.009160879,0.00007877516,0.00007818054,0.00010093134,0.00014286462,0.7587267,0.0023729187,0.010230484,0.006788843,0.21191932],"study_design_scores_gemma":[0.0000020263215,0.0000072828807,0.0002060044,0.0000033247659,0.00000229763,0.0000040605446,0.0000101652195,0.9963529,0.00027852255,0.0029508276,0.00018096638,0.0000016798025],"about_ca_topic_score_codex":0.014998121,"about_ca_topic_score_gemma":0.024783397,"teacher_disagreement_score":0.014998121,"about_ca_system_score_codex":0.0010500087,"about_ca_system_score_gemma":0.0006291416,"threshold_uncertainty_score":0.029821634},"labels":[],"label_agreement":null},{"id":"W3047456059","doi":"10.1109/infocom41043.2020.9155370","title":"Guardian: Evaluating Trust in Online Social Networks with Graph Convolutional Networks","year":2020,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":66,"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; Guardian; Scalability; Social graph; Graph; Social network (sociolinguistics); Viral marketing; Data science; Social media; Artificial intelligence; Theoretical computer science; World Wide Web","score_opus":0.03636358331498197,"score_gpt":0.2838109764218088,"score_spread":0.24744739310682684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047456059","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.29755217,0.0016880583,0.68462217,0.00087119645,0.00018888224,0.00034748254,0.0016404531,0.008776774,0.004312727],"genre_scores_gemma":[0.9096962,0.00029154948,0.0842591,0.00021404307,0.00003600487,0.00009001565,0.0020878718,0.00013835629,0.0031868399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993585,0.00017229069,0.000035833596,0.00018868712,0.00014108514,0.00010358199],"domain_scores_gemma":[0.9988011,0.0004856805,0.00017699416,0.00017387065,0.00026949498,0.00009288874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013749715,0.001632586,0.0007491637,0.0012243295,0.00047707878,0.00087219465,0.0013846265,0.0014069973,0.0014133838],"category_scores_gemma":[0.00565957,0.00047198462,0.00065016275,0.0006963946,0.00062594085,0.0021509072,0.0011999535,0.0014256721,0.00046558084],"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.000633164,0.00040278226,0.022189613,0.00022054401,0.00037162987,0.00026716362,0.00021388278,0.65275633,0.0056712143,0.005574025,0.008794532,0.30290514],"study_design_scores_gemma":[0.0000054740503,0.000026380974,0.00052739686,0.000004647805,0.000011332635,0.000014616274,0.000009177369,0.9966299,0.00080754457,0.0017698127,0.00018939313,0.0000042846013],"about_ca_topic_score_codex":0.032213297,"about_ca_topic_score_gemma":0.055521373,"teacher_disagreement_score":0.032213297,"about_ca_system_score_codex":0.0022189335,"about_ca_system_score_gemma":0.0011171704,"threshold_uncertainty_score":0.06405157},"labels":[],"label_agreement":null},{"id":"W3070904253","doi":"10.48550/arxiv.2008.08838","title":"Training Matters: Unlocking Potentials of Deeper Graph Convolutional Neural Networks","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","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":"Computer science; Graph; Training (meteorology); Perspective (graphical); Expressive power; Convolutional neural network; Artificial intelligence; Machine learning; Operator (biology); Limit (mathematics); Risk analysis (engineering); Theoretical computer science; Mathematics; Business","score_opus":0.10437881252635828,"score_gpt":0.20044822116092553,"score_spread":0.09606940863456725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3070904253","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.14333043,0.0016840844,0.84138453,0.0037014878,0.00013867281,0.000046750618,0.00010522601,0.0015817303,0.008027068],"genre_scores_gemma":[0.8723007,0.0010287357,0.122089155,0.00068490737,0.00014086577,0.00004773608,0.00017771254,0.00047517632,0.0030550535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994553,0.0002261178,0.00002124868,0.00011750476,0.00011647697,0.000063371415],"domain_scores_gemma":[0.9967585,0.0020722088,0.00020391836,0.0006476073,0.00018500519,0.00013282096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017437132,0.0010081255,0.00053467223,0.00045462916,0.00040965006,0.001210834,0.0013934757,0.0012775084,0.002691609],"category_scores_gemma":[0.0116023915,0.00047693076,0.00040479877,0.00043346535,0.0018337134,0.0057484503,0.0025892782,0.0027982807,0.00060222583],"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.0006308072,0.00019047075,0.003978309,0.0003916429,0.0000937596,0.00031007963,0.00068793085,0.4400317,0.03390168,0.14363319,0.00486437,0.37128603],"study_design_scores_gemma":[0.000017985563,0.00010551386,0.0004300584,0.00004961978,0.000020657042,0.000064479034,0.00005302833,0.8421603,0.005503515,0.14887494,0.0027072022,0.000012721181],"about_ca_topic_score_codex":0.001677506,"about_ca_topic_score_gemma":0.0031224475,"teacher_disagreement_score":0.002691609,"about_ca_system_score_codex":0.00065964164,"about_ca_system_score_gemma":0.00064695545,"threshold_uncertainty_score":0.009221792},"labels":[],"label_agreement":null},{"id":"W3080134346","doi":"10.1145/3394486.3406469","title":"Recent Advances on Graph Analytics and Its Applications in Healthcare","year":2020,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":15,"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":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Science Foundation; Amazon Web Services; Research Grants Council, University Grants Committee; Office of Academic Research, U.S. Naval Academy; Google","keywords":"Interpretability; Computer science; Data science; Inference; Graph; Analytics; Health care; Data mining; Machine learning; Theoretical computer science; Artificial intelligence","score_opus":0.03631693065387832,"score_gpt":0.30041957086105675,"score_spread":0.26410264020717844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080134346","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.003782925,0.61781806,0.3182462,0.015669249,0.005084649,0.00013032937,0.0011457468,0.0018443362,0.036278475],"genre_scores_gemma":[0.040444296,0.7490848,0.18104342,0.004545693,0.009676811,0.00013244523,0.0024774643,0.00048369475,0.012111436],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991204,0.00025226266,0.000068376095,0.00020743813,0.00029196162,0.000059633683],"domain_scores_gemma":[0.99560803,0.0032797132,0.0001336712,0.0002533921,0.000585595,0.00013958533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014339512,0.0010897648,0.00077133,0.0029539792,0.00036151632,0.0021468073,0.0011007383,0.0012981398,0.009187316],"category_scores_gemma":[0.0054952623,0.0005877589,0.0012814361,0.0047835507,0.0008182742,0.003712856,0.0011555011,0.0028288849,0.0032737],"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.000065815955,0.00007313704,0.00077626074,0.0037554023,0.00012061468,0.00019264175,0.0002830044,0.010641469,0.0017375366,0.12948611,0.10587803,0.74698997],"study_design_scores_gemma":[0.000015011718,0.00007605505,0.0010404366,0.0012037319,0.00007424486,0.000651665,0.00014979577,0.033470728,0.0013290504,0.18452448,0.7773913,0.00007348394],"about_ca_topic_score_codex":0.001867725,"about_ca_topic_score_gemma":0.0017561452,"teacher_disagreement_score":0.009187316,"about_ca_system_score_codex":0.00093925715,"about_ca_system_score_gemma":0.00088882534,"threshold_uncertainty_score":0.030734599},"labels":[],"label_agreement":null},{"id":"W3081520483","doi":"10.1145/3406116","title":"Pairwise Link Prediction Model for Out of Vocabulary Knowledge Base Entities","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":20,"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","funders":"Foundation for Innovative Research Groups of the National Natural Science Foundation of China","keywords":"Computer science; Pairwise comparison; Discriminative model; Relation (database); Artificial intelligence; Benchmark (surveying); Dependency (UML); Word (group theory); Machine learning; A priori and a posteriori; Representation (politics); Theoretical computer science; Data mining; Mathematics","score_opus":0.041519174015214017,"score_gpt":0.25393608106521703,"score_spread":0.21241690705000302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081520483","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.08093785,0.00150821,0.90516436,0.0009312847,0.00017809986,0.00014439151,0.0031969452,0.0033244996,0.0046142796],"genre_scores_gemma":[0.84771717,0.00094813626,0.12736431,0.000432151,0.0002169756,0.00038593012,0.008175395,0.00029325808,0.014466627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936134,0.00009229535,0.000031488908,0.00034172036,0.000107499094,0.000065792075],"domain_scores_gemma":[0.99852717,0.0008164462,0.00016106965,0.00022205364,0.00021970515,0.000053526463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010151694,0.0010637013,0.00094663945,0.001630437,0.00049995806,0.0009425944,0.0030236694,0.0016531346,0.004223933],"category_scores_gemma":[0.004388866,0.0004932257,0.00082281313,0.0022859408,0.00049447076,0.003932427,0.0012224232,0.002488978,0.002176371],"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.00033452295,0.00035932622,0.0067804535,0.00020440097,0.00017087154,0.00039297921,0.00022508395,0.58941305,0.0037529522,0.023660006,0.0141874105,0.36051902],"study_design_scores_gemma":[0.0000073246865,0.000022217684,0.0004037661,0.000008998639,0.000018985063,0.000036258498,0.000011254244,0.9867379,0.00057783624,0.011126592,0.0010413975,0.000007495012],"about_ca_topic_score_codex":0.012760857,"about_ca_topic_score_gemma":0.021513892,"teacher_disagreement_score":0.012760857,"about_ca_system_score_codex":0.0009308596,"about_ca_system_score_gemma":0.0009613883,"threshold_uncertainty_score":0.02537316},"labels":[],"label_agreement":null},{"id":"W3081963674","doi":"","title":"Contrastive Multi-View Representation Learning on Graphs","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":97,"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; Graph; Artificial intelligence; Node (physics); Binary classification; Theoretical computer science; Representation (politics); Machine learning; Binary number; Feature learning; Mathematics; Support vector machine","score_opus":0.0770792012378027,"score_gpt":0.3372805158083014,"score_spread":0.26020131457049867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081963674","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.033196967,0.0005716514,0.95570916,0.00037065306,0.000094278366,0.00008926037,0.00080153235,0.0064007663,0.0027658457],"genre_scores_gemma":[0.5703318,0.00040231572,0.41865766,0.0005371282,0.00015474625,0.00018348255,0.0049434905,0.0007529247,0.0040364163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988772,0.00034683134,0.000035546967,0.0003797416,0.00025481786,0.000105773535],"domain_scores_gemma":[0.9975769,0.0008449022,0.00023062322,0.0008775051,0.0003459259,0.00012422871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011426455,0.0012799687,0.0011026427,0.0016299582,0.000352859,0.0016111342,0.0025188758,0.0015026432,0.0031232194],"category_scores_gemma":[0.006365045,0.00043696622,0.0012462515,0.0012658072,0.0008276078,0.0032795244,0.0019651842,0.002514923,0.0014864992],"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.00046625533,0.00035631267,0.0030971114,0.00034215904,0.00024005164,0.00019157723,0.00021765927,0.28754097,0.02889353,0.028110798,0.023539511,0.627004],"study_design_scores_gemma":[0.000014121251,0.000055010343,0.00029850603,0.000013864613,0.000012810302,0.00005576138,0.000022382745,0.9739699,0.005123452,0.018997865,0.0014264645,0.000009823676],"about_ca_topic_score_codex":0.0027526335,"about_ca_topic_score_gemma":0.004921378,"teacher_disagreement_score":0.0031232194,"about_ca_system_score_codex":0.0010146942,"about_ca_system_score_gemma":0.0005174544,"threshold_uncertainty_score":0.010448217},"labels":[],"label_agreement":null},{"id":"W3088352442","doi":"10.18653/v1/2020.emnlp-main.492","title":"Structure Aware Negative Sampling in Knowledge Graphs","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Neural Networks","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":"McGill University; Mila - Quebec Artificial Intelligence Institute","funders":"Institut de Valorisation des Données; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Adversarial system; Computer science; Embedding; Discriminative model; Scalability; Graph; Sampling (signal processing); Theoretical computer science; Simple (philosophy); Artificial intelligence; Machine learning","score_opus":0.04925334177672447,"score_gpt":0.31414655193891594,"score_spread":0.2648932101621915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088352442","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.05901305,0.0002529452,0.93745,0.0005760298,0.000025108171,0.000054355747,0.00013966043,0.00052784407,0.0019609374],"genre_scores_gemma":[0.8693904,0.00025177377,0.12600467,0.00045043515,0.000061777304,0.0001255904,0.0005690093,0.00016556573,0.002980736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982381,0.0009080989,0.00003948286,0.00038112438,0.00033865805,0.00009450081],"domain_scores_gemma":[0.99203277,0.005651933,0.00064587925,0.0010245402,0.00045510114,0.00018980847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023787515,0.0009764108,0.0009282062,0.0008730062,0.00068010343,0.0011356004,0.0017900297,0.0013476266,0.0012631797],"category_scores_gemma":[0.014530716,0.0005828047,0.00057951227,0.0006206648,0.0024444202,0.003232199,0.0017084408,0.0019380262,0.0003863922],"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.0003820978,0.00015117902,0.003670924,0.00018842223,0.00007409925,0.0004342231,0.0004579191,0.7592979,0.007888866,0.11673642,0.0051116026,0.1056063],"study_design_scores_gemma":[0.000012075848,0.0000299417,0.00023934306,0.000011053018,0.000008497336,0.00007138084,0.000035573375,0.92643654,0.0017618429,0.07051226,0.0008750949,0.0000063921784],"about_ca_topic_score_codex":0.0026068192,"about_ca_topic_score_gemma":0.0036318018,"teacher_disagreement_score":0.0026068192,"about_ca_system_score_codex":0.0011600815,"about_ca_system_score_gemma":0.00055163755,"threshold_uncertainty_score":0.012580156},"labels":[],"label_agreement":null},{"id":"W3089842617","doi":"10.1007/978-3-030-58799-4_65","title":"Classification of Actors in Social Networks Using RLVECO","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Neural Networks","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 Windsor","funders":"","keywords":"Computer science; Classifier (UML); Categorization; Artificial intelligence; Social network (sociolinguistics); Graph; Node (physics); Machine learning; Social network analysis; Data science; Theoretical computer science; World Wide Web","score_opus":0.039362634082580325,"score_gpt":0.27704550950975365,"score_spread":0.2376828754271733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089842617","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.5322009,0.0031608748,0.41483483,0.0017164217,0.0008373272,0.00045473294,0.018332561,0.0078118746,0.020650452],"genre_scores_gemma":[0.87866014,0.0006357967,0.08237273,0.00021328064,0.0002820405,0.00023240942,0.02430188,0.0002100874,0.013091609],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947757,0.00011893222,0.00002846316,0.00015432904,0.000107619824,0.00011308639],"domain_scores_gemma":[0.9995353,0.00018314984,0.000055246284,0.00006386534,0.000104303,0.000058142454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046814463,0.0009831946,0.0005644861,0.0029474292,0.00040888632,0.0011450169,0.00073328597,0.0009722085,0.0037667537],"category_scores_gemma":[0.0012687492,0.00019898781,0.0011081615,0.0017752547,0.0003360829,0.00094136485,0.00069785817,0.0008453292,0.00318941],"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.00088484475,0.0006179683,0.060034342,0.00035901272,0.00042098635,0.00046436975,0.00027707874,0.0636635,0.019593928,0.0065771504,0.046335075,0.8007718],"study_design_scores_gemma":[0.000024399578,0.00012854727,0.011718468,0.00007413568,0.00007664029,0.00017269557,0.000238707,0.967502,0.0063085523,0.006835237,0.0068975636,0.00002312131],"about_ca_topic_score_codex":0.007344165,"about_ca_topic_score_gemma":0.01373606,"teacher_disagreement_score":0.007344165,"about_ca_system_score_codex":0.00069876993,"about_ca_system_score_gemma":0.0005861921,"threshold_uncertainty_score":0.01460284},"labels":[],"label_agreement":null},{"id":"W3090786554","doi":"","title":"Non Parametric Graph Learning for Bayesian Graph Neural Networks","year":2020,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Advanced Graph Neural Networks","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 Montréal; McGill University","funders":"","keywords":"Computer science; Adjacency matrix; Inference; Graph; Theoretical computer science; Artificial intelligence; Machine learning; Statistical relational learning; Data mining; Relational database","score_opus":0.04336867985110546,"score_gpt":0.2901535011615251,"score_spread":0.24678482131041965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090786554","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.004124463,0.00044444462,0.9933561,0.000557737,0.000035081546,0.000038415357,0.0001594278,0.00024308726,0.0010413736],"genre_scores_gemma":[0.54139256,0.0027214694,0.4415625,0.000995956,0.00038492098,0.00092750473,0.002182872,0.00040784513,0.009424348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980166,0.0010905382,0.00007013516,0.00037864107,0.0003276592,0.00011634471],"domain_scores_gemma":[0.989532,0.00856991,0.00058272266,0.0004933825,0.00064487377,0.00017707968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039059175,0.0011646288,0.0015230486,0.0019515668,0.0007609443,0.0015615218,0.003470254,0.0028683995,0.0034543986],"category_scores_gemma":[0.023865692,0.0010196252,0.0010209422,0.0024028781,0.0019819604,0.0039474536,0.0018783584,0.0037250163,0.0008127422],"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.000048696777,0.000037837082,0.0007447907,0.0001073591,0.000060494178,0.0000515007,0.00006373726,0.82139987,0.00024695075,0.13712825,0.002474076,0.037636418],"study_design_scores_gemma":[0.0000034950147,0.0000039206006,0.000065499196,0.0000068623744,0.000003969548,0.000006645408,0.000003598912,0.93317765,0.000045008568,0.06634862,0.0003299072,0.0000049350306],"about_ca_topic_score_codex":0.012335315,"about_ca_topic_score_gemma":0.016459605,"teacher_disagreement_score":0.012335315,"about_ca_system_score_codex":0.003089213,"about_ca_system_score_gemma":0.0017171215,"threshold_uncertainty_score":0.024527013},"labels":[],"label_agreement":null},{"id":"W3091261939","doi":"10.48550/arxiv.2010.02089","title":"CopulaGNN: Towards Integrating Representational and Correlational Roles of Graphs in Graph Neural Networks","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","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 British Columbia","funders":"","keywords":"ENCODE; Computer science; Leverage (statistics); Theoretical computer science; Graph; Correlation; Artificial neural network; Copula (linguistics); Node (physics); Artificial intelligence; Machine learning; Data mining; Mathematics; Econometrics","score_opus":0.05592077022521464,"score_gpt":0.21002633409231508,"score_spread":0.15410556386710045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091261939","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.013203737,0.00055279775,0.98404217,0.0005731188,0.000050600065,0.000044012857,0.00016187943,0.00040436914,0.00096740515],"genre_scores_gemma":[0.5209848,0.0019113189,0.47033212,0.0009962198,0.00018695396,0.00028959184,0.0009665045,0.00039922225,0.0039332933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885213,0.0005932177,0.000042443553,0.0002893528,0.00014172497,0.00008123235],"domain_scores_gemma":[0.9946622,0.0034445352,0.0004446544,0.00060331804,0.00065567985,0.00018961972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029061243,0.0013082823,0.0013448187,0.0015979656,0.00063028187,0.0015832591,0.0022614368,0.0015204158,0.0015633784],"category_scores_gemma":[0.013926842,0.0008741432,0.001117164,0.0025129335,0.0014116195,0.004375339,0.0022279676,0.0030357477,0.0005741037],"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.00010029133,0.000095301744,0.003316091,0.0001809496,0.00015334574,0.00012960803,0.00017598286,0.8119843,0.0012358766,0.07496396,0.004534571,0.10312977],"study_design_scores_gemma":[0.0000024834455,0.000009001777,0.000101952384,0.0000075148982,0.000007941767,0.000011457934,0.0000065295426,0.97299623,0.0001254037,0.026396465,0.00033056852,0.000004497325],"about_ca_topic_score_codex":0.011005035,"about_ca_topic_score_gemma":0.015687406,"teacher_disagreement_score":0.011005035,"about_ca_system_score_codex":0.0017043654,"about_ca_system_score_gemma":0.0016830643,"threshold_uncertainty_score":0.021881998},"labels":[],"label_agreement":null},{"id":"W3091984691","doi":"10.48550/arxiv.2010.04029","title":"RNNLogic: Learning Logic Rules for Reasoning on Knowledge Graphs","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université de Montréal","funders":"","keywords":"Probabilistic logic network; Computer science; Artificial intelligence; Rule of inference; Probabilistic logic; Inference; Machine learning; Set (abstract data type); Logic programming; Autoepistemic logic; Multimodal logic; Description logic; Programming language","score_opus":0.10621017339645404,"score_gpt":0.22409572232527014,"score_spread":0.1178855489288161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091984691","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.015250232,0.0007627832,0.9730061,0.0008310371,0.00010489105,0.0002543652,0.0012671947,0.0054515586,0.0030717584],"genre_scores_gemma":[0.332327,0.00096973067,0.6539628,0.0012283952,0.000120521436,0.0005194041,0.0059399945,0.00056212547,0.004370037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899524,0.00027155346,0.00005574469,0.00036673353,0.00024120284,0.00006954052],"domain_scores_gemma":[0.9972574,0.0017487294,0.00020475546,0.0004089417,0.0002722173,0.0001079601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00157218,0.0012630275,0.0008351014,0.0017336038,0.0005478217,0.0014198594,0.0032859317,0.0015326389,0.004356035],"category_scores_gemma":[0.008748869,0.0007126969,0.0013866079,0.0011461377,0.0010425613,0.0027249192,0.0015923375,0.0029175028,0.0011691143],"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.00014230017,0.0003253328,0.0036758652,0.0004611524,0.00018809616,0.00017435082,0.0001213043,0.6072448,0.0019911993,0.029951315,0.014022013,0.34170222],"study_design_scores_gemma":[0.000018646111,0.000024040006,0.00021210445,0.00002600837,0.000019822255,0.000042829713,0.000011608226,0.9644199,0.0008850169,0.032151166,0.0021810234,0.000007938189],"about_ca_topic_score_codex":0.00949279,"about_ca_topic_score_gemma":0.021836603,"teacher_disagreement_score":0.00949279,"about_ca_system_score_codex":0.0018059493,"about_ca_system_score_gemma":0.0020938553,"threshold_uncertainty_score":0.018875062},"labels":[],"label_agreement":null},{"id":"W3092206109","doi":"10.1609/aaai.v35i11.17203","title":"GraphMix: Improved Training of GNNs for Semi-Supervised Learning","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":113,"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; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Graph; Convolutional neural network; Theoretical computer science; Artificial intelligence; Machine learning; Regularization (linguistics); Artificial neural network","score_opus":0.0913165739348398,"score_gpt":0.29778026928480694,"score_spread":0.20646369534996714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092206109","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.01931123,0.00035909333,0.96821475,0.00029783684,0.00012416564,0.00011164442,0.0004875567,0.0092995195,0.0017941959],"genre_scores_gemma":[0.31215224,0.0002522084,0.67466134,0.00081139285,0.00013840206,0.0003914555,0.0043605412,0.0017060336,0.005526447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988061,0.00038654794,0.000044340344,0.00045386286,0.00021908707,0.000090125024],"domain_scores_gemma":[0.997497,0.00096580083,0.00020429122,0.00075974443,0.00043738476,0.00013581554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023754034,0.002236879,0.0012936452,0.0017316879,0.00079628173,0.0012563511,0.0036448126,0.002774483,0.0034481776],"category_scores_gemma":[0.008651536,0.000883558,0.0012272841,0.0016817781,0.0015466323,0.003867614,0.0030724313,0.003443753,0.0021291887],"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.0002873327,0.00022528571,0.0023034893,0.00021857688,0.00021560444,0.00012378371,0.00018790243,0.6225448,0.0066542337,0.017892973,0.01382823,0.33551776],"study_design_scores_gemma":[0.000009501038,0.000019432144,0.000099268094,0.000007208218,0.000006047285,0.000012967037,0.000009946733,0.9899386,0.0012689685,0.0077984673,0.0008236477,0.0000058727546],"about_ca_topic_score_codex":0.0081591075,"about_ca_topic_score_gemma":0.015103835,"teacher_disagreement_score":0.0081591075,"about_ca_system_score_codex":0.0014832916,"about_ca_system_score_gemma":0.001762462,"threshold_uncertainty_score":0.016223192},"labels":[],"label_agreement":null},{"id":"W3093694263","doi":"","title":"FLAG: Adversarial Data Augmentation for Graph Neural Networks","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science; Graph; Adversarial system; Flag (linear algebra); Node (physics); Code (set theory); Artificial neural network; Artificial intelligence; Theoretical computer science; Mathematics","score_opus":0.11529997396812945,"score_gpt":0.22300162707284968,"score_spread":0.10770165310472023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093694263","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.021413751,0.00082802627,0.9545389,0.0011464382,0.0002990007,0.0001927401,0.0015033386,0.0152823,0.004795479],"genre_scores_gemma":[0.45304662,0.0006740117,0.5273462,0.0016243039,0.00019911146,0.00057294295,0.0068240017,0.001755737,0.007957018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990735,0.00033572855,0.00003172577,0.0002654224,0.00020981945,0.00008382671],"domain_scores_gemma":[0.99781847,0.0010014018,0.0001474919,0.00071769435,0.00022729857,0.00008759707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017453406,0.0023387568,0.00096955936,0.0008038354,0.0005681363,0.0009770362,0.0032711285,0.0018020776,0.0041864007],"category_scores_gemma":[0.0070409523,0.0006516926,0.001072833,0.0008996435,0.0015108745,0.002945394,0.0031473776,0.0041599576,0.0019504942],"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.00023723235,0.00020537445,0.0015614852,0.0003009946,0.00013749662,0.00014011467,0.00010022179,0.75104636,0.00600011,0.024501005,0.03241455,0.18335506],"study_design_scores_gemma":[0.000014205323,0.000034992165,0.00010361451,0.000016717559,0.0000067104143,0.000028782042,0.000009908689,0.97595245,0.00195634,0.019609973,0.0022580705,0.000008158669],"about_ca_topic_score_codex":0.0030055258,"about_ca_topic_score_gemma":0.005942576,"teacher_disagreement_score":0.0041864007,"about_ca_system_score_codex":0.0011968155,"about_ca_system_score_gemma":0.0008737548,"threshold_uncertainty_score":0.014004886},"labels":[],"label_agreement":null},{"id":"W3093959361","doi":"10.1109/tmm.2020.3034530","title":"Anisotropic Graph Convolutional Network for Semi-Supervised Learning","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Multimedia","topic":"Advanced Graph Neural Networks","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Graph; Smoothing; Node (physics); Artificial intelligence; Theoretical computer science; Pattern recognition (psychology); Machine learning; Computer vision","score_opus":0.031109731398920697,"score_gpt":0.26490500993720517,"score_spread":0.23379527853828447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093959361","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.010931541,0.00040481763,0.98543566,0.00024736946,0.00004181009,0.000045975532,0.00015938353,0.001471302,0.0012621095],"genre_scores_gemma":[0.5264487,0.0009746023,0.46164754,0.0003858895,0.00014339428,0.00036962674,0.0017626708,0.00036529536,0.007902155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992556,0.00022969539,0.000035864705,0.00021296945,0.00019716693,0.00006877134],"domain_scores_gemma":[0.9983102,0.00065330905,0.0002209354,0.00041033028,0.00033646502,0.000068879875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013245883,0.0009921252,0.0008588683,0.0011127902,0.00039507114,0.0007851918,0.0016286721,0.001376922,0.0013812601],"category_scores_gemma":[0.0041298596,0.00047699013,0.00078678003,0.0013285214,0.0010622744,0.001296479,0.00096224603,0.0018907045,0.0007517156],"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.00015440438,0.000109328415,0.0012683305,0.00015770039,0.00011957075,0.00010626003,0.000100144534,0.67016095,0.007703268,0.031417623,0.007239908,0.28146255],"study_design_scores_gemma":[0.0000022930383,0.0000068743702,0.000089157795,0.000003578225,0.0000033645517,0.000010571672,0.0000025370996,0.9919304,0.0007713444,0.006633979,0.00054206926,0.000003788684],"about_ca_topic_score_codex":0.008622939,"about_ca_topic_score_gemma":0.0129060615,"teacher_disagreement_score":0.008622939,"about_ca_system_score_codex":0.0014373576,"about_ca_system_score_gemma":0.00140359,"threshold_uncertainty_score":0.017145514},"labels":[],"label_agreement":null},{"id":"W3094859785","doi":"10.1016/j.patcog.2022.108973","title":"GripNet: Graph information propagation on supergraph for heterogeneous graphs","year":2022,"lang":"en","type":"article","venue":"Pattern Recognition","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":17,"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; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Queen's University; University of Sheffield; Compute Canada","keywords":"Epigraph; Computer science; Graph; Combinatorics; Mathematics; Theoretical computer science; Mathematical optimization","score_opus":0.01986458204256742,"score_gpt":0.2278329279900972,"score_spread":0.20796834594752978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094859785","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.013616957,0.00043361785,0.965019,0.000544144,0.00011763844,0.00023399861,0.0028681238,0.014489819,0.0026766318],"genre_scores_gemma":[0.22177728,0.00084115146,0.74214065,0.0008724311,0.00017776288,0.00065342354,0.021398727,0.0019202107,0.010218345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993018,0.0001344856,0.00003320287,0.00026368545,0.00020671147,0.000060124003],"domain_scores_gemma":[0.9983607,0.0005879989,0.00016117847,0.0005172286,0.0002750299,0.00009791756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012604262,0.002424957,0.0013740787,0.003705816,0.0009414519,0.001649052,0.0037848463,0.001919656,0.005683171],"category_scores_gemma":[0.005559853,0.0010692776,0.0019921048,0.0028250928,0.0010462323,0.0051425085,0.0029084329,0.0029431095,0.0022123926],"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.00023474448,0.00026166355,0.002778564,0.00042379554,0.00033100962,0.00024021757,0.00020507864,0.51450014,0.0046543065,0.044277165,0.060897313,0.37119606],"study_design_scores_gemma":[0.000013976814,0.000018608358,0.00012890156,0.000012724238,0.000015490383,0.000023662828,0.000013435618,0.9775932,0.0009939964,0.018961146,0.0022175526,0.000007346302],"about_ca_topic_score_codex":0.019583803,"about_ca_topic_score_gemma":0.03779106,"teacher_disagreement_score":0.019583803,"about_ca_system_score_codex":0.0023090523,"about_ca_system_score_gemma":0.001746447,"threshold_uncertainty_score":0.038939595},"labels":[],"label_agreement":null},{"id":"W3096565974","doi":"10.1007/s10115-020-01521-9","title":"CANE: community-aware network embedding via adversarial training","year":2020,"lang":"en","type":"article","venue":"Knowledge and Information Systems","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Novelis (Canada)","funders":"","keywords":"Computer science; Node (physics); Discriminative model; Pairwise comparison; Embedding; Adversarial system; Machine learning; Representation (politics); Feature learning; Data mining; Artificial intelligence; Community structure; Theoretical computer science; Mathematics","score_opus":0.0314213780843983,"score_gpt":0.2559193188299602,"score_spread":0.22449794074556192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096565974","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.008892289,0.0004938703,0.97842914,0.00067057484,0.00029660302,0.00017727418,0.0008907954,0.0064992458,0.003650283],"genre_scores_gemma":[0.38711107,0.0006046887,0.57653797,0.0013001015,0.0003367198,0.0007096621,0.0061487607,0.0020132228,0.025237834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992988,0.0002476155,0.00001767821,0.00018444128,0.00016951888,0.00008192426],"domain_scores_gemma":[0.9978848,0.0010170626,0.000102661164,0.00057194196,0.00028247182,0.00014094615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013440894,0.0018754194,0.0013879661,0.0013334157,0.00080165983,0.0009579289,0.0035552615,0.0033437854,0.009324199],"category_scores_gemma":[0.006385839,0.00075459405,0.001041911,0.001303993,0.0010701184,0.0028082298,0.0034760316,0.004111093,0.0038389587],"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.00037595333,0.00036878744,0.0008961227,0.0002804911,0.00022920546,0.0002497818,0.00011786868,0.6152396,0.004554525,0.03283675,0.05879717,0.2860537],"study_design_scores_gemma":[0.000015594402,0.00001869482,0.00004987378,0.000010306061,0.000007528077,0.000028175433,0.0000080882555,0.9857538,0.0006550082,0.011856069,0.0015905873,0.0000062986715],"about_ca_topic_score_codex":0.0068390705,"about_ca_topic_score_gemma":0.0135573475,"teacher_disagreement_score":0.009324199,"about_ca_system_score_codex":0.0008890697,"about_ca_system_score_gemma":0.0010942181,"threshold_uncertainty_score":0.031192541},"labels":[],"label_agreement":null},{"id":"W3096909414","doi":"10.1109/icassp39728.2021.9414557","title":"Geometric Scattering Attention Networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Neural Networks","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; Mila - Quebec Artificial Intelligence Institute","funders":"National Institute of General Medical Sciences","keywords":"Scattering; Computer science; Node (physics); Graph; Artificial intelligence; Representation (politics); Convolution (computer science); Feature learning; Wavelet; Computation; Cascade; Theoretical computer science; Pattern recognition (psychology); Algorithm; Artificial neural network; Physics; Optics; Engineering","score_opus":0.018667417344397298,"score_gpt":0.24933033677326974,"score_spread":0.23066291942887243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096909414","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.099666625,0.0007972292,0.8811615,0.0011769071,0.00011681465,0.00004826179,0.00020013133,0.00095181854,0.015880816],"genre_scores_gemma":[0.9211624,0.00058829336,0.06529092,0.00059092033,0.00016686633,0.00007324638,0.0005016377,0.00013499323,0.011490605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99966943,0.00008848465,0.000008322028,0.00011640532,0.00006783914,0.000049540668],"domain_scores_gemma":[0.9994134,0.00027269137,0.0000638167,0.00006942646,0.00013538834,0.000045275865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046157814,0.00069893844,0.00038998772,0.00077339157,0.00038306642,0.00058875605,0.0009695551,0.00097245874,0.0034274976],"category_scores_gemma":[0.0024612409,0.00027291387,0.0004620342,0.00070320634,0.00088544167,0.0013447476,0.0014312746,0.0008703512,0.0004906735],"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.00015821678,0.00008821001,0.002382897,0.00016687166,0.00010898509,0.00020293807,0.00031234208,0.51762223,0.015762594,0.19529301,0.010633661,0.25726807],"study_design_scores_gemma":[0.0000057765255,0.00002666025,0.00064389035,0.000008358576,0.000017684377,0.00004208261,0.00001914376,0.91748387,0.0015604743,0.07790882,0.00227584,0.0000074669006],"about_ca_topic_score_codex":0.0026748702,"about_ca_topic_score_gemma":0.0043832646,"teacher_disagreement_score":0.0034274976,"about_ca_system_score_codex":0.00090050715,"about_ca_system_score_gemma":0.00038429978,"threshold_uncertainty_score":0.0114661455},"labels":[],"label_agreement":null},{"id":"W3097986917","doi":"10.18653/v1/2020.emnlp-main.541","title":"Recurrent Event Network: Autoregressive Structure Inferenceover Temporal Knowledge Graphs","year":2020,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":358,"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; Mila - Quebec Artificial Intelligence Institute","funders":"NIH Office of the Director; Office of Naval Research; National Science Foundation; Office of the Director of National Intelligence; Advanced Research Projects Agency; Defense Advanced Research Projects Agency; Intelligence Advanced Research Projects Activity","keywords":"Timestamp; Computer science; ENCODE; Inference; Autoregressive model; Event (particle physics); Graph; Artificial intelligence; Task (project management); Machine learning; Data mining; Theoretical computer science; Real-time computing; Mathematics","score_opus":0.02230392439341087,"score_gpt":0.2709334823829315,"score_spread":0.24862955798952066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097986917","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.026541173,0.0013261125,0.960671,0.0005925533,0.00010990473,0.0000918003,0.0031195914,0.0056947214,0.0018531716],"genre_scores_gemma":[0.6482653,0.0018171885,0.32826647,0.0004572655,0.00019248629,0.00018953768,0.014825539,0.00032693034,0.0056592734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992854,0.00015727455,0.000042729218,0.00029203572,0.00016530826,0.000057156532],"domain_scores_gemma":[0.9984199,0.00079844444,0.000219935,0.00027965024,0.00023584647,0.000046219604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012148358,0.0014107063,0.00087749626,0.001951121,0.000420944,0.000936488,0.0024438053,0.0010397631,0.0019593309],"category_scores_gemma":[0.004404504,0.0005763013,0.0012275039,0.001851863,0.00037671867,0.0027750507,0.0008421928,0.0021086682,0.0008280835],"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.00028004198,0.00024210528,0.005592119,0.00025786908,0.00034787715,0.00032041344,0.00015223229,0.62246937,0.0041050054,0.016180195,0.014295731,0.33575714],"study_design_scores_gemma":[0.000005843999,0.000012780607,0.0003437488,0.0000085262245,0.000023061064,0.000023327848,0.0000074422537,0.9882681,0.00081740017,0.009418372,0.0010648496,0.0000067008173],"about_ca_topic_score_codex":0.017542236,"about_ca_topic_score_gemma":0.03235352,"teacher_disagreement_score":0.017542236,"about_ca_system_score_codex":0.0012658733,"about_ca_system_score_gemma":0.0009577386,"threshold_uncertainty_score":0.03488028},"labels":[],"label_agreement":null},{"id":"W3098770144","doi":"","title":"Graph Policy Network for Transferable Active Learning on Graphs","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Graph Neural Networks","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":"HEC Montréal; Université de Montréal","funders":"","keywords":"Computer science; Reinforcement learning; Machine learning; Artificial intelligence; Graph; Theoretical computer science","score_opus":0.0221627674460945,"score_gpt":0.25844239892404175,"score_spread":0.23627963147794726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098770144","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.0077263354,0.0002932418,0.9891823,0.00042392052,0.000054111908,0.00006504207,0.00009170154,0.00047673986,0.0016866245],"genre_scores_gemma":[0.7441964,0.0007500999,0.24363971,0.00078041217,0.0001344159,0.0007906425,0.0007380103,0.00030597087,0.008664393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989826,0.00044346257,0.0000377808,0.0002940196,0.0001614523,0.00008062525],"domain_scores_gemma":[0.9968406,0.0023602166,0.00019967568,0.00020955806,0.00026877984,0.00012116717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018514647,0.0011955975,0.0012557673,0.0010359657,0.00051116484,0.0011371896,0.002436071,0.002261947,0.0041742227],"category_scores_gemma":[0.008302522,0.00061457703,0.0008057077,0.0011196876,0.0019259097,0.0028130864,0.0020223535,0.003132399,0.0008385733],"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.00008082144,0.00008748654,0.00042271227,0.00008782292,0.000033775228,0.00007361831,0.00008317223,0.88638455,0.001202221,0.054807145,0.0022622435,0.05447448],"study_design_scores_gemma":[0.0000051877023,0.000008334237,0.000016428521,0.0000037508821,0.0000021508592,0.0000046643236,0.0000031534278,0.98253274,0.0001834963,0.016936779,0.00030096876,0.0000023730156],"about_ca_topic_score_codex":0.004515542,"about_ca_topic_score_gemma":0.0049729953,"teacher_disagreement_score":0.004515542,"about_ca_system_score_codex":0.002017646,"about_ca_system_score_gemma":0.0014260603,"threshold_uncertainty_score":0.014639139},"labels":[],"label_agreement":null},{"id":"W3099845049","doi":"10.18653/v1/2020.emnlp-main.462","title":"TeMP: Temporal Message Passing for Temporal Knowledge Graph Completion","year":2020,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":139,"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; Mila - Quebec Artificial Intelligence Institute","funders":"Samsung; Compute Canada; Canadian Institute for Advanced Research","keywords":"Leverage (statistics); Computer science; Knowledge graph; Message passing; Graph; Temporal database; Machine learning; Artificial intelligence; Theoretical computer science; Data mining; Distributed computing","score_opus":0.05205755584159759,"score_gpt":0.2873606080580615,"score_spread":0.23530305221646391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099845049","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.006517979,0.0005246299,0.97932637,0.00050762994,0.0001419754,0.00014942385,0.0020055892,0.009632609,0.0011938352],"genre_scores_gemma":[0.22572269,0.0007719008,0.75165886,0.00057742995,0.00025667076,0.00055961334,0.013263158,0.0009981383,0.006191573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983645,0.00043402615,0.000097001495,0.0005964113,0.00038455022,0.00012356356],"domain_scores_gemma":[0.9962948,0.0019114185,0.00029536666,0.0009600841,0.00037902902,0.00015931921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023758248,0.0020184077,0.0014767494,0.002379708,0.00090467,0.0017079154,0.004098,0.002311423,0.00801715],"category_scores_gemma":[0.011341941,0.0007747307,0.001565428,0.002788429,0.0008599705,0.005361254,0.0028978044,0.004058842,0.002865947],"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.00041782262,0.0003542243,0.0019477636,0.00065249467,0.00027328977,0.00027535588,0.0003705829,0.27880263,0.004241746,0.039727278,0.0460967,0.6268402],"study_design_scores_gemma":[0.000029795765,0.00005172267,0.00027310534,0.00002729435,0.000031544398,0.00006515886,0.00005142368,0.93628293,0.0022747421,0.054886743,0.006006951,0.000018618171],"about_ca_topic_score_codex":0.011836991,"about_ca_topic_score_gemma":0.020404842,"teacher_disagreement_score":0.011836991,"about_ca_system_score_codex":0.0015757761,"about_ca_system_score_gemma":0.0022987244,"threshold_uncertainty_score":0.026820064},"labels":[],"label_agreement":null},{"id":"W3101708158","doi":"10.18653/v1/2020.findings-emnlp.241","title":"Out-of-Sample Representation Learning for Knowledge Graphs","year":2020,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Collège Boréal","funders":"","keywords":"Computer science; Representation (politics); Benchmark (surveying); Artificial intelligence; Machine learning; Feature learning; Knowledge graph; Sample (material); Graph; Task (project management); Theoretical computer science","score_opus":0.07396768505577844,"score_gpt":0.3258759174721643,"score_spread":0.2519082324163859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101708158","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.06867771,0.0034153028,0.91533464,0.0024229537,0.0001887863,0.00021910791,0.0019707512,0.0037624445,0.0040083304],"genre_scores_gemma":[0.77047706,0.0017268187,0.21087362,0.0011035841,0.00022896283,0.00028341787,0.01011464,0.00045091886,0.0047410047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973634,0.000964928,0.00010038904,0.0008947411,0.00052011985,0.00015638051],"domain_scores_gemma":[0.9862801,0.009348906,0.00091681175,0.0023273777,0.0008319694,0.00029483094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036267892,0.0015643418,0.0014879459,0.001981287,0.0008858065,0.0018636191,0.0036875147,0.0028658297,0.0027688174],"category_scores_gemma":[0.02358036,0.00050499977,0.0012656485,0.0025802453,0.0017024259,0.007970126,0.001765788,0.004191168,0.0009001902],"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.00052520947,0.00077074155,0.006558786,0.00060473726,0.0002504122,0.00033851765,0.0004459706,0.41964912,0.0024379096,0.07503678,0.034999955,0.45838174],"study_design_scores_gemma":[0.000028386708,0.000057354275,0.00064063026,0.00004665182,0.000033461467,0.00007499951,0.00007040722,0.8572504,0.0011222742,0.13744901,0.0032123562,0.000014136302],"about_ca_topic_score_codex":0.00700763,"about_ca_topic_score_gemma":0.011207109,"teacher_disagreement_score":0.00700763,"about_ca_system_score_codex":0.0029381993,"about_ca_system_score_gemma":0.0013297247,"threshold_uncertainty_score":0.021318197},"labels":[],"label_agreement":null},{"id":"W3104591796","doi":"","title":"Principal Neighbourhood Aggregation for Graph Nets","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":51,"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":"Computer science; Exploit; Theoretical computer science; Graph; Neighbourhood (mathematics); News aggregator; Graph isomorphism; Data mining; Artificial intelligence; Machine learning; Mathematics","score_opus":0.026325718818596754,"score_gpt":0.25203489105682375,"score_spread":0.225709172238227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104591796","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.042501982,0.00060030504,0.9496232,0.0005752531,0.000084103856,0.000047431615,0.0002484509,0.0006840537,0.005635161],"genre_scores_gemma":[0.81350476,0.0008062745,0.1771314,0.00022384383,0.00019475062,0.00017209447,0.0006506376,0.00027425162,0.007041981],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917173,0.0003070131,0.00004488346,0.00020973803,0.00020077922,0.00006582804],"domain_scores_gemma":[0.997171,0.0015276528,0.0003082001,0.00051151664,0.00029739572,0.00018416144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016667886,0.00065486884,0.0010824734,0.0014316938,0.0007600489,0.0014735823,0.0011063647,0.0010318973,0.0018918089],"category_scores_gemma":[0.006721843,0.0003862276,0.001189914,0.0012236667,0.0015371135,0.003474958,0.002051507,0.0018039786,0.0003319419],"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.00008487032,0.000035395035,0.0011672725,0.00012575442,0.000057942358,0.00007062403,0.00013533891,0.60732347,0.0011935266,0.34379312,0.002595478,0.043417208],"study_design_scores_gemma":[0.000003951367,0.00001355082,0.0001585953,0.000007420813,0.0000064879114,0.00001439531,0.000009067051,0.8201808,0.00021478705,0.17865786,0.00072771293,0.0000053597937],"about_ca_topic_score_codex":0.004403214,"about_ca_topic_score_gemma":0.004598534,"teacher_disagreement_score":0.004403214,"about_ca_system_score_codex":0.0016551953,"about_ca_system_score_gemma":0.00071870716,"threshold_uncertainty_score":0.012009323},"labels":[],"label_agreement":null},{"id":"W3110887761","doi":"10.1155/2020/6831603","title":"CAREA: Cotraining Attribute and Relation Embeddings for Cross-Lingual Entity Alignment in Knowledge Graphs","year":2020,"lang":"en","type":"article","venue":"Discrete Dynamics in Nature and Society","topic":"Advanced Graph Neural Networks","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 Montréal","funders":"Chengdu Science and Technology Bureau; Xihua University; Jiangsu Development and Reform Commission; National Natural Science Foundation of China","keywords":"Computer science; Relation (database); Code (set theory); Set (abstract data type); Knowledge graph; Value (mathematics); Data mining; Artificial intelligence; Information retrieval; Natural language processing; Machine learning","score_opus":0.012213204037411373,"score_gpt":0.30391747024477406,"score_spread":0.2917042662073627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110887761","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.04968511,0.0017933135,0.9203038,0.0005782229,0.00034000567,0.0003272754,0.001982015,0.02228165,0.0027085482],"genre_scores_gemma":[0.3417412,0.000692768,0.6316271,0.00066449615,0.00012879145,0.0005121834,0.015555708,0.001601814,0.0074759144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986745,0.0003604117,0.0000760018,0.0006333495,0.00014801201,0.00010779497],"domain_scores_gemma":[0.99714535,0.0010445099,0.00019328226,0.0010532107,0.0004355916,0.00012814799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001692529,0.002840587,0.0013509092,0.0030278163,0.0010976017,0.0014405842,0.003421426,0.0023942,0.004406022],"category_scores_gemma":[0.006402295,0.0011790835,0.002484678,0.0029495193,0.0007834858,0.004819202,0.002823589,0.0035442242,0.0035684248],"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.0002996425,0.00055473106,0.007961038,0.00041225547,0.0005926624,0.00035384618,0.0005670676,0.18627952,0.008351367,0.0106320875,0.033139564,0.7508562],"study_design_scores_gemma":[0.000028678585,0.000068007685,0.00077680364,0.000029305837,0.00006768346,0.00012916993,0.0000979234,0.97898966,0.0025728766,0.011320243,0.0058955154,0.000024178134],"about_ca_topic_score_codex":0.01681561,"about_ca_topic_score_gemma":0.038917698,"teacher_disagreement_score":0.01681561,"about_ca_system_score_codex":0.0012616154,"about_ca_system_score_gemma":0.001698225,"threshold_uncertainty_score":0.033435464},"labels":[],"label_agreement":null},{"id":"W3112618978","doi":"10.1109/smc42975.2020.9283008","title":"Link Prediction in Social Graphs using Representation Learning via Knowledge-Graph Embeddings and ConvNet (RLVECN)","year":2020,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"University of Windsor","funders":"Compute Canada","keywords":"Computer science; Artificial intelligence; Social network (sociolinguistics); Machine learning; Classifier (UML); Feature learning; Graph; Social network analysis; Theoretical computer science; Social media","score_opus":0.03694742911233086,"score_gpt":0.2989916323043575,"score_spread":0.26204420319202665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112618978","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.13706417,0.000991862,0.85479283,0.0011734064,0.00012684384,0.00009279633,0.00053969456,0.0020513753,0.0031670628],"genre_scores_gemma":[0.8873281,0.0005157591,0.105530694,0.00037773632,0.00007273438,0.00012598874,0.0015335943,0.00009377379,0.0044215713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996666,0.00008386959,0.000015639125,0.000118408825,0.00006675574,0.000048866612],"domain_scores_gemma":[0.9993494,0.00028818403,0.00010982981,0.00008412732,0.00012653963,0.00004186474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070576224,0.0008414043,0.00068156235,0.0010046747,0.00032771018,0.0007766689,0.0013975218,0.0011105557,0.0010228632],"category_scores_gemma":[0.002228622,0.00037678782,0.0006970739,0.0009041206,0.00080607436,0.002091978,0.0010077198,0.0012677093,0.0003886114],"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.00012881188,0.0001686657,0.0036883657,0.0001092934,0.00009715668,0.00013241892,0.00012405073,0.7579499,0.003085384,0.015209582,0.0047397893,0.2145666],"study_design_scores_gemma":[0.0000025528084,0.000014174189,0.00016761104,0.0000052856844,0.000004749208,0.000009853961,0.000008654087,0.99372125,0.00042384208,0.0053640674,0.00027495928,0.0000030395104],"about_ca_topic_score_codex":0.013526576,"about_ca_topic_score_gemma":0.017290507,"teacher_disagreement_score":0.013526576,"about_ca_system_score_codex":0.0012119868,"about_ca_system_score_gemma":0.00073065795,"threshold_uncertainty_score":0.026895702},"labels":[],"label_agreement":null},{"id":"W3115586753","doi":"10.18653/v1/2020.coling-main.520","title":"A Contextual Alignment Enhanced Cross Graph Attention Network for Cross-lingual Entity Alignment","year":2020,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Research Foundation Singapore; National Research Foundation","keywords":"Computer science; Focus (optics); Benchmark (surveying); Graph; Artificial intelligence; Attention network; Task (project management); Natural language processing; Theoretical computer science","score_opus":0.026341944748326615,"score_gpt":0.30509485062306096,"score_spread":0.27875290587473434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115586753","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.0867362,0.003698407,0.8878764,0.0008393438,0.00055971916,0.00017627847,0.0012568275,0.009076349,0.009780485],"genre_scores_gemma":[0.716208,0.0013616458,0.2556877,0.0012193696,0.00026020707,0.00020766677,0.007433894,0.0005688228,0.017052656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952185,0.00008608111,0.000018238716,0.00023625228,0.00006648288,0.00007106527],"domain_scores_gemma":[0.99960107,0.0001070921,0.000047066205,0.00009900255,0.000112388785,0.00003339289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005871156,0.0012118141,0.0008479042,0.0011348899,0.0007014143,0.0005563975,0.0016676346,0.0012222858,0.0036172708],"category_scores_gemma":[0.001701913,0.00040558327,0.0007497025,0.0018268557,0.0004813225,0.0020343831,0.0016752421,0.0014435153,0.0011778953],"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.00034408228,0.0003137001,0.0047538886,0.00027244756,0.00027512672,0.0003634578,0.00021361175,0.16658258,0.01831159,0.013046765,0.03166243,0.76386034],"study_design_scores_gemma":[0.000023056962,0.00006916564,0.0013197178,0.000022151788,0.0000890694,0.00012798721,0.00005471364,0.9776225,0.004221621,0.009780214,0.0066499873,0.000019805671],"about_ca_topic_score_codex":0.014801809,"about_ca_topic_score_gemma":0.03320044,"teacher_disagreement_score":0.014801809,"about_ca_system_score_codex":0.0009118171,"about_ca_system_score_gemma":0.0012057218,"threshold_uncertainty_score":0.029431283},"labels":[],"label_agreement":null},{"id":"W3117983049","doi":"10.1109/vcip49819.2020.9301851","title":"GRNet: Deep Convolutional Neural Networks based on Graph Reasoning for Semantic Segmentation","year":2020,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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 Windsor","funders":"Research and Development; Fundamental Research Funds for the Central Universities","keywords":"Computer science; Artificial intelligence; Graph; Convolutional neural network; Segmentation; Deep learning; Benchmark (surveying); Feature (linguistics); Pattern recognition (psychology); Machine learning; Theoretical computer science","score_opus":0.017913141524335336,"score_gpt":0.24681229688382822,"score_spread":0.22889915535949287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117983049","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.018734828,0.0011266354,0.95940536,0.00032951776,0.00014172532,0.00010582422,0.0012792276,0.0142745795,0.004602247],"genre_scores_gemma":[0.3146444,0.001145351,0.6655265,0.0006805884,0.00008265281,0.0001576558,0.008146832,0.0010691817,0.008546881],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999731,0.000025448766,0.000010218563,0.00012893727,0.000062215506,0.00004211302],"domain_scores_gemma":[0.9998325,0.00003793669,0.000025968633,0.000050213825,0.00003533344,0.000018098295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037867817,0.0017525969,0.00072769285,0.0013080612,0.00042444636,0.000989106,0.0022768616,0.0012966273,0.0036891338],"category_scores_gemma":[0.0008087087,0.00060990016,0.0011717253,0.0013459175,0.00073677563,0.0024310562,0.0010315325,0.0016348572,0.0018777094],"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.00030515538,0.00024252363,0.0014716276,0.00037407354,0.00033183335,0.00033886707,0.00014338784,0.33655456,0.04412872,0.04184911,0.025110058,0.54915017],"study_design_scores_gemma":[0.000013585499,0.000045457986,0.0003851663,0.000022309334,0.000041707714,0.00006987566,0.000017068138,0.9541932,0.011078433,0.02782768,0.006288462,0.000017076247],"about_ca_topic_score_codex":0.013150788,"about_ca_topic_score_gemma":0.022875048,"teacher_disagreement_score":0.013150788,"about_ca_system_score_codex":0.0013713966,"about_ca_system_score_gemma":0.001146701,"threshold_uncertainty_score":0.026148498},"labels":[],"label_agreement":null},{"id":"W3118485733","doi":"10.1007/s10898-020-00973-1","title":"Learning chordal extensions","year":2021,"lang":"en","type":"article","venue":"Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna)","topic":"Advanced Graph Neural Networks","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":"Polytechnique Montréal","funders":"","keywords":"Heuristics; Chordal graph; Generalization; Mathematics; Extension (predicate logic); Interval graph; Graph; Mathematical optimization; Computer science; Theoretical computer science; Artificial intelligence; Machine learning","score_opus":0.015406499583471449,"score_gpt":0.22881925229561526,"score_spread":0.2134127527121438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118485733","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.07707152,0.00026881005,0.9174431,0.0002543327,0.00005027268,0.00005835672,0.000107008804,0.00048023192,0.0042664204],"genre_scores_gemma":[0.80860084,0.00036073322,0.18718824,0.0002494871,0.00006132181,0.00013781914,0.0003269682,0.00014837875,0.002926168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946135,0.00018160872,0.00003440107,0.00017636079,0.000095631454,0.00005057869],"domain_scores_gemma":[0.9961396,0.002506178,0.0003423813,0.00056628796,0.00027899822,0.00016664862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013592928,0.0005866275,0.0007556983,0.00062891975,0.0004009704,0.00084171107,0.0010455477,0.0007951853,0.0024003522],"category_scores_gemma":[0.009855773,0.00038426957,0.00059368013,0.00033374457,0.0012506447,0.0020754614,0.0013278851,0.0014954838,0.00037839956],"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.0001998764,0.00012640019,0.0035508631,0.00026606777,0.00006778011,0.00014871356,0.0002336801,0.6984958,0.0060029696,0.14863126,0.003250107,0.13902646],"study_design_scores_gemma":[0.0000133783915,0.00005144612,0.00016491357,0.000018798988,0.0000061685114,0.000029888586,0.000016965794,0.9354337,0.0007864732,0.06270171,0.00076905545,0.000007483814],"about_ca_topic_score_codex":0.0008173243,"about_ca_topic_score_gemma":0.0017755437,"teacher_disagreement_score":0.0024003522,"about_ca_system_score_codex":0.0006180424,"about_ca_system_score_gemma":0.00075278303,"threshold_uncertainty_score":0.008029938},"labels":[],"label_agreement":null},{"id":"W3120491054","doi":"10.1145/3424672","title":"Knowledge Graph Embedding for Link Prediction","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Knowledge Discovery from Data","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":476,"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":"Computer science; Variety (cybernetics); Embedding; Link (geometry); Graph; Scale (ratio); Knowledge graph; Data science; Machine learning; Data mining; Artificial intelligence; Theoretical computer science","score_opus":0.06056504407758513,"score_gpt":0.32793144493453946,"score_spread":0.26736640085695434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120491054","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.033087514,0.006256744,0.92954856,0.001097339,0.0003032034,0.00029864215,0.0102200955,0.0094676595,0.009720197],"genre_scores_gemma":[0.43948847,0.0037001541,0.52077687,0.00043675833,0.00029389968,0.0002922476,0.028225949,0.00059184455,0.0061937296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982754,0.0003791427,0.00011174353,0.00057624216,0.0005585456,0.00009890614],"domain_scores_gemma":[0.9929838,0.004046838,0.0005855557,0.0014443012,0.00081991346,0.000119553806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011663268,0.0016168355,0.0010665932,0.005101556,0.00061952684,0.0016779238,0.001806926,0.0015226934,0.0053251158],"category_scores_gemma":[0.0131077375,0.0004635409,0.00089898077,0.0059369365,0.00054822443,0.004817743,0.001373057,0.0019737799,0.0031823518],"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.00017730065,0.00028220462,0.0072045033,0.00077032344,0.0002234612,0.00019861257,0.00016733073,0.17629872,0.002172216,0.021393703,0.03528995,0.75582165],"study_design_scores_gemma":[0.000019075254,0.000070087175,0.0015427099,0.00014200281,0.00007975237,0.00023126285,0.0001117621,0.9130898,0.0038193653,0.06280353,0.01806149,0.000029183151],"about_ca_topic_score_codex":0.006439603,"about_ca_topic_score_gemma":0.009317739,"teacher_disagreement_score":0.006439603,"about_ca_system_score_codex":0.00083456526,"about_ca_system_score_gemma":0.0012975304,"threshold_uncertainty_score":0.017814279},"labels":[],"label_agreement":null},{"id":"W3121199044","doi":"10.48550/arxiv.2102.05034","title":"SLAPS: Self-Supervision Improves Structure Learning for Graph Neural Networks","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":25,"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":"Computer science; Graph; Adjacency list; Task (project management); Artificial intelligence; Theoretical computer science; Machine learning; Algorithm; Engineering","score_opus":0.027290511455729756,"score_gpt":0.18261588190147818,"score_spread":0.15532537044574843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121199044","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.06563653,0.00093929516,0.91999257,0.00077989104,0.0001655372,0.00013815793,0.00048125375,0.009238165,0.0026286754],"genre_scores_gemma":[0.7084219,0.000486669,0.2830291,0.0005948946,0.00018017662,0.00023758879,0.0025692277,0.00093822717,0.0035422118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853015,0.000486585,0.000055561613,0.00051621837,0.00029203467,0.00011945039],"domain_scores_gemma":[0.99438983,0.0027259232,0.0005406627,0.0014457691,0.00065146683,0.0002463514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002077141,0.0019620424,0.0014626085,0.0011754172,0.0008921415,0.0011077119,0.003182748,0.0023422018,0.002713465],"category_scores_gemma":[0.013761853,0.0010283843,0.0011111933,0.0010282226,0.0012792642,0.0048664473,0.0027261698,0.0038083526,0.001043721],"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.00022463183,0.0003326191,0.0030694269,0.0002680322,0.00014086785,0.00013400441,0.00020286538,0.7376456,0.004425829,0.012258553,0.013043937,0.22825357],"study_design_scores_gemma":[0.000011424436,0.000025798503,0.0001293236,0.000006769413,0.0000058063324,0.000011580057,0.0000070833453,0.9901356,0.00058995746,0.008791166,0.0002818552,0.0000036678587],"about_ca_topic_score_codex":0.007495022,"about_ca_topic_score_gemma":0.014726158,"teacher_disagreement_score":0.007495022,"about_ca_system_score_codex":0.0013573244,"about_ca_system_score_gemma":0.0016329375,"threshold_uncertainty_score":0.0149027705},"labels":[],"label_agreement":null},{"id":"W3122308828","doi":"10.1109/icip42928.2021.9506042","title":"Improving Classification Accuracy With Graph Filtering","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Neural Networks","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 Montréal","funders":"","keywords":"Computer science; Artificial intelligence; Graph; Pattern recognition (psychology); Machine learning; Class (philosophy); Noise (video); Training set; Data mining; Theoretical computer science; Image (mathematics)","score_opus":0.029982215343688577,"score_gpt":0.2616561434561371,"score_spread":0.2316739281124485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122308828","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.18475214,0.003726522,0.7972844,0.0014629918,0.00064726465,0.00013985945,0.00048434423,0.0068863127,0.004616161],"genre_scores_gemma":[0.8169388,0.000687352,0.17584975,0.00063496316,0.00034500414,0.000075517804,0.0015639963,0.00045114112,0.0034534696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972899,0.0007037776,0.00013901036,0.0008722589,0.00076774927,0.00022739796],"domain_scores_gemma":[0.9920075,0.004968807,0.00051757274,0.0013895638,0.0009136664,0.00020283337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033437253,0.0016427079,0.0020064514,0.0030762397,0.0009925361,0.0020721408,0.0017203211,0.0030266247,0.001995476],"category_scores_gemma":[0.01452806,0.00036162278,0.0009767467,0.0018672211,0.001022299,0.003548708,0.0012784019,0.0022195438,0.0015885517],"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.00068813656,0.0004258036,0.0073705204,0.00029609344,0.00025952782,0.0001672486,0.00023409988,0.17399296,0.015987623,0.0096363,0.016074358,0.7748673],"study_design_scores_gemma":[0.000023615554,0.000112155794,0.0016119021,0.00002135841,0.00005220063,0.00008624761,0.00005694055,0.9706981,0.005882889,0.019921118,0.0015121632,0.0000213315],"about_ca_topic_score_codex":0.0040936843,"about_ca_topic_score_gemma":0.005193565,"teacher_disagreement_score":0.0040936843,"about_ca_system_score_codex":0.0011144707,"about_ca_system_score_gemma":0.00081322127,"threshold_uncertainty_score":0.017683566},"labels":[],"label_agreement":null},{"id":"W3124885591","doi":"10.48550/arxiv.2101.09951","title":"Fast &amp; Robust Image Interpolation using Gradient Graph Laplacian Regularizer","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","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":"York University","funders":"","keywords":"Piecewise; Mathematics; Algorithm; Laplacian matrix; Pixel; Quadratic equation; Interpolation (computer graphics); Conjugate gradient method; Graph; Planar; Computer science; Artificial intelligence; Image (mathematics); Combinatorics; Geometry; Mathematical analysis","score_opus":0.07831453599808524,"score_gpt":0.1994874090030349,"score_spread":0.12117287300494967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124885591","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.008316968,0.00016229702,0.98829633,0.00014820018,0.00003368806,0.000025458294,0.00006677746,0.0013467195,0.0016036085],"genre_scores_gemma":[0.2611442,0.0002844372,0.730604,0.00018453182,0.00004882789,0.00008592148,0.0004609839,0.0004804029,0.0067067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959356,0.000084615334,0.000015780099,0.00010134656,0.0001666352,0.00003816321],"domain_scores_gemma":[0.99953926,0.00014484907,0.000058075184,0.000109802815,0.000119958975,0.000028143166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071609416,0.0009458804,0.0007970379,0.0007306102,0.00033770275,0.0007100367,0.001148767,0.0009246314,0.002894322],"category_scores_gemma":[0.0020523563,0.0004037711,0.0006740052,0.00084514555,0.0006973775,0.0011861195,0.0011313171,0.0013885947,0.0012289288],"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.00026360826,0.000106097505,0.0004464857,0.00015765241,0.000067168745,0.00017312252,0.00012470262,0.5878347,0.030399531,0.025769504,0.009047676,0.34560975],"study_design_scores_gemma":[0.000005194841,0.000018217486,0.00004103499,0.0000033159267,0.0000031155244,0.000028824154,0.0000047923663,0.99296606,0.0029124639,0.0031573172,0.00085380836,0.0000057525012],"about_ca_topic_score_codex":0.003971555,"about_ca_topic_score_gemma":0.004480121,"teacher_disagreement_score":0.003971555,"about_ca_system_score_codex":0.00055289746,"about_ca_system_score_gemma":0.0009525316,"threshold_uncertainty_score":0.009682417},"labels":[],"label_agreement":null},{"id":"W3125117642","doi":"","title":"On Batch-size Selection for Stochastic Training for Graph Neural Networks","year":2021,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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 Alberta","funders":"","keywords":"Computer science; Complement (music); Metric (unit); Artificial neural network; Randomness; Selection (genetic algorithm); Stochastic gradient descent; Graph; Batch processing; Contrast (vision); Artificial intelligence; Estimator; Machine learning; Mathematics; Statistics; Theoretical computer science; Engineering","score_opus":0.028568199177916274,"score_gpt":0.272625345351232,"score_spread":0.24405714617331573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125117642","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.021285998,0.000948217,0.97319275,0.00082080445,0.00014277895,0.00017984603,0.00014994446,0.0021929224,0.0010868313],"genre_scores_gemma":[0.43986845,0.0008262962,0.5522505,0.0011972801,0.00024487192,0.00079765404,0.0009940986,0.0011876088,0.0026331923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658257,0.0014831647,0.00025835258,0.0006968621,0.00071391824,0.0002651525],"domain_scores_gemma":[0.980757,0.013909176,0.0010190659,0.0018905998,0.0018371583,0.0005869414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00933436,0.0020642537,0.0019669225,0.00086917984,0.001204002,0.0015185666,0.0036156988,0.002285495,0.0026285306],"category_scores_gemma":[0.034083977,0.0012614237,0.001281175,0.0009810855,0.002548663,0.003614184,0.0027013894,0.0048496122,0.00069290254],"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.0006092801,0.00023798652,0.003806118,0.00029839555,0.00013490372,0.00020212568,0.00019549522,0.8496848,0.0056671686,0.02868624,0.0063614626,0.10411609],"study_design_scores_gemma":[0.000022043101,0.0000361254,0.00015350111,0.000014418905,0.000009227271,0.00001718566,0.0000071985937,0.9914948,0.0012607838,0.0067144334,0.0002625114,0.00000779045],"about_ca_topic_score_codex":0.009572704,"about_ca_topic_score_gemma":0.014758197,"teacher_disagreement_score":0.009572704,"about_ca_system_score_codex":0.0035425455,"about_ca_system_score_gemma":0.0036306041,"threshold_uncertainty_score":0.0493654},"labels":[],"label_agreement":null},{"id":"W3126979872","doi":"10.1109/epec48502.2020.9320066","title":"GridKG: Knowledge Graph Representation of Distribution Grid Data","year":2020,"lang":"en","type":"article","venue":"2020 IEEE Electric Power and Energy Conference (EPEC)","topic":"Advanced Graph Neural Networks","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 Alberta","funders":"","keywords":"Computer science; Grid; Lattice graph; Theoretical computer science; Graph; Power grid; Data mining; Distributed computing; Power (physics); Line graph; Voltage graph; Mathematics","score_opus":0.034920864294094744,"score_gpt":0.26577146043577365,"score_spread":0.2308505961416789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126979872","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.011679007,0.0005744555,0.9023121,0.0012626131,0.00018183587,0.0003919081,0.050975025,0.024800533,0.007822503],"genre_scores_gemma":[0.18243282,0.0011744197,0.7192973,0.00046531446,0.00006362054,0.0005875429,0.08973006,0.0013290993,0.004919971],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994593,0.000111529094,0.000060504342,0.00015056436,0.0001758254,0.00004224871],"domain_scores_gemma":[0.99887735,0.000411068,0.00010603524,0.00036128302,0.000189194,0.000055050667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058321346,0.0006903053,0.00047260523,0.0028151013,0.0005484672,0.0021513954,0.0013381712,0.0009785341,0.008143533],"category_scores_gemma":[0.004947828,0.00038408607,0.00094381167,0.0033687057,0.00042117503,0.0032233682,0.0015293537,0.0013253425,0.0023986276],"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.00042384784,0.0002560542,0.004528172,0.0014199832,0.00023249166,0.0012630918,0.0011470859,0.18145782,0.0064812796,0.16147335,0.14479436,0.49652252],"study_design_scores_gemma":[0.000066011504,0.000062473286,0.0015209878,0.0002394977,0.00009048848,0.00046290213,0.00035331593,0.6218074,0.005579559,0.19980605,0.16995509,0.00005628221],"about_ca_topic_score_codex":0.019227346,"about_ca_topic_score_gemma":0.01854945,"teacher_disagreement_score":0.019227346,"about_ca_system_score_codex":0.0011752436,"about_ca_system_score_gemma":0.0014134027,"threshold_uncertainty_score":0.038230896},"labels":[],"label_agreement":null},{"id":"W3127274234","doi":"10.18653/v1/2021.eacl-main.245","title":"Exploring the Limits of Few-Shot Link Prediction in Knowledge Graphs","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Neural Networks","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; Mila - Quebec Artificial Intelligence Institute","funders":"Samsung; Canadian Institute for Advanced Research; Microsoft Research","keywords":"Shot (pellet); Computer science; Relation (database); Link (geometry); Simple (philosophy); Set (abstract data type); Artificial intelligence; One shot; Machine learning; Training set; Baseline (sea); Algorithm; Data mining","score_opus":0.16332852999336606,"score_gpt":0.30437624473467373,"score_spread":0.14104771474130767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127274234","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.4077415,0.0079844585,0.5683019,0.0038510584,0.00020571274,0.00015954142,0.0018095118,0.0028931887,0.0070530865],"genre_scores_gemma":[0.95277494,0.001065449,0.041311618,0.0006291349,0.0001586669,0.00007232557,0.0020731962,0.00021915835,0.0016955091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974215,0.0010146014,0.00008838433,0.001041855,0.00028222546,0.00015143483],"domain_scores_gemma":[0.967819,0.02763365,0.0010701786,0.002284119,0.000629581,0.0005633789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054800073,0.0013894102,0.0015904466,0.0020763811,0.0011470633,0.0025742475,0.0033316622,0.0028704447,0.0015972309],"category_scores_gemma":[0.028188288,0.00089336815,0.00083746976,0.0016205112,0.0024350525,0.010054552,0.0024242625,0.0040787617,0.0005974652],"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.00060394243,0.0004386201,0.014515516,0.0007399633,0.0003058045,0.00035047837,0.0007776644,0.781575,0.0021949564,0.03502446,0.009103415,0.15437014],"study_design_scores_gemma":[0.000011770036,0.000048608315,0.0006632631,0.000040427196,0.000022853721,0.00007348847,0.0000615587,0.94261783,0.0005782331,0.055250067,0.0006178685,0.000013989051],"about_ca_topic_score_codex":0.007600088,"about_ca_topic_score_gemma":0.009674638,"teacher_disagreement_score":0.007600088,"about_ca_system_score_codex":0.0017098825,"about_ca_system_score_gemma":0.0008451025,"threshold_uncertainty_score":0.028981388},"labels":[],"label_agreement":null},{"id":"W3127848318","doi":"10.48550/arxiv.2102.02307","title":"Typing Errors in Factual Knowledge Graphs: Severity and Possible Ways Out","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","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","keywords":"Computer science; Benchmark (surveying); Code (set theory); Typing; Artificial intelligence; Word error rate; Quality (philosophy); Natural language processing; Machine learning; Noisy data; Programming language; Speech recognition","score_opus":0.08504675677406587,"score_gpt":0.2124408258249891,"score_spread":0.12739406905092324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127848318","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.53307384,0.0030777124,0.43492204,0.006064824,0.00082740287,0.00031233826,0.005663852,0.008037418,0.008020641],"genre_scores_gemma":[0.8511743,0.00087435084,0.13756576,0.00073946425,0.00015654368,0.00011873459,0.0053618285,0.0015308319,0.0024781686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.981698,0.006201176,0.0021176673,0.003920279,0.0051315334,0.0009314222],"domain_scores_gemma":[0.76599675,0.16466007,0.018637855,0.028266462,0.020465951,0.0019729987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013790221,0.0010018345,0.0010950002,0.006599049,0.0017277696,0.0050285617,0.0023247413,0.0022173242,0.0020631647],"category_scores_gemma":[0.18169479,0.0010079728,0.0008910941,0.0060453583,0.0027859942,0.009462123,0.0032001035,0.0027819567,0.0008673514],"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.0011570241,0.0004918743,0.3400677,0.001973745,0.00063341856,0.0024325429,0.00967634,0.06813906,0.008547074,0.058651574,0.03931605,0.46891358],"study_design_scores_gemma":[0.000097728276,0.00021696527,0.07170554,0.0014926526,0.0005855728,0.0046442784,0.008262115,0.5610619,0.030545441,0.28347188,0.037571993,0.0003439678],"about_ca_topic_score_codex":0.0064841304,"about_ca_topic_score_gemma":0.010549006,"teacher_disagreement_score":0.013790221,"about_ca_system_score_codex":0.0014958612,"about_ca_system_score_gemma":0.0017057875,"threshold_uncertainty_score":0.072930515},"labels":[],"label_agreement":null},{"id":"W3131239930","doi":"10.48550/arxiv.2102.09557","title":"Knowledge Hypergraph Embedding Meets Relational Algebra","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","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":"Hypergraph; Embedding; Relational algebra; Theoretical computer science; Computer science; Relational database; Set (abstract data type); Mathematical proof; Relational model; Relation (database); Relational calculus; Projection (relational algebra); Relation algebra; Knowledge representation and reasoning; Graph; Representation (politics); Algebra over a field; Mathematics; Discrete mathematics; Artificial intelligence; Algorithm; Algebra representation; Data mining; Two-element Boolean algebra; Programming language; Pure mathematics","score_opus":0.07236993584907335,"score_gpt":0.20921599886342948,"score_spread":0.13684606301435615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131239930","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.00922159,0.00017237483,0.9876035,0.0004896125,0.000019453146,0.00005503113,0.00030652393,0.0005791671,0.0015526887],"genre_scores_gemma":[0.4381954,0.00069799274,0.5541062,0.00028789623,0.000091294976,0.00025758252,0.0017040507,0.00023184196,0.004427757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809796,0.0006881645,0.000104501836,0.0006259991,0.00040437843,0.00007904131],"domain_scores_gemma":[0.994591,0.0029865939,0.00036398805,0.001497219,0.00039413114,0.00016710292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017092013,0.0007871017,0.0007191306,0.0011952474,0.0005325386,0.0020158524,0.0016995125,0.0013530169,0.003773764],"category_scores_gemma":[0.010359501,0.0004874269,0.0011783278,0.0017036248,0.0018369525,0.007461632,0.0027019535,0.0030264405,0.00084427017],"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.000108009415,0.00012061967,0.0012487719,0.00023401137,0.00007977972,0.00011875325,0.0003156234,0.39718318,0.0028641406,0.40125757,0.005307569,0.19116199],"study_design_scores_gemma":[0.000009773144,0.000016352895,0.00012517071,0.00001261039,0.000009190042,0.000043444998,0.000023777895,0.7294247,0.0010715667,0.26690048,0.0023550617,0.000007872633],"about_ca_topic_score_codex":0.0034578422,"about_ca_topic_score_gemma":0.0037559774,"teacher_disagreement_score":0.003773764,"about_ca_system_score_codex":0.0013724419,"about_ca_system_score_gemma":0.0010397295,"threshold_uncertainty_score":0.012624562},"labels":[],"label_agreement":null},{"id":"W3131544549","doi":"10.1007/s13278-020-00714-y","title":"ShortWalk: an approach to network embedding on directed graphs","year":2021,"lang":"en","type":"article","venue":"Social Network Analysis and Mining","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":5,"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 Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Random walk; Embedding; Computer science; Node (physics); Theoretical computer science; Graph; Random graph; Directed graph; Graph embedding; Algorithm; Artificial intelligence; Mathematics","score_opus":0.017996602462022376,"score_gpt":0.2767699594428392,"score_spread":0.2587733569808168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131544549","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.0020216801,0.0003999363,0.9940347,0.0001625507,0.00007469653,0.000077234814,0.00095642096,0.0017242081,0.0005486157],"genre_scores_gemma":[0.053422686,0.0013893987,0.93409264,0.0001879098,0.0001632383,0.00046194805,0.005105033,0.0011421406,0.0040349294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825734,0.0006877446,0.00012696313,0.00037432194,0.00047704868,0.00007651348],"domain_scores_gemma":[0.99548185,0.0024373482,0.00032726207,0.00095004786,0.00061277783,0.0001906354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019281814,0.002094566,0.0017223835,0.006655927,0.0011672276,0.0029631036,0.00300398,0.0018252782,0.0058635646],"category_scores_gemma":[0.011077848,0.0012962704,0.0024707713,0.007890591,0.0011210894,0.0076488485,0.0035801919,0.0033847515,0.0025348968],"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.00022820364,0.00028496416,0.0028326963,0.0012629777,0.00053179177,0.00034782107,0.0007477149,0.19038607,0.00395804,0.2345159,0.03612493,0.5287788],"study_design_scores_gemma":[0.000028030043,0.000039113278,0.0003226169,0.00010252446,0.00007269234,0.00015100099,0.00012836547,0.7027881,0.0017384625,0.27670625,0.017887844,0.00003505998],"about_ca_topic_score_codex":0.004417709,"about_ca_topic_score_gemma":0.007823484,"teacher_disagreement_score":0.006655927,"about_ca_system_score_codex":0.0008697129,"about_ca_system_score_gemma":0.00149651,"threshold_uncertainty_score":0.01961559},"labels":[],"label_agreement":null},{"id":"W3132397809","doi":"10.1007/s12652-020-02821-2","title":"Entity alignment via knowledge embedding and type matching constraints for knowledge graph inference","year":2021,"lang":"en","type":"article","venue":"Journal of Ambient Intelligence and Humanized Computing","topic":"Advanced Graph Neural Networks","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 British Columbia","funders":"National Development and Reform Commission; Department of Science and Technology of Sichuan Province","keywords":"Computer science; Embedding; Knowledge graph; Inference; Matching (statistics); Domain knowledge; Vector space; Artificial intelligence; Graph; Similarity (geometry); Representation (politics); Graph embedding; Pattern recognition (psychology); Data mining; Theoretical computer science; Natural language processing; Mathematics; Image (mathematics)","score_opus":0.046644985972358145,"score_gpt":0.3376758821140567,"score_spread":0.2910308961416985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132397809","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.014642919,0.0004704318,0.97781837,0.0005548232,0.00008770867,0.000146803,0.0016707946,0.0025407278,0.0020673678],"genre_scores_gemma":[0.29992357,0.0005109833,0.6851986,0.0004067601,0.00015073079,0.00022532087,0.008163625,0.0006800105,0.004740441],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973047,0.00064620306,0.00024164283,0.0010136481,0.0005810913,0.00021267042],"domain_scores_gemma":[0.99218327,0.004708213,0.00051189726,0.001570695,0.000810451,0.00021546017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022156748,0.00086701347,0.0018029758,0.0035420675,0.0012399347,0.0028228653,0.0043860874,0.0024485295,0.0078118816],"category_scores_gemma":[0.01625512,0.0011255157,0.0018777105,0.0058636814,0.0010359209,0.010951073,0.0038461778,0.003881992,0.0021791873],"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.00069325353,0.00073401566,0.004182245,0.00064214505,0.00042741527,0.0005406277,0.00040859697,0.17928988,0.005227049,0.097055994,0.021878198,0.68892056],"study_design_scores_gemma":[0.00003133804,0.00003726883,0.0006399548,0.000048085883,0.00008258554,0.00009480586,0.00011430939,0.8648984,0.0025606726,0.12825358,0.00321184,0.000027169668],"about_ca_topic_score_codex":0.013657426,"about_ca_topic_score_gemma":0.024125751,"teacher_disagreement_score":0.013657426,"about_ca_system_score_codex":0.0012660174,"about_ca_system_score_gemma":0.0025540616,"threshold_uncertainty_score":0.027155876},"labels":[],"label_agreement":null},{"id":"W3151536792","doi":"10.1088/2632-2153/abf5b7","title":"MPGVAE: improved generation of small organic molecules using message passing neural nets","year":2021,"lang":"en","type":"article","venue":"Machine Learning Science and Technology","topic":"Advanced Graph Neural Networks","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":"Canadian Institute for Advanced Research; Vector Institute; University of Toronto","funders":"","keywords":"Message passing; Computer science; Artificial neural network; Autoencoder; Matching (statistics); Theoretical computer science; Perceptron; Graph; Encoder; Artificial intelligence; Algorithm; Parallel computing; Mathematics","score_opus":0.01654811459114791,"score_gpt":0.24548077609478475,"score_spread":0.22893266150363684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3151536792","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.059577957,0.00054656534,0.9299222,0.000606928,0.0002243765,0.0001560911,0.00020952999,0.0026580575,0.006098296],"genre_scores_gemma":[0.70099413,0.00043507406,0.28856736,0.00044385507,0.000061472296,0.0002814753,0.00037299807,0.0004416312,0.008402043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999801,0.000048764334,0.000007559422,0.00004891235,0.000067872854,0.000025981019],"domain_scores_gemma":[0.9994276,0.00032968886,0.0000486101,0.00006983611,0.00008766682,0.000036533816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070715055,0.00049364334,0.0006287169,0.00041804722,0.0002751907,0.0005472132,0.0010747433,0.0011124214,0.0029980182],"category_scores_gemma":[0.0021438815,0.00032366632,0.00053577876,0.00036624636,0.00053883676,0.000988904,0.00080953137,0.0010735124,0.00061325356],"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.00008658755,0.00008459273,0.00028696112,0.00013843198,0.000033674376,0.00014531461,0.00004094977,0.8880559,0.013873497,0.024535129,0.0019808381,0.07073822],"study_design_scores_gemma":[0.0000069071357,0.000016884445,0.000017449665,0.0000025106187,0.0000023796347,0.0000070842098,0.0000016899373,0.9933902,0.0030146209,0.0031407243,0.0003968591,0.0000027116246],"about_ca_topic_score_codex":0.0015281017,"about_ca_topic_score_gemma":0.002044095,"teacher_disagreement_score":0.0029980182,"about_ca_system_score_codex":0.0006559595,"about_ca_system_score_gemma":0.00063138333,"threshold_uncertainty_score":0.010029376},"labels":[],"label_agreement":null},{"id":"W3152688462","doi":"10.1145/3404835.3462961","title":"TIE: A Framework for Embedding-based Incremental Temporal Knowledge Graph Completion","year":2021,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); Université de Montréal; McGill University","funders":"","keywords":"Computer science; Forgetting; Embedding; Inference; Regularization (linguistics); Encoder; Artificial intelligence; Graph; Knowledge graph; Machine learning; Set (abstract data type); Theoretical computer science","score_opus":0.03242645237418972,"score_gpt":0.3244876535897444,"score_spread":0.2920612012155547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3152688462","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.002347267,0.00016638853,0.99553573,0.00012149296,0.000028476474,0.000049163253,0.00016257663,0.0010494629,0.00053942314],"genre_scores_gemma":[0.250178,0.00064856035,0.74019945,0.0002726934,0.00013220595,0.0005550603,0.0021457877,0.00067209237,0.0051961257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886024,0.00034380952,0.00006961552,0.0003524427,0.00026740466,0.000106425185],"domain_scores_gemma":[0.99690443,0.0016342362,0.00027150972,0.00062156864,0.00038384466,0.00018436628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018253772,0.0012160671,0.0012128858,0.001494759,0.0005442076,0.0013838547,0.004558398,0.0016184911,0.004394679],"category_scores_gemma":[0.010512149,0.0007984932,0.0015261379,0.00180414,0.0011640415,0.0044709896,0.003231142,0.0034755245,0.0011556261],"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.00020211747,0.00022503259,0.0007971991,0.00029831255,0.00013121028,0.00020013476,0.00032676043,0.59340554,0.0033818139,0.08217482,0.008120639,0.31073645],"study_design_scores_gemma":[0.0000086570035,0.00003405294,0.000054557113,0.000010948624,0.000011135909,0.000029075709,0.0000149807165,0.95753837,0.00078034017,0.039889697,0.0016183966,0.00000972741],"about_ca_topic_score_codex":0.008032006,"about_ca_topic_score_gemma":0.010299158,"teacher_disagreement_score":0.008032006,"about_ca_system_score_codex":0.001366289,"about_ca_system_score_gemma":0.0017211223,"threshold_uncertainty_score":0.015970469},"labels":[],"label_agreement":null},{"id":"W3155334815","doi":"10.1109/infocom42981.2021.9488814","title":"Medley: Predicting Social Trust in Time-Varying Online Social Networks","year":2021,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":24,"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; Benchmarking; Social media; Pairwise comparison; Social trust; Social network (sociolinguistics); Artificial intelligence; World Wide Web; Social capital; Sociology","score_opus":0.01729186267383214,"score_gpt":0.26417232237769983,"score_spread":0.24688045970386768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3155334815","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.7003115,0.0044620587,0.26654762,0.0025457647,0.00040851897,0.00033497976,0.014828569,0.0047937944,0.0057672993],"genre_scores_gemma":[0.9349498,0.00047633002,0.05289483,0.00023354389,0.00011979133,0.0000902412,0.007440535,0.000064864675,0.0037300459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994941,0.00018946288,0.000031856605,0.00016477547,0.000072159244,0.000047704267],"domain_scores_gemma":[0.9978415,0.0012231282,0.00033295114,0.00023224346,0.00021746439,0.00015269511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012229815,0.001240311,0.0006707269,0.00218722,0.00045003748,0.0007090556,0.00096652727,0.0012469972,0.0016857771],"category_scores_gemma":[0.0054310937,0.0003359583,0.0007367785,0.0013910652,0.00037588875,0.00166037,0.00086273724,0.00139147,0.0009031593],"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.0011926247,0.00092088914,0.145393,0.0004862107,0.00077851524,0.0004678452,0.0004772701,0.5120396,0.0035457558,0.0077916514,0.037552882,0.28935367],"study_design_scores_gemma":[0.000014283399,0.000103944316,0.0073678605,0.000016203341,0.000026223683,0.000094589406,0.000042543725,0.9854805,0.0005748872,0.0047935126,0.0014700448,0.0000153909],"about_ca_topic_score_codex":0.012825886,"about_ca_topic_score_gemma":0.027816048,"teacher_disagreement_score":0.012825886,"about_ca_system_score_codex":0.0009506688,"about_ca_system_score_gemma":0.00038029454,"threshold_uncertainty_score":0.025502443},"labels":[],"label_agreement":null},{"id":"W3156639479","doi":"10.5539/cis.v14n2p63","title":"Research on Entity Label Value Assignment Method in Knowledge Graph","year":2021,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Advanced Graph Neural Networks","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":"Department of Education of Guangdong Province","keywords":"Computer science; Graph; WordNet; Knowledge graph; Information retrieval; Entropy (arrow of time); Data mining; Artificial intelligence; Natural language processing; Theoretical computer science","score_opus":0.06700817207039453,"score_gpt":0.40448584316243874,"score_spread":0.3374776710920442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3156639479","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.012066723,0.00083078124,0.9827052,0.00033650603,0.000064249514,0.00010093207,0.0001996413,0.0015125755,0.002183362],"genre_scores_gemma":[0.33501545,0.0019192896,0.6551279,0.00027222224,0.0001188456,0.00025990716,0.0016542108,0.0003522038,0.005280038],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99775,0.0005924715,0.000123985,0.0007938405,0.0006405699,0.000099111036],"domain_scores_gemma":[0.99761814,0.0010833404,0.00021675364,0.00046255862,0.0005229398,0.00009627599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001483358,0.00091041473,0.0007453475,0.0043643606,0.0010748339,0.0016164383,0.0019094278,0.0009671329,0.0026213238],"category_scores_gemma":[0.0062308274,0.0004297905,0.00088899635,0.0056197355,0.0008942458,0.0067311777,0.001326801,0.0013744314,0.0006273396],"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.00011429669,0.00016714656,0.00332381,0.00042329254,0.00012189732,0.000115149945,0.00040136755,0.040025163,0.0072338404,0.0419158,0.0057632495,0.900395],"study_design_scores_gemma":[0.000035492143,0.00009502367,0.0033448574,0.00008956032,0.00011517246,0.000312904,0.0004086175,0.8500778,0.017148817,0.107075855,0.021226937,0.000068951245],"about_ca_topic_score_codex":0.0068281903,"about_ca_topic_score_gemma":0.005778668,"teacher_disagreement_score":0.0068281903,"about_ca_system_score_codex":0.0015680455,"about_ca_system_score_gemma":0.0012497349,"threshold_uncertainty_score":0.013576865},"labels":[],"label_agreement":null},{"id":"W3158277099","doi":"10.1109/icpr48806.2021.9412799","title":"Social Network Analysis using Knowledge-Graph Embeddings and Convolution Operations","year":2021,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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 Windsor","funders":"Compute Canada; International Business Machines Corporation","keywords":"Computer science; Graph; Artificial intelligence; Convolution (computer science); Node (physics); Theoretical computer science; Social network analysis; Feature learning; Social network (sociolinguistics); Machine learning; Artificial neural network; Social media; World Wide Web","score_opus":0.02370498762856411,"score_gpt":0.306408046269753,"score_spread":0.2827030586411889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158277099","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.08703643,0.0002876612,0.91015834,0.00047688512,0.000027447815,0.00003812711,0.00025844597,0.00038053573,0.0013361577],"genre_scores_gemma":[0.86369497,0.00032285877,0.13343836,0.00007858422,0.00004092314,0.00006140965,0.0005752633,0.000050420782,0.0017372724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994804,0.00021239584,0.000029502851,0.00012853005,0.00009578242,0.000053363547],"domain_scores_gemma":[0.99797076,0.0010973014,0.0003311044,0.0003117048,0.00018712235,0.0001019618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010357858,0.00055934297,0.00049115013,0.0018830406,0.0003093029,0.001231942,0.0007854156,0.0007983898,0.0010266032],"category_scores_gemma":[0.005102093,0.00024331057,0.00065640506,0.0015350225,0.000992104,0.0036819219,0.0012163527,0.0010467736,0.00024404703],"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.0001568817,0.00019055165,0.010921464,0.00013345013,0.00015355785,0.00017200975,0.00039406182,0.6099861,0.0056623137,0.12485497,0.0025268851,0.24484767],"study_design_scores_gemma":[0.0000021305398,0.000011690777,0.0005855748,0.000006728832,0.000006025431,0.000016080001,0.000032438013,0.9585703,0.00057328725,0.03976506,0.0004252875,0.0000054203674],"about_ca_topic_score_codex":0.0039492915,"about_ca_topic_score_gemma":0.0047279247,"teacher_disagreement_score":0.0039492915,"about_ca_system_score_codex":0.00087674125,"about_ca_system_score_gemma":0.0005378508,"threshold_uncertainty_score":0.007852614},"labels":[],"label_agreement":null},{"id":"W3158338018","doi":"","title":"Detection and Defense of Topological Adversarial Attacks on Graphs","year":2021,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Advanced Graph Neural Networks","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":"Adversarial system; Computer science; Computer security; Topology (electrical circuits); Mathematics; Artificial intelligence; Combinatorics","score_opus":0.09422810246771066,"score_gpt":0.33925757296241404,"score_spread":0.2450294704947034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158338018","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.36154455,0.00049487804,0.62567973,0.0015749675,0.00017048707,0.00013791934,0.00025247902,0.0013336767,0.008811262],"genre_scores_gemma":[0.98272,0.00012604782,0.015751125,0.00009411572,0.000036796508,0.000022969114,0.00012771765,0.000024531144,0.0010966222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882156,0.0004082619,0.00003392072,0.000175767,0.0003672789,0.00019313896],"domain_scores_gemma":[0.9953571,0.0026007048,0.00060166855,0.0008290983,0.0003863804,0.00022507642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012305711,0.00074659014,0.0006754086,0.0011728191,0.000455556,0.0010704105,0.0010303083,0.0013506261,0.0010590542],"category_scores_gemma":[0.008650489,0.00031456866,0.00052946684,0.0005812415,0.0011448795,0.0016474397,0.0022460297,0.0013378896,0.00025918594],"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.0006261679,0.00014234685,0.003981572,0.00011341631,0.00013274312,0.00030966653,0.0001598853,0.7725815,0.026339872,0.105364695,0.00567133,0.08457682],"study_design_scores_gemma":[0.000006855747,0.00004585685,0.0003540067,0.0000048453035,0.0000072027083,0.000075875236,0.00001988665,0.9819334,0.0024834278,0.0147062335,0.00035782816,0.0000045443726],"about_ca_topic_score_codex":0.0006134818,"about_ca_topic_score_gemma":0.00059622846,"teacher_disagreement_score":0.0013506261,"about_ca_system_score_codex":0.00070956897,"about_ca_system_score_gemma":0.0004659515,"threshold_uncertainty_score":0.006507933},"labels":[],"label_agreement":null},{"id":"W3158399077","doi":"10.1109/ispass51385.2021.00013","title":"GNNMark: A Benchmark Suite to Characterize Graph Neural Network Training on GPUs","year":2021,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science; Suite; Benchmark (surveying); Scalability; Machine learning; Software; Graph; Artificial intelligence; Variety (cybernetics); Parallel computing; Theoretical computer science; Database; Programming language","score_opus":0.031334094380693976,"score_gpt":0.25171992454709047,"score_spread":0.22038583016639648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158399077","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.6448109,0.009575236,0.09030425,0.0030526477,0.0017994072,0.0012468166,0.095188916,0.102660015,0.051361784],"genre_scores_gemma":[0.5586642,0.003243804,0.20581648,0.0013003874,0.00014976942,0.0012792016,0.21006723,0.010337448,0.009141559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975726,0.0005726315,0.00030670536,0.00043558294,0.00076035975,0.0003520619],"domain_scores_gemma":[0.9948285,0.0024639445,0.00028728583,0.00092004344,0.0012066278,0.00029362805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002271051,0.0035333503,0.0009115883,0.0023470705,0.000897141,0.0015837115,0.0045679193,0.0017234269,0.00368642],"category_scores_gemma":[0.010392648,0.00086319813,0.0013985117,0.004617361,0.00096116436,0.0023680315,0.0012722726,0.0023884792,0.001722723],"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.0014167264,0.0013295325,0.022017958,0.004356726,0.000945142,0.0010168543,0.00053576275,0.4928102,0.014622596,0.014923648,0.31550008,0.13052481],"study_design_scores_gemma":[0.00047153005,0.0004889553,0.007327164,0.0001914835,0.00011301762,0.0002896028,0.00029885847,0.9110473,0.016403355,0.012092872,0.05119482,0.00008099451],"about_ca_topic_score_codex":0.01993681,"about_ca_topic_score_gemma":0.028955502,"teacher_disagreement_score":0.01993681,"about_ca_system_score_codex":0.0019286494,"about_ca_system_score_gemma":0.002429751,"threshold_uncertainty_score":0.0396415},"labels":[],"label_agreement":null},{"id":"W3159726507","doi":"10.2196/26714","title":"A Biomedical Knowledge Graph System to Propose Mechanistic Hypotheses for Real-World Environmental Health Observations: Cohort Study and Informatics Application","year":2021,"lang":"en","type":"article","venue":"JMIR Medical Informatics","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":20,"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 Center for Advancing Translational Sciences; National Institutes of Health","keywords":"Computer science; Informatics; Data science; Biomedicine; Health informatics; Context (archaeology); Graph; Information retrieval; Bioinformatics; Medicine; Theoretical computer science; Public health; Biology; Engineering; Pathology","score_opus":0.024184441161883178,"score_gpt":0.30747199383974194,"score_spread":0.28328755267785877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159726507","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.012926379,0.0007837811,0.8488188,0.0017855931,0.00015028653,0.00073353597,0.026619425,0.103753634,0.004428617],"genre_scores_gemma":[0.11607264,0.00111086,0.8456223,0.0011043026,0.00009635716,0.0010432916,0.02995478,0.0023448556,0.0026505727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987375,0.00040159663,0.00015456667,0.00042592254,0.00024136378,0.000039148952],"domain_scores_gemma":[0.9890631,0.00880628,0.0004898451,0.0008110721,0.0005885776,0.00024113494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041743037,0.0014997356,0.00081270694,0.0067680036,0.00077000994,0.0023864587,0.0022033092,0.0017502893,0.019628592],"category_scores_gemma":[0.01740985,0.00069485395,0.0023908166,0.0030666061,0.00057925604,0.0024986167,0.0034259441,0.0012398721,0.0030477291],"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.001612046,0.00064086146,0.035971988,0.004777955,0.0017131746,0.0033900486,0.00244654,0.08995478,0.009610672,0.04944586,0.12175284,0.6786833],"study_design_scores_gemma":[0.0005959492,0.000272812,0.0093976855,0.00067039655,0.0006861276,0.001227222,0.0007566279,0.65569586,0.008043545,0.16027614,0.16218434,0.0001933148],"about_ca_topic_score_codex":0.009267558,"about_ca_topic_score_gemma":0.014988431,"teacher_disagreement_score":0.019628592,"about_ca_system_score_codex":0.001256387,"about_ca_system_score_gemma":0.0019661777,"threshold_uncertainty_score":0.06566417},"labels":[],"label_agreement":null},{"id":"W3161822059","doi":"10.24963/ijcai.2021/618","title":"The Power of the Weisfeiler-Leman Algorithm for Machine Learning with Graphs","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Neural Networks","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":"Polytechnique Montréal","funders":"Vienna Science and Technology Fund; Deutsche Forschungsgemeinschaft","keywords":"Computer science; Artificial intelligence; Machine learning; Graph isomorphism; Heuristic; Graph; Artificial neural network; Algorithm; Theoretical computer science; Line graph","score_opus":0.009319551344724326,"score_gpt":0.23158749665133258,"score_spread":0.22226794530660826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161822059","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.0021617583,0.0020184573,0.98881894,0.0011698419,0.00012748103,0.000046144512,0.00008858001,0.00034276667,0.0052260566],"genre_scores_gemma":[0.11557246,0.0054834373,0.8688434,0.0010383268,0.00070741115,0.00045328055,0.00057640276,0.00041496762,0.006910372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99630475,0.0019752553,0.00016918966,0.0005063354,0.00091126986,0.00013307156],"domain_scores_gemma":[0.99261147,0.0055215852,0.00029497148,0.0007055311,0.000738227,0.00012824584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050512296,0.0014067334,0.001391704,0.003669924,0.0014660452,0.0027145555,0.0023791739,0.0026929702,0.0038951333],"category_scores_gemma":[0.022949565,0.0006977205,0.0011372827,0.0043866015,0.0037233655,0.0065284967,0.0027163478,0.00504243,0.002622465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082440805,0.000060310613,0.00061159814,0.00032698893,0.00008493747,0.000099905235,0.00022100609,0.09473235,0.0009043655,0.701349,0.010946926,0.1905801],"study_design_scores_gemma":[0.000014536275,0.000023232624,0.00014679172,0.00007524356,0.000010598891,0.000055861958,0.000021794436,0.2320175,0.00070284226,0.7569037,0.010003426,0.000024494399],"about_ca_topic_score_codex":0.0029351653,"about_ca_topic_score_gemma":0.0029011199,"teacher_disagreement_score":0.0050512296,"about_ca_system_score_codex":0.0018345604,"about_ca_system_score_gemma":0.0018586206,"threshold_uncertainty_score":0.026713729},"labels":[],"label_agreement":null},{"id":"W3162288172","doi":"","title":"Incorporating background knowledge in tucker","year":2021,"lang":"en","type":"article","venue":"International journal of advance research, ideas and innovations in technology","topic":"Advanced Graph Neural Networks","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 Montréal","funders":"","keywords":"Computer science; Focus (optics); Task (project management); Knowledge graph; Link (geometry); State (computer science); Artificial intelligence; Algorithm","score_opus":0.043889393328746404,"score_gpt":0.40486715102471105,"score_spread":0.36097775769596463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3162288172","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.082376994,0.002574582,0.89932823,0.0027193574,0.00021828605,0.00009511451,0.0009584181,0.0024811502,0.009247945],"genre_scores_gemma":[0.88340986,0.0014931564,0.09980298,0.0009133381,0.00019521921,0.00018433096,0.0012985338,0.00024268747,0.012459886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99922943,0.00021023581,0.000034862675,0.00029792296,0.00012378175,0.00010376883],"domain_scores_gemma":[0.9966628,0.0022508653,0.00032029356,0.00035708642,0.0002802595,0.00012859722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014839668,0.0010540964,0.0017533704,0.0019167236,0.0007757103,0.0022506542,0.0028656512,0.003165377,0.0062600463],"category_scores_gemma":[0.0075839236,0.0009036453,0.0011534101,0.0020906397,0.0016059651,0.0070411656,0.0018306194,0.0031765504,0.0015906343],"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.00039572173,0.00017129972,0.00212072,0.00016176731,0.00012758463,0.00029185787,0.00031481986,0.7487016,0.0016546248,0.10055451,0.005389247,0.14011621],"study_design_scores_gemma":[0.000009264346,0.000020972093,0.00016138342,0.00002080476,0.000023511944,0.000025125935,0.000008595119,0.9636563,0.0002882889,0.034924414,0.00084915565,0.000012185362],"about_ca_topic_score_codex":0.013825934,"about_ca_topic_score_gemma":0.015057868,"teacher_disagreement_score":0.013825934,"about_ca_system_score_codex":0.0019739885,"about_ca_system_score_gemma":0.0011046255,"threshold_uncertainty_score":0.027490914},"labels":[],"label_agreement":null},{"id":"W3163256474","doi":"10.1109/icassp39728.2021.9414015","title":"Ego-GNNs: Exploiting Ego Structures in Graph Neural Networks","year":2021,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Id, ego and super-ego; Computer science; Artificial intelligence; Graph; Artificial neural network; Cognitive science; Theoretical computer science; Psychology; Social psychology","score_opus":0.015409898376336214,"score_gpt":0.24471318361061167,"score_spread":0.22930328523427546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163256474","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.039814997,0.00027500794,0.9556665,0.000325475,0.000038828057,0.000053990923,0.00022632498,0.0015291587,0.002069803],"genre_scores_gemma":[0.7353308,0.00052082515,0.25713363,0.0004123531,0.00008087473,0.00013129607,0.0010316555,0.00030956924,0.005048967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996574,0.00009719903,0.000014887499,0.0000996003,0.000083403975,0.00004745802],"domain_scores_gemma":[0.9991253,0.00037123557,0.0001142352,0.00020602909,0.0001217523,0.00006146637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007689895,0.0007640539,0.0006192898,0.0008649539,0.00044861741,0.0008506962,0.0015084199,0.0009923172,0.0018711997],"category_scores_gemma":[0.0033923439,0.00043443043,0.00058702496,0.0009163006,0.0010740514,0.0030221618,0.0018227119,0.001375606,0.00054648065],"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.00016932517,0.00011292285,0.0021761376,0.0001382461,0.00008323885,0.00012985559,0.00017635197,0.6876745,0.0065464154,0.079896,0.0050916015,0.21780545],"study_design_scores_gemma":[0.0000038638377,0.000015690672,0.000109119865,0.0000049083455,0.0000054006478,0.000018445702,0.000011507271,0.9657737,0.0011646864,0.03226502,0.00062397646,0.000003745664],"about_ca_topic_score_codex":0.0045009945,"about_ca_topic_score_gemma":0.0086033745,"teacher_disagreement_score":0.0045009945,"about_ca_system_score_codex":0.0008555366,"about_ca_system_score_gemma":0.0006647865,"threshold_uncertainty_score":0.008949578},"labels":[],"label_agreement":null},{"id":"W3164865299","doi":"10.48550/arxiv.2105.11118","title":"Dorylus: Affordable, Scalable, and Accurate GNN Training with Distributed CPU Servers and Serverless Threads","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":19,"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":"Computer science; Server; Scalability; Parallel computing; Queue; Web server; Distributed computing; Operating system; Computer network; The Internet","score_opus":0.06297088811227082,"score_gpt":0.18424410990230114,"score_spread":0.12127322179003032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164865299","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.08366712,0.0016837176,0.69622445,0.0014212087,0.00077412796,0.00031377847,0.002498064,0.18712917,0.026288342],"genre_scores_gemma":[0.4474585,0.0005947286,0.52109003,0.0009056775,0.00011773645,0.00042118374,0.00794251,0.0055083176,0.015961353],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99929225,0.00012475174,0.000029328994,0.0002496343,0.00020180248,0.00010217484],"domain_scores_gemma":[0.9991264,0.00024588456,0.00005170606,0.0003001147,0.0001746175,0.00010136385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079730863,0.001358134,0.00059061835,0.00062426645,0.00056444574,0.0010635073,0.003101131,0.0008798619,0.010747779],"category_scores_gemma":[0.0036262518,0.0008176285,0.00060471107,0.0007329325,0.00072655466,0.0027768922,0.0022432106,0.0019523193,0.004213853],"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.0018837685,0.0005553462,0.005251443,0.0006902519,0.00026277968,0.00036119975,0.00029353713,0.26341325,0.022902457,0.035694137,0.20525426,0.4634376],"study_design_scores_gemma":[0.00022576138,0.000110600464,0.0005930354,0.000023591085,0.00002065732,0.000074244286,0.00004570186,0.96054536,0.009026621,0.012797142,0.016508041,0.000029202754],"about_ca_topic_score_codex":0.010053569,"about_ca_topic_score_gemma":0.018698756,"teacher_disagreement_score":0.010747779,"about_ca_system_score_codex":0.0015699861,"about_ca_system_score_gemma":0.0019971754,"threshold_uncertainty_score":0.035954952},"labels":[],"label_agreement":null},{"id":"W3164924750","doi":"10.2196/28218","title":"Head and Tail Entity Fusion Model in Medical Knowledge Graph Construction: Case Study for Pituitary Adenoma","year":2021,"lang":"en","type":"article","venue":"JMIR Medical Informatics","topic":"Advanced Graph Neural Networks","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":"Chinese Academy of Medical Sciences Initiative for Innovative Medicine; Peking Union Medical College; Chinese Academy of Medical Sciences","keywords":"Computer science; Pituitary adenoma; Artificial intelligence; Graph; Economic shortage; Machine learning; Information retrieval; Natural language processing; Adenoma; Medicine; Pathology","score_opus":0.02464694647546247,"score_gpt":0.33066999365689026,"score_spread":0.3060230471814278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164924750","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.3477732,0.0010502877,0.6384593,0.0021821398,0.00010461951,0.0011043423,0.003144071,0.0020879214,0.0040941294],"genre_scores_gemma":[0.62819123,0.00048224445,0.36571825,0.00015520059,0.000030254349,0.0002802138,0.0038679428,0.00008615472,0.0011884863],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972277,0.0011977286,0.0002658586,0.0005142776,0.0006671945,0.00012727563],"domain_scores_gemma":[0.99189407,0.0058260933,0.00042641972,0.000816585,0.00082073925,0.00021615547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046072076,0.0006441578,0.00040559523,0.0029824204,0.0013100435,0.0010884943,0.0010998778,0.001532161,0.0010959097],"category_scores_gemma":[0.011372652,0.00028104815,0.0014442627,0.0030170686,0.00071154116,0.0030636468,0.0016941412,0.0010808932,0.0002648664],"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.00096363295,0.0012297819,0.10274998,0.0014217431,0.0005925382,0.016491942,0.00546453,0.21317485,0.018932166,0.04340419,0.01356034,0.58201426],"study_design_scores_gemma":[0.000087986824,0.0003104754,0.01892372,0.00015564708,0.00045884636,0.0037081037,0.002257524,0.8909518,0.030179761,0.027329085,0.025524441,0.00011251036],"about_ca_topic_score_codex":0.016912201,"about_ca_topic_score_gemma":0.021699337,"teacher_disagreement_score":0.016912201,"about_ca_system_score_codex":0.0014646093,"about_ca_system_score_gemma":0.0016734718,"threshold_uncertainty_score":0.03362751},"labels":[],"label_agreement":null},{"id":"W3165146808","doi":"10.1016/j.ailsci.2022.100036","title":"Understanding the performance of knowledge graph embeddings in drug discovery","year":2022,"lang":"en","type":"article","venue":"Artificial Intelligence in the Life Sciences","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":62,"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; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Ranking (information retrieval); Identification (biology); Context (archaeology); Domain knowledge; Machine learning; Hyperparameter; Graph; Drug discovery; Knowledge graph; Embedding; Process (computing); Data science; Artificial intelligence; Data mining; Theoretical computer science; Bioinformatics","score_opus":0.11443593632942002,"score_gpt":0.31981953615235975,"score_spread":0.20538359982293974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165146808","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.8564304,0.008681369,0.110155664,0.0066337367,0.00039639,0.00027499284,0.0030570237,0.0027575917,0.011612802],"genre_scores_gemma":[0.9645871,0.0014011689,0.028227253,0.0003307769,0.000077930985,0.00005521478,0.0039850525,0.00013630126,0.0011991069],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972145,0.0015987529,0.00018009201,0.0005010577,0.00033647192,0.00016922953],"domain_scores_gemma":[0.97347045,0.021815138,0.0010933081,0.0021421392,0.0011458289,0.00033316945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008748568,0.0016064591,0.0009643794,0.0024897144,0.00053480576,0.0026879138,0.001179424,0.0022767186,0.001366622],"category_scores_gemma":[0.039549284,0.0005321159,0.0010317365,0.0018318319,0.0012081382,0.007482553,0.0017723476,0.0023875409,0.00082954974],"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.00054996257,0.00031677313,0.015244785,0.00032784845,0.00022064906,0.00007366878,0.00017858468,0.873693,0.0011897251,0.00495565,0.0039255596,0.09932374],"study_design_scores_gemma":[0.00001672109,0.00019157292,0.0013927626,0.000040664327,0.000034259425,0.000040251067,0.000077826655,0.98680854,0.0012043285,0.009465472,0.00070899195,0.000018648156],"about_ca_topic_score_codex":0.008467518,"about_ca_topic_score_gemma":0.008377296,"teacher_disagreement_score":0.008748568,"about_ca_system_score_codex":0.002018084,"about_ca_system_score_gemma":0.0010134715,"threshold_uncertainty_score":0.04626739},"labels":[],"label_agreement":null},{"id":"W3173856251","doi":"10.1109/tkde.2021.3090664","title":"Hierarchical Multi-View Graph Pooling with Structure Learning","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":78,"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":"National Natural Science Foundation of China","keywords":"Computer science; Pooling; Theoretical computer science; Graph; Upsampling; Artificial intelligence","score_opus":0.019042807564391837,"score_gpt":0.25704086656540814,"score_spread":0.2379980590010163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173856251","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.024473228,0.0004601093,0.9706002,0.00018068409,0.00006336943,0.00007065657,0.00020097589,0.0027250228,0.0012258762],"genre_scores_gemma":[0.5919028,0.0005893334,0.40001303,0.0005063817,0.00011763826,0.00017446584,0.00172288,0.00040128228,0.004572208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994746,0.00008988207,0.000023752595,0.00022481313,0.00010939195,0.00007764897],"domain_scores_gemma":[0.99945754,0.00012456372,0.00008199184,0.00018872005,0.00009560729,0.000051598992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080349576,0.0019622403,0.0014201589,0.0011987117,0.0004647678,0.000834914,0.0024502187,0.0012015977,0.0023808992],"category_scores_gemma":[0.0021095593,0.000510866,0.0015948708,0.0014841555,0.0008658304,0.0035017477,0.0020055377,0.001548621,0.0007173188],"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.0002470582,0.00025042618,0.0016875364,0.0002704109,0.0002936201,0.00022890896,0.00017050293,0.36891568,0.025855552,0.021681773,0.010687491,0.56971097],"study_design_scores_gemma":[0.000011239422,0.00007947481,0.0002977316,0.000007383136,0.000033343036,0.000045091143,0.000019343752,0.97841334,0.005332912,0.014737939,0.0010105078,0.000011787253],"about_ca_topic_score_codex":0.006221428,"about_ca_topic_score_gemma":0.010956993,"teacher_disagreement_score":0.006221428,"about_ca_system_score_codex":0.0010785973,"about_ca_system_score_gemma":0.0009897688,"threshold_uncertainty_score":0.012370408},"labels":[],"label_agreement":null},{"id":"W3174867666","doi":"10.48550/arxiv.2106.15755","title":"Dual GNNs: Graph Neural Network Learning with Limited Supervision","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","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":"Dual (grammatical number); Computer science; Graph; Artificial neural network; Artificial intelligence; Machine learning; Theoretical computer science","score_opus":0.04431417247660114,"score_gpt":0.17546804195336424,"score_spread":0.1311538694767631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174867666","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.02359513,0.00042823664,0.9713713,0.00035924473,0.00009821935,0.00008545506,0.00025224878,0.0021656915,0.0016445862],"genre_scores_gemma":[0.62898874,0.00048576508,0.36052135,0.00068537024,0.00012758361,0.0002444821,0.0020584727,0.00033841806,0.0065498315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992029,0.00021326532,0.000026060094,0.00031475286,0.00016475607,0.00007824954],"domain_scores_gemma":[0.99872273,0.00044979175,0.00014629788,0.00033850074,0.00025136294,0.00009135438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013579288,0.0012912153,0.0010459039,0.00085366005,0.00045171543,0.0007519686,0.003059464,0.0016270996,0.0017188265],"category_scores_gemma":[0.0046776067,0.0006013082,0.0006226585,0.00093728467,0.001203639,0.0025790883,0.0022227142,0.0023011072,0.0007491926],"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.0002260419,0.00017476462,0.0021080747,0.00013896875,0.000104411265,0.00012809828,0.00007842277,0.7251517,0.0038994516,0.016326737,0.0071411515,0.24452218],"study_design_scores_gemma":[0.0000056487734,0.000019971007,0.000098083394,0.0000041866015,0.000004949643,0.000013698698,0.0000046284526,0.990146,0.0005626727,0.008730759,0.00040553507,0.0000038803128],"about_ca_topic_score_codex":0.00698766,"about_ca_topic_score_gemma":0.012209818,"teacher_disagreement_score":0.00698766,"about_ca_system_score_codex":0.0011522357,"about_ca_system_score_gemma":0.0010500702,"threshold_uncertainty_score":0.013893962},"labels":[],"label_agreement":null},{"id":"W3185513611","doi":"10.1109/tkde.2022.3220948","title":"Rethinking Graph Auto-Encoder Models for Attributed Graph Clustering","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":72,"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é du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cluster analysis; Randomness; Computer science; Adjacency matrix; Correlation clustering; Feature (linguistics); Graph; Clustering coefficient; Encoder; Data mining; Pattern recognition (psychology); Theoretical computer science; Artificial intelligence; Algorithm; Mathematics; Statistics","score_opus":0.05141376820259933,"score_gpt":0.27064618378567723,"score_spread":0.2192324155830779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185513611","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.0055313404,0.00015878509,0.99244434,0.00017812857,0.00003301086,0.00003272153,0.00011286694,0.0007050357,0.0008036736],"genre_scores_gemma":[0.38894203,0.0006893813,0.5988596,0.0004419587,0.00013434408,0.00023075301,0.0009906252,0.00089167705,0.008819647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834406,0.0005924914,0.00007154192,0.00045814892,0.0004103802,0.00012343172],"domain_scores_gemma":[0.9956416,0.0020422905,0.00028784407,0.0012143904,0.00062845147,0.00018539382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024348046,0.0011326715,0.0011702992,0.0011844153,0.0006724589,0.0016363575,0.0035684044,0.0019169434,0.0024868953],"category_scores_gemma":[0.008733813,0.00077472883,0.0012298996,0.0012885001,0.001603412,0.0036678065,0.0027195702,0.0030519047,0.0013712902],"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.00009675703,0.00007987524,0.00083645975,0.00013060114,0.00007806214,0.0000989495,0.00022910308,0.76429313,0.002997769,0.13559486,0.0029974794,0.09256693],"study_design_scores_gemma":[0.0000040869672,0.000009832629,0.000034225934,0.0000054454745,0.0000045471925,0.000015648031,0.000008982327,0.97494954,0.000699477,0.023595238,0.00066629826,0.0000067560172],"about_ca_topic_score_codex":0.0076794964,"about_ca_topic_score_gemma":0.011984061,"teacher_disagreement_score":0.0076794964,"about_ca_system_score_codex":0.0020411897,"about_ca_system_score_gemma":0.0021038945,"threshold_uncertainty_score":0.0152695775},"labels":[],"label_agreement":null},{"id":"W3191294170","doi":"","title":"HNHN: Hypergraph Networks With Hyperedge Neurons","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Advanced Graph Neural Networks","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","funders":"","keywords":"Hypergraph; Normalization (sociology); Cardinality (data modeling); Computer science; Representation (politics); Convolution (computer science); Theoretical computer science; Nonlinear system; Artificial intelligence; Pattern recognition (psychology); Artificial neural network; Data mining; Mathematics; Discrete mathematics","score_opus":0.034173267919214864,"score_gpt":0.25821426540436776,"score_spread":0.22404099748515288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3191294170","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.024377592,0.0005353938,0.9680858,0.00048432357,0.00008724781,0.000101777594,0.0009324036,0.0023683314,0.003027112],"genre_scores_gemma":[0.48250064,0.0011319199,0.4983452,0.0010154181,0.00016365666,0.000482255,0.004434337,0.00042926986,0.011497208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948764,0.00018377935,0.00002232967,0.00015835551,0.000098517114,0.00004937145],"domain_scores_gemma":[0.99923134,0.00029889398,0.000086151675,0.00018782796,0.00014179066,0.00005406923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000804966,0.00076649396,0.00055645313,0.0012437103,0.000420382,0.0010012076,0.001689064,0.0011873664,0.002578351],"category_scores_gemma":[0.0031327012,0.00043267294,0.0006932704,0.0016772122,0.0007770053,0.0028108226,0.0014043709,0.0015123262,0.0009551197],"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.00025790336,0.00016197814,0.003118657,0.00033866585,0.00020048245,0.0002058665,0.00020827442,0.46081936,0.013485877,0.0711098,0.020046903,0.43004626],"study_design_scores_gemma":[0.000009969901,0.00003314877,0.00044882682,0.000018792502,0.000017083456,0.000049081853,0.000023776029,0.9513888,0.002729002,0.04141374,0.0038530377,0.000014830349],"about_ca_topic_score_codex":0.004714233,"about_ca_topic_score_gemma":0.009026483,"teacher_disagreement_score":0.004714233,"about_ca_system_score_codex":0.0010802848,"about_ca_system_score_gemma":0.0007504402,"threshold_uncertainty_score":0.009373546},"labels":[],"label_agreement":null},{"id":"W3193696571","doi":"10.1145/3447548.3469470","title":"The Sixth International Workshop on Deep Learning on Graphs - Methods and Applications (DLG-KDD'21)","year":2021,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Deep learning; Computer science; Artificial intelligence; Intersection (aeronautics); Data science; Deep neural networks; Machine learning; Engineering","score_opus":0.01897514661675541,"score_gpt":0.3376686163242991,"score_spread":0.3186934697075437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193696571","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.010313753,0.055720326,0.79306227,0.042055514,0.045230232,0.0006319313,0.007026148,0.004781714,0.041178096],"genre_scores_gemma":[0.0926652,0.049084384,0.6512128,0.014933322,0.012090125,0.00095297565,0.028467033,0.0034720416,0.14712209],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99530303,0.0016525757,0.00031321927,0.0010007261,0.0012707671,0.00045966718],"domain_scores_gemma":[0.99250424,0.0028939086,0.00015934974,0.0013005456,0.0020885519,0.0010534489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009809632,0.0018758872,0.0027154153,0.0031702586,0.00087326113,0.0053502903,0.004359229,0.0032052442,0.020522626],"category_scores_gemma":[0.013354043,0.001028794,0.0026036769,0.0029362596,0.0015997048,0.005492016,0.0044603627,0.0072006807,0.008815112],"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.00022975937,0.0003182983,0.00066600606,0.000527476,0.0002183857,0.00014491667,0.00022424189,0.017457763,0.0011915913,0.061920114,0.49427176,0.4228297],"study_design_scores_gemma":[0.00010570382,0.0001629265,0.001204349,0.0005791329,0.00010875499,0.00029280252,0.00018489918,0.10032941,0.003235132,0.14197756,0.7517315,0.00008789166],"about_ca_topic_score_codex":0.008945823,"about_ca_topic_score_gemma":0.012091445,"teacher_disagreement_score":0.020522626,"about_ca_system_score_codex":0.0036732473,"about_ca_system_score_gemma":0.0042065023,"threshold_uncertainty_score":0.068655014},"labels":[],"label_agreement":null},{"id":"W3195085629","doi":"10.1145/3447548.3470820","title":"Deep Learning on Graphs for Natural Language Processing","year":2021,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Université de Montréal","funders":"","keywords":"Computer science; Deep learning; Artificial intelligence; Graph; Expressive power; Theoretical computer science; Natural language processing","score_opus":0.009230094958074402,"score_gpt":0.2662218188347842,"score_spread":0.25699172387670977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195085629","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.0035980039,0.0062537827,0.9744848,0.0033345714,0.00031505595,0.00007908938,0.0023907344,0.0029560972,0.0065878537],"genre_scores_gemma":[0.24878146,0.021355359,0.6945326,0.002308907,0.0007955995,0.0005417281,0.014309752,0.0013264741,0.01604815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907035,0.0002947926,0.000058600264,0.00028710163,0.00023576325,0.00005340176],"domain_scores_gemma":[0.9981469,0.0010831852,0.00014482066,0.00031343134,0.00024599276,0.00006574691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088455365,0.0010124211,0.0008129067,0.0022349567,0.00066595356,0.0020564592,0.0014021298,0.0013915435,0.008927216],"category_scores_gemma":[0.00571958,0.0005616305,0.0012245306,0.0030222824,0.0013537427,0.00433831,0.0017747553,0.0035370842,0.0033971532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080019905,0.00008889561,0.00085677684,0.0009917227,0.00015105598,0.00017672103,0.00021111884,0.104708545,0.0029574493,0.48460537,0.06319391,0.34197837],"study_design_scores_gemma":[0.000008924725,0.000013642236,0.00023942131,0.000112406015,0.0000148816725,0.000045404653,0.00003662524,0.23246855,0.00084001874,0.7352418,0.030960722,0.000017630255],"about_ca_topic_score_codex":0.0057030595,"about_ca_topic_score_gemma":0.0101462845,"teacher_disagreement_score":0.008927216,"about_ca_system_score_codex":0.0018183041,"about_ca_system_score_gemma":0.0012728906,"threshold_uncertainty_score":0.02986455},"labels":[],"label_agreement":null},{"id":"W3198596759","doi":"10.1109/icpads53394.2021.00086","title":"Efficient Asynchronous GCN Training on a GPU Cluster","year":2021,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Concordia University","funders":"","keywords":"Computer science; GPU cluster; Asynchronous communication; Cluster (spacecraft); Parallel computing; Training (meteorology); CUDA; Operating system; Computer network","score_opus":0.021106579383279703,"score_gpt":0.2511754930666025,"score_spread":0.23006891368332277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198596759","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.1978113,0.00055298227,0.7726675,0.00064473593,0.00023438895,0.00018375095,0.00032342682,0.01390153,0.01368033],"genre_scores_gemma":[0.7388243,0.00014319421,0.25467008,0.0001547215,0.00003461564,0.00015080495,0.0006455361,0.00032577707,0.005050982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996039,0.00007522987,0.000018824747,0.000104936145,0.00012582615,0.00007123002],"domain_scores_gemma":[0.99923146,0.00022902164,0.000044626973,0.00023905044,0.0001817544,0.00007405459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000498471,0.00063590327,0.00060111564,0.0003700762,0.0006019036,0.00060638256,0.0016711312,0.00052163476,0.0034135932],"category_scores_gemma":[0.0017343988,0.00027666677,0.00031105353,0.00062346854,0.00041139487,0.0011531843,0.00090729207,0.00080326264,0.0007714384],"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.000685584,0.0001959671,0.0023806556,0.00016288705,0.00007433045,0.00024991835,0.00021196193,0.69245565,0.017495792,0.009264351,0.014808074,0.2620148],"study_design_scores_gemma":[0.000024160934,0.000030390354,0.000207306,0.0000024651908,0.0000051570146,0.000016113636,0.000026649059,0.99457234,0.0021636223,0.0019184579,0.0010298426,0.000003571046],"about_ca_topic_score_codex":0.01435865,"about_ca_topic_score_gemma":0.026971549,"teacher_disagreement_score":0.01435865,"about_ca_system_score_codex":0.0011135644,"about_ca_system_score_gemma":0.0016798337,"threshold_uncertainty_score":0.028550148},"labels":[],"label_agreement":null},{"id":"W3201040314","doi":"10.1109/ijcnn52387.2021.9533416","title":"HRotatE: Hybrid Relational Rotation Embedding for Knowledge Graph","year":2021,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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 Windsor","funders":"","keywords":"Embedding; Computer science; Graph embedding; Theoretical computer science; Inverse; Simple (philosophy); Vector space; Graph; Artificial intelligence; Algorithm; Mathematics; Pure mathematics","score_opus":0.029366799314035682,"score_gpt":0.2961394055398517,"score_spread":0.266772606225816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201040314","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.020677606,0.0017508388,0.9515222,0.00040814362,0.00022554045,0.00029305558,0.0052941646,0.016526831,0.0033017495],"genre_scores_gemma":[0.27110738,0.002422075,0.675886,0.00041028988,0.00017773679,0.00049657247,0.038470954,0.0010420037,0.009986998],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898785,0.00020372235,0.000060075086,0.00039769302,0.00027340002,0.00007721831],"domain_scores_gemma":[0.9988619,0.00026940758,0.00012554991,0.00047738588,0.00019573387,0.00007010352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060799567,0.0023256196,0.0011674738,0.0028233833,0.00055596273,0.001419182,0.0018532559,0.0011299665,0.005413928],"category_scores_gemma":[0.0036664542,0.00063438626,0.0019224031,0.0027643405,0.0006672833,0.0045761294,0.0021398305,0.0023451517,0.0031541681],"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.00030566027,0.00033521684,0.0028298842,0.0005465018,0.00028628134,0.00022174002,0.00023276971,0.111703925,0.0069236164,0.020936294,0.0406091,0.81506896],"study_design_scores_gemma":[0.00004523769,0.00013294817,0.0010665457,0.000057498935,0.000070723145,0.00021261354,0.000115194955,0.94446903,0.004714416,0.029467419,0.01958936,0.000058901285],"about_ca_topic_score_codex":0.013195798,"about_ca_topic_score_gemma":0.02299151,"teacher_disagreement_score":0.013195798,"about_ca_system_score_codex":0.0010466439,"about_ca_system_score_gemma":0.0013907393,"threshold_uncertainty_score":0.026238024},"labels":[],"label_agreement":null},{"id":"W3201435050","doi":"10.1016/j.simpa.2021.100139","title":"TopoDetect: Framework for topological features detection in graph embeddings","year":2021,"lang":"en","type":"article","venue":"Software Impacts","topic":"Advanced Graph Neural Networks","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":"Topological data analysis; Cluster analysis; Python (programming language); Visualization; Graph; Topology (electrical circuits); Representation (politics); Data visualization; Clustering coefficient","score_opus":0.015535897344814184,"score_gpt":0.2952982538924351,"score_spread":0.2797623565476209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201435050","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.0044981395,0.00022665967,0.7159902,0.00018904166,0.0001345119,0.00015291259,0.014740384,0.26132166,0.0027464903],"genre_scores_gemma":[0.10012664,0.00083195703,0.7580736,0.00053060305,0.000103386476,0.0015008003,0.06197394,0.06893661,0.007922491],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956304,0.00006110747,0.00003612713,0.000112548405,0.00017377512,0.00005347168],"domain_scores_gemma":[0.999151,0.00036284036,0.00007051927,0.000187134,0.00016629018,0.00006226154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067406555,0.0020000706,0.0012107678,0.0022251816,0.00058415584,0.0028950158,0.0026828197,0.0011165704,0.03177964],"category_scores_gemma":[0.0051814183,0.0011458091,0.002127115,0.0015920451,0.0007216391,0.0035116102,0.003006995,0.0027900722,0.0118860165],"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.00057022314,0.00029553202,0.006026836,0.0033832868,0.0006065979,0.0009803963,0.0010427088,0.07998241,0.022924744,0.06612458,0.47382933,0.34423342],"study_design_scores_gemma":[0.00018594165,0.00009283079,0.0026978217,0.00023908328,0.00009355459,0.0009483372,0.0002251897,0.7108462,0.02244337,0.12664132,0.13537052,0.0002157971],"about_ca_topic_score_codex":0.0029758303,"about_ca_topic_score_gemma":0.0068034,"teacher_disagreement_score":0.03177964,"about_ca_system_score_codex":0.0007581836,"about_ca_system_score_gemma":0.0012442387,"threshold_uncertainty_score":0.10631353},"labels":[],"label_agreement":null},{"id":"W3203331145","doi":"10.48550/arxiv.2110.00577","title":"Reconstruction for Powerful Graph Representations","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","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":"Polytechnique Montréal","funders":"","keywords":"Expressive power; Scalability; Computer science; Leverage (statistics); Theoretical computer science; Graph; Artificial intelligence","score_opus":0.06471616162971469,"score_gpt":0.2085219120755669,"score_spread":0.1438057504458522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203331145","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.05092387,0.0006159544,0.9353163,0.0015617657,0.00008844221,0.000091835806,0.00086482766,0.0032182815,0.007318777],"genre_scores_gemma":[0.58736694,0.0009871728,0.39868602,0.000972021,0.00012280082,0.0002881349,0.0037159298,0.00076240156,0.0070986147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989969,0.00030503512,0.000051384628,0.0003284565,0.00023976869,0.00007848727],"domain_scores_gemma":[0.9974891,0.0011540893,0.00018217435,0.0009037239,0.00020090117,0.00006991689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011472463,0.0009562042,0.00057430565,0.0010480927,0.00051605236,0.0013290473,0.0020998158,0.0011682103,0.0045937547],"category_scores_gemma":[0.008624936,0.00052504806,0.0011634218,0.0009020099,0.0016064087,0.0054500317,0.002386266,0.0028292898,0.0012187354],"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.00018083771,0.000115216986,0.0021902795,0.0005270857,0.00009971598,0.00021787868,0.00033451422,0.4643447,0.011257224,0.26635298,0.012182232,0.24219741],"study_design_scores_gemma":[0.000016271668,0.000035251232,0.00020707399,0.00003468314,0.000018840467,0.000088875335,0.000057505655,0.74935395,0.0031573353,0.24183509,0.0051831207,0.000011986744],"about_ca_topic_score_codex":0.0019452698,"about_ca_topic_score_gemma":0.004398277,"teacher_disagreement_score":0.0045937547,"about_ca_system_score_codex":0.0013047737,"about_ca_system_score_gemma":0.00070485123,"threshold_uncertainty_score":0.015367687},"labels":[],"label_agreement":null},{"id":"W3208642674","doi":"10.1145/3460210.3493557","title":"User Scored Evaluation of Non-Unique Explanations for Relational Graph Convolutional Network Link Prediction on Knowledge Graphs","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Neural Networks","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":"Thales (Canada)","funders":"","keywords":"Computer science; Ground truth; Benchmark (surveying); Link (geometry); Graph; Relevance (law); Machine learning; Task (project management); Artificial intelligence; Data mining; Theoretical computer science","score_opus":0.05815114462211044,"score_gpt":0.31780676461458407,"score_spread":0.2596556199924736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208642674","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.8573769,0.004758126,0.08507058,0.0009850758,0.0003905065,0.0005815326,0.019500995,0.019299662,0.012036601],"genre_scores_gemma":[0.8645658,0.0005373078,0.09506149,0.00029349976,0.00005839447,0.00027849097,0.035018407,0.0004516877,0.0037347951],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940799,0.0029224649,0.00046594976,0.0012410833,0.0010397057,0.00025080502],"domain_scores_gemma":[0.9617391,0.03034013,0.0013979675,0.0032975029,0.002507033,0.00071822497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005855246,0.001947631,0.0006937558,0.0026990997,0.00047933584,0.0014039042,0.0014806702,0.0025279953,0.0054345927],"category_scores_gemma":[0.04267836,0.0002829115,0.00095944933,0.0013715142,0.00066711294,0.0023750474,0.001560369,0.001313468,0.0012531995],"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.006995422,0.0019168351,0.09136222,0.0037635579,0.0015389106,0.0012912074,0.001646133,0.16200463,0.012869393,0.005223757,0.085160695,0.6262272],"study_design_scores_gemma":[0.0004959578,0.0012289023,0.04017562,0.0003421771,0.00028551108,0.0006972262,0.00061025814,0.9190893,0.014283864,0.006357523,0.016291214,0.00014239529],"about_ca_topic_score_codex":0.008370553,"about_ca_topic_score_gemma":0.023058845,"teacher_disagreement_score":0.008370553,"about_ca_system_score_codex":0.0011242058,"about_ca_system_score_gemma":0.0008159967,"threshold_uncertainty_score":0.030965865},"labels":[],"label_agreement":null},{"id":"W3210430800","doi":"10.1145/3459637.3482277","title":"Modeling Heterogeneous Graph Network on Fraud Detection","year":2021,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Computer science; Homogeneous; Revenue; Graph; Aggregate (composite); Reputation; Attention network; Focus (optics); Data mining; Machine learning; Theoretical computer science; Artificial intelligence","score_opus":0.01621942588173742,"score_gpt":0.23099620517143263,"score_spread":0.2147767792896952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210430800","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.16835171,0.0021865065,0.82167983,0.0019553883,0.0001745335,0.00012679443,0.00055772316,0.0006560079,0.0043115164],"genre_scores_gemma":[0.95640326,0.0010477246,0.038215905,0.00022641828,0.00010554803,0.00010047652,0.0005415094,0.00005817054,0.0033010384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928015,0.00025536446,0.000026348605,0.00022193897,0.000118583484,0.000097664844],"domain_scores_gemma":[0.9973922,0.001538609,0.00041271653,0.00015095182,0.00038565538,0.00011981335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015079525,0.001062101,0.0008366426,0.0021344675,0.00061946036,0.0010267142,0.0016180812,0.001479456,0.0012787337],"category_scores_gemma":[0.0070196483,0.0004908141,0.0009838571,0.0015848157,0.00088457303,0.001986509,0.0011225914,0.0011285675,0.00024893307],"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.00009454562,0.00005694405,0.007210399,0.00007934177,0.00007395642,0.00031117848,0.000117812706,0.94020987,0.0006885846,0.014823666,0.0018533366,0.034480345],"study_design_scores_gemma":[0.000003232127,0.0000066394186,0.00043541248,0.000004609819,0.000011077993,0.000026020516,0.000007139262,0.9932681,0.00006786663,0.0059069362,0.00025917403,0.0000037463985],"about_ca_topic_score_codex":0.019806337,"about_ca_topic_score_gemma":0.014123278,"teacher_disagreement_score":0.019806337,"about_ca_system_score_codex":0.0016954165,"about_ca_system_score_gemma":0.00085607974,"threshold_uncertainty_score":0.0393821},"labels":[],"label_agreement":null},{"id":"W3210798976","doi":"10.1109/dsaa53316.2021.9564221","title":"Centrality-based Interpretability Measures for Graph Embeddings","year":2021,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"York University","funders":"","keywords":"Interpretability; Centrality; Computer science; Adjacency matrix; Graph embedding; Theoretical computer science; Graph property; Embedding; Graph; Voltage graph; Line graph; Artificial intelligence; Mathematics; Combinatorics","score_opus":0.019197584603886948,"score_gpt":0.2762961420567983,"score_spread":0.2570985574529114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210798976","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.14190252,0.0021991264,0.84548247,0.0014692561,0.00023302854,0.00018836415,0.0009605193,0.0005504755,0.0070142634],"genre_scores_gemma":[0.8864954,0.00081153144,0.10944569,0.00017810003,0.00038958466,0.0002702664,0.0012612814,0.00021057243,0.0009375139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99408495,0.002629788,0.00045812535,0.0009006887,0.0017183928,0.00020792792],"domain_scores_gemma":[0.94584215,0.03922273,0.006169997,0.0039512166,0.0039668926,0.00084705197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005415824,0.0015467,0.00079417514,0.008129767,0.00079849595,0.0031567689,0.0012222718,0.0017227377,0.0024109741],"category_scores_gemma":[0.06258966,0.00033675932,0.00091596105,0.00526068,0.0033262703,0.009829095,0.0019550333,0.002730193,0.00031803167],"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.00057052524,0.00035163187,0.026735002,0.0011847205,0.00042417122,0.0006813897,0.0031488547,0.16256802,0.011784066,0.5462518,0.006721869,0.23957793],"study_design_scores_gemma":[0.000049610695,0.00023201571,0.0083991345,0.00020285066,0.00011697799,0.00052306894,0.0007801308,0.39780042,0.0039102933,0.5828163,0.0050634234,0.000105805455],"about_ca_topic_score_codex":0.0007024565,"about_ca_topic_score_gemma":0.0007093867,"teacher_disagreement_score":0.008129767,"about_ca_system_score_codex":0.0014921977,"about_ca_system_score_gemma":0.0003782416,"threshold_uncertainty_score":0.028641999},"labels":[],"label_agreement":null},{"id":"W3211455799","doi":"10.1145/3486622.3493921","title":"Linked Data Ground Truth for Quantitative and Qualitative Evaluation of Explanations for Relational Graph Convolutional Network Link Prediction on Knowledge Graphs","year":2021,"lang":"en","type":"article","venue":"IEEE/WIC/ACM International Conference on Web Intelligence","topic":"Advanced Graph Neural Networks","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":"Thales (Canada)","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Ground truth; Leverage (statistics); Convolutional neural network; Benchmark (surveying); Graph; Data mining; Machine learning; Metric (unit); Theoretical computer science; Artificial intelligence","score_opus":0.40021149378191556,"score_gpt":0.459318220150168,"score_spread":0.05910672636825243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211455799","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.36626613,0.004324444,0.5603115,0.0022410564,0.00034613075,0.0006434063,0.04158832,0.012900379,0.011378631],"genre_scores_gemma":[0.76251936,0.0004512177,0.1921599,0.00030000735,0.00006552241,0.00033545087,0.04261075,0.0003385991,0.0012191142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932054,0.0027837602,0.00050912687,0.0013184757,0.0019340123,0.0002491568],"domain_scores_gemma":[0.96096134,0.025329864,0.0033978098,0.005769152,0.004019582,0.0005222533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006723693,0.0013176868,0.00056017155,0.00630821,0.00069278426,0.0020160847,0.0018322312,0.0026897986,0.0044294186],"category_scores_gemma":[0.063253745,0.00028121995,0.0009844229,0.0035347573,0.001403967,0.0050249393,0.002378059,0.0016446484,0.000818681],"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.001437961,0.00069717655,0.080169976,0.0024568741,0.00095543615,0.00053523754,0.0009876328,0.43898463,0.0051627937,0.05596121,0.03167125,0.38097987],"study_design_scores_gemma":[0.00008876294,0.00019610344,0.01047691,0.00031683527,0.000119969416,0.00014947716,0.00040570518,0.9207714,0.007973621,0.05196071,0.007489234,0.000051192364],"about_ca_topic_score_codex":0.006600156,"about_ca_topic_score_gemma":0.014744939,"teacher_disagreement_score":0.006723693,"about_ca_system_score_codex":0.0023267858,"about_ca_system_score_gemma":0.0014824126,"threshold_uncertainty_score":0.0355587},"labels":[],"label_agreement":null},{"id":"W3212564326","doi":"","title":"Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Graph Neural Networks","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":"HEC Montréal; Université de Montréal","funders":"","keywords":"Computer science; Longest path problem; Artificial neural network; Path (computing); Shortest path problem; Operator (biology); Mathematical optimization; Graph; Representation (politics); Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.018386948677528908,"score_gpt":0.2599354822932214,"score_spread":0.24154853361569248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212564326","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.004114675,0.0007787369,0.9930213,0.00032361908,0.00006127589,0.000041491083,0.00020530577,0.00033670542,0.0011168846],"genre_scores_gemma":[0.39132753,0.0034820952,0.5928783,0.0005794757,0.00023829729,0.0004373219,0.0016899484,0.00021828372,0.009148853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994168,0.00017107911,0.000028930814,0.00021015175,0.00011492436,0.000058053676],"domain_scores_gemma":[0.9989135,0.0006120846,0.000104331695,0.000102945225,0.00022001562,0.000047059497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013910374,0.0013048912,0.0011457648,0.0014166947,0.00052359025,0.001015641,0.0029772,0.0017870732,0.0030033847],"category_scores_gemma":[0.004066811,0.0006082794,0.00080511364,0.0022149412,0.0011896741,0.0033661025,0.0009964235,0.002337888,0.00065186154],"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.000057695263,0.000045973324,0.0006236171,0.000125615,0.000059726182,0.000062962616,0.00005089065,0.84026706,0.00079515314,0.057281923,0.0047036163,0.09592572],"study_design_scores_gemma":[0.000003169175,0.000008305872,0.000048718517,0.0000066109824,0.0000060636517,0.000007927378,0.0000034070688,0.9794382,0.00017390806,0.019598009,0.00070137234,0.0000043513623],"about_ca_topic_score_codex":0.017637638,"about_ca_topic_score_gemma":0.015082421,"teacher_disagreement_score":0.017637638,"about_ca_system_score_codex":0.0020184193,"about_ca_system_score_gemma":0.0017130051,"threshold_uncertainty_score":0.035069942},"labels":[],"label_agreement":null},{"id":"W3212747350","doi":"10.1145/3483940","title":"On Directed Densest Subgraph Discovery","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Database Systems","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":32,"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","funders":"University of Hong Kong; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Scalability; Induced subgraph isomorphism problem; Enhanced Data Rates for GSM Evolution; Core (optical fiber); Graph; Directed graph; Subgraph isomorphism problem; Efficient algorithm; Theoretical computer science; Algorithm; Artificial intelligence; Database; Line graph","score_opus":0.019904467790991108,"score_gpt":0.25218275451067046,"score_spread":0.23227828671967934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212747350","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.033440087,0.0025198297,0.95139027,0.0020175944,0.00015991881,0.00041294433,0.0025699807,0.003544391,0.0039450293],"genre_scores_gemma":[0.19730648,0.0017132285,0.7843827,0.00083722745,0.0002764254,0.0003793303,0.009217323,0.0005950376,0.005292333],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964361,0.0008633066,0.000181354,0.0012271212,0.0009943385,0.00029774648],"domain_scores_gemma":[0.9907951,0.004780336,0.0008681868,0.0022019628,0.0010138465,0.00034054922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002531888,0.0018173116,0.0021752382,0.0053232145,0.0017908016,0.0024547263,0.0033818346,0.0021393155,0.0032855086],"category_scores_gemma":[0.016998945,0.0013108373,0.0018062528,0.008397704,0.0019107759,0.0063310754,0.0036704824,0.002197367,0.0015134139],"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.00043757702,0.00043497828,0.009328983,0.0011721901,0.0003538116,0.00060778414,0.0007827538,0.31724343,0.0050591594,0.0930625,0.056563962,0.5149528],"study_design_scores_gemma":[0.00007890674,0.00007170536,0.0012896002,0.000078656405,0.00007589885,0.0005020746,0.00029828036,0.80215275,0.0029857496,0.17678812,0.0156404,0.000037819704],"about_ca_topic_score_codex":0.01427237,"about_ca_topic_score_gemma":0.020549875,"teacher_disagreement_score":0.01427237,"about_ca_system_score_codex":0.002419546,"about_ca_system_score_gemma":0.003373355,"threshold_uncertainty_score":0.028378546},"labels":[],"label_agreement":null},{"id":"W3213054824","doi":"","title":"How to transfer algorithmic reasoning knowledge to learn new algorithms","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","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":"HEC Montréal; Université de Montréal","funders":"","keywords":"Computer science; Artificial intelligence; Dijkstra's algorithm; Graph; Machine learning; Algorithm; Set (abstract data type); Theoretical computer science; Programming language","score_opus":0.06041843821256871,"score_gpt":0.20464863764769903,"score_spread":0.14423019943513032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213054824","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.122322306,0.0010768519,0.85751104,0.0037935686,0.00015908889,0.00039272834,0.00059160404,0.004973328,0.009179505],"genre_scores_gemma":[0.46585184,0.0009457559,0.52652836,0.00089458295,0.00012453401,0.00043968693,0.0019114299,0.00059455034,0.0027092665],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99640924,0.0013366509,0.00025457278,0.0011056418,0.0006654073,0.00022849525],"domain_scores_gemma":[0.9825125,0.009653064,0.0006985735,0.005954478,0.00090062345,0.00028088051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051207836,0.0013580001,0.00087344716,0.001215781,0.0006776029,0.002399155,0.0033996077,0.0023734234,0.003847119],"category_scores_gemma":[0.031285778,0.0008364461,0.0021206865,0.0012842905,0.0031798813,0.011617347,0.0033861399,0.005420333,0.0018370985],"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.0002900883,0.0007803288,0.0066892453,0.0009313187,0.000265148,0.00020173068,0.00081580103,0.2696818,0.010897084,0.072484605,0.0073533864,0.62960947],"study_design_scores_gemma":[0.000100313184,0.00022861165,0.0015306076,0.00010280365,0.00007812944,0.00013273784,0.00029272353,0.621035,0.012014052,0.35416102,0.010286769,0.00003727096],"about_ca_topic_score_codex":0.00180548,"about_ca_topic_score_gemma":0.0023136805,"teacher_disagreement_score":0.0051207836,"about_ca_system_score_codex":0.0016134714,"about_ca_system_score_gemma":0.001934958,"threshold_uncertainty_score":0.027081609},"labels":[],"label_agreement":null},{"id":"W3213281202","doi":"10.1109/mlsp52302.2021.9596169","title":"Data-Driven Learning of Geometric Scattering Modules for GNNs","year":2021,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Université de Montréal; Mila - Quebec Artificial Intelligence Institute; Université du Québec à Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; National Institutes of Health; Institut de Valorisation des Données; National Institute of General Medical Sciences; Canadian Institute for Advanced Research","keywords":"Wavelet; Computer science; Graph; Artificial intelligence; Pattern recognition (psychology); Range (aeronautics); Cascade; Theoretical computer science; Machine learning","score_opus":0.049691956675749806,"score_gpt":0.29246568542372925,"score_spread":0.24277372874797945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213281202","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.07766838,0.0001455785,0.9193807,0.00024960437,0.000035733876,0.000041738225,0.00012374508,0.0008339768,0.0015205251],"genre_scores_gemma":[0.7878893,0.00016023045,0.20769125,0.00026891267,0.00004470544,0.00014286205,0.0006850841,0.00018500948,0.002932541],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997968,0.000049312173,0.00000871336,0.0000684434,0.000048158377,0.000028651975],"domain_scores_gemma":[0.9993961,0.00024686716,0.0000835706,0.00009435643,0.0001288776,0.000050303795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067156355,0.00085432327,0.0006009094,0.00055259163,0.00024658244,0.00052082323,0.001471144,0.0009662298,0.0015403588],"category_scores_gemma":[0.0029317678,0.0003926737,0.0005313534,0.0005239432,0.00082644937,0.0013499273,0.0012536143,0.0012485374,0.0004152865],"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.00006666494,0.000073463736,0.001224878,0.000066071065,0.00004295445,0.00005815773,0.00004310908,0.89008546,0.009839103,0.012517393,0.0013377962,0.08464483],"study_design_scores_gemma":[0.0000023508608,0.0000105327335,0.000054819237,0.0000018400875,0.0000021777703,0.000005538284,0.0000024573733,0.9955778,0.00076135434,0.0034684164,0.000110729874,0.0000019030336],"about_ca_topic_score_codex":0.0019002851,"about_ca_topic_score_gemma":0.003626617,"teacher_disagreement_score":0.0019002851,"about_ca_system_score_codex":0.0007138936,"about_ca_system_score_gemma":0.00056242384,"threshold_uncertainty_score":0.0051797032},"labels":[],"label_agreement":null},{"id":"W3215411791","doi":"10.1145/3478285","title":"Embedding Hierarchical Structures for Venue Category Representation","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Advanced Graph Neural Networks","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":"York University; Wilfrid Laurier University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Embedding; Context (archaeology); Hierarchy; Representation (politics); Semantics (computer science); Information retrieval; Theoretical computer science; Artificial intelligence","score_opus":0.02585947478299782,"score_gpt":0.2997060619374764,"score_spread":0.27384658715447857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215411791","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.072477125,0.0022630699,0.9132767,0.0004164135,0.00011085109,0.00016491077,0.005280545,0.002387485,0.0036228576],"genre_scores_gemma":[0.7272247,0.00091907673,0.25702697,0.00017586294,0.000101384656,0.0003263259,0.010546636,0.00020453836,0.003474604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945194,0.00017424913,0.000033345204,0.00018143302,0.00009117416,0.00006784339],"domain_scores_gemma":[0.999086,0.00032778265,0.00009957869,0.00026006537,0.00016513775,0.00006139138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003965094,0.0007051969,0.0006308817,0.0030700206,0.0005837751,0.0007719918,0.0012474557,0.001008934,0.0026789235],"category_scores_gemma":[0.0030285676,0.0003035505,0.0008339948,0.0037536924,0.0005460789,0.0024131862,0.0013688423,0.0010667492,0.0010044752],"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.00046023735,0.0003363686,0.013879179,0.000827454,0.00025739655,0.00032060264,0.001226601,0.1776881,0.013517862,0.08284324,0.028164461,0.68047845],"study_design_scores_gemma":[0.000023529097,0.000086232234,0.0031067831,0.00006985157,0.000046480083,0.00016857918,0.00036801366,0.9084129,0.0023246317,0.07441385,0.010933676,0.00004552947],"about_ca_topic_score_codex":0.012268184,"about_ca_topic_score_gemma":0.0273934,"teacher_disagreement_score":0.012268184,"about_ca_system_score_codex":0.0007807628,"about_ca_system_score_gemma":0.00067250186,"threshold_uncertainty_score":0.024393559},"labels":[],"label_agreement":null},{"id":"W3215602957","doi":"10.6339/22-jds1047","title":"A Review on Graph Neural Network Methods in Financial Applications","year":2022,"lang":"en","type":"review","venue":"Journal of Data Science","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":122,"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":"Institute for Catastrophic Loss Reduction","keywords":"Computer science; Graph; Categorization; Artificial neural network; Financial modeling; Data mining; Data science; Finance; Artificial intelligence; Theoretical computer science; Business","score_opus":0.19864865051033517,"score_gpt":0.48307997417449006,"score_spread":0.2844313236641549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215602957","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.00090124743,0.95589626,0.028819215,0.0018086153,0.0012674071,0.00004691788,0.00020175408,0.00014029861,0.010918305],"genre_scores_gemma":[0.007899849,0.97111356,0.015506378,0.00056229916,0.0010675602,0.000053859596,0.00029766012,0.00004436542,0.003454514],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996111,0.0000788808,0.00005155753,0.00008673637,0.00014779772,0.000023951521],"domain_scores_gemma":[0.9986551,0.0008524285,0.00006955398,0.00004755303,0.00033985707,0.000035452777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010544579,0.0013507195,0.0010543274,0.002923572,0.000405476,0.0012728276,0.0015183476,0.0013708541,0.0065217544],"category_scores_gemma":[0.0031432137,0.00053139013,0.0008002613,0.005228167,0.0005888001,0.0026385465,0.00070129836,0.0014894642,0.003061124],"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.000031932086,0.00008004721,0.0006500353,0.008689305,0.00011619897,0.00013665638,0.000075052456,0.0076260697,0.0006482947,0.034048274,0.04630078,0.9015974],"study_design_scores_gemma":[0.000016172935,0.00011025855,0.0016746031,0.0052241846,0.0002164082,0.00076782075,0.000105184765,0.019927762,0.0012198361,0.04925986,0.92138726,0.000090721645],"about_ca_topic_score_codex":0.003963791,"about_ca_topic_score_gemma":0.0043921005,"teacher_disagreement_score":0.0065217544,"about_ca_system_score_codex":0.00091074227,"about_ca_system_score_gemma":0.0014490929,"threshold_uncertainty_score":0.021817446},"labels":[],"label_agreement":null},{"id":"W3217035451","doi":"10.1017/nws.2022.27","title":"A multi-purposed unsupervised framework for comparing embeddings of undirected and directed graphs","year":2022,"lang":"en","type":"article","venue":"Network Science","topic":"Advanced Graph Neural Networks","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":"Toronto Metropolitan University","funders":"","keywords":"Embedding; Computer science; Scalability; Theoretical computer science; Graph embedding; Graph; Node (physics); Topological graph theory; Set (abstract data type); Representation (politics); Undirected graph; Artificial intelligence; Line graph; Voltage graph","score_opus":0.028061766804376314,"score_gpt":0.283082251646283,"score_spread":0.25502048484190665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217035451","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.024857529,0.00024401216,0.97267073,0.00011660954,0.00003087662,0.00010000458,0.0002723025,0.0009384564,0.0007695165],"genre_scores_gemma":[0.4798542,0.00017401978,0.5160235,0.00013308995,0.00008704363,0.00029862564,0.001719969,0.0003695607,0.0013400085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961655,0.0015346804,0.00023744107,0.001094703,0.0007515275,0.00021614514],"domain_scores_gemma":[0.9931075,0.0027140232,0.0012065144,0.0010350716,0.0015804796,0.00035647358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004516106,0.0014327884,0.0012697714,0.0077186725,0.00076422095,0.0025845142,0.0027626809,0.001975305,0.0012760741],"category_scores_gemma":[0.014091251,0.0005870389,0.0011628269,0.0036182886,0.0017095137,0.003863712,0.0030223024,0.0018121506,0.0004062821],"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.0006173609,0.0005033527,0.012338803,0.00038183187,0.0005695388,0.0002829428,0.00040599107,0.5079826,0.017248472,0.050966416,0.0064516896,0.40225103],"study_design_scores_gemma":[0.000012005899,0.00006859069,0.0010920358,0.0000213027,0.00002246028,0.00006497779,0.00004528063,0.97332656,0.0018879846,0.02263247,0.000802742,0.000023630997],"about_ca_topic_score_codex":0.0028666542,"about_ca_topic_score_gemma":0.00546873,"teacher_disagreement_score":0.0077186725,"about_ca_system_score_codex":0.0016687901,"about_ca_system_score_gemma":0.0009497775,"threshold_uncertainty_score":0.02388376},"labels":[],"label_agreement":null},{"id":"W3217040326","doi":"10.1145/3471165","title":"Dual Gated Graph Attention Networks with Dynamic Iterative Training for Cross-Lingual Entity Alignment","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Advanced Graph Neural Networks","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":"York University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China; National Research Foundation Singapore","keywords":"Computer science; Attention network; Graph; Embedding; Iterative and incremental development; Benchmark (surveying); Dual (grammatical number); Process (computing); Machine learning; Artificial intelligence; Theoretical computer science; Data mining","score_opus":0.0196459319324312,"score_gpt":0.27745233427603794,"score_spread":0.25780640234360674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217040326","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.079362996,0.0021041618,0.9044634,0.0008095075,0.00021374441,0.00016088903,0.00037517393,0.0060586683,0.0064513874],"genre_scores_gemma":[0.82346815,0.00061945966,0.16459422,0.00095852115,0.00010389219,0.00021575097,0.0015853526,0.00037197705,0.008082715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993292,0.00019220842,0.00002896983,0.0002724828,0.000082627135,0.00009455467],"domain_scores_gemma":[0.99883956,0.0005812141,0.00008448759,0.00021059878,0.00021310686,0.000070927475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009887434,0.0014020243,0.0010772239,0.0010787824,0.0007655739,0.00080032763,0.0028709525,0.0016811825,0.0029610656],"category_scores_gemma":[0.004456244,0.0006809248,0.0007597976,0.0016393305,0.0007975723,0.0025816984,0.0020636625,0.0022674322,0.00096401706],"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.00023094418,0.00025016986,0.003295612,0.00013781643,0.00014328264,0.00024672804,0.00029283253,0.5945234,0.005244368,0.009983409,0.008744049,0.37690744],"study_design_scores_gemma":[0.000008814662,0.00002492102,0.00024321598,0.000007175132,0.000019968975,0.000024941182,0.000022376073,0.9925694,0.00068536244,0.0055194716,0.0008681514,0.0000062026047],"about_ca_topic_score_codex":0.024754448,"about_ca_topic_score_gemma":0.04707427,"teacher_disagreement_score":0.024754448,"about_ca_system_score_codex":0.0015814684,"about_ca_system_score_gemma":0.0016727669,"threshold_uncertainty_score":0.04922068},"labels":[],"label_agreement":null},{"id":"W4200115660","doi":"10.1109/pst52912.2021.9647749","title":"User Identification in Online Social Networks using Graph Transformer Networks","year":2021,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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 Calgary","funders":"","keywords":"Computer science; Graph; Social graph; Social network (sociolinguistics); Transformer; Identification (biology); Data mining; Information retrieval; Artificial intelligence; Machine learning; Theoretical computer science; Social media; World Wide Web","score_opus":0.02404116542996576,"score_gpt":0.2838228085807504,"score_spread":0.2597816431507846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200115660","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.18808866,0.00093635253,0.7956497,0.00064492715,0.00009327305,0.00033193413,0.0026980636,0.0049085957,0.0066484846],"genre_scores_gemma":[0.8890051,0.00044806354,0.103335656,0.00013746729,0.00004385187,0.0000902656,0.0026193103,0.000089995105,0.0042302115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936026,0.00019923838,0.000030298037,0.00021653372,0.00013378783,0.00005987523],"domain_scores_gemma":[0.99898416,0.0004473418,0.00018653672,0.00016197753,0.00015539821,0.000064642736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006172848,0.00076140347,0.0005220984,0.002702199,0.00047879468,0.00097145577,0.0008631648,0.00076876313,0.0017890279],"category_scores_gemma":[0.0028719818,0.0002621601,0.0005863386,0.0018287341,0.00046199744,0.0028520934,0.0013061134,0.0007496,0.0009144651],"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.001254771,0.0005679153,0.02687414,0.000421027,0.00030878937,0.0008270278,0.00095064077,0.19809389,0.021514356,0.044598352,0.01658166,0.6880076],"study_design_scores_gemma":[0.000010468326,0.00004504607,0.0025635008,0.000017596272,0.000030380037,0.00017976238,0.00012127195,0.9675147,0.0045750206,0.02227782,0.002646915,0.000017517443],"about_ca_topic_score_codex":0.009555648,"about_ca_topic_score_gemma":0.014871387,"teacher_disagreement_score":0.009555648,"about_ca_system_score_codex":0.0010409233,"about_ca_system_score_gemma":0.00048071382,"threshold_uncertainty_score":0.019000053},"labels":[],"label_agreement":null},{"id":"W4205160329","doi":"10.1007/s00521-021-06736-7","title":"Improving question answering over incomplete knowledge graphs with relation prediction","year":2022,"lang":"en","type":"article","venue":"Neural Computing and Applications","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":21,"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":"Embedding; Computer science; Relation (database); Knowledge graph; Question answering; Graph; Enhanced Data Rates for GSM Evolution; Data mining; Artificial intelligence; Theoretical computer science; Machine learning; Natural language processing","score_opus":0.008986851982562659,"score_gpt":0.2443862057232175,"score_spread":0.23539935374065485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205160329","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.14022991,0.0049037593,0.82683545,0.003906798,0.0003509736,0.00035052988,0.0060088616,0.012273928,0.005139635],"genre_scores_gemma":[0.66431504,0.0013395287,0.31033275,0.00126103,0.0004830236,0.00017338774,0.01655734,0.0004620213,0.0050758673],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698704,0.0009139173,0.00019174111,0.0010117976,0.0006466969,0.00024893755],"domain_scores_gemma":[0.98461795,0.012286907,0.0004842991,0.0015183687,0.0008470627,0.00024541223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020412256,0.001606606,0.0023718544,0.002851974,0.00085184845,0.0021698114,0.0030910743,0.002995918,0.0059007723],"category_scores_gemma":[0.017757652,0.0007476111,0.0021427507,0.002896551,0.0008025537,0.008399114,0.0027247288,0.0032493286,0.0019990145],"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.0008952822,0.0010104689,0.0063501936,0.0012138886,0.00049488194,0.00060818717,0.00056578475,0.24383949,0.011383245,0.01563693,0.04077259,0.6772291],"study_design_scores_gemma":[0.000032241376,0.00007379329,0.0007398994,0.000036177047,0.00012552938,0.00007249843,0.00008938147,0.94793427,0.0026330524,0.04626395,0.001985009,0.000014162826],"about_ca_topic_score_codex":0.0120658865,"about_ca_topic_score_gemma":0.01562402,"teacher_disagreement_score":0.0120658865,"about_ca_system_score_codex":0.0012642045,"about_ca_system_score_gemma":0.0015069951,"threshold_uncertainty_score":0.023991287},"labels":[],"label_agreement":null},{"id":"W4205610464","doi":"10.1007/s11704-021-1057-6","title":"Heterogeneous information network embedding with incomplete multi-view fusion","year":2022,"lang":"en","type":"article","venue":"Frontiers of Computer Science","topic":"Advanced Graph Neural Networks","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":"Novelis (Canada)","funders":"","keywords":"Computer science; Embedding; Fusion; Information fusion; Sensor fusion; Artificial intelligence","score_opus":0.009201404666549198,"score_gpt":0.22456085316221489,"score_spread":0.21535944849566568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205610464","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.014553669,0.0006159728,0.98287696,0.00023137829,0.00007579988,0.000027282831,0.00030024644,0.00025548888,0.0010632302],"genre_scores_gemma":[0.67196864,0.001217065,0.31890824,0.00031231786,0.0002371276,0.00015598828,0.0025020957,0.00019146726,0.004507008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913675,0.00026286038,0.000043636057,0.000276453,0.00020218617,0.00007818529],"domain_scores_gemma":[0.9987526,0.0004649811,0.00012868522,0.00031526157,0.0002702996,0.000068205714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013199634,0.0013233167,0.0015458667,0.0012617704,0.00040411094,0.0014321009,0.001364197,0.0015233445,0.0016545383],"category_scores_gemma":[0.0042042574,0.0006069202,0.0015103682,0.0015324011,0.00074740197,0.002916597,0.0021452124,0.0019145219,0.0006728615],"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.00064630294,0.00023778842,0.0024182254,0.00041233277,0.00055896514,0.000398579,0.0002721021,0.49472415,0.016833471,0.044550296,0.010112039,0.42883578],"study_design_scores_gemma":[0.000007516462,0.000038622988,0.00030465648,0.000015669177,0.00004904884,0.00004963359,0.000019241059,0.98171866,0.0016171383,0.015251801,0.000911969,0.000016012484],"about_ca_topic_score_codex":0.0032051771,"about_ca_topic_score_gemma":0.0035216694,"teacher_disagreement_score":0.0032051771,"about_ca_system_score_codex":0.00059206097,"about_ca_system_score_gemma":0.0006817663,"threshold_uncertainty_score":0.006980717},"labels":[],"label_agreement":null},{"id":"W4206508642","doi":"10.1007/978-981-16-6054-2_11","title":"Graph Neural Networks: Graph Generation","year":2022,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Neural Networks","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 Toronto","funders":"","keywords":"Computer science; Graph; Theoretical computer science","score_opus":0.025124001813658012,"score_gpt":0.2279135309878051,"score_spread":0.20278952917414708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206508642","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.0022047882,0.013515461,0.80933046,0.0024427064,0.0021387115,0.00012281182,0.0021346216,0.0059544244,0.16215605],"genre_scores_gemma":[0.05314526,0.023399437,0.5981817,0.0015000354,0.0015274119,0.0003684417,0.008319309,0.003736233,0.3098221],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985135,0.000022890497,0.000005327921,0.000040014133,0.00007066299,0.000009722924],"domain_scores_gemma":[0.99976176,0.0000932732,0.000011025484,0.000056356155,0.000063422354,0.000014126374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025413942,0.00080327946,0.0004287752,0.0009666037,0.00029742005,0.0011100576,0.0010568977,0.0008798867,0.038875557],"category_scores_gemma":[0.0012405295,0.00043674032,0.00042155324,0.002203457,0.00041233975,0.0022529252,0.00076934067,0.0014043327,0.020471977],"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.000017647893,0.00003663088,0.000090962996,0.00033109233,0.000017046317,0.000040483323,0.000035933783,0.019098757,0.0016288692,0.089322075,0.2770438,0.6123367],"study_design_scores_gemma":[0.000012766906,0.000019346204,0.0003310568,0.00021702985,0.000023924142,0.00023228723,0.00003226922,0.14010929,0.0037007648,0.36979055,0.48549983,0.000030921456],"about_ca_topic_score_codex":0.0014007343,"about_ca_topic_score_gemma":0.0030306748,"teacher_disagreement_score":0.038875557,"about_ca_system_score_codex":0.0005401392,"about_ca_system_score_gemma":0.00049328164,"threshold_uncertainty_score":0.13005167},"labels":[],"label_agreement":null},{"id":"W4210797700","doi":"10.14778/3489496.3489504","title":"LargeEA","year":2021,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":29,"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; Scalability; Benchmark (surveying); Exploit; Process (computing); Channel (broadcasting); Partition (number theory); Competitor analysis; Feature (linguistics); Data mining; Artificial intelligence; Database; Programming language","score_opus":0.007208047789126523,"score_gpt":0.2039609482731143,"score_spread":0.1967529004839878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210797700","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.00930729,0.0025778308,0.860348,0.0011677024,0.0005649751,0.00076394883,0.013042344,0.07794819,0.034279723],"genre_scores_gemma":[0.066601336,0.001213289,0.83352095,0.0012453196,0.00019692845,0.0007520067,0.06387875,0.0075013116,0.025090098],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99782664,0.0005161927,0.00011700669,0.0008600304,0.00047870874,0.00020146002],"domain_scores_gemma":[0.9972881,0.0007766431,0.0001127296,0.0012396916,0.00047066042,0.00011225135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018956339,0.0022814267,0.0012274501,0.0036485947,0.0012453059,0.0027079594,0.0044562654,0.0017655855,0.037737668],"category_scores_gemma":[0.008922828,0.00082121795,0.002343537,0.0032950835,0.0007285713,0.0058752336,0.004218842,0.002382686,0.020990206],"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.0003588291,0.00031086337,0.0018516362,0.0012671008,0.00033737384,0.00033737544,0.0001953886,0.043076906,0.006372924,0.04456819,0.19341016,0.70791334],"study_design_scores_gemma":[0.00022305551,0.00027571892,0.0017428654,0.00026898188,0.00025141495,0.0008150476,0.0003596174,0.45986193,0.017439445,0.1475069,0.37115973,0.00009535076],"about_ca_topic_score_codex":0.0047347397,"about_ca_topic_score_gemma":0.0116076805,"teacher_disagreement_score":0.037737668,"about_ca_system_score_codex":0.0014892331,"about_ca_system_score_gemma":0.002156917,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4210799478","doi":"10.52591/lxai2020121213","title":"Graph Neural Networks Learn Twitter Bot Behaviour","year":2020,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Social media; Graph; Set (abstract data type); Task (project management); Artificial neural network; Contrast (vision); Artificial intelligence; Social network (sociolinguistics); Machine learning; Information retrieval; World Wide Web; Data science; Theoretical computer science","score_opus":0.02686696065914855,"score_gpt":0.24667253382861223,"score_spread":0.2198055731694637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210799478","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.69651765,0.0017836596,0.28542653,0.002725727,0.0002559303,0.00013509467,0.0021176785,0.0032272085,0.0078104786],"genre_scores_gemma":[0.9732247,0.00025081163,0.021297365,0.00026842518,0.00006726827,0.000045478595,0.0016943926,0.000105217914,0.003046395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997553,0.00006801171,0.000009811322,0.00008991333,0.00003127362,0.00004576396],"domain_scores_gemma":[0.99740976,0.0017705499,0.0002788975,0.00017247222,0.00026974524,0.00009849061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074015954,0.0009451353,0.0005621457,0.0013934518,0.00036106232,0.00066726643,0.0008597854,0.0012795591,0.001797882],"category_scores_gemma":[0.006285474,0.00050826935,0.00053340144,0.00089736626,0.00050164794,0.0019467443,0.00051521236,0.0014041676,0.0006324982],"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.00023963566,0.00022147545,0.022454396,0.00014386963,0.0001323578,0.00015590787,0.00011896937,0.87163645,0.0020171225,0.0066527287,0.009170912,0.08705614],"study_design_scores_gemma":[0.0000042412976,0.000008102371,0.00046996074,0.000004038943,0.0000042175448,0.000005672637,0.000008016656,0.996425,0.00011797872,0.0028201437,0.00013080667,0.0000018033202],"about_ca_topic_score_codex":0.0143990815,"about_ca_topic_score_gemma":0.02706966,"teacher_disagreement_score":0.0143990815,"about_ca_system_score_codex":0.0012482366,"about_ca_system_score_gemma":0.00055772613,"threshold_uncertainty_score":0.028630555},"labels":[],"label_agreement":null},{"id":"W4223434371","doi":"10.1109/tpami.2022.3166894","title":"Graph Learning on Millions of Data in Seconds: Label Propagation Acceleration on Graph Using Data Distribution","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Pattern Analysis and Machine Intelligence","topic":"Advanced Graph Neural Networks","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":"Huawei Technologies (Canada)","funders":"National Key Research and Development Program of China; Natural Science Foundation of Beijing Municipality; National Natural Science Foundation of China","keywords":"Margin (machine learning); Graph; Labeled data; Range (aeronautics); Task (project management); Raw data; Key (lock); Data modeling; Pattern recognition (psychology)","score_opus":0.0763549678641931,"score_gpt":0.32202916136743404,"score_spread":0.24567419350324093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4223434371","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.055416696,0.00047399141,0.9281636,0.00082911045,0.00016591935,0.00020011041,0.00056793983,0.012686865,0.0014957457],"genre_scores_gemma":[0.42784163,0.0003473825,0.56372607,0.0003742156,0.000101745965,0.00030697748,0.0032839521,0.0007381877,0.0032798538],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875224,0.00028060746,0.00005768455,0.00035042147,0.00044672622,0.00011238056],"domain_scores_gemma":[0.9943984,0.002740123,0.00035771017,0.0012393125,0.0009892777,0.00027512203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015466765,0.0014322659,0.0011492945,0.0021068999,0.00083166524,0.0011365213,0.0032903485,0.0013235763,0.0023095005],"category_scores_gemma":[0.007733657,0.0006385545,0.0010378783,0.0022055893,0.00092395715,0.004395048,0.0020470717,0.0026196686,0.001241409],"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.00035699693,0.0003535323,0.004335261,0.00020465076,0.00012375404,0.00019436203,0.00032940894,0.4082137,0.008418402,0.007458308,0.012560239,0.55745125],"study_design_scores_gemma":[0.000016298862,0.00001625312,0.00017008733,0.000002712785,0.00000592763,0.000016418064,0.0000202115,0.9930214,0.0012663049,0.0049835243,0.00047633483,0.0000045452703],"about_ca_topic_score_codex":0.014060811,"about_ca_topic_score_gemma":0.021763753,"teacher_disagreement_score":0.014060811,"about_ca_system_score_codex":0.0015593412,"about_ca_system_score_gemma":0.0018176368,"threshold_uncertainty_score":0.027957976},"labels":[],"label_agreement":null},{"id":"W4224919236","doi":"10.1109/icassp43922.2022.9747447","title":"Dual Path Graph Convolutional Networks","year":2022,"lang":"en","type":"article","venue":"ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","topic":"Advanced Graph Neural Networks","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":"Université de Montréal","funders":"","keywords":"Computer science; Graph; Residual; Theoretical computer science; Deep learning; Convolutional neural network; Exploit; Artificial intelligence; Dual graph; Feature learning; Path (computing); Algorithm; Computer network; Planar graph","score_opus":0.03481613526811564,"score_gpt":0.2810142352713893,"score_spread":0.24619810000327366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224919236","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.032345016,0.0014263723,0.95201254,0.0005546523,0.00015730526,0.000080969796,0.0011379637,0.0042393818,0.0080458],"genre_scores_gemma":[0.62828624,0.0019441905,0.34494418,0.0007317613,0.00010243083,0.00018354725,0.0054587224,0.00042406382,0.01792479],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996754,0.000048587666,0.000013332625,0.00012581547,0.000076012555,0.000060826456],"domain_scores_gemma":[0.99960107,0.00010459615,0.000050599174,0.00009136534,0.00011627542,0.000036041507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003093079,0.0010156648,0.0005679038,0.00081054796,0.0003165908,0.0007409973,0.0015189375,0.0009518249,0.0038453483],"category_scores_gemma":[0.0016005588,0.00039252813,0.00065959326,0.001003807,0.0006448762,0.0016969007,0.00089750567,0.0012276892,0.0012802504],"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.00022577777,0.00011118582,0.0019212471,0.0002577998,0.00015271148,0.00022678034,0.00008901442,0.51364154,0.01205911,0.0748837,0.020758223,0.37567288],"study_design_scores_gemma":[0.000007953382,0.000026231108,0.0002747614,0.0000109540315,0.00001722828,0.000047216537,0.000009905434,0.96599936,0.0021646281,0.02687694,0.004555142,0.000009663443],"about_ca_topic_score_codex":0.0114446245,"about_ca_topic_score_gemma":0.022601543,"teacher_disagreement_score":0.0114446245,"about_ca_system_score_codex":0.0012132567,"about_ca_system_score_gemma":0.0010874294,"threshold_uncertainty_score":0.02275604},"labels":[],"label_agreement":null},{"id":"W4224931240","doi":"10.1109/icassp43922.2022.9746424","title":"Linear-Time Sampling on Signed Graphs Via Gershgorin Disc Perfect Alignment","year":2022,"lang":"en","type":"article","venue":"ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","topic":"Advanced Graph Neural Networks","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":"York University; Simon Fraser University","funders":"","keywords":"Combinatorics; Laplacian matrix; Eigenvalues and eigenvectors; Mathematics; Graph; Discrete mathematics; Pairwise comparison; Algorithm; Physics","score_opus":0.042813700835788795,"score_gpt":0.30087934845902425,"score_spread":0.2580656476232355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224931240","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.023370737,0.00011105319,0.97457665,0.00023787293,0.000033561442,0.000047269856,0.0001223062,0.000676473,0.00082403154],"genre_scores_gemma":[0.572485,0.0002588739,0.4201214,0.0005674745,0.00013190598,0.0003193317,0.0013851547,0.00041888066,0.004311945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891746,0.0004327094,0.000038296595,0.00030505098,0.00021491572,0.0000915448],"domain_scores_gemma":[0.9980306,0.001017809,0.00024711786,0.0003854223,0.00016947999,0.00014946847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012340453,0.0012707944,0.0011615045,0.0008880063,0.00060314836,0.00095072004,0.0015395229,0.0012450491,0.0029021767],"category_scores_gemma":[0.006673918,0.0005203746,0.00075407897,0.0011515608,0.0013679275,0.0021676074,0.0020053783,0.001602558,0.0009892249],"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.00052246114,0.000247011,0.0028551798,0.00024877198,0.00010006402,0.00027470672,0.00035239017,0.53354967,0.017709335,0.12609771,0.008132386,0.30991024],"study_design_scores_gemma":[0.000015414875,0.000038324855,0.00015307283,0.0000048539077,0.0000040180294,0.00002717971,0.000017154784,0.9684173,0.0013485738,0.029409263,0.0005557581,0.000008991821],"about_ca_topic_score_codex":0.0025194462,"about_ca_topic_score_gemma":0.0040627047,"teacher_disagreement_score":0.0029021767,"about_ca_system_score_codex":0.0008616721,"about_ca_system_score_gemma":0.0010839914,"threshold_uncertainty_score":0.009708762},"labels":[],"label_agreement":null},{"id":"W4225094274","doi":"10.2196/37215","title":"Construction of a Linked Data Set of COVID-19 Knowledge Graphs: Development and Applications","year":2022,"lang":"en","type":"article","venue":"JMIR Medical Informatics","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":9,"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":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Computer science; Encyclopedia; Information retrieval; Schema (genetic algorithms); Data science; World Wide Web; Data mining","score_opus":0.046844944348230264,"score_gpt":0.33777219994666857,"score_spread":0.2909272555984383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225094274","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.06449679,0.0012322187,0.83204013,0.0021216767,0.00028231426,0.002091454,0.072785355,0.013507031,0.011443072],"genre_scores_gemma":[0.08171946,0.0010392093,0.7958582,0.00022559041,0.000040458403,0.0008189054,0.118032,0.00040826484,0.0018580088],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99750084,0.0004955687,0.0003562471,0.00070474594,0.00082988216,0.00011271257],"domain_scores_gemma":[0.9939691,0.0020647119,0.000596923,0.0014124701,0.0016201064,0.0003366227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022889606,0.0007529394,0.00052152737,0.012407052,0.0014998048,0.0027493292,0.0019802633,0.0009775474,0.0036623667],"category_scores_gemma":[0.012625175,0.00063363946,0.0022031171,0.011508535,0.00080936827,0.0035967831,0.0033483657,0.0015055628,0.0013368992],"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.00032506906,0.0008100685,0.044199813,0.003101674,0.0005263307,0.0019723263,0.002324172,0.06862269,0.010871506,0.11173537,0.0661066,0.6894043],"study_design_scores_gemma":[0.00015063684,0.0003081781,0.024448285,0.0010449849,0.0004908037,0.0015505275,0.0026877145,0.40969616,0.026915781,0.11149502,0.42096436,0.00024758058],"about_ca_topic_score_codex":0.01570735,"about_ca_topic_score_gemma":0.016958555,"teacher_disagreement_score":0.01570735,"about_ca_system_score_codex":0.0019776574,"about_ca_system_score_gemma":0.004407468,"threshold_uncertainty_score":0.03123182},"labels":[],"label_agreement":null},{"id":"W4225129532","doi":"10.1109/tcyb.2022.3166539","title":"Amer: A New Attribute-Missing Network Embedding Approach","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Advanced Graph Neural Networks","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":"University of Alberta","funders":"National Natural Science Foundation of China; National Key Research and Development Program of China; George Washington University","keywords":"Computer science; Embedding; Missing data; Data mining; Representation (politics); Node (physics); Machine learning; Artificial intelligence; Cluster analysis; Process (computing); Constraint (computer-aided design); Theoretical computer science; Mathematics","score_opus":0.02371347438212827,"score_gpt":0.2562391148881683,"score_spread":0.23252564050604005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225129532","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.0036716054,0.00034312342,0.99354976,0.00024518324,0.000069836446,0.000041103307,0.00023549107,0.00044918444,0.0013946905],"genre_scores_gemma":[0.43828154,0.0019970592,0.533325,0.0011369945,0.00052176823,0.0005878092,0.0036342798,0.00076266495,0.01975285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855894,0.0005362307,0.000049552837,0.00036233116,0.0003885156,0.000104474144],"domain_scores_gemma":[0.99821246,0.0007208744,0.00020529074,0.00041480098,0.00033258228,0.00011400627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017653451,0.0015610177,0.001217085,0.0016283233,0.00052340113,0.0012536782,0.0028667578,0.0017636637,0.0035875053],"category_scores_gemma":[0.00471175,0.00066458696,0.0013747226,0.0017445899,0.001245533,0.0046998863,0.0028464454,0.0035712316,0.0014249126],"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.00020365551,0.00014764092,0.0026549809,0.0002977227,0.00027335662,0.00037263407,0.00033883238,0.57723266,0.005444346,0.11352204,0.016336037,0.28317603],"study_design_scores_gemma":[0.000007587867,0.000032771943,0.00017825351,0.000017812734,0.000022252607,0.00009191014,0.000021270595,0.9541644,0.0007704827,0.0403709,0.004307522,0.000014775727],"about_ca_topic_score_codex":0.0023211949,"about_ca_topic_score_gemma":0.00293892,"teacher_disagreement_score":0.0035875053,"about_ca_system_score_codex":0.0010011003,"about_ca_system_score_gemma":0.00093979033,"threshold_uncertainty_score":0.012001455},"labels":[],"label_agreement":null},{"id":"W4225665835","doi":"10.1109/lcomm.2022.3163468","title":"An Adaptive Rate Allocation Scheme for Time-Varying Graph Signal Quantization","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Graph Neural Networks","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":"National Natural Science Foundation of China","keywords":"Quantization (signal processing); Computer science; Telecommunications link; Rate distortion; Graph; Algorithm; Rate–distortion theory; Data compression; Real-time computing; Theoretical computer science; Mathematics; Coding (social sciences); Telecommunications","score_opus":0.039847276622123874,"score_gpt":0.2868055933345587,"score_spread":0.24695831671243482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225665835","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.015864277,0.0005981166,0.98115873,0.00021680689,0.00013049947,0.00006929207,0.00003804508,0.0004373034,0.0014868549],"genre_scores_gemma":[0.8304718,0.00057601643,0.1660188,0.00022352983,0.00012994013,0.00012735484,0.000077961595,0.000076902965,0.0022977353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989672,0.00030366794,0.000080566824,0.00024031715,0.00029295153,0.00011525958],"domain_scores_gemma":[0.99846315,0.0005311178,0.00018239711,0.0002975245,0.00042096895,0.00010486719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012489067,0.00084233645,0.00082794466,0.0006697655,0.00055743573,0.0009422406,0.0016903026,0.0006548701,0.0016766279],"category_scores_gemma":[0.0053587244,0.0002610041,0.0003176269,0.0009769213,0.0008272806,0.0018746287,0.0011692161,0.0012565114,0.00045789476],"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.00069750875,0.00024276564,0.0009588797,0.00020045238,0.000074959,0.00029751417,0.0003945693,0.5326219,0.07052672,0.06374564,0.006013351,0.32422575],"study_design_scores_gemma":[0.000029637931,0.00008075078,0.00010397183,0.000009039627,0.000014009584,0.00011265636,0.000024696508,0.98784745,0.005565041,0.0048767533,0.0013065912,0.000029318018],"about_ca_topic_score_codex":0.0019791883,"about_ca_topic_score_gemma":0.0020107373,"teacher_disagreement_score":0.0019791883,"about_ca_system_score_codex":0.0007468758,"about_ca_system_score_gemma":0.00077278155,"threshold_uncertainty_score":0.0066049695},"labels":[],"label_agreement":null},{"id":"W4225692987","doi":"10.1609/aaai.v36i9.21224","title":"Solving Disjunctive Temporal Networks with Uncertainty under Restricted Time-Based Controllability Using Tree Search and Graph Neural Networks","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","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":"Safran Electronics (Canada)","funders":"","keywords":"Controllability; Leverage (statistics); Computer science; Graph; Scheduling (production processes); Benchmark (surveying); Search tree; Artificial intelligence; Search algorithm; Theoretical computer science; Mathematical optimization; Algorithm; Mathematics","score_opus":0.04851391012186594,"score_gpt":0.2713783142420653,"score_spread":0.22286440412019937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225692987","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.14095636,0.0005220196,0.85022795,0.0009915099,0.00006547233,0.00012617957,0.00037835518,0.00089435774,0.0058378153],"genre_scores_gemma":[0.78075457,0.00030214497,0.21507937,0.0002469728,0.00005529755,0.00020717991,0.0005766604,0.00016412335,0.002613775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999488,0.00016124816,0.00002760789,0.00013373375,0.00010698536,0.000082338185],"domain_scores_gemma":[0.9954152,0.0038570582,0.00029825207,0.00012692442,0.00020520178,0.00009743074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094997894,0.0010287022,0.00078286853,0.00057178724,0.0004852335,0.0009748664,0.001053364,0.0012534788,0.0025063716],"category_scores_gemma":[0.005606957,0.00051271537,0.0009369936,0.00073394313,0.0009789398,0.0018424726,0.0009449089,0.0016152182,0.00014681715],"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.000032288135,0.00002290535,0.00032097043,0.000046612702,0.000017483031,0.00004272424,0.000021174554,0.98306966,0.00045967812,0.0065296846,0.00036360585,0.009073301],"study_design_scores_gemma":[0.000008536292,0.000010859846,0.000033773602,0.0000026073549,0.0000036362715,0.000005662633,0.000008632969,0.9929731,0.0002018639,0.0066347104,0.00011501255,0.0000016867357],"about_ca_topic_score_codex":0.01690426,"about_ca_topic_score_gemma":0.024398202,"teacher_disagreement_score":0.01690426,"about_ca_system_score_codex":0.001637843,"about_ca_system_score_gemma":0.0019287466,"threshold_uncertainty_score":0.033611715},"labels":[],"label_agreement":null},{"id":"W4226101728","doi":"10.1007/s11280-021-00972-6","title":"HOPLoP: multi-hop link prediction over knowledge graph embeddings","year":2021,"lang":"en","type":"article","venue":"World Wide Web","topic":"Advanced Graph Neural Networks","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Computer science; Traverse; Embedding; Knowledge graph; Theoretical computer science; Graph; Margin (machine learning); Generalization; Machine learning; Artificial intelligence; Mathematics","score_opus":0.015868101327976156,"score_gpt":0.2643288682557699,"score_spread":0.24846076692779373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226101728","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.057600796,0.0022176346,0.76193446,0.001139533,0.0009847907,0.0007404113,0.046008065,0.124121994,0.005252273],"genre_scores_gemma":[0.35350654,0.0009804452,0.5548507,0.0005563891,0.00026515324,0.0007870667,0.074003845,0.0029763177,0.012073517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941397,0.00009846609,0.000033453798,0.00021945908,0.00016931994,0.00006538657],"domain_scores_gemma":[0.99822026,0.0009311145,0.00008544485,0.0004841625,0.00018846216,0.000090475245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096045993,0.002191956,0.0012921903,0.0034797417,0.00075439777,0.0015293282,0.002477622,0.002537832,0.011633936],"category_scores_gemma":[0.0063600526,0.0009414698,0.0014136765,0.0027455024,0.00043142893,0.003649581,0.00197418,0.002228061,0.0049259523],"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.0011028108,0.0008778303,0.0066148364,0.0009315627,0.0006675673,0.0005250845,0.00012843304,0.18348391,0.004320103,0.0073357327,0.15776144,0.63625073],"study_design_scores_gemma":[0.000061327264,0.00006984456,0.00051048934,0.0000346005,0.000050959894,0.000073326904,0.00003037118,0.97906816,0.0020451976,0.013314048,0.0047220024,0.000019631882],"about_ca_topic_score_codex":0.009551326,"about_ca_topic_score_gemma":0.01767036,"teacher_disagreement_score":0.011633936,"about_ca_system_score_codex":0.0007918114,"about_ca_system_score_gemma":0.001241613,"threshold_uncertainty_score":0.03891939},"labels":[],"label_agreement":null},{"id":"W4226139256","doi":"10.3389/fdata.2022.616617","title":"Scaling Graph Propagation Kernels for Predictive Learning","year":2022,"lang":"en","type":"article","venue":"Frontiers in Big Data","topic":"Advanced Graph Neural Networks","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; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Differentiable function; Inference; Computer science; Graph; Theoretical computer science; Scaling; Robustness (evolution); Exponential function; Artificial intelligence; Mathematics","score_opus":0.05184979099417004,"score_gpt":0.2661570219216134,"score_spread":0.21430723092744336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226139256","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.011067817,0.00040159188,0.98639005,0.00022059609,0.00003640997,0.00002877561,0.00010612363,0.00093149126,0.0008171188],"genre_scores_gemma":[0.69005716,0.0010918699,0.30359304,0.00026035204,0.00013349361,0.00016362015,0.00082663447,0.00037106033,0.0035027664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992912,0.0001853384,0.000036428566,0.00020439965,0.00022091831,0.00006167559],"domain_scores_gemma":[0.99688715,0.0017789194,0.0002632566,0.0004903404,0.00047938543,0.00010101685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016872092,0.00089805486,0.0008917374,0.0013362418,0.000469019,0.0011112277,0.0017272787,0.0011535777,0.0017166776],"category_scores_gemma":[0.010533077,0.00044640517,0.00069852656,0.0016555641,0.0010618556,0.0035515775,0.0012192468,0.0021846779,0.0006287178],"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.000069019276,0.000081267135,0.0016275749,0.0000964658,0.000051706065,0.00006311797,0.00010711673,0.7871839,0.0022910496,0.05378655,0.0040364503,0.15060575],"study_design_scores_gemma":[0.00000187183,0.0000048061825,0.00007236396,0.0000033039623,0.0000031771926,0.000005327869,0.0000041327185,0.9852544,0.00029502303,0.014010252,0.00034230485,0.0000028664533],"about_ca_topic_score_codex":0.009464433,"about_ca_topic_score_gemma":0.009552111,"teacher_disagreement_score":0.009464433,"about_ca_system_score_codex":0.001642973,"about_ca_system_score_gemma":0.0011621392,"threshold_uncertainty_score":0.018818736},"labels":[],"label_agreement":null},{"id":"W4226193467","doi":"10.1109/isit50566.2022.9834398","title":"On the Feasible Region of Efficient Algorithms for Attributed Graph Alignment","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Advanced Graph Neural Networks","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":"Computer science; Vertex (graph theory); Algorithm; Graph; Theoretical computer science; Time complexity","score_opus":0.019388438974961036,"score_gpt":0.2559160239593848,"score_spread":0.23652758498442375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226193467","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.012145028,0.00088757696,0.98146147,0.0008998097,0.00007143913,0.0001602993,0.00017918907,0.00058705016,0.0036080885],"genre_scores_gemma":[0.2689591,0.0017577974,0.7214245,0.0006433865,0.00031838584,0.00097388204,0.0012875469,0.0008126923,0.0038227257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98853254,0.005042361,0.00055789074,0.0027780093,0.001927222,0.0011620048],"domain_scores_gemma":[0.8997435,0.0858986,0.004172651,0.0055386107,0.003237248,0.0014093681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010062932,0.0030837392,0.0039147846,0.0033889264,0.0024761339,0.005527778,0.0046724705,0.003533736,0.007143543],"category_scores_gemma":[0.083172515,0.001623753,0.0025479745,0.0046689413,0.0050821896,0.0105813565,0.0063828873,0.0077115176,0.0029351849],"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.0010217081,0.00046610108,0.0014735345,0.0007098877,0.00012411676,0.00015960193,0.0006028181,0.6194064,0.003229912,0.24278356,0.008576394,0.12144597],"study_design_scores_gemma":[0.000108610555,0.00013087459,0.00018014351,0.00010020464,0.000027068503,0.000102813145,0.00009543401,0.7391053,0.0015357548,0.25653416,0.0020454638,0.000034121047],"about_ca_topic_score_codex":0.0025606712,"about_ca_topic_score_gemma":0.0017659108,"teacher_disagreement_score":0.010062932,"about_ca_system_score_codex":0.0035980071,"about_ca_system_score_gemma":0.0065678884,"threshold_uncertainty_score":0.053218484},"labels":[],"label_agreement":null},{"id":"W4226436280","doi":"10.1109/mlbdbi54094.2021.00140","title":"The Application of Graph Neural Network in Natural Language Processing and Computer Vision","year":2021,"lang":"en","type":"article","venue":"2021 3rd International Conference on Machine Learning, Big Data and Business Intelligence (MLBDBI)","topic":"Advanced Graph Neural Networks","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 Waterloo","funders":"","keywords":"Computer science; Categorization; Artificial intelligence; Deep learning; Benchmark (surveying); Graph; Artificial neural network; Euclidean geometry; Recurrent neural network; Transformation (genetics); Machine learning; Natural language processing; Theoretical computer science","score_opus":0.03563224655463522,"score_gpt":0.3193743397329246,"score_spread":0.2837420931782894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226436280","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.025490507,0.039997105,0.90441567,0.0033537482,0.0007089154,0.00020556456,0.0019385208,0.001826332,0.02206363],"genre_scores_gemma":[0.45250073,0.06396711,0.46545407,0.0014794334,0.00077179546,0.00036711537,0.0053827213,0.00044592627,0.009631076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930906,0.00020398619,0.00004324163,0.00019628013,0.00021050716,0.000036892925],"domain_scores_gemma":[0.99876344,0.0007038703,0.00009213366,0.00016241966,0.00024378546,0.000034301986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091647176,0.0011947858,0.00071837136,0.0025446934,0.00037938548,0.0014457812,0.0011912754,0.0011595528,0.002534557],"category_scores_gemma":[0.0035463702,0.0003651844,0.0008919142,0.004131705,0.0011483172,0.003325311,0.0009270479,0.0017963218,0.00091311557],"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.00012471317,0.00012348425,0.004612281,0.0017593376,0.00029414214,0.00031948686,0.00022280456,0.16006006,0.00646786,0.12677658,0.024341224,0.67489797],"study_design_scores_gemma":[0.000014888503,0.00011589434,0.0033363858,0.00028128334,0.000096559095,0.00043059522,0.000119881166,0.66529185,0.0065957606,0.2660418,0.05759974,0.00007539476],"about_ca_topic_score_codex":0.0077515417,"about_ca_topic_score_gemma":0.008573144,"teacher_disagreement_score":0.0077515417,"about_ca_system_score_codex":0.0013020867,"about_ca_system_score_gemma":0.0008496985,"threshold_uncertainty_score":0.015412867},"labels":[],"label_agreement":null},{"id":"W4229012760","doi":"10.1007/s10489-022-03235-7","title":"Hashing-based semantic relevance attributed knowledge graph embedding enhancement for deep probabilistic recommendation","year":2022,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Novelis (Canada)","funders":"Basic Research Program of Jiangsu Province; Government of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Hash function; Theoretical computer science; Graph; Probabilistic logic; Embedding; Data mining; Information retrieval; Artificial intelligence","score_opus":0.03186132315158871,"score_gpt":0.29859712756404705,"score_spread":0.26673580441245837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229012760","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.086229466,0.0020215877,0.9018457,0.00041883375,0.00026472358,0.00011801192,0.0009851924,0.0032971515,0.0048193657],"genre_scores_gemma":[0.8058296,0.00095192133,0.18170747,0.0002389097,0.00012323659,0.00006762701,0.0020849495,0.00012260462,0.008873555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957937,0.00006620691,0.000025806912,0.00012300945,0.00015809329,0.000047463098],"domain_scores_gemma":[0.9993475,0.00017708035,0.00004719628,0.00018351611,0.00020051256,0.000044262066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038916472,0.000546621,0.00094543025,0.0011145375,0.0003595239,0.00059283315,0.0012165408,0.00075477385,0.0036555494],"category_scores_gemma":[0.0017676568,0.00027868117,0.0006099496,0.0016722017,0.0003216622,0.0020932925,0.00087592244,0.0008989217,0.0011622371],"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.0004897128,0.0005236294,0.0031505635,0.00023798215,0.00018289428,0.00013966174,0.00012933141,0.07914587,0.020440934,0.011921821,0.016659532,0.86697793],"study_design_scores_gemma":[0.000024740944,0.00008729883,0.0009424139,0.000012395643,0.00006190066,0.000106066065,0.00004049456,0.9834538,0.004840186,0.008423006,0.0019867856,0.00002097923],"about_ca_topic_score_codex":0.008442996,"about_ca_topic_score_gemma":0.015573615,"teacher_disagreement_score":0.008442996,"about_ca_system_score_codex":0.00040852383,"about_ca_system_score_gemma":0.0008121944,"threshold_uncertainty_score":0.016787708},"labels":[],"label_agreement":null},{"id":"W4231491089","doi":"10.1007/978-1-4939-7131-2_100618","title":"Longitudinal Network","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Neural Networks","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 Calgary","funders":"","keywords":"Computer science","score_opus":0.026763764836760004,"score_gpt":0.2418972338864883,"score_spread":0.2151334690497283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231491089","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.013012538,0.004331166,0.8481808,0.007934604,0.0017808385,0.00011440576,0.0069647375,0.0027896757,0.114891194],"genre_scores_gemma":[0.39925358,0.0074023,0.16150634,0.0019283672,0.0021187435,0.0005185519,0.010977938,0.0007994682,0.41549468],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996817,0.00007732952,0.000011090182,0.0001315905,0.000066312394,0.00003202862],"domain_scores_gemma":[0.9989612,0.00036567284,0.00007404748,0.00023374664,0.00029092238,0.000074326446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012126646,0.0005386259,0.00044965948,0.00084338896,0.00052038336,0.0011284971,0.0011469945,0.0008559574,0.039565805],"category_scores_gemma":[0.005200006,0.0003343739,0.0004739189,0.0010505174,0.00044068755,0.0024557365,0.0010630165,0.0014532157,0.010955386],"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.00013657626,0.000068303205,0.0029636514,0.00014298852,0.00009674321,0.000100241065,0.00008691812,0.067382716,0.0010108066,0.3564709,0.13929619,0.4322439],"study_design_scores_gemma":[0.000017474362,0.00004378846,0.0018292685,0.00009053247,0.00004966465,0.00015339452,0.000047896036,0.47384655,0.0011343578,0.4174576,0.105295405,0.00003407583],"about_ca_topic_score_codex":0.004759828,"about_ca_topic_score_gemma":0.005623094,"teacher_disagreement_score":0.039565805,"about_ca_system_score_codex":0.0010239619,"about_ca_system_score_gemma":0.0007791251,"threshold_uncertainty_score":0.13236082},"labels":[],"label_agreement":null},{"id":"W4238595269","doi":"10.1007/978-1-4614-6170-8_100889","title":"Social Graph Dataset","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Neural Networks","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 Calgary","funders":"","keywords":"Computer science; Graph; Theoretical computer science","score_opus":0.026721443297246468,"score_gpt":0.2621311030729884,"score_spread":0.23540965977574196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238595269","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.0043622516,0.0006947546,0.0014747747,0.00056847814,0.00025392993,0.00014321972,0.9768638,0.0032413744,0.012397429],"genre_scores_gemma":[0.0041062417,0.00027815468,0.0025255973,0.00013238245,0.000033162498,0.00012677352,0.98869085,0.00013564051,0.0039710915],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936587,0.0001296036,0.000046040863,0.00017150817,0.0002091334,0.000077991834],"domain_scores_gemma":[0.9990319,0.0002713501,0.00007078293,0.0002953742,0.00019504283,0.00013561935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005003788,0.0019679207,0.00068595953,0.004325645,0.0009980168,0.0011817022,0.0011488622,0.0014939671,0.03728471],"category_scores_gemma":[0.0034406374,0.00031673693,0.00094569515,0.0036276456,0.00026459357,0.0012687576,0.0012322518,0.0012063248,0.03362199],"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.000045497796,0.000075538024,0.0008684301,0.000356209,0.000040008785,0.000045462188,0.000030159317,0.000757265,0.0005514832,0.0017166162,0.9793919,0.016121529],"study_design_scores_gemma":[0.00013495843,0.00007554665,0.005131475,0.00018953996,0.00005776955,0.0002776214,0.00018412234,0.006728586,0.0017613107,0.0073148105,0.9781035,0.000040657003],"about_ca_topic_score_codex":0.012141278,"about_ca_topic_score_gemma":0.043206904,"teacher_disagreement_score":0.03728471,"about_ca_system_score_codex":0.0008681804,"about_ca_system_score_gemma":0.0011788219,"threshold_uncertainty_score":0.12472975},"labels":[],"label_agreement":null},{"id":"W4241931197","doi":"10.22215/etd/2020-14292","title":"An Investigation of Attention Mechanisms in Graph Convolution Networks Applied to Link Prediction Problems","year":2020,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Graph Neural Networks","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":"Computer science; Graph; Artificial intelligence; Autoencoder; Theoretical computer science; Link (geometry); Encoder; Deep learning; Machine learning; Data mining","score_opus":0.01189807226327403,"score_gpt":0.22937023244055232,"score_spread":0.2174721601772783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241931197","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.24770248,0.0062342943,0.7018149,0.010875727,0.00040362275,0.00009240114,0.00018430165,0.0005032128,0.032189067],"genre_scores_gemma":[0.9497396,0.0027833951,0.03642373,0.0007559792,0.0003511177,0.00007845044,0.00011596269,0.00009910891,0.009652731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960166,0.00016806062,0.000015371457,0.00007945794,0.000064228305,0.00007127735],"domain_scores_gemma":[0.9962535,0.0028307184,0.00020778578,0.00019143053,0.00033810627,0.00017834373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001899916,0.0005589619,0.0007330334,0.00066825125,0.000612493,0.0011936068,0.0013764919,0.0016612641,0.0041142935],"category_scores_gemma":[0.009779622,0.0004226797,0.00083886937,0.00077925506,0.0010818441,0.0034776225,0.0013442035,0.0025262786,0.00026074046],"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.00015680662,0.00021404572,0.0027571698,0.00021043606,0.00012598721,0.00021293142,0.00034638174,0.2650769,0.0060813725,0.646068,0.0067327754,0.07201719],"study_design_scores_gemma":[0.0000072297225,0.000022085324,0.00060012727,0.000015471509,0.000017101016,0.000030454765,0.00001835821,0.87150466,0.00046016512,0.12667842,0.0006395118,0.000006438189],"about_ca_topic_score_codex":0.005606601,"about_ca_topic_score_gemma":0.0034976534,"teacher_disagreement_score":0.005606601,"about_ca_system_score_codex":0.0017743144,"about_ca_system_score_gemma":0.00094942556,"threshold_uncertainty_score":0.013763726},"labels":[],"label_agreement":null},{"id":"W4243610374","doi":"10.1007/978-1-4939-7131-2_100599","title":"Link Prediction","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Neural Networks","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 Calgary","funders":"","keywords":"Computer science","score_opus":0.017377801622239272,"score_gpt":0.22078974242012767,"score_spread":0.20341194079788838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243610374","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.007174569,0.0058000535,0.70453227,0.0023151233,0.0022733686,0.00041754192,0.0110588595,0.027241582,0.23918666],"genre_scores_gemma":[0.10707866,0.008761321,0.40485176,0.0010592901,0.0012981301,0.00044479556,0.040660676,0.0038952406,0.4319502],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995565,0.000039856484,0.000015663793,0.00018046917,0.00017082371,0.000036688954],"domain_scores_gemma":[0.9990557,0.00023242518,0.000038700826,0.00037439668,0.0002495345,0.000049230857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006816861,0.0014989525,0.0007235438,0.0027821881,0.0009164473,0.0018745618,0.002261736,0.0011484293,0.07785881],"category_scores_gemma":[0.0031347852,0.0005877477,0.0008896993,0.0029351264,0.000398432,0.0042516827,0.0014679402,0.0022271115,0.053729225],"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.00006749079,0.00012532585,0.0004890672,0.00025388232,0.000042679152,0.000062759485,0.000034820558,0.01662582,0.002503013,0.038345784,0.23202509,0.7094242],"study_design_scores_gemma":[0.000022826558,0.000064945125,0.001030321,0.00031001502,0.00011950069,0.00034205342,0.0000630119,0.3434289,0.014861191,0.19390358,0.44577906,0.000074649084],"about_ca_topic_score_codex":0.0043014297,"about_ca_topic_score_gemma":0.0063344985,"teacher_disagreement_score":0.07785881,"about_ca_system_score_codex":0.0007545236,"about_ca_system_score_gemma":0.0010085938,"threshold_uncertainty_score":0.26046365},"labels":[],"label_agreement":null},{"id":"W4249552842","doi":"10.1017/9781108989817.010","title":"Connected Machine Learning and Networked AI","year":2021,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Advanced Graph Neural Networks","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":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.013454288004409553,"score_gpt":0.19564263290976525,"score_spread":0.18218834490535568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249552842","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.0027528664,0.25496137,0.08996227,0.012921358,0.005208716,0.000050104245,0.00061121775,0.0010700129,0.6324621],"genre_scores_gemma":[0.07912805,0.17951688,0.039649162,0.003176257,0.0057392097,0.00020118804,0.0015507005,0.000787451,0.6902511],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998696,0.000031263833,0.0000043120285,0.000024801475,0.000060156213,0.000009851899],"domain_scores_gemma":[0.9996693,0.0002226518,0.000009732053,0.000036849495,0.000039286995,0.000022146618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025616074,0.0005833591,0.000421279,0.00074501516,0.00030733054,0.0014341561,0.0005385813,0.00077258644,0.027040673],"category_scores_gemma":[0.0010900644,0.00027147977,0.0002634186,0.0018161712,0.0010061556,0.0017656385,0.0006363501,0.0019643772,0.009672098],"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.000022682492,0.000031034942,0.00013891689,0.0005885453,0.00003181816,0.00008397611,0.00012709736,0.008326052,0.0006067196,0.32544684,0.4029165,0.26167983],"study_design_scores_gemma":[0.0000049371365,0.000016723188,0.0003162179,0.00026588165,0.000007268848,0.00012081173,0.000039471546,0.0096159745,0.0003310966,0.47275132,0.51652044,0.000009847261],"about_ca_topic_score_codex":0.0014416882,"about_ca_topic_score_gemma":0.0029446306,"teacher_disagreement_score":0.027040673,"about_ca_system_score_codex":0.00092448766,"about_ca_system_score_gemma":0.0006542372,"threshold_uncertainty_score":0.09046},"labels":[],"label_agreement":null},{"id":"W4250855575","doi":"10.1007/978-1-4939-7131-2_101110","title":"Social Graph Dataset","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Neural Networks","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 Calgary","funders":"","keywords":"Computer science; Graph; Theoretical computer science","score_opus":0.03392649535992964,"score_gpt":0.27651844337784204,"score_spread":0.2425919480179124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250855575","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.004117967,0.000645099,0.001273069,0.0005262087,0.00024910257,0.00014813764,0.9777679,0.0030710485,0.0122014955],"genre_scores_gemma":[0.0038343528,0.00026268384,0.0022513124,0.0001333157,0.00003281684,0.00013344239,0.98942953,0.000129065,0.0037935304],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99934477,0.00013504506,0.000047688864,0.00017924483,0.00020969157,0.000083641185],"domain_scores_gemma":[0.99892163,0.00030721386,0.00007855233,0.00032579261,0.00021252481,0.0001542463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051393325,0.0020872084,0.0007015527,0.0044749225,0.0010391368,0.0012300953,0.00119686,0.0015939114,0.04163941],"category_scores_gemma":[0.0036449202,0.000323422,0.0009966025,0.0036475756,0.00027353564,0.0012753311,0.0012734564,0.0012321926,0.03758423],"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.00004972708,0.00008454386,0.00085796893,0.00038532403,0.000039568833,0.000045912468,0.000029664783,0.00074563286,0.00053306983,0.0016504871,0.9804802,0.015097893],"study_design_scores_gemma":[0.00014377465,0.00007873057,0.004888094,0.00019477587,0.00005955411,0.0002635782,0.00017398446,0.00632974,0.001653803,0.006692414,0.97948164,0.000039915496],"about_ca_topic_score_codex":0.012062607,"about_ca_topic_score_gemma":0.041801747,"teacher_disagreement_score":0.04163941,"about_ca_system_score_codex":0.0008746385,"about_ca_system_score_gemma":0.0012770729,"threshold_uncertainty_score":0.13929772},"labels":[],"label_agreement":null},{"id":"W4280604520","doi":"10.21203/rs.3.rs-1639305/v1","title":"Graph Neural Networks: a bibliometrics overview","year":2022,"lang":"en","type":"preprint","venue":"Research Square","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":16,"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":"Bibliometrics; Computer science; Field (mathematics); Data science; Scopus; Artificial intelligence; Subject (documents); Graph; Convolutional neural network; Science and engineering; Library science; Engineering ethics; Political science; Engineering","score_opus":0.14965168741352466,"score_gpt":0.4316644671126066,"score_spread":0.2820127796990819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280604520","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.14800699,0.46501726,0.07387378,0.031087568,0.0026195962,0.0004312384,0.08280479,0.0028967708,0.19326216],"genre_scores_gemma":[0.67113644,0.24230872,0.033505395,0.0012179319,0.0033575494,0.00036530048,0.03673179,0.00040499063,0.01097195],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.996351,0.0010111589,0.00040612923,0.00036292284,0.0017102023,0.0001585993],"domain_scores_gemma":[0.98567677,0.007888684,0.0023916196,0.0007297385,0.0029304246,0.00038286045],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0039925985,0.0008170475,0.001031171,0.07342274,0.0007055098,0.0044628917,0.00088653737,0.0008800938,0.0047193724],"category_scores_gemma":[0.027221585,0.00029979864,0.00066429377,0.13514936,0.0008210435,0.005364983,0.0014008477,0.0007531752,0.0013621983],"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.00016402306,0.00010872521,0.07599694,0.0060225795,0.00078728824,0.00015564085,0.00049413805,0.0152871,0.00065870536,0.07261757,0.11087074,0.7168366],"study_design_scores_gemma":[0.000037248865,0.0001463715,0.16376422,0.0057810536,0.0005931383,0.0010135822,0.0018237426,0.08083432,0.0031099226,0.13207054,0.6106237,0.0002021557],"about_ca_topic_score_codex":0.0069370517,"about_ca_topic_score_gemma":0.006371176,"teacher_disagreement_score":0.92657727,"about_ca_system_score_codex":0.002653809,"about_ca_system_score_gemma":0.0014520724,"threshold_uncertainty_score":0.021115124},"labels":[{"model":"gemma","categories":["bibliometrics"],"domain":null,"study_design":"observational","genre":"review","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":["bibliometrics"],"domain":null,"study_design":"observational","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W4281563651","doi":"10.24963/ijcai.2022/295","title":"TGNN: A Joint Semi-supervised Framework for Graph-level Classification","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":42,"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; Mila - Quebec Artificial Intelligence Institute","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Graph; Theoretical computer science; Leverage (statistics); Graph embedding; Semi-supervised learning; Data mining; Machine learning; Artificial intelligence","score_opus":0.16188916389422092,"score_gpt":0.31409551449843304,"score_spread":0.15220635060421212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281563651","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.007049283,0.0003069009,0.9886126,0.0001731211,0.00004712357,0.00008547082,0.0003505965,0.0027123524,0.0006626443],"genre_scores_gemma":[0.33075276,0.0004965465,0.6578252,0.00048189395,0.00022296293,0.00053456065,0.004928574,0.00071628403,0.0040411856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978326,0.0008103981,0.000104223276,0.00071362447,0.0004004237,0.00013882654],"domain_scores_gemma":[0.99663395,0.0012300923,0.00042125036,0.0007925159,0.00075804105,0.00016417647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023678006,0.0017918446,0.0018351951,0.0027136458,0.00077798887,0.0014986387,0.0040187854,0.00212304,0.0017447983],"category_scores_gemma":[0.005963222,0.00070233765,0.0016321493,0.002338739,0.0013733577,0.0030651998,0.0017532569,0.0026553483,0.001337587],"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.00027976962,0.00037702647,0.003690998,0.00031325856,0.00031753836,0.00016511456,0.0002069408,0.50010604,0.0052652624,0.019965412,0.016884176,0.45242837],"study_design_scores_gemma":[0.000004340083,0.000015289641,0.00011610239,0.0000060726534,0.0000072403,0.000016759124,0.000008199657,0.98903614,0.0004864224,0.009744652,0.0005528149,0.000006005466],"about_ca_topic_score_codex":0.0077268174,"about_ca_topic_score_gemma":0.012914114,"teacher_disagreement_score":0.0077268174,"about_ca_system_score_codex":0.0014197647,"about_ca_system_score_gemma":0.0016455436,"threshold_uncertainty_score":0.015363693},"labels":[],"label_agreement":null},{"id":"W4281779720","doi":"10.1145/3514221.3517837","title":"A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 2022 International Conference on Management of Data","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":29,"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":"University of Hong Kong","keywords":"Scalability; Parameterized complexity; Computer science; Bipartite graph; Approximation algorithm; Linear programming; Matching (statistics); Theoretical computer science; Induced subgraph isomorphism problem; Directed graph; Graph; Mathematical optimization; Algorithm; Mathematics; Line graph","score_opus":0.06422309090837273,"score_gpt":0.2962473222413728,"score_spread":0.23202423133300004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281779720","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.0029677642,0.00023267206,0.9941459,0.00038251045,0.000032637512,0.000071455754,0.00016949093,0.00044212322,0.0015554852],"genre_scores_gemma":[0.119913824,0.00050254865,0.87286085,0.00050797575,0.0001359103,0.0004978063,0.0014865217,0.00044639182,0.0036482443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981431,0.0006251662,0.000079873054,0.00047480155,0.0004657024,0.00021144716],"domain_scores_gemma":[0.9956252,0.0030082508,0.00026099023,0.00040808032,0.00049786665,0.00019960347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026347034,0.0022552996,0.002469963,0.0017249214,0.0008877677,0.002370255,0.0029363907,0.0019528125,0.005153056],"category_scores_gemma":[0.008887184,0.0012963772,0.0019004152,0.0034536566,0.0013249145,0.0030880943,0.0024203472,0.0045864256,0.0016342688],"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.000116842,0.00027633447,0.0008791861,0.00024402108,0.00008142119,0.00014065369,0.000105006526,0.8255715,0.0010999402,0.043579217,0.013390968,0.11451492],"study_design_scores_gemma":[0.000007748699,0.000011337517,0.0000389311,0.000007202016,0.000004686598,0.000019550727,0.000012320287,0.9861492,0.00018051668,0.012887507,0.0006776462,0.0000033392532],"about_ca_topic_score_codex":0.007935644,"about_ca_topic_score_gemma":0.010798108,"teacher_disagreement_score":0.007935644,"about_ca_system_score_codex":0.0023220135,"about_ca_system_score_gemma":0.0032938875,"threshold_uncertainty_score":0.017238677},"labels":[],"label_agreement":null},{"id":"W4282913028","doi":"10.1109/tnnls.2022.3177775","title":"CLEAR: Cluster-Enhanced Contrast for Self-Supervised Graph Representation Learning","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks and Learning Systems","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":65,"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 Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Theoretical computer science; Graph; Artificial intelligence; Feature learning","score_opus":0.013269842342648951,"score_gpt":0.23941353429716494,"score_spread":0.226143691954516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4282913028","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.03652981,0.00030987646,0.95881814,0.00026527236,0.000044314216,0.00009528636,0.00024812514,0.0023856875,0.0013033969],"genre_scores_gemma":[0.5571977,0.0002709241,0.43569827,0.00050898624,0.00011090374,0.00027490093,0.0022316158,0.0005936807,0.0031130596],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991503,0.00025196146,0.000023321847,0.0003314717,0.000183179,0.00005976528],"domain_scores_gemma":[0.99823403,0.00079820363,0.00019644556,0.0004090109,0.000269295,0.00009300012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013215245,0.0010976038,0.0010190683,0.0013986815,0.0005000722,0.00086915004,0.0027173103,0.00154646,0.0020657866],"category_scores_gemma":[0.0054710074,0.00042293963,0.0009635414,0.0011939632,0.0010932361,0.002817895,0.0022178455,0.00232692,0.00073098385],"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.0006342061,0.0005263965,0.004938122,0.00037411528,0.00031349942,0.00021088425,0.00037176398,0.44693136,0.028829526,0.043648597,0.013535858,0.4596857],"study_design_scores_gemma":[0.000013786448,0.00006514186,0.00028627968,0.000006254098,0.0000121303965,0.000035941455,0.000015487723,0.9847984,0.0024179455,0.011601264,0.0007388576,0.00000855976],"about_ca_topic_score_codex":0.0023527974,"about_ca_topic_score_gemma":0.0044103833,"teacher_disagreement_score":0.0027173103,"about_ca_system_score_codex":0.0011190221,"about_ca_system_score_gemma":0.00070744543,"threshold_uncertainty_score":0.008119106},"labels":[],"label_agreement":null},{"id":"W4283075104","doi":"10.48550/arxiv.2206.08164","title":"LRGB: Long Range Graph Benchmark","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","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":"McGill University; Université de Montréal","funders":"","keywords":"Computer science; Benchmarking; Transformer; Graph; Theoretical computer science; Attention network; Artificial intelligence; Limiting; Machine learning","score_opus":0.05388534934177568,"score_gpt":0.18547651476088653,"score_spread":0.13159116541911084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283075104","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.47420567,0.014521544,0.09268909,0.01317193,0.0022479098,0.0015476409,0.2594095,0.06814715,0.074059606],"genre_scores_gemma":[0.41179165,0.002515105,0.14211328,0.0026674243,0.00028656953,0.00094400975,0.4216663,0.003774059,0.014241561],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830616,0.00047012698,0.00008423753,0.0005570999,0.0003940229,0.00018836462],"domain_scores_gemma":[0.99639076,0.0016677636,0.00024890565,0.0007743674,0.0006944769,0.0002236408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014675221,0.0026728357,0.00094087573,0.0023262503,0.0014426023,0.0013262755,0.004533518,0.0031462335,0.0052044704],"category_scores_gemma":[0.009397503,0.0005035273,0.0017396078,0.0033157018,0.0011445087,0.003040262,0.0014133266,0.0027511534,0.0026972047],"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.00075719715,0.001238286,0.008016621,0.0031474717,0.00059945305,0.0006115299,0.00024492393,0.27016428,0.004805477,0.019128911,0.5780404,0.11324552],"study_design_scores_gemma":[0.0006772842,0.0006763187,0.0075527024,0.00028293906,0.00017771698,0.0006465771,0.0005191232,0.792876,0.011626351,0.06450009,0.12036853,0.000096346455],"about_ca_topic_score_codex":0.027792137,"about_ca_topic_score_gemma":0.05212628,"teacher_disagreement_score":0.027792137,"about_ca_system_score_codex":0.002635078,"about_ca_system_score_gemma":0.0019933917,"threshold_uncertainty_score":0.055260718},"labels":[],"label_agreement":null},{"id":"W4283793952","doi":"10.1609/aaai.v36i8.20815","title":"Generalized Equivariance and Preferential Labeling for GNN Node Classification","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","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 Alberta","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China; Innovation and Technology Commission; Compute Canada; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Node (physics); Computer science; Embedding; Property (philosophy); Identity (music); Graph; Theoretical computer science; Data mining; Artificial intelligence","score_opus":0.12324925854859284,"score_gpt":0.3161050023193992,"score_spread":0.19285574377080636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283793952","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.034231335,0.00021069603,0.96274734,0.00040748314,0.000045677854,0.00010227086,0.00015757138,0.00075985095,0.0013377854],"genre_scores_gemma":[0.48478827,0.0002805278,0.5093497,0.00048343677,0.00011490505,0.00026058799,0.001127956,0.00022770869,0.0033668699],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99580944,0.00175808,0.0002503741,0.0012985906,0.0006273226,0.00025616103],"domain_scores_gemma":[0.9841171,0.008120421,0.0011463669,0.0044954843,0.0016810192,0.00043961566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005018571,0.0009958906,0.0015726553,0.0016688909,0.0016401089,0.0014526049,0.003310602,0.002014926,0.0020144514],"category_scores_gemma":[0.020101035,0.00071045564,0.0011130791,0.002574813,0.002502719,0.005242737,0.0030170283,0.003511038,0.0009290024],"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.00069250027,0.00028544385,0.009156895,0.00027481443,0.00015478524,0.00028256836,0.00056626805,0.42131528,0.007059795,0.10934747,0.007900618,0.4429636],"study_design_scores_gemma":[0.000018288214,0.00004321241,0.00029139422,0.000009920908,0.000017302455,0.00008723729,0.00003861736,0.9346433,0.002089249,0.0618039,0.00094195746,0.00001558746],"about_ca_topic_score_codex":0.0045090606,"about_ca_topic_score_gemma":0.007489827,"teacher_disagreement_score":0.005018571,"about_ca_system_score_codex":0.0021717502,"about_ca_system_score_gemma":0.0020826359,"threshold_uncertainty_score":0.026541114},"labels":[],"label_agreement":null},{"id":"W4285250766","doi":"10.1007/978-3-031-08757-8_60","title":"Augmenting Graph Inductive Learning Model with Topographical Features","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Neural Networks","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 Windsor","funders":"","keywords":"Embedding; Knowledge graph; Computer science; Graph; Adjacency matrix; Theoretical computer science; Heuristic; Artificial intelligence; Artificial neural network; Machine learning","score_opus":0.012995329388682192,"score_gpt":0.23331388451614446,"score_spread":0.22031855512746226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285250766","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.020411074,0.0002757876,0.9719282,0.00028351924,0.00008557021,0.000049017894,0.0003726406,0.0021953268,0.004398978],"genre_scores_gemma":[0.5794965,0.00052942155,0.40186915,0.0003871569,0.00013790754,0.00018490147,0.0021735262,0.00046093942,0.014760467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999833,0.00004218324,0.0000062383438,0.0000536867,0.000046123176,0.00001874514],"domain_scores_gemma":[0.99946445,0.0002505866,0.0000257912,0.00010996572,0.00013070602,0.000018597799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035496656,0.00043246677,0.00044134003,0.00076182873,0.00027817627,0.0006131843,0.0016804058,0.0006373504,0.004164504],"category_scores_gemma":[0.0014268488,0.00026912228,0.00069942814,0.000931513,0.00033697017,0.0014075796,0.0008865995,0.00093877455,0.0017567547],"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.00013636431,0.0002158352,0.0016666766,0.00017021902,0.00009481103,0.00017146699,0.00007778242,0.48154372,0.009342513,0.023791898,0.011731627,0.47105715],"study_design_scores_gemma":[0.0000053491376,0.00001970312,0.00013067362,0.000006543989,0.000016208518,0.000032408243,0.000007876599,0.980885,0.0017545966,0.015320993,0.0018159971,0.000004714186],"about_ca_topic_score_codex":0.0041452846,"about_ca_topic_score_gemma":0.00850578,"teacher_disagreement_score":0.004164504,"about_ca_system_score_codex":0.00042971203,"about_ca_system_score_gemma":0.00056332594,"threshold_uncertainty_score":0.013931692},"labels":[],"label_agreement":null},{"id":"W4285601870","doi":"10.24963/ijcai.2022/731","title":"Improving Inductive Link Prediction Using Hyper-Relational Facts (Extended Abstract)","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","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":"McGill University","funders":"Bundesministerium für Bildung und Forschung","keywords":"Computer science; Statistical relational learning; Inference; Inductive logic programming; Link (geometry); Metric (unit); Inductive bias; Task (project management); Set (abstract data type); Inductive reasoning; Artificial intelligence; Relational database; Machine learning; Graph; Code (set theory); Training set; Theoretical computer science; Multi-task learning; Information retrieval; Programming language","score_opus":0.09351631533544383,"score_gpt":0.28314915439665816,"score_spread":0.18963283906121434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285601870","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.21332867,0.0065303952,0.64397925,0.0049383645,0.0017157724,0.0003639025,0.043594405,0.057025094,0.028524263],"genre_scores_gemma":[0.6340233,0.0014008379,0.26861197,0.001003915,0.00039062992,0.00014136174,0.07942674,0.001344803,0.0136563545],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899226,0.00019516386,0.000047949306,0.00036701758,0.00030161423,0.000095846815],"domain_scores_gemma":[0.995915,0.0019912675,0.00022124413,0.00095970713,0.0007414037,0.00017132345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013942708,0.0011743366,0.0006503357,0.0024379024,0.0006961175,0.001920949,0.0020052714,0.0011969381,0.011742614],"category_scores_gemma":[0.008342403,0.00031021482,0.00091492175,0.0026091286,0.000522806,0.00449188,0.0019798938,0.0016490889,0.006345187],"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.0005701342,0.0007093168,0.016421728,0.0007776963,0.00029028257,0.00061046827,0.00025724515,0.17102562,0.0064558876,0.0140159065,0.15155716,0.63730854],"study_design_scores_gemma":[0.000037716785,0.0000791941,0.0021498976,0.00010446545,0.00008331715,0.00024466656,0.00013769229,0.9447178,0.008860598,0.027610928,0.015941024,0.000032583554],"about_ca_topic_score_codex":0.011877759,"about_ca_topic_score_gemma":0.01889401,"teacher_disagreement_score":0.011877759,"about_ca_system_score_codex":0.0007241505,"about_ca_system_score_gemma":0.0010959739,"threshold_uncertainty_score":0.039282978},"labels":[],"label_agreement":null},{"id":"W4285606778","doi":"10.24963/ijcai.2022/465","title":"Escaping Feature Twist: A Variational Graph Auto-Encoder for Node Clustering","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","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é du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cluster analysis; Autoencoder; Flattening; Theoretical computer science; Computer science; Topology (electrical circuits); Graph; Feature (linguistics); Algorithm; Twist; Artificial intelligence; Mathematics; Geometry; Deep learning; Combinatorics; Engineering","score_opus":0.05926104120348049,"score_gpt":0.2824810265796182,"score_spread":0.22321998537613771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285606778","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.024776137,0.00032302336,0.97109365,0.00022373171,0.000062455016,0.000040885945,0.00021547424,0.001967209,0.0012974186],"genre_scores_gemma":[0.59693545,0.00033650754,0.39398688,0.00045989925,0.00007814568,0.00014109281,0.0011116844,0.0008874484,0.006062834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995278,0.00012534877,0.000018406818,0.00014679666,0.0001160334,0.000065664935],"domain_scores_gemma":[0.9990188,0.0004240971,0.00007991028,0.00022375322,0.00017356193,0.000079868914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077981997,0.00087278656,0.0010416519,0.0006619879,0.0004912084,0.0007627593,0.0022818358,0.0014654819,0.0022108802],"category_scores_gemma":[0.0032544537,0.0006202562,0.0007089775,0.00083310646,0.0010196315,0.0016955481,0.0015047996,0.002053425,0.0008705429],"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.00015800569,0.000091184724,0.0014434317,0.00011820206,0.00008921934,0.0001537549,0.00021037298,0.7652719,0.011458565,0.037621506,0.0075281085,0.17585576],"study_design_scores_gemma":[0.0000037395682,0.000009557258,0.000045757602,0.0000028382335,0.0000029593539,0.000012546159,0.0000056567555,0.99402195,0.00071655447,0.004855919,0.0003183619,0.0000041627086],"about_ca_topic_score_codex":0.009072472,"about_ca_topic_score_gemma":0.01824544,"teacher_disagreement_score":0.009072472,"about_ca_system_score_codex":0.0012075935,"about_ca_system_score_gemma":0.0012862821,"threshold_uncertainty_score":0.018039346},"labels":[],"label_agreement":null},{"id":"W4285717378","doi":"10.1007/978-3-031-01588-5_10","title":"Conclusion","year":2020,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on artificial intelligence and machine learning","topic":"Advanced Graph Neural Networks","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":"Mila - Quebec Artificial Intelligence Institute; McGill University","funders":"","keywords":"Representation (politics); Graph; Computer science; Foundation (evidence); Epistemology; Geography; Political science; Theoretical computer science; Philosophy; Archaeology; Law","score_opus":0.043852146319204574,"score_gpt":0.2636903396629812,"score_spread":0.21983819334377663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285717378","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.0024924711,0.002526858,0.0059492434,0.035915963,0.011209588,0.000116370255,0.0019235325,0.0006520964,0.9392138],"genre_scores_gemma":[0.038401052,0.0028799612,0.0037662964,0.02757321,0.0028121418,0.00015865147,0.0030385389,0.0006296866,0.9207404],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99841,0.00024537032,0.000043886335,0.00033744844,0.00071052415,0.00025267756],"domain_scores_gemma":[0.9973362,0.00033621304,0.00008533987,0.0003227445,0.0014718439,0.0004475777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017594309,0.00060343585,0.0003398324,0.0009868513,0.0017025839,0.0045677763,0.001367742,0.0017553079,0.33742726],"category_scores_gemma":[0.006338204,0.00016043197,0.00064257585,0.0006970818,0.00083851535,0.0024320707,0.0019673056,0.0020247966,0.1447966],"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.00016174803,0.000058373458,0.0009330063,0.000317914,0.000017083694,0.00016438843,0.00039036424,0.0001977059,0.00082501984,0.09302419,0.73607117,0.16783904],"study_design_scores_gemma":[0.000012486048,0.00001276592,0.0005788296,0.00015123321,0.000008530904,0.000076114775,0.0003866369,0.00006107642,0.00055854296,0.012933898,0.98521465,0.000005253181],"about_ca_topic_score_codex":0.005457605,"about_ca_topic_score_gemma":0.005598153,"teacher_disagreement_score":0.33742726,"about_ca_system_score_codex":0.0027474547,"about_ca_system_score_gemma":0.0032699972,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4285818910","doi":"10.1109/tii.2022.3190548","title":"Multirelational Tensor Graph Attention Networks for Knowledge Fusion in Smart Enterprise Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Informatics","topic":"Advanced Graph Neural Networks","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":"St. Francis Xavier University","funders":"","keywords":"Computer science; Graph; Artificial intelligence; Relation (database); Domain knowledge; Machine learning; Theoretical computer science; Data mining","score_opus":0.04227203768904665,"score_gpt":0.26138907631917824,"score_spread":0.2191170386301316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285818910","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.03721591,0.0012609212,0.95695084,0.0008696051,0.00007905666,0.00006290018,0.00026532903,0.0010186759,0.0022768145],"genre_scores_gemma":[0.8372584,0.0013085468,0.15651904,0.00045769694,0.0001337445,0.00012131105,0.00097291404,0.000101420286,0.0031269232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990337,0.00030324512,0.000062519706,0.00028526387,0.00020254182,0.000112755915],"domain_scores_gemma":[0.99831796,0.00070522807,0.00025035813,0.00023398698,0.00040486295,0.00008763222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015267419,0.0010710934,0.0010453206,0.0022141174,0.000718143,0.0012988051,0.0014422869,0.0011245164,0.0019284612],"category_scores_gemma":[0.0055202264,0.00041468674,0.0011476934,0.0023878103,0.00090415333,0.0040147086,0.0020832215,0.0016690422,0.00036762338],"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.00020542274,0.00014984995,0.0024100475,0.00025326724,0.00021159001,0.00017401576,0.00037197338,0.6214614,0.0050809165,0.046473205,0.0042642467,0.31894413],"study_design_scores_gemma":[0.0000030527053,0.000018495677,0.00032149165,0.000009289795,0.000025883392,0.000017114928,0.000026187496,0.97575843,0.0008334983,0.022110902,0.0008671467,0.000008547949],"about_ca_topic_score_codex":0.020061878,"about_ca_topic_score_gemma":0.017324634,"teacher_disagreement_score":0.020061878,"about_ca_system_score_codex":0.0021486424,"about_ca_system_score_gemma":0.001500164,"threshold_uncertainty_score":0.03989023},"labels":[],"label_agreement":null},{"id":"W4287198239","doi":"10.48550/arxiv.2104.13014","title":"Node Embedding using Mutual Information and Self-Supervision based\\n Bi-level Aggregation","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Aggregate (composite); Leverage (statistics); Exploit; Node (physics); Embedding; Theoretical computer science; Cluster analysis; Graph; Range (aeronautics); Data mining; Artificial intelligence; Computer security","score_opus":0.06614258378080558,"score_gpt":0.20647641529306676,"score_spread":0.1403338315122612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287198239","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.09536251,0.0008779864,0.89797246,0.0006030584,0.00009868252,0.00007488864,0.00039795993,0.0021689273,0.0024434791],"genre_scores_gemma":[0.9006282,0.0003429365,0.09340602,0.00022982249,0.00012804558,0.000118736505,0.0010636566,0.00017288965,0.0039096363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913776,0.00020601986,0.00005111248,0.00033096469,0.00019339273,0.00008073565],"domain_scores_gemma":[0.99817324,0.00070817664,0.0003407482,0.00034040623,0.00033968853,0.00009768569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095935696,0.0010318648,0.0013230457,0.0013690667,0.00047277688,0.0009424638,0.0022648058,0.001312635,0.0012593343],"category_scores_gemma":[0.0042533507,0.00070716976,0.0010702999,0.0014174579,0.0010553609,0.0030433019,0.001588334,0.0018769099,0.00051744777],"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.00021229616,0.00016981603,0.0059332224,0.0001394135,0.00017328875,0.00017542845,0.0002620783,0.8210437,0.0031580913,0.013944955,0.0050403103,0.14974739],"study_design_scores_gemma":[0.0000027138115,0.000009472972,0.00018966122,0.0000038577955,0.0000065882728,0.0000095118985,0.0000037706009,0.99668425,0.00024136587,0.0026800176,0.00016526697,0.0000035286687],"about_ca_topic_score_codex":0.009122387,"about_ca_topic_score_gemma":0.012849146,"teacher_disagreement_score":0.009122387,"about_ca_system_score_codex":0.0011702268,"about_ca_system_score_gemma":0.00078049983,"threshold_uncertainty_score":0.018138528},"labels":[],"label_agreement":null},{"id":"W4287725551","doi":"10.48550/arxiv.2007.06704","title":"Node Copying for Protection Against Graph Neural Network Topology\\n Attacks","year":2020,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","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":"Computer science; Copying; Adversarial system; Graph; Artificial intelligence; Theoretical computer science; Network topology; Computation; Machine learning; Topology (electrical circuits); Data mining; Algorithm; Computer network; Mathematics","score_opus":0.11305097875407043,"score_gpt":0.21696220832305213,"score_spread":0.1039112295689817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287725551","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.17927726,0.0011024951,0.8044745,0.0013848513,0.00024522695,0.00019971177,0.00020023927,0.006710512,0.0064051542],"genre_scores_gemma":[0.9342483,0.00025524767,0.061723027,0.00022270276,0.00006495196,0.000064720196,0.00024351604,0.00016794653,0.0030095957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876887,0.0003037864,0.00007402397,0.00028400708,0.00040554907,0.00016368428],"domain_scores_gemma":[0.99370754,0.0015849215,0.0007174316,0.003399132,0.0003596717,0.00023137506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017418084,0.0008155657,0.0010670664,0.00088737404,0.00082537555,0.0010386063,0.0024525742,0.0014580778,0.0019311052],"category_scores_gemma":[0.0099677285,0.00037278817,0.00073284545,0.0006707483,0.0016646041,0.0033533722,0.0027209774,0.0018967206,0.0006256776],"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.0005096503,0.00021057687,0.003941663,0.00014229672,0.00013169674,0.00039996154,0.0003558925,0.58369017,0.017414968,0.041724753,0.0072676814,0.34421077],"study_design_scores_gemma":[0.0000147713545,0.00007383805,0.00029577696,0.000011386889,0.000016586957,0.00013038094,0.00002793189,0.97343624,0.008972821,0.015483341,0.0015275237,0.000009406552],"about_ca_topic_score_codex":0.0014590973,"about_ca_topic_score_gemma":0.0023141538,"teacher_disagreement_score":0.0024525742,"about_ca_system_score_codex":0.0011063294,"about_ca_system_score_gemma":0.0010554307,"threshold_uncertainty_score":0.009211719},"labels":[],"label_agreement":null},{"id":"W4288049515","doi":"10.1109/tnnls.2022.3151046","title":"Status-Aware Signed Heterogeneous Network Embedding With Graph Neural Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks and Learning Systems","topic":"Advanced Graph Neural Networks","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":"University of Toronto","funders":"","keywords":"Computer science; Embedding; Benchmarking; Signed graph; Scalability; Theoretical computer science; Robustness (evolution); Exploit; Graph embedding; Artificial intelligence; Graph; Machine learning","score_opus":0.010727710181061906,"score_gpt":0.2262846392412846,"score_spread":0.2155569290602227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288049515","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.04795616,0.0005852529,0.94588375,0.00041230794,0.00014121743,0.00007512936,0.0004981548,0.0019397796,0.0025082105],"genre_scores_gemma":[0.8016728,0.00061514345,0.18858148,0.00029087748,0.00013160534,0.00014709707,0.0024287633,0.00021111293,0.0059211445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953365,0.00012028377,0.000025046,0.00014554449,0.0001329731,0.000042551],"domain_scores_gemma":[0.9991357,0.00031361319,0.00014181738,0.00015917399,0.00020280607,0.000046881174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005393318,0.001423725,0.0007806397,0.0013284252,0.0003446591,0.0010390704,0.0014185781,0.0008948799,0.0015792367],"category_scores_gemma":[0.0035771907,0.0003474591,0.0005346447,0.0013440894,0.00052681967,0.00296859,0.0012545609,0.0014019042,0.00077162037],"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.00014910204,0.00012682469,0.0017908214,0.00014313153,0.000064383894,0.00011057859,0.00009596356,0.5679324,0.0048804963,0.016299106,0.006569487,0.40183777],"study_design_scores_gemma":[0.0000030143128,0.000010754513,0.00009845212,0.000004476859,0.000005273389,0.000011257721,0.000009404581,0.9911611,0.0006744054,0.0076357746,0.0003809175,0.000005041813],"about_ca_topic_score_codex":0.005427438,"about_ca_topic_score_gemma":0.0079882555,"teacher_disagreement_score":0.005427438,"about_ca_system_score_codex":0.0008937351,"about_ca_system_score_gemma":0.0006299654,"threshold_uncertainty_score":0.010791719},"labels":[],"label_agreement":null},{"id":"W4288490694","doi":"10.3390/v14081659","title":"Finding Asymptomatic Spreaders in a COVID-19 Transmission Network by Graph Attention Networks","year":2022,"lang":"en","type":"article","venue":"Viruses","topic":"Advanced Graph Neural Networks","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 Calgary","funders":"National Natural Science Foundation of China","keywords":"Computer science; Graph; Context (archaeology); Transmission (telecommunications); Coronavirus disease 2019 (COVID-19); Representation (politics); Artificial intelligence; Theoretical computer science; Medicine; Biology; Infectious disease (medical specialty); Disease; Telecommunications","score_opus":0.02794700601417969,"score_gpt":0.28469434709006713,"score_spread":0.2567473410758874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288490694","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.31986117,0.0013596632,0.67128307,0.0011666628,0.00007433785,0.00020232401,0.00092880364,0.0012287281,0.0038951973],"genre_scores_gemma":[0.92550886,0.0004732839,0.06786886,0.00032074485,0.00007365496,0.000105240666,0.0016844964,0.00007136937,0.0038933628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968135,0.00009322034,0.000012038043,0.0001222459,0.00003787175,0.000053319578],"domain_scores_gemma":[0.9990169,0.00059067615,0.00016144136,0.000059280952,0.0001160884,0.00005549484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055473467,0.0010155023,0.00058189227,0.0020554184,0.0004607723,0.0006984986,0.0012004531,0.0013168211,0.0011876735],"category_scores_gemma":[0.0021442447,0.00040577393,0.00092688453,0.00091586023,0.00059714384,0.0015014767,0.0006753477,0.0010475367,0.00025063538],"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.00030483562,0.00020446294,0.015937695,0.00016116856,0.00018294847,0.0004036737,0.00023260363,0.8212577,0.005953146,0.0097163245,0.004928746,0.14071661],"study_design_scores_gemma":[0.0000047937756,0.000017095528,0.0007765613,0.0000060311245,0.000015639253,0.000028073602,0.000016210177,0.9944628,0.00036534952,0.004009529,0.00029374528,0.0000041624585],"about_ca_topic_score_codex":0.0159767,"about_ca_topic_score_gemma":0.018109668,"teacher_disagreement_score":0.0159767,"about_ca_system_score_codex":0.0013114574,"about_ca_system_score_gemma":0.0005491373,"threshold_uncertainty_score":0.031767428},"labels":[],"label_agreement":null},{"id":"W4290876096","doi":"10.1145/3534678.3542609","title":"Graph Neural Networks: Foundation, Frontiers and Applications","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":199,"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":"Computer science; Deep learning; Artificial intelligence; Artificial neural network; Graph; Data science; Machine learning; Theoretical computer science","score_opus":0.03770490372849548,"score_gpt":0.27829855517463364,"score_spread":0.24059365144613817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290876096","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.008304042,0.4394355,0.40634143,0.03125509,0.0040754233,0.0001582559,0.0013482685,0.0015304219,0.10755157],"genre_scores_gemma":[0.19264308,0.58239025,0.17530632,0.005100641,0.007076719,0.00037423792,0.0025094387,0.0005347563,0.03406468],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994634,0.00013657825,0.00003264585,0.00012295131,0.00020191116,0.000042517833],"domain_scores_gemma":[0.99910754,0.0005007222,0.000042859665,0.00006450537,0.00022529493,0.000059040558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077934045,0.00092687656,0.0005567993,0.001424007,0.00040468283,0.002002665,0.0009416802,0.00174903,0.0048781736],"category_scores_gemma":[0.0027596373,0.0004985209,0.00047070684,0.0019939828,0.0013141262,0.0039170147,0.0011150239,0.0034534775,0.0017313962],"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.0000436012,0.000052295003,0.0009740291,0.0015790843,0.00004933375,0.00019993607,0.00019019358,0.026445657,0.0012031487,0.44158992,0.071672924,0.45599994],"study_design_scores_gemma":[0.000008846777,0.000040553998,0.0007031506,0.00078060775,0.000024557186,0.00042851106,0.000100832236,0.0670904,0.00091420923,0.65346783,0.27639982,0.000040646923],"about_ca_topic_score_codex":0.0031314567,"about_ca_topic_score_gemma":0.0025536036,"teacher_disagreement_score":0.0048781736,"about_ca_system_score_codex":0.0016855554,"about_ca_system_score_gemma":0.0010192824,"threshold_uncertainty_score":0.016319096},"labels":[],"label_agreement":null},{"id":"W4290948538","doi":"10.1145/3534678.3542907","title":"Deep Learning on Graphs","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","topic":"Advanced Graph Neural Networks","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":"Deep learning; Computer science; Artificial intelligence; Data science; Intersection (aeronautics); Deep neural networks; Machine learning; Engineering","score_opus":0.050789844208719355,"score_gpt":0.28848830853912777,"score_spread":0.23769846433040842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290948538","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.015824351,0.004214719,0.9571762,0.0045594797,0.00028871789,0.00006757639,0.0019965677,0.0013554014,0.014517024],"genre_scores_gemma":[0.58377725,0.015612111,0.35476172,0.0028215111,0.00068079727,0.00035249704,0.008352163,0.00069956883,0.03294245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935895,0.00020913854,0.000029835155,0.00017540145,0.00015952416,0.00006721429],"domain_scores_gemma":[0.9984364,0.00088545505,0.00011150179,0.00025702742,0.00022037282,0.00008922074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006908387,0.0007609062,0.00074321294,0.0013769842,0.00046472135,0.0018211632,0.0011309055,0.0013242913,0.0066219987],"category_scores_gemma":[0.0052494407,0.0005054132,0.0008864115,0.0015596234,0.0013030812,0.0037738157,0.0017786735,0.0028537347,0.0017675615],"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.000058262925,0.000051292063,0.0011679865,0.000364921,0.00007752312,0.00012870903,0.00014637285,0.3169974,0.0013952631,0.48556432,0.035042606,0.15900527],"study_design_scores_gemma":[0.000008753789,0.0000136606795,0.00028901477,0.00006791841,0.000009484882,0.000037861966,0.000030654537,0.39192614,0.0004803124,0.59329456,0.013831928,0.000009739748],"about_ca_topic_score_codex":0.0063518076,"about_ca_topic_score_gemma":0.009346667,"teacher_disagreement_score":0.0066219987,"about_ca_system_score_codex":0.0015638034,"about_ca_system_score_gemma":0.00086851744,"threshold_uncertainty_score":0.022152781},"labels":[],"label_agreement":null},{"id":"W4292117613","doi":"10.1155/2022/3915467","title":"Analysis of Traffic Accident Based on Knowledge Graph","year":2022,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":29,"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":"Natural Science Foundation of Jiangsu Province for Distinguished Young Scholars; Natural Science Foundation of Jiangsu Province; Postdoctoral Science Foundation of Jiangsu Province; Government of Jiangsu Province","keywords":"Accident (philosophy); Computer science; Traffic accident; Visualization; Graph; Knowledge graph; Data visualization; Graph theory; Transport engineering; Data mining; Engineering; Artificial intelligence; Theoretical computer science","score_opus":0.009627605826818776,"score_gpt":0.260424612220158,"score_spread":0.25079700639333924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292117613","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.32159826,0.000992272,0.6429118,0.001195339,0.000072855604,0.00030497613,0.0048197024,0.0023407561,0.02576412],"genre_scores_gemma":[0.9069738,0.0010301752,0.08231487,0.00008172799,0.000027565275,0.00012976727,0.0050442256,0.00007426211,0.0043235533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946743,0.00006449034,0.00004084918,0.00013249014,0.00023386131,0.000060861497],"domain_scores_gemma":[0.9990932,0.00038329436,0.00011375579,0.00007980108,0.00028957613,0.000040457264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033148492,0.0004201767,0.00028385656,0.005895541,0.00067080645,0.0012347802,0.00058962737,0.00042609836,0.0027956285],"category_scores_gemma":[0.0025897794,0.00015934616,0.0007339225,0.004201382,0.00044645494,0.002092935,0.0006492213,0.00034933016,0.00025433165],"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.00030233947,0.0002730558,0.06405517,0.00092455116,0.00034859017,0.0031150721,0.0033588025,0.19989547,0.013650272,0.15995303,0.018895414,0.5352283],"study_design_scores_gemma":[0.000020480355,0.00006788733,0.032538924,0.00010389272,0.00031372244,0.000961967,0.0019364448,0.8498772,0.006843966,0.089967854,0.017290816,0.00007688579],"about_ca_topic_score_codex":0.021880139,"about_ca_topic_score_gemma":0.0133621935,"teacher_disagreement_score":0.021880139,"about_ca_system_score_codex":0.0011330287,"about_ca_system_score_gemma":0.0012765944,"threshold_uncertainty_score":0.04350561},"labels":[],"label_agreement":null},{"id":"W4293107948","doi":"10.1007/s10601-022-09327-y","title":"Learning the travelling salesperson problem requires rethinking generalization","year":2022,"lang":"en","type":"article","venue":"Constraints","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":85,"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":"Generalization; Computer science; Pipeline (software); Artificial intelligence; Artificial neural network; Machine learning; Deep learning; Graph; Theoretical computer science; Mathematics","score_opus":0.021729185091301555,"score_gpt":0.24121363847145047,"score_spread":0.2194844533801489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293107948","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.14103477,0.0005079271,0.84065545,0.0030501417,0.0001664731,0.0002049768,0.0002844478,0.0024942416,0.011601658],"genre_scores_gemma":[0.80845624,0.00031151017,0.18475674,0.00096264767,0.000071262424,0.00024489744,0.0004851093,0.0005180589,0.004193615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987317,0.00047450283,0.000063827014,0.00039571628,0.0001998165,0.0001344708],"domain_scores_gemma":[0.9941613,0.0037954475,0.00024116831,0.0012135607,0.00043675496,0.00015181831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003161669,0.00091491576,0.0010749553,0.000361873,0.00060811016,0.0016091242,0.002444411,0.0018859602,0.005455721],"category_scores_gemma":[0.018187597,0.00070504635,0.0007391069,0.00042943557,0.0019681146,0.0060571516,0.0024582187,0.005218004,0.0010165607],"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.00018099573,0.00022852201,0.001835355,0.00019588604,0.000058819078,0.00010399808,0.00017905058,0.80896306,0.003989261,0.057450205,0.0065583517,0.1202564],"study_design_scores_gemma":[0.000007418979,0.00003158063,0.00008318968,0.000011862823,0.000004331965,0.000011521893,0.000016535827,0.9715469,0.00086752913,0.026920814,0.00049396534,0.000004336752],"about_ca_topic_score_codex":0.003873352,"about_ca_topic_score_gemma":0.0048879003,"teacher_disagreement_score":0.005455721,"about_ca_system_score_codex":0.0014338859,"about_ca_system_score_gemma":0.0015892886,"threshold_uncertainty_score":0.01825124},"labels":[],"label_agreement":null},{"id":"W4293118172","doi":"10.1007/978-3-031-01588-5_2","title":"Background and Traditional Approaches","year":2020,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on artificial intelligence and machine learning","topic":"Advanced Graph Neural Networks","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":"Mila - Quebec Artificial Intelligence Institute; McGill University","funders":"","keywords":"Computer science; Deep learning; Artificial intelligence; Key (lock); Representation (politics); Graph; Data science; Theoretical computer science","score_opus":0.17223109992347463,"score_gpt":0.2675761701073073,"score_spread":0.09534507018383265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293118172","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.0015582299,0.059976105,0.06888485,0.011044592,0.0051267496,0.00007377902,0.00073349033,0.00040984925,0.8521924],"genre_scores_gemma":[0.039972164,0.07249469,0.049511194,0.006437814,0.009126179,0.00030596094,0.0019205443,0.0005681364,0.8196633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99916816,0.00014489019,0.00003549681,0.00024965947,0.00030038497,0.00010142127],"domain_scores_gemma":[0.9995478,0.00016219245,0.000022021779,0.00008228361,0.00014108374,0.000044563683],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008429182,0.0010797617,0.00058771885,0.0028553025,0.0020760887,0.0042518224,0.0022286738,0.0018031098,0.09318888],"category_scores_gemma":[0.0017504485,0.00041764748,0.00054723147,0.0033977346,0.0027462468,0.005689585,0.0024654816,0.002575144,0.048252657],"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.00002205358,0.000053133743,0.000098206365,0.00033412667,0.0000065986387,0.00004965398,0.0003556187,0.00033093846,0.00028730268,0.7576544,0.110225365,0.13058265],"study_design_scores_gemma":[0.0000029666357,0.000010411295,0.00010506966,0.00022406846,0.0000047797344,0.0000986863,0.00013461652,0.0003450336,0.00018297895,0.23104067,0.7678431,0.0000075065805],"about_ca_topic_score_codex":0.00215637,"about_ca_topic_score_gemma":0.0029785098,"teacher_disagreement_score":0.9068111,"about_ca_system_score_codex":0.0024175856,"about_ca_system_score_gemma":0.0018226373,"threshold_uncertainty_score":0.31174785},"labels":[],"label_agreement":null},{"id":"W4293118256","doi":"10.1007/978-3-031-01588-5_4","title":"Multi-Relational Data and Knowledge Graphs","year":2020,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on artificial intelligence and machine learning","topic":"Advanced Graph Neural Networks","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":"Mila - Quebec Artificial Intelligence Institute; McGill University","funders":"","keywords":"Embedding; Computer science; Focus (optics); Knowledge graph; Theoretical computer science; Relational database; Statistical relational learning; Node (physics); Artificial intelligence; Data science; Data mining; Engineering; Physics","score_opus":0.10949688771132361,"score_gpt":0.3035231000219495,"score_spread":0.1940262123106259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293118256","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.0037830356,0.03522526,0.7644225,0.007079889,0.0027475334,0.0000673749,0.0033225853,0.0020618166,0.18129002],"genre_scores_gemma":[0.123920515,0.048549134,0.5716781,0.0024539717,0.003222916,0.00020688887,0.009282822,0.0014405212,0.2392451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994795,0.0000760036,0.000039310526,0.0001529875,0.00023110029,0.000021101854],"domain_scores_gemma":[0.99888796,0.00059442135,0.000042674805,0.00030973283,0.000114266884,0.00005100895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006930042,0.0006678002,0.00070411706,0.0016912991,0.0004424455,0.0033046596,0.0011368846,0.00072271,0.025468756],"category_scores_gemma":[0.002190957,0.0005835114,0.000658393,0.004582254,0.0012866742,0.008722847,0.0016103404,0.0020669587,0.007361096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016540454,0.000028040551,0.00016002652,0.00036594368,0.000028153307,0.00009511732,0.00015518689,0.0036209808,0.0011964665,0.58429503,0.101780914,0.30825755],"study_design_scores_gemma":[0.000003446537,0.0000075157054,0.00025390473,0.00013481449,0.000014512013,0.00026378132,0.00006298377,0.0116760945,0.0010370176,0.67662466,0.30990645,0.000014790124],"about_ca_topic_score_codex":0.0009177107,"about_ca_topic_score_gemma":0.0014323648,"teacher_disagreement_score":0.025468756,"about_ca_system_score_codex":0.0011055182,"about_ca_system_score_gemma":0.0005177914,"threshold_uncertainty_score":0.0852015},"labels":[],"label_agreement":null},{"id":"W4294959418","doi":"10.1109/wi-iat55865.2022.00049","title":"Impact of Injecting Ground Truth Explanations on Relational Graph Convolutional Networks and their Explanation Methods for Link Prediction on Knowledge Graphs","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Neural Networks","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":"Thales (Canada)","funders":"","keywords":"Ground truth; Leverage (statistics); Computer science; Knowledge graph; Benchmark (surveying); Theoretical computer science; Graph; Node (physics); Black box; Artificial intelligence; Machine learning","score_opus":0.05978387932113884,"score_gpt":0.3664902829082578,"score_spread":0.306706403587119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294959418","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.60872614,0.0057914243,0.3645974,0.003937554,0.00044882437,0.00019851836,0.002367044,0.007256516,0.0066764904],"genre_scores_gemma":[0.9364967,0.0005689688,0.0574633,0.0004333906,0.0000707849,0.00005355123,0.003200331,0.00022535208,0.0014875451],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972458,0.001190922,0.00014044653,0.0007724073,0.00046688752,0.00018371212],"domain_scores_gemma":[0.96897364,0.024700165,0.0014257005,0.0030394676,0.0013888888,0.00047207807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051139523,0.001596571,0.0007348498,0.0014188213,0.00055335055,0.001591188,0.0018857403,0.0024584946,0.0027548517],"category_scores_gemma":[0.045362037,0.00047669807,0.000870175,0.0009797567,0.0015072519,0.005311671,0.002231026,0.0029934964,0.00052858493],"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.0010967603,0.00032466967,0.0290236,0.00047944055,0.0003559281,0.0002510272,0.00029948092,0.67379045,0.0024403546,0.015940273,0.008462109,0.2675359],"study_design_scores_gemma":[0.000029153416,0.000095147356,0.0012868434,0.00007661778,0.00005574982,0.000050166393,0.0000607891,0.98192674,0.0023369521,0.013315769,0.00075346936,0.000012573945],"about_ca_topic_score_codex":0.011448256,"about_ca_topic_score_gemma":0.017552009,"teacher_disagreement_score":0.011448256,"about_ca_system_score_codex":0.002211941,"about_ca_system_score_gemma":0.0017982783,"threshold_uncertainty_score":0.027045548},"labels":[],"label_agreement":null},{"id":"W4295088574","doi":"10.1038/s41598-022-19419-7","title":"Explainable artificial intelligence through graph theory by generalized social network analysis-based classifier","year":2022,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":20,"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":"Classifier (UML); Computer science; Artificial intelligence; Graph; Graph theory; Machine learning; Theoretical computer science; Mathematics; Combinatorics","score_opus":0.02715685552864167,"score_gpt":0.2760701071264671,"score_spread":0.24891325159782546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295088574","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.027943974,0.00062057073,0.96549106,0.0009534193,0.000058457084,0.00008876714,0.0003043232,0.0007034959,0.0038360266],"genre_scores_gemma":[0.687463,0.000915533,0.30692327,0.00040907503,0.00019159763,0.00030457883,0.00095151534,0.00012766926,0.0027137625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929345,0.00023124245,0.00003093346,0.00018111264,0.00021660638,0.000046646128],"domain_scores_gemma":[0.99845636,0.0008621052,0.00022096059,0.00021162469,0.00019759235,0.000051385483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091216643,0.000762105,0.0006790047,0.0028856408,0.00043430703,0.0016854103,0.00095252745,0.000993493,0.0015403675],"category_scores_gemma":[0.0040302034,0.00023358842,0.0009519781,0.0016631767,0.0012866496,0.002845532,0.0009859533,0.0010477074,0.00038387283],"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.000110620196,0.00011651442,0.009354739,0.0003261176,0.00017294407,0.0003184595,0.0005160375,0.43305457,0.0057501313,0.22848451,0.008981484,0.3128139],"study_design_scores_gemma":[0.000004640124,0.000016921458,0.0006475539,0.000017160743,0.000012079136,0.000037395104,0.000039807415,0.9046292,0.0006092161,0.09185319,0.002123761,0.000009204934],"about_ca_topic_score_codex":0.0034139974,"about_ca_topic_score_gemma":0.002496729,"teacher_disagreement_score":0.0034139974,"about_ca_system_score_codex":0.0011064389,"about_ca_system_score_gemma":0.00059556623,"threshold_uncertainty_score":0.008027852},"labels":[],"label_agreement":null},{"id":"W4297780663","doi":"10.5281/zenodo.7071856","title":"KBI-Regex Datasets","year":2022,"lang":"en","type":"paratext","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Advanced Graph Neural Networks","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":"Computer science; Artificial intelligence","score_opus":0.03401106583812267,"score_gpt":0.26447791780259905,"score_spread":0.2304668519644764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297780663","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.0026354287,0.0006456819,0.0006736921,0.0004373192,0.00010928122,0.00015450826,0.9845621,0.0056283367,0.005153602],"genre_scores_gemma":[0.0024352544,0.00014803444,0.001264679,0.00009590216,0.000010566642,0.0001550846,0.9945258,0.00017236892,0.0011923113],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99800533,0.00045776248,0.00029400943,0.00044763248,0.0005560451,0.00023917873],"domain_scores_gemma":[0.99698454,0.0007603951,0.00018860477,0.0009843383,0.0008443905,0.00023768387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015517938,0.0031223022,0.0015823382,0.0038652618,0.0016571877,0.002489101,0.004215888,0.003650641,0.043198902],"category_scores_gemma":[0.007641819,0.0008267644,0.0013420224,0.007127065,0.0006153015,0.002808665,0.0020068495,0.0029672834,0.05963257],"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.0002790952,0.00017621224,0.00063498266,0.00093256956,0.00005829669,0.00012288816,0.000051990668,0.0019128671,0.00084225123,0.0016087968,0.98579526,0.0075849295],"study_design_scores_gemma":[0.0007701843,0.00012896101,0.004656557,0.00028219266,0.00008980582,0.00038757597,0.00030753404,0.007403617,0.003678281,0.0037328296,0.9784768,0.000085621665],"about_ca_topic_score_codex":0.037439667,"about_ca_topic_score_gemma":0.036536973,"teacher_disagreement_score":0.043198902,"about_ca_system_score_codex":0.0026576184,"about_ca_system_score_gemma":0.0026389167,"threshold_uncertainty_score":0.14451474},"labels":[],"label_agreement":null},{"id":"W4297829713","doi":"10.1016/j.ipm.2022.103076","title":"An efficiency relation-specific graph transformation network for knowledge graph representation learning","year":2022,"lang":"en","type":"article","venue":"Information Processing & Management","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Graph; Relation (database); Transformation (genetics); Theoretical computer science; Artificial intelligence; Data mining","score_opus":0.0176962029112127,"score_gpt":0.27233710557709767,"score_spread":0.25464090266588496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297829713","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.010389197,0.00011231632,0.9847925,0.00019362669,0.00003725906,0.000113588685,0.00032241107,0.0012748517,0.0027643123],"genre_scores_gemma":[0.37622306,0.0004108262,0.6084624,0.00030525515,0.000056928537,0.0004332989,0.003063891,0.0002973947,0.010747011],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994191,0.00012516373,0.000035956713,0.00021025546,0.00016552806,0.00004409645],"domain_scores_gemma":[0.9992269,0.00025143952,0.00005121449,0.00023767454,0.00018938587,0.00004333872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006699044,0.00050979684,0.0007066359,0.0010508102,0.0004808515,0.0007666565,0.0016035914,0.00076240033,0.0058967625],"category_scores_gemma":[0.0030210959,0.0002913892,0.0007042543,0.0014168237,0.0005042797,0.0022045695,0.0018597463,0.0013724994,0.0012652249],"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.00027894194,0.00034764298,0.0013486037,0.00020071813,0.00011340499,0.00014798927,0.00014098869,0.17648633,0.009548619,0.08069413,0.012959362,0.7177332],"study_design_scores_gemma":[0.000017466931,0.00004637181,0.0003602543,0.000013071539,0.00003724516,0.000053004394,0.00002644717,0.94810206,0.0023644941,0.045841586,0.0031292601,0.000008721094],"about_ca_topic_score_codex":0.005490964,"about_ca_topic_score_gemma":0.00895857,"teacher_disagreement_score":0.0058967625,"about_ca_system_score_codex":0.00089060556,"about_ca_system_score_gemma":0.0014022785,"threshold_uncertainty_score":0.019726694},"labels":[],"label_agreement":null},{"id":"W4297991630","doi":"10.21428/594757db.06b4cfb6","title":"Deep Learning of Latent Edge Types from Relational Data","year":2022,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Computer science; Graph; Encoder; Benchmark (surveying); Enhanced Data Rates for GSM Evolution; Generative grammar; Theoretical computer science; Layer (electronics); Feature (linguistics); Node (physics); Artificial intelligence","score_opus":0.04305249582634049,"score_gpt":0.2554176522886831,"score_spread":0.21236515646234258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297991630","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.16713263,0.0025636456,0.80879503,0.0013796187,0.00011338443,0.00011628844,0.009632003,0.0061845374,0.004082805],"genre_scores_gemma":[0.8171729,0.0010979677,0.15275331,0.00046409818,0.000078255565,0.000099109864,0.023023877,0.00036718755,0.004943386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994398,0.00013860925,0.000022766691,0.00024695095,0.00009113671,0.00006075276],"domain_scores_gemma":[0.9980636,0.0011195773,0.00018154076,0.00040171202,0.00016820611,0.000065232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009440815,0.0010374434,0.0005972181,0.0017628856,0.0003736982,0.0010771563,0.0014225608,0.0011348769,0.0019472509],"category_scores_gemma":[0.0045297025,0.000557125,0.0011492174,0.0020358262,0.00070040097,0.00350551,0.00097136374,0.0023320364,0.001085588],"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.00032617344,0.0003436235,0.029202227,0.00042723384,0.0002940867,0.00032288415,0.0003842592,0.5329224,0.0075779366,0.04264757,0.025144069,0.36040747],"study_design_scores_gemma":[0.000009510564,0.000020139569,0.0014061154,0.000032600554,0.000030729097,0.00004793895,0.000038365793,0.95827234,0.0018403211,0.03635452,0.0019374861,0.000009881531],"about_ca_topic_score_codex":0.01055497,"about_ca_topic_score_gemma":0.030272309,"teacher_disagreement_score":0.01055497,"about_ca_system_score_codex":0.0012078225,"about_ca_system_score_gemma":0.0006502046,"threshold_uncertainty_score":0.020987093},"labels":[],"label_agreement":null},{"id":"W4299570738","doi":"10.1609/aaai.v28i1.8976","title":"Convex Co-embedding","year":2014,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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 Alberta","funders":"","keywords":"Embedding; Ranking (information retrieval); Regular polygon; Relation (database); Computer science; Relevance (law); Convex optimization; Artificial intelligence; Linear scale; Current (fluid); Theoretical computer science; Machine learning; Space (punctuation); Mathematical optimization; Mathematics; Data mining; Geometry; Engineering; Geography","score_opus":0.010130865001321054,"score_gpt":0.2759580041804148,"score_spread":0.26582713917909373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299570738","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.0025596975,0.00022462665,0.99444205,0.00020019217,0.000035095924,0.000022456763,0.00019386885,0.00015422265,0.0021678617],"genre_scores_gemma":[0.35474056,0.0016790689,0.6163922,0.0004992947,0.00035427965,0.0005301681,0.003042308,0.00067798153,0.02208413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99751437,0.00096468214,0.00011748949,0.0007470562,0.00051837804,0.0001380149],"domain_scores_gemma":[0.99518836,0.0020207642,0.00041500473,0.0014213623,0.00072643446,0.00022813694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019627223,0.0019466515,0.0015069384,0.001725225,0.0007340627,0.0024811185,0.0024565777,0.0017730388,0.008024031],"category_scores_gemma":[0.009157955,0.0007592996,0.0012824984,0.0023111964,0.002190759,0.005012001,0.00391876,0.0034718204,0.0030139447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008214201,0.00008689596,0.0009757424,0.00027602236,0.00012664357,0.0002482509,0.00020834485,0.35643992,0.0021955818,0.50351524,0.010786912,0.12505826],"study_design_scores_gemma":[0.0000056534896,0.000039209215,0.00019583828,0.000024393034,0.000012703499,0.000117204094,0.000025809111,0.7702401,0.0007602935,0.22177286,0.0067896536,0.000016147695],"about_ca_topic_score_codex":0.0019702278,"about_ca_topic_score_gemma":0.0026380473,"teacher_disagreement_score":0.008024031,"about_ca_system_score_codex":0.0011754413,"about_ca_system_score_gemma":0.0009020576,"threshold_uncertainty_score":0.026843071},"labels":[],"label_agreement":null},{"id":"W4306317318","doi":"10.1145/3511808.3557688","title":"Sampling Enclosing Subgraphs for Link Prediction","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 31st ACM International Conference on Information &amp; Knowledge Management","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Scalability; Computer science; Overhead (engineering); Link (geometry); Graph; Theoretical computer science; Representation (politics); Induced subgraph isomorphism problem; Line graph; Computer network","score_opus":0.06510801511284907,"score_gpt":0.30575703596044224,"score_spread":0.24064902084759315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306317318","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.11620029,0.0008496318,0.87062275,0.00043864138,0.000061828534,0.000121397876,0.0021721935,0.0069274595,0.002605833],"genre_scores_gemma":[0.78270113,0.00051978196,0.20570415,0.00024610525,0.00008552866,0.00015170754,0.007692682,0.00040112276,0.0024978162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.999448,0.00012297943,0.000020087447,0.00021654509,0.0001351853,0.000057077363],"domain_scores_gemma":[0.998453,0.00072021864,0.00018667648,0.00041768613,0.0001548664,0.00006762702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045616785,0.0010015387,0.0008633368,0.0017576889,0.0005148491,0.0005755079,0.00117548,0.00094889605,0.0019504367],"category_scores_gemma":[0.004183988,0.00040362045,0.00073048944,0.0021092591,0.0005624903,0.0021684358,0.0009992217,0.001064768,0.00093111733],"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.00027202707,0.00018700924,0.011945368,0.00022506104,0.00013924809,0.00032408405,0.00020594377,0.64107394,0.011279049,0.013670139,0.016578186,0.3041],"study_design_scores_gemma":[0.000008793172,0.000024175655,0.00076197326,0.0000098230375,0.00001558769,0.000054415978,0.000033880613,0.9795084,0.0021575103,0.01591856,0.0014998486,0.0000069942334],"about_ca_topic_score_codex":0.0073377574,"about_ca_topic_score_gemma":0.014116674,"teacher_disagreement_score":0.0073377574,"about_ca_system_score_codex":0.00058042654,"about_ca_system_score_gemma":0.0006826707,"threshold_uncertainty_score":0.014590085},"labels":[],"label_agreement":null},{"id":"W4306317442","doi":"10.1145/3511808.3557181","title":"PyDHNet: A Python Library for Dynamic Heterogeneous Network Representation Learning and Evaluation","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 31st ACM International Conference on Information &amp; Knowledge Management","topic":"Advanced Graph Neural Networks","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":"Toronto Metropolitan University","funders":"","keywords":"Python (programming language); Computer science; Representation (politics); Architecture; Software engineering; Theoretical computer science; Artificial intelligence; Programming language","score_opus":0.042516795527662604,"score_gpt":0.318841784027764,"score_spread":0.27632498850010134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306317442","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.008284614,0.0003058205,0.7214891,0.0005803962,0.00029598142,0.00042154008,0.010861843,0.2475587,0.0102020735],"genre_scores_gemma":[0.19078931,0.0008814103,0.71307015,0.0012594262,0.00016441318,0.0021606586,0.035486497,0.04204114,0.014146926],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99899226,0.0002415246,0.00008602082,0.0002058622,0.0003608924,0.00011347603],"domain_scores_gemma":[0.9985275,0.00057935325,0.00013976732,0.00030623985,0.00030372458,0.0001433759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020247735,0.0016119429,0.0008670511,0.0014933634,0.00061937334,0.0016435737,0.0037855778,0.00096682296,0.025866153],"category_scores_gemma":[0.007976426,0.0008151372,0.00120587,0.0011342625,0.00087980443,0.0032873673,0.002482023,0.0027798463,0.009166335],"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.00075161824,0.00038873992,0.005348346,0.0016283016,0.00043174543,0.0007103621,0.00032085332,0.21968746,0.01065501,0.038745526,0.3740179,0.34731412],"study_design_scores_gemma":[0.000109405344,0.00006445006,0.00094278686,0.0000735981,0.000029954888,0.00018088572,0.000037339698,0.9175538,0.009507319,0.03109965,0.04033906,0.00006182398],"about_ca_topic_score_codex":0.0075851274,"about_ca_topic_score_gemma":0.010369482,"teacher_disagreement_score":0.025866153,"about_ca_system_score_codex":0.0013133611,"about_ca_system_score_gemma":0.0029861704,"threshold_uncertainty_score":0.086530924},"labels":[],"label_agreement":null},{"id":"W4307935090","doi":"10.48550/arxiv.2210.17457","title":"Agglomeration of Polygonal Grids using Graph Neural Networks with applications to Multigrid solvers","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","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":"Gruppo Nazionale per il Calcolo Scientifico; Ministero dell'Università e della Ricerca; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Computer science; Multigrid method; Grid; Graph partition; Scalability; Graph; Cluster analysis; Theoretical computer science; Inference; Artificial neural network; Algorithm; Artificial intelligence; Mathematics","score_opus":0.05739226460969931,"score_gpt":0.20824898977672382,"score_spread":0.1508567251670245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307935090","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.028694892,0.00030606918,0.9675425,0.00033601743,0.000043228683,0.000050705916,0.00007347713,0.0007904389,0.002162625],"genre_scores_gemma":[0.5015933,0.00031150942,0.49399564,0.00015864935,0.000045466804,0.00016705906,0.00029034706,0.00027737548,0.0031606893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996568,0.00010556696,0.000017630084,0.000074068164,0.000111624344,0.00003429595],"domain_scores_gemma":[0.9989215,0.0005798413,0.00012648219,0.00012058257,0.00020029065,0.000051349594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063158193,0.0007624559,0.0006253818,0.0009817404,0.0005773019,0.001010042,0.0010979996,0.0011436336,0.0016475642],"category_scores_gemma":[0.0027651805,0.00046732783,0.0006583027,0.0010065578,0.00078043,0.001059856,0.0013826848,0.0010667868,0.00034993433],"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.00002206241,0.000012693261,0.000388281,0.000028319619,0.000015558177,0.00002719788,0.00004307311,0.97292894,0.0006239881,0.0039513595,0.00041903747,0.021539526],"study_design_scores_gemma":[0.0000011709219,0.0000021667324,0.00002730607,0.0000018071264,8.561069e-7,0.0000025371999,0.0000039094953,0.9979113,0.00015771766,0.0017598629,0.00013021869,0.0000011149766],"about_ca_topic_score_codex":0.017440017,"about_ca_topic_score_gemma":0.018460637,"teacher_disagreement_score":0.017440017,"about_ca_system_score_codex":0.0012708168,"about_ca_system_score_gemma":0.00080223114,"threshold_uncertainty_score":0.03467703},"labels":[],"label_agreement":null},{"id":"W4311081148","doi":"10.21203/rs.3.rs-2318594/v1","title":"Learning Heterogeneous Subgraph Representations for Team Discovery","year":2022,"lang":"en","type":"preprint","venue":"Research Square","topic":"Advanced Graph Neural Networks","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 Guelph; York University; Toronto Metropolitan University","funders":"","keywords":"Computer science; Overfitting; Ranking (information retrieval); Set (abstract data type); Graph; Machine learning; Task (project management); Artificial intelligence; Baseline (sea); Representation (politics); Data science; Artificial neural network; Theoretical computer science","score_opus":0.06686809311051695,"score_gpt":0.41006030328920096,"score_spread":0.343192210178684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311081148","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.08885886,0.0014736707,0.89752185,0.0013115527,0.000098235716,0.00017412855,0.0018082804,0.003674391,0.0050789835],"genre_scores_gemma":[0.7478063,0.00074766355,0.23724635,0.00052339165,0.00018514805,0.00022778922,0.0075693973,0.00028960442,0.005404355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876994,0.00043129633,0.000044389297,0.0004013686,0.00023783537,0.00011502854],"domain_scores_gemma":[0.99765056,0.0012225467,0.00029263628,0.0004403849,0.00023672591,0.00015713065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011558733,0.001156061,0.0010805118,0.0035356663,0.0007796573,0.0013349513,0.0022919702,0.0019054881,0.0024249996],"category_scores_gemma":[0.006307729,0.00044719476,0.0011537359,0.0033520495,0.0007313336,0.0029850393,0.0017166702,0.0016381386,0.0009252257],"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.0002817011,0.00040850163,0.007278045,0.00035888044,0.00028042455,0.00028111052,0.00031984225,0.56575954,0.0028573708,0.03177172,0.027363852,0.36303902],"study_design_scores_gemma":[0.000014340966,0.000017096516,0.00039328457,0.000018675306,0.00002034192,0.000036422858,0.000050305316,0.96128273,0.0006185642,0.035963908,0.0015779458,0.000006375866],"about_ca_topic_score_codex":0.00842472,"about_ca_topic_score_gemma":0.012669447,"teacher_disagreement_score":0.00842472,"about_ca_system_score_codex":0.0017047671,"about_ca_system_score_gemma":0.0010551673,"threshold_uncertainty_score":0.016751409},"labels":[],"label_agreement":null},{"id":"W4311529135","doi":"10.21203/rs.3.rs-2327811/v1","title":"DyHNet: Learning Dynamic Heterogeneous Network Representations","year":2022,"lang":"en","type":"preprint","venue":"Research Square","topic":"Advanced Graph Neural Networks","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 Guelph; Toronto Metropolitan University","funders":"","keywords":"Computer science; Representation (politics); Learning network; Artificial intelligence; Feature learning; State (computer science); Range (aeronautics); Semantics (computer science); Theoretical computer science; Machine learning; Programming language","score_opus":0.05132208149437733,"score_gpt":0.4066155392973612,"score_spread":0.3552934578029839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311529135","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.04844171,0.0015955658,0.9377519,0.0011131102,0.0001951053,0.00014462591,0.0023382602,0.0051854635,0.003234227],"genre_scores_gemma":[0.65282154,0.0009864677,0.32563058,0.0006647604,0.00024587486,0.00026992123,0.009059531,0.0005148823,0.009806494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932086,0.00020090344,0.000021770862,0.00027764362,0.000119883145,0.00005899828],"domain_scores_gemma":[0.9987947,0.0005639184,0.00015362982,0.00026502888,0.00014185093,0.000080933605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011506934,0.0011872771,0.0010205251,0.0022108636,0.0005992845,0.0015778203,0.002358525,0.0014329343,0.003219791],"category_scores_gemma":[0.004333757,0.0005208491,0.0008005678,0.0023995165,0.0007904066,0.0029846686,0.0018789424,0.00227353,0.0007897983],"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.00025306368,0.00020165244,0.0032920302,0.00022156187,0.00021529777,0.00018359016,0.000113048925,0.706865,0.0029576567,0.026585447,0.024677847,0.23443392],"study_design_scores_gemma":[0.000008631958,0.000014024699,0.00012917309,0.0000063648736,0.0000059455947,0.000019182935,0.000011980264,0.9886502,0.00046266333,0.009721221,0.00096610724,0.0000045851807],"about_ca_topic_score_codex":0.009118272,"about_ca_topic_score_gemma":0.012767876,"teacher_disagreement_score":0.009118272,"about_ca_system_score_codex":0.0013236603,"about_ca_system_score_gemma":0.00090031285,"threshold_uncertainty_score":0.018130362},"labels":[],"label_agreement":null},{"id":"W4313066861","doi":"10.1109/itc-cscc55581.2022.9895090","title":"Graph Wavelet Convolutional Network with Graph Clustering","year":2022,"lang":"en","type":"article","venue":"2022 37th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC)","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":1,"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":"Japan Society for the Promotion of Science","keywords":"Computer science; Graph; Voltage graph; Artificial intelligence; Pattern recognition (psychology); Line graph; Theoretical computer science","score_opus":0.04432750973420105,"score_gpt":0.26852405554742304,"score_spread":0.224196545813222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313066861","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.016632142,0.00028094175,0.9777794,0.00028882336,0.00009406673,0.0000465316,0.00018817015,0.0013437588,0.0033462073],"genre_scores_gemma":[0.44248793,0.0007454661,0.5398276,0.00044012966,0.00011533344,0.00018711781,0.0014934014,0.0004060854,0.014296906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974185,0.000045483448,0.000010707137,0.00008502088,0.00007433169,0.000042563926],"domain_scores_gemma":[0.9997012,0.00007094447,0.00003390462,0.00006773772,0.00009713999,0.000029091405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036758918,0.000828918,0.0005914388,0.001058573,0.00041245334,0.00074813986,0.0012906251,0.0009485291,0.002810335],"category_scores_gemma":[0.0013010808,0.00033881064,0.0007044741,0.0014115995,0.0006294217,0.0016420683,0.0008859628,0.0012248288,0.00095402834],"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.00017160074,0.00011452285,0.0011939144,0.00014097209,0.00010891121,0.00014495419,0.00006874108,0.606557,0.012108707,0.080587916,0.009198292,0.28960437],"study_design_scores_gemma":[0.0000029124062,0.000010597094,0.00007840804,0.0000024975784,0.000005257582,0.000014071536,0.0000028745994,0.991443,0.001117452,0.0063962196,0.00092287787,0.0000039164597],"about_ca_topic_score_codex":0.00988348,"about_ca_topic_score_gemma":0.01097979,"teacher_disagreement_score":0.00988348,"about_ca_system_score_codex":0.0011262209,"about_ca_system_score_gemma":0.0011015424,"threshold_uncertainty_score":0.01965195},"labels":[],"label_agreement":null},{"id":"W4313217515","doi":"10.1016/j.xpro.2022.101966","title":"Implementation of a graph-embedded topic model for analysis of population-level electronic health records","year":2022,"lang":"en","type":"article","venue":"STAR Protocols","topic":"Advanced Graph Neural Networks","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":"Fonds de recherche du Québec – Nature et technologies; Medical Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Graph; Health records; Population; Data science; Medicine; Theoretical computer science; Environmental health; Health care; Political science","score_opus":0.06876789409001349,"score_gpt":0.4091217982207846,"score_spread":0.3403539041307711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313217515","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.0062421677,0.00004288839,0.9780676,0.00038230963,0.00005984978,0.00013905556,0.0021996887,0.011702853,0.0011635032],"genre_scores_gemma":[0.14992534,0.00018991526,0.8321715,0.00033843497,0.000057296824,0.0010371044,0.010364968,0.001787334,0.004128199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908674,0.00036082722,0.00006730046,0.00022336334,0.00020474955,0.000057072077],"domain_scores_gemma":[0.99757236,0.0015120064,0.00007648811,0.0004321931,0.00033756896,0.00006941141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024721846,0.0005692282,0.00050113274,0.0011232691,0.00047858345,0.0010909775,0.002028612,0.0010889828,0.009975896],"category_scores_gemma":[0.0126715815,0.0007499612,0.0012210528,0.0012348361,0.000312951,0.0017017346,0.0013514998,0.0018631251,0.0036262842],"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.00058241974,0.00035285673,0.011590186,0.00032473507,0.0007203644,0.0004307564,0.00074467075,0.575663,0.008139835,0.070399374,0.055415206,0.27563664],"study_design_scores_gemma":[0.000047166108,0.000017613933,0.00047698952,0.0000086762375,0.000019377156,0.00003830663,0.000021525297,0.9678468,0.0013767292,0.025245633,0.004884764,0.000016313701],"about_ca_topic_score_codex":0.016286252,"about_ca_topic_score_gemma":0.024681527,"teacher_disagreement_score":0.016286252,"about_ca_system_score_codex":0.0007983598,"about_ca_system_score_gemma":0.0022003455,"threshold_uncertainty_score":0.03337276},"labels":[],"label_agreement":null},{"id":"W4313288140","doi":"10.3390/systems10060259","title":"Parallel Learning of Dynamics in Complex Systems","year":2022,"lang":"en","type":"article","venue":"Systems","topic":"Advanced Graph Neural Networks","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":"Huxiang Youth Talent Support Program; National Natural Science Foundation of China","keywords":"Computer science; Theoretical computer science; Metis; Graph partition; Extrapolation; Graph; Artificial intelligence; Mathematics","score_opus":0.021872417516930802,"score_gpt":0.24568439669154787,"score_spread":0.22381197917461707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313288140","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.1265535,0.0006177375,0.865547,0.0008584536,0.00007978439,0.000058014102,0.00014536378,0.0008059882,0.0053341296],"genre_scores_gemma":[0.93932045,0.0005142323,0.057555053,0.000107451895,0.00003869445,0.000074114265,0.00020203608,0.00007760452,0.002110343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965143,0.000083350205,0.000013419135,0.00012743092,0.00008945165,0.000034849603],"domain_scores_gemma":[0.9989814,0.00052320113,0.00011427715,0.00015800429,0.00015832888,0.0000646613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075245165,0.0005884203,0.0005965943,0.0004635467,0.00048695767,0.0006540237,0.0007572724,0.0005435321,0.0019851122],"category_scores_gemma":[0.0039845915,0.00033091407,0.00045085786,0.00042720017,0.0009412165,0.0026635448,0.0011563788,0.0012936828,0.0002539769],"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.00007355039,0.00005254966,0.0024830077,0.000089072404,0.000047306898,0.0000844767,0.00012913975,0.8901637,0.002822029,0.050482016,0.0013399237,0.052233182],"study_design_scores_gemma":[0.000004495457,0.00000917318,0.00023156547,0.0000024066026,0.000002884873,0.000009777556,0.000010091403,0.9755461,0.00039772008,0.023369508,0.00041307116,0.0000031977186],"about_ca_topic_score_codex":0.0059194188,"about_ca_topic_score_gemma":0.0046413196,"teacher_disagreement_score":0.0059194188,"about_ca_system_score_codex":0.0009989548,"about_ca_system_score_gemma":0.0008259833,"threshold_uncertainty_score":0.01176995},"labels":[],"label_agreement":null},{"id":"W4313426558","doi":"10.1145/3533769","title":"Knowledge Base Embedding for Sampling-Based Prediction","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Information Systems","topic":"Advanced Graph Neural Networks","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","funders":"National Key Research and Development Program of China; Fundamental Research Funds for the Central Universities; State Key Laboratory of Software Development Environment","keywords":"Computer science; Latent variable; Protocol (science); Task (project management); Ranking (information retrieval); Machine learning; Sampling (signal processing); Rank (graph theory); Artificial intelligence; Data mining; Embedding; Variable (mathematics); Link (geometry); Mathematics","score_opus":0.038179926302878586,"score_gpt":0.2914206615433705,"score_spread":0.2532407352404919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313426558","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.054050468,0.00119866,0.9386565,0.0006170097,0.000112493835,0.00015658131,0.0008557292,0.0019402106,0.0024122405],"genre_scores_gemma":[0.84351134,0.00067309634,0.14685859,0.00041757285,0.00016913243,0.00033266455,0.0030725745,0.00015011708,0.0048149927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998618,0.00043803963,0.00008154151,0.0003991029,0.00033181274,0.00013155433],"domain_scores_gemma":[0.9940655,0.00401933,0.00029734307,0.00075387413,0.00073543476,0.0001285126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002017311,0.0011110647,0.0011933236,0.0013734906,0.00046909053,0.0010666572,0.0017949629,0.0014993865,0.0030504267],"category_scores_gemma":[0.011186436,0.00042551203,0.0006199677,0.0014955713,0.00067581615,0.003199074,0.0012480589,0.0021300775,0.0010281507],"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.00041707902,0.0004734163,0.0038303356,0.0002607282,0.00014285542,0.00016587725,0.0001796411,0.52746946,0.0032974996,0.014205869,0.008219786,0.44133747],"study_design_scores_gemma":[0.000008003129,0.000028486915,0.00020843947,0.000008887579,0.000010912732,0.000013350631,0.000010033684,0.9923644,0.0006355253,0.0063765845,0.00032932757,0.0000059660874],"about_ca_topic_score_codex":0.009778523,"about_ca_topic_score_gemma":0.012093051,"teacher_disagreement_score":0.009778523,"about_ca_system_score_codex":0.0010613257,"about_ca_system_score_gemma":0.0013163051,"threshold_uncertainty_score":0.019443214},"labels":[],"label_agreement":null},{"id":"W4313575157","doi":"10.3390/make5010004","title":"IPPT4KRL: Iterative Post-Processing Transfer for Knowledge Representation Learning","year":2023,"lang":"en","type":"article","venue":"Machine Learning and Knowledge Extraction","topic":"Advanced Graph Neural Networks","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 Bank of Canada","funders":"","keywords":"Embedding; Computer science; Benchmarking; Representation (politics); Artificial intelligence; Graph; Machine learning; Feature learning; Knowledge representation and reasoning; Iterative refinement; Task (project management); Transfer of learning; Theoretical computer science","score_opus":0.026325188613280908,"score_gpt":0.34010690381531417,"score_spread":0.31378171520203324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313575157","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.0074163033,0.00025451553,0.9788887,0.00021186925,0.00005680504,0.00019563668,0.00035418355,0.011349173,0.0012728423],"genre_scores_gemma":[0.14455932,0.00029968095,0.84428847,0.00043062092,0.00006759842,0.0005594438,0.00427688,0.0009715716,0.004546342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997997,0.00049301866,0.0001281661,0.0006364699,0.0005641043,0.00018121816],"domain_scores_gemma":[0.99585307,0.0014705237,0.00033604205,0.001427233,0.00078880275,0.00012419524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002494018,0.0021831538,0.0016233295,0.0024906145,0.0010638037,0.0016469965,0.004916675,0.0023495439,0.007737998],"category_scores_gemma":[0.009500747,0.00089343294,0.0019299485,0.0030020087,0.0013639617,0.0059695146,0.0048189736,0.0035701017,0.0050475765],"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.00017059631,0.00037808673,0.0010553615,0.00037699883,0.00013742551,0.00022652882,0.00027080838,0.09734774,0.008021025,0.008191563,0.01689179,0.86693203],"study_design_scores_gemma":[0.000035724617,0.000101421065,0.00032849115,0.00002428909,0.00003755494,0.000089644214,0.000081511454,0.96384585,0.008334089,0.022536706,0.004561932,0.000022748787],"about_ca_topic_score_codex":0.0053628534,"about_ca_topic_score_gemma":0.01043509,"teacher_disagreement_score":0.007737998,"about_ca_system_score_codex":0.0015245774,"about_ca_system_score_gemma":0.002281024,"threshold_uncertainty_score":0.025886178},"labels":[],"label_agreement":null},{"id":"W4317931697","doi":"10.1561/2200000096","title":"Graph Neural Networks for Natural Language Processing: A Survey","year":2023,"lang":"en","type":"article","venue":"Foundations and Trends® in Machine Learning","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":269,"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":"Computer science; Artificial neural network; Graph; Natural language processing; Artificial intelligence; Theoretical computer science","score_opus":0.02218011106607913,"score_gpt":0.3132030583237363,"score_spread":0.29102294725765715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317931697","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.008530721,0.5473284,0.40869114,0.0042551686,0.0008294965,0.00023991163,0.0010288781,0.0013741564,0.027722117],"genre_scores_gemma":[0.086564675,0.7320541,0.16605432,0.0011872458,0.0013571865,0.00031307858,0.0024686535,0.00031269662,0.009687953],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996321,0.00007546683,0.000036915837,0.00008194503,0.00014833787,0.000025190622],"domain_scores_gemma":[0.9993197,0.00042743867,0.00003445782,0.00005684342,0.00013664001,0.000024973291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074657664,0.0010770422,0.0008989007,0.0019220335,0.00030620952,0.0013128296,0.0014544894,0.0011172344,0.0040693725],"category_scores_gemma":[0.002038073,0.0004829556,0.00062976667,0.0037332345,0.0005972346,0.0033432723,0.0009172628,0.0016799753,0.0017776663],"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.00006594764,0.00010765898,0.0013815642,0.0031412158,0.00010819163,0.000107812084,0.000103015,0.02638583,0.0013677102,0.06381799,0.02475765,0.87865543],"study_design_scores_gemma":[0.000028838504,0.00018519277,0.0021712787,0.0017081703,0.00013755877,0.0006673785,0.00019439102,0.27531716,0.0029974119,0.26720834,0.4493024,0.000081905964],"about_ca_topic_score_codex":0.0034303176,"about_ca_topic_score_gemma":0.00461192,"teacher_disagreement_score":0.0040693725,"about_ca_system_score_codex":0.0008522369,"about_ca_system_score_gemma":0.0010456498,"threshold_uncertainty_score":0.013613343},"labels":[],"label_agreement":null},{"id":"W4318147794","doi":"10.1109/bigdata55660.2022.10020299","title":"Temporal Graph Representation Learning via Maximal Cliques","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Conference on Big Data (Big Data)","topic":"Advanced Graph Neural Networks","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":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Clique; Computer science; Graph; Node (physics); Theoretical computer science; Embedding; Representation (politics); Graph embedding; Feature learning; Artificial intelligence; Mathematics; Combinatorics","score_opus":0.304841879149363,"score_gpt":0.3731440942115506,"score_spread":0.06830221506218759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318147794","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.0626722,0.0006402356,0.93019384,0.00057540456,0.000084001374,0.00012564761,0.0010989761,0.0015960718,0.003013665],"genre_scores_gemma":[0.67906034,0.000725839,0.30563715,0.0004025857,0.00017498311,0.00031633442,0.006678321,0.00041331112,0.00659115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993224,0.00016938164,0.000028191478,0.00026952228,0.0001361195,0.000074305826],"domain_scores_gemma":[0.9982273,0.0008627985,0.00023611421,0.00030036553,0.00025883227,0.00011462294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075723307,0.0009151363,0.0009099173,0.0021965422,0.0007691778,0.000856853,0.0017926542,0.0011560807,0.0031513043],"category_scores_gemma":[0.004555995,0.00054813793,0.0013120095,0.002474522,0.0007372856,0.0030860398,0.0012881536,0.0014677284,0.0006382394],"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.0002769576,0.00030533344,0.007614385,0.00036102763,0.00027193822,0.00030026876,0.00038268953,0.5407816,0.0051632156,0.06339067,0.018522,0.36262992],"study_design_scores_gemma":[0.000010620049,0.000015456457,0.00034472303,0.000012423307,0.000015544514,0.000029552819,0.00002656566,0.96996605,0.00041701406,0.027835771,0.0013202094,0.0000060794873],"about_ca_topic_score_codex":0.009070338,"about_ca_topic_score_gemma":0.02029452,"teacher_disagreement_score":0.009070338,"about_ca_system_score_codex":0.0012730452,"about_ca_system_score_gemma":0.0009455015,"threshold_uncertainty_score":0.018035054},"labels":[],"label_agreement":null},{"id":"W4318823726","doi":"10.1109/icdm54844.2022.00138","title":"Augmenting Knowledge Transfer across Graphs","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Conference on Data Mining (ICDM)","topic":"Advanced Graph Neural Networks","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":"Computer science; Theoretical computer science; Knowledge transfer; Domain adaptation; Graph; Generalization; Artificial intelligence; Machine learning; Mathematics","score_opus":0.1724617119252182,"score_gpt":0.37724703656329506,"score_spread":0.20478532463807686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318823726","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.09995292,0.0006638356,0.8923184,0.0007423901,0.0000737086,0.000087961664,0.00036761665,0.0026551045,0.0031380428],"genre_scores_gemma":[0.7930948,0.00067037065,0.19953956,0.0005845513,0.00011135618,0.00016205752,0.0017702986,0.000316435,0.0037505678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840444,0.0005304278,0.000059514277,0.0006407813,0.00024647807,0.0001183987],"domain_scores_gemma":[0.9962302,0.0017441323,0.00031881183,0.0011257324,0.00042930205,0.0001517381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024487926,0.0017414487,0.0013888705,0.002039538,0.0006873833,0.0012320582,0.0025515386,0.0017712066,0.0018735344],"category_scores_gemma":[0.009952405,0.00046495814,0.0010274079,0.0021125667,0.0015887846,0.0054417904,0.004492733,0.0022068406,0.0007320093],"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.00028108328,0.00029581634,0.003376535,0.000336619,0.00019296209,0.00025591606,0.00039602787,0.52145755,0.0151318265,0.023100598,0.005618013,0.4295571],"study_design_scores_gemma":[0.000016496317,0.00007886083,0.00057873625,0.00001984338,0.000040999286,0.00007128098,0.00008960671,0.95554674,0.004844084,0.036547348,0.0021512453,0.000014810037],"about_ca_topic_score_codex":0.003243348,"about_ca_topic_score_gemma":0.0042628995,"teacher_disagreement_score":0.003243348,"about_ca_system_score_codex":0.0011722913,"about_ca_system_score_gemma":0.0011590879,"threshold_uncertainty_score":0.012950659},"labels":[],"label_agreement":null},{"id":"W4319309615","doi":"10.1109/ickg55886.2022.00037","title":"HTransE: Hybrid Translation-based Embedding for Knowledge Graphs","year":2022,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"International Business Machines Corporation","keywords":"Embedding; Simple (philosophy); Theoretical computer science; Relation (database); Computer science; Knowledge graph; Inverse; Mathematics; Graph; Artificial intelligence; Data mining","score_opus":0.030512807189175047,"score_gpt":0.2897534720164417,"score_spread":0.25924066482726665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319309615","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.0057248552,0.00023277897,0.9889552,0.00011584063,0.000062686166,0.000089654044,0.000493579,0.0033039916,0.0010212945],"genre_scores_gemma":[0.22095828,0.0006495407,0.7619385,0.00025977587,0.00009535772,0.00040377598,0.0065389476,0.0009290102,0.008226758],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988557,0.00034965755,0.00007967337,0.0003586183,0.00028925398,0.00006712154],"domain_scores_gemma":[0.99828136,0.00058853923,0.00014195948,0.00069830735,0.00021302838,0.00007686228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010496066,0.0013111987,0.0007806579,0.0017223827,0.00039465196,0.0013742343,0.0015547614,0.0012862772,0.004561701],"category_scores_gemma":[0.005065753,0.00047758766,0.0017682634,0.001704002,0.000805373,0.0042624623,0.0028143746,0.002015178,0.0022036154],"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.00024229921,0.00027935425,0.0014759401,0.00048569197,0.00022461198,0.0003210981,0.00046751456,0.229459,0.008326702,0.076345555,0.015658878,0.6667133],"study_design_scores_gemma":[0.000018426274,0.00009023916,0.0002599226,0.00003241146,0.00002700365,0.00013286012,0.00007192147,0.9322114,0.0033854537,0.05386335,0.009881031,0.000025969157],"about_ca_topic_score_codex":0.0036255969,"about_ca_topic_score_gemma":0.0061066803,"teacher_disagreement_score":0.004561701,"about_ca_system_score_codex":0.0007466513,"about_ca_system_score_gemma":0.0007885165,"threshold_uncertainty_score":0.015260398},"labels":[],"label_agreement":null},{"id":"W4319459101","doi":"10.1109/tkde.2023.3243169","title":"Towards Lightweight and Automated Representation Learning System for Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Advanced Graph Neural Networks","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":"National Natural Science Foundation of China","keywords":"Computer science; Scalability; Embedding; Singular value decomposition; Parallel computing; Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.027618364107412027,"score_gpt":0.28861185003460915,"score_spread":0.2609934859271971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319459101","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.0019690932,0.00008675904,0.97763944,0.00017995192,0.000039460512,0.000069245114,0.00030101638,0.018830065,0.0008848287],"genre_scores_gemma":[0.04810153,0.00022684968,0.94297206,0.00021459535,0.00007146629,0.0002786969,0.0023737971,0.0010814036,0.0046796114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849224,0.00032263948,0.00009869741,0.000458026,0.00051294477,0.00011545434],"domain_scores_gemma":[0.9982811,0.00046514292,0.00012007107,0.00060631114,0.00044837123,0.000078995225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016904571,0.0013772367,0.0011338589,0.0020056292,0.00078730466,0.0027668986,0.0038923707,0.0016752229,0.008285711],"category_scores_gemma":[0.0061617168,0.0009941832,0.0016659208,0.0015003105,0.0007173886,0.006424857,0.0036271492,0.002982113,0.006054026],"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.00029637295,0.00028204205,0.0010827425,0.0003268472,0.00015907506,0.00019833341,0.00023931383,0.13470563,0.010977682,0.07694307,0.040256932,0.73453194],"study_design_scores_gemma":[0.000021698706,0.000028764432,0.000093773604,0.0000185093,0.000016097913,0.000049277893,0.000025553478,0.94778425,0.004553928,0.037811123,0.009578933,0.00001808184],"about_ca_topic_score_codex":0.004421759,"about_ca_topic_score_gemma":0.00669183,"teacher_disagreement_score":0.008285711,"about_ca_system_score_codex":0.0015495961,"about_ca_system_score_gemma":0.0016540468,"threshold_uncertainty_score":0.027718425},"labels":[],"label_agreement":null},{"id":"W4321485151","doi":"10.1145/3539597.3570390","title":"Heterogeneous Graph-based Context-aware Document Ranking","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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","funders":"National Natural Science Foundation of China","keywords":"Computer science; Exploit; Ranking (information retrieval); Information retrieval; Graph; Session (web analytics); Construct (python library); Data mining; Theoretical computer science; World Wide Web","score_opus":0.017248222500324283,"score_gpt":0.2564944381896838,"score_spread":0.23924621568935953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321485151","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.22631174,0.0030913004,0.7606119,0.0004225252,0.00012996033,0.00019724025,0.0014789522,0.003670518,0.0040859235],"genre_scores_gemma":[0.91083765,0.00048843876,0.08406419,0.00012679817,0.000093473616,0.00007707034,0.001400504,0.00012106263,0.002790881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994967,0.0001288295,0.00002560279,0.00016176648,0.0001223333,0.00006475181],"domain_scores_gemma":[0.99940085,0.00022100663,0.00008222264,0.000087280816,0.0001580019,0.00005063721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000500861,0.00083498243,0.0009949915,0.0018447312,0.0003924499,0.00075842463,0.001211824,0.0006376636,0.0011392772],"category_scores_gemma":[0.0018581934,0.00019779718,0.0006130832,0.0016648126,0.00029037948,0.0016252162,0.0006105481,0.0006549818,0.00035187442],"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.0005150866,0.0003533962,0.0064048623,0.00026677892,0.00021167613,0.0001781868,0.00015402441,0.54709274,0.01362607,0.009256777,0.0075249355,0.41441545],"study_design_scores_gemma":[0.000010843757,0.000040750023,0.0007721172,0.0000043337463,0.000026666012,0.000022141694,0.000016413185,0.99332386,0.0011546566,0.0041434593,0.00047560778,0.000009214446],"about_ca_topic_score_codex":0.011446395,"about_ca_topic_score_gemma":0.021604126,"teacher_disagreement_score":0.011446395,"about_ca_system_score_codex":0.0008670436,"about_ca_system_score_gemma":0.000628317,"threshold_uncertainty_score":0.022759497},"labels":[],"label_agreement":null},{"id":"W4322730971","doi":"10.1109/tkde.2023.3238993","title":"Semi-Supervised Entity Alignment With Global Alignment and Local Information Aggregation","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Advanced Graph Neural Networks","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":"University of Ottawa","funders":"Fundamental Research Funds for the Central Universities; State Key Laboratory of Software Development Environment","keywords":"Computer science; Merge (version control); Knowledge graph; Forcing (mathematics); Data mining; Theoretical computer science; Artificial intelligence; Information retrieval; Mathematics","score_opus":0.014223436611622209,"score_gpt":0.23993458954117783,"score_spread":0.22571115292955563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322730971","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.026615959,0.0006138492,0.9674965,0.00024088687,0.000087688124,0.0001325499,0.0006579743,0.0027137198,0.0014408189],"genre_scores_gemma":[0.5289298,0.00038148844,0.45853585,0.00036649406,0.00024529078,0.00041082356,0.0066850395,0.00048798695,0.0039573037],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958081,0.0012282141,0.0003037806,0.0018444835,0.0005726723,0.00024275345],"domain_scores_gemma":[0.99370754,0.0021115083,0.001001664,0.0019492914,0.00102855,0.00020131088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029654459,0.0018671508,0.0023060015,0.0029338677,0.0011815643,0.0018252193,0.002970346,0.0018756657,0.0018539503],"category_scores_gemma":[0.008530761,0.00069396244,0.0016192888,0.0050569843,0.0012667418,0.0061315936,0.0032004488,0.0024249419,0.001538813],"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.00064694986,0.00054953754,0.008742353,0.00048512334,0.000628972,0.0004013423,0.0007840631,0.35534367,0.009298575,0.023173839,0.018596098,0.5813495],"study_design_scores_gemma":[0.000022086997,0.000078173885,0.0010055387,0.000020507472,0.00005560057,0.000077164965,0.000081902086,0.97406703,0.0029056463,0.019282172,0.0023803327,0.000023683373],"about_ca_topic_score_codex":0.0034842605,"about_ca_topic_score_gemma":0.0074482774,"teacher_disagreement_score":0.0034842605,"about_ca_system_score_codex":0.0008660305,"about_ca_system_score_gemma":0.0014575946,"threshold_uncertainty_score":0.015682995},"labels":[],"label_agreement":null},{"id":"W4323362462","doi":"10.3390/axioms12030275","title":"Probabilistic Coarsening for Knowledge Graph Embeddings","year":2023,"lang":"en","type":"article","venue":"Axioms","topic":"Advanced Graph Neural Networks","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":"University of Alberta","funders":"","keywords":"Embedding; Popularity; Probabilistic logic; Knowledge graph; Computer science; Graph; Theoretical computer science; Graph embedding; Simple (philosophy); Machine learning; Artificial intelligence","score_opus":0.03378476415566694,"score_gpt":0.30073589244610177,"score_spread":0.2669511282904348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323362462","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.0116617745,0.00022099123,0.98603326,0.00012547002,0.000027172782,0.000046492496,0.00017154412,0.00077572453,0.0009376596],"genre_scores_gemma":[0.30176318,0.000551969,0.69255316,0.00017372468,0.00004978387,0.00019739369,0.0015960067,0.00043439018,0.0026803638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887735,0.0002995444,0.00009544177,0.00043392845,0.00023074268,0.00006295275],"domain_scores_gemma":[0.9953939,0.0020749427,0.0003639697,0.0016078181,0.00044623722,0.00011314388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001421252,0.00088894047,0.0007565413,0.0017699719,0.0005963092,0.0015330287,0.0014479113,0.0009884768,0.0037510952],"category_scores_gemma":[0.012016167,0.00066251494,0.0012316527,0.0014156658,0.001473705,0.0049044,0.0024693145,0.0023497215,0.0009774282],"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.00012980994,0.000111111876,0.0029082259,0.0005690998,0.00011539162,0.00018808355,0.0004926722,0.41361955,0.013831083,0.16210441,0.005722957,0.4002076],"study_design_scores_gemma":[0.000012533616,0.000057169043,0.0007321026,0.000059825514,0.00002436118,0.00010542528,0.00008904153,0.78542036,0.0058334754,0.20158361,0.006059148,0.000023003633],"about_ca_topic_score_codex":0.0027285265,"about_ca_topic_score_gemma":0.005590402,"teacher_disagreement_score":0.0037510952,"about_ca_system_score_codex":0.00091397774,"about_ca_system_score_gemma":0.00074852246,"threshold_uncertainty_score":0.012548685},"labels":[],"label_agreement":null},{"id":"W4324010932","doi":"10.2196/45268","title":"Leveraging Knowledge Graphs and Natural Language Processing for Automated Web Resource Labeling and Knowledge Mobilization in Neurodevelopmental Disorders: Development and Usability Study","year":2023,"lang":"en","type":"article","venue":"Journal of Medical Internet Research","topic":"Advanced Graph Neural Networks","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":"Women and Children’s Health Research Institute; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research","keywords":"Usability; Computer science; World Wide Web; Human–computer interaction","score_opus":0.04934201919274787,"score_gpt":0.4064725414571596,"score_spread":0.3571305222644117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324010932","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.67115426,0.0009911597,0.284611,0.0009496032,0.00010796375,0.0073135863,0.00702348,0.021330873,0.0065181837],"genre_scores_gemma":[0.42154735,0.00045044246,0.56478924,0.00026939172,0.000014391584,0.0026868503,0.008109732,0.0007788543,0.0013538686],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99333465,0.003965587,0.0006672969,0.0010561459,0.0008059637,0.00017044647],"domain_scores_gemma":[0.9135132,0.077017955,0.0016060183,0.0036354163,0.0037352564,0.00049219956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011532884,0.001189957,0.00057798706,0.0048576226,0.00077116315,0.0021258176,0.0016636399,0.0010353014,0.0018526836],"category_scores_gemma":[0.04437115,0.00063073257,0.0013777995,0.0029748275,0.00092015584,0.0053511835,0.0031483069,0.0014520406,0.00054975186],"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.0014265688,0.003694832,0.033886503,0.0074106352,0.0006045152,0.0018323725,0.030388549,0.025760463,0.029358447,0.0070030717,0.014049509,0.84458447],"study_design_scores_gemma":[0.00096204935,0.0042342427,0.08517297,0.0027406812,0.0013313716,0.0026799357,0.027389346,0.6687032,0.05863478,0.02768716,0.11969096,0.00077329605],"about_ca_topic_score_codex":0.010320031,"about_ca_topic_score_gemma":0.015254832,"teacher_disagreement_score":0.011532884,"about_ca_system_score_codex":0.0016624603,"about_ca_system_score_gemma":0.0022370047,"threshold_uncertainty_score":0.06099248},"labels":[],"label_agreement":null},{"id":"W4353041063","doi":"10.21203/rs.3.rs-2716622/v1","title":"MSRHNN:Multidimensional Social Relation under Heterogeneous Neural Network for Recommendation","year":2023,"lang":"en","type":"preprint","venue":"Research Square","topic":"Advanced Graph Neural Networks","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":"Vanier College; University of Lethbridge","funders":"","keywords":"Computer science; Graph; Theoretical computer science; Heterogeneous network; Dynamic network analysis; Popularity; Social network (sociolinguistics); Node (physics); Artificial intelligence; Artificial neural network; Data mining; Machine learning; Social media; Computer network","score_opus":0.1657882665213524,"score_gpt":0.4256941727045555,"score_spread":0.2599059061832031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4353041063","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.17943749,0.0019025088,0.80819285,0.0018590974,0.00024702432,0.00013758577,0.0014477996,0.002070022,0.004705655],"genre_scores_gemma":[0.915739,0.00046799763,0.07698424,0.00027479854,0.000103694285,0.00008812926,0.0014658397,0.00005782415,0.0048185247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934894,0.00013955226,0.000040746098,0.00026532038,0.00011801896,0.00008735224],"domain_scores_gemma":[0.9990376,0.00036824335,0.000111955305,0.00017482109,0.00026115126,0.000046255434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084151694,0.0006886596,0.000831161,0.0009358449,0.00056207256,0.0008449776,0.0013681067,0.0011184845,0.0019802134],"category_scores_gemma":[0.0031992623,0.0002780267,0.0008087315,0.0014346077,0.00042641576,0.0015991117,0.0007021369,0.0013074956,0.00036775257],"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.00021147085,0.0002284409,0.005633101,0.00009107616,0.00013714751,0.00013648246,0.00006877341,0.7877899,0.0016604919,0.011136586,0.0061744223,0.1867321],"study_design_scores_gemma":[0.000001689243,0.0000047072717,0.00018649262,0.0000016551521,0.0000038421026,0.000003752406,0.000002674858,0.99820995,0.00011196629,0.0013823876,0.00008903571,0.0000018577334],"about_ca_topic_score_codex":0.057684015,"about_ca_topic_score_gemma":0.050517593,"teacher_disagreement_score":0.057684015,"about_ca_system_score_codex":0.0018256016,"about_ca_system_score_gemma":0.00096477737,"threshold_uncertainty_score":0.1146965},"labels":[],"label_agreement":null},{"id":"W4361192959","doi":"10.48550/arxiv.2303.14241","title":"Data Depth and Core-based Trend Detection on Blockchain Transaction Networks","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","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 Manitoba","funders":"","keywords":"Blockchain; Scalability; Computer science; Core (optical fiber); Key (lock); Data science; Data mining; Big data; Computer security; Database; Telecommunications","score_opus":0.16050194673677223,"score_gpt":0.22257738649910785,"score_spread":0.06207543976233562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361192959","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.6065147,0.0013756884,0.36934426,0.0007597337,0.000082357925,0.00024444706,0.010702587,0.0043261293,0.0066500944],"genre_scores_gemma":[0.8865644,0.00035934625,0.09917817,0.000100641446,0.00004799428,0.00009816376,0.011519694,0.00012313081,0.002008553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942017,0.00010302249,0.000039096063,0.00018331378,0.00016294597,0.000091462214],"domain_scores_gemma":[0.9979018,0.0007819252,0.00039916823,0.00034447885,0.00043637873,0.00013620147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068753626,0.00063521456,0.00055393635,0.003685427,0.0005043965,0.0009930837,0.00084094907,0.000757708,0.0011489005],"category_scores_gemma":[0.0046993424,0.00028075516,0.0004399354,0.0027293246,0.00047290244,0.0019929875,0.0013194405,0.0008882449,0.00061422924],"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.00090233993,0.00041562694,0.13514881,0.00063895446,0.0002546882,0.0009232605,0.0010567734,0.22161387,0.029713662,0.021383306,0.018528486,0.56942016],"study_design_scores_gemma":[0.00001488606,0.0000432204,0.010176744,0.00003015153,0.00002124604,0.00015301701,0.0002359377,0.9655727,0.0048124543,0.015020114,0.0039060311,0.000013466479],"about_ca_topic_score_codex":0.006359221,"about_ca_topic_score_gemma":0.014888079,"teacher_disagreement_score":0.006359221,"about_ca_system_score_codex":0.00071303017,"about_ca_system_score_gemma":0.0006388224,"threshold_uncertainty_score":0.01264441},"labels":[],"label_agreement":null},{"id":"W4365796043","doi":"10.1007/978-3-031-30678-5_34","title":"GIPA: A General Information Propagation Algorithm for Graph Learning","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Neural Networks","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":"Engineering Link (Canada)","funders":"","keywords":"Computer science; Graph; Correlation; Algorithm; Node (physics); Computation; Perceptron; Benchmark (surveying); Artificial intelligence; Pattern recognition (psychology); Artificial neural network; Data mining; Theoretical computer science; Mathematics","score_opus":0.01444329971809373,"score_gpt":0.24278507665615495,"score_spread":0.22834177693806124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365796043","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.00095003634,0.0002309467,0.9888784,0.00015252407,0.00012946512,0.00009170222,0.0004256135,0.0069708773,0.002170516],"genre_scores_gemma":[0.016934462,0.00030438366,0.97188866,0.0002247278,0.00009784841,0.0003123341,0.0015978739,0.0014165649,0.007223137],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999273,0.00020137738,0.000033106233,0.00017614503,0.00026019217,0.000056227702],"domain_scores_gemma":[0.99879444,0.00051116606,0.000045553417,0.00030444385,0.000285324,0.000058990994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011646255,0.002078985,0.0014309748,0.0022589313,0.001011779,0.0017764651,0.0040216264,0.0026748588,0.018018289],"category_scores_gemma":[0.0049517974,0.0010028172,0.0015568273,0.0031990162,0.00089070405,0.002984883,0.0021539438,0.0040434506,0.011322446],"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.00015641963,0.00018487792,0.00028786933,0.00031694633,0.00017296003,0.00011770331,0.00007874182,0.15349421,0.0031314522,0.037318315,0.07237175,0.7323688],"study_design_scores_gemma":[0.0000486479,0.000031932563,0.00008985163,0.000027197233,0.000029577779,0.0000637011,0.000010171571,0.9313176,0.0023278152,0.052251633,0.013783592,0.000018263818],"about_ca_topic_score_codex":0.0067970934,"about_ca_topic_score_gemma":0.010374367,"teacher_disagreement_score":0.018018289,"about_ca_system_score_codex":0.00082146726,"about_ca_system_score_gemma":0.001621716,"threshold_uncertainty_score":0.060277164},"labels":[],"label_agreement":null},{"id":"W4366959011","doi":"10.1109/wi-iat55865.2022.00124","title":"SparseMult: A Tensor Decomposition model based on Sparse Relation Matrix","year":2022,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"York University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Tensor (intrinsic definition); Decomposition; Relation (database); Tensor decomposition; Matrix decomposition; Sparse matrix; Theoretical computer science; Task (project management); Link (geometry); Matrix (chemical analysis); Diagonal; Data mining; Artificial intelligence; Mathematics","score_opus":0.018556525154766346,"score_gpt":0.27584712083430174,"score_spread":0.2572905956795354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366959011","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.012563021,0.000736649,0.9816753,0.00050514063,0.00011672543,0.0000634946,0.0011023106,0.0015826535,0.00165478],"genre_scores_gemma":[0.45774925,0.0026881986,0.51673925,0.0007075999,0.000341698,0.00044388985,0.008058372,0.00065461796,0.01261716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931455,0.00018935409,0.000039050425,0.00021601933,0.00016510133,0.00007592196],"domain_scores_gemma":[0.9985852,0.00049123587,0.00022172606,0.00026661178,0.00032177928,0.00011338156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008676829,0.0013142714,0.0011498623,0.0013464821,0.00051059556,0.0011902625,0.0019263716,0.0009767364,0.0040642195],"category_scores_gemma":[0.004250549,0.0006067742,0.0013469401,0.0022127598,0.0008353573,0.0036419844,0.0011026731,0.0021886253,0.001677098],"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.00036396412,0.0002386613,0.0033630729,0.00044167548,0.00024016273,0.0003504895,0.00030605288,0.583467,0.008719487,0.07912881,0.02711494,0.29626566],"study_design_scores_gemma":[0.0000066442244,0.000024182991,0.00017077324,0.000008538011,0.00001371059,0.000034862052,0.000009910379,0.9832982,0.00047065006,0.01439314,0.0015588392,0.000010595845],"about_ca_topic_score_codex":0.017192623,"about_ca_topic_score_gemma":0.01932323,"teacher_disagreement_score":0.017192623,"about_ca_system_score_codex":0.0011025959,"about_ca_system_score_gemma":0.0015761865,"threshold_uncertainty_score":0.03418511},"labels":[],"label_agreement":null},{"id":"W4367147569","doi":"10.1109/hipc56025.2022.00018","title":"Joint Partitioning and Sampling Algorithm for Scaling Graph Neural Network","year":2022,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":5,"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; Joint (building); Scaling; Sampling (signal processing); Artificial neural network; Algorithm; Graph; Artificial intelligence; Theoretical computer science; Mathematics; Computer vision; Engineering","score_opus":0.03739943438473616,"score_gpt":0.2634173471624329,"score_spread":0.22601791277769676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367147569","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.03426324,0.00040317926,0.95971304,0.00029128784,0.00007822899,0.00014109758,0.00017043819,0.0030027288,0.0019366802],"genre_scores_gemma":[0.33607048,0.00019675217,0.65859884,0.00032605813,0.00006778609,0.00039930546,0.0011484582,0.00047902492,0.002713311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913687,0.00024101972,0.000044773566,0.00022961336,0.00024383915,0.00010389615],"domain_scores_gemma":[0.99865353,0.00055810285,0.00010016101,0.00027309853,0.00032198394,0.00009312681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010736688,0.0010544187,0.001101768,0.0012337087,0.000784442,0.00076066767,0.0016849475,0.0010061264,0.0029490888],"category_scores_gemma":[0.0045993314,0.00043080607,0.0006815409,0.0010627953,0.0006211418,0.0017960174,0.0014087249,0.001085478,0.0008905648],"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.00027184858,0.0001940124,0.0027022136,0.00015147415,0.00006916591,0.00014897935,0.00023333335,0.50800246,0.010892744,0.01594282,0.011101907,0.45028898],"study_design_scores_gemma":[0.000025959873,0.000026230733,0.00016226638,0.0000044579806,0.0000063547245,0.000027282098,0.000023504088,0.9918286,0.0014034952,0.005589785,0.0008968678,0.000005263676],"about_ca_topic_score_codex":0.00927588,"about_ca_topic_score_gemma":0.015075133,"teacher_disagreement_score":0.00927588,"about_ca_system_score_codex":0.0013571229,"about_ca_system_score_gemma":0.0013118496,"threshold_uncertainty_score":0.018443763},"labels":[],"label_agreement":null},{"id":"W4368370970","doi":"10.20944/preprints202304.1140.v1","title":"Research on Construction and Application of Aircraft Fault Knowledge Graphs","year":2023,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Advanced Graph Neural Networks","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":"University of Saskatchewan","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Fault (geology); Knowledge graph; Computer science; Schema (genetic algorithms); Fault model; Heuristic; Domain knowledge; Knowledge-based systems; Fault management; Engineering; Artificial intelligence; Machine learning","score_opus":0.18414833028510755,"score_gpt":0.42302424386583315,"score_spread":0.2388759135807256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4368370970","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.022850217,0.0023015493,0.96566194,0.0018983808,0.00006260866,0.00012232082,0.0004721029,0.00079049834,0.005840316],"genre_scores_gemma":[0.34130496,0.0055578463,0.64604574,0.0005812875,0.000093330746,0.00015590657,0.002566366,0.0002724954,0.0034220691],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977629,0.0007563986,0.00017613145,0.0007027643,0.00051793497,0.000083873616],"domain_scores_gemma":[0.98435044,0.01074794,0.00083939586,0.0022552833,0.0015491454,0.0002577489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021649068,0.0007233849,0.00046115372,0.0042463085,0.00077802554,0.0024105418,0.0015093697,0.0011741364,0.0027791075],"category_scores_gemma":[0.021327782,0.0007179371,0.0012664926,0.003978627,0.002258999,0.0066416604,0.001624325,0.0020616455,0.00055271515],"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.000052230702,0.00016153976,0.0061546275,0.0009744455,0.00016120903,0.0002807013,0.0014821863,0.1774216,0.005824137,0.35586867,0.0061976067,0.44542098],"study_design_scores_gemma":[0.000013206389,0.000047237416,0.0020299451,0.00031688673,0.00007761352,0.00027046463,0.0004966803,0.42233407,0.00800853,0.53114116,0.03522437,0.000039767274],"about_ca_topic_score_codex":0.009381599,"about_ca_topic_score_gemma":0.007842673,"teacher_disagreement_score":0.009381599,"about_ca_system_score_codex":0.0027690937,"about_ca_system_score_gemma":0.0017960885,"threshold_uncertainty_score":0.020091295},"labels":[],"label_agreement":null},{"id":"W4372267823","doi":"10.1109/icassp49357.2023.10095900","title":"Sparse Graph Learning with Spectrum Prior for Deep Graph Convolutional Networks","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Laplacian matrix; Graph; Computer science; Smoothing; Subspace topology; Algorithm; Matrix completion; Pairwise comparison; Graph bandwidth; Artificial intelligence; Theoretical computer science; Voltage graph; Line graph; Gaussian","score_opus":0.014557627235188341,"score_gpt":0.2339888369327207,"score_spread":0.21943120969753238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4372267823","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.011278055,0.00007992541,0.9874577,0.000120355646,0.00001408748,0.00001321085,0.000045046032,0.00046762332,0.0005239533],"genre_scores_gemma":[0.6074571,0.00035689838,0.38719228,0.00026624513,0.000065566914,0.00012637969,0.00064470875,0.0003524764,0.0035383673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997167,0.000077084165,0.000011052822,0.00007410829,0.000090836955,0.000030188752],"domain_scores_gemma":[0.99928814,0.0003346434,0.00007784786,0.0001339173,0.000115771385,0.000049684833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006332018,0.0007781687,0.0006249323,0.0006129295,0.0003416826,0.00062822393,0.0011942209,0.00095042796,0.0014107965],"category_scores_gemma":[0.0028024698,0.00042696972,0.000520431,0.000710101,0.000979465,0.0017681464,0.0009888852,0.0018018245,0.00050822407],"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.00006760791,0.00006880801,0.0006214848,0.000067385765,0.000031896176,0.000060976974,0.00006579603,0.8581667,0.00845512,0.045628507,0.0026793038,0.08408636],"study_design_scores_gemma":[0.0000019309389,0.0000064455967,0.000034172994,0.0000018462189,0.0000014908265,0.000005477798,0.0000025151403,0.99156606,0.0005693687,0.0076239603,0.00018485534,0.0000018828621],"about_ca_topic_score_codex":0.006237108,"about_ca_topic_score_gemma":0.011439792,"teacher_disagreement_score":0.006237108,"about_ca_system_score_codex":0.0011036682,"about_ca_system_score_gemma":0.00097198726,"threshold_uncertainty_score":0.01240164},"labels":[],"label_agreement":null},{"id":"W4376608267","doi":"10.1007/978-3-031-32296-9_3","title":"Unsupervised Framework for Evaluating Structural Node Embeddings of Graphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Neural Networks","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Embedding; Node (physics); Graph; Theoretical computer science; Set (abstract data type); Data mining; Artificial intelligence","score_opus":0.03948828168851945,"score_gpt":0.3229867891242473,"score_spread":0.2834985074357278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376608267","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.032705534,0.00044364925,0.9605036,0.00010383457,0.00004566406,0.00011162997,0.0013815745,0.0032866246,0.0014179522],"genre_scores_gemma":[0.32594773,0.00043335801,0.6589122,0.000105739324,0.00008381758,0.0002773055,0.00907074,0.0007240899,0.0044449726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878603,0.00033869303,0.00006748308,0.00036097984,0.00035634157,0.00009041781],"domain_scores_gemma":[0.9973838,0.0010515945,0.00023036667,0.0005425761,0.0006558713,0.00013572942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013379545,0.0013856442,0.0011651664,0.0031676183,0.0005149618,0.00189432,0.0021743474,0.0017596664,0.002494458],"category_scores_gemma":[0.0060344976,0.0005916232,0.0011128798,0.0025007722,0.0006798024,0.0036032074,0.0017463212,0.0017418906,0.0012934228],"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.0005581664,0.00052639906,0.0066811456,0.0003877964,0.00036318053,0.00017259705,0.00017131041,0.24612491,0.027739322,0.03849072,0.01541495,0.6633694],"study_design_scores_gemma":[0.000015319281,0.00007872552,0.00071336934,0.000020086565,0.00003246112,0.000066264525,0.000042074123,0.96481663,0.004121596,0.028758496,0.0013218654,0.0000130609815],"about_ca_topic_score_codex":0.0035427627,"about_ca_topic_score_gemma":0.011035796,"teacher_disagreement_score":0.0035427627,"about_ca_system_score_codex":0.0010125055,"about_ca_system_score_gemma":0.001098129,"threshold_uncertainty_score":0.0083447695},"labels":[],"label_agreement":null},{"id":"W4377093262","doi":"10.3233/shti230243","title":"Building a Disease Knowledge Graph","year":2023,"lang":"en","type":"article","venue":"Studies in health technology and informatics","topic":"Advanced Graph Neural Networks","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":"Saint Mary's University; Cape Breton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Knowledge graph; Computer science; Graph; Graph database; Construct (python library); Information retrieval; Knowledge base; Medical knowledge; Disease; Data science; Knowledge management; Theoretical computer science; Artificial intelligence; Medicine; Programming language","score_opus":0.04987050607584835,"score_gpt":0.38300212366031705,"score_spread":0.3331316175844687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377093262","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.038361814,0.0009853188,0.9105722,0.0029128455,0.00024181049,0.0007294778,0.01831825,0.004937746,0.02294058],"genre_scores_gemma":[0.17094775,0.0014336637,0.79683363,0.0007356511,0.00008028947,0.00031952315,0.023296183,0.00031228608,0.0060409913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992743,0.00012257241,0.00006670486,0.00026115213,0.00023014593,0.00004508224],"domain_scores_gemma":[0.9985923,0.0006356812,0.00008886746,0.00017553905,0.00042839587,0.000079097954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062111573,0.0005331455,0.00040419606,0.004478465,0.0008858851,0.0014330817,0.0008250339,0.0008435996,0.005652362],"category_scores_gemma":[0.0036403788,0.0003839446,0.0013307483,0.0023322594,0.00060560077,0.0018363029,0.0016333635,0.0009239906,0.0011647885],"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.00022647742,0.00037722974,0.021279,0.0014986048,0.00047852407,0.0028320816,0.0017287406,0.12155148,0.016624708,0.18955016,0.061297007,0.582556],"study_design_scores_gemma":[0.00009660146,0.00017448912,0.007936479,0.0004856095,0.000596035,0.0017369104,0.0010068072,0.3457758,0.0121684,0.336594,0.2933156,0.00011328223],"about_ca_topic_score_codex":0.017255582,"about_ca_topic_score_gemma":0.025389712,"teacher_disagreement_score":0.017255582,"about_ca_system_score_codex":0.00093368604,"about_ca_system_score_gemma":0.0025630826,"threshold_uncertainty_score":0.03431028},"labels":[],"label_agreement":null},{"id":"W4377099260","doi":"10.1145/3597428","title":"The Evolution of Distributed Systems for Graph Neural Networks and Their Origin in Graph Processing and Deep Learning: A Survey","year":2023,"lang":"en","type":"review","venue":"ACM Computing Surveys","topic":"Advanced Graph Neural Networks","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 Toronto","funders":"","keywords":"Computer science; Deep learning; Categorization; Scalability; Artificial intelligence; Graph; Artificial neural network; Deep neural networks; Machine learning; Theoretical computer science; Data science; Database","score_opus":0.060684143966647945,"score_gpt":0.3193867958571259,"score_spread":0.258702651890478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377099260","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.0035062544,0.7561119,0.18819737,0.007942989,0.0013891582,0.000111786576,0.00021549193,0.00028249118,0.04224255],"genre_scores_gemma":[0.063896984,0.84440136,0.07108741,0.0024573419,0.0023734306,0.00026752555,0.00042627557,0.00018012655,0.014909515],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994568,0.00013784967,0.000037106052,0.0001440673,0.00019177812,0.00003233652],"domain_scores_gemma":[0.9982175,0.0011266262,0.00006623333,0.0001487846,0.00038937107,0.00005137177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013591865,0.0009375535,0.0007985758,0.0016649186,0.0005039112,0.001894202,0.0017459888,0.0018018084,0.005065023],"category_scores_gemma":[0.003317095,0.0006753941,0.0006597869,0.0025410834,0.0016934751,0.0045491853,0.0013808399,0.0031065221,0.0024923221],"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.00003175468,0.00008101352,0.0006932114,0.0034721214,0.00007912031,0.000115360504,0.00014300273,0.01308991,0.0009343974,0.42611983,0.022701263,0.532539],"study_design_scores_gemma":[0.00002307073,0.00012710836,0.0009495445,0.0018466268,0.00007223606,0.00087029627,0.0001653815,0.044851128,0.0019881953,0.3100835,0.63894975,0.00007312722],"about_ca_topic_score_codex":0.0026808162,"about_ca_topic_score_gemma":0.0030582559,"teacher_disagreement_score":0.005065023,"about_ca_system_score_codex":0.0019966178,"about_ca_system_score_gemma":0.0015058969,"threshold_uncertainty_score":0.01694417},"labels":[],"label_agreement":null},{"id":"W4377121430","doi":"10.48550/arxiv.2305.10391","title":"Optimality of Message-Passing Architectures for Sparse Graphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","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; Canada Research Chairs","keywords":"Classifier (UML); Computer science; Message passing; Algorithm; Node (physics); Mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.12227467462964037,"score_gpt":0.22532956038435745,"score_spread":0.10305488575471708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377121430","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.17671427,0.00019341693,0.8199496,0.0008483685,0.000040471776,0.000043892876,0.000086796244,0.00046715635,0.001656019],"genre_scores_gemma":[0.89616895,0.00024318679,0.09966966,0.00021385403,0.000082455306,0.000104517065,0.0002690357,0.000111595975,0.003136795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908006,0.00034949338,0.00004249107,0.00020428516,0.00017073026,0.00015289865],"domain_scores_gemma":[0.9906184,0.0074484902,0.00064378587,0.00044777736,0.00063056435,0.00021094587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030552708,0.00082381384,0.0010766247,0.00089273934,0.00051013025,0.0010078615,0.0014712919,0.0016274196,0.001411041],"category_scores_gemma":[0.018600015,0.00057181664,0.0005258968,0.00053986337,0.0019339472,0.0025765111,0.0013758321,0.0016795469,0.00031255264],"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.00012964125,0.000058835547,0.0011750872,0.00006143532,0.000027990105,0.00004563574,0.00007653051,0.9216372,0.0017752214,0.050257746,0.00079017703,0.023964405],"study_design_scores_gemma":[0.0000043809664,0.000015737904,0.000097339165,0.0000029545222,0.000002529852,0.000004907053,0.000004075752,0.97243154,0.00043245658,0.026952721,0.000048932747,0.000002409891],"about_ca_topic_score_codex":0.0035294623,"about_ca_topic_score_gemma":0.0032160196,"teacher_disagreement_score":0.0035294623,"about_ca_system_score_codex":0.0020813479,"about_ca_system_score_gemma":0.0011862161,"threshold_uncertainty_score":0.016158044},"labels":[],"label_agreement":null},{"id":"W4377832615","doi":"10.18280/ts.400238","title":"GCNE: Graph Convolution Networks with Explicitly Influence for Recommendation","year":2023,"lang":"en","type":"article","venue":"Traitement du signal","topic":"Advanced Graph Neural Networks","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":"Computer science; Graph; Convolution (computer science); Theoretical computer science; Mathematics; Artificial intelligence; Artificial neural network","score_opus":0.01668614688481131,"score_gpt":0.24297999574367526,"score_spread":0.22629384885886394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377832615","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.0192933,0.0006763398,0.9768754,0.00028425668,0.00006804272,0.000035831963,0.00017422391,0.0010438691,0.0015487324],"genre_scores_gemma":[0.71463376,0.0010767573,0.27397287,0.0005709487,0.00015044052,0.0001699079,0.001030663,0.00018481254,0.008209788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955565,0.00011729063,0.000020757985,0.00012878698,0.00012066959,0.000056870347],"domain_scores_gemma":[0.9989862,0.00047274184,0.000092472015,0.00020505839,0.0001945485,0.000048972754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088611344,0.00086095196,0.00097203674,0.00051296223,0.00036679528,0.00061783893,0.0015497162,0.0011464357,0.0015486372],"category_scores_gemma":[0.0039155246,0.0004560774,0.00067426503,0.0011150462,0.00062009244,0.0018396991,0.0008619689,0.00181051,0.0005288097],"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.00017775981,0.00013883851,0.001980365,0.00013881548,0.00013538533,0.0001166705,0.000095854186,0.7139725,0.0057260627,0.023105118,0.0056122774,0.24880032],"study_design_scores_gemma":[0.0000029512291,0.000012414135,0.00010623757,0.0000026261193,0.0000066721573,0.00001316518,0.0000021360952,0.995618,0.00039542463,0.0034344064,0.00040229494,0.0000038158687],"about_ca_topic_score_codex":0.015316521,"about_ca_topic_score_gemma":0.024451248,"teacher_disagreement_score":0.015316521,"about_ca_system_score_codex":0.00095998426,"about_ca_system_score_gemma":0.00096872274,"threshold_uncertainty_score":0.030454755},"labels":[],"label_agreement":null},{"id":"W4379034048","doi":"10.1109/taslp.2023.3282101","title":"TARGAT: A Time-Aware Relational Graph Attention Model for Temporal Knowledge Graph Embedding","year":2023,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Audio Speech and Language Processing","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Timestamp; Theoretical computer science; Graph; Embedding; Statistical relational learning; Graph embedding; Temporal database; Artificial intelligence; Relational database; Data mining; Machine learning","score_opus":0.02545785647792693,"score_gpt":0.2982908473687284,"score_spread":0.2728329908908015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379034048","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.030342849,0.0015611884,0.9550261,0.0007087705,0.0001608668,0.00017015958,0.0034997438,0.005429035,0.0031014069],"genre_scores_gemma":[0.61926,0.0020119185,0.34555373,0.0008790314,0.00020248922,0.0004140873,0.0193878,0.00058650394,0.011704323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994773,0.00009500558,0.000027991346,0.00024221522,0.00010960884,0.000047913472],"domain_scores_gemma":[0.9992906,0.00025997896,0.00008904883,0.00018288929,0.00013287143,0.00004462872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000598452,0.0013220488,0.0007650098,0.0015246093,0.0004030216,0.0009131717,0.002322716,0.0011818745,0.0028029587],"category_scores_gemma":[0.002902966,0.00038080732,0.0012891828,0.0019232781,0.00047196302,0.0041092676,0.0014100799,0.0019913474,0.0010760772],"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.00038420732,0.00036281644,0.004393872,0.00045936936,0.0002848929,0.0003433033,0.00037109994,0.3338039,0.009416011,0.044184223,0.036881097,0.5691152],"study_design_scores_gemma":[0.0000120347195,0.00004123289,0.000505819,0.000016151636,0.00003411065,0.00007027489,0.00003288241,0.9736172,0.0013249186,0.020435179,0.0038976485,0.000012563107],"about_ca_topic_score_codex":0.019489726,"about_ca_topic_score_gemma":0.029401371,"teacher_disagreement_score":0.019489726,"about_ca_system_score_codex":0.0015046571,"about_ca_system_score_gemma":0.0010646528,"threshold_uncertainty_score":0.038752556},"labels":[],"label_agreement":null},{"id":"W4379258954","doi":"10.48550/arxiv.2306.00788","title":"Understanding Augmentation-based Self-Supervised Representation Learning via RKHS Approximation and Regression","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","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":"Office of Naval Research; Institute for Catastrophic Loss Reduction; National Science Foundation","keywords":"Reproducing kernel Hilbert space; Representation (politics); Feature learning; Generalization; Artificial intelligence; Computer science; Mathematics; Laplace operator; Statistical learning theory; Algorithm; Regression; Machine learning; Applied mathematics; Mathematical optimization; Hilbert space; Statistics; Mathematical analysis","score_opus":0.20315813008108194,"score_gpt":0.2336139396656635,"score_spread":0.03045580958458155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379258954","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.019636737,0.00034489162,0.97767776,0.00055048754,0.00003080215,0.000034554065,0.00008223345,0.0005203786,0.001122053],"genre_scores_gemma":[0.653632,0.0011940507,0.33875352,0.00054096105,0.00027626214,0.00030636962,0.0008040664,0.00046919117,0.0040235464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982948,0.00081601256,0.0000620775,0.0003148341,0.00041592197,0.00009632714],"domain_scores_gemma":[0.9840752,0.011272248,0.0011351771,0.002232467,0.0010065042,0.00027833466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039997045,0.0010727467,0.0012045422,0.00082901586,0.00037608948,0.0014615838,0.0015578928,0.0017925074,0.0017385938],"category_scores_gemma":[0.020644654,0.0006817556,0.00070116605,0.00073068094,0.0027096046,0.0041367784,0.0027447662,0.0031296469,0.00062727294],"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.00014438161,0.00011314954,0.0017846926,0.00022882526,0.00006984776,0.00007608681,0.00023579599,0.8126558,0.006503264,0.103094526,0.0030098287,0.07208382],"study_design_scores_gemma":[0.0000041694907,0.000021913009,0.00016078209,0.000009410656,0.0000032269143,0.0000109659695,0.000007686176,0.96974707,0.0009130229,0.02882441,0.00029050582,0.0000069442917],"about_ca_topic_score_codex":0.0017972746,"about_ca_topic_score_gemma":0.0019424177,"teacher_disagreement_score":0.0039997045,"about_ca_system_score_codex":0.0011355414,"about_ca_system_score_gemma":0.0012401338,"threshold_uncertainty_score":0.021152735},"labels":[],"label_agreement":null},{"id":"W4379521469","doi":"10.21428/594757db.fe7e76c1","title":"Graph learning with programmatic weak supervision","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"McGill University","funders":"Canadian Institute for Advanced Research","keywords":"Graph; Computer science; Theoretical computer science","score_opus":0.012918150130666136,"score_gpt":0.237231945357064,"score_spread":0.22431379522639786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379521469","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.010792359,0.00013236776,0.982502,0.00069892715,0.00009610867,0.000060855702,0.000220128,0.0028210839,0.0026761196],"genre_scores_gemma":[0.5052925,0.00025792568,0.48029765,0.00074916583,0.00019674397,0.00029968418,0.0016602562,0.0013012703,0.009944935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911326,0.00037817645,0.000031548592,0.00023006868,0.00018833757,0.000058576356],"domain_scores_gemma":[0.9967489,0.0015184007,0.00013652658,0.00096962316,0.00046120983,0.0001653182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012968712,0.00081765384,0.00078310777,0.00072810525,0.0006456185,0.0008616101,0.0019754432,0.001321977,0.006927771],"category_scores_gemma":[0.009095943,0.00057516183,0.00064635393,0.000844533,0.0013063113,0.0030704148,0.0027373,0.0035849651,0.0019624925],"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.00057486177,0.0004164565,0.0021130273,0.0004913594,0.00014204653,0.00018551412,0.00018394322,0.2701457,0.007574593,0.19767866,0.04033888,0.48015502],"study_design_scores_gemma":[0.000028508224,0.000039014383,0.00010024202,0.000011283089,0.0000133529375,0.000025306457,0.000010565642,0.8528918,0.0017175633,0.14348842,0.0016681235,0.0000058249607],"about_ca_topic_score_codex":0.0019202242,"about_ca_topic_score_gemma":0.004805117,"teacher_disagreement_score":0.006927771,"about_ca_system_score_codex":0.00062298414,"about_ca_system_score_gemma":0.001303536,"threshold_uncertainty_score":0.023175657},"labels":[],"label_agreement":null},{"id":"W4379780949","doi":"10.1109/tsp.2023.3284364","title":"Joint Sampling and Reconstruction of Time-Varying Signals Over Directed Graphs","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":20,"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":"National Natural Science Foundation of China","keywords":"Signal reconstruction; Algorithm; Vertex (graph theory); Frequency domain; Graph; Adjacency matrix; Mathematics; Compressed sensing; Computer science; Signal processing; Theoretical computer science; Digital signal processing; Computer vision","score_opus":0.034453782916287035,"score_gpt":0.27012244615681497,"score_spread":0.23566866324052793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379780949","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.019986311,0.000064123655,0.9792436,0.000037922215,0.000007890214,0.000012057651,0.000062831656,0.00009784704,0.00048746524],"genre_scores_gemma":[0.55252475,0.0005592069,0.44318348,0.000064109874,0.000041413765,0.00007690844,0.00058212323,0.00008125498,0.002886805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953413,0.0001590001,0.000019009098,0.000111920075,0.00012894002,0.00004701281],"domain_scores_gemma":[0.99858826,0.0008405471,0.00016315025,0.00019838492,0.00016252582,0.00004708753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056256325,0.00069833983,0.00042935478,0.0007401141,0.00021895277,0.000650842,0.00075896183,0.0006034289,0.0008040748],"category_scores_gemma":[0.0030285174,0.00031381205,0.00061422365,0.0010930346,0.0005608291,0.00086358644,0.00057086884,0.00071372633,0.00031938896],"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.0002370373,0.00005031739,0.0020745369,0.00019994854,0.00006441919,0.00040337825,0.00024119848,0.7565923,0.0323133,0.059382856,0.0010978765,0.14734289],"study_design_scores_gemma":[0.0000036702013,0.000013711461,0.00027293278,0.000004282818,0.000004876818,0.000043051255,0.000019231782,0.9873422,0.0035967326,0.008209908,0.0004822416,0.0000072582925],"about_ca_topic_score_codex":0.0032862348,"about_ca_topic_score_gemma":0.0038985335,"teacher_disagreement_score":0.0032862348,"about_ca_system_score_codex":0.00040289198,"about_ca_system_score_gemma":0.00044258262,"threshold_uncertainty_score":0.006534219},"labels":[],"label_agreement":null},{"id":"W4381329270","doi":"10.1145/3589322","title":"Maestro: Automatic Generation of Comprehensive Benchmarks for Question Answering Over Knowledge Graphs","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Management of Data","topic":"Advanced Graph Neural Networks","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":"Carleton University","funders":"","keywords":"Computer science; Benchmark (surveying); Question answering; Knowledge base; Vocabulary; Natural language; Information retrieval; Set (abstract data type); Natural language understanding; Knowledge graph; Usability; Artificial intelligence; Natural language processing; Programming language; Human–computer interaction; Linguistics","score_opus":0.10194140780191328,"score_gpt":0.3440120252621289,"score_spread":0.24207061746021558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381329270","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.08346705,0.002578621,0.49315286,0.0011522314,0.00081592955,0.0029271774,0.06082034,0.33548346,0.019602377],"genre_scores_gemma":[0.17867848,0.00070288085,0.58976233,0.00048684605,0.00010097405,0.0031378127,0.20767951,0.014482131,0.004969027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99555737,0.0016310996,0.0004574482,0.0010287139,0.0010759896,0.00024946115],"domain_scores_gemma":[0.98413,0.009549213,0.0007482918,0.0019182493,0.003216448,0.0004378261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040438254,0.0028687594,0.0009871292,0.005460505,0.000757851,0.0020091638,0.0032427867,0.0017104418,0.009022462],"category_scores_gemma":[0.03305459,0.000874062,0.0015403125,0.002840475,0.00079509773,0.003001204,0.0031630504,0.0017849598,0.004532638],"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.0013310668,0.0010648484,0.009405471,0.0049609654,0.00041044893,0.0013453419,0.0025552996,0.05863292,0.04068023,0.021319382,0.30170867,0.5565853],"study_design_scores_gemma":[0.00073494343,0.00071829243,0.008176192,0.00048247838,0.00016745925,0.00071703584,0.0013844816,0.69310427,0.06720524,0.038458336,0.1886228,0.00022844566],"about_ca_topic_score_codex":0.004890708,"about_ca_topic_score_gemma":0.006124322,"teacher_disagreement_score":0.009022462,"about_ca_system_score_codex":0.0013600813,"about_ca_system_score_gemma":0.001837604,"threshold_uncertainty_score":0.030183196},"labels":[],"label_agreement":null},{"id":"W4381620677","doi":"10.1016/j.knosys.2023.110739","title":"Exploring attention mechanism for graph similarity learning","year":2023,"lang":"en","type":"article","venue":"Knowledge-Based Systems","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":22,"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":"Computer science; Graph; Pairwise comparison; Theoretical computer science; Similarity (geometry); Similarity learning; Graph embedding; Null model; Artificial intelligence; Mathematics; Combinatorics","score_opus":0.1280583460162482,"score_gpt":0.29227626186932404,"score_spread":0.16421791585307585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381620677","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.14706929,0.0010590042,0.84341455,0.0011197913,0.00011961857,0.00006406349,0.00015105985,0.00051946734,0.006483201],"genre_scores_gemma":[0.9529594,0.000377984,0.04367455,0.00015291724,0.00006504203,0.00003835885,0.0001671083,0.00004118056,0.0025233307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996575,0.00009244957,0.000015064828,0.00012968037,0.000056529298,0.000048876656],"domain_scores_gemma":[0.9988423,0.0006099331,0.00009261887,0.0001585702,0.00021042732,0.00008619553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063199503,0.000280749,0.00060681556,0.00086428743,0.00053360465,0.00092700735,0.0014230452,0.0010580709,0.0031895177],"category_scores_gemma":[0.004732255,0.00021510811,0.0005305085,0.0009425562,0.0006175622,0.0032911645,0.0012553667,0.0010745826,0.00024979777],"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.00038877773,0.00045251215,0.00676391,0.00045104985,0.00021750142,0.00035494758,0.0007465002,0.16754149,0.023733124,0.40743876,0.009634534,0.38227686],"study_design_scores_gemma":[0.00001073512,0.00003863864,0.0010595795,0.000008719495,0.000025548592,0.00004848081,0.000044357166,0.8543157,0.0014284516,0.14226262,0.0007467785,0.000010363727],"about_ca_topic_score_codex":0.007026073,"about_ca_topic_score_gemma":0.004161153,"teacher_disagreement_score":0.007026073,"about_ca_system_score_codex":0.00089150004,"about_ca_system_score_gemma":0.00068967236,"threshold_uncertainty_score":0.013970375},"labels":[],"label_agreement":null},{"id":"W4382203390","doi":"10.1609/aaai.v37i8.26168","title":"Neighbor Contrastive Learning on Learnable Graph Augmentation","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":109,"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":"Hainan University; National Natural Science Foundation of China","keywords":"Computer science; Graph; Artificial intelligence; False positive paradox; Theoretical computer science; Machine learning; Pattern recognition (psychology)","score_opus":0.06447864412558238,"score_gpt":0.29985043420944374,"score_spread":0.23537179008386136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382203390","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.03383708,0.00045689312,0.9585601,0.00032666136,0.00008191885,0.00011364958,0.00028614968,0.00445687,0.0018806778],"genre_scores_gemma":[0.5506953,0.0003635327,0.4370157,0.0009404516,0.0001790667,0.00039694773,0.002409258,0.0008162482,0.0071834093],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885416,0.00033870837,0.000033485507,0.00046397542,0.00020635658,0.0001033086],"domain_scores_gemma":[0.99725693,0.0012294693,0.00027886615,0.0007363798,0.00034711813,0.00015118491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001410386,0.001975336,0.0017305524,0.0014255091,0.0006175961,0.001013574,0.003444316,0.0019541653,0.003207454],"category_scores_gemma":[0.005597925,0.00073846546,0.0011619976,0.0011442896,0.0017186907,0.0035337396,0.002844005,0.0030973153,0.001469564],"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.0004211552,0.00040755302,0.0024176077,0.00030171327,0.00011499487,0.00027353884,0.00029986864,0.39427033,0.015983172,0.024029184,0.014085215,0.54739565],"study_design_scores_gemma":[0.00001775185,0.00006708685,0.00016711272,0.000009960146,0.00000973016,0.00005229041,0.000017214725,0.9841485,0.0026293204,0.011891729,0.0009795536,0.000009854382],"about_ca_topic_score_codex":0.0024082598,"about_ca_topic_score_gemma":0.004261024,"teacher_disagreement_score":0.003444316,"about_ca_system_score_codex":0.0012240637,"about_ca_system_score_gemma":0.0007755462,"threshold_uncertainty_score":0.010729969},"labels":[],"label_agreement":null},{"id":"W4382237408","doi":"10.1609/aaai.v37i7.26019","title":"I’m Me, We’re Us, and I’m Us: Tri-directional Contrastive Learning on Hypergraphs","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Samsung; Ministry of Science and ICT, South Korea; Korea Advanced Institute of Science and Technology","keywords":"Computer science; Contrast (vision); Generalization; Node (physics); Artificial intelligence; Representation (politics); Competitor analysis; Machine learning; Unsupervised learning; Code (set theory); Feature learning; Simple (philosophy); Natural language processing; Mathematics","score_opus":0.059133068894256034,"score_gpt":0.28863630579420063,"score_spread":0.2295032368999446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382237408","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.11659259,0.0018876411,0.87027484,0.001468291,0.0000946949,0.00013059635,0.0009572602,0.0027140095,0.0058800858],"genre_scores_gemma":[0.69383144,0.00059980847,0.2947019,0.0012119071,0.00015442223,0.00020637037,0.0032815882,0.00053482124,0.005477802],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784327,0.001175877,0.0000583238,0.00059802795,0.00021935879,0.00010518437],"domain_scores_gemma":[0.99306583,0.0038009456,0.0005761705,0.0015325401,0.0006793184,0.0003451621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002892417,0.0009777579,0.0007441484,0.0016663475,0.00081607216,0.0015524937,0.0018405425,0.0017028328,0.0022360852],"category_scores_gemma":[0.010168083,0.00053148536,0.0008902305,0.0014914562,0.0020018837,0.0043956907,0.0024038842,0.0033555352,0.0010657152],"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.0011045525,0.000385342,0.016480342,0.0005698685,0.0002993814,0.00047882274,0.0013555296,0.25020358,0.013996843,0.08732248,0.023076652,0.60472655],"study_design_scores_gemma":[0.000051022485,0.000118336146,0.0014541603,0.00006149647,0.000039506762,0.00019771345,0.00013368855,0.8799828,0.004181957,0.107824095,0.005921592,0.00003357481],"about_ca_topic_score_codex":0.0034129235,"about_ca_topic_score_gemma":0.0059075872,"teacher_disagreement_score":0.0034129235,"about_ca_system_score_codex":0.0014963071,"about_ca_system_score_gemma":0.00073050894,"threshold_uncertainty_score":0.015296757},"labels":[],"label_agreement":null},{"id":"W4382239171","doi":"10.1609/aaai.v37i6.25941","title":"Interpolating Graph Pair to Regularize Graph Classification","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","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":"University of Ottawa","funders":"","keywords":"Computer science; Artificial intelligence; Theoretical computer science; Graph; Leverage (statistics); Algorithm; Pattern recognition (psychology); Machine learning","score_opus":0.10427452839819401,"score_gpt":0.3131700700418429,"score_spread":0.20889554164364887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382239171","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.034371898,0.000120771234,0.96260625,0.00021270086,0.000044377597,0.000048988004,0.000090460904,0.0014162036,0.0010884131],"genre_scores_gemma":[0.50851715,0.00017398738,0.48571458,0.0003194751,0.00007722425,0.00020434553,0.0006379246,0.00044563308,0.003909685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993611,0.00018896458,0.000023662948,0.00020904168,0.00015489671,0.00006227641],"domain_scores_gemma":[0.99843043,0.000597916,0.00018838896,0.00052122155,0.00016843298,0.000093593684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010971961,0.0011419061,0.0008791919,0.0010152691,0.0005193316,0.00073455676,0.0017917388,0.0013794572,0.0024162703],"category_scores_gemma":[0.0047657546,0.0005412413,0.00096182985,0.0010362205,0.0013891284,0.0023152782,0.0020091217,0.0022935716,0.0008358716],"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.00028918416,0.00022212224,0.0028729392,0.00019641664,0.000112623304,0.00013423595,0.00021954656,0.665026,0.029060764,0.048914686,0.004847833,0.24810363],"study_design_scores_gemma":[0.0000079342735,0.00004312085,0.00014658872,0.0000054569705,0.000007930726,0.000029086123,0.000012306904,0.98138547,0.004030612,0.01323507,0.0010891742,0.0000073518586],"about_ca_topic_score_codex":0.0014854613,"about_ca_topic_score_gemma":0.00252759,"teacher_disagreement_score":0.0024162703,"about_ca_system_score_codex":0.00075436936,"about_ca_system_score_gemma":0.0006352887,"threshold_uncertainty_score":0.008083284},"labels":[],"label_agreement":null},{"id":"W4382240030","doi":"10.1609/aaai.v37i4.25538","title":"Learning Representations of Bi-level Knowledge Graphs for Reasoning beyond Link Prediction","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","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":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea","keywords":"Link (geometry); Computer science; Artificial intelligence; Computer network","score_opus":0.1040917765387271,"score_gpt":0.33803667578493823,"score_spread":0.23394489924621115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382240030","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.042441662,0.0014518778,0.9444051,0.00087821815,0.00014313989,0.00014452722,0.0035200156,0.0049340893,0.0020815],"genre_scores_gemma":[0.6753044,0.0012769562,0.30381572,0.00065737835,0.00013454951,0.00026542076,0.015111411,0.00029238698,0.003141734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988613,0.00021603586,0.000071919334,0.0005493443,0.00022811058,0.00007320742],"domain_scores_gemma":[0.9968579,0.0015401507,0.00037820055,0.0008688767,0.00021591346,0.00013885477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092937826,0.0018958767,0.0010928758,0.0032164245,0.0005070512,0.0016697152,0.0027700132,0.0021119034,0.0032800196],"category_scores_gemma":[0.007074141,0.00067910826,0.0017909867,0.0035042579,0.00079800334,0.0075946734,0.0026549213,0.0039472585,0.0012635527],"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.00041468386,0.00057243294,0.007941531,0.00069476495,0.00041808616,0.000668168,0.000488494,0.345814,0.006613986,0.038160842,0.022462385,0.5757506],"study_design_scores_gemma":[0.000021361035,0.000053311374,0.0009499046,0.00005142506,0.000068451205,0.00011410171,0.00008449694,0.914254,0.0015090578,0.07915512,0.0037126697,0.000026070298],"about_ca_topic_score_codex":0.007526216,"about_ca_topic_score_gemma":0.01192371,"teacher_disagreement_score":0.007526216,"about_ca_system_score_codex":0.0013741389,"about_ca_system_score_gemma":0.0009289631,"threshold_uncertainty_score":0.014964819},"labels":[],"label_agreement":null},{"id":"W4382240086","doi":"10.1609/aaai.v37i4.25565","title":"Signed Laplacian Graph Neural Networks","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; HEC Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"Samsung; Natural Sciences and Engineering Research Council of Canada; Institut de Valorisation des Données; China Scholarship Council; Tencent; Microsoft Research; National Natural Science Foundation of China; Canadian Institute for Advanced Research; People's Government of Jilin Province","keywords":"Computer science; Signed graph; Theoretical computer science; Graph; Spectral graph theory; Laplacian matrix; Laplace operator; Line graph; Voltage graph; Algorithm; Mathematics","score_opus":0.060660420897220214,"score_gpt":0.2864185040554346,"score_spread":0.2257580831582144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382240086","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.031429842,0.0004748315,0.96280026,0.0004619336,0.00012262835,0.000040680676,0.00017675229,0.00056653615,0.003926602],"genre_scores_gemma":[0.8169652,0.0009540861,0.17131984,0.00050388044,0.00013904122,0.0001188871,0.00072388205,0.0001574405,0.009117616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956113,0.00013295152,0.0000211188,0.00010453234,0.00013713377,0.00004310935],"domain_scores_gemma":[0.99892175,0.0005090527,0.00016448162,0.00012489557,0.0002326233,0.000047291895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069206266,0.00071177486,0.00055335823,0.0009885291,0.000285992,0.00096082786,0.0014667761,0.0010469905,0.0023582939],"category_scores_gemma":[0.0052731787,0.00025156667,0.00046980046,0.0009384396,0.00080187724,0.0025140666,0.0009008925,0.0011984103,0.0005794391],"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.00009741208,0.00007437625,0.0010844776,0.00016628705,0.00005350136,0.00010386941,0.00010630481,0.67303795,0.006310861,0.09893529,0.0047187125,0.21531096],"study_design_scores_gemma":[0.000002968662,0.000012837072,0.00009417099,0.0000049261284,0.000004003616,0.000017185683,0.0000075459925,0.97139376,0.00055997644,0.02734482,0.0005522522,0.000005623182],"about_ca_topic_score_codex":0.0020674565,"about_ca_topic_score_gemma":0.0028223149,"teacher_disagreement_score":0.0023582939,"about_ca_system_score_codex":0.0008075879,"about_ca_system_score_gemma":0.000547304,"threshold_uncertainty_score":0.007889271},"labels":[],"label_agreement":null},{"id":"W4382317638","doi":"10.1609/aaai.v37i13.26993","title":"Flaky Performances When Pretraining on Relational Databases (Student Abstract)","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","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":"Canadian Institute for Advanced Research; HEC Montréal; Université de Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Porting; Leverage (statistics); Relational database; Node (physics); Conjecture; Graph; Artificial intelligence; Natural language processing; Theoretical computer science; Data mining; Programming language; Mathematics","score_opus":0.1693824668639811,"score_gpt":0.3406220593983447,"score_spread":0.17123959253436363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382317638","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.82353175,0.0032570888,0.12886319,0.0034721594,0.00063123903,0.0003058389,0.0025661218,0.018019201,0.019353457],"genre_scores_gemma":[0.9430175,0.00026688987,0.045688596,0.00063889794,0.00006492627,0.00010866004,0.0044725216,0.00048408858,0.0052578948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836296,0.00045599247,0.00010030601,0.0006259128,0.00024546107,0.0002094404],"domain_scores_gemma":[0.99425274,0.003144501,0.00024980374,0.0013962649,0.0007030698,0.00025350344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003930741,0.0015145651,0.00071955216,0.000672773,0.0005458414,0.0013610221,0.0018422551,0.0018692013,0.0054213074],"category_scores_gemma":[0.015370932,0.00039085865,0.0006789151,0.00060464855,0.0008839732,0.0037812882,0.0017944836,0.0023417182,0.0023032792],"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.0024901112,0.0010611233,0.015284713,0.0008199406,0.0004564908,0.00032277103,0.00035836283,0.32098216,0.021826075,0.0030753785,0.027790666,0.6055321],"study_design_scores_gemma":[0.00006768715,0.0007191924,0.0038428272,0.00007063249,0.00006267243,0.00011671325,0.000186559,0.957865,0.029704202,0.004443958,0.0028914574,0.000029048428],"about_ca_topic_score_codex":0.009608816,"about_ca_topic_score_gemma":0.012890095,"teacher_disagreement_score":0.009608816,"about_ca_system_score_codex":0.0011288482,"about_ca_system_score_gemma":0.0009298331,"threshold_uncertainty_score":0.020788014},"labels":[],"label_agreement":null},{"id":"W4382317874","doi":"10.1609/aaai.v37i8.26102","title":"GENNAPE: Towards Generalized Neural Architecture Performance Estimators","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","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":"Huawei Technologies (Canada); University of Alberta","funders":"","keywords":"Computer science; Artificial neural network; Artificial intelligence; Architecture; Network architecture; Estimator; Graph; Machine learning; Time delay neural network; Theoretical computer science; Mathematics","score_opus":0.06564785021917369,"score_gpt":0.29487975873710165,"score_spread":0.22923190851792796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382317874","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.050677013,0.00076731853,0.9420155,0.00020909033,0.00005050089,0.000066030734,0.00030418663,0.0043072705,0.0016029762],"genre_scores_gemma":[0.7101797,0.0003544919,0.28420246,0.00027994,0.000052915868,0.00025661156,0.0015348783,0.0006747249,0.002464265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992168,0.00022521,0.000036294714,0.00023894961,0.0002046333,0.00007809086],"domain_scores_gemma":[0.9975419,0.0012495889,0.00026770323,0.00037652254,0.00049188174,0.00007245508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021404233,0.0014943463,0.0008268456,0.0010382585,0.00025842717,0.0008953072,0.0020607018,0.0010558446,0.0014926866],"category_scores_gemma":[0.008669328,0.0005068055,0.0004850918,0.0005777216,0.0007215298,0.001590773,0.0013346284,0.0019294932,0.00058417174],"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.00011342684,0.00006524243,0.0045904247,0.00012401861,0.00012213059,0.000047307745,0.00005710138,0.8228774,0.004445152,0.0052964687,0.0028291803,0.15943208],"study_design_scores_gemma":[0.0000052398204,0.000031537118,0.00034267807,0.000009482824,0.0000080591735,0.0000121641515,0.000006668635,0.99455535,0.0013963197,0.0032816974,0.0003454529,0.000005294113],"about_ca_topic_score_codex":0.0040548155,"about_ca_topic_score_gemma":0.0073072696,"teacher_disagreement_score":0.0040548155,"about_ca_system_score_codex":0.0009381567,"about_ca_system_score_gemma":0.0012101734,"threshold_uncertainty_score":0.0113197565},"labels":[],"label_agreement":null},{"id":"W4382568066","doi":"10.1109/tkde.2023.3290792","title":"Individual and Structural Graph Information Bottlenecks for Out-of-Distribution Generalization","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Advanced Graph Neural Networks","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":"Mila - Quebec Artificial Intelligence Institute","funders":"National Natural Science Foundation of China","keywords":"Spurious relationship; Computer science; Graph; Leverage (statistics); Artificial intelligence; Bottleneck; Theoretical computer science; Algorithm; Machine learning","score_opus":0.028363888784600035,"score_gpt":0.2753856377479403,"score_spread":0.24702174896334025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382568066","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.049526837,0.0015169765,0.9371938,0.0029776269,0.00019349316,0.00014450318,0.00047445923,0.0028418663,0.0051305173],"genre_scores_gemma":[0.82125485,0.0015833593,0.16284806,0.0022771105,0.0005442051,0.00037914433,0.001935279,0.001266836,0.007911167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996067,0.001177673,0.00018025193,0.0014210496,0.00069211994,0.00046197991],"domain_scores_gemma":[0.96808887,0.02261622,0.001841594,0.004548926,0.0017283518,0.0011760814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076900744,0.0019461864,0.003387941,0.0028426289,0.0018940241,0.002981461,0.0048578186,0.003227426,0.005885115],"category_scores_gemma":[0.046070457,0.0012434669,0.0019016323,0.0025447505,0.0027674288,0.009271656,0.004671907,0.0058759353,0.0014151407],"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.00084915507,0.0006700482,0.0071906894,0.00062723004,0.00027416906,0.00056482264,0.0006341696,0.4915234,0.004340774,0.18048722,0.033144653,0.27969363],"study_design_scores_gemma":[0.000025296393,0.00004357145,0.00067982747,0.0000237417,0.000022812645,0.00009210979,0.000051586925,0.87663674,0.0011528914,0.11960356,0.0016491995,0.000018731198],"about_ca_topic_score_codex":0.0092493845,"about_ca_topic_score_gemma":0.009629281,"teacher_disagreement_score":0.0092493845,"about_ca_system_score_codex":0.00425962,"about_ca_system_score_gemma":0.0029176304,"threshold_uncertainty_score":0.0406695},"labels":[],"label_agreement":null},{"id":"W4383101617","doi":"10.20944/preprints202307.0118.v1","title":"On Addressing the Limitations of Graph Neural Networks","year":2023,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Advanced Graph Neural Networks","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":"Graph; Computer science; Smoothing; Convolutional neural network; Data science; Theoretical computer science; Artificial intelligence; Machine learning","score_opus":0.37266419010545576,"score_gpt":0.37494332449801643,"score_spread":0.0022791343925606666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383101617","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.034039557,0.024551034,0.8593353,0.057545606,0.0016111144,0.00007240193,0.0006707342,0.0011579206,0.02101627],"genre_scores_gemma":[0.66689485,0.05170498,0.24045272,0.012099893,0.0070823687,0.00030860023,0.0012748258,0.0010069988,0.019174851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976107,0.001046921,0.000097623466,0.0005022715,0.0005824999,0.00016000577],"domain_scores_gemma":[0.97920656,0.016015334,0.0006145253,0.002341842,0.0014741711,0.00034764898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008019251,0.0013189763,0.0014866911,0.0017648729,0.0016324243,0.003511782,0.003038397,0.0031403033,0.0043251314],"category_scores_gemma":[0.039941702,0.0006846879,0.0008715624,0.002413191,0.004123594,0.016723895,0.0041696383,0.007433982,0.0013452274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012263063,0.00004357872,0.0017078324,0.0005210164,0.00017438689,0.00010781498,0.00042205633,0.113921754,0.0010189523,0.66294426,0.02176328,0.1972526],"study_design_scores_gemma":[0.000009757705,0.000020594705,0.00029975854,0.000104333325,0.000021132091,0.000047374262,0.00007583132,0.1841316,0.00038758395,0.8026934,0.012188423,0.000020264937],"about_ca_topic_score_codex":0.007373276,"about_ca_topic_score_gemma":0.007870814,"teacher_disagreement_score":0.008019251,"about_ca_system_score_codex":0.002048825,"about_ca_system_score_gemma":0.001442697,"threshold_uncertainty_score":0.042410374},"labels":[],"label_agreement":null},{"id":"W4384613985","doi":"10.48550/arxiv.2307.07107","title":"Graph Positional and Structural Encoder","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","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":"Fonds de recherche du Québec – Nature et technologies; Institut de Valorisation des Données; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Computer science; Encoder; Graph; Identifiability; Artificial intelligence; Theoretical computer science; Machine learning; Pattern recognition (psychology)","score_opus":0.06640210577149619,"score_gpt":0.19323135919575235,"score_spread":0.12682925342425616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384613985","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.01655661,0.0005762427,0.94686717,0.00092886516,0.00027136743,0.0001853264,0.012603293,0.008286863,0.013724255],"genre_scores_gemma":[0.35239804,0.0013810397,0.58612895,0.0009979972,0.00015908417,0.00064256106,0.034398396,0.0023935318,0.021500392],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995229,0.00009474723,0.000021374017,0.00018962199,0.00012489638,0.000046517067],"domain_scores_gemma":[0.99875915,0.0004374423,0.00006058305,0.0004374523,0.00025303842,0.000052405012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005046411,0.0010384466,0.00051017624,0.001262517,0.00050796836,0.0010649642,0.0017429572,0.0011605627,0.011507287],"category_scores_gemma":[0.005960334,0.0005197701,0.0007984765,0.0013769161,0.00078849617,0.0032957555,0.001432345,0.0024349391,0.004553357],"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.00019569758,0.00012936289,0.0037705712,0.000572353,0.000080395206,0.00024402014,0.0002670518,0.23975296,0.009309147,0.25854233,0.0748797,0.4122564],"study_design_scores_gemma":[0.000022501295,0.000045948753,0.0007383937,0.00010013072,0.00003846404,0.00017375046,0.00007908099,0.7215215,0.0057342416,0.23599654,0.03551986,0.000029618408],"about_ca_topic_score_codex":0.0071711014,"about_ca_topic_score_gemma":0.02357497,"teacher_disagreement_score":0.011507287,"about_ca_system_score_codex":0.0012489329,"about_ca_system_score_gemma":0.0018536459,"threshold_uncertainty_score":0.03849566},"labels":[],"label_agreement":null},{"id":"W4385060307","doi":"10.1007/978-3-031-38333-5_9","title":"Guided Rotational Graph Embeddings for Error Detection in Noisy Knowledge Graphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in networks and systems","topic":"Advanced Graph Neural Networks","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 Windsor","funders":"","keywords":"Embedding; Computer science; Knowledge graph; Path (computing); Adversarial system; Ranking (information retrieval); Theoretical computer science; Graph; Artificial intelligence; Benchmark (surveying); Representation (politics); Machine learning; Algorithm","score_opus":0.03185377469005752,"score_gpt":0.2791791002831925,"score_spread":0.24732532559313497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385060307","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.0072215376,0.00034369482,0.98992705,0.0001722084,0.00008103067,0.00004149977,0.00019003359,0.0012891622,0.00073375413],"genre_scores_gemma":[0.33235028,0.0008037265,0.65664387,0.0002686662,0.0002055103,0.00020103648,0.0021319627,0.0009051678,0.0064898008],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983455,0.0004920579,0.00010107186,0.00050376344,0.0004316032,0.00012600303],"domain_scores_gemma":[0.9938512,0.0037205352,0.0004727622,0.0011113336,0.0007090869,0.00013514633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014579237,0.0015912919,0.001780932,0.001742073,0.000510838,0.001597726,0.0024988782,0.0021668195,0.004356496],"category_scores_gemma":[0.0134071335,0.00075238,0.0010738847,0.0018288872,0.0012162715,0.0042206394,0.0028188962,0.0028707995,0.0017830364],"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.00041515788,0.00017160347,0.00091640896,0.00039873406,0.00011875397,0.0001456595,0.00018879696,0.33899036,0.0065797525,0.04827862,0.011589507,0.5922066],"study_design_scores_gemma":[0.000007375054,0.000034712742,0.00013646604,0.000021672397,0.000012142363,0.000042062027,0.00002692211,0.9582048,0.0017433278,0.038901355,0.0008598466,0.000009321413],"about_ca_topic_score_codex":0.0031997066,"about_ca_topic_score_gemma":0.003975495,"teacher_disagreement_score":0.004356496,"about_ca_system_score_codex":0.0010068407,"about_ca_system_score_gemma":0.0008643281,"threshold_uncertainty_score":0.014573932},"labels":[],"label_agreement":null},{"id":"W4385286458","doi":"10.1109/icde55515.2023.00225","title":"Towards a GML-Enabled Knowledge Graph Platform","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Concordia University","funders":"","keywords":"Computer science; Knowledge graph; Graph; Information retrieval; Theoretical computer science","score_opus":0.031575169062308964,"score_gpt":0.28156985358680353,"score_spread":0.24999468452449458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385286458","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.0034560747,0.00024903158,0.93183666,0.0026284822,0.00015107985,0.00022498556,0.0027828666,0.05308513,0.005585711],"genre_scores_gemma":[0.06367995,0.00055833487,0.9063941,0.0019222767,0.00009906593,0.00035514485,0.017646277,0.0043673757,0.004977445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99584705,0.001178128,0.00039724653,0.0009868979,0.0013215538,0.00026921375],"domain_scores_gemma":[0.99316263,0.0019536153,0.00028696263,0.0030825243,0.0010594288,0.0004548701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067077545,0.0010286405,0.0010394095,0.003175972,0.0011290626,0.005718796,0.0062962174,0.0023463815,0.006876248],"category_scores_gemma":[0.014383018,0.0013053997,0.0024372495,0.0027218563,0.002253606,0.015291729,0.010055601,0.0047156066,0.004731404],"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.0004917535,0.00046645087,0.0022489924,0.00094519835,0.00021665505,0.00079451175,0.00093078,0.10543591,0.009256,0.50679076,0.08736455,0.2850585],"study_design_scores_gemma":[0.00008966472,0.000057797562,0.00029733244,0.00019425192,0.000054790507,0.00017905165,0.0002726066,0.50097734,0.008331069,0.32137403,0.16809815,0.000073746756],"about_ca_topic_score_codex":0.01568184,"about_ca_topic_score_gemma":0.017378375,"teacher_disagreement_score":0.01568184,"about_ca_system_score_codex":0.003164267,"about_ca_system_score_gemma":0.0037017674,"threshold_uncertainty_score":0.03547442},"labels":[],"label_agreement":null},{"id":"W4385478332","doi":"10.1109/ijcnn54540.2023.10191717","title":"Transfer Learning with Graph Attention Networks for Team Recommendation","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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 Windsor","funders":"","keywords":"Computer science; Inference; Artificial intelligence; Machine learning; Graph; Transfer of learning; Autoencoder; Feature learning; Unsupervised learning; Deep learning; Embedding; Theoretical computer science","score_opus":0.01728375462978626,"score_gpt":0.25069845387204703,"score_spread":0.23341469924226077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385478332","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.055764757,0.002479391,0.9316148,0.0011640214,0.00017051309,0.00011937108,0.0006453521,0.0037736674,0.004268126],"genre_scores_gemma":[0.8273829,0.0010771452,0.1594427,0.00060717715,0.00020018492,0.00020094102,0.002454864,0.00020841186,0.008425568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993405,0.00021384051,0.000027193644,0.00022390405,0.00011751772,0.00007714413],"domain_scores_gemma":[0.9986663,0.0008111606,0.00011945243,0.00017148098,0.00016604489,0.00006556674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001207494,0.0011957176,0.0012086492,0.0013386938,0.0005334558,0.0007403889,0.0022556097,0.0018918441,0.0025178217],"category_scores_gemma":[0.005115173,0.00054120604,0.00097459846,0.0016522935,0.0006646129,0.002394611,0.00096043706,0.00260455,0.0009151336],"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.00017584907,0.00029129907,0.0021106908,0.00012845459,0.00014615903,0.000089211724,0.00008938297,0.79297996,0.0015768445,0.008788774,0.008483135,0.18514037],"study_design_scores_gemma":[0.000006223508,0.000016694474,0.00013237946,0.000004353701,0.000007779036,0.0000060452535,0.0000052612713,0.99316674,0.00025667934,0.006090306,0.00030419487,0.0000033317315],"about_ca_topic_score_codex":0.026140774,"about_ca_topic_score_gemma":0.028190637,"teacher_disagreement_score":0.026140774,"about_ca_system_score_codex":0.001974867,"about_ca_system_score_gemma":0.0010833235,"threshold_uncertainty_score":0.051977217},"labels":[],"label_agreement":null},{"id":"W4385554858","doi":"10.1016/j.eswa.2023.121086","title":"Incorporating global–local neighbors with Gaussian mixture embedding for few-shot knowledge graph completion","year":2023,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Advanced Graph Neural Networks","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":"York University","funders":"","keywords":"Computer science; Encoder; Embedding; Encoding (memory); Relation (database); Graph; Geospatial analysis; k-nearest neighbors algorithm; Metric (unit); Gaussian; Task (project management); ENCODE; Benchmark (surveying); Data mining; Artificial intelligence; Theoretical computer science","score_opus":0.024626177860893484,"score_gpt":0.3069194756039586,"score_spread":0.2822932977430651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385554858","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.013624705,0.00043377414,0.984124,0.0001727036,0.00005506275,0.000056991434,0.00013727805,0.00077705295,0.0006184424],"genre_scores_gemma":[0.5392947,0.0006918756,0.44930714,0.00046382114,0.00023656184,0.00025146865,0.0023758458,0.000517234,0.006861288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988876,0.00026989283,0.00005633427,0.00044636897,0.0002366066,0.000103218896],"domain_scores_gemma":[0.9975299,0.0013516258,0.00016258922,0.00043101975,0.00037232134,0.00015254412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013891449,0.0012365939,0.002411846,0.001856709,0.0007997174,0.0012979493,0.0033634605,0.0029637418,0.0028084833],"category_scores_gemma":[0.006387613,0.00097128184,0.0016117678,0.0018145578,0.0012023395,0.0037940012,0.0024487937,0.0027625088,0.0013223044],"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.0004342129,0.00047167696,0.0014663069,0.00037526284,0.00028699284,0.00019489389,0.00034293835,0.59496456,0.006361051,0.019326154,0.006774068,0.3690019],"study_design_scores_gemma":[0.000005361144,0.000018266077,0.00008681748,0.0000056166677,0.000011490402,0.000017381455,0.000012936811,0.9914587,0.0004087207,0.0076824767,0.00028436564,0.000007882746],"about_ca_topic_score_codex":0.017048297,"about_ca_topic_score_gemma":0.024202418,"teacher_disagreement_score":0.017048297,"about_ca_system_score_codex":0.00081728614,"about_ca_system_score_gemma":0.0013080998,"threshold_uncertainty_score":0.033898115},"labels":[],"label_agreement":null},{"id":"W4385570097","doi":"10.18653/v1/2023.findings-acl.882","title":"Learning Query Adaptive Anchor Representation for Inductive Relation Prediction","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"York University","funders":"Fundamental Research Funds for the Central Universities; Central China Normal University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Relation (database); Representation (politics); Task (project management); Relationship extraction; Feature learning; Graph; Feature (linguistics); Artificial intelligence; Machine learning; Data mining; Theoretical computer science","score_opus":0.046350879521938906,"score_gpt":0.29628099727888046,"score_spread":0.24993011775694157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385570097","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.058729157,0.0011303258,0.9279803,0.0005958122,0.00008382738,0.00014612896,0.0023858757,0.0068776156,0.0020709098],"genre_scores_gemma":[0.7451937,0.00090904534,0.23812805,0.00041481157,0.00013006512,0.00019686933,0.011277893,0.00026418373,0.0034852787],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990521,0.00015565174,0.00005000743,0.0004222835,0.00022335304,0.00009656768],"domain_scores_gemma":[0.9985662,0.000646717,0.00017305352,0.00035503754,0.0001904197,0.000068485286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070741883,0.0013024154,0.0011168219,0.0024009985,0.00047702578,0.0008547307,0.0026215606,0.0013408893,0.0026610026],"category_scores_gemma":[0.0040206676,0.00037722578,0.0011242748,0.0030504528,0.0007161969,0.0045612594,0.0015536043,0.0016230951,0.0014200223],"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.00046598734,0.00054086314,0.00843947,0.00036156471,0.00014209439,0.0006853935,0.00049806555,0.26044178,0.013737516,0.028414644,0.029430995,0.6568415],"study_design_scores_gemma":[0.000014376243,0.000050142477,0.0007314696,0.000017648543,0.000036384365,0.00009099749,0.000073662144,0.9637668,0.003288245,0.029356545,0.0025599464,0.000013861605],"about_ca_topic_score_codex":0.006992671,"about_ca_topic_score_gemma":0.009708105,"teacher_disagreement_score":0.006992671,"about_ca_system_score_codex":0.00096718955,"about_ca_system_score_gemma":0.0008996512,"threshold_uncertainty_score":0.013903916},"labels":[],"label_agreement":null},{"id":"W4385570117","doi":"10.18653/v1/2023.findings-acl.458","title":"Tucker Decomposition with Frequency Attention for Temporal Knowledge Graph Completion","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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 Toronto","funders":"Fundamental Research Funds for the Central Universities; State Key Laboratory of Software Development Environment","keywords":"Timestamp; Embedding; Computer science; Regularization (linguistics); Discrete cosine transform; Theoretical computer science; Graph; Tensor (intrinsic definition); Graph embedding; Artificial intelligence; Pattern recognition (psychology); Algorithm; Mathematics; Image (mathematics)","score_opus":0.024166029997681852,"score_gpt":0.2998599837783786,"score_spread":0.2756939537806967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385570117","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.0108732395,0.00041296284,0.9859542,0.00024047283,0.00005297359,0.000045375014,0.00025785147,0.0011009286,0.0010619411],"genre_scores_gemma":[0.5138873,0.0010905549,0.4713434,0.0005040359,0.00020626141,0.00031654706,0.0032886898,0.0006046245,0.008758555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992773,0.00017362705,0.00004003023,0.00025954843,0.00015719037,0.000092248345],"domain_scores_gemma":[0.9987721,0.00047661967,0.00014630276,0.00029045314,0.00022647518,0.000088016066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010655163,0.001343488,0.0010765356,0.0013532612,0.00046972072,0.0009848789,0.0018169639,0.0013090688,0.0034887667],"category_scores_gemma":[0.0040596053,0.00044389267,0.0012938966,0.0022900312,0.00095245667,0.0030405081,0.0013749722,0.00294536,0.0011463014],"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.00017556311,0.00018904553,0.001156427,0.00025867778,0.000106330976,0.00013889602,0.0002894527,0.5342061,0.006551939,0.055395197,0.013637415,0.38789502],"study_design_scores_gemma":[0.000004337593,0.000011877657,0.00012205666,0.000008205927,0.000008337011,0.000014911907,0.0000138634705,0.98117036,0.00060699193,0.017057166,0.0009754668,0.000006389606],"about_ca_topic_score_codex":0.018866329,"about_ca_topic_score_gemma":0.022641886,"teacher_disagreement_score":0.018866329,"about_ca_system_score_codex":0.0016154805,"about_ca_system_score_gemma":0.0016584173,"threshold_uncertainty_score":0.037513018},"labels":[],"label_agreement":null},{"id":"W4385571327","doi":"10.18653/v1/2023.repl4nlp-1.21","title":"Tucker Decomposition with Frequency Attention for Temporal Knowledge Graph Completion","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Fundamental Research Funds for the Central Universities; State Key Laboratory of Software Development Environment","keywords":"Computer science; Knowledge graph; Decomposition; Graph; Artificial intelligence; Theoretical computer science","score_opus":0.024166029997681852,"score_gpt":0.2998599837783786,"score_spread":0.2756939537806967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385571327","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.0108732395,0.00041296284,0.9859542,0.00024047283,0.00005297359,0.000045375014,0.00025785147,0.0011009286,0.0010619411],"genre_scores_gemma":[0.5138873,0.0010905549,0.4713434,0.0005040359,0.00020626141,0.00031654706,0.0032886898,0.0006046245,0.008758555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992773,0.00017362705,0.00004003023,0.00025954843,0.00015719037,0.000092248345],"domain_scores_gemma":[0.9987721,0.00047661967,0.00014630276,0.00029045314,0.00022647518,0.000088016066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010655163,0.001343488,0.0010765356,0.0013532612,0.00046972072,0.0009848789,0.0018169639,0.0013090688,0.0034887667],"category_scores_gemma":[0.0040596053,0.00044389267,0.0012938966,0.0022900312,0.00095245667,0.0030405081,0.0013749722,0.00294536,0.0011463014],"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.00017556311,0.00018904553,0.001156427,0.00025867778,0.000106330976,0.00013889602,0.0002894527,0.5342061,0.006551939,0.055395197,0.013637415,0.38789502],"study_design_scores_gemma":[0.000004337593,0.000011877657,0.00012205666,0.000008205927,0.000008337011,0.000014911907,0.0000138634705,0.98117036,0.00060699193,0.017057166,0.0009754668,0.000006389606],"about_ca_topic_score_codex":0.018866329,"about_ca_topic_score_gemma":0.022641886,"teacher_disagreement_score":0.018866329,"about_ca_system_score_codex":0.0016154805,"about_ca_system_score_gemma":0.0016584173,"threshold_uncertainty_score":0.037513018},"labels":[],"label_agreement":null},{"id":"W4385571859","doi":"10.18653/v1/2023.acl-long.349","title":"To Copy Rather Than Memorize: A Vertical Learning Paradigm for Knowledge Graph Completion","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Université de Montréal","funders":"National Natural Science Foundation of China","keywords":"Zhàng; Chen; Computer science; Memorization; Knowledge graph; Graph; Computational linguistics; Artificial intelligence; Natural language processing; Theoretical computer science; Mathematics education; Philosophy; Cognitive science; Linguistics; Mathematics; Psychology; History; China","score_opus":0.04013096083847964,"score_gpt":0.30810195585665157,"score_spread":0.2679709950181719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385571859","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.007967494,0.00035132834,0.9843753,0.0007187104,0.00015299434,0.00014319527,0.00042294728,0.001405304,0.0044626873],"genre_scores_gemma":[0.41951513,0.0010262297,0.559213,0.00052524696,0.000285218,0.0006696978,0.0020162212,0.0006734009,0.016075846],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886405,0.00029004947,0.00008168879,0.00036981062,0.00027354428,0.000120910496],"domain_scores_gemma":[0.9965391,0.0012062843,0.00024934497,0.0011827518,0.0005310064,0.00029145542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021471963,0.0007767951,0.0008699114,0.0011281181,0.001025421,0.0015905345,0.0036477072,0.0012211284,0.011683492],"category_scores_gemma":[0.0076750023,0.00050352584,0.0009657214,0.0016545674,0.001699633,0.0086920895,0.0030368285,0.002728529,0.0018823838],"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.00045186002,0.00041467714,0.0010514394,0.0003742309,0.00009136436,0.00010912194,0.0006219724,0.032984033,0.0065316535,0.26189783,0.026252424,0.6692194],"study_design_scores_gemma":[0.000075370204,0.00013254602,0.00033661764,0.000040795,0.00004089569,0.0000988731,0.00010459626,0.5008496,0.0035511807,0.4824501,0.0122879,0.000031549916],"about_ca_topic_score_codex":0.007983968,"about_ca_topic_score_gemma":0.010940635,"teacher_disagreement_score":0.011683492,"about_ca_system_score_codex":0.0007931405,"about_ca_system_score_gemma":0.0018282519,"threshold_uncertainty_score":0.03908521},"labels":[],"label_agreement":null},{"id":"W4385573095","doi":"10.18653/v1/2022.emnlp-main.278","title":"Mixture of Attention Heads: Selecting Attention Heads Per Token","year":2022,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":23,"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; Mila - Quebec Artificial Intelligence Institute","funders":"State Key Laboratory of Software Development Environment","keywords":"Computer science; Interpretability; Feed forward; Artificial intelligence; Security token; Computation; Transformer; Set (abstract data type); Machine learning; Computer network; Algorithm","score_opus":0.010614764015150826,"score_gpt":0.2437902451232547,"score_spread":0.23317548110810388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385573095","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.03382946,0.0003091315,0.95972395,0.00030798063,0.00008572377,0.00011157245,0.000106193045,0.0035502266,0.0019758176],"genre_scores_gemma":[0.70600533,0.00024787497,0.28315783,0.00063012843,0.00009551376,0.0002008161,0.0003382132,0.0004032566,0.008920939],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99939716,0.00019581037,0.000023716624,0.00018178938,0.00007700715,0.00012458138],"domain_scores_gemma":[0.99883205,0.0005774473,0.00007433654,0.00022951879,0.0001860349,0.00010069942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001679837,0.0012874759,0.0011241403,0.00074426515,0.0005914907,0.00094674644,0.0024473835,0.001576026,0.004493019],"category_scores_gemma":[0.0044418573,0.0008529482,0.0009450494,0.0007636106,0.001038048,0.0032329087,0.0026293134,0.0021135923,0.001219205],"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.0010824411,0.00029326475,0.0048859543,0.00020041363,0.00025022312,0.0002880696,0.0005063572,0.2606744,0.02922123,0.032190472,0.0117190685,0.65868807],"study_design_scores_gemma":[0.000030330304,0.000064643464,0.00039398938,0.000011195832,0.00005080698,0.00006622309,0.000034776982,0.97116065,0.008269472,0.018397396,0.0014973922,0.000023120954],"about_ca_topic_score_codex":0.007351493,"about_ca_topic_score_gemma":0.012770105,"teacher_disagreement_score":0.007351493,"about_ca_system_score_codex":0.0010550854,"about_ca_system_score_gemma":0.0013425095,"threshold_uncertainty_score":0.015030682},"labels":[],"label_agreement":null},{"id":"W4385584355","doi":"10.3233/faia230149","title":"Chapter 17. Approximate Answering of Graph Queries","year":2023,"lang":"en","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","topic":"Advanced Graph Neural Networks","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":"Knowledge graph; Computer science; Inference; Graph; Theoretical computer science; Information retrieval; Artificial intelligence","score_opus":0.04169040072157777,"score_gpt":0.264484980040968,"score_spread":0.22279457931939023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385584355","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.007434746,0.022772202,0.80314684,0.004243821,0.0011815252,0.00045140545,0.00796794,0.005620573,0.14718087],"genre_scores_gemma":[0.0934236,0.029737368,0.69599146,0.002240082,0.0015233892,0.00078565313,0.02989332,0.0020298283,0.14437531],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987759,0.00022559376,0.00008670796,0.0002942213,0.00054553023,0.00007209523],"domain_scores_gemma":[0.99845576,0.0009389704,0.000047390127,0.00029280098,0.0002352693,0.000029734487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010533395,0.0011433798,0.0009810368,0.0013575157,0.00068093225,0.0030984357,0.0017988981,0.0012425943,0.023172105],"category_scores_gemma":[0.0042191427,0.0005555419,0.0012182303,0.0029806518,0.0007732791,0.005461898,0.0014093791,0.0017802422,0.008207112],"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.00013103551,0.00014080707,0.0006039634,0.0011372555,0.00008939903,0.0001874884,0.00034716053,0.033192225,0.0026135023,0.2155126,0.23465481,0.5113897],"study_design_scores_gemma":[0.00003213159,0.000048062855,0.00075297756,0.000432921,0.000055779143,0.00067103934,0.00024048072,0.12567766,0.006679278,0.38348982,0.4818816,0.00003834701],"about_ca_topic_score_codex":0.0061973645,"about_ca_topic_score_gemma":0.0054188296,"teacher_disagreement_score":0.023172105,"about_ca_system_score_codex":0.001892534,"about_ca_system_score_gemma":0.0012973364,"threshold_uncertainty_score":0.0775184},"labels":[],"label_agreement":null},{"id":"W4385863304","doi":"10.1109/tkde.2023.3305809","title":"Hierarchical Aggregations for High-Dimensional Multiplex Graph Embedding","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":13,"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é du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Multiplex; Graph; Embedding; Graph theory; Theoretical computer science; Artificial intelligence; Mathematics; Combinatorics; Bioinformatics","score_opus":0.031247219794920875,"score_gpt":0.2927645023608479,"score_spread":0.261517282565927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385863304","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.032760225,0.00026000445,0.96543014,0.00015696768,0.000021150885,0.000033482047,0.00017643269,0.00046161204,0.00069995434],"genre_scores_gemma":[0.6961902,0.00038830697,0.29832995,0.0002062096,0.00010333647,0.00016999082,0.0012545597,0.00023765334,0.003119887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991603,0.0002683256,0.00004655317,0.00025722233,0.00018330089,0.00008433469],"domain_scores_gemma":[0.9977254,0.0010340174,0.00036875988,0.00046015487,0.00027812345,0.00013358693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010459238,0.0009895652,0.00085340906,0.0017815671,0.00060533016,0.00085916376,0.0010939274,0.00092619593,0.0016024016],"category_scores_gemma":[0.0052643167,0.00047289746,0.0008367458,0.0017139594,0.0008547173,0.0030097323,0.0015934849,0.0014635413,0.0004958301],"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.00017305424,0.00018783964,0.005203872,0.000252536,0.00017335915,0.00032255368,0.00061915745,0.64419204,0.009240935,0.0852108,0.0065415027,0.24788238],"study_design_scores_gemma":[0.0000041692106,0.000016080156,0.00030196007,0.000006993683,0.000008218785,0.000027741788,0.000029118708,0.97139794,0.00063407334,0.026954042,0.00061273936,0.0000068470677],"about_ca_topic_score_codex":0.0028570544,"about_ca_topic_score_gemma":0.005724048,"teacher_disagreement_score":0.0028570544,"about_ca_system_score_codex":0.0007706643,"about_ca_system_score_gemma":0.00048132593,"threshold_uncertainty_score":0.0056807995},"labels":[],"label_agreement":null},{"id":"W4385863765","doi":"10.1109/tkde.2023.3303617","title":"HSMH: A Hierarchical Sequence Multi-Hop Reasoning Model With Reinforcement Learning","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Advanced Graph Neural Networks","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":"Carleton University","funders":"State Key Laboratory of Integrated Services Networks; National Natural Science Foundation of China","keywords":"Computer science; Artificial intelligence; Interpretability; Reinforcement learning; Reasoning system; Information retrieval; Natural language processing","score_opus":0.046428252697422394,"score_gpt":0.289260324197042,"score_spread":0.2428320714996196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385863765","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.015594091,0.00045102776,0.97553056,0.00059543725,0.00012877394,0.00014849407,0.0003047008,0.0015665033,0.005680337],"genre_scores_gemma":[0.77273506,0.0004248859,0.21499689,0.00041856422,0.00008942587,0.00045271288,0.00054185506,0.00011154731,0.010228936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938524,0.00014779113,0.00004161411,0.0001891498,0.00014832868,0.00008790403],"domain_scores_gemma":[0.9991698,0.00041545427,0.000098582204,0.00007604182,0.00015974787,0.00008037455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009918143,0.0008206618,0.0011286873,0.0005437964,0.0005778959,0.0011139346,0.0028341652,0.001416651,0.007110352],"category_scores_gemma":[0.0025491128,0.00047300002,0.0009861017,0.00052544934,0.00079418987,0.0017381981,0.0015657307,0.0018444835,0.0010251538],"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.0001554429,0.00011513296,0.0005849433,0.00012067188,0.000070216585,0.00017884221,0.000112860114,0.9088576,0.0014828811,0.022410572,0.0026537124,0.06325712],"study_design_scores_gemma":[0.000018224184,0.000021219865,0.000033792512,0.0000036658325,0.000007405334,0.000010216973,0.0000042058737,0.99471706,0.00019842052,0.004424465,0.0005567201,0.000004627555],"about_ca_topic_score_codex":0.014975942,"about_ca_topic_score_gemma":0.011207695,"teacher_disagreement_score":0.014975942,"about_ca_system_score_codex":0.0012276067,"about_ca_system_score_gemma":0.0020542156,"threshold_uncertainty_score":0.029777527},"labels":[],"label_agreement":null},{"id":"W4386010134","doi":"10.21203/rs.3.rs-3263186/v1","title":"Uncertainty-Aware Graph Neural Network for Semi-Supervised Diversified Recommendation","year":2023,"lang":"en","type":"preprint","venue":"Research Square","topic":"Advanced Graph Neural Networks","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 Ottawa","funders":"","keywords":"Computer science; Machine learning; Recommender system; Artificial intelligence; Generalization; Graph; Selection (genetic algorithm); Baseline (sea); Set (abstract data type); Supervised learning; Data mining; Artificial neural network; Data science; Theoretical computer science","score_opus":0.14595299060688832,"score_gpt":0.3951745048275275,"score_spread":0.24922151422063915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386010134","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.0379534,0.0013071819,0.9563726,0.00055606954,0.00010420684,0.0000745675,0.0004532249,0.0014668895,0.0017118171],"genre_scores_gemma":[0.80581236,0.0006860183,0.18412356,0.00045069843,0.00024287887,0.00014873061,0.0015112143,0.00022392788,0.0068006557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991604,0.00023068262,0.00004871738,0.00028034675,0.00019134113,0.0000886212],"domain_scores_gemma":[0.9973852,0.0015188558,0.00020175784,0.00040568862,0.00038798747,0.00010053437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012979413,0.0011508178,0.002315753,0.0013277004,0.0006027915,0.0010804001,0.002419262,0.0024724302,0.0024873505],"category_scores_gemma":[0.00613346,0.000777122,0.000851349,0.0019662066,0.00082397007,0.0025908526,0.0013157486,0.0022826793,0.00081951066],"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.0004298093,0.00027697944,0.0016413978,0.0001650015,0.00022726212,0.00010700053,0.000080344944,0.7225094,0.002915629,0.008856346,0.007999699,0.25479114],"study_design_scores_gemma":[0.000005128443,0.00001119968,0.00006711636,0.0000032987596,0.000007194065,0.000008705832,0.0000025608233,0.99634224,0.00018853466,0.0032649473,0.00009546903,0.0000034122027],"about_ca_topic_score_codex":0.013063855,"about_ca_topic_score_gemma":0.020772967,"teacher_disagreement_score":0.013063855,"about_ca_system_score_codex":0.0011751149,"about_ca_system_score_gemma":0.0012078908,"threshold_uncertainty_score":0.025975645},"labels":[],"label_agreement":null},{"id":"W4386295558","doi":"10.1098/rspa.2023.0121","title":"Causal lifting and link prediction","year":2023,"lang":"en","type":"article","venue":"Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences","topic":"Advanced Graph Neural Networks","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":"Vector Institute","funders":"","keywords":"Computer science; Pairwise comparison; Node (physics); Link (geometry); Causal structure; Covariance; Path (computing); Causal model; Graph; Causal inference; Artificial intelligence; Theoretical computer science; Machine learning; Mathematics; Econometrics","score_opus":0.010070560645251893,"score_gpt":0.21437591930160482,"score_spread":0.20430535865635294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386295558","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.02466042,0.0005122681,0.9704696,0.0011532108,0.00007982544,0.000090532085,0.0005733127,0.00046166716,0.0019991526],"genre_scores_gemma":[0.7950011,0.0012729552,0.19572714,0.00078070053,0.00043953577,0.0004202726,0.0018867395,0.00021453605,0.004257083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99559253,0.0019293114,0.0002001302,0.0014324503,0.000547176,0.00029848478],"domain_scores_gemma":[0.9531655,0.0359366,0.0037620843,0.004741096,0.0016083391,0.0007863745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007092811,0.001415541,0.0014971144,0.0032712033,0.0010791359,0.0019272408,0.0025027464,0.0023099058,0.007796577],"category_scores_gemma":[0.056292478,0.00097112305,0.0019100297,0.0030176998,0.0031912054,0.006831612,0.0030730183,0.0043169623,0.0010489813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036706822,0.0003772207,0.017088592,0.00057785044,0.00032345115,0.0003783044,0.0007598041,0.35549837,0.0014447233,0.39205196,0.0073573804,0.22377542],"study_design_scores_gemma":[0.00002247208,0.0000436735,0.0012922848,0.000053982578,0.000040737577,0.000059028123,0.00004558048,0.5998846,0.00038558367,0.3966256,0.0015196082,0.00002678907],"about_ca_topic_score_codex":0.0067145885,"about_ca_topic_score_gemma":0.0049360385,"teacher_disagreement_score":0.007796577,"about_ca_system_score_codex":0.001666338,"about_ca_system_score_gemma":0.0016777177,"threshold_uncertainty_score":0.037510872},"labels":[],"label_agreement":null},{"id":"W4386526711","doi":"10.1007/s00521-023-08964-5","title":"A graph encoder–decoder network for unsupervised anomaly detection","year":2023,"lang":"en","type":"article","venue":"Neural Computing and Applications","topic":"Advanced Graph Neural Networks","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Pooling; Locality; Interpretability; Graph; Laplacian matrix; Theoretical computer science; Pattern recognition (psychology); Decoding methods; Artificial intelligence; Algorithm","score_opus":0.019065453384690352,"score_gpt":0.27337416851622587,"score_spread":0.2543087151315355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386526711","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.008360845,0.0002208734,0.98730135,0.00024086249,0.000106550506,0.000050712682,0.00026670127,0.0024131786,0.001038823],"genre_scores_gemma":[0.28152883,0.00032566077,0.7067623,0.00038114074,0.00016044152,0.00017935742,0.0014617001,0.00053154374,0.008668921],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993616,0.00015716015,0.0000302509,0.00021427618,0.00017691623,0.00005981099],"domain_scores_gemma":[0.99855286,0.0007024312,0.000079682504,0.00022949184,0.00034987353,0.000085678155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008691177,0.0009535404,0.0010889627,0.001334676,0.0005689833,0.0009650904,0.0021004525,0.0018224708,0.0036113416],"category_scores_gemma":[0.0035084581,0.00065316935,0.00069450104,0.0012286151,0.0006825452,0.0015566812,0.0016114471,0.0020595638,0.001666242],"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.00044225066,0.00023910729,0.0017147952,0.00014800267,0.00018814606,0.00026044855,0.00008499646,0.2818264,0.017703896,0.031304266,0.013655828,0.65243185],"study_design_scores_gemma":[0.000007779212,0.000016776341,0.000101900434,0.0000035333371,0.000011454663,0.00003437984,0.0000036584079,0.98961896,0.0018894529,0.0076379394,0.00066726876,0.000006920281],"about_ca_topic_score_codex":0.007802961,"about_ca_topic_score_gemma":0.014402215,"teacher_disagreement_score":0.007802961,"about_ca_system_score_codex":0.0009663283,"about_ca_system_score_gemma":0.0014049595,"threshold_uncertainty_score":0.015515089},"labels":[],"label_agreement":null},{"id":"W4386609140","doi":"10.1109/tnnls.2023.3309632","title":"Domain-Adaptive Graph Attention-Supervised Network for Cross-Network Edge Classification","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks and Learning Systems","topic":"Advanced Graph Neural Networks","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":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Discriminative model; Graph; Enhanced Data Rates for GSM Evolution; Artificial intelligence; Encoder; Domain adaptation; Domain (mathematical analysis); Theoretical computer science; Pattern recognition (psychology); Machine learning; Mathematics","score_opus":0.0290642462466722,"score_gpt":0.2674654404000126,"score_spread":0.23840119415334038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386609140","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.09377563,0.001225292,0.89723617,0.0005636848,0.00016981352,0.00012421772,0.00043449816,0.0024366933,0.0040340633],"genre_scores_gemma":[0.86263406,0.00047768053,0.12755284,0.0005363845,0.00011692715,0.00014996686,0.0018662261,0.00016179323,0.0065041105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937683,0.00015940337,0.00002476659,0.00026845947,0.00010481541,0.00006570569],"domain_scores_gemma":[0.9986369,0.0005629481,0.00016694219,0.00023537886,0.00032330473,0.00007457051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009065256,0.0011321801,0.0008963661,0.0011839765,0.00046681782,0.0005655799,0.0021205815,0.0012263288,0.0017209797],"category_scores_gemma":[0.003323268,0.00034688084,0.00070479943,0.0011336753,0.0006979813,0.0018120807,0.0013007431,0.0016678157,0.0006025227],"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.00027062854,0.00030613618,0.005322719,0.00018728334,0.0001321106,0.00020772291,0.00017987372,0.50582814,0.0057277908,0.01282467,0.010601786,0.4584112],"study_design_scores_gemma":[0.0000038316352,0.000017672195,0.00027114866,0.000005059756,0.000009687175,0.000019813886,0.000010995322,0.99305737,0.000758716,0.0053873416,0.0004542135,0.0000041515605],"about_ca_topic_score_codex":0.0060343603,"about_ca_topic_score_gemma":0.009516313,"teacher_disagreement_score":0.0060343603,"about_ca_system_score_codex":0.0011112833,"about_ca_system_score_gemma":0.00074026146,"threshold_uncertainty_score":0.011998475},"labels":[],"label_agreement":null},{"id":"W4386688780","doi":"10.31237/osf.io/fvnh6","title":"Directional Graph Attention Network","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Neural Networks","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":"Computer science; Graph; Attention network; Data mining; Margin (machine learning); Theoretical computer science; Artificial intelligence; Pattern recognition (psychology); Machine learning","score_opus":0.03509300879736632,"score_gpt":0.27251073242100377,"score_spread":0.23741772362363744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386688780","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.08004989,0.0052058166,0.89133596,0.0022514889,0.00038591563,0.00013826412,0.0014625414,0.001668082,0.01750201],"genre_scores_gemma":[0.8687302,0.004599855,0.10466201,0.0010898263,0.0003853619,0.00021964716,0.0027144088,0.00021568123,0.017383112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995617,0.00011227531,0.000017155267,0.00017806405,0.00007969147,0.000051045205],"domain_scores_gemma":[0.9990553,0.0004792575,0.00010503851,0.00008539628,0.00022676485,0.000048240705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064354885,0.00091432134,0.0006175466,0.0014295249,0.00040504715,0.00084537634,0.0011458178,0.0009789206,0.0031309207],"category_scores_gemma":[0.003222645,0.00033511876,0.000822299,0.0017840643,0.0006665403,0.0017971824,0.0009576324,0.0009980767,0.0006856198],"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.0002465227,0.0001247485,0.005678247,0.00041170622,0.00019627417,0.00022566321,0.00020306997,0.5676678,0.006179249,0.09122112,0.01827189,0.30957368],"study_design_scores_gemma":[0.000007960273,0.00003388833,0.0010254893,0.000017163127,0.00003938185,0.00006360313,0.000021330748,0.9503857,0.0008190605,0.042449035,0.005125684,0.000011717437],"about_ca_topic_score_codex":0.011282939,"about_ca_topic_score_gemma":0.011311423,"teacher_disagreement_score":0.011282939,"about_ca_system_score_codex":0.0015237312,"about_ca_system_score_gemma":0.000676505,"threshold_uncertainty_score":0.022434533},"labels":[],"label_agreement":null},{"id":"W4386689587","doi":"10.18280/isi.280428","title":"Temporal Dimensions of Quality in Knowledge Graph Evolution: A Comprehensive Review","year":2023,"lang":"en","type":"review","venue":"Ingénierie des systèmes d information","topic":"Advanced Graph Neural Networks","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":"Computer science; Graph; Knowledge graph; Data science; Theoretical computer science; Artificial intelligence","score_opus":0.07815481538933441,"score_gpt":0.35435916248059746,"score_spread":0.27620434709126307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386689587","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.00038143544,0.99478734,0.0019487977,0.0005862688,0.00010515607,0.000010649951,0.000032795837,0.000016083462,0.0021314656],"genre_scores_gemma":[0.0038476018,0.993509,0.0018787765,0.0001523096,0.00012378185,0.000013295066,0.000056433997,0.0000069598177,0.00041183448],"study_design_codex":"design_other","study_design_gemma":"systematic_review","domain_scores_codex":[0.9994093,0.00014127434,0.00007255223,0.0001326336,0.00021316519,0.000031095064],"domain_scores_gemma":[0.99471045,0.003791674,0.00042259847,0.0001368062,0.0008370559,0.00010145768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002033605,0.00097145396,0.0010754269,0.0045022187,0.00041402277,0.0019379506,0.0012437007,0.0012250685,0.0024334535],"category_scores_gemma":[0.0057802848,0.0006140876,0.0006733721,0.0062913,0.0010617408,0.0034141464,0.0010348309,0.0011251641,0.0008575946],"study_design_candidate":"systematic_review","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030387846,0.000044061293,0.0006088594,0.019105764,0.00014302078,0.000065146945,0.00017518662,0.0018234836,0.0003442174,0.017685039,0.010082351,0.9498925],"study_design_scores_gemma":[0.000013581694,0.0001612593,0.0032112063,0.02384654,0.0006322649,0.0009950728,0.00043560154,0.0028643545,0.0013804011,0.030270254,0.93609107,0.00009830846],"about_ca_topic_score_codex":0.005498552,"about_ca_topic_score_gemma":0.007989752,"teacher_disagreement_score":0.005498552,"about_ca_system_score_codex":0.0015414505,"about_ca_system_score_gemma":0.003115669,"threshold_uncertainty_score":0.011184037},"labels":[],"label_agreement":null},{"id":"W4386691567","doi":"10.52953/afyw5455","title":"Designing graph neural networks training data with limited samples and small network sizes","year":2023,"lang":"en","type":"article","venue":"ITU Journal on Future and Evolving Technologies","topic":"Advanced Graph Neural Networks","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":"Concordia University","funders":"Mitacs","keywords":"Computer science; Artificial neural network; Pipeline (software); Graph; Artificial intelligence; Data mining; Machine learning; Training set; Baseline (sea); Domain (mathematical analysis); Feature (linguistics); Small data; Node (physics); Engineering; Theoretical computer science; Mathematics","score_opus":0.05848140215441747,"score_gpt":0.250777585829844,"score_spread":0.19229618367542653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386691567","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.3918719,0.0005043182,0.5877101,0.0012662415,0.0002887647,0.0009565853,0.004524212,0.007959774,0.0049182386],"genre_scores_gemma":[0.6111654,0.00023064257,0.3761792,0.00035396134,0.000034416167,0.0011586836,0.008480712,0.00038660594,0.0020104698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993476,0.0002149652,0.00004322252,0.00018970741,0.00013811486,0.00006631641],"domain_scores_gemma":[0.99764425,0.0010462436,0.00014136688,0.0005033746,0.00059284363,0.00007190127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015533847,0.00091088755,0.0004738365,0.00071774586,0.00043883407,0.00056572305,0.0020610392,0.0011755629,0.0018101612],"category_scores_gemma":[0.009831081,0.000593552,0.0006385077,0.00068027386,0.00071733387,0.0015960733,0.0009438984,0.0018206597,0.0006158301],"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.00026396988,0.00043374556,0.008238965,0.00037879977,0.00011493047,0.0001791046,0.000120165474,0.8253759,0.01413597,0.004950363,0.01194986,0.13385828],"study_design_scores_gemma":[0.000033320805,0.00008475916,0.0009200204,0.000013146842,0.000010758451,0.000025899239,0.000034756475,0.9861216,0.008477493,0.0027830594,0.0014866443,0.000008506976],"about_ca_topic_score_codex":0.0073719923,"about_ca_topic_score_gemma":0.0141881835,"teacher_disagreement_score":0.0073719923,"about_ca_system_score_codex":0.0011296511,"about_ca_system_score_gemma":0.00084147934,"threshold_uncertainty_score":0.014658153},"labels":[],"label_agreement":null},{"id":"W4386727921","doi":"10.20944/preprints202309.0962.v1","title":"Directional Graph Attention Networks","year":2023,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Advanced Graph Neural Networks","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":"McGill University","funders":"","keywords":"Computer science; Graph; Attention network; Data mining; Margin (machine learning); Theoretical computer science; Artificial intelligence; Machine learning; Pattern recognition (psychology)","score_opus":0.1264386529009888,"score_gpt":0.3404159394477672,"score_spread":0.21397728654677842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386727921","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.072797604,0.0062359055,0.9005253,0.002191902,0.00035495742,0.00013940623,0.0013572499,0.0016221282,0.014775625],"genre_scores_gemma":[0.85731995,0.0057678265,0.11603813,0.0012579715,0.0004831417,0.00023669936,0.0028646893,0.00025372056,0.01577795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994873,0.00013477997,0.000020792266,0.00020814894,0.000094670686,0.000054224638],"domain_scores_gemma":[0.99877197,0.00066538225,0.00013521683,0.00011426321,0.00025775828,0.000055314707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007561856,0.0011085607,0.0006692771,0.0016064835,0.00041639802,0.00090713945,0.0012166279,0.0010525971,0.0029147991],"category_scores_gemma":[0.0038891935,0.0004012899,0.00092190254,0.0018986833,0.00070985506,0.002044198,0.0010857189,0.0011599548,0.000684685],"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.00021139302,0.00011903873,0.0057690213,0.00045077055,0.00021091588,0.00018575355,0.00021449215,0.5636006,0.005476643,0.092248656,0.015789904,0.31572273],"study_design_scores_gemma":[0.000008425284,0.000036773392,0.0011174427,0.000021697173,0.000044607044,0.00006365208,0.000024133538,0.9407242,0.000848571,0.05195499,0.005142796,0.000012767183],"about_ca_topic_score_codex":0.010829276,"about_ca_topic_score_gemma":0.012381283,"teacher_disagreement_score":0.010829276,"about_ca_system_score_codex":0.001606651,"about_ca_system_score_gemma":0.0006259913,"threshold_uncertainty_score":0.021532476},"labels":[],"label_agreement":null},{"id":"W4386768533","doi":"10.14778/3611540.3611599","title":"Demonstration of SPARQL <sup> <i>ML</i> </sup> : An Interfacing Language for Supporting Graph Machine Learning for RDF Graphs","year":2023,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Advanced Graph Neural Networks","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":"Concordia University","funders":"","keywords":"SPARQL; Computer science; Named graph; RDF; RDF query language; RDF Schema; Graph; Scripting language; Information retrieval; Query language; Programming language; Web search query; Search engine; Theoretical computer science; Semantic Web; Web query classification","score_opus":0.018095438311099787,"score_gpt":0.27273469682791746,"score_spread":0.2546392585168177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386768533","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.010165342,0.00021988046,0.6596635,0.0014446073,0.0003718983,0.00028371104,0.016869487,0.27353296,0.037448596],"genre_scores_gemma":[0.16038035,0.0008003755,0.67587143,0.0026176688,0.00014117514,0.0008123445,0.069389984,0.057296176,0.032690503],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99934846,0.000114066475,0.000053811043,0.000102390215,0.00031898607,0.00006213823],"domain_scores_gemma":[0.99860495,0.00063180365,0.000046288656,0.0003499652,0.0002576196,0.000109421824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016882739,0.00087472063,0.00039019153,0.00073785597,0.00046282125,0.0016634316,0.0019696606,0.000932059,0.042289156],"category_scores_gemma":[0.0034812232,0.0006601448,0.00089845585,0.000781912,0.00075541605,0.0032628465,0.002536673,0.0021781786,0.012878311],"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.001236699,0.00062548794,0.00484874,0.001031689,0.00012514638,0.0020006108,0.0012557958,0.028501851,0.039457116,0.09750682,0.6059897,0.21742034],"study_design_scores_gemma":[0.00034274603,0.0001271202,0.0017596667,0.00022094235,0.000033508884,0.0008998725,0.0002779907,0.33898678,0.05547245,0.055553064,0.54620314,0.00012280348],"about_ca_topic_score_codex":0.007743081,"about_ca_topic_score_gemma":0.0094871335,"teacher_disagreement_score":0.042289156,"about_ca_system_score_codex":0.00078651274,"about_ca_system_score_gemma":0.00089803606,"threshold_uncertainty_score":0.14147139},"labels":[],"label_agreement":null},{"id":"W4386804220","doi":"10.1007/978-3-031-43418-1_19","title":"GDM: Dual Mixup for Graph Classification with Limited Supervision","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Neural Networks","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":"Canadian Institute for Advanced Research; Carleton University","funders":"","keywords":"Computer science; Graph; Theoretical computer science","score_opus":0.03549631398267874,"score_gpt":0.2598367178325238,"score_spread":0.22434040384984508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386804220","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.0111569455,0.00087887864,0.94646025,0.00065506814,0.00034515304,0.00035416565,0.0029048438,0.033661872,0.0035828424],"genre_scores_gemma":[0.09786911,0.00031740408,0.8716494,0.0007110249,0.0002271946,0.0007021671,0.010116151,0.0032431548,0.015164352],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873954,0.00026451482,0.000062565225,0.00046822272,0.00033296234,0.00013220425],"domain_scores_gemma":[0.99852175,0.00052146334,0.00006765871,0.00056688424,0.00019536386,0.00012692797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012849682,0.00259847,0.0023940792,0.0027210163,0.0010330506,0.0022144672,0.0050796564,0.0028632446,0.022858784],"category_scores_gemma":[0.0050938097,0.0014996171,0.0022726723,0.0025793642,0.0010421809,0.0041947737,0.0054588164,0.0050261095,0.012491735],"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.0005655071,0.00037607955,0.0006748551,0.0003670054,0.0001898056,0.00012050716,0.000084268475,0.039634433,0.005742245,0.012073752,0.071772724,0.8683988],"study_design_scores_gemma":[0.00010308954,0.000106746986,0.00023408009,0.000048544014,0.000041779444,0.00007364941,0.000044013486,0.93101954,0.0052578575,0.052079774,0.010965267,0.000025693756],"about_ca_topic_score_codex":0.004941189,"about_ca_topic_score_gemma":0.010371831,"teacher_disagreement_score":0.022858784,"about_ca_system_score_codex":0.0012728542,"about_ca_system_score_gemma":0.00180292,"threshold_uncertainty_score":0.076470196},"labels":[],"label_agreement":null},{"id":"W4386942736","doi":"10.48550/arxiv.2309.10890","title":"Crypto'Graph: Leveraging Privacy-Preserving Distributed Link Prediction for Robust Graph Learning","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","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é du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Consortium de Recherche et d’innovation en Aérospatiale au Québec","keywords":"Computer science; Theoretical computer science; Graph; Graph database","score_opus":0.11587906636594186,"score_gpt":0.20816137993638476,"score_spread":0.09228231357044289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386942736","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.028456368,0.00050713355,0.9612836,0.0009691732,0.00012979313,0.00018686877,0.0008876927,0.00554167,0.0020377452],"genre_scores_gemma":[0.6760508,0.00066301547,0.31388602,0.000711671,0.00017680689,0.00029331425,0.0036906344,0.0005043936,0.004023312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738485,0.0007545204,0.00011625099,0.0006804576,0.000869355,0.00019456849],"domain_scores_gemma":[0.9908716,0.0030701065,0.0009088326,0.004250458,0.0005965504,0.00030244738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003246417,0.0010921536,0.0011382217,0.001779566,0.0010527766,0.0017535157,0.0032362523,0.0016124186,0.0017757204],"category_scores_gemma":[0.014406305,0.000547747,0.00087046943,0.0022184353,0.0018564219,0.006063091,0.0039763283,0.002977046,0.0010210722],"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.00072003616,0.00043518425,0.0044509624,0.0002423176,0.0001821339,0.0003120852,0.00024515108,0.59499216,0.008436843,0.08419687,0.022487892,0.28329828],"study_design_scores_gemma":[0.000035184577,0.000050853367,0.00022333761,0.000009159296,0.000011516313,0.000069727146,0.000023981098,0.9412785,0.002549122,0.053740624,0.0019935132,0.000014553763],"about_ca_topic_score_codex":0.0035797257,"about_ca_topic_score_gemma":0.0052183904,"teacher_disagreement_score":0.0035797257,"about_ca_system_score_codex":0.0018161676,"about_ca_system_score_gemma":0.0026368443,"threshold_uncertainty_score":0.01716888},"labels":[],"label_agreement":null},{"id":"W4387171237","doi":"10.3233/faia230547","title":"An Empirical Study of Retrieval-Enhanced Graph Neural Networks","year":2023,"lang":"en","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","topic":"Advanced Graph Neural Networks","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":"HEC Montréal","funders":"Engineering and Physical Sciences Research Council; Samsung","keywords":"Computer science; Graph; Artificial intelligence; Attention network; Machine learning; Artificial neural network; Expressive power; Theoretical computer science","score_opus":0.05082574892373995,"score_gpt":0.3209623049427829,"score_spread":0.27013655601904296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387171237","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.8747722,0.018649386,0.07939679,0.004160179,0.00028314922,0.00034616815,0.0059354925,0.0019395804,0.014517018],"genre_scores_gemma":[0.9532662,0.0019734225,0.029357174,0.00053606264,0.00018568864,0.00014689207,0.01046172,0.0002708084,0.0038019964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995509,0.0029020512,0.00014685387,0.0006039296,0.0006918212,0.00014637345],"domain_scores_gemma":[0.9479089,0.04057232,0.0021412105,0.0065322327,0.0023205413,0.00052473875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00863941,0.0009809069,0.0007340127,0.0019823227,0.0005284167,0.0012067045,0.002215505,0.001469217,0.003356358],"category_scores_gemma":[0.0576295,0.00029562914,0.0005311336,0.0027352024,0.001314876,0.0057109958,0.00121641,0.0024096898,0.0011508781],"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.0021945909,0.0015609454,0.13344309,0.0026760548,0.000835204,0.0008411671,0.00093518785,0.22696033,0.004451939,0.034032054,0.08939665,0.5026728],"study_design_scores_gemma":[0.00019310894,0.0010250438,0.038723193,0.00030449475,0.00026633305,0.0011842895,0.0006295551,0.8735587,0.0058759274,0.050189063,0.027970886,0.00007936005],"about_ca_topic_score_codex":0.0024147376,"about_ca_topic_score_gemma":0.0038065712,"teacher_disagreement_score":0.00863941,"about_ca_system_score_codex":0.0013848257,"about_ca_system_score_gemma":0.000424324,"threshold_uncertainty_score":0.04569012},"labels":[],"label_agreement":null},{"id":"W4387453959","doi":"10.1007/s10791-023-09421-6","title":"Learning heterogeneous subgraph representations for team discovery","year":2023,"lang":"en","type":"article","venue":"Information Retrieval","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":12,"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 Guelph; York University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Overfitting; Ranking (information retrieval); Machine learning; Set (abstract data type); Graph; Task (project management); Artificial intelligence; Baseline (sea); Representation (politics); Data science; Artificial neural network; Theoretical computer science","score_opus":0.014467129190787973,"score_gpt":0.27384187858459824,"score_spread":0.2593747493938103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387453959","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.10244079,0.0015133278,0.8831118,0.0012165336,0.00015656983,0.00023490132,0.0033524428,0.0032908993,0.0046827868],"genre_scores_gemma":[0.7187168,0.0008339609,0.2631214,0.00041381465,0.00021127178,0.00028909888,0.010562416,0.00036810944,0.005483144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991055,0.00025979403,0.00004908142,0.00030650976,0.00015916523,0.00012001069],"domain_scores_gemma":[0.9977761,0.0010689587,0.000244702,0.00050815695,0.00023007914,0.00017210798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000920961,0.0009869824,0.0013699658,0.004785508,0.0010308238,0.001564969,0.0022093283,0.002163976,0.0037126353],"category_scores_gemma":[0.0066466294,0.0005319881,0.0015028163,0.005129785,0.00076655275,0.003887212,0.001990564,0.0018160725,0.0013117809],"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.0008524562,0.0010549609,0.010477688,0.0006929187,0.00064124155,0.00044045836,0.0006172446,0.27717432,0.007795522,0.06788401,0.05477018,0.577599],"study_design_scores_gemma":[0.00004078356,0.00005533857,0.00061156496,0.000040661496,0.00008859437,0.00006318796,0.00013065558,0.8740997,0.0011633583,0.12105311,0.0026378534,0.000015189688],"about_ca_topic_score_codex":0.007990863,"about_ca_topic_score_gemma":0.016301813,"teacher_disagreement_score":0.007990863,"about_ca_system_score_codex":0.0012678348,"about_ca_system_score_gemma":0.0013389668,"threshold_uncertainty_score":0.015888691},"labels":[],"label_agreement":null},{"id":"W4387559172","doi":"10.48550/arxiv.2310.04562","title":"Towards Foundation Models for Knowledge Graph Reasoning","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":9,"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":"Samsung; Alliance de recherche numérique du Canada; Tencent; Canadian Institute for Advanced Research; Natural Sciences and Engineering Research Council of Canada; Institut de Valorisation des Données; Microsoft Research","keywords":"Inference; Vocabulary; Computer science; Knowledge graph; Graph; Artificial intelligence; Natural language processing; Relation (database); Foundation (evidence); Language model; Question answering; Theoretical computer science; Data mining; Linguistics","score_opus":0.14868633609743312,"score_gpt":0.23553853148674814,"score_spread":0.08685219538931502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387559172","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.013323879,0.00038623455,0.979183,0.0009182387,0.000044321787,0.000061767714,0.00081033475,0.003124521,0.0021477088],"genre_scores_gemma":[0.39569232,0.0010080646,0.59056747,0.0010344797,0.00013895915,0.00032977646,0.006110714,0.00081275956,0.004305437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868315,0.00045328532,0.00007806107,0.00041235395,0.0002798873,0.00009325133],"domain_scores_gemma":[0.99598265,0.0024178335,0.0002043362,0.0009030977,0.00035602695,0.00013599632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019459964,0.0010606414,0.0008927559,0.0017896071,0.00068628485,0.0021713339,0.0028751174,0.001616035,0.0041482644],"category_scores_gemma":[0.009989048,0.00096262834,0.0022850926,0.0013271701,0.0018384036,0.0075451373,0.0033510923,0.004643913,0.0013829271],"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.00017299094,0.00017553274,0.0023690967,0.0005373864,0.00023303663,0.00021879366,0.00051867764,0.43847513,0.0038588012,0.30552128,0.016991531,0.23092769],"study_design_scores_gemma":[0.000011192702,0.000014951318,0.00013311891,0.00003947903,0.000017481028,0.000024620811,0.000040267398,0.6946651,0.0008092108,0.30148104,0.0027552869,0.000008336397],"about_ca_topic_score_codex":0.00697596,"about_ca_topic_score_gemma":0.015141554,"teacher_disagreement_score":0.00697596,"about_ca_system_score_codex":0.0020197106,"about_ca_system_score_gemma":0.0017382618,"threshold_uncertainty_score":0.01465404},"labels":[],"label_agreement":null},{"id":"W4387848795","doi":"10.1145/3583780.3615227","title":"Stochastic Subgraph Neighborhood Pooling for Subgraph Classification","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Ontario Tech University","funders":"","keywords":"Induced subgraph isomorphism problem; Subgraph isomorphism problem; Pooling; Scalability; Computer science; Graph factorization; Graph; Factor-critical graph; Theoretical computer science; Artificial intelligence; Line graph; Database; Voltage graph","score_opus":0.04111999199670234,"score_gpt":0.29030749539578793,"score_spread":0.24918750339908557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387848795","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.05163154,0.0011424405,0.93432397,0.0005249773,0.000114496266,0.00015979572,0.0015495304,0.006795672,0.0037575555],"genre_scores_gemma":[0.703976,0.00075283565,0.27750993,0.00062288763,0.00024103573,0.0002682719,0.008287109,0.00074688124,0.007595069],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992285,0.0001629189,0.000034330264,0.00030505986,0.00017316498,0.00009604838],"domain_scores_gemma":[0.99917954,0.00022696183,0.00009196325,0.00030970303,0.00012466917,0.00006712787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007858905,0.001452091,0.001566633,0.0012970447,0.0006328944,0.0008522751,0.0020836568,0.0010044829,0.004386662],"category_scores_gemma":[0.0028548422,0.00040044633,0.0014111263,0.002060438,0.0006865584,0.002754169,0.0014977633,0.0009573432,0.0011291133],"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.00046720824,0.00032842343,0.0045233504,0.0003578792,0.00044628754,0.00033623452,0.0001929741,0.29381862,0.018354498,0.03336606,0.03901481,0.60879374],"study_design_scores_gemma":[0.000020363515,0.000060141676,0.0008996967,0.0000104106,0.00006470055,0.000088507055,0.00003227664,0.96135205,0.004204187,0.029426837,0.003825759,0.000015057415],"about_ca_topic_score_codex":0.013358869,"about_ca_topic_score_gemma":0.024967762,"teacher_disagreement_score":0.013358869,"about_ca_system_score_codex":0.001255741,"about_ca_system_score_gemma":0.0012856623,"threshold_uncertainty_score":0.026562214},"labels":[],"label_agreement":null},{"id":"W4387940089","doi":"10.1137/21m1465056","title":"Understanding Graph Neural Networks with Generalized Geometric Scattering Transforms","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Mathematics of Data Science","topic":"Advanced Graph Neural Networks","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é de Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"Fonds de recherche du Québec – Nature et technologies; Institut de Valorisation des Données; National Institutes of Health; National Science Foundation","keywords":"Scattering; Graph; Deep learning; Computer science; Theoretical computer science; Wavelet; Stability (learning theory); Graph theory; Wavelet transform; Convolutional neural network; Artificial intelligence; Artificial neural network; Algorithm; Topology (electrical circuits); Mathematics; Machine learning; Combinatorics; Physics; Quantum mechanics","score_opus":0.1583805048980607,"score_gpt":0.31848210176458575,"score_spread":0.16010159686652506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387940089","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.05776181,0.00057641265,0.93069035,0.0017401807,0.00007601013,0.000024354938,0.0001760783,0.0002715455,0.008683309],"genre_scores_gemma":[0.87367284,0.0014461335,0.11639345,0.00056505867,0.00025385746,0.00011055997,0.0004214911,0.00016636064,0.0069703334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997409,0.000091655485,0.000009579527,0.000056280056,0.00007235467,0.00002925702],"domain_scores_gemma":[0.99899596,0.00057431194,0.00013094148,0.00012624226,0.000119558434,0.00005290519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007473411,0.0004914695,0.00036336694,0.00077233027,0.00035071882,0.0013277238,0.00083174097,0.0013963026,0.0022050522],"category_scores_gemma":[0.0041283043,0.0004001416,0.00048278255,0.0004973225,0.001647675,0.0038122442,0.0013482345,0.0016381791,0.00033887557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020374326,0.000015708365,0.0006366941,0.00005018749,0.000015444695,0.00007777736,0.00011227777,0.15916283,0.001719152,0.8226233,0.0015925226,0.013973787],"study_design_scores_gemma":[0.0000033144515,0.0000056535896,0.00012560435,0.000008426636,0.0000026953755,0.00001970688,0.000018386096,0.42011395,0.00023843386,0.5785766,0.00088335574,0.0000038698086],"about_ca_topic_score_codex":0.0022987702,"about_ca_topic_score_gemma":0.0026519357,"teacher_disagreement_score":0.0022987702,"about_ca_system_score_codex":0.00096494146,"about_ca_system_score_gemma":0.00047136645,"threshold_uncertainty_score":0.007376611},"labels":[],"label_agreement":null},{"id":"W4388097324","doi":"10.15353/joci.v19i1.5191","title":"For whom is data literacy empowering? An awareness-action typology","year":2023,"lang":"en","type":"article","venue":"The Journal of Community Informatics","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":2,"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":"Typology; Action (physics); Literacy; Psychology; Space (punctuation); Social psychology; Pedagogy; Sociology; Computer science","score_opus":0.16012080403475407,"score_gpt":0.42651723954908527,"score_spread":0.26639643551433123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388097324","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.7662704,0.0017008387,0.053463932,0.036406055,0.00021545187,0.00026615846,0.000092467744,0.00011499327,0.14146963],"genre_scores_gemma":[0.9942983,0.00035220315,0.0029353271,0.0006481681,0.000028709886,0.000107954125,0.000025166826,0.000020750767,0.0015834117],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9827137,0.012794164,0.0006205209,0.0011726726,0.0013155321,0.0013834375],"domain_scores_gemma":[0.97641766,0.016829552,0.002378007,0.0015223518,0.0011411264,0.0017112686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011794665,0.0005036598,0.00036147286,0.0029104317,0.0052551934,0.008056483,0.0009197403,0.002307214,0.0024176007],"category_scores_gemma":[0.018750386,0.00029273887,0.00045778678,0.0015850872,0.026329597,0.014967242,0.010324591,0.0033808805,0.0002919451],"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.000028126458,0.000071958486,0.012976033,0.00012582715,0.0000071537033,0.0006671865,0.8298399,0.00009240833,0.0007253812,0.13630968,0.00058293686,0.01857346],"study_design_scores_gemma":[0.000012961854,0.0000727934,0.0048021115,0.0003688236,0.000014296436,0.0010909633,0.84746796,0.00060403155,0.0007005579,0.08400383,0.060830317,0.00003147285],"about_ca_topic_score_codex":0.0013376985,"about_ca_topic_score_gemma":0.0011164933,"teacher_disagreement_score":0.011794665,"about_ca_system_score_codex":0.0020567244,"about_ca_system_score_gemma":0.0029093,"threshold_uncertainty_score":0.062376916},"labels":[],"label_agreement":null},{"id":"W4388144292","doi":"10.1007/978-3-031-47240-4_30","title":"SORBET: A Siamese Network for Ontology Embeddings Using a Distance-Based Regression Loss and BERT","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Neural Networks","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":"Polytechnique Montréal","funders":"","keywords":"Ontology; Computer science; Embedding; Benchmark (surveying); Construct (python library); Representation (politics); Artificial intelligence; Focus (optics); Ontology learning; Natural language processing; Theoretical computer science; Upper ontology; Machine learning; Semantic Web; Suggested Upper Merged Ontology; Programming language","score_opus":0.025513991730159537,"score_gpt":0.2850380362882183,"score_spread":0.2595240445580587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388144292","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.0073380475,0.00034699062,0.9821684,0.00029877023,0.00025139572,0.00010247851,0.00063813734,0.0061204247,0.002735334],"genre_scores_gemma":[0.12318743,0.0005364151,0.8425433,0.0005414372,0.00016031717,0.00032146391,0.0052400376,0.0015496134,0.025920045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921906,0.00018871693,0.00004157875,0.00022290196,0.00026597394,0.000061775805],"domain_scores_gemma":[0.9992367,0.00018339552,0.00004428929,0.00019208985,0.00028552682,0.000057947967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015978958,0.0014313523,0.001097587,0.0013410245,0.0006696057,0.0016903493,0.002558582,0.0018002874,0.010372267],"category_scores_gemma":[0.0040844004,0.0007166683,0.0010044446,0.0013556205,0.0005669762,0.003085324,0.0026692192,0.0026145955,0.0053139264],"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.00039449643,0.0003348963,0.0007195,0.00017558842,0.00020733914,0.000107197266,0.00006752444,0.16449074,0.006326325,0.023958798,0.047240593,0.755977],"study_design_scores_gemma":[0.000023472781,0.00006105529,0.000110869485,0.000015587126,0.000015050687,0.00004677514,0.00001784285,0.9762399,0.0028580886,0.014656423,0.0059413705,0.0000134701095],"about_ca_topic_score_codex":0.005456515,"about_ca_topic_score_gemma":0.014767095,"teacher_disagreement_score":0.010372267,"about_ca_system_score_codex":0.0009857932,"about_ca_system_score_gemma":0.0014914754,"threshold_uncertainty_score":0.034698725},"labels":[],"label_agreement":null},{"id":"W4388340544","doi":"10.1007/978-3-031-46674-8_33","title":"Towards Time-Variant-Aware Link Prediction in Dynamic Graph Through Self-supervised Learning","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Neural Networks","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 Alberta","funders":"","keywords":"Computer science; Interpretability; Theoretical computer science; Graph; Embedding; Graph embedding; Feature learning; Artificial intelligence; Machine learning","score_opus":0.012310496478237,"score_gpt":0.23905250241036094,"score_spread":0.22674200593212393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388340544","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.02035647,0.0004377245,0.975679,0.0001454431,0.00007157872,0.000026494887,0.0002430625,0.0020379242,0.001002314],"genre_scores_gemma":[0.59585273,0.0005881337,0.39240235,0.00030515727,0.00030680012,0.00010581304,0.0021254637,0.00061227713,0.007701268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999461,0.00010469665,0.000022857022,0.00023319991,0.00012070777,0.000057589557],"domain_scores_gemma":[0.998061,0.0010584734,0.0001655996,0.00035590908,0.0002659478,0.000093092596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078196084,0.0008899694,0.0014811363,0.0013472313,0.00043632192,0.0010245421,0.0024899135,0.001391865,0.0015617723],"category_scores_gemma":[0.0030159086,0.0005679471,0.0008053048,0.001837129,0.0006348339,0.0022504013,0.0014525668,0.0016065745,0.0011132265],"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.00018506692,0.00027951537,0.0016710565,0.00013563035,0.00016336507,0.00014107765,0.00009987488,0.61862636,0.007597812,0.009720794,0.00942054,0.3519589],"study_design_scores_gemma":[0.0000017086056,0.000005461284,0.00005824043,0.0000018844522,0.0000036168562,0.000007923565,0.0000027237902,0.9967913,0.00028201137,0.0027135457,0.00012938317,0.0000021423195],"about_ca_topic_score_codex":0.0059717754,"about_ca_topic_score_gemma":0.009521492,"teacher_disagreement_score":0.0059717754,"about_ca_system_score_codex":0.0005336242,"about_ca_system_score_gemma":0.0006605752,"threshold_uncertainty_score":0.01187408},"labels":[],"label_agreement":null},{"id":"W4388699524","doi":"10.3390/app132212338","title":"Event Knowledge Graph: A Review Based on Scientometric Analysis","year":2023,"lang":"en","type":"review","venue":"Applied Sciences","topic":"Advanced Graph Neural Networks","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Beijing Association for Science and Technology; Ministry of Natural Resources of the People's Republic of China; China Scholarship Council; Strong","keywords":"Data science; Computer science; Citation; Field (mathematics); Event (particle physics); Knowledge graph; Graph; Network analysis; Power graph analysis; Information retrieval; World Wide Web; Engineering","score_opus":0.12785732350427878,"score_gpt":0.4173282751491699,"score_spread":0.2894709516448911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388699524","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.00048504982,0.9945471,0.0017622984,0.0009983862,0.00033052,0.000048243634,0.00018323842,0.000036991652,0.0016082064],"genre_scores_gemma":[0.0049204016,0.99299073,0.0010847639,0.00030232832,0.00025190186,0.000056111832,0.00019281537,0.000012285692,0.0001886564],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99660814,0.0009099189,0.00068105664,0.00055302883,0.0011325992,0.00011530091],"domain_scores_gemma":[0.97474116,0.018672395,0.0021603156,0.0005014492,0.0035296453,0.0003950068],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0066516595,0.0019204828,0.0034884748,0.04322671,0.0009753133,0.0037182749,0.0023535106,0.0017300351,0.00436004],"category_scores_gemma":[0.027917597,0.0010242815,0.0026266638,0.04756959,0.0014664487,0.0072341026,0.0019220135,0.0015644714,0.00089971774],"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.00008663232,0.000066268156,0.0025829494,0.13161431,0.0015070457,0.00019789225,0.00041150622,0.0015673545,0.00029085227,0.011319537,0.022829387,0.8275263],"study_design_scores_gemma":[0.000047294736,0.0001980664,0.012914388,0.12351043,0.008359506,0.001677891,0.0009447349,0.002948577,0.00093993905,0.025978291,0.82225657,0.00022426981],"about_ca_topic_score_codex":0.0068702493,"about_ca_topic_score_gemma":0.010238484,"teacher_disagreement_score":0.9567733,"about_ca_system_score_codex":0.0032528131,"about_ca_system_score_gemma":0.006979063,"threshold_uncertainty_score":0.035177708},"labels":[],"label_agreement":null},{"id":"W4388921160","doi":"10.1016/j.camwa.2023.11.015","title":"Agglomeration of polygonal grids using graph neural networks with applications to multigrid solvers","year":2023,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":17,"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":"Multigrid method; Computer science; Grid; Graph partition; Scalability; Cluster analysis; Graph; Artificial neural network; Theoretical computer science; Inference; Algorithm; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.022020946521040655,"score_gpt":0.2690160792643707,"score_spread":0.24699513274333007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388921160","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.028212612,0.00027594517,0.9682515,0.00029011065,0.000040745486,0.00005374031,0.000066904686,0.0007691439,0.00203923],"genre_scores_gemma":[0.49511978,0.0002731042,0.501064,0.00013959585,0.000037898397,0.00016508946,0.00024320038,0.00024832567,0.0027090332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996526,0.000104892635,0.000018909372,0.000069903814,0.00011613314,0.000037412392],"domain_scores_gemma":[0.9989409,0.00056880235,0.00012726737,0.000114683666,0.00019727145,0.00005101895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006398491,0.0007604525,0.00064147846,0.0009685285,0.00059581915,0.0010048724,0.0010821028,0.0010943683,0.0015561434],"category_scores_gemma":[0.0025527282,0.00045663206,0.000691081,0.00096345926,0.0007432504,0.0010276606,0.0013207556,0.0010042767,0.00031627616],"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.000021794709,0.000012543872,0.00040295863,0.00002878065,0.000014607011,0.00002984426,0.000043832715,0.97492856,0.0006728488,0.0034703412,0.0003374565,0.020036332],"study_design_scores_gemma":[0.0000011577322,0.0000024572616,0.00002750582,0.0000017715912,8.7362554e-7,0.000002880116,0.0000042382712,0.9983182,0.00017676405,0.0013355755,0.00012745091,0.000001246337],"about_ca_topic_score_codex":0.018465696,"about_ca_topic_score_gemma":0.019187141,"teacher_disagreement_score":0.018465696,"about_ca_system_score_codex":0.0012810829,"about_ca_system_score_gemma":0.00085805927,"threshold_uncertainty_score":0.0367164},"labels":[],"label_agreement":null},{"id":"W4389098833","doi":"10.1145/3633518","title":"A Survey on Graph Representation Learning Methods","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Intelligent Systems and Technology","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":189,"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":"Computer science; Graph; Representation (politics); Data science; Theoretical computer science; Artificial intelligence; Information retrieval; Machine learning","score_opus":0.064175238834068,"score_gpt":0.3603229334070372,"score_spread":0.2961476945729692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389098833","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.0032755856,0.08418038,0.8957777,0.0024257845,0.0008332113,0.0001693339,0.0012870473,0.001822998,0.010227896],"genre_scores_gemma":[0.11238751,0.23401406,0.62089586,0.002509974,0.0031968504,0.000781935,0.00983137,0.0013613993,0.015020965],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998406,0.00048296468,0.0001348148,0.00037543496,0.00052066456,0.00008012002],"domain_scores_gemma":[0.9967879,0.0019933872,0.00013502444,0.00043509505,0.00057525653,0.00007345234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019276087,0.0017121995,0.0017749158,0.004134404,0.0005638717,0.002141113,0.002736048,0.0015180042,0.00663893],"category_scores_gemma":[0.008808111,0.0006349827,0.0017158973,0.007882593,0.0006742702,0.005419906,0.0014765714,0.0023638974,0.0037921402],"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.000052323667,0.000110634915,0.0011120396,0.0019243115,0.00014273297,0.00006794285,0.00012434914,0.037293967,0.00070484605,0.057986442,0.044404607,0.8560758],"study_design_scores_gemma":[0.000034325065,0.00013044768,0.0017038858,0.0010408486,0.00015769363,0.0005360871,0.00021602082,0.48252997,0.0018117914,0.27814937,0.23360218,0.000087401204],"about_ca_topic_score_codex":0.004138348,"about_ca_topic_score_gemma":0.00365303,"teacher_disagreement_score":0.00663893,"about_ca_system_score_codex":0.0012583355,"about_ca_system_score_gemma":0.0013408924,"threshold_uncertainty_score":0.022209466},"labels":[],"label_agreement":null},{"id":"W4389315073","doi":"10.14778/3617838.3617842","title":"FedGTA: Topology-Aware Averaging for Federated Graph Learning","year":2023,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Mila - Quebec Artificial Intelligence Institute; HEC Montréal","funders":"","keywords":"Scalability; Computer science; Graph; Distributed computing; Machine learning; Robustness (evolution); Artificial intelligence; Software deployment; Theoretical computer science; Database","score_opus":0.016568994672844187,"score_gpt":0.2504238959387287,"score_spread":0.23385490126588454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389315073","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.0140505545,0.00026428638,0.97261244,0.00024580455,0.00007663649,0.00009324468,0.00031842952,0.01109676,0.0012419446],"genre_scores_gemma":[0.43085974,0.00020937703,0.5613198,0.00047039776,0.00008516292,0.0002979704,0.002549544,0.001323537,0.002884498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858165,0.00035828885,0.000062735584,0.0004885463,0.0003671777,0.00014163146],"domain_scores_gemma":[0.99732035,0.0008482336,0.00021136233,0.000985255,0.00043273057,0.00020202351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018368143,0.0016973467,0.0018674787,0.0013598185,0.0010998312,0.0015922422,0.0043529235,0.0016039265,0.0029042957],"category_scores_gemma":[0.0069673476,0.00068639807,0.0012061099,0.0017977392,0.0009756037,0.003363624,0.0025325986,0.0020990896,0.001187052],"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.00012182556,0.00021338275,0.0018981317,0.00012437417,0.00012453843,0.00009290177,0.00010915438,0.74593884,0.003926016,0.007298883,0.013804492,0.22634755],"study_design_scores_gemma":[0.00000825592,0.000014839866,0.00008597552,0.0000025966567,0.000004823082,0.000015073015,0.000011196144,0.9947803,0.0005954961,0.0038906045,0.0005864962,0.000004441172],"about_ca_topic_score_codex":0.010352937,"about_ca_topic_score_gemma":0.01914595,"teacher_disagreement_score":0.010352937,"about_ca_system_score_codex":0.0018606439,"about_ca_system_score_gemma":0.0021677227,"threshold_uncertainty_score":0.020585358},"labels":[],"label_agreement":null},{"id":"W4389469990","doi":"10.48550/arxiv.2312.02339","title":"Expressive Sign Equivariant Networks for Spectral Geometric Learning","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","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":"Office of Naval Research; Multidisciplinary University Research Initiative; Institute for Catastrophic Loss Reduction; National Science Foundation","keywords":"Equivariant map; Sign (mathematics); Sign language; Eigenvalues and eigenvectors; Computer science; Node (physics); Homogeneous space; Code (set theory); Link (geometry); Artificial intelligence; Mathematics; Theoretical computer science; Algebra over a field; Topology (electrical circuits); Pure mathematics; Programming language; Combinatorics; Linguistics; Physics; Geometry","score_opus":0.0976965443162144,"score_gpt":0.21045601341647988,"score_spread":0.11275946910026548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389469990","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.019289257,0.00013725471,0.9725044,0.00039166625,0.000030907107,0.000027625483,0.00013162021,0.00041773648,0.0070695877],"genre_scores_gemma":[0.82537013,0.00046261502,0.16555005,0.00034821293,0.00010208243,0.00013586225,0.00044323812,0.00032932032,0.007258471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995054,0.00020827881,0.000021907063,0.000099838675,0.00012779258,0.000036736303],"domain_scores_gemma":[0.9990096,0.00046320976,0.00011341255,0.00024245538,0.00011010672,0.00006120628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008559663,0.00066407537,0.00035670903,0.00063817215,0.00038165555,0.00094334997,0.00080233545,0.00061884226,0.0045375335],"category_scores_gemma":[0.004718132,0.00027394883,0.0005111315,0.00050028507,0.0017016011,0.0024319838,0.0017275853,0.0019665959,0.0007334376],"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.000050558257,0.000035555153,0.0004317284,0.00006173826,0.000019541976,0.0000646078,0.00009743574,0.17912856,0.0047727544,0.768442,0.0017352557,0.045160305],"study_design_scores_gemma":[0.0000041404955,0.000013648158,0.000049824386,0.000007856441,0.0000033344877,0.000024629859,0.000010303693,0.44851702,0.0009879277,0.54875296,0.0016215885,0.000006612544],"about_ca_topic_score_codex":0.00066987093,"about_ca_topic_score_gemma":0.0013645563,"teacher_disagreement_score":0.0045375335,"about_ca_system_score_codex":0.00083771476,"about_ca_system_score_gemma":0.0004610012,"threshold_uncertainty_score":0.015179515},"labels":[],"label_agreement":null},{"id":"W4389778193","doi":"10.1016/j.patcog.2023.110209","title":"A contrastive variational graph auto-encoder for node clustering","year":2023,"lang":"en","type":"article","venue":"Pattern Recognition","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":23,"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":"Cluster analysis; Randomness; Computer science; Feature (linguistics); Upper and lower bounds; Inference; Algorithm; Encoder; Pattern recognition (psychology); Artificial intelligence; Mathematics; Statistics","score_opus":0.0409770510361664,"score_gpt":0.27279851796812254,"score_spread":0.23182146693195615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389778193","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.007492784,0.0002764145,0.98952603,0.00019116202,0.00007700639,0.000041468917,0.00027646168,0.0009813718,0.0011371844],"genre_scores_gemma":[0.32127598,0.00038692134,0.6646183,0.00047644725,0.00013877086,0.00021723557,0.0015769928,0.0008690434,0.010440288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952054,0.00014615708,0.000020148653,0.00015189614,0.00011225173,0.000049026945],"domain_scores_gemma":[0.9988527,0.00058725866,0.000048089645,0.00022020815,0.00021865997,0.000073047166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009823845,0.0006735065,0.001253907,0.00084983977,0.0004930398,0.000897533,0.0029037776,0.001979681,0.0040131053],"category_scores_gemma":[0.003293518,0.0007998972,0.00085515884,0.0010276198,0.0008008303,0.001691544,0.0017217695,0.0022396168,0.001743747],"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.0002389207,0.00013987823,0.0006578288,0.000168547,0.00013168759,0.0001079311,0.00012103132,0.5788983,0.010511954,0.08954604,0.01264021,0.30683762],"study_design_scores_gemma":[0.000004996971,0.0000086314385,0.000038084276,0.0000046645832,0.000005267725,0.000011492095,0.0000038972007,0.98955286,0.00059002254,0.009300918,0.00047504008,0.0000041012177],"about_ca_topic_score_codex":0.010857704,"about_ca_topic_score_gemma":0.024703283,"teacher_disagreement_score":0.010857704,"about_ca_system_score_codex":0.0011857462,"about_ca_system_score_gemma":0.0013757076,"threshold_uncertainty_score":0.021588981},"labels":[],"label_agreement":null},{"id":"W4389988914","doi":"10.1109/ictai59109.2023.00112","title":"GEDI: A Graph-based End-to-end Data Imputation Framework","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"","keywords":"Imputation (statistics); Computer science; Data mining; End-to-end principle; Missing data; Artificial intelligence; Machine learning; Transformer; Graph; Theoretical computer science","score_opus":0.04556739243763991,"score_gpt":0.3195563666805088,"score_spread":0.2739889742428689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389988914","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.00068206363,0.00010763287,0.99370193,0.00015505859,0.00004249886,0.00005353701,0.0006269049,0.0043758857,0.00025443954],"genre_scores_gemma":[0.03877636,0.00023985816,0.95040303,0.00048580242,0.00008590367,0.0003074604,0.006572791,0.00094466476,0.0021840697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99691415,0.0012726081,0.00012010132,0.0009211782,0.0006010561,0.00017082917],"domain_scores_gemma":[0.9943494,0.0022489682,0.00042156974,0.0017044486,0.0010399778,0.00023557768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063603874,0.0022598354,0.0027386383,0.0026836568,0.0013493482,0.002070742,0.008509786,0.0030006075,0.00495576],"category_scores_gemma":[0.017357722,0.0013922183,0.002885063,0.0039414437,0.0011541025,0.003704174,0.003997059,0.00678308,0.005483795],"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.00047552394,0.0005757754,0.007096096,0.00057386607,0.0010095787,0.00063310115,0.00038933213,0.41052482,0.0039312267,0.04456891,0.06349363,0.46672812],"study_design_scores_gemma":[0.00004418446,0.0000565102,0.00040869598,0.000027066404,0.000056017147,0.00011389689,0.000035295427,0.93508196,0.0019407143,0.055321768,0.0068726717,0.00004115052],"about_ca_topic_score_codex":0.007782149,"about_ca_topic_score_gemma":0.01565159,"teacher_disagreement_score":0.008509786,"about_ca_system_score_codex":0.0014324917,"about_ca_system_score_gemma":0.0033924894,"threshold_uncertainty_score":0.033637345},"labels":[],"label_agreement":null},{"id":"W4390033957","doi":"10.3390/fi16010002","title":"Integrating Knowledge Graphs into Distribution Grid Decision Support Systems","year":2023,"lang":"en","type":"article","venue":"Future Internet","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":10,"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":"Computer science; Grid; Theoretical computer science; Graph; Power graph analysis; Representation (politics); Vocabulary; Visualization; Data mining","score_opus":0.010360275336494761,"score_gpt":0.27001397809974376,"score_spread":0.259653702763249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390033957","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.020082828,0.00027751023,0.9628641,0.0013327493,0.00008656627,0.00027322606,0.0015199123,0.0055147726,0.008048237],"genre_scores_gemma":[0.30236557,0.00068940915,0.690853,0.00028240192,0.000042897955,0.00022690461,0.0028143295,0.00030790386,0.002417475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987153,0.00048924494,0.00013494275,0.00020780003,0.00038474583,0.000067963185],"domain_scores_gemma":[0.996788,0.0020418458,0.0002004034,0.0004976447,0.00037704688,0.00009505295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017452138,0.0007639472,0.00060878077,0.002319428,0.0006645176,0.0035454303,0.0014348058,0.00081435655,0.003402029],"category_scores_gemma":[0.007457346,0.00042160985,0.00082672585,0.002545116,0.00080279127,0.004792826,0.0027114914,0.0014527604,0.0007348102],"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.00020155434,0.00029575557,0.0026473599,0.00044849113,0.00015646878,0.00062725006,0.0009303753,0.5259264,0.0039791586,0.15994336,0.009063042,0.2957807],"study_design_scores_gemma":[0.00003482757,0.000049109036,0.00041485354,0.00008464008,0.000050183757,0.00008454077,0.00037659882,0.8004291,0.0026053346,0.1709767,0.024856875,0.000037277754],"about_ca_topic_score_codex":0.016291333,"about_ca_topic_score_gemma":0.017001519,"teacher_disagreement_score":0.016291333,"about_ca_system_score_codex":0.0014470263,"about_ca_system_score_gemma":0.0015115811,"threshold_uncertainty_score":0.03239298},"labels":[],"label_agreement":null},{"id":"W4390075187","doi":"10.1109/access.2023.3345795","title":"From Graph Theory to Graph Neural Networks (GNNs): The Opportunities of GNNs in Power Electronics","year":2023,"lang":"en","type":"article","venue":"IEEE Access","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":53,"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":"Computer science; Power electronics; Electrification; Electronics; Workflow; Data science; Bridge (graph theory); Field (mathematics); Graph; Artificial intelligence; Systems engineering; Machine learning; Electrical engineering; Electricity; Engineering; Voltage; Theoretical computer science","score_opus":0.04174997851563435,"score_gpt":0.29958761338982487,"score_spread":0.25783763487419054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390075187","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.011213867,0.058054924,0.9023164,0.004557644,0.0008182993,0.00006660919,0.00052712735,0.00043891105,0.0220062],"genre_scores_gemma":[0.43321112,0.21088761,0.33294082,0.0035204377,0.0021257012,0.0003559674,0.0016916136,0.00041487024,0.014851834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999603,0.00013372311,0.000027440174,0.00010228959,0.000110910696,0.0000227234],"domain_scores_gemma":[0.99867487,0.0009212167,0.000081890845,0.00010303092,0.00018427531,0.000034758694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071276247,0.0008635448,0.00080541946,0.0012732805,0.00039906948,0.0014707441,0.001167479,0.0012443988,0.0026999048],"category_scores_gemma":[0.0029998359,0.00044809087,0.00083306164,0.001690329,0.001516758,0.0028078826,0.000875564,0.0022109142,0.0007617935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035471538,0.00004471238,0.0018557127,0.0018893236,0.00012521839,0.00021146933,0.00022405504,0.23685047,0.001937617,0.5155122,0.01206124,0.22925252],"study_design_scores_gemma":[0.000009155356,0.000059958777,0.00072877505,0.00050602405,0.00005164414,0.00029263337,0.00011227742,0.3677831,0.0012087052,0.5635143,0.06568417,0.000049285853],"about_ca_topic_score_codex":0.002979324,"about_ca_topic_score_gemma":0.0039206943,"teacher_disagreement_score":0.002979324,"about_ca_system_score_codex":0.0010346215,"about_ca_system_score_gemma":0.0007192413,"threshold_uncertainty_score":0.00903213},"labels":[],"label_agreement":null},{"id":"W4390504488","doi":"10.31237/osf.io/uhzyd","title":"Addressing the Limitations of Graph Neural Networks on Node-level Tasks","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Neural Networks","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":"Computer science; Smoothing; Graph; Theoretical computer science; Artificial intelligence; Homophily; Deep learning; Artificial neural network; Machine learning; Mathematics","score_opus":0.2351599297886663,"score_gpt":0.3315244164259858,"score_spread":0.0963644866373195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390504488","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.044774238,0.010035657,0.91614276,0.011618435,0.0006103236,0.00011236789,0.0007117477,0.0019385262,0.014056035],"genre_scores_gemma":[0.6622692,0.013269144,0.30529994,0.0025575554,0.00091329566,0.00023178903,0.0017468669,0.0006070704,0.013105152],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848855,0.0005549398,0.00006609746,0.00039303984,0.00038020505,0.00011726042],"domain_scores_gemma":[0.9935069,0.004307315,0.00024566887,0.00096917094,0.00074775465,0.0002231288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030005448,0.0014618761,0.0010974768,0.000820211,0.000604457,0.0021927329,0.0027489632,0.0024941603,0.0035280269],"category_scores_gemma":[0.017940862,0.00053735013,0.0005774279,0.0015331263,0.0016082413,0.008169892,0.0025387504,0.004443357,0.0018853282],"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.00027380613,0.00013106894,0.0027251842,0.0008802311,0.00021185123,0.00014672379,0.0003050758,0.35200098,0.004741384,0.12815303,0.025160778,0.48526987],"study_design_scores_gemma":[0.000014145426,0.000042808795,0.00048776457,0.00007079576,0.000022639859,0.000054054264,0.00008211669,0.79672563,0.0015142114,0.1939117,0.0070587853,0.000015359137],"about_ca_topic_score_codex":0.0076751444,"about_ca_topic_score_gemma":0.012228631,"teacher_disagreement_score":0.0076751444,"about_ca_system_score_codex":0.0012213895,"about_ca_system_score_gemma":0.00136611,"threshold_uncertainty_score":0.015868604},"labels":[],"label_agreement":null},{"id":"W4390541142","doi":"10.1007/s13278-023-01178-6","title":"Review of heterogeneous graph embedding methods based on deep learning techniques and comparing their efficiency in node classification","year":2024,"lang":"en","type":"article","venue":"Social Network Analysis and Mining","topic":"Advanced Graph Neural Networks","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":"Mount Royal University","funders":"","keywords":"Embedding; Graph embedding; Computer science; Graph; Cluster analysis; Theoretical computer science; Clustering coefficient; Artificial intelligence; Machine learning; Data mining","score_opus":0.028371005554354838,"score_gpt":0.345334446618343,"score_spread":0.31696344106398816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390541142","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.031867713,0.21710706,0.7385648,0.0018345349,0.00095735415,0.00013360752,0.0008415297,0.0014000011,0.007293436],"genre_scores_gemma":[0.36606714,0.23134252,0.3855659,0.0011752681,0.0020780119,0.00029438388,0.004087365,0.00039940368,0.008989994],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993237,0.00015119759,0.00006087672,0.00020502596,0.00022020422,0.000038988415],"domain_scores_gemma":[0.9985404,0.0008028926,0.00009763099,0.00015483254,0.00035806157,0.000046181867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009495328,0.0010907125,0.0013742992,0.002494031,0.00030777065,0.001017854,0.0013786205,0.0006885559,0.0015847046],"category_scores_gemma":[0.0033052675,0.000357452,0.00074887637,0.0035320057,0.0003657425,0.0023967854,0.0007203683,0.00089173485,0.0007179049],"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.000094117335,0.000111172325,0.0016136842,0.001221112,0.00016732975,0.000035955534,0.000041020587,0.014120018,0.002178662,0.007239819,0.008330676,0.9648464],"study_design_scores_gemma":[0.00004804103,0.0004487041,0.0068835653,0.0010281082,0.0006551974,0.00068056985,0.00023406331,0.839142,0.012513233,0.0646011,0.073647425,0.0001181109],"about_ca_topic_score_codex":0.0025585575,"about_ca_topic_score_gemma":0.0032322141,"teacher_disagreement_score":0.0025585575,"about_ca_system_score_codex":0.0004040223,"about_ca_system_score_gemma":0.0005936943,"threshold_uncertainty_score":0.0053013563},"labels":[],"label_agreement":null},{"id":"W4390628433","doi":"10.1016/j.ipm.2023.103618","title":"Learning dual disentangled representation with self-supervision for temporal knowledge graph reasoning","year":2024,"lang":"en","type":"article","venue":"Information Processing & Management","topic":"Advanced Graph Neural Networks","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":"York University","funders":"National Natural Science Foundation of China","keywords":"Dual (grammatical number); Computer science; Graph; Knowledge representation and reasoning; Representation (politics); Knowledge graph; Self representation; Artificial intelligence; Natural language processing; Theoretical computer science","score_opus":0.009978764082536066,"score_gpt":0.27204649820818916,"score_spread":0.2620677341256531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390628433","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.0274369,0.00037939165,0.9669116,0.0004951816,0.0000935948,0.00008662677,0.00046513794,0.0021646752,0.0019668948],"genre_scores_gemma":[0.7145744,0.00029500783,0.2780205,0.00042315165,0.000099843026,0.00015491106,0.0021352104,0.00021883096,0.0040781745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913543,0.00015765488,0.000060719784,0.00035402595,0.00019822936,0.000093993534],"domain_scores_gemma":[0.9979024,0.000972007,0.0001811443,0.0005322467,0.00028187886,0.00013022822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010795498,0.0009216422,0.0011827789,0.0011378808,0.0005590165,0.0016650415,0.0027507464,0.0018097295,0.0048417943],"category_scores_gemma":[0.0053987238,0.000615483,0.0014327528,0.0011052049,0.0010249253,0.004566961,0.0030332706,0.003164879,0.0008831737],"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.0008100558,0.0007050857,0.002108519,0.0004458982,0.0003000672,0.00035912037,0.00037591948,0.24616335,0.009535047,0.065854,0.014462318,0.6588806],"study_design_scores_gemma":[0.000020463098,0.000028852448,0.00011945263,0.00001529355,0.000029014698,0.000020590755,0.000017940542,0.9552466,0.001203231,0.042687222,0.0006036687,0.000007650958],"about_ca_topic_score_codex":0.0074483864,"about_ca_topic_score_gemma":0.012504517,"teacher_disagreement_score":0.0074483864,"about_ca_system_score_codex":0.00095268997,"about_ca_system_score_gemma":0.0017865848,"threshold_uncertainty_score":0.016197443},"labels":[],"label_agreement":null},{"id":"W4390659502","doi":"10.1109/tit.2024.3351107","title":"On the Feasible Region of Efficient Algorithms for Attributed Graph Alignment","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Graph Neural Networks","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":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Algorithm; Vertex (graph theory); Graph; Time complexity; Theoretical computer science; Efficient algorithm; Connectivity","score_opus":0.02218252933870495,"score_gpt":0.2538713566313062,"score_spread":0.23168882729260126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390659502","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.012516032,0.00079562434,0.98138064,0.00079933763,0.00006075275,0.00015264386,0.00017873671,0.00051945477,0.0035967913],"genre_scores_gemma":[0.29786596,0.0017843856,0.6923951,0.0005621781,0.0002661554,0.000976013,0.0012516578,0.00072498975,0.004173564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99084854,0.00406071,0.0004127675,0.0022610028,0.0014835558,0.0009333292],"domain_scores_gemma":[0.92134374,0.06705093,0.0035136286,0.0043005785,0.0026158153,0.0011752779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008496158,0.0027746311,0.0036099707,0.0029069022,0.002125139,0.004961221,0.0042562885,0.0030930792,0.007102334],"category_scores_gemma":[0.07055809,0.0014626718,0.0023646285,0.0040245475,0.004376825,0.009176336,0.005577748,0.006529245,0.0027472132],"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.0008216739,0.00038960503,0.0012862908,0.0006427104,0.00010958473,0.00015990395,0.0005468587,0.6189006,0.002891076,0.25616568,0.00795655,0.110129476],"study_design_scores_gemma":[0.00009291822,0.0001228321,0.00015855653,0.00009121815,0.000024136885,0.000095134325,0.00009482699,0.73144674,0.0014327279,0.26425865,0.0021493922,0.00003286259],"about_ca_topic_score_codex":0.0023884373,"about_ca_topic_score_gemma":0.0016414922,"teacher_disagreement_score":0.008496158,"about_ca_system_score_codex":0.0031676425,"about_ca_system_score_gemma":0.005793432,"threshold_uncertainty_score":0.044932485},"labels":[],"label_agreement":null},{"id":"W4390818924","doi":"10.1109/tdsc.2024.3353548","title":"TrustGuard: GNN-Based Robust and Explainable Trust Evaluation With Dynamicity Support","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":39,"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":"Higher Education Discipline Innovation Project; National Natural Science Foundation of China","keywords":"Computer science; Snapshot (computer storage); Aggregate (composite); Graph; Visualization; Layer (electronics); Web of trust; Data mining; Artificial intelligence; Machine learning; Computational trust; Theoretical computer science; Reputation; Database","score_opus":0.01519607042946472,"score_gpt":0.24454544670838999,"score_spread":0.22934937627892527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390818924","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.033773176,0.00046921012,0.9590176,0.0005732671,0.00009226773,0.00014801514,0.00033126355,0.003780047,0.001815075],"genre_scores_gemma":[0.80313355,0.0003182661,0.19257627,0.0002642679,0.000054797358,0.00015552586,0.0009933608,0.0002765731,0.0022272847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980337,0.00063180184,0.00017118828,0.00044885735,0.0005571635,0.00015722623],"domain_scores_gemma":[0.9956039,0.0018354327,0.0006435191,0.0005819724,0.0010924505,0.00024263748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027479394,0.0012250778,0.00081999105,0.0009993288,0.00047170985,0.0012765129,0.001625884,0.0009933695,0.0017830009],"category_scores_gemma":[0.015450686,0.00043192622,0.00089019665,0.00069866533,0.0008855551,0.003436822,0.001974914,0.001733343,0.00034122262],"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.00060294865,0.00016618837,0.0075072926,0.00026237068,0.0001911569,0.0003812621,0.0005114078,0.70887643,0.005750738,0.02368207,0.008800458,0.24326767],"study_design_scores_gemma":[0.000007528433,0.000019672767,0.00019583768,0.0000069996527,0.000011612347,0.000016432918,0.000011820124,0.9928824,0.00058695587,0.005769276,0.00048447508,0.0000070994197],"about_ca_topic_score_codex":0.0151500385,"about_ca_topic_score_gemma":0.017375754,"teacher_disagreement_score":0.0151500385,"about_ca_system_score_codex":0.002441967,"about_ca_system_score_gemma":0.0017113114,"threshold_uncertainty_score":0.03012371},"labels":[],"label_agreement":null},{"id":"W4391147288","doi":"10.1016/j.inffus.2024.102249","title":"MvTuckER: Multi-view knowledge graphs representation learning based on tensor tucker model","year":2024,"lang":"en","type":"article","venue":"Information Fusion","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Representation (politics); Tensor (intrinsic definition); Feature learning; Artificial intelligence; Mathematics; Pure mathematics; Political science","score_opus":0.02694871888122955,"score_gpt":0.29835952278918937,"score_spread":0.2714108039079598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391147288","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.0051170033,0.00043416178,0.98884636,0.00023818774,0.000103631864,0.000068071706,0.0004849942,0.0039003543,0.0008072502],"genre_scores_gemma":[0.2203206,0.0010609559,0.7674496,0.00037137524,0.00013803765,0.00024492282,0.0035303447,0.00078637345,0.0060977917],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921954,0.00015122334,0.00004049249,0.0002648303,0.00024799808,0.00007590938],"domain_scores_gemma":[0.999181,0.00023671197,0.00007804838,0.00023573001,0.00021112751,0.00005731479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001298812,0.0010860184,0.0016100467,0.001718025,0.00061096984,0.0016735347,0.0022146883,0.0017120921,0.0056919707],"category_scores_gemma":[0.004009324,0.00060514815,0.0014341663,0.0022357907,0.00065637473,0.004513761,0.002406344,0.0029007224,0.0019214592],"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.00037749106,0.0002143493,0.00060374755,0.00024765017,0.00025577325,0.00016384154,0.0001368775,0.119740926,0.009900529,0.03475575,0.021599835,0.8120033],"study_design_scores_gemma":[0.000011132339,0.000038810093,0.00015009951,0.0000143158695,0.00002651714,0.000044279084,0.000016887274,0.97615767,0.0029042007,0.018465176,0.0021537398,0.000017243861],"about_ca_topic_score_codex":0.014509341,"about_ca_topic_score_gemma":0.0112535665,"teacher_disagreement_score":0.014509341,"about_ca_system_score_codex":0.001012153,"about_ca_system_score_gemma":0.0013284365,"threshold_uncertainty_score":0.02884978},"labels":[],"label_agreement":null},{"id":"W4391423877","doi":"10.1109/ickg59574.2023.00006","title":"Efficient Low-Rank GNN Defense Against Structural Attacks","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Canadian Institute for Advanced Research; Carleton University","funders":"","keywords":"Adjacency matrix; Computer science; Rank (graph theory); Singular value decomposition; Graph; Maxima and minima; Sparse matrix; Algorithm; Matrix (chemical analysis); Theoretical computer science; Pattern recognition (psychology); Data mining; Artificial intelligence; Mathematics; Combinatorics","score_opus":0.012937775773211974,"score_gpt":0.25701910574195397,"score_spread":0.244081329968742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391423877","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.04238975,0.00070359145,0.9505337,0.00050664233,0.00012547329,0.000059131627,0.00015971463,0.002430863,0.0030911646],"genre_scores_gemma":[0.8126808,0.0006178411,0.17766875,0.0007575345,0.000105583626,0.00015098676,0.0009565162,0.00033893323,0.0067230007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897647,0.00023640503,0.00004507843,0.00025822318,0.00032230315,0.00016153893],"domain_scores_gemma":[0.9983271,0.00071047834,0.00025385787,0.00033207692,0.0002936211,0.00008287557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010862274,0.0018095623,0.0012522676,0.0006698421,0.00053373637,0.00079513417,0.0015863614,0.001610141,0.0015534889],"category_scores_gemma":[0.00508428,0.00047769237,0.0008185441,0.0005032605,0.0010314529,0.0019781308,0.0018560702,0.0024746775,0.0006937975],"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.00022522172,0.00009158609,0.0010714869,0.00012508046,0.000085117805,0.00019226666,0.00008799016,0.8328884,0.013987752,0.014608845,0.0061202087,0.13051604],"study_design_scores_gemma":[0.0000063774337,0.000026581589,0.00009961819,0.0000041940866,0.0000070132437,0.000042721418,0.000008958944,0.9935455,0.0016511253,0.0041893595,0.00041277602,0.000005804433],"about_ca_topic_score_codex":0.0039778994,"about_ca_topic_score_gemma":0.0065409383,"teacher_disagreement_score":0.0039778994,"about_ca_system_score_codex":0.0008799411,"about_ca_system_score_gemma":0.0010676511,"threshold_uncertainty_score":0.007909477},"labels":[],"label_agreement":null},{"id":"W4391557959","doi":"10.1109/icdmw60847.2023.00150","title":"Study of Topology Bias in GNN-based Knowledge Graphs Algorithms","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Computer science; Topology (electrical circuits); Algorithm; Mathematics; Combinatorics","score_opus":0.08071604601129688,"score_gpt":0.3402569789911048,"score_spread":0.2595409329798079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391557959","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.5348054,0.0018835985,0.45558688,0.001820388,0.00012756696,0.000114688955,0.00028565005,0.0011539238,0.0042218682],"genre_scores_gemma":[0.9368391,0.00040969226,0.060745474,0.00026664016,0.000062560546,0.0000624436,0.0005534362,0.00013865509,0.0009220107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804604,0.0009096593,0.00008386678,0.00035025386,0.00045769082,0.0001524636],"domain_scores_gemma":[0.9840843,0.011436421,0.0009777622,0.0015610014,0.00159969,0.00034086657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004834037,0.000734688,0.0008827708,0.001131018,0.0005128884,0.0011940241,0.0014558432,0.0013546823,0.0010223706],"category_scores_gemma":[0.032705173,0.0003420726,0.00042391988,0.0009766397,0.0010399692,0.0035203309,0.0016631917,0.0017251996,0.0002539653],"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.00036557217,0.00014577848,0.009669278,0.00012980282,0.00012365382,0.00008581096,0.00015828558,0.84949833,0.0023710208,0.020353248,0.0019445772,0.11515454],"study_design_scores_gemma":[0.00000992478,0.000037540016,0.00040957762,0.000007495047,0.000007870459,0.000017192024,0.000013103421,0.98657125,0.00081045,0.011924272,0.0001873803,0.000003882843],"about_ca_topic_score_codex":0.0035483611,"about_ca_topic_score_gemma":0.0034685405,"teacher_disagreement_score":0.004834037,"about_ca_system_score_codex":0.0020617042,"about_ca_system_score_gemma":0.0010889735,"threshold_uncertainty_score":0.025565147},"labels":[],"label_agreement":null},{"id":"W4391827219","doi":"10.1109/tcss.2024.3357696","title":"Temporal Interaction Embedding for Link Prediction in Global News Event Graph","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Social Systems","topic":"Advanced Graph Neural Networks","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":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Embedding; Link (geometry); Graph; Event (particle physics); Theoretical computer science; Artificial intelligence; Computer network","score_opus":0.02332129919915053,"score_gpt":0.32320593103412404,"score_spread":0.2998846318349735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391827219","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.18519159,0.0029166713,0.7995077,0.0008247918,0.00018716312,0.00011646863,0.0036969364,0.0033130182,0.0042457012],"genre_scores_gemma":[0.9159407,0.0009961475,0.069125324,0.0001994133,0.0001393763,0.00011261288,0.008152793,0.00020342144,0.005130183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995233,0.00009832895,0.000025770149,0.00020432861,0.00008664038,0.000061683575],"domain_scores_gemma":[0.99886155,0.00049323024,0.00021009168,0.00018814868,0.000182433,0.000064569605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056751986,0.0013480597,0.0006740305,0.0020899028,0.00042269562,0.00066558213,0.001045493,0.0009224719,0.001996348],"category_scores_gemma":[0.0030659253,0.00033624348,0.00069565495,0.0022702408,0.00041902013,0.0028503228,0.0008127042,0.001586131,0.0006097264],"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.00046168256,0.00037781362,0.0248183,0.00041813694,0.00029669696,0.00053256383,0.00035616537,0.49486488,0.005227584,0.021636179,0.022587063,0.42842293],"study_design_scores_gemma":[0.000007275923,0.00003359281,0.0013722875,0.000015868045,0.00003672941,0.000048923226,0.000038083865,0.98580474,0.00085893413,0.010101822,0.0016707587,0.000010901267],"about_ca_topic_score_codex":0.00855264,"about_ca_topic_score_gemma":0.013576064,"teacher_disagreement_score":0.00855264,"about_ca_system_score_codex":0.0008191676,"about_ca_system_score_gemma":0.00061842275,"threshold_uncertainty_score":0.017005742},"labels":[],"label_agreement":null},{"id":"W4391884321","doi":"10.1145/3648358","title":"Distributed Graph Neural Network Training: A Survey","year":2024,"lang":"en","type":"review","venue":"ACM Computing Surveys","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":71,"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; HEC Montréal","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Microsoft Research Asia; Beijing Nova Program; Hong Kong University of Science and Technology; Shanghai Jiao Tong University; National Natural Science Foundation of China; Microsoft Research; National Science and Technology Major Project; National Science Foundation","keywords":"Computer science; Workload; Distributed computing; Partition (number theory); Graph; Artificial neural network; Artificial intelligence; Machine learning; Theoretical computer science","score_opus":0.13086994288069173,"score_gpt":0.35700705758101103,"score_spread":0.2261371147003193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391884321","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.018854493,0.2502139,0.7011935,0.0042894254,0.0010694722,0.00025311531,0.0006986712,0.0026204656,0.020807052],"genre_scores_gemma":[0.29891798,0.41432583,0.26139912,0.0024214599,0.0026225217,0.00057696365,0.004048576,0.0009180851,0.014769536],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99935836,0.00013869158,0.000060980692,0.00019681524,0.00018931326,0.00005583003],"domain_scores_gemma":[0.9985366,0.00086297985,0.00006441516,0.00019095522,0.00029453594,0.00005055387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011759452,0.001149583,0.001222589,0.0011050728,0.0004016244,0.0011135972,0.002433414,0.0012022331,0.002846011],"category_scores_gemma":[0.0038244072,0.0006004379,0.0006991043,0.002652107,0.00043135654,0.0030914666,0.0011063863,0.0013700011,0.0010887977],"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.000097186174,0.00015270268,0.0020977054,0.0018355147,0.00010656431,0.0000710567,0.000089397894,0.09003704,0.0010261543,0.01375009,0.022257797,0.8684788],"study_design_scores_gemma":[0.000046190147,0.00026686027,0.002737802,0.0007337489,0.00014651757,0.00043376273,0.0002245464,0.81883335,0.0036215996,0.04486372,0.12803382,0.000058048132],"about_ca_topic_score_codex":0.0058677914,"about_ca_topic_score_gemma":0.005845306,"teacher_disagreement_score":0.0058677914,"about_ca_system_score_codex":0.0009426749,"about_ca_system_score_gemma":0.0013780049,"threshold_uncertainty_score":0.011667252},"labels":[],"label_agreement":null},{"id":"W4391935658","doi":"10.1007/978-3-031-53468-3_4","title":"When Do We Need Graph Neural Networks for Node Classification?","year":2024,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":15,"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; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Artificial neural network; Artificial intelligence; Graph; Node (physics); Machine learning; Theoretical computer science; Engineering","score_opus":0.10407645892061775,"score_gpt":0.35615108035054255,"score_spread":0.2520746214299248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391935658","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.028644213,0.026658686,0.75310636,0.12851088,0.0056026024,0.00014461894,0.0020919826,0.004722217,0.050518364],"genre_scores_gemma":[0.29166767,0.020172684,0.62824357,0.0150128165,0.004602705,0.00027055715,0.0026293267,0.0019270799,0.035473607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994091,0.00018015971,0.000026878057,0.00015129847,0.00016493502,0.00006765157],"domain_scores_gemma":[0.99434245,0.0036059981,0.0002010148,0.00062921696,0.0009458668,0.0002754494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018430611,0.0006636686,0.0011801432,0.0011097942,0.00052258035,0.0024980889,0.0018509439,0.0024011082,0.008223456],"category_scores_gemma":[0.017942946,0.0006373585,0.0005357149,0.0019374774,0.0013685778,0.01785567,0.0007698386,0.004139435,0.0054546217],"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.00022516827,0.00012429387,0.0033311828,0.0005678805,0.000113076465,0.00008974932,0.00012902376,0.016157411,0.0020068416,0.1027164,0.14627655,0.7282624],"study_design_scores_gemma":[0.00003135524,0.000027458342,0.0011927412,0.000197954,0.000047869795,0.000112985545,0.0002711326,0.19740853,0.0020611756,0.7516914,0.04692573,0.000031690615],"about_ca_topic_score_codex":0.0040505794,"about_ca_topic_score_gemma":0.006993102,"teacher_disagreement_score":0.008223456,"about_ca_system_score_codex":0.0009430081,"about_ca_system_score_gemma":0.0007734277,"threshold_uncertainty_score":0.027510166},"labels":[],"label_agreement":null},{"id":"W4391945685","doi":"10.1007/978-3-031-53468-3_5","title":"Training Matters: Unlocking Potentials of Deeper Graph Convolutional Neural Networks","year":2024,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Advanced Graph Neural Networks","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 University; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Convolutional neural network; Computer science; Graph; Artificial intelligence; Machine learning; Theoretical computer science","score_opus":0.11526280053373746,"score_gpt":0.34932592246924044,"score_spread":0.234063121935503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391945685","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.058210608,0.00959832,0.85869896,0.008117195,0.0008576304,0.000042426374,0.00023885911,0.0016027733,0.062633336],"genre_scores_gemma":[0.77971107,0.00801503,0.17966884,0.0015316565,0.00083831145,0.00007015407,0.00033648932,0.000908847,0.028919669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984336,0.00005091561,0.0000061569854,0.00003796124,0.000039417806,0.000022031776],"domain_scores_gemma":[0.99820673,0.001240387,0.000072158604,0.00028018767,0.00011160272,0.000088999856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071107957,0.0006819905,0.0004098612,0.0003580282,0.00033830758,0.0012148404,0.0011947107,0.0009301676,0.0077460017],"category_scores_gemma":[0.0060511976,0.0004330148,0.00029198852,0.0004866321,0.001445607,0.0059593,0.0014890501,0.0028516026,0.0012352867],"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.00017497048,0.000060510865,0.0005541561,0.00029127154,0.00003727959,0.00008083584,0.0002899024,0.07444971,0.007320283,0.56896776,0.017487714,0.33028558],"study_design_scores_gemma":[0.000009869994,0.00003181279,0.00013847856,0.000056915225,0.000014622547,0.000031743355,0.000029562932,0.29605624,0.0017398903,0.6943903,0.007492587,0.000007977795],"about_ca_topic_score_codex":0.0011323134,"about_ca_topic_score_gemma":0.0023295893,"teacher_disagreement_score":0.0077460017,"about_ca_system_score_codex":0.00059925136,"about_ca_system_score_gemma":0.000510024,"threshold_uncertainty_score":0.025913},"labels":[],"label_agreement":null},{"id":"W4392015900","doi":"10.21203/rs.3.rs-3960194/v1","title":"Multi-sentence and multi-intent classification using RoBERTa and graph convolutional neural network","year":2024,"lang":"en","type":"preprint","venue":"Research Square","topic":"Advanced Graph Neural Networks","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":"Raytheon Technologies (Canada)","funders":"","keywords":"Sentence; Convolutional neural network; Computer science; Graph; Artificial intelligence; Natural language processing; Theoretical computer science","score_opus":0.1741095780669141,"score_gpt":0.4100080814020322,"score_spread":0.2358985033351181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392015900","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.71010053,0.0065153963,0.26008382,0.002204066,0.0010562504,0.0003615473,0.003388567,0.006438778,0.009851066],"genre_scores_gemma":[0.9380708,0.0007365925,0.050529044,0.00023136991,0.00025626025,0.00011783064,0.0031512885,0.00007633001,0.006830459],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995883,0.00008993861,0.00003749142,0.00014039072,0.000071285984,0.00007252385],"domain_scores_gemma":[0.99866164,0.00056708616,0.00016217961,0.00011280264,0.0004121803,0.00008412813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011154525,0.0011847685,0.0007406934,0.0035472566,0.0005331938,0.0011039223,0.0011693259,0.0014450001,0.0016972359],"category_scores_gemma":[0.003230047,0.00027926842,0.001122476,0.0016328387,0.00030693962,0.0015706605,0.0007751095,0.0013788752,0.0007149868],"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.0009408029,0.0012481288,0.033150896,0.00062203384,0.00052102347,0.00066704897,0.0004440272,0.22494641,0.015947245,0.006777464,0.019304313,0.6954305],"study_design_scores_gemma":[0.0000061057435,0.000043078933,0.002062235,0.000015747439,0.000044382017,0.000023926712,0.000025390647,0.9938558,0.0013345575,0.001989955,0.00058750215,0.000011235228],"about_ca_topic_score_codex":0.018239887,"about_ca_topic_score_gemma":0.023060145,"teacher_disagreement_score":0.018239887,"about_ca_system_score_codex":0.0014829774,"about_ca_system_score_gemma":0.00105144,"threshold_uncertainty_score":0.03626746},"labels":[],"label_agreement":null},{"id":"W4392152281","doi":"10.1109/globecom54140.2023.10437361","title":"Topology Design for Robust IoT Data Gathering via Bayesian Networks","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"National Natural Science Foundation of China","keywords":"Computer science; Internet of Things; Network topology; Topology (electrical circuits); Bayesian network; Bayesian probability; Distributed computing; Computer network; Artificial intelligence; Embedded system; Mathematics","score_opus":0.09990636075084362,"score_gpt":0.3019212038571415,"score_spread":0.20201484310629786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392152281","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.0029067413,0.00009321014,0.996241,0.00008161573,0.000012308403,0.0000182469,0.00003087252,0.00010415472,0.0005118919],"genre_scores_gemma":[0.49082467,0.00093239325,0.5042377,0.00023588636,0.000096451215,0.00037643936,0.000624131,0.00020006037,0.0024722354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991416,0.0003122735,0.000041676394,0.00019562985,0.00023743787,0.000071489965],"domain_scores_gemma":[0.9980635,0.0010467372,0.00027811076,0.000118984564,0.00038521635,0.00010750836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015293529,0.0010496321,0.0011769661,0.0014206343,0.0006336648,0.000986574,0.0016746449,0.0013084898,0.0018104039],"category_scores_gemma":[0.0064698467,0.00087880285,0.0009532796,0.0011407677,0.0008597313,0.0022829943,0.0016620227,0.0013399196,0.0005202296],"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.000058181813,0.000024597512,0.00039123514,0.00007779791,0.000030023442,0.000058640384,0.00006730593,0.9325366,0.0024785055,0.01509454,0.00095700956,0.048225556],"study_design_scores_gemma":[0.000005986802,0.000012828094,0.000060955295,0.0000049732307,0.000005619727,0.000015366284,0.000008989132,0.99250776,0.00032741303,0.006670343,0.00037400337,0.0000057121238],"about_ca_topic_score_codex":0.0033883047,"about_ca_topic_score_gemma":0.0039009468,"teacher_disagreement_score":0.0033883047,"about_ca_system_score_codex":0.00094387017,"about_ca_system_score_gemma":0.0012626558,"threshold_uncertainty_score":0.008088052},"labels":[],"label_agreement":null},{"id":"W4392384600","doi":"10.1145/3616855.3635765","title":"Capturing Temporal Node Evolution via Self-supervised Learning: A New Perspective on Dynamic Graph Learning","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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 Alberta","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Interpretability; Embedding; Theoretical computer science; Artificial intelligence; Graph; Feature learning; Machine learning; Graph embedding; Node (physics)","score_opus":0.007531109664376096,"score_gpt":0.24499426783411815,"score_spread":0.23746315816974206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392384600","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.02029995,0.00028799646,0.9776989,0.00039147615,0.000041328785,0.000026884074,0.00013814982,0.00040011018,0.00071524165],"genre_scores_gemma":[0.7325654,0.0007529571,0.26032674,0.0004589068,0.00033286132,0.00017161854,0.0011062329,0.0002992227,0.0039859074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935085,0.00021535967,0.000027026595,0.00024366587,0.00012072255,0.000042432803],"domain_scores_gemma":[0.9972669,0.001324371,0.00036434137,0.0005622868,0.000344372,0.00013772915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011974603,0.00080071285,0.0008492921,0.0011892074,0.00044037594,0.00091129605,0.0020860517,0.0012050138,0.0013600729],"category_scores_gemma":[0.0050534755,0.00042574492,0.0007290971,0.0015253433,0.0013059294,0.0027752947,0.0015080364,0.002221582,0.0003497062],"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.0001266732,0.00020793421,0.0043886895,0.00017504922,0.00013736208,0.00016067052,0.0002896198,0.7403949,0.0051291124,0.058735926,0.006479244,0.18377489],"study_design_scores_gemma":[0.000002765354,0.00001045354,0.00011675048,0.00000404057,0.0000039844954,0.00000853811,0.0000065608574,0.98373055,0.00025429178,0.0154897915,0.00036839177,0.00000376471],"about_ca_topic_score_codex":0.002906623,"about_ca_topic_score_gemma":0.004021674,"teacher_disagreement_score":0.002906623,"about_ca_system_score_codex":0.00083792873,"about_ca_system_score_gemma":0.0006832708,"threshold_uncertainty_score":0.0063328147},"labels":[],"label_agreement":null},{"id":"W4392772138","doi":"10.21203/rs.3.rs-3992886/v1","title":"Optimizing Recommender Model: Integrating Knowledge Graph Information Fusion and Attention Mechanism","year":2024,"lang":"en","type":"preprint","venue":"Research Square","topic":"Advanced Graph Neural Networks","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":"Memorial University of Newfoundland","funders":"","keywords":"Recommender system; Mechanism (biology); Computer science; Graph; Fusion; Information retrieval; Artificial intelligence; Theoretical computer science","score_opus":0.06330300034578311,"score_gpt":0.3760085563261915,"score_spread":0.3127055559804084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392772138","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.0865088,0.0009347401,0.90473765,0.0014182213,0.000102927224,0.0000852567,0.00018549495,0.00070558226,0.005321351],"genre_scores_gemma":[0.9480173,0.00022744872,0.048736326,0.00023545284,0.00006770057,0.00005988211,0.00013832744,0.00003567348,0.002481841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937785,0.00018373708,0.00003321553,0.00018717257,0.00011941426,0.0000986332],"domain_scores_gemma":[0.9988502,0.00057553954,0.00012626081,0.000098384175,0.00027765846,0.00007193548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014390491,0.0007336427,0.0013341143,0.00080163626,0.00048664582,0.0011532629,0.002275324,0.0020550624,0.0022245792],"category_scores_gemma":[0.0036323695,0.0005429633,0.0007030827,0.0011015309,0.00060930056,0.0019928995,0.0010637494,0.0014031883,0.0003629368],"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.00007139553,0.000088857574,0.0009318906,0.000035996985,0.000055460383,0.000058304246,0.000031503034,0.95017785,0.00093011005,0.009561735,0.0016952065,0.036361605],"study_design_scores_gemma":[0.0000027179244,0.000007013213,0.00003968984,0.0000013899006,0.000004874734,0.000002879933,0.0000012833069,0.9987099,0.00007452222,0.0010951784,0.000058965248,0.0000016420007],"about_ca_topic_score_codex":0.025232248,"about_ca_topic_score_gemma":0.018655354,"teacher_disagreement_score":0.025232248,"about_ca_system_score_codex":0.0014382353,"about_ca_system_score_gemma":0.0013341499,"threshold_uncertainty_score":0.05017078},"labels":[],"label_agreement":null},{"id":"W4392774981","doi":"10.1093/comnet/cnae003","title":"Unsupervised framework for evaluating and explaining structural node embeddings of graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Advanced Graph Neural Networks","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Embedding; Node (physics); Theoretical computer science; Graph; Set (abstract data type); Data mining; Artificial intelligence","score_opus":0.052181983397978984,"score_gpt":0.3594490573058519,"score_spread":0.30726707390787295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392774981","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.074555,0.0005714575,0.9213838,0.00027533836,0.000036475834,0.00011491468,0.0006907235,0.0010357947,0.001336477],"genre_scores_gemma":[0.76145154,0.00032744635,0.23373781,0.000089206515,0.00008806067,0.00018748706,0.0024922674,0.00022074043,0.0014053836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978331,0.00087838736,0.00012396151,0.00057235704,0.00045528868,0.00013686994],"domain_scores_gemma":[0.991994,0.0045096925,0.0011668854,0.0008968672,0.0011929667,0.00023953961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033953504,0.0011791285,0.00093044416,0.0054208883,0.00044459457,0.0019507804,0.0020506966,0.001956973,0.0014352417],"category_scores_gemma":[0.015280934,0.00047188005,0.00096015894,0.0027830456,0.0013481034,0.0035815665,0.0015973055,0.0015964959,0.0005377275],"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.00043075095,0.0003078171,0.017493311,0.0004187518,0.0004126652,0.00020287691,0.00043910497,0.6795462,0.00663786,0.056127362,0.006134259,0.23184916],"study_design_scores_gemma":[0.000007153363,0.000035947647,0.0008336771,0.0000166236,0.00001551159,0.00003701444,0.000032249885,0.97508633,0.0008280707,0.022632748,0.00046420106,0.000010445441],"about_ca_topic_score_codex":0.0026545173,"about_ca_topic_score_gemma":0.0043819393,"teacher_disagreement_score":0.0054208883,"about_ca_system_score_codex":0.0014788475,"about_ca_system_score_gemma":0.00077091553,"threshold_uncertainty_score":0.017956555},"labels":[],"label_agreement":null},{"id":"W4392903983","doi":"10.1109/icassp48485.2024.10445943","title":"Mixed Graph Signal Analysis of Joint Image Denoising / Interpolation","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Noise reduction; Graph; Algorithm; Interpolation (computer graphics); Mathematics; Computer science; Linear interpolation; Separable space; Artificial intelligence; Mathematical optimization; Pattern recognition (psychology); Theoretical computer science; Image (mathematics)","score_opus":0.022041057155287758,"score_gpt":0.2586415680181163,"score_spread":0.23660051086282852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392903983","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.008539243,0.00017581745,0.9900417,0.0001277266,0.00002391415,0.000012692898,0.000036838617,0.00016471565,0.0008774791],"genre_scores_gemma":[0.5254482,0.0010854098,0.46293214,0.00024935324,0.00014003774,0.00012205598,0.00043782478,0.00035057295,0.009234464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99932694,0.00021511785,0.00002296937,0.00016176075,0.00021358224,0.000059663074],"domain_scores_gemma":[0.9983754,0.0008569607,0.00016126756,0.00022282808,0.00031219303,0.00007138633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014389422,0.0010332287,0.00089918205,0.001286363,0.00037127358,0.0010295042,0.0011541821,0.0013963366,0.0025215202],"category_scores_gemma":[0.004750727,0.00048754446,0.0011398998,0.001120095,0.0012153867,0.0017675438,0.0010891473,0.0015196855,0.00057308597],"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.00022695487,0.00005580933,0.0008945825,0.0002694372,0.0001421269,0.00017216227,0.00016390311,0.7408592,0.021647917,0.13126695,0.0021737162,0.1021272],"study_design_scores_gemma":[0.0000045524325,0.00001829848,0.00015338248,0.000006281489,0.000014844629,0.000027173024,0.000010455822,0.9755474,0.0022819068,0.021128163,0.0007991617,0.000008486891],"about_ca_topic_score_codex":0.0035950164,"about_ca_topic_score_gemma":0.0039815325,"teacher_disagreement_score":0.0035950164,"about_ca_system_score_codex":0.00076552207,"about_ca_system_score_gemma":0.00082867354,"threshold_uncertainty_score":0.008435309},"labels":[],"label_agreement":null},{"id":"W4392931697","doi":"10.1109/tsp.2024.3378001","title":"Learnable Filters for Geometric Scattering Modules","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Graph Neural Networks","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é de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Institut de Valorisation des Données; Chan Zuckerberg Initiative; National Institute of General Medical Sciences; Canadian Institute for Advanced Research; National Institutes of Health; National Science Foundation; Yale University; Fonds de recherche du Québec – Nature et technologies; Alfred P. Sloan Foundation","keywords":"Wavelet; Graph; Computer science; Artificial intelligence; Pattern recognition (psychology); Range (aeronautics); Graph theory; Geometric data analysis; Algorithm; Theoretical computer science; Mathematics","score_opus":0.026235985369268754,"score_gpt":0.2713497393765992,"score_spread":0.24511375400733043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392931697","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.025445575,0.00014201642,0.97189504,0.00014426028,0.00004145569,0.000025039288,0.00010340263,0.0006937634,0.0015094366],"genre_scores_gemma":[0.6225047,0.00038947022,0.36980137,0.00035619392,0.00010588483,0.00014280507,0.0009969415,0.00023606383,0.0054665357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99973303,0.0000472112,0.000011488734,0.00010221309,0.00007135964,0.000034759174],"domain_scores_gemma":[0.9995733,0.00014342878,0.000076621654,0.00007921856,0.000090687514,0.000036714944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052918534,0.00093861803,0.0005366944,0.0007123751,0.00024327553,0.0005803638,0.0012987544,0.0010253647,0.0020248091],"category_scores_gemma":[0.00201077,0.00037288113,0.00075594033,0.00062582607,0.00074661145,0.0015259323,0.0010462492,0.0013617806,0.00076472474],"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.000114967734,0.00012439895,0.0018266594,0.00012069377,0.00009071897,0.000085815336,0.00006446117,0.690687,0.024862783,0.034317024,0.0033534155,0.24435201],"study_design_scores_gemma":[0.0000037586724,0.000022163282,0.00013226988,0.000004208012,0.000006157098,0.000016380905,0.0000047556,0.9903016,0.0020888366,0.006857623,0.00055804313,0.000004154991],"about_ca_topic_score_codex":0.0019060828,"about_ca_topic_score_gemma":0.0034139191,"teacher_disagreement_score":0.0020248091,"about_ca_system_score_codex":0.000696676,"about_ca_system_score_gemma":0.00054199767,"threshold_uncertainty_score":0.0067736506},"labels":[],"label_agreement":null},{"id":"W4393147976","doi":"10.1609/aaai.v38i8.28750","title":"Anchoring Path for Inductive Relation Prediction in Knowledge Graphs","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","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":"BC Research (Canada)","funders":"National Research Foundation Singapore; National Research Foundation","keywords":"Relation (database); Path (computing); Computer science; Knowledge graph; Theoretical computer science; Artificial intelligence; Data mining; Computer network","score_opus":0.07779860327567567,"score_gpt":0.3145675342564972,"score_spread":0.23676893098082152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393147976","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.06533757,0.0016014823,0.904634,0.0009350736,0.000117769516,0.00043691197,0.0073575145,0.015337677,0.004241976],"genre_scores_gemma":[0.47085586,0.00085037074,0.501209,0.00048135215,0.000083269835,0.00030299954,0.022454996,0.00043356683,0.0033285343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874,0.00038032766,0.00007411691,0.00044392564,0.0002876051,0.00007387698],"domain_scores_gemma":[0.9952311,0.0032739267,0.00032499997,0.000556494,0.0004959419,0.000117630436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015128814,0.0014708325,0.0006759472,0.003694255,0.0007042053,0.0009249529,0.002024812,0.0015079094,0.0051625515],"category_scores_gemma":[0.010927114,0.00039415417,0.0012273706,0.0023082725,0.00074199005,0.0051211095,0.0016973523,0.0017049392,0.0017670821],"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.00055251253,0.00043763118,0.00811687,0.0011670811,0.00024597184,0.00079768174,0.001029746,0.16807158,0.010291187,0.027555274,0.036093045,0.7456413],"study_design_scores_gemma":[0.00004351731,0.00012636988,0.0014146386,0.00008285255,0.00010097431,0.00026067765,0.00023955667,0.91032547,0.007244397,0.07111812,0.009012139,0.000031305266],"about_ca_topic_score_codex":0.0072547924,"about_ca_topic_score_gemma":0.012696512,"teacher_disagreement_score":0.0072547924,"about_ca_system_score_codex":0.0013001288,"about_ca_system_score_gemma":0.0015214339,"threshold_uncertainty_score":0.017270386},"labels":[],"label_agreement":null},{"id":"W4395098143","doi":"10.1007/978-981-97-2266-2_10","title":"Graph Neural Network Approach to Semantic Type Detection in Tables","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Neural Networks","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Table (database); Graph; Security token; Artificial intelligence; Focus (optics); Key (lock); Artificial neural network; Data mining; Natural language processing; Machine learning; Theoretical computer science","score_opus":0.015491846873628225,"score_gpt":0.23586226254703144,"score_spread":0.2203704156734032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395098143","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.024145579,0.0008778765,0.953221,0.0005482698,0.0002481921,0.00012044395,0.004358427,0.005383043,0.011097155],"genre_scores_gemma":[0.31808636,0.00092431344,0.6528161,0.0002204352,0.00012990748,0.00009927909,0.00688129,0.0006265002,0.020215796],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99966526,0.000045699137,0.000023625722,0.0001131223,0.000116183684,0.000036192767],"domain_scores_gemma":[0.99929345,0.00030472234,0.000050947234,0.000109497465,0.00021454641,0.000026812995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039921707,0.00041675384,0.00055825803,0.0025749137,0.0005298869,0.0017464901,0.0013876976,0.00072490174,0.008599093],"category_scores_gemma":[0.0024873635,0.00038500546,0.00091074046,0.0027017337,0.0003610515,0.002756302,0.0006252364,0.0007802745,0.002001516],"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.00037030314,0.00014454556,0.005296677,0.00039291554,0.00012296354,0.00028011695,0.00017676901,0.13949174,0.010711644,0.097811714,0.03427416,0.71092653],"study_design_scores_gemma":[0.000007721683,0.00002104499,0.00095384254,0.000047038244,0.000048313246,0.000106004845,0.00007644846,0.8968034,0.006421697,0.08408616,0.011411337,0.000017005023],"about_ca_topic_score_codex":0.013120629,"about_ca_topic_score_gemma":0.019999642,"teacher_disagreement_score":0.013120629,"about_ca_system_score_codex":0.0011456367,"about_ca_system_score_gemma":0.000750516,"threshold_uncertainty_score":0.02876687},"labels":[],"label_agreement":null},{"id":"W4395664921","doi":"10.3390/math12091324","title":"Revolutionary Strategy for Depicting Knowledge Graphs with Temporal Attributes","year":2024,"lang":"en","type":"article","venue":"Mathematics","topic":"Advanced Graph Neural Networks","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":"Knowledge graph; Computer science; Data science; Artificial intelligence; Knowledge management","score_opus":0.046571408747427226,"score_gpt":0.2993126349266559,"score_spread":0.2527412261792287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395664921","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.005003026,0.0003190427,0.98879147,0.0003255823,0.000060682596,0.00007399633,0.00064880325,0.0021043578,0.002673093],"genre_scores_gemma":[0.1861392,0.0010865442,0.80467427,0.00029211122,0.00007858989,0.00024190937,0.0026765182,0.0003022035,0.0045086285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955815,0.00010725768,0.000038987226,0.00015334354,0.00011398633,0.000028191193],"domain_scores_gemma":[0.99897885,0.0003726021,0.00014307704,0.00028284927,0.00016902348,0.000053720807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007084352,0.00092704257,0.00043626034,0.0027378427,0.00051290286,0.0014916756,0.0012459998,0.0009415156,0.0050673326],"category_scores_gemma":[0.0039460477,0.00040736762,0.0011585823,0.0022796916,0.0008464746,0.0031981922,0.0015010122,0.0016919891,0.0018640822],"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.00017684308,0.00011078605,0.0020920988,0.00042388396,0.00009511715,0.00042503403,0.00070040784,0.14551812,0.013891339,0.1672787,0.01982965,0.649458],"study_design_scores_gemma":[0.000018501738,0.00004713401,0.0006519725,0.00007910817,0.000044902772,0.00035976677,0.00015966031,0.84286714,0.006006143,0.11510586,0.034622267,0.000037561385],"about_ca_topic_score_codex":0.0070984047,"about_ca_topic_score_gemma":0.010803779,"teacher_disagreement_score":0.0070984047,"about_ca_system_score_codex":0.00081035023,"about_ca_system_score_gemma":0.00086490205,"threshold_uncertainty_score":0.016951859},"labels":[],"label_agreement":null},{"id":"W4396506525","doi":"10.1109/tnnls.2024.3389714","title":"Reconstructed Graph Neural Network With Knowledge Distillation for Lightweight Anomaly Detection","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks and Learning Systems","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":117,"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":"Computer science; Graph; Theoretical computer science; Data mining; Distributed computing; Anomaly detection; Artificial intelligence","score_opus":0.009916444358123496,"score_gpt":0.2235279266217746,"score_spread":0.2136114822636511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396506525","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.027360464,0.00033987916,0.96983105,0.00023314384,0.00005487781,0.00002836481,0.000074054566,0.0007803969,0.0012977103],"genre_scores_gemma":[0.83629996,0.00050006155,0.15789951,0.00027938432,0.000055352953,0.00010128999,0.00051120616,0.00009580272,0.004257511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963284,0.00006719413,0.000020929372,0.00012439015,0.000101560894,0.000053022693],"domain_scores_gemma":[0.99948394,0.00019768142,0.00006580554,0.00008904857,0.00013389667,0.000029631225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004787648,0.00074925966,0.0006521946,0.0006356954,0.0003411763,0.00075620617,0.0015300164,0.00080943224,0.0012897311],"category_scores_gemma":[0.0022457894,0.0002782532,0.0006375375,0.00081346,0.0006107655,0.0020254385,0.0011585922,0.0015606959,0.00028878782],"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.00016290399,0.00010576342,0.0014575488,0.00011062042,0.00008465956,0.00011910436,0.00010197743,0.6847082,0.008545866,0.020113906,0.002446917,0.28204244],"study_design_scores_gemma":[0.0000027029994,0.000011752764,0.00007990249,0.0000019615065,0.000005876918,0.0000108124605,0.0000036057022,0.99614066,0.0009846919,0.0025180322,0.00023616596,0.0000038174458],"about_ca_topic_score_codex":0.008755236,"about_ca_topic_score_gemma":0.0063830987,"teacher_disagreement_score":0.008755236,"about_ca_system_score_codex":0.00086860225,"about_ca_system_score_gemma":0.0009469936,"threshold_uncertainty_score":0.01740855},"labels":[],"label_agreement":null},{"id":"W4398167754","doi":"10.1145/3605098.3636062","title":"Contextual Embeddings and Graph Convolutional Networks for Concept Prerequisite Learning","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Graph; Artificial intelligence; Theoretical computer science; Data science","score_opus":0.010339470846406944,"score_gpt":0.2578149863084936,"score_spread":0.24747551546208665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398167754","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.054825027,0.0013820146,0.93262124,0.0008011064,0.00013669048,0.00011130739,0.0017119289,0.004677945,0.0037327742],"genre_scores_gemma":[0.66818565,0.0008094824,0.31680992,0.0003791752,0.00011235513,0.0002343306,0.008243192,0.0002530348,0.004972791],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996178,0.00009839257,0.000020128988,0.00016430908,0.000059388105,0.000040001047],"domain_scores_gemma":[0.9993325,0.00026372247,0.00007814111,0.00015824004,0.00011683634,0.00005049323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006153695,0.0011715546,0.00044277697,0.0010555836,0.00032499927,0.0006210207,0.0013376621,0.00089761126,0.0032529118],"category_scores_gemma":[0.0027731948,0.00040022077,0.00077115215,0.0010089864,0.0005305467,0.0028032493,0.0010227627,0.0020893486,0.0010371568],"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.00027507945,0.0004138689,0.005356334,0.00037981715,0.00017639503,0.00025170905,0.0002123453,0.18555854,0.012852229,0.053119376,0.023065422,0.7183389],"study_design_scores_gemma":[0.000016578953,0.00006621799,0.0008038342,0.000028942457,0.000029994479,0.00006039575,0.00004339759,0.93981653,0.0035627345,0.051445328,0.00411111,0.0000149779935],"about_ca_topic_score_codex":0.0057498864,"about_ca_topic_score_gemma":0.015895266,"teacher_disagreement_score":0.0057498864,"about_ca_system_score_codex":0.0011633792,"about_ca_system_score_gemma":0.0009979046,"threshold_uncertainty_score":0.0114328265},"labels":[],"label_agreement":null},{"id":"W4398760296","doi":"10.1145/3626246.3653399","title":"NPA: Improving Large-scale Graph Neural Networks with Non-parametric Attention","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Mila - Quebec Artificial Intelligence Institute; HEC Montréal","funders":"","keywords":"Computer science; Parametric statistics; Scale (ratio); Artificial neural network; Graph; Artificial intelligence; Theoretical computer science; Mathematics; Statistics; Geography; Cartography","score_opus":0.005637450134911329,"score_gpt":0.22078396532566025,"score_spread":0.21514651519074893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398760296","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.069559865,0.0031370851,0.9011444,0.0013598667,0.0003894679,0.00021054565,0.00073901605,0.018052585,0.005407221],"genre_scores_gemma":[0.71666664,0.0012213786,0.2656323,0.0021962887,0.0002739117,0.00028018464,0.0038576017,0.0010427888,0.008829048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938834,0.00011781219,0.000025340161,0.0002486911,0.00013508882,0.00008468603],"domain_scores_gemma":[0.9985045,0.0007533725,0.00012449741,0.00025502127,0.00027330397,0.00008930498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011013744,0.002356744,0.0012567599,0.0012066673,0.00059479167,0.0010693907,0.0036338537,0.0020025526,0.0029502134],"category_scores_gemma":[0.0056967656,0.0007864772,0.0012454244,0.0011089673,0.0007871643,0.0040958836,0.0020596383,0.0030170153,0.0010602924],"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.00017025799,0.00024971733,0.00196406,0.00023010807,0.00020275192,0.00016270878,0.00009582485,0.685458,0.0045259017,0.00645167,0.014716541,0.28577244],"study_design_scores_gemma":[0.000007391573,0.00002313766,0.00012139498,0.0000052711257,0.000011607768,0.00001395312,0.000007802129,0.9956326,0.00057718065,0.0031442465,0.00045139872,0.00000397629],"about_ca_topic_score_codex":0.019139666,"about_ca_topic_score_gemma":0.030987933,"teacher_disagreement_score":0.019139666,"about_ca_system_score_codex":0.0017574212,"about_ca_system_score_gemma":0.0011507401,"threshold_uncertainty_score":0.038056552},"labels":[],"label_agreement":null},{"id":"W4398762212","doi":"10.4230/tgdk.1.1.8","title":"Machine Learning and Knowledge Graphs: Existing Gaps and Future Research Challenges","year":2023,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Graph Neural Networks","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":"Instituto de Ciencias del Mar y Limnología, Universidad Nacional Autónoma de México; UC Berkeley College of Chemistry; Agence Nationale de la Recherche; Institute for Catastrophic Loss Reduction","keywords":"Knowledge graph; Data science; Computer science; Knowledge management; Artificial intelligence","score_opus":0.04855171458216422,"score_gpt":0.3062091465260229,"score_spread":0.25765743194385865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398762212","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.008328576,0.7136202,0.032715373,0.22354332,0.0029702159,0.00007005025,0.0010441374,0.0002949234,0.01741327],"genre_scores_gemma":[0.12556471,0.8078333,0.036039263,0.015558375,0.008238833,0.00019103903,0.0022915602,0.00013826966,0.0041446304],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960199,0.0019650506,0.00021588797,0.0007842054,0.00066671026,0.00034826124],"domain_scores_gemma":[0.9063129,0.07903297,0.0022668259,0.0019747466,0.0075761126,0.0028364656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014033938,0.00084580976,0.0031613698,0.0046614287,0.0016709588,0.013804184,0.0034316678,0.00471791,0.023512013],"category_scores_gemma":[0.03364911,0.0005300804,0.0009115109,0.009414706,0.0062803687,0.027328404,0.0051757265,0.0055531026,0.004271178],"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.00020087084,0.00024138132,0.0031497001,0.007861483,0.00016747795,0.000106480344,0.0008144919,0.0040339404,0.00032636442,0.2264913,0.06375464,0.69285184],"study_design_scores_gemma":[0.00002853244,0.00008610358,0.0019397424,0.0069917524,0.00009092825,0.0001614119,0.0058505395,0.0078458795,0.00025328787,0.7535839,0.22309536,0.00007255602],"about_ca_topic_score_codex":0.0062805684,"about_ca_topic_score_gemma":0.0069640595,"teacher_disagreement_score":0.023512013,"about_ca_system_score_codex":0.0048065423,"about_ca_system_score_gemma":0.009610918,"threshold_uncertainty_score":0.07865548},"labels":[],"label_agreement":null},{"id":"W4399092568","doi":"10.1007/978-981-97-2303-4_8","title":"Graph-Enforced Neural Network for Attributed Graph Clustering","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Neural Networks","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":"Mila - Quebec Artificial Intelligence Institute; HEC Montréal","funders":"","keywords":"Computer science; Cluster analysis; Graph; Clustering coefficient; Theoretical computer science; Artificial intelligence","score_opus":0.020977182215086345,"score_gpt":0.256839506924215,"score_spread":0.23586232470912863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399092568","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.0070476015,0.00034894046,0.98895055,0.00022403052,0.00009217011,0.000061122366,0.00029020858,0.0016806986,0.0013046254],"genre_scores_gemma":[0.26773632,0.0006534593,0.7104002,0.0003808798,0.00016352693,0.00024978127,0.0028866052,0.0008475025,0.016681692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991898,0.00021392372,0.000046570265,0.00026509858,0.00020722357,0.00007735702],"domain_scores_gemma":[0.998073,0.0007873938,0.000129575,0.00041316292,0.00051750673,0.0000792735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001375234,0.0009960961,0.0014860888,0.0014959465,0.0008067821,0.0012388133,0.00408435,0.0019883306,0.005417511],"category_scores_gemma":[0.0053098975,0.0007164764,0.001045343,0.0025151,0.00094131415,0.0023218875,0.0023610855,0.003119734,0.0016966979],"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.00018537033,0.00013739525,0.0005721206,0.00015205688,0.00009998768,0.00004950462,0.000061248626,0.6487581,0.002159358,0.025016597,0.011569603,0.31123862],"study_design_scores_gemma":[0.0000027867816,0.0000044962285,0.000043780663,0.0000040455425,0.000004645613,0.000004973142,0.0000040536797,0.99137574,0.00035225353,0.007855804,0.00034465332,0.0000026624848],"about_ca_topic_score_codex":0.015010283,"about_ca_topic_score_gemma":0.022405384,"teacher_disagreement_score":0.015010283,"about_ca_system_score_codex":0.002013932,"about_ca_system_score_gemma":0.0017958131,"threshold_uncertainty_score":0.029845834},"labels":[],"label_agreement":null},{"id":"W4399107553","doi":"10.1016/j.media.2024.103225","title":"MMGPL: Multimodal Medical Data Analysis with Graph Prompt Learning","year":2024,"lang":"en","type":"article","venue":"Medical Image Analysis","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":32,"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":"Computer science; Artificial intelligence; Graph; Machine learning; Theoretical computer science","score_opus":0.01196817928201128,"score_gpt":0.30379009180225885,"score_spread":0.2918219125202476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399107553","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.006468911,0.000286284,0.82762873,0.00055634935,0.00017821336,0.0003349702,0.0088537065,0.15379205,0.0019007693],"genre_scores_gemma":[0.09306851,0.0003270673,0.878721,0.00054236467,0.00009423757,0.000833235,0.014860913,0.006196587,0.0053560855],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99961406,0.0000933541,0.000022771554,0.000118825104,0.00011780756,0.000033158365],"domain_scores_gemma":[0.99904245,0.00046096797,0.000054136653,0.00023957618,0.00013152315,0.00007135803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007941656,0.0014091361,0.00084911735,0.0016556571,0.00045131083,0.0012097192,0.0021459719,0.0015906533,0.02665816],"category_scores_gemma":[0.0048613604,0.0007490284,0.0011802467,0.0011787118,0.00040488326,0.0017262684,0.002693836,0.0019224334,0.0078726085],"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.00063579273,0.00030156306,0.0015478102,0.0006786845,0.00020554109,0.00043432452,0.00013082392,0.05943068,0.010663916,0.009650791,0.15571481,0.7606052],"study_design_scores_gemma":[0.00011378342,0.00011256252,0.00063484453,0.00004037542,0.000033441673,0.00017656243,0.000037240872,0.9358125,0.010025205,0.031211931,0.021762537,0.00003906336],"about_ca_topic_score_codex":0.0046421457,"about_ca_topic_score_gemma":0.007691097,"teacher_disagreement_score":0.02665816,"about_ca_system_score_codex":0.0006935548,"about_ca_system_score_gemma":0.0009895539,"threshold_uncertainty_score":0.08918041},"labels":[],"label_agreement":null},{"id":"W4399477611","doi":"10.1145/3626232.3653257","title":"Crypto'Graph: Leveraging Privacy-Preserving Distributed Link Prediction for Robust Graph Learning","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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","funders":"","keywords":"Computer science; Link (geometry); Graph; Theoretical computer science; Distributed computing; Computer network","score_opus":0.028377776490004118,"score_gpt":0.2552443997413436,"score_spread":0.2268666232513395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399477611","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.024465155,0.00035184558,0.968642,0.0006616789,0.00009505065,0.00014961025,0.0004764449,0.0036161654,0.001542088],"genre_scores_gemma":[0.7303657,0.00053959555,0.26271853,0.00054453244,0.00013159525,0.000260801,0.0019938275,0.00034486406,0.003100608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974654,0.00071749586,0.00011375625,0.0006306269,0.0008678347,0.00020498183],"domain_scores_gemma":[0.99112564,0.0031537684,0.00095334556,0.0038576396,0.00062189513,0.0002876737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030476293,0.0009979326,0.0010584706,0.0016052206,0.0009901172,0.001650326,0.0029501924,0.0014404826,0.0015643872],"category_scores_gemma":[0.013741493,0.0005180686,0.0007974135,0.0020282161,0.0018517211,0.00572935,0.003648399,0.0028020926,0.00076482573],"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.00061371195,0.00036167388,0.0037242067,0.00020132562,0.00015188857,0.00031941602,0.00022018686,0.64974064,0.008800711,0.08264389,0.013397232,0.23982508],"study_design_scores_gemma":[0.000025044113,0.000042300795,0.0001727136,0.000007269662,0.0000095261275,0.00006219463,0.000020347596,0.95389533,0.0025142517,0.041885022,0.0013530523,0.000012919049],"about_ca_topic_score_codex":0.0031504566,"about_ca_topic_score_gemma":0.004404351,"teacher_disagreement_score":0.0031504566,"about_ca_system_score_codex":0.0016380793,"about_ca_system_score_gemma":0.0026174993,"threshold_uncertainty_score":0.016117573},"labels":[],"label_agreement":null},{"id":"W4399510106","doi":"10.1016/j.procs.2024.09.567","title":"Link Prediction in Bipartite Networks","year":2024,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Advanced Graph Neural Networks","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":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; Galatasaray Üniversitesi; Providence Health Care","keywords":"Bipartite graph; Computer science; Recommender system; Benchmark (surveying); Link (geometry); Matching (statistics); Theoretical computer science; Graph; Task (project management); Heuristic; Artificial intelligence; Machine learning; Computer network; Mathematics","score_opus":0.008967276321014407,"score_gpt":0.23833898569584214,"score_spread":0.22937170937482773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399510106","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.13322896,0.0010021637,0.85360974,0.0007364268,0.00009153213,0.00012825408,0.00240858,0.0020278767,0.0067664967],"genre_scores_gemma":[0.8499036,0.000640318,0.13835563,0.00030915157,0.000094499344,0.00015321301,0.0049471566,0.00020489637,0.0053915735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871826,0.00042979507,0.000053604195,0.0004384817,0.00021314825,0.0001468425],"domain_scores_gemma":[0.993616,0.0040146355,0.00075625384,0.0007232277,0.0006724552,0.00021745409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017102641,0.0009545853,0.00080117414,0.0027520368,0.000919276,0.0013330671,0.0014464561,0.0016364456,0.0035718614],"category_scores_gemma":[0.01241627,0.000670919,0.00084858155,0.0027812754,0.0007650305,0.003677223,0.0011522197,0.0014913725,0.0010497016],"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.00024046123,0.00015069607,0.00716338,0.00019641113,0.00011013884,0.00012072968,0.000111100744,0.88259107,0.001791243,0.026441008,0.005159458,0.075924255],"study_design_scores_gemma":[0.0000047306403,0.000012612899,0.0005117357,0.000010573715,0.00001026714,0.000022224152,0.000013169434,0.9839087,0.0003978331,0.014628045,0.00047422785,0.0000058199134],"about_ca_topic_score_codex":0.020909714,"about_ca_topic_score_gemma":0.022286024,"teacher_disagreement_score":0.020909714,"about_ca_system_score_codex":0.0017684941,"about_ca_system_score_gemma":0.00093718286,"threshold_uncertainty_score":0.041576028},"labels":[],"label_agreement":null},{"id":"W4399765342","doi":"10.1101/2024.06.17.599219","title":"Path-based reasoning for biomedical knowledge graphs with BioPathNet","year":2024,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Advanced Graph Neural Networks","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":"Canadian Institute for Advanced Research; HEC Montréal; Université de Montréal; Mila - Quebec Artificial Intelligence Institute; Cegep Edouard Montpetit","funders":"Bundesministerium für Bildung und Forschung; National Institutes of Health; Joachim Herz Stiftung","keywords":"Path (computing); Knowledge graph; Computer science; Artificial intelligence; Data science; Programming language","score_opus":0.01147742921684764,"score_gpt":0.2321011121363298,"score_spread":0.22062368291948217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399765342","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.01689561,0.0009597106,0.96015155,0.0014920915,0.00017873339,0.00023559711,0.0075358613,0.009092078,0.003458794],"genre_scores_gemma":[0.28810972,0.0013795032,0.68500036,0.0009444104,0.000116440046,0.00059034687,0.019781077,0.0005394808,0.003538702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993863,0.00015594099,0.000054713815,0.0002249052,0.00015004378,0.000028184677],"domain_scores_gemma":[0.9972383,0.0018652808,0.0002228778,0.00027870358,0.0003205198,0.000074293835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011567522,0.0011880831,0.0005088984,0.003063076,0.0006370315,0.0013949602,0.0014430864,0.0012157677,0.0061403066],"category_scores_gemma":[0.0081050005,0.0005118574,0.001444,0.0015136076,0.000668987,0.0028275023,0.0014852243,0.0016920965,0.000963927],"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.00019509223,0.0001586065,0.003755749,0.0011369368,0.00018085472,0.0006149315,0.0003894902,0.5633383,0.0035855998,0.08563313,0.023228452,0.31778288],"study_design_scores_gemma":[0.000022537906,0.000024087054,0.00022661067,0.00007038594,0.000034541958,0.00006350246,0.00003731537,0.90746486,0.0015864751,0.08022683,0.010231371,0.000011343768],"about_ca_topic_score_codex":0.013961658,"about_ca_topic_score_gemma":0.026285771,"teacher_disagreement_score":0.013961658,"about_ca_system_score_codex":0.0016680364,"about_ca_system_score_gemma":0.0016743955,"threshold_uncertainty_score":0.027760804},"labels":[],"label_agreement":null},{"id":"W4400153839","doi":"10.1007/978-3-031-60916-9_6","title":"Results","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in social networks","topic":"Advanced Graph Neural Networks","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":"Queen's University","funders":"","keywords":"Computer science","score_opus":0.015864227008432284,"score_gpt":0.25743416079707465,"score_spread":0.24156993378864236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400153839","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.016741917,0.0034435766,0.032123372,0.007867311,0.0049178624,0.0038095876,0.071938686,0.0028728591,0.8562848],"genre_scores_gemma":[0.17444529,0.004807348,0.031727422,0.022463942,0.0019378517,0.015325372,0.09408483,0.0047499067,0.6504581],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99463767,0.0011338828,0.00029976873,0.0012827169,0.0018315017,0.0008144775],"domain_scores_gemma":[0.99360305,0.0015658917,0.00031730044,0.0014930019,0.0021825624,0.0008380827],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0063264845,0.0014516106,0.0008877656,0.002934984,0.00265295,0.0043751234,0.0021092924,0.0017787598,0.3786025],"category_scores_gemma":[0.022825928,0.00034329787,0.001426516,0.0018892859,0.0017226697,0.0017776358,0.0031627843,0.0016749272,0.21719354],"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.0027303454,0.0008142296,0.010172748,0.0018455607,0.00015698481,0.0007802844,0.0010892043,0.00079993217,0.0022980731,0.087129965,0.5897153,0.30246738],"study_design_scores_gemma":[0.00017950943,0.0002287267,0.0029985022,0.00071749184,0.00009978387,0.0007335592,0.00077117706,0.00023799397,0.002185661,0.026040189,0.9657746,0.00003287515],"about_ca_topic_score_codex":0.0032536925,"about_ca_topic_score_gemma":0.0037837066,"teacher_disagreement_score":0.6213975,"about_ca_system_score_codex":0.002251577,"about_ca_system_score_gemma":0.005225616,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4400439379","doi":"10.31219/osf.io/9wk3y","title":"Graph Neural Network, ChebNet, Graph Convolutional Network, and Graph Autoencoder: Tutorial and Survey","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Neural Networks","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":"Voltage graph; Autoencoder; Butterfly graph; Null graph; Computer science; Line graph; Graph; Simplex graph; Strength of a graph; Complement graph; Quartic graph; Theoretical computer science; Artificial intelligence; Deep learning","score_opus":0.024025942943237916,"score_gpt":0.2560355513376157,"score_spread":0.23200960839437776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400439379","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.008485572,0.32140732,0.6282275,0.0023235062,0.001976285,0.00008238228,0.00069982477,0.0010995156,0.035698056],"genre_scores_gemma":[0.14011054,0.530177,0.28450853,0.0020246627,0.0041509164,0.00036682122,0.0026338273,0.0007724773,0.035255287],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997322,0.00005656205,0.000021662907,0.000087559994,0.00008308186,0.00001886541],"domain_scores_gemma":[0.9995958,0.00024856016,0.000024003291,0.000034103523,0.00007767816,0.000019889752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005554458,0.0012697551,0.000849151,0.0013905494,0.00023808953,0.00092185783,0.00081452104,0.001334012,0.0045511466],"category_scores_gemma":[0.0013285966,0.00053338695,0.00057389797,0.0030925528,0.00076970947,0.0026931711,0.0007164191,0.0018566232,0.0020846685],"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.00007944981,0.00014660237,0.0010547497,0.00336926,0.00014894226,0.00021509279,0.000190594,0.04789212,0.0040347194,0.21986598,0.04204188,0.68096066],"study_design_scores_gemma":[0.000017147224,0.00020623801,0.0022319283,0.0006908889,0.00012758926,0.0011992333,0.00012733752,0.2640177,0.005231738,0.36841333,0.35761687,0.00011999455],"about_ca_topic_score_codex":0.0027769436,"about_ca_topic_score_gemma":0.0027257446,"teacher_disagreement_score":0.0045511466,"about_ca_system_score_codex":0.00082779274,"about_ca_system_score_gemma":0.00071659865,"threshold_uncertainty_score":0.015225112},"labels":[],"label_agreement":null},{"id":"W4400726464","doi":"10.1093/bioadv/vbae097","title":"Knowledge graph embeddings in the biomedical domain: are they useful? A look at link prediction, rule learning, and downstream polypharmacy tasks","year":2024,"lang":"en","type":"review","venue":"Bioinformatics Advances","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":16,"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 Victoria","funders":"Instituto de Ciencias del Mar y Limnología, Universidad Nacional Autónoma de México; Engineering and Physical Sciences Research Council; UK Research and Innovation; Institute for Catastrophic Loss Reduction; Science and Technology Facilities Council; European Commission; Dell EMC; Accenture; Cisco Systems","keywords":"Computer science; Interpretability; Embedding; Machine learning; Artificial intelligence; Knowledge graph; Field (mathematics); Downstream (manufacturing); Graph; Data science; Theoretical computer science","score_opus":0.021973077866220783,"score_gpt":0.3223211017238577,"score_spread":0.3003480238576369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400726464","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.3388295,0.009167101,0.58529186,0.018479872,0.0009908555,0.000658032,0.010474207,0.019622026,0.016486643],"genre_scores_gemma":[0.50502366,0.003715019,0.46772912,0.0015065123,0.00018682043,0.0003505219,0.01653469,0.0009758081,0.0039778226],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990282,0.00044293798,0.00006511956,0.0001962682,0.00021044961,0.000056970093],"domain_scores_gemma":[0.9906669,0.006618336,0.00045197972,0.001232341,0.0007428924,0.0002874495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028954728,0.00086309656,0.0004769985,0.0011708188,0.00042528316,0.0015227079,0.0013180182,0.001545793,0.0051102615],"category_scores_gemma":[0.022895386,0.00037629838,0.0006591138,0.0013215824,0.0008543758,0.004387149,0.0015196558,0.0022568817,0.0015715387],"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.0008448013,0.00088041485,0.022041868,0.0013708909,0.000202047,0.00071999495,0.0005147214,0.37406698,0.0048298268,0.023804402,0.055711687,0.5150124],"study_design_scores_gemma":[0.00010826931,0.00018559785,0.0020391936,0.00021789724,0.000048570462,0.0002533343,0.00020030742,0.9251048,0.0059155533,0.050488062,0.015401085,0.00003734511],"about_ca_topic_score_codex":0.0057619675,"about_ca_topic_score_gemma":0.0096308915,"teacher_disagreement_score":0.0057619675,"about_ca_system_score_codex":0.00097082707,"about_ca_system_score_gemma":0.0013027603,"threshold_uncertainty_score":0.017095506},"labels":[],"label_agreement":null},{"id":"W4400909954","doi":"10.1109/icde60146.2024.00027","title":"Graph Contrastive Learning for Truth Inference","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Inference; Artificial intelligence; Graph; Natural language processing; Theoretical computer science","score_opus":0.016924933562651567,"score_gpt":0.2879953825098143,"score_spread":0.27107044894716276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400909954","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.004691363,0.00030490893,0.9919017,0.00035709952,0.000048882248,0.00006397202,0.00029499282,0.0013384765,0.000998662],"genre_scores_gemma":[0.39133167,0.000521419,0.5978301,0.000945367,0.00028783546,0.000365557,0.0038201106,0.00084792025,0.0040500206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961467,0.0013614235,0.000112525646,0.0015524578,0.00063967716,0.00018716886],"domain_scores_gemma":[0.9879753,0.0075697894,0.00086053275,0.0022294375,0.0010375597,0.00032727866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050875954,0.0023673398,0.0017592652,0.0033085397,0.001488466,0.0021141637,0.00502462,0.0033183487,0.0050621475],"category_scores_gemma":[0.027598519,0.0010707445,0.0018316794,0.002248213,0.003503412,0.005556516,0.0038139632,0.0057156654,0.0017623889],"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.00039855295,0.0002858117,0.0033764883,0.0005245879,0.00023857379,0.00034832198,0.00056628295,0.53367317,0.006239729,0.14994197,0.016432328,0.28797427],"study_design_scores_gemma":[0.000024758172,0.000033023633,0.00018021652,0.000031361913,0.000018829529,0.000038721406,0.0000318958,0.84521323,0.0018150946,0.15051639,0.002082817,0.000013656289],"about_ca_topic_score_codex":0.0060017435,"about_ca_topic_score_gemma":0.011432482,"teacher_disagreement_score":0.0060017435,"about_ca_system_score_codex":0.0029331648,"about_ca_system_score_gemma":0.0021288078,"threshold_uncertainty_score":0.026906133},"labels":[],"label_agreement":null},{"id":"W4401023415","doi":"10.24963/ijcai.2024/960","title":"GATES: Cost-aware Dynamic Workflow Scheduling via Graph Attention Networks and Evolution Strategy","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Artificial intelligence; Graph; Artificial neural network; Natural language processing; Cognitive science; Theoretical computer science; Psychology","score_opus":0.009886258434646859,"score_gpt":0.25274345691565603,"score_spread":0.24285719848100917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401023415","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.037618272,0.0007050914,0.95332986,0.0007122118,0.00013999375,0.000088194065,0.00020961025,0.0022134727,0.004983371],"genre_scores_gemma":[0.8624485,0.00046343787,0.12880003,0.0005700509,0.00009023894,0.00016393434,0.00052593136,0.00028656688,0.0066513605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999689,0.00007137623,0.000012819198,0.0000893475,0.0000675359,0.000069838396],"domain_scores_gemma":[0.9993861,0.00033838805,0.00006545657,0.00005396004,0.00009288501,0.0000632686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005823278,0.0010442093,0.0008324375,0.000651362,0.00032814004,0.0007354866,0.0016602189,0.0009931504,0.0028935957],"category_scores_gemma":[0.0023782663,0.0004254707,0.0005365566,0.00060780015,0.0006425988,0.0012900789,0.0010309987,0.0012387437,0.00040100788],"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.000069978254,0.000070345995,0.00085829257,0.000064202184,0.000038791473,0.00006554636,0.000038015936,0.8854336,0.0020396407,0.009330016,0.0035978854,0.09839365],"study_design_scores_gemma":[0.000004541697,0.000009017437,0.000044186338,0.0000024871067,0.000004242582,0.000005897048,0.000002342114,0.9966658,0.00020735065,0.0028111227,0.00024112489,0.0000019149422],"about_ca_topic_score_codex":0.014444553,"about_ca_topic_score_gemma":0.01613796,"teacher_disagreement_score":0.014444553,"about_ca_system_score_codex":0.001691122,"about_ca_system_score_gemma":0.0018628103,"threshold_uncertainty_score":0.028720975},"labels":[],"label_agreement":null},{"id":"W4401025067","doi":"10.24963/ijcai.2024/388","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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 Windsor","funders":"Mitacs","keywords":"Embedding; Scalability; Computer science; Constellation; Graph; Theoretical computer science; Artificial intelligence; Database; Physics","score_opus":0.011449786905889476,"score_gpt":0.23726997838516783,"score_spread":0.22582019147927837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401025067","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.01464225,0.00033802868,0.980988,0.00012227467,0.00007917053,0.00006221075,0.0000938151,0.0018025035,0.001871683],"genre_scores_gemma":[0.32767886,0.0003562557,0.66780126,0.0002339199,0.00005481643,0.00017959789,0.00057220465,0.0005656083,0.0025574886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994247,0.00008313872,0.000032237505,0.00016234905,0.00022551502,0.000072022034],"domain_scores_gemma":[0.99922204,0.00022905486,0.000073533534,0.00023267238,0.00016275216,0.00008006134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004684752,0.0009928865,0.0012075589,0.001292647,0.000766673,0.0010377201,0.0016796011,0.00080456684,0.0023438302],"category_scores_gemma":[0.0022235983,0.00044020684,0.00086271134,0.0014889289,0.0009117559,0.0016619177,0.0015811822,0.0011813956,0.00071365654],"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.00025436276,0.00010156856,0.0016331598,0.00033089772,0.00008737748,0.0003091668,0.00034479325,0.67598385,0.02373965,0.037021775,0.010135116,0.25005832],"study_design_scores_gemma":[0.000020942498,0.000022155788,0.00018824339,0.000009344278,0.000010049326,0.00004544811,0.00003492629,0.9808559,0.0023765578,0.013823526,0.0025992778,0.000013534304],"about_ca_topic_score_codex":0.012887553,"about_ca_topic_score_gemma":0.016204141,"teacher_disagreement_score":0.012887553,"about_ca_system_score_codex":0.0010356589,"about_ca_system_score_gemma":0.0010739015,"threshold_uncertainty_score":0.02562511},"labels":[],"label_agreement":null},{"id":"W4401114094","doi":"10.1109/tnse.2024.3435839","title":"GAXG: A Global and Self-Adaptive Optimal Graph Topology Generation Framework for Explaining Graph Neural Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Advanced Graph Neural Networks","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":"Computer science; Topology (electrical circuits); Graph; Topological graph theory; Artificial neural network; Mathematics; Theoretical computer science; Voltage graph; Artificial intelligence; Line graph; Combinatorics","score_opus":0.014399628574331453,"score_gpt":0.2477316796725518,"score_spread":0.23333205109822036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401114094","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.0077029103,0.0002584151,0.98812824,0.0003364892,0.000028370343,0.00008766477,0.0002836522,0.0019645053,0.0012097998],"genre_scores_gemma":[0.2444977,0.0005545271,0.74802583,0.00038357486,0.00007788494,0.000452444,0.002005152,0.00082617364,0.0031767543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999559,0.00017309791,0.000014563722,0.00013350163,0.000090694266,0.000029218714],"domain_scores_gemma":[0.9985209,0.0009592182,0.0001218611,0.00018598084,0.00014869573,0.00006329321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011354575,0.0014322121,0.0007445861,0.0017852361,0.00071755913,0.0010470335,0.0022321832,0.0017333885,0.0052521257],"category_scores_gemma":[0.0054888865,0.00058188837,0.0015654655,0.0009882799,0.0009700177,0.0020405634,0.0015778773,0.001998844,0.00083365245],"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.0000661077,0.000076527656,0.0025832385,0.0002756006,0.00011696817,0.00027922427,0.00034876965,0.76424694,0.0024379028,0.07111593,0.009212372,0.14924042],"study_design_scores_gemma":[0.000012734799,0.00001951836,0.00013832323,0.000018485216,0.000013406523,0.000046810233,0.000029979641,0.94711274,0.00045844732,0.05037422,0.001767943,0.000007318233],"about_ca_topic_score_codex":0.004981395,"about_ca_topic_score_gemma":0.011347641,"teacher_disagreement_score":0.0052521257,"about_ca_system_score_codex":0.001154131,"about_ca_system_score_gemma":0.0014082319,"threshold_uncertainty_score":0.017570078},"labels":[],"label_agreement":null},{"id":"W4401596715","doi":"10.1109/access.2024.3443533","title":"INFLECT-DGNN: Influencer Prediction With Dynamic Graph Neural Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Access","topic":"Advanced Graph Neural Networks","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":"Western University","funders":"Alliance de recherche numérique du Canada; Canada Research Chairs","keywords":"Computer science; Artificial neural network; Artificial intelligence","score_opus":0.011190684527242988,"score_gpt":0.28080894994596445,"score_spread":0.26961826541872147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401596715","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.16082244,0.0019253573,0.8214122,0.0014124223,0.00025431468,0.0001592001,0.0017082513,0.0054486794,0.0068572173],"genre_scores_gemma":[0.90427613,0.00043858628,0.08818723,0.00037470867,0.00015498004,0.00010123403,0.002383944,0.00024143246,0.00384174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996259,0.000096855816,0.000017473587,0.00013239049,0.00007586121,0.000051353618],"domain_scores_gemma":[0.99870265,0.0007280749,0.00015371268,0.00016517722,0.0001857768,0.00006466027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009934268,0.0011288035,0.0007273912,0.0012463892,0.00031441668,0.0009223735,0.00159806,0.0011596803,0.0015380234],"category_scores_gemma":[0.0043711946,0.00037617068,0.0006857998,0.0011080628,0.00047303297,0.0016368491,0.0007861647,0.0015633807,0.00063061056],"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.00011160532,0.00015639911,0.0069613713,0.0000578038,0.00010048047,0.000110317815,0.000049821676,0.86178946,0.001232524,0.0045985,0.005644677,0.11918699],"study_design_scores_gemma":[0.00000227071,0.000006853459,0.00018501561,0.0000029065905,0.0000036798608,0.000005762573,0.00000246233,0.9975508,0.00018721457,0.0018687787,0.00018166115,0.0000025209272],"about_ca_topic_score_codex":0.013125199,"about_ca_topic_score_gemma":0.02309872,"teacher_disagreement_score":0.013125199,"about_ca_system_score_codex":0.0012832633,"about_ca_system_score_gemma":0.00063969387,"threshold_uncertainty_score":0.026097655},"labels":[],"label_agreement":null},{"id":"W4401747735","doi":"10.1109/tsp.2024.3446453","title":"Spectral Graph Learning With Core Eigenvectors Prior via Iterative GLASSO and Projection","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Graph Neural Networks","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":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Eigenvalues and eigenvectors; Computer science; Graph; Spectral graph theory; Projection (relational algebra); Core (optical fiber); Iterative method; Artificial intelligence; Mathematics; Algorithm; Theoretical computer science; Voltage graph; Telecommunications; Physics; Line graph","score_opus":0.015915706547275296,"score_gpt":0.2551145788556691,"score_spread":0.23919887230839382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401747735","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.0029105542,0.000118645774,0.99504614,0.00016198793,0.000025353316,0.000031799515,0.00007411717,0.0007853162,0.0008461828],"genre_scores_gemma":[0.14611277,0.00048318665,0.843619,0.00039562024,0.00013119465,0.00027903653,0.0013666841,0.0007389943,0.0068735313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990144,0.00028490575,0.00003777602,0.00029006932,0.00025611962,0.000116767515],"domain_scores_gemma":[0.9983767,0.0007385134,0.00011375805,0.00037286297,0.00027912925,0.00011897833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014045361,0.0017971001,0.001666737,0.0017215867,0.0007455535,0.0013153896,0.0020733115,0.0018520241,0.004823309],"category_scores_gemma":[0.005699183,0.0009615083,0.0014123564,0.0020112244,0.0019379125,0.002355475,0.0025005843,0.0028862003,0.0029407972],"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.0002497393,0.00016373742,0.00090227,0.00027230207,0.00013607398,0.0001374121,0.00021860855,0.49594206,0.0071992753,0.067380615,0.015671924,0.41172603],"study_design_scores_gemma":[0.000012994706,0.000019849853,0.00011003895,0.00001258299,0.000009035701,0.00003106554,0.000017898214,0.96829224,0.0013994923,0.02855196,0.0015296926,0.000013135738],"about_ca_topic_score_codex":0.010686748,"about_ca_topic_score_gemma":0.018319927,"teacher_disagreement_score":0.010686748,"about_ca_system_score_codex":0.0012334712,"about_ca_system_score_gemma":0.0034140118,"threshold_uncertainty_score":0.021249115},"labels":[],"label_agreement":null},{"id":"W4402078490","doi":"10.1007/s10489-024-05767-6","title":"Temporal knowledge graph reasoning based on evolutional representation and contrastive learning","year":2024,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Advanced Graph Neural Networks","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 Waterloo","funders":"","keywords":"Computer science; Graph; Representation (politics); Artificial intelligence; Knowledge representation and reasoning; Knowledge graph; Natural language processing; Theoretical computer science","score_opus":0.017138245874816858,"score_gpt":0.28678469990661604,"score_spread":0.26964645403179915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402078490","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.035195515,0.00017362557,0.9592623,0.00044689863,0.000051565738,0.00008882307,0.00026366164,0.0006153999,0.003902152],"genre_scores_gemma":[0.6464141,0.00021363024,0.3496875,0.00019193516,0.000049525803,0.000093987575,0.00069906283,0.00010355804,0.0025466143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928916,0.00014421192,0.00005303571,0.00025372987,0.00020487678,0.000055003027],"domain_scores_gemma":[0.998126,0.0010305909,0.00016317476,0.00030652861,0.00029339764,0.00008036229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008531953,0.0004478938,0.0005153322,0.0016965558,0.0006207896,0.0015524928,0.0019526082,0.00084418425,0.0032857223],"category_scores_gemma":[0.0058965865,0.00030393276,0.0013096218,0.001110708,0.0011699877,0.004678764,0.0013503548,0.001487907,0.0002911607],"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.00033076704,0.0003539335,0.0036294102,0.00033691662,0.0002602851,0.0006004837,0.0006228116,0.19762559,0.011833112,0.40697914,0.0057669226,0.37166065],"study_design_scores_gemma":[0.000015295698,0.000022833818,0.00040578263,0.000021152053,0.00005099636,0.000069961294,0.000045880075,0.80973315,0.0028439271,0.18530433,0.0014722164,0.000014423677],"about_ca_topic_score_codex":0.007814598,"about_ca_topic_score_gemma":0.009535893,"teacher_disagreement_score":0.007814598,"about_ca_system_score_codex":0.0011838987,"about_ca_system_score_gemma":0.00095803343,"threshold_uncertainty_score":0.015538216},"labels":[],"label_agreement":null},{"id":"W4403311984","doi":"10.1016/j.neunet.2024.106793","title":"Generalization limits of Graph Neural Networks in identity effects learning","year":2024,"lang":"en","type":"article","venue":"Neural Networks","topic":"Advanced Graph Neural Networks","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":"Concordia University","funders":"Fonds de Recherche du Québec - Santé; Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec – Nature et technologies; Gruppo Nazionale per il Calcolo Scientifico; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Generalization; Computer science; Artificial neural network; Graph; Artificial intelligence; Machine learning; Mathematics; Theoretical computer science","score_opus":0.011614713910497529,"score_gpt":0.2606296068351501,"score_spread":0.24901489292465254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403311984","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.27995682,0.0012552978,0.7051479,0.002988564,0.00010372812,0.00016955897,0.00031912784,0.0005346435,0.00952439],"genre_scores_gemma":[0.9518237,0.0006250804,0.044392157,0.0004973382,0.000119590426,0.00025706296,0.0003107411,0.00010889174,0.0018654693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996673,0.0014291806,0.0001816431,0.0008868367,0.00054337375,0.0002859719],"domain_scores_gemma":[0.9587375,0.03373399,0.0022886004,0.0027265393,0.0015390534,0.0009743345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007012098,0.00096456736,0.0014230439,0.00143719,0.0011647136,0.0018189272,0.0024744633,0.002356689,0.0024354567],"category_scores_gemma":[0.047564514,0.0007604872,0.0017261344,0.00073494576,0.00591031,0.0077118534,0.0044696825,0.0049305283,0.00025920692],"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.00024759976,0.00014334008,0.0060776146,0.00032419042,0.0001441655,0.00032970178,0.00064223167,0.4052167,0.0026908347,0.5485172,0.0015659372,0.034100585],"study_design_scores_gemma":[0.000014654042,0.00006661113,0.0005050267,0.000030367764,0.000014014091,0.00006208242,0.000049070037,0.6395731,0.00072317146,0.35862294,0.00031785425,0.000021109712],"about_ca_topic_score_codex":0.0028349038,"about_ca_topic_score_gemma":0.0022375516,"teacher_disagreement_score":0.007012098,"about_ca_system_score_codex":0.002311622,"about_ca_system_score_gemma":0.0010494671,"threshold_uncertainty_score":0.037083983},"labels":[],"label_agreement":null},{"id":"W4403577871","doi":"10.1145/3627673.3679993","title":"Scalable Expressiveness through Preprocessed Graph Perturbations","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Ontario Tech University","funders":"","keywords":"Computer science; Scalability; Graph; Theoretical computer science; Operating system","score_opus":0.018489294763549376,"score_gpt":0.2705262755106895,"score_spread":0.2520369807471401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403577871","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.07814366,0.00026516014,0.89870495,0.0007112151,0.00010568708,0.00022185025,0.0006154784,0.016893573,0.004338457],"genre_scores_gemma":[0.59641635,0.0003613432,0.39509118,0.00039041354,0.000053807722,0.00036672148,0.0018306876,0.0023451233,0.0031443557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983027,0.00043862936,0.000108191125,0.0005276854,0.0005063662,0.00011642689],"domain_scores_gemma":[0.9944852,0.0023401268,0.0002911664,0.0023962404,0.00037887334,0.00010831806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018943946,0.001546027,0.0007273933,0.0006922626,0.00047447215,0.0014035894,0.0030623013,0.0010148359,0.003083595],"category_scores_gemma":[0.011796844,0.00074437616,0.0011348531,0.0007821468,0.0014366733,0.004874291,0.0026171308,0.0027435592,0.0010135787],"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.00037512486,0.00022140432,0.002634446,0.000421931,0.00011916062,0.0005013453,0.00043300315,0.71553373,0.06232261,0.03717193,0.0066679684,0.17359723],"study_design_scores_gemma":[0.000021969368,0.0000518951,0.00017043293,0.000013190026,0.000018267901,0.00009626623,0.00004769061,0.94507885,0.0152631495,0.03702864,0.0021959965,0.000013635329],"about_ca_topic_score_codex":0.0019682513,"about_ca_topic_score_gemma":0.0035500186,"teacher_disagreement_score":0.003083595,"about_ca_system_score_codex":0.00089257053,"about_ca_system_score_gemma":0.00096845144,"threshold_uncertainty_score":0.010315597},"labels":[],"label_agreement":null},{"id":"W4403582733","doi":"10.1145/3627673.3679541","title":"A Geometric Perspective for High-Dimensional Multiplex Graphs","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Neural Networks","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","funders":"","keywords":"Embedding; Theoretical computer science; Computer science; Multiplex; Graph; Rendering (computer graphics); Topological graph theory; Topology (electrical circuits); Mathematics; Artificial intelligence; Voltage graph; Line graph; Combinatorics","score_opus":0.021853325448949405,"score_gpt":0.2857924850907185,"score_spread":0.26393915964176906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403582733","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.045101937,0.00031142848,0.9509689,0.0003547678,0.00003415566,0.000026442855,0.00016393326,0.00028323883,0.0027551842],"genre_scores_gemma":[0.7106476,0.0008657417,0.28149536,0.0002617398,0.00010486764,0.00010550634,0.0005460295,0.00019416453,0.0057789693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961346,0.00013039442,0.000018242301,0.00011531469,0.00009511788,0.000027511318],"domain_scores_gemma":[0.9989869,0.00032522436,0.00017487124,0.0002942585,0.00013888656,0.00007993441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047722386,0.000899293,0.00034849078,0.0010712097,0.00047285258,0.0011307019,0.0007228164,0.0007053726,0.0029839878],"category_scores_gemma":[0.0030820828,0.0003340352,0.0004687269,0.0010036315,0.0013921148,0.003592351,0.0017691102,0.0014503414,0.0005070485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015603246,0.000073856085,0.0034097126,0.00029059744,0.000074737356,0.00033956367,0.000618201,0.19448608,0.021620236,0.5886828,0.00475612,0.18549211],"study_design_scores_gemma":[0.000009189823,0.000061980776,0.0010579277,0.000034151726,0.000021450256,0.00026837498,0.000176081,0.699721,0.004561452,0.28715545,0.0069062044,0.000026780854],"about_ca_topic_score_codex":0.0010312285,"about_ca_topic_score_gemma":0.0015996334,"teacher_disagreement_score":0.0029839878,"about_ca_system_score_codex":0.00063989084,"about_ca_system_score_gemma":0.000315479,"threshold_uncertainty_score":0.009982407},"labels":[],"label_agreement":null},{"id":"W4403722234","doi":"10.1109/tpami.2024.3486319","title":"Ensemble-Enhanced Semi-Supervised Learning With Optimized Graph Construction for High-Dimensional Data","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Pattern Analysis and Machine Intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; Guangzhou Municipal Science and Technology Project; National Natural Science Foundation of China","keywords":"Computer science; Artificial intelligence; Ensemble learning; Graph; Machine learning; Semi-supervised learning; Pattern recognition (psychology); Theoretical computer science","score_opus":0.021512568547704728,"score_gpt":0.26880601588712194,"score_spread":0.24729344733941722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403722234","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.013243907,0.00026391103,0.9847868,0.00007882899,0.000023772593,0.000028812388,0.00007476794,0.0010432289,0.00045594518],"genre_scores_gemma":[0.4177653,0.00055365986,0.5761297,0.00023986542,0.00010204454,0.0002899857,0.0019732402,0.00041632127,0.0025298998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861085,0.0004538633,0.00005817494,0.00039578034,0.00038708525,0.00009409545],"domain_scores_gemma":[0.99777776,0.00081518013,0.00020918493,0.0005597695,0.0005402655,0.00009783649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013606048,0.001389073,0.0016802297,0.001567226,0.000642016,0.0007834414,0.0019559052,0.0011185218,0.00097235263],"category_scores_gemma":[0.003707163,0.00047700285,0.0012532108,0.0018838429,0.0008322809,0.0021421197,0.0015318459,0.0017838377,0.000617111],"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.000112196154,0.00015983498,0.0024746486,0.00016166264,0.00020878912,0.00010490005,0.00017870478,0.52160245,0.009850104,0.010117841,0.0053736945,0.44965512],"study_design_scores_gemma":[0.000004204969,0.000023375884,0.000184247,0.0000034968468,0.000009353149,0.000024026842,0.000012021347,0.993129,0.0012736137,0.0047316356,0.00059703225,0.000008019743],"about_ca_topic_score_codex":0.0045577665,"about_ca_topic_score_gemma":0.0073321643,"teacher_disagreement_score":0.0045577665,"about_ca_system_score_codex":0.00066059694,"about_ca_system_score_gemma":0.00116861,"threshold_uncertainty_score":0.009062469},"labels":[],"label_agreement":null},{"id":"W4403944000","doi":"10.1016/j.ipm.2024.103942","title":"Spatial and temporal twin-guided pattern recurrent graph network for implementing reasoning of spatiotemporal knowledge graph","year":2024,"lang":"en","type":"article","venue":"Information Processing & Management","topic":"Advanced Graph Neural Networks","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":"Novelis (Canada)","funders":"","keywords":"Computer science; Graph; Knowledge graph; Theoretical computer science; Artificial intelligence","score_opus":0.020325392549721537,"score_gpt":0.29244897607838305,"score_spread":0.2721235835286615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403944000","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.040329833,0.00014229336,0.95552397,0.00018164398,0.00005362743,0.0000526372,0.00029631038,0.0015232874,0.001896419],"genre_scores_gemma":[0.7442791,0.0001784787,0.25089946,0.000096800286,0.000020158228,0.00008129835,0.0007492688,0.00012130807,0.003574229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997092,0.000042160565,0.000023775783,0.00012143696,0.00006970054,0.000033625773],"domain_scores_gemma":[0.9995316,0.00013448214,0.00004501685,0.0001176933,0.00012800684,0.00004316835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041886518,0.00040827817,0.0005622507,0.00067167555,0.0004280232,0.00074109616,0.0017325594,0.00066036376,0.003112988],"category_scores_gemma":[0.0019967507,0.000289256,0.00069028424,0.00078807515,0.0004894069,0.0019656902,0.0010699686,0.00092816196,0.00036449294],"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.00041175634,0.00025068695,0.0033805226,0.00021678436,0.00016674939,0.00038332888,0.00036473604,0.51911885,0.021037899,0.08916946,0.005846793,0.35965246],"study_design_scores_gemma":[0.0000046195387,0.000014592589,0.00012892285,0.0000027514898,0.000014858409,0.000015501822,0.000012477537,0.9835699,0.0011560203,0.014673411,0.0004024483,0.000004492102],"about_ca_topic_score_codex":0.017883116,"about_ca_topic_score_gemma":0.023720872,"teacher_disagreement_score":0.017883116,"about_ca_system_score_codex":0.00078500324,"about_ca_system_score_gemma":0.0011618563,"threshold_uncertainty_score":0.035558045},"labels":[],"label_agreement":null},{"id":"W4404292014","doi":"10.1007/s40747-024-01626-6","title":"Unveiling user identity across social media: a novel unsupervised gradient semantic model for accurate and efficient user alignment","year":2024,"lang":"en","type":"article","venue":"Complex & Intelligent Systems","topic":"Advanced Graph Neural Networks","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":"Computational intelligence; Identity (music); Computer science; Social media; Artificial intelligence; Human–computer interaction; World Wide Web; Physics","score_opus":0.10032716332197056,"score_gpt":0.3376359452917495,"score_spread":0.23730878196977895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404292014","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.086750135,0.00032395648,0.90919524,0.000459861,0.00005318741,0.00010545137,0.0002996708,0.0011154165,0.0016970991],"genre_scores_gemma":[0.86186844,0.00017027813,0.13395527,0.00021688847,0.00005857728,0.00018992202,0.00079044054,0.00017156324,0.002578556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916506,0.00028427236,0.0000484915,0.0002685434,0.00014360584,0.00008998493],"domain_scores_gemma":[0.99921405,0.0003472846,0.00010847977,0.00009760634,0.00017123258,0.00006123282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012860665,0.0008602394,0.0009786041,0.0016039365,0.0005376734,0.0010782927,0.0016111163,0.0012767141,0.0011753539],"category_scores_gemma":[0.003267159,0.0004150332,0.0009978471,0.0012370764,0.00084009283,0.002509059,0.0011762388,0.0013025947,0.00069366954],"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.00070656836,0.00053546234,0.015246777,0.00017034671,0.00020903109,0.0002762258,0.0007911391,0.61090237,0.008418966,0.035085216,0.0051153074,0.3225427],"study_design_scores_gemma":[0.0000029958194,0.00001361292,0.00034654618,0.0000032586586,0.000004153346,0.000012094104,0.000015260526,0.99495786,0.0002807412,0.004125519,0.00023328798,0.000004636345],"about_ca_topic_score_codex":0.009985371,"about_ca_topic_score_gemma":0.009973433,"teacher_disagreement_score":0.009985371,"about_ca_system_score_codex":0.0010636395,"about_ca_system_score_gemma":0.00097238313,"threshold_uncertainty_score":0.019854486},"labels":[],"label_agreement":null},{"id":"W4404346969","doi":"10.48550/arxiv.2410.23660","title":"Local Superior Soups: A Catalyst for Model Merging in Cross-Silo Federated Learning","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","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":"Alliance de recherche numérique du Canada; Natural Sciences and Engineering Research Council of Canada; Mitacs; Canadian Institute for Advanced Research; Nvidia","keywords":"Silo; Computer science; Business; Engineering; Mechanical engineering","score_opus":0.05321270480084002,"score_gpt":0.22365206452061548,"score_spread":0.17043935971977547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404346969","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.06168534,0.00033369983,0.9204484,0.0004962257,0.00010884906,0.00013160115,0.00033768202,0.013622357,0.002835694],"genre_scores_gemma":[0.59371716,0.00010091764,0.3977801,0.0005845316,0.00006334302,0.0002666066,0.0020764938,0.0015254401,0.0038853902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783903,0.00078438217,0.000093684386,0.0007004011,0.00032672912,0.00025570436],"domain_scores_gemma":[0.99519926,0.0012154697,0.00023041607,0.0026907867,0.0004120959,0.00025199735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046159565,0.0019977011,0.0016926611,0.0012915517,0.001681558,0.001896271,0.004488044,0.0024251023,0.003548737],"category_scores_gemma":[0.012213343,0.0010525445,0.0013914633,0.0012470316,0.0021570092,0.0046089836,0.0066177812,0.0038500107,0.0014969548],"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.00051140663,0.00039989533,0.0055390294,0.00014097993,0.0001938559,0.00029959806,0.000505679,0.7267782,0.0067292377,0.018908523,0.01393658,0.226057],"study_design_scores_gemma":[0.00001696116,0.000037917373,0.0001239004,0.000008914594,0.000010543694,0.000027959957,0.00003310715,0.9855752,0.0024612546,0.010553669,0.0011418662,0.000008674951],"about_ca_topic_score_codex":0.0064827325,"about_ca_topic_score_gemma":0.012181634,"teacher_disagreement_score":0.0064827325,"about_ca_system_score_codex":0.00147753,"about_ca_system_score_gemma":0.0021051182,"threshold_uncertainty_score":0.024411857},"labels":[],"label_agreement":null},{"id":"W4404638618","doi":"10.3390/make6040130","title":"Node-Centric Pruning: A Novel Graph Reduction Approach","year":2024,"lang":"en","type":"article","venue":"Machine Learning and Knowledge Extraction","topic":"Advanced Graph Neural Networks","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 New Brunswick","funders":"","keywords":"Computer science; Scalability; Pruning; Graph; Theoretical computer science; Node (physics); Distributed computing; Artificial intelligence; Machine learning; Engineering","score_opus":0.015621257278360324,"score_gpt":0.2815210943851965,"score_spread":0.2658998371068362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404638618","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.010451692,0.00033065284,0.98563784,0.0002168921,0.00006188591,0.00014271063,0.00012978322,0.00066707894,0.0023614317],"genre_scores_gemma":[0.12928249,0.00048004513,0.8632178,0.0002517523,0.00010678544,0.00021454677,0.00095528294,0.00043579369,0.00505564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988759,0.00023618744,0.00005655647,0.0002318282,0.00050242414,0.000097161945],"domain_scores_gemma":[0.99761236,0.0008779297,0.00023106775,0.000572106,0.0006014292,0.00010509497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000894694,0.0012105434,0.001020602,0.0027029715,0.0011295441,0.0009895171,0.002061981,0.00094673637,0.0018191922],"category_scores_gemma":[0.004817695,0.00044161058,0.001083307,0.001900011,0.00089216366,0.0016992157,0.0015771894,0.0014261792,0.0009948262],"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.00019462754,0.00030065925,0.0036702624,0.0005430981,0.000208021,0.0008019591,0.0005259933,0.19760351,0.05333295,0.06265429,0.019435404,0.6607292],"study_design_scores_gemma":[0.000041230935,0.0001779668,0.0012431118,0.00007794727,0.0001548268,0.00093428,0.00020535273,0.8833663,0.023002027,0.06351399,0.027241528,0.000041412688],"about_ca_topic_score_codex":0.0034557218,"about_ca_topic_score_gemma":0.008519548,"teacher_disagreement_score":0.0034557218,"about_ca_system_score_codex":0.00066680333,"about_ca_system_score_gemma":0.0017199519,"threshold_uncertainty_score":0.0068712234},"labels":[],"label_agreement":null},{"id":"W4404752338","doi":"10.18653/v1/2022.aacl-main.46","title":"A Decade of Knowledge Graphs in Natural Language Processing: A Survey","year":2022,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":37,"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":"Samsung; Bundesministerium für Bildung und Forschung; Canadian Institute for Advanced Research","keywords":"Computer science; Knowledge graph; Natural language processing; Natural language; Artificial intelligence","score_opus":0.01686055922491003,"score_gpt":0.28621518100072735,"score_spread":0.2693546217758173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404752338","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.0063492614,0.83052564,0.117614955,0.018596219,0.0016745116,0.000115248986,0.0010859644,0.00095568976,0.023082577],"genre_scores_gemma":[0.051503617,0.8608505,0.07026423,0.005464587,0.0031156326,0.00016779349,0.0024189977,0.00046083337,0.0057537085],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998365,0.00038973216,0.00015433348,0.00046565052,0.0005547759,0.00007051489],"domain_scores_gemma":[0.986094,0.011279452,0.00034708614,0.0008096366,0.0011990471,0.00027076376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003076886,0.0009956041,0.0013195944,0.0066980775,0.0009924165,0.0046648127,0.0022020778,0.0020895328,0.0054841046],"category_scores_gemma":[0.013312515,0.0009004231,0.00079937605,0.013107644,0.002497255,0.01587929,0.0024509204,0.002575635,0.0022272673],"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.00011821634,0.00014716625,0.0019213686,0.004770839,0.00010331112,0.00015202734,0.00066896685,0.0038354679,0.00049332215,0.10313679,0.048230384,0.83642215],"study_design_scores_gemma":[0.00002091558,0.00007337086,0.0016405965,0.0022383358,0.0000864722,0.00061209337,0.0008806447,0.012392019,0.0010848216,0.2696483,0.7112563,0.000066130546],"about_ca_topic_score_codex":0.004968955,"about_ca_topic_score_gemma":0.0054485463,"teacher_disagreement_score":0.0066980775,"about_ca_system_score_codex":0.0018353392,"about_ca_system_score_gemma":0.0023316403,"threshold_uncertainty_score":0.01834613},"labels":[],"label_agreement":null},{"id":"W4404804432","doi":"10.1016/j.procs.2024.09.513","title":"Temporal Graph Convolutional Network for Implicit Relation Prediction: Leveraging Timestamps and Confidence","year":2024,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Advanced Graph Neural Networks","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":"Computer science; Timestamp; Graph; Relation (database); Theoretical computer science; Artificial intelligence; Data mining; Real-time computing","score_opus":0.014880243094255117,"score_gpt":0.24786705197039122,"score_spread":0.2329868088761361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404804432","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.31099716,0.0036977646,0.66827965,0.0017618148,0.00030464184,0.00009948252,0.0035600401,0.002513329,0.008786162],"genre_scores_gemma":[0.9446636,0.00085633143,0.047959488,0.00018954871,0.00009133238,0.000048491554,0.002536862,0.00008472092,0.0035697632],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996451,0.0000696572,0.000020926118,0.00013764178,0.000081106875,0.00004543682],"domain_scores_gemma":[0.9985843,0.00064485706,0.00024150104,0.0002344162,0.00021093927,0.0000839674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085076224,0.0008682263,0.000525197,0.0013094704,0.00042272283,0.00086930196,0.0011843464,0.0008004504,0.0015951883],"category_scores_gemma":[0.0054667857,0.00026698672,0.0004918918,0.0015908018,0.00050359254,0.002958187,0.0010171623,0.0015013875,0.00055972533],"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.00063342875,0.00030722283,0.05367413,0.00034297508,0.00026719944,0.0003854952,0.0005162674,0.31592336,0.008481877,0.03786797,0.016354758,0.56524533],"study_design_scores_gemma":[0.00000679865,0.000035560435,0.0031679876,0.000033162567,0.000047386355,0.000086255546,0.000047501915,0.9718694,0.0018589277,0.020440377,0.0023885157,0.000018197392],"about_ca_topic_score_codex":0.011361313,"about_ca_topic_score_gemma":0.02386853,"teacher_disagreement_score":0.011361313,"about_ca_system_score_codex":0.0008725417,"about_ca_system_score_gemma":0.0007509317,"threshold_uncertainty_score":0.02259034},"labels":[],"label_agreement":null},{"id":"W4404848417","doi":"10.1109/icpads63350.2024.00039","title":"GraphFlow: A Fast and Accurate Distributed Streaming Graph Computation Model","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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 Toronto","funders":"","keywords":"Computer science; Computation; Graph; Theoretical computer science; Algorithm","score_opus":0.016043930320370287,"score_gpt":0.26547454072986143,"score_spread":0.24943061040949113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404848417","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.014493475,0.00038052406,0.97606987,0.0005926622,0.00013398028,0.00021050937,0.00079386256,0.005013186,0.0023118127],"genre_scores_gemma":[0.38751996,0.000955554,0.6029801,0.00034983055,0.00017267323,0.00049215736,0.0030718814,0.00056931516,0.003888562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992085,0.00011175831,0.000058585345,0.0002708587,0.00027190274,0.000078347715],"domain_scores_gemma":[0.99859434,0.00045389798,0.00010511989,0.0003737252,0.0003664006,0.00010655455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009855889,0.0010025153,0.00089068495,0.0011928815,0.0010612762,0.0015252896,0.002769589,0.00082997745,0.0023970522],"category_scores_gemma":[0.004284956,0.0005180577,0.00080855575,0.0018257091,0.000745847,0.0041856174,0.0013446003,0.0013624299,0.00055810105],"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.0005004193,0.00021154259,0.0034388937,0.00031244697,0.00012705458,0.0002957493,0.00025927837,0.65501606,0.009638704,0.093343884,0.03348925,0.20336667],"study_design_scores_gemma":[0.000025710568,0.000020090933,0.00011754425,0.0000047186372,0.000011571819,0.000035179735,0.0000126496525,0.9761505,0.0012358109,0.01940392,0.002972761,0.00000942466],"about_ca_topic_score_codex":0.015565845,"about_ca_topic_score_gemma":0.015018169,"teacher_disagreement_score":0.015565845,"about_ca_system_score_codex":0.0015036982,"about_ca_system_score_gemma":0.002640751,"threshold_uncertainty_score":0.030950487},"labels":[],"label_agreement":null},{"id":"W4404851210","doi":"10.1016/j.knosys.2024.112804","title":"Knowledge graph completion with low-dimensional gated hierarchical hyperbolic embedding","year":2024,"lang":"en","type":"article","venue":"Knowledge-Based Systems","topic":"Advanced Graph Neural Networks","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 Alberta","funders":"","keywords":"Embedding; Graph; Knowledge graph; Computer science; Mathematics; Theoretical computer science; Combinatorics; Artificial intelligence","score_opus":0.017097567532253083,"score_gpt":0.2735283302668388,"score_spread":0.25643076273458576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404851210","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.019439235,0.00024278715,0.9766029,0.00030244206,0.00005016067,0.00007975977,0.00044928095,0.0011631221,0.0016703625],"genre_scores_gemma":[0.62304413,0.00039253148,0.36656356,0.0002851651,0.00008214955,0.00018009645,0.0026025127,0.00025689945,0.0065929596],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928904,0.0001926358,0.000043699976,0.00024219594,0.0001593383,0.000072964096],"domain_scores_gemma":[0.9982711,0.0006737677,0.000107610744,0.0005630394,0.0002820215,0.000102508726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007196585,0.0007578957,0.0012106438,0.0010757794,0.00057576,0.0013004012,0.002224138,0.001468733,0.0051642098],"category_scores_gemma":[0.00455151,0.000497331,0.00097074563,0.0014076252,0.0010893963,0.003446035,0.002911961,0.002291375,0.0015730537],"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.00046050365,0.0003218607,0.001171284,0.00032943508,0.00014131036,0.00017081604,0.0002994746,0.44613525,0.0061408537,0.07881284,0.011942215,0.4540741],"study_design_scores_gemma":[0.000010559903,0.000022199947,0.00010946524,0.0000080753225,0.000009535421,0.000014762271,0.000022922284,0.96583784,0.0009806018,0.032302078,0.0006746724,0.000007287741],"about_ca_topic_score_codex":0.010896817,"about_ca_topic_score_gemma":0.011608967,"teacher_disagreement_score":0.010896817,"about_ca_system_score_codex":0.0009634996,"about_ca_system_score_gemma":0.0013434003,"threshold_uncertainty_score":0.021666765},"labels":[],"label_agreement":null},{"id":"W4404884737","doi":"10.1007/978-3-031-78128-5_8","title":"Interpretable Deep Graph-Level Clustering: A Prototype-Based Approach","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Neural Networks","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":"McMaster University","funders":"","keywords":"Computer science; Cluster analysis; Graph; Clustering coefficient; Artificial intelligence; Data mining; Theoretical computer science","score_opus":0.023210733518045895,"score_gpt":0.24756078590858913,"score_spread":0.22435005239054323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404884737","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.005811672,0.00016715299,0.9885466,0.00017344483,0.000033128326,0.000064015425,0.0004221663,0.0026855953,0.0020962683],"genre_scores_gemma":[0.2065289,0.00032172026,0.78461194,0.00020048609,0.000060583283,0.00014550536,0.0023443648,0.001036432,0.004750006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991478,0.00018245135,0.000041535557,0.00034215205,0.00021374566,0.00007225873],"domain_scores_gemma":[0.9983211,0.0005728145,0.00011238498,0.0005418687,0.00038843637,0.00006333464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000885189,0.0011990515,0.001341344,0.0020672362,0.0007336267,0.0024087767,0.004668088,0.002210547,0.008026438],"category_scores_gemma":[0.0042636143,0.0009783189,0.0015522134,0.002271144,0.0011563177,0.0037601672,0.0020652981,0.0026701323,0.002615446],"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.0003257914,0.00022522532,0.0010716725,0.00053263234,0.00017799278,0.00023496864,0.0004044625,0.2286611,0.02008288,0.08255973,0.018546948,0.64717656],"study_design_scores_gemma":[0.000009132778,0.000024053455,0.00018696146,0.000026351325,0.000022429846,0.000053676118,0.0000514938,0.9206136,0.0030884044,0.0736855,0.0022261578,0.0000121469],"about_ca_topic_score_codex":0.0049726837,"about_ca_topic_score_gemma":0.009509811,"teacher_disagreement_score":0.008026438,"about_ca_system_score_codex":0.001334924,"about_ca_system_score_gemma":0.00086931157,"threshold_uncertainty_score":0.026851177},"labels":[],"label_agreement":null},{"id":"W4405014026","doi":"10.1007/978-3-031-78122-3_24","title":"Multifaceted Anchor Nodes Attack on Graph Neural Networks: A Budget-Efficient Approach","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Neural Networks","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":"McMaster University","funders":"","keywords":"Computer science; Artificial neural network; Graph; Theoretical computer science; Artificial intelligence","score_opus":0.02507208501773168,"score_gpt":0.26559911818943643,"score_spread":0.24052703317170476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405014026","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.019992989,0.0008083671,0.9713543,0.0012555053,0.00015601043,0.0001634347,0.00023956403,0.00066144235,0.00536835],"genre_scores_gemma":[0.6554143,0.0013362768,0.32340062,0.0005462584,0.0004397069,0.00055454334,0.00083893887,0.0006017554,0.016867641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977859,0.00094049156,0.00007939413,0.0003390558,0.00051996415,0.00033524728],"domain_scores_gemma":[0.9921903,0.0055917944,0.00039023708,0.00095708674,0.000584472,0.00028620442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035813048,0.0020105813,0.0032307457,0.001772594,0.00094451284,0.0019551525,0.0041493657,0.0032060426,0.0075490735],"category_scores_gemma":[0.017415406,0.00094941293,0.0010987865,0.002245562,0.001883478,0.0064594736,0.004464434,0.004202098,0.0010364985],"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.00041192994,0.00017554067,0.00041704843,0.00019863801,0.00009916412,0.00009672721,0.00008261864,0.7846579,0.0016564922,0.10699841,0.012674537,0.09253092],"study_design_scores_gemma":[0.000010583916,0.000012662976,0.000031427426,0.000007647973,0.000009484656,0.000009406449,0.000007487998,0.96801466,0.00013203484,0.031498544,0.0002621135,0.000003839186],"about_ca_topic_score_codex":0.0037533983,"about_ca_topic_score_gemma":0.004849672,"teacher_disagreement_score":0.0075490735,"about_ca_system_score_codex":0.0023249038,"about_ca_system_score_gemma":0.0020345293,"threshold_uncertainty_score":0.02525419},"labels":[],"label_agreement":null},{"id":"W4405073635","doi":"10.1145/3706115","title":"Heterogeneous Graph Neural Networks using Self-supervised Reciprocally Contrastive Learning","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Intelligent Systems and Technology","topic":"Advanced Graph Neural Networks","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 Alberta","funders":"National Natural Science Foundation of China","keywords":"Computer science; Artificial intelligence; Topological graph theory; Network topology; Graph; Robustness (evolution); Machine learning; Theoretical computer science; Data mining; Pathwidth; Line graph","score_opus":0.01694117523900615,"score_gpt":0.25195624868701516,"score_spread":0.235015073448009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405073635","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.031512607,0.00014147449,0.96631384,0.00014625004,0.000023295177,0.00006779564,0.000058986814,0.0005567124,0.001179025],"genre_scores_gemma":[0.70121276,0.00015462714,0.29568315,0.00028885753,0.000056531317,0.00017925978,0.00044633698,0.00014993595,0.0018285633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989743,0.00031237435,0.000041432297,0.00038247945,0.00021521817,0.000074193995],"domain_scores_gemma":[0.9979438,0.00095878495,0.0003003195,0.00029674507,0.0004163618,0.00008397759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017133337,0.0011460416,0.0010510085,0.0014798357,0.00046369733,0.0010448786,0.0022237063,0.0013498663,0.00093575974],"category_scores_gemma":[0.005646458,0.00050643896,0.001058262,0.0010913387,0.0011539123,0.0023150437,0.001603857,0.0018345795,0.00027562396],"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.00016799192,0.00021063855,0.0026338245,0.00009227804,0.00014968195,0.00013579811,0.00017928153,0.76319826,0.0075962557,0.015300891,0.0016505733,0.20868452],"study_design_scores_gemma":[0.0000035883397,0.000013953475,0.00008212213,0.0000018382743,0.000004987968,0.0000069760354,0.0000047709455,0.9964947,0.0005625444,0.0027247374,0.00009725626,0.0000025700112],"about_ca_topic_score_codex":0.0029797165,"about_ca_topic_score_gemma":0.0040082787,"teacher_disagreement_score":0.0029797165,"about_ca_system_score_codex":0.0011942942,"about_ca_system_score_gemma":0.0006254164,"threshold_uncertainty_score":0.009061098},"labels":[],"label_agreement":null},{"id":"W4405112666","doi":"10.1016/j.procs.2024.11.191","title":"BeComE: A Framework for Node Classification in Social Graphs","year":2024,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Advanced Graph Neural Networks","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 Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Node (physics); Social network (sociolinguistics); Theoretical computer science; Artificial intelligence; World Wide Web; Social media","score_opus":0.032631046847118116,"score_gpt":0.3184168328245523,"score_spread":0.2857857859774342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405112666","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.008434177,0.0005859264,0.98154634,0.00071700214,0.00009792629,0.00021025415,0.002147306,0.0041661565,0.002094905],"genre_scores_gemma":[0.24698803,0.0012187436,0.73082525,0.00053460634,0.00032536237,0.00079528056,0.010698252,0.00071096316,0.007903637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989735,0.00033735385,0.000046344398,0.00030819207,0.00026306894,0.00007155386],"domain_scores_gemma":[0.9984642,0.0006762414,0.0001895867,0.00028038156,0.00027597096,0.00011357473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011586959,0.0015118833,0.00081886665,0.0037836777,0.0007479617,0.0017104596,0.0018838797,0.0016213553,0.0031468465],"category_scores_gemma":[0.0047617396,0.00047785477,0.0013540359,0.003128582,0.0007867785,0.004836313,0.001605699,0.0024744775,0.00195364],"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.0002649752,0.0005104327,0.011639177,0.0006051222,0.00030614925,0.00027846068,0.0005388961,0.25575644,0.0046305386,0.18524455,0.057471294,0.48275396],"study_design_scores_gemma":[0.00001047192,0.000038789603,0.0007473345,0.000025482672,0.000019511206,0.000069842594,0.000051953964,0.9067902,0.00050154096,0.08249891,0.009230836,0.000015047442],"about_ca_topic_score_codex":0.0064169597,"about_ca_topic_score_gemma":0.012266745,"teacher_disagreement_score":0.0064169597,"about_ca_system_score_codex":0.0011905619,"about_ca_system_score_gemma":0.00089903857,"threshold_uncertainty_score":0.012759209},"labels":[],"label_agreement":null},{"id":"W4405143960","doi":"10.1145/3673791.3698434","title":"The First Workshop on Evaluation Methodologies, Testbeds and Community for Information Access Research (EMTCIR 2024)","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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; Data science; World Wide Web; Knowledge management","score_opus":0.44417470971216544,"score_gpt":0.5203434357644982,"score_spread":0.07616872605233271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405143960","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.037188295,0.016578754,0.657632,0.1083261,0.041461002,0.026244916,0.01921095,0.0135478,0.07981011],"genre_scores_gemma":[0.14507526,0.004282529,0.6581193,0.017084453,0.0058634793,0.033048104,0.05519791,0.0073303767,0.07399855],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.84590346,0.1265527,0.0052650464,0.0058899038,0.011670622,0.0047182497],"domain_scores_gemma":[0.8072998,0.09196837,0.00405364,0.01957035,0.04962709,0.02748075],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.22132544,0.0034184402,0.0028727876,0.0065309247,0.0043488233,0.018165667,0.010177177,0.008895416,0.021066617],"category_scores_gemma":[0.16999407,0.002047935,0.0035466247,0.004300762,0.0048032794,0.017568123,0.01873156,0.010518049,0.00920385],"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.001736421,0.0021190878,0.0025432485,0.0025975034,0.00043940096,0.0004498818,0.0049556424,0.0037139559,0.011765337,0.03881676,0.72959065,0.20127219],"study_design_scores_gemma":[0.0015033665,0.0023078986,0.006587485,0.0028795805,0.00045991188,0.00055067346,0.0065263514,0.02691617,0.018062891,0.06303591,0.87064266,0.0005271865],"about_ca_topic_score_codex":0.018081624,"about_ca_topic_score_gemma":0.022555273,"teacher_disagreement_score":0.22132544,"about_ca_system_score_codex":0.011544702,"about_ca_system_score_gemma":0.017534593,"threshold_uncertainty_score":0.96024436},"labels":[],"label_agreement":null},{"id":"W4405179881","doi":"10.1109/tmi.2024.3512603","title":"Heterogeneous Graph Representation Learning Framework for Resting-State Functional Connectivity Analysis","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Medical Imaging","topic":"Advanced Graph Neural Networks","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 Alberta","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Resting state fMRI; Computer science; Functional connectivity; Representation (politics); Graph; Graph theory; Artificial intelligence; Pattern recognition (psychology); Theoretical computer science; Neuroscience; Mathematics; Psychology; Combinatorics","score_opus":0.022553580869994636,"score_gpt":0.31230030333307063,"score_spread":0.289746722463076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405179881","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.009588742,0.00045067296,0.987282,0.00038727588,0.000026902379,0.00003323718,0.00055036915,0.00087339326,0.00080754183],"genre_scores_gemma":[0.6327961,0.0010755885,0.3549424,0.0005253285,0.00018155578,0.0003542942,0.0050526154,0.00039151454,0.0046804943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994149,0.00019589548,0.000022535036,0.00019588109,0.00010540381,0.00006533073],"domain_scores_gemma":[0.99926525,0.00032904893,0.00010607328,0.00012284912,0.00012569083,0.00005118252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009939361,0.0009534886,0.0009153555,0.0019029197,0.00043364888,0.0010046953,0.0017821335,0.0011487921,0.0021677776],"category_scores_gemma":[0.0029718168,0.00037677184,0.0014803649,0.0020789516,0.0006316144,0.0018878396,0.0011539079,0.0017084114,0.0006484394],"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.0001344501,0.00013367139,0.0025126364,0.00013673733,0.00021321508,0.00025222695,0.00011452376,0.76346934,0.0037334862,0.043333225,0.009014511,0.17695199],"study_design_scores_gemma":[0.0000046821056,0.000010765582,0.00018817285,0.0000040113537,0.0000116638175,0.000017981,0.0000065526683,0.9807811,0.00019958304,0.01817498,0.0005949582,0.000005539465],"about_ca_topic_score_codex":0.009834033,"about_ca_topic_score_gemma":0.011493041,"teacher_disagreement_score":0.009834033,"about_ca_system_score_codex":0.0012267506,"about_ca_system_score_gemma":0.00087564625,"threshold_uncertainty_score":0.019553542},"labels":[],"label_agreement":null},{"id":"W4405364446","doi":"10.1145/3700434","title":"PyGim : An Efficient Graph Neural Network Library for Real Processing-In-Memory Architectures","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","topic":"Advanced Graph Neural Networks","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":"Vector Institute; University of Toronto","funders":"","keywords":"Computer science; Bottleneck; Parallel computing; Exploit; Memory model; Computer architecture; Distributed computing; Shared memory; Embedded system","score_opus":0.025345363658966946,"score_gpt":0.25582823251928655,"score_spread":0.2304828688603196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405364446","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.013783304,0.0011856566,0.5496829,0.00043961583,0.00027196878,0.00026216838,0.009118283,0.4153,0.009956152],"genre_scores_gemma":[0.16626751,0.0019045328,0.7261498,0.0011618072,0.00008756957,0.0014943675,0.03973888,0.042540323,0.020655224],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99958307,0.00005818656,0.000030496487,0.00009357011,0.00017569981,0.00005900352],"domain_scores_gemma":[0.99943537,0.00021915737,0.000055337096,0.000115313596,0.00013422052,0.000040624793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057111453,0.0021163328,0.0007357502,0.001099971,0.00046348257,0.0010810286,0.004574954,0.0010294581,0.020061947],"category_scores_gemma":[0.0029940144,0.0011138768,0.0015402312,0.0012828783,0.0005486839,0.0023059072,0.0014564943,0.0025092438,0.008330466],"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.00073484867,0.00036838432,0.004922668,0.0030480716,0.0005778768,0.00059662387,0.0003098042,0.3075615,0.019625412,0.028246285,0.28392425,0.3500843],"study_design_scores_gemma":[0.00014336153,0.00006792947,0.0009277136,0.00007211001,0.000049519713,0.00012152566,0.000030674997,0.9153718,0.013131765,0.01849501,0.051531967,0.000056698394],"about_ca_topic_score_codex":0.010911417,"about_ca_topic_score_gemma":0.019596817,"teacher_disagreement_score":0.020061947,"about_ca_system_score_codex":0.0013011855,"about_ca_system_score_gemma":0.0021975657,"threshold_uncertainty_score":0.06711388},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"bench_or_experimental","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"not_applicable","genre":"software","about_ca_system":false,"about_ca_topic":false,"confidence":"medium"}],"label_agreement":"split"},{"id":"W4405489164","doi":"10.1109/tnnls.2024.3513546","title":"Exploring Attention and Self-Supervised Learning Mechanism for Graph Similarity Learning","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks and Learning Systems","topic":"Advanced Graph Neural Networks","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":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Mechanism (biology); Similarity (geometry); Computer science; Artificial intelligence; Graph; Psychology; Theoretical computer science; Epistemology","score_opus":0.037559252159681145,"score_gpt":0.2412893141812235,"score_spread":0.20373006202154237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405489164","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.043164384,0.0004113367,0.9536807,0.00036934504,0.000037647907,0.00006779552,0.00007743982,0.0010355003,0.0011557552],"genre_scores_gemma":[0.77688617,0.00037015718,0.21828966,0.00048468745,0.00014881037,0.00017327009,0.0005341899,0.00025429492,0.0028587808],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874413,0.0003953497,0.000045848967,0.0005064613,0.00021005716,0.00009821464],"domain_scores_gemma":[0.99662423,0.0015147426,0.00039482312,0.000674667,0.0005747988,0.00021677655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018683679,0.00088837405,0.001217855,0.0016047705,0.000576542,0.0009606247,0.0031610993,0.0016984288,0.0016269471],"category_scores_gemma":[0.006361346,0.00042580016,0.0009401691,0.0013920909,0.0014878829,0.0035663093,0.0024988437,0.0018729264,0.000470435],"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.00026510106,0.0006163579,0.008105206,0.00050794415,0.00031438717,0.00024002718,0.0005876192,0.39839745,0.020947054,0.08039575,0.010601674,0.47902155],"study_design_scores_gemma":[0.000008272805,0.000031935273,0.00039689874,0.000005047842,0.000011869972,0.000024592597,0.000013996306,0.9732817,0.0012902471,0.024545122,0.00038352,0.0000068213653],"about_ca_topic_score_codex":0.0031209902,"about_ca_topic_score_gemma":0.0049895016,"teacher_disagreement_score":0.0031610993,"about_ca_system_score_codex":0.0012303384,"about_ca_system_score_gemma":0.0010375852,"threshold_uncertainty_score":0.00988096},"labels":[],"label_agreement":null},{"id":"W4406028367","doi":"10.1109/tmc.2025.3525477","title":"Multi-Task Semantic Communication With Graph Attention-Based Feature Correlation Extraction","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced Graph Neural Networks","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 Manitoba","funders":"Natural Science Foundation of Beijing Municipality; National Natural Science Foundation of China","keywords":"Computer science; Correlation; Feature extraction; Graph; Task (project management); Artificial intelligence; Feature (linguistics); Semantic feature; Natural language processing; Pattern recognition (psychology); Theoretical computer science","score_opus":0.009291780807133998,"score_gpt":0.2653748857324918,"score_spread":0.2560831049253578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406028367","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.043354936,0.001058816,0.94326985,0.0005473698,0.00013737443,0.0001427753,0.0006468978,0.0067082485,0.0041337046],"genre_scores_gemma":[0.7380581,0.0006204888,0.24776487,0.00042741493,0.00016107298,0.00028066867,0.002898508,0.00044277756,0.009346144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936014,0.0001402674,0.000030501727,0.00024122882,0.00013547386,0.00009235766],"domain_scores_gemma":[0.99929416,0.00027245248,0.00007708877,0.0001666166,0.00014222755,0.000047490386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078552554,0.001592374,0.00093322847,0.0010003843,0.00042681553,0.0007555611,0.0019394766,0.0009955794,0.002241541],"category_scores_gemma":[0.0026262354,0.0003574094,0.0011740274,0.0013870919,0.0005195319,0.0025776387,0.0015212934,0.001500212,0.0009712319],"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.000552439,0.0005000788,0.0030269213,0.0003407065,0.0002000584,0.000358797,0.00032097934,0.220733,0.023124205,0.017401604,0.019754179,0.71368694],"study_design_scores_gemma":[0.000024895828,0.000081393504,0.0006745455,0.000011092748,0.000047362082,0.000062647465,0.000031292453,0.9740859,0.0062373625,0.015646081,0.0030792335,0.000018156634],"about_ca_topic_score_codex":0.007359849,"about_ca_topic_score_gemma":0.009121968,"teacher_disagreement_score":0.007359849,"about_ca_system_score_codex":0.0010170286,"about_ca_system_score_gemma":0.0014453736,"threshold_uncertainty_score":0.014634073},"labels":[],"label_agreement":null},{"id":"W4406068137","doi":"10.1007/978-3-031-74003-9_15","title":"Similarity of Concepts in Weighted Knowledge Graphs","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in networks and systems","topic":"Advanced Graph Neural Networks","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 Alberta","funders":"","keywords":"Similarity (geometry); Knowledge graph; Computer science; Mathematics; Artificial intelligence","score_opus":0.015621795690207751,"score_gpt":0.26222298568102254,"score_spread":0.2466011899908148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406068137","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.16059004,0.0049306597,0.8177615,0.0006569641,0.00021033688,0.00019456525,0.0014841286,0.00060524844,0.013566591],"genre_scores_gemma":[0.73881453,0.002770266,0.24964748,0.00016782423,0.00017553376,0.00020913767,0.0030001306,0.00016055004,0.0050545363],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826103,0.00047838988,0.00018033553,0.00040420832,0.00060357247,0.00007246417],"domain_scores_gemma":[0.9958348,0.002703712,0.00041815234,0.0003623642,0.0005440439,0.00013686395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010820734,0.00037009275,0.00076080003,0.0058079837,0.0005204446,0.0022778355,0.0011864632,0.000988538,0.0029444278],"category_scores_gemma":[0.012002701,0.00036794154,0.00080209656,0.0059230654,0.00088795804,0.006987607,0.0016695799,0.00082887884,0.00044986638],"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.00043663377,0.00018231233,0.006180783,0.0011249904,0.0004102555,0.00042369709,0.0012048604,0.05521635,0.007050189,0.40663016,0.0074572857,0.5136825],"study_design_scores_gemma":[0.000020573116,0.000088885405,0.0027743478,0.00015429044,0.00012858039,0.00042502346,0.00042902704,0.19452125,0.0021329832,0.791461,0.00782914,0.000034882327],"about_ca_topic_score_codex":0.0015739813,"about_ca_topic_score_gemma":0.0018784362,"teacher_disagreement_score":0.0058079837,"about_ca_system_score_codex":0.00095573417,"about_ca_system_score_gemma":0.00044673207,"threshold_uncertainty_score":0.009850144},"labels":[],"label_agreement":null},{"id":"W4406207049","doi":"10.1109/comst.2025.3527561","title":"Edge Graph Intelligence: Reciprocally Empowering Edge Networks With Graph Intelligence","year":2025,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":22,"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":"National Natural Science Foundation of China","keywords":"Graph; Enhanced Data Rates for GSM Evolution; Computer science; Psychology; Theoretical computer science; Artificial intelligence","score_opus":0.04125900414966655,"score_gpt":0.3267987530736188,"score_spread":0.28553974892395223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406207049","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.014703113,0.0077524018,0.91185826,0.006712332,0.0005190854,0.00014939895,0.00023803751,0.00078585534,0.057281464],"genre_scores_gemma":[0.41853738,0.0237709,0.53254074,0.0029863424,0.0013550478,0.0003834141,0.0011363485,0.00053911516,0.018750768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998858,0.00042223392,0.000044780365,0.00029045212,0.00029359182,0.00009098121],"domain_scores_gemma":[0.99676704,0.0018159417,0.00017605504,0.00071030133,0.0002795283,0.0002511611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014894593,0.0007907004,0.00065708073,0.00165507,0.0012171911,0.0034830235,0.001837005,0.001264328,0.0054691345],"category_scores_gemma":[0.005770674,0.0004316122,0.0008267305,0.0021369804,0.003126896,0.008748213,0.00440413,0.002671006,0.0015268154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000331756,0.00006288314,0.0008472636,0.00048391966,0.00004482648,0.00013018945,0.00045629047,0.017075505,0.0018489375,0.830772,0.012378199,0.13586672],"study_design_scores_gemma":[0.000011295222,0.000036668527,0.00042226873,0.0001776245,0.00003711169,0.00023150678,0.00027119368,0.08538059,0.001767257,0.81151146,0.10012557,0.000027406522],"about_ca_topic_score_codex":0.0010814576,"about_ca_topic_score_gemma":0.0020012208,"teacher_disagreement_score":0.0054691345,"about_ca_system_score_codex":0.0009820337,"about_ca_system_score_gemma":0.0010734055,"threshold_uncertainty_score":0.018296123},"labels":[],"label_agreement":null},{"id":"W4406458851","doi":"10.1109/bigdata62323.2024.10825720","title":"The Power of Many: Investigating Defense Mechanisms for Resilient Graph Neural Networks","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Brock University","funders":"","keywords":"Computer science; Artificial neural network; Power (physics); Artificial intelligence","score_opus":0.015350620322290336,"score_gpt":0.2529802248559509,"score_spread":0.23762960453366055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406458851","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.44529688,0.005886955,0.52783114,0.005142843,0.00048074758,0.00015460543,0.00017223466,0.0017496165,0.013284986],"genre_scores_gemma":[0.9867308,0.00061566767,0.01122754,0.0002947801,0.000043868495,0.000027701097,0.00004253981,0.000041888285,0.00097517535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987362,0.0004311021,0.000040574003,0.00023327227,0.00028850118,0.00027029726],"domain_scores_gemma":[0.99321127,0.0038915183,0.0008150176,0.0011396684,0.0006734135,0.0002690287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022405344,0.00096115656,0.000686901,0.00095681933,0.00078872574,0.0014114428,0.0013003573,0.0013022269,0.00194473],"category_scores_gemma":[0.010707943,0.0003313418,0.0005530329,0.00030137826,0.0019562356,0.0046716346,0.0018610769,0.0019972906,0.0003276649],"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.00087668374,0.00028912473,0.00994569,0.000679203,0.00046100328,0.0004175571,0.0003924281,0.5716915,0.04157249,0.17484953,0.007515824,0.19130896],"study_design_scores_gemma":[0.000024185128,0.00039278754,0.001173006,0.00005612988,0.0000755097,0.000287141,0.00016271563,0.9131362,0.009969054,0.07255628,0.0021303871,0.000036603007],"about_ca_topic_score_codex":0.0007595888,"about_ca_topic_score_gemma":0.001139446,"teacher_disagreement_score":0.0022405344,"about_ca_system_score_codex":0.0009521382,"about_ca_system_score_gemma":0.00064866623,"threshold_uncertainty_score":0.011849225},"labels":[],"label_agreement":null},{"id":"W4406609300","doi":"10.1007/s41060-025-00717-y","title":"Supervised graph embedding for classification using discriminating frequent patterns","year":2025,"lang":"en","type":"article","venue":"International Journal of Data Science and Analytics","topic":"Advanced Graph Neural Networks","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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Dhaka; University Grants Commission of Bangladesh; University of Manitoba","keywords":"Pattern recognition (psychology); Artificial intelligence; Embedding; Computer science; Graph; Machine learning; Theoretical computer science","score_opus":0.12141518112245384,"score_gpt":0.4118745984518881,"score_spread":0.29045941732943426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406609300","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.19394128,0.0014399139,0.79542893,0.0007263742,0.000266517,0.00018365405,0.0026728301,0.0026393917,0.0027009987],"genre_scores_gemma":[0.798529,0.0005773914,0.19053128,0.00014386067,0.00018178705,0.000165712,0.0058786524,0.00020306499,0.003789252],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994337,0.00011339698,0.000042802654,0.00022349079,0.00012929339,0.000057388694],"domain_scores_gemma":[0.9985267,0.00068425713,0.00015858785,0.00027594165,0.00026725294,0.00008733873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037340348,0.00069101516,0.00077739824,0.002666191,0.00045837756,0.00084415206,0.0010389488,0.0009839502,0.0018795897],"category_scores_gemma":[0.002274432,0.00024079367,0.000747417,0.0022144364,0.00040235903,0.0016118529,0.0007539317,0.0011003483,0.0008773993],"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.0007031588,0.00085938314,0.0124306865,0.00042585985,0.00022934384,0.00037043687,0.00025467065,0.064848304,0.021607466,0.014695626,0.01839887,0.8651762],"study_design_scores_gemma":[0.00002734999,0.000115264,0.00231892,0.000034740737,0.00005812954,0.00020265591,0.000116351854,0.9608377,0.002821485,0.030697571,0.0027532424,0.000016544527],"about_ca_topic_score_codex":0.0020071885,"about_ca_topic_score_gemma":0.0037603173,"teacher_disagreement_score":0.002666191,"about_ca_system_score_codex":0.00037430998,"about_ca_system_score_gemma":0.0005882524,"threshold_uncertainty_score":0.006287873},"labels":[],"label_agreement":null},{"id":"W4407052498","doi":"10.1007/s10115-025-02346-0","title":"A novel contrastive multi-view framework for heterogeneous graph embedding","year":2025,"lang":"en","type":"article","venue":"Knowledge and Information Systems","topic":"Advanced Graph Neural Networks","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":"Mount Royal University","funders":"","keywords":"Embedding; Computer science; Graph; Theoretical computer science; Artificial intelligence; Mathematics; Natural language processing","score_opus":0.0197432400307529,"score_gpt":0.30193892668569033,"score_spread":0.28219568665493744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407052498","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.0033019911,0.00023734814,0.9950001,0.00011525471,0.000032449083,0.000026443615,0.00016426537,0.00032884904,0.00079329294],"genre_scores_gemma":[0.23372571,0.0006286226,0.7583791,0.00031989536,0.00017711172,0.00019436821,0.0014957583,0.0004125117,0.004666918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925977,0.00022246336,0.00003065414,0.00023199472,0.00019428469,0.00006088786],"domain_scores_gemma":[0.9990631,0.00033297174,0.00008392607,0.00022207452,0.00021523771,0.000082762526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010229041,0.00108125,0.0011816955,0.0015783154,0.0004760426,0.001704453,0.002648952,0.001606342,0.004007639],"category_scores_gemma":[0.0030070809,0.00055818487,0.0011267466,0.001595019,0.00065524934,0.0034595185,0.0027178586,0.002284261,0.001074315],"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.00048503594,0.00029579102,0.0014017858,0.00044690378,0.0003483632,0.00041448447,0.00031729508,0.14807141,0.036835033,0.24307156,0.015565171,0.55274725],"study_design_scores_gemma":[0.000012907668,0.000052302832,0.00019860694,0.000015788914,0.000032369942,0.0001021952,0.000030151275,0.94477457,0.0025155977,0.048644334,0.0036049879,0.000016156773],"about_ca_topic_score_codex":0.0037282542,"about_ca_topic_score_gemma":0.0072044316,"teacher_disagreement_score":0.004007639,"about_ca_system_score_codex":0.0006591571,"about_ca_system_score_gemma":0.00065385574,"threshold_uncertainty_score":0.013406873},"labels":[],"label_agreement":null},{"id":"W4407057487","doi":"10.1007/978-3-658-45877-5_3","title":"Preliminaries","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Neural Networks","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Medicine; Materials science","score_opus":0.010835367847750027,"score_gpt":0.21918530939675848,"score_spread":0.20834994154900846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407057487","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.0016073965,0.00473927,0.08916693,0.0029547778,0.0020982795,0.00012059879,0.0034674548,0.0007559301,0.8950893],"genre_scores_gemma":[0.059886333,0.012602711,0.0708831,0.0039527058,0.0030246966,0.00070645334,0.011861455,0.0016635143,0.8354189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99959666,0.00008042653,0.000020488384,0.00011368424,0.0001394985,0.000049160793],"domain_scores_gemma":[0.9996456,0.00010147495,0.00002341544,0.00007645857,0.00011961143,0.000033494212],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000406341,0.0012556005,0.0006848433,0.0018871425,0.0015568984,0.0024266185,0.0015347411,0.0009642003,0.13911067],"category_scores_gemma":[0.0017327359,0.0003936722,0.00055717357,0.0023355947,0.0010088716,0.003198642,0.0017020417,0.0022056375,0.100567065],"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.000017000104,0.000032330874,0.000053799013,0.00020928189,0.0000040190343,0.000049500708,0.00011686413,0.0004878389,0.00038896687,0.7434567,0.19526903,0.059914593],"study_design_scores_gemma":[0.0000033368951,0.0000097371485,0.00007182261,0.00006279505,0.0000042727142,0.00009083698,0.00005482945,0.00069844705,0.00020907303,0.38734165,0.6114464,0.000006783514],"about_ca_topic_score_codex":0.0016101043,"about_ca_topic_score_gemma":0.0019362386,"teacher_disagreement_score":0.8608893,"about_ca_system_score_codex":0.00085042394,"about_ca_system_score_gemma":0.0007132962,"threshold_uncertainty_score":0.46537155},"labels":[],"label_agreement":null},{"id":"W4407702610","doi":"10.1037/xlm0001454","title":"Anchors and ratios to quantify and explain y-axis distortion effects in graphs.","year":2025,"lang":"en","type":"article","venue":"Journal of Experimental Psychology Learning Memory and Cognition","topic":"Advanced Graph Neural Networks","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","funders":"","keywords":"Psychology; Distortion (music); Cognitive psychology; Physics","score_opus":0.011842650518591616,"score_gpt":0.32061077833882473,"score_spread":0.3087681278202331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407702610","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.26258793,0.006398452,0.6660823,0.0020255183,0.0007570856,0.00084127195,0.002552087,0.0026278484,0.05612746],"genre_scores_gemma":[0.88222927,0.0009935903,0.113291055,0.00023441405,0.00014356364,0.00039770018,0.00074641145,0.0003147874,0.0016492596],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99768937,0.0009805589,0.00020978111,0.00037071513,0.0006833538,0.00006621382],"domain_scores_gemma":[0.954112,0.031077405,0.008446016,0.003574676,0.0023396306,0.00045031417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055488036,0.0013310044,0.00042444214,0.0033190933,0.00034687822,0.0016877982,0.00091777416,0.000860182,0.017218167],"category_scores_gemma":[0.09133005,0.0003479387,0.000947941,0.0026531452,0.0014277202,0.006469672,0.0013576645,0.0012555759,0.0012955274],"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.001512993,0.00028218987,0.10963502,0.0025800823,0.00060492224,0.0005929375,0.0060923663,0.015950557,0.020706907,0.26669717,0.013155705,0.56218916],"study_design_scores_gemma":[0.0003486919,0.001236236,0.32979113,0.0011854862,0.00069983624,0.0021058084,0.0032624137,0.14591496,0.011984665,0.46580377,0.037317876,0.0003491211],"about_ca_topic_score_codex":0.0012351661,"about_ca_topic_score_gemma":0.0014738062,"teacher_disagreement_score":0.017218167,"about_ca_system_score_codex":0.001012195,"about_ca_system_score_gemma":0.0004494482,"threshold_uncertainty_score":0.0576005},"labels":[],"label_agreement":null},{"id":"W4409189376","doi":"10.1016/j.eswa.2025.127356","title":"Unified link prediction modeling for enhanced knowledge graph completion task","year":2025,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":8,"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":"Institute for Information and Communications Technology Promotion; Information Technology Research Centre; National Research Foundation of Korea","keywords":"Computer science; Link (geometry); Knowledge graph; Task (project management); Graph; Machine learning; Artificial intelligence; Theoretical computer science; Computer network","score_opus":0.019156331097123728,"score_gpt":0.2816174827888249,"score_spread":0.2624611516917012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409189376","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.050387755,0.0006438614,0.94177294,0.0005794808,0.00012965007,0.000103232465,0.0012446798,0.0027244785,0.002413898],"genre_scores_gemma":[0.78428537,0.0005846475,0.1974259,0.00029494034,0.00017448516,0.00025337108,0.004963962,0.00032425157,0.011693163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994197,0.00013916315,0.000027372891,0.00023571661,0.000105819476,0.00007224917],"domain_scores_gemma":[0.9984584,0.0007550204,0.000110287605,0.0002649025,0.00032844915,0.00008301296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000990264,0.00083985756,0.00091332186,0.0011679133,0.00043478256,0.0010517732,0.002057441,0.0014336373,0.005342967],"category_scores_gemma":[0.0040255855,0.00036985855,0.0008347621,0.0014571873,0.00029327467,0.0023941044,0.000988594,0.0020994032,0.0015570853],"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.00042605758,0.0005808829,0.0024240785,0.000230771,0.00017948756,0.00023658108,0.000113602946,0.6330083,0.0069630477,0.013058087,0.01545289,0.32732624],"study_design_scores_gemma":[0.000004145858,0.000014535874,0.00015700271,0.00000394916,0.000012135695,0.000009890462,0.000003841971,0.9955728,0.00046105438,0.0034457361,0.0003108666,0.0000040241634],"about_ca_topic_score_codex":0.02066228,"about_ca_topic_score_gemma":0.0250985,"teacher_disagreement_score":0.02066228,"about_ca_system_score_codex":0.00064774544,"about_ca_system_score_gemma":0.0014723109,"threshold_uncertainty_score":0.04108399},"labels":[],"label_agreement":null},{"id":"W4409363183","doi":"10.1609/aaai.v39i20.35412","title":"Subgraph Invariant Learning Towards Large-Scale Graph Node Classification","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","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":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Graph; Computer science; Invariant (physics); Induced subgraph isomorphism problem; Mathematics; Combinatorics; Theoretical computer science; Artificial intelligence; Line graph; Voltage graph","score_opus":0.05231126368394066,"score_gpt":0.2983596347543106,"score_spread":0.24604837107036995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409363183","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.06313065,0.0005326239,0.9290488,0.0004770983,0.000071307666,0.000105774554,0.0006349046,0.0041821264,0.0018167152],"genre_scores_gemma":[0.7331168,0.0005110629,0.25651515,0.000516295,0.00014002394,0.00018918213,0.004103065,0.00052294123,0.004385462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992575,0.00021094324,0.000025735595,0.00028345778,0.00014970316,0.000072571864],"domain_scores_gemma":[0.9979522,0.00095668586,0.00024871627,0.0005163892,0.0002349379,0.00009096167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091695297,0.001358145,0.0010551594,0.0017710429,0.00047425355,0.00081916404,0.0022448644,0.0011922783,0.0018316967],"category_scores_gemma":[0.005202441,0.00044675314,0.001190109,0.0018765265,0.0009913949,0.002679627,0.0013610285,0.0020972546,0.00084326364],"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.00018340652,0.00021550023,0.0053375415,0.00022956084,0.00015478348,0.00023912085,0.00017767692,0.6074315,0.0085756,0.025527136,0.015987359,0.33594084],"study_design_scores_gemma":[0.000006393954,0.000020302781,0.00032705837,0.0000056378954,0.000011853558,0.000025426638,0.000017888868,0.97500503,0.0011044653,0.022792675,0.0006781992,0.0000050528556],"about_ca_topic_score_codex":0.0072464207,"about_ca_topic_score_gemma":0.011266212,"teacher_disagreement_score":0.0072464207,"about_ca_system_score_codex":0.0012949426,"about_ca_system_score_gemma":0.0009031882,"threshold_uncertainty_score":0.014408529},"labels":[],"label_agreement":null},{"id":"W4409363443","doi":"10.1609/aaai.v39i20.35488","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Graph; Multiple edges; Artificial intelligence; Enhanced Data Rates for GSM Evolution; Theoretical computer science","score_opus":0.03621241705176568,"score_gpt":0.28505742627367237,"score_spread":0.2488450092219067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409363443","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.12661915,0.0014461798,0.86291766,0.0023668013,0.00025359268,0.00019823597,0.00017547498,0.0017782898,0.0042446367],"genre_scores_gemma":[0.682616,0.00057841185,0.31248358,0.0009966317,0.00014682944,0.00012943968,0.00047657583,0.0004445055,0.0021279894],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99655664,0.0014769454,0.0001461306,0.00094441284,0.00065220444,0.00022364518],"domain_scores_gemma":[0.9875257,0.0075549483,0.0008168714,0.0022480383,0.0013150774,0.0005393478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064805467,0.0014682064,0.0014976263,0.0012309713,0.00078264816,0.0017240503,0.00273514,0.0025541722,0.0019342299],"category_scores_gemma":[0.028617794,0.0004666472,0.0007941574,0.000945646,0.0024693685,0.005815296,0.002432112,0.0032918858,0.0007542576],"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.0008756705,0.0006826997,0.014602904,0.0006134526,0.0003130963,0.00028842848,0.00037434572,0.29484227,0.019206943,0.061597064,0.008864685,0.5977384],"study_design_scores_gemma":[0.000075476266,0.00046231376,0.0012574455,0.000059951533,0.000071433875,0.0001936943,0.00010201153,0.9237006,0.013297645,0.05820483,0.0025442492,0.000030332043],"about_ca_topic_score_codex":0.0014439896,"about_ca_topic_score_gemma":0.0026081123,"teacher_disagreement_score":0.0064805467,"about_ca_system_score_codex":0.0009460318,"about_ca_system_score_gemma":0.00085387076,"threshold_uncertainty_score":0.03427279},"labels":[],"label_agreement":null},{"id":"W4409375011","doi":"10.1016/b978-0-443-15888-9.00011-x","title":"Deep learning: fundamentals","year":2025,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Advanced Graph Neural Networks","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":"Psychology; Computer science; Artificial intelligence","score_opus":0.012211845552187763,"score_gpt":0.24104598853724732,"score_spread":0.22883414298505955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409375011","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.0024609442,0.0863299,0.37949646,0.005266809,0.0039393194,0.000085535066,0.001463168,0.003098974,0.5178588],"genre_scores_gemma":[0.023320224,0.053737007,0.08949758,0.0015207077,0.0020704574,0.00014971691,0.0018230855,0.0012525952,0.8266286],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99981064,0.000016906657,0.0000099968975,0.000043386917,0.000102477425,0.00001653771],"domain_scores_gemma":[0.99977535,0.00008577716,0.0000098017545,0.00004539548,0.00006259053,0.00002119862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002729948,0.0011938637,0.0007940514,0.0010475896,0.00032488993,0.0018146848,0.000840492,0.0012208684,0.044904016],"category_scores_gemma":[0.0008807002,0.0006799501,0.00048140163,0.002127052,0.0007142717,0.0022761868,0.0015074672,0.0022075954,0.03200524],"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.000013147382,0.000039678525,0.00010514681,0.00034987956,0.000017686083,0.000028067121,0.000050993687,0.0062752184,0.0012561124,0.07292137,0.20994231,0.70900035],"study_design_scores_gemma":[0.0000057502716,0.000024911003,0.0004435853,0.00040391597,0.000015674985,0.00014388368,0.00002541677,0.020060504,0.0014672971,0.19966851,0.777717,0.000023449351],"about_ca_topic_score_codex":0.0017991961,"about_ca_topic_score_gemma":0.0033504092,"teacher_disagreement_score":0.044904016,"about_ca_system_score_codex":0.00078239315,"about_ca_system_score_gemma":0.0007202547,"threshold_uncertainty_score":0.1502189},"labels":[],"label_agreement":null},{"id":"W4409634738","doi":"10.3390/make7020038","title":"Knowledge Graphs and Their Reciprocal Relationship with Large Language Models","year":2025,"lang":"en","type":"article","venue":"Machine Learning and Knowledge Extraction","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cape Breton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reciprocal; Computer science; Natural language processing; Linguistics; Philosophy","score_opus":0.012439613366926514,"score_gpt":0.2888355388840247,"score_spread":0.2763959255170982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409634738","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.027917614,0.011286687,0.9357208,0.0076922188,0.00011250321,0.00021076374,0.0019124703,0.0010089662,0.014137923],"genre_scores_gemma":[0.5117346,0.008978617,0.47090626,0.0014070123,0.0001578463,0.0005730933,0.003303247,0.00038602797,0.0025533196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98649746,0.00889144,0.00075506995,0.0017270953,0.0019366868,0.000192338],"domain_scores_gemma":[0.8921665,0.09501352,0.0045610094,0.005408082,0.0024898597,0.00036098465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010493859,0.00083755795,0.0006631226,0.0071775755,0.0010991624,0.0076288525,0.0018402,0.0014227119,0.0035113497],"category_scores_gemma":[0.07100824,0.0009174017,0.0014864017,0.006897273,0.0045200326,0.015949203,0.004348648,0.0026008044,0.0006117054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006533291,0.00004947754,0.005397399,0.0016312088,0.00041313202,0.00062609185,0.003676945,0.034314986,0.0011037786,0.8095995,0.00428866,0.13883348],"study_design_scores_gemma":[0.000011788221,0.000018438359,0.0011751181,0.0005666244,0.00014733388,0.00028831197,0.0007565053,0.058057453,0.0009245766,0.90631217,0.031693414,0.000048163667],"about_ca_topic_score_codex":0.006526254,"about_ca_topic_score_gemma":0.010139037,"teacher_disagreement_score":0.010493859,"about_ca_system_score_codex":0.0027481446,"about_ca_system_score_gemma":0.002698765,"threshold_uncertainty_score":0.055497527},"labels":[],"label_agreement":null},{"id":"W4409657240","doi":"10.1145/3696410.3714603","title":"SANS: Efficient Densest Subgraph Discovery over Relational Graphs without Materialization","year":2025,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Computer science; Theoretical computer science","score_opus":0.008129785943260292,"score_gpt":0.24526579578423013,"score_spread":0.23713600984096983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409657240","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.031156983,0.0007046716,0.95010465,0.0003905991,0.000063827276,0.00019466045,0.002117232,0.013185229,0.0020822238],"genre_scores_gemma":[0.16478632,0.00051530695,0.8187946,0.0002052486,0.00006179299,0.00013014307,0.010181222,0.0009765717,0.0043487507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991203,0.00013734405,0.000055500055,0.00030302102,0.00032145713,0.00006234798],"domain_scores_gemma":[0.9971271,0.0010997248,0.00019205466,0.0011277252,0.00035421952,0.00009909262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009583201,0.0014786673,0.0010911074,0.002706197,0.0008064409,0.0015036258,0.0020842717,0.0010052363,0.0036865845],"category_scores_gemma":[0.0064795185,0.0007367711,0.0012330414,0.002714752,0.000746451,0.0045787734,0.002053679,0.0013326807,0.001805682],"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.00040426746,0.00019571201,0.00622405,0.0008566295,0.0002803076,0.000526529,0.0005309001,0.13410929,0.031337794,0.041873798,0.03627658,0.74738413],"study_design_scores_gemma":[0.000049270624,0.00008357733,0.00086351915,0.000030939336,0.00005670852,0.0004410849,0.00022870215,0.90624297,0.018169207,0.060443155,0.013360666,0.000030201594],"about_ca_topic_score_codex":0.006764024,"about_ca_topic_score_gemma":0.020838244,"teacher_disagreement_score":0.006764024,"about_ca_system_score_codex":0.0008002308,"about_ca_system_score_gemma":0.0014757076,"threshold_uncertainty_score":0.013449311},"labels":[],"label_agreement":null},{"id":"W4409671186","doi":"10.1145/3696410.3714938","title":"<scp>Node2binary</scp> : Compact Graph Node Embeddings using Binary Vectors","year":2025,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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 Waterloo","funders":"","keywords":"Computer science; Binary number; Node (physics); Theoretical computer science; Graph; Mathematics; Arithmetic; Physics","score_opus":0.0172401512063985,"score_gpt":0.28066084735817914,"score_spread":0.26342069615178065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409671186","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.018049808,0.0019620117,0.8809772,0.0045173094,0.0013387562,0.00030877595,0.009772944,0.057681754,0.025391383],"genre_scores_gemma":[0.25734586,0.0026074876,0.6403342,0.0031251856,0.0006462413,0.00094039034,0.04200619,0.009073294,0.04392115],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930644,0.00011058063,0.000032143595,0.00016945585,0.0003310941,0.000050341805],"domain_scores_gemma":[0.9981591,0.000440539,0.00013765269,0.0007613421,0.00039577883,0.00010552718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000653685,0.0015875401,0.0009472783,0.0010789684,0.00059049146,0.0021274195,0.0035587873,0.0013906029,0.029252425],"category_scores_gemma":[0.0055907257,0.00072998635,0.0007612304,0.0026516442,0.0009790559,0.004761369,0.0025259603,0.0025230125,0.015613111],"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.00028334683,0.00016341462,0.00097014423,0.0006785576,0.00012857943,0.00028886538,0.0001596441,0.06657064,0.01189325,0.04762021,0.48071933,0.39052406],"study_design_scores_gemma":[0.000092639224,0.000121364326,0.00066645717,0.000073293864,0.000024584482,0.00030244648,0.00005787117,0.81342596,0.017597767,0.0639439,0.10361849,0.000075249394],"about_ca_topic_score_codex":0.0086340085,"about_ca_topic_score_gemma":0.015692774,"teacher_disagreement_score":0.029252425,"about_ca_system_score_codex":0.0012057992,"about_ca_system_score_gemma":0.0010298309,"threshold_uncertainty_score":0.097859144},"labels":[],"label_agreement":null},{"id":"W4410632617","doi":"10.22215/etd/2025-16414","title":"Learning Robust Graph Neural Networks with Limited Supervision","year":2025,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Graph Neural Networks","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":"Carleton University","funders":"","keywords":"Artificial neural network; Computer science; Graph; Artificial intelligence; Data science; Theoretical computer science","score_opus":0.011786776147170063,"score_gpt":0.23003027629614758,"score_spread":0.21824350014897753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410632617","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.031237146,0.00034038204,0.9641677,0.00031323006,0.000050589177,0.00006433646,0.0002574325,0.0022493203,0.0013198693],"genre_scores_gemma":[0.71892786,0.00044410516,0.27025813,0.0005940409,0.0001457092,0.00030753613,0.0028356044,0.00041830094,0.0060686385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989311,0.0002903911,0.000039734005,0.00043374783,0.00019243111,0.000112569316],"domain_scores_gemma":[0.997523,0.001312248,0.0003166486,0.0004028756,0.00034338888,0.000101744554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011795323,0.001979127,0.0014638591,0.0010053603,0.00045967093,0.0010171158,0.0025368833,0.0018987799,0.001875258],"category_scores_gemma":[0.007125691,0.00088494143,0.0009622789,0.0010436971,0.0013845784,0.002699046,0.001846909,0.0027073813,0.0009723503],"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.00014022335,0.000088109526,0.00087252806,0.0001053142,0.00006183679,0.000091245245,0.000052449584,0.8576156,0.0033383255,0.009966461,0.0036177651,0.12405023],"study_design_scores_gemma":[0.0000036341264,0.0000108760805,0.000043229124,0.0000026579319,0.0000027568542,0.000005780232,0.0000028544666,0.99518126,0.00033063107,0.0043113683,0.00010254455,0.0000022828526],"about_ca_topic_score_codex":0.0054841354,"about_ca_topic_score_gemma":0.008409637,"teacher_disagreement_score":0.0054841354,"about_ca_system_score_codex":0.0012986072,"about_ca_system_score_gemma":0.0011417908,"threshold_uncertainty_score":0.010904431},"labels":[],"label_agreement":null},{"id":"W4410637878","doi":"10.1145/3701716.3715863","title":"Graph Machine Learning under Distribution Shifts: Adaptation, Generalization and Extension to LLM","year":2025,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Instituto de Ciencias del Mar y Limnología, Universidad Nacional Autónoma de México; National Key Research and Development Program of China; Microsoft Research Asia; Weill Cornell Medical College; Tsinghua University; Beijing National Research Center For Information Science And Technology; Microsoft Research; National Natural Science Foundation of China; Universitas Brawijaya; York University; Institute for Catastrophic Loss Reduction","keywords":"Computer science; Extension (predicate logic); Generalization; Graph; Adaptation (eye); Theoretical computer science; Artificial intelligence; Machine learning; Mathematics; Programming language; Psychology","score_opus":0.012898168931688762,"score_gpt":0.2492417734022997,"score_spread":0.23634360447061092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410637878","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.019722078,0.0015845511,0.9728804,0.001738834,0.00016511825,0.00007053226,0.00024866074,0.0010427309,0.0025470036],"genre_scores_gemma":[0.7204952,0.00443327,0.25653997,0.0031218838,0.0013570056,0.0005438144,0.0017116963,0.00090824574,0.010888867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985624,0.00069365406,0.000049579907,0.00039001968,0.0001915042,0.00011272594],"domain_scores_gemma":[0.9920626,0.005275446,0.0005089549,0.0012665568,0.00066563184,0.00022079918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037968447,0.0010802319,0.0013921293,0.0013837683,0.0005559834,0.0011006104,0.002907834,0.0019417384,0.002716773],"category_scores_gemma":[0.020404339,0.0005018581,0.0014468231,0.0017779836,0.0018695127,0.0032804378,0.0027377687,0.004349833,0.0010370837],"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.00014418406,0.00018026018,0.004477528,0.00035141502,0.000156283,0.00034094387,0.00051974074,0.622801,0.0028078102,0.15000406,0.016783664,0.2014331],"study_design_scores_gemma":[0.000007985653,0.000019879426,0.00035300694,0.00001971139,0.000012963984,0.000043221607,0.00002733507,0.9143901,0.00023336205,0.083288796,0.0015929155,0.000010726774],"about_ca_topic_score_codex":0.0050282707,"about_ca_topic_score_gemma":0.004548911,"teacher_disagreement_score":0.0050282707,"about_ca_system_score_codex":0.0016660169,"about_ca_system_score_gemma":0.0009877303,"threshold_uncertainty_score":0.020079851},"labels":[],"label_agreement":null},{"id":"W4410906542","doi":"10.1007/978-3-031-84756-1_13","title":"Open Problems","year":2025,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on games and computational intelligence","topic":"Advanced Graph Neural Networks","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 Sudbury; University of Alberta","funders":"","keywords":"Computer science","score_opus":0.0266379061106281,"score_gpt":0.27515607968098676,"score_spread":0.24851817357035866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410906542","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.004773022,0.011498952,0.05618651,0.062312957,0.008005819,0.000055030006,0.0011907376,0.00031463243,0.8556624],"genre_scores_gemma":[0.1803499,0.016479222,0.04138804,0.025130602,0.015806513,0.00050523685,0.0050838916,0.0008749722,0.71438164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823725,0.00042977044,0.000071261224,0.00050865684,0.000484029,0.00026906587],"domain_scores_gemma":[0.9969484,0.0015113937,0.00014990749,0.00045306602,0.00065304,0.00028427347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014563167,0.00094642123,0.0010529306,0.0013819324,0.0035170075,0.0057358295,0.0022123598,0.0032051147,0.1386843],"category_scores_gemma":[0.0090608625,0.00037752613,0.0010624956,0.0017198717,0.00354588,0.010522213,0.0035523016,0.007138262,0.030383475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029667004,0.000043878452,0.00010112618,0.00012640326,0.00001029427,0.00004182964,0.00010520063,0.0003306527,0.00006760262,0.8386991,0.12441368,0.036030643],"study_design_scores_gemma":[0.000007526607,0.000003300031,0.000044882494,0.00005494657,0.0000036640076,0.000045288514,0.000086882115,0.00030284724,0.000045679637,0.8966469,0.10275411,0.0000038934736],"about_ca_topic_score_codex":0.0012810291,"about_ca_topic_score_gemma":0.0012461892,"teacher_disagreement_score":0.1386843,"about_ca_system_score_codex":0.002253946,"about_ca_system_score_gemma":0.0017185785,"threshold_uncertainty_score":0.4639452},"labels":[],"label_agreement":null},{"id":"W4411411740","doi":"10.1145/3744970.3727310","title":"PyGim: An Efficient Graph Neural Network Library for Real Processing-In-Memory Architectures","year":2025,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Advanced Graph Neural Networks","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":"Vector Institute; University of Toronto","funders":"","keywords":"Computer science; Parallel computing; Bottleneck; Exploit; Computer architecture; Embedded system","score_opus":0.03785837192708655,"score_gpt":0.3364874245987441,"score_spread":0.2986290526716575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411411740","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.013568304,0.0009316865,0.5231447,0.0004135077,0.0002567796,0.0002526723,0.008517259,0.4435303,0.00938471],"genre_scores_gemma":[0.17218328,0.0016365611,0.71838456,0.0011033006,0.00008756601,0.0014907753,0.03747412,0.04764071,0.019999182],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995828,0.00005753158,0.000030223768,0.000094325194,0.00017496906,0.00006014791],"domain_scores_gemma":[0.9994388,0.00022060944,0.00005535069,0.00011061701,0.00013297658,0.000041558156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005631652,0.0021674547,0.0007457472,0.0010531934,0.00046256586,0.0010752502,0.0044546053,0.0010162286,0.020519927],"category_scores_gemma":[0.0029645718,0.0011208833,0.0014940526,0.0012182989,0.000564544,0.0022829107,0.0014511448,0.0025472825,0.008384786],"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.00076578686,0.000392731,0.0053326082,0.003074324,0.00059354166,0.00061617733,0.00033409667,0.30618957,0.021188674,0.027595265,0.2960459,0.3378714],"study_design_scores_gemma":[0.00015111132,0.00006720781,0.0009881499,0.000065361695,0.000048040507,0.00011962444,0.000031377876,0.9215475,0.012914542,0.017148022,0.046862695,0.000056393255],"about_ca_topic_score_codex":0.01075141,"about_ca_topic_score_gemma":0.019277407,"teacher_disagreement_score":0.020519927,"about_ca_system_score_codex":0.0013195706,"about_ca_system_score_gemma":0.0021557156,"threshold_uncertainty_score":0.06864607},"labels":[],"label_agreement":null},{"id":"W4412133173","doi":"10.1111/coin.70097","title":"SparseMult: A Sparse Tensor Decomposition Model for Knowledge Graph Link Prediction","year":2025,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Advanced Graph Neural Networks","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":"Barrie Urology Group","funders":"","keywords":"Tensor decomposition; Link (geometry); Tensor (intrinsic definition); Computer science; Decomposition; Graph; Mathematics; Artificial intelligence; Pattern recognition (psychology); Theoretical computer science; Combinatorics; Pure mathematics; Chemistry","score_opus":0.0470954609821718,"score_gpt":0.33883412109769834,"score_spread":0.2917386601155265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412133173","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.03724846,0.0012439761,0.9541277,0.00092635525,0.0001397603,0.00008026878,0.0019728218,0.002468891,0.001791751],"genre_scores_gemma":[0.6789143,0.0015031962,0.30212355,0.00059653353,0.00026094355,0.0003335384,0.008630417,0.00043044606,0.0072070514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994498,0.00015976932,0.000031910044,0.00017283275,0.00011705394,0.00006869935],"domain_scores_gemma":[0.9986192,0.0005931565,0.00017252204,0.00019635836,0.00031462597,0.00010415533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089877564,0.0010942505,0.0009878112,0.0012283354,0.00050675374,0.0010779898,0.0017089824,0.001103723,0.0028499055],"category_scores_gemma":[0.0039640996,0.00052987505,0.0011129932,0.0016557903,0.00068248436,0.0021284332,0.0009877839,0.0021291047,0.00097237434],"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.0001951586,0.00013387969,0.0025368312,0.00015029489,0.00011235781,0.00014752995,0.00010343408,0.8430572,0.0027259476,0.018042631,0.01251531,0.12027947],"study_design_scores_gemma":[0.0000021566289,0.000006054809,0.00006797391,0.000002895954,0.0000033850447,0.0000050932226,0.0000030940753,0.9963051,0.000117241136,0.00322292,0.0002613758,0.0000026435819],"about_ca_topic_score_codex":0.025019795,"about_ca_topic_score_gemma":0.023225157,"teacher_disagreement_score":0.025019795,"about_ca_system_score_codex":0.0013214974,"about_ca_system_score_gemma":0.0013624979,"threshold_uncertainty_score":0.0497483},"labels":[],"label_agreement":null},{"id":"W4412228426","doi":"","title":"A Simple Latent Variable Model for Graph Learning and Inference","year":2023,"lang":"en","type":"article","venue":"Institutional Research Information System (Università degli Studi di Trento)","topic":"Advanced Graph Neural Networks","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":"Latent variable; Inference; Simple (philosophy); Latent variable model; Computer science; Graph; Artificial intelligence; Mathematics; Econometrics; Machine learning; Theoretical computer science; Epistemology; Philosophy","score_opus":0.09614882301960301,"score_gpt":0.3430509645098497,"score_spread":0.24690214149024667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412228426","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.0014884254,0.000090862784,0.99665064,0.00026115988,0.000027628777,0.000020871414,0.00029611334,0.00024253518,0.0009218455],"genre_scores_gemma":[0.30758348,0.000988722,0.67179453,0.0007252702,0.00037215144,0.0006298932,0.0030084243,0.0005147779,0.014382609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853075,0.00059124734,0.00005880491,0.00041883238,0.00028399733,0.00011634726],"domain_scores_gemma":[0.9964765,0.0021234371,0.0002451127,0.0007201686,0.00030378453,0.0001310658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020898022,0.0007550871,0.000952684,0.0015258299,0.0006997091,0.0018716261,0.0032887908,0.0018571201,0.0072944034],"category_scores_gemma":[0.009391769,0.0007024133,0.0013008242,0.0021258642,0.0016619959,0.005173272,0.0018146823,0.0035064614,0.0025275839],"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.00005105286,0.00006364298,0.0008679065,0.0001172673,0.0000703193,0.00008895485,0.00010956012,0.20503053,0.0013832971,0.7379739,0.0059202,0.048323393],"study_design_scores_gemma":[0.000009068983,0.000011950594,0.00014073502,0.000011951278,0.000011129303,0.000035904937,0.000008123199,0.6236135,0.00024317653,0.37341875,0.002483404,0.000012451136],"about_ca_topic_score_codex":0.0052446024,"about_ca_topic_score_gemma":0.007774211,"teacher_disagreement_score":0.0072944034,"about_ca_system_score_codex":0.0013920731,"about_ca_system_score_gemma":0.001611556,"threshold_uncertainty_score":0.02440226},"labels":[],"label_agreement":null},{"id":"W4412377938","doi":"10.1145/3726302.3729889","title":"AdaRPT: An Adaptive Rule Pattern Transfer Model for Fully Inductive Knowledge Graph Reasoning","year":2025,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"York University","funders":"Universitas Brawijaya; Central China Normal University; Natural Sciences and Engineering Research Council of Canada; Ministry of Education, India; Natural Science Foundation of Hubei Province; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Inductive reasoning; Graph; Artificial intelligence; Theoretical computer science","score_opus":0.028842484969888317,"score_gpt":0.28792855757008823,"score_spread":0.2590860726001999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412377938","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.009256276,0.00044826852,0.9785957,0.0006319664,0.00008344228,0.00028159327,0.0015599638,0.0065336553,0.0026091523],"genre_scores_gemma":[0.26746082,0.00081114506,0.716563,0.0011528273,0.000092424474,0.0007569852,0.007092778,0.00042476875,0.0056452113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984018,0.00030980536,0.00011409435,0.0006390663,0.00044480155,0.000090372516],"domain_scores_gemma":[0.9978878,0.0010046783,0.00017537724,0.00051664794,0.00032939727,0.00008613197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015693471,0.0013291308,0.0009659856,0.0017280221,0.00052080734,0.0015959737,0.005290545,0.00182151,0.0039855586],"category_scores_gemma":[0.0067878193,0.00070261216,0.002580125,0.0016077475,0.0011042289,0.0053016488,0.0022640636,0.0036930074,0.0017655116],"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.00027553187,0.0003720491,0.0026169135,0.00042096231,0.0002469509,0.000591982,0.00028844608,0.47773015,0.0043758573,0.031983037,0.016912973,0.46418512],"study_design_scores_gemma":[0.00002347087,0.000036776728,0.00016724762,0.00001831223,0.000026615515,0.000083141174,0.000016133954,0.958661,0.001180811,0.03655716,0.0032185037,0.000010817846],"about_ca_topic_score_codex":0.009744603,"about_ca_topic_score_gemma":0.012700907,"teacher_disagreement_score":0.009744603,"about_ca_system_score_codex":0.0015941808,"about_ca_system_score_gemma":0.001811978,"threshold_uncertainty_score":0.019375801},"labels":[],"label_agreement":null},{"id":"W4412470227","doi":"10.1016/j.aei.2025.103655","title":"Large language Models-empowered automatic knowledge graph development based on multi-modal data for building health resilience","year":2025,"lang":"en","type":"article","venue":"Advanced Engineering Informatics","topic":"Advanced Graph Neural Networks","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":"University of British Columbia","funders":"Hong Kong Polytechnic University","keywords":"Modal; Computer science; Resilience (materials science); Knowledge graph; Knowledge management; Graph; Data science; Artificial intelligence; Theoretical computer science","score_opus":0.017481202907824848,"score_gpt":0.3045036570114266,"score_spread":0.2870224541036018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412470227","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.032667983,0.00044722552,0.9380873,0.0011755598,0.00011993077,0.00029460806,0.0071372166,0.015774973,0.00429516],"genre_scores_gemma":[0.45117608,0.00036603166,0.5304462,0.0004142016,0.00005859163,0.0003164051,0.0133613665,0.00089511543,0.0029660303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911124,0.00025723304,0.00006162257,0.0002786859,0.00022694457,0.000064306296],"domain_scores_gemma":[0.9978866,0.0011221904,0.00013392909,0.00037633235,0.00040442683,0.00007645225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088301353,0.0007942875,0.0005788995,0.002445219,0.00056498667,0.0013995162,0.0014269325,0.00087285234,0.0042268042],"category_scores_gemma":[0.0060428204,0.00038565474,0.0012178876,0.0012199822,0.0005554535,0.0027470668,0.0025387423,0.0016254815,0.0017244146],"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.00040347464,0.00055693835,0.0069077145,0.00079746405,0.0003513226,0.0010210094,0.00092745863,0.205242,0.022891369,0.04490233,0.037920985,0.6780779],"study_design_scores_gemma":[0.000017693175,0.000034242606,0.0007391968,0.00005907976,0.00006131512,0.000084149644,0.00019923988,0.92369926,0.006305268,0.061270583,0.0075068465,0.000023149409],"about_ca_topic_score_codex":0.011394783,"about_ca_topic_score_gemma":0.02893388,"teacher_disagreement_score":0.011394783,"about_ca_system_score_codex":0.0009662336,"about_ca_system_score_gemma":0.0019710269,"threshold_uncertainty_score":0.022656918},"labels":[],"label_agreement":null},{"id":"W4412535588","doi":"10.1016/j.neucom.2025.131007","title":"Federated graph neural networks in non-IID scenarios—A comprehensive survey","year":2025,"lang":"en","type":"article","venue":"Neurocomputing","topic":"Advanced Graph Neural Networks","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 Windsor","funders":"Vector Institute","keywords":"Computer science; Artificial neural network; Graph; Artificial intelligence; Data mining; Data science; Machine learning; Theoretical computer science","score_opus":0.016338448874734447,"score_gpt":0.26618859793103256,"score_spread":0.2498501490562981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412535588","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.023202932,0.08412037,0.8646725,0.0023009372,0.00067801727,0.00015481334,0.00056499115,0.00066182483,0.023643585],"genre_scores_gemma":[0.6446948,0.12344035,0.21252637,0.0013897247,0.0020077622,0.00030926446,0.0015046453,0.000253968,0.013873114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994898,0.00017208274,0.000031307503,0.00013036834,0.00012348442,0.000053003983],"domain_scores_gemma":[0.99876946,0.0007665151,0.00008170077,0.00014710598,0.00018661245,0.000048661364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013273895,0.0011159775,0.0015435294,0.0011152496,0.00037435372,0.0016751105,0.0024360488,0.0019217848,0.002404065],"category_scores_gemma":[0.003818526,0.00047946355,0.00077478867,0.0017705467,0.0006731193,0.00313774,0.0013713359,0.0013963837,0.0006998899],"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.00011780646,0.00019099149,0.0016819928,0.0010808771,0.00020327934,0.00014544908,0.00006383847,0.49043012,0.00062862085,0.081305996,0.010785747,0.41336536],"study_design_scores_gemma":[0.0000085724105,0.000062002175,0.00036555913,0.00014266722,0.00004074688,0.0001185635,0.000036111163,0.9192669,0.00035372225,0.07218131,0.0074066482,0.00001716279],"about_ca_topic_score_codex":0.0027617589,"about_ca_topic_score_gemma":0.0030158467,"teacher_disagreement_score":0.0027617589,"about_ca_system_score_codex":0.00075563666,"about_ca_system_score_gemma":0.00081661006,"threshold_uncertainty_score":0.008042395},"labels":[],"label_agreement":null},{"id":"W4412564911","doi":"10.1016/j.knosys.2025.114147","title":"Communication-efficient federated knowledge graph embedding with entity-wise top-K sparsification","year":2025,"lang":"en","type":"article","venue":"Knowledge-Based Systems","topic":"Advanced Graph Neural Networks","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":"BC Research (Canada)","funders":"Nanyang Technological University; National Research Foundation Singapore","keywords":"Knowledge graph; Computer science; Embedding; Graph; Theoretical computer science; Information retrieval; Artificial intelligence","score_opus":0.015886634433275506,"score_gpt":0.28033576202184546,"score_spread":0.26444912758857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412564911","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.028244266,0.00055308815,0.96231836,0.00067063846,0.00013689997,0.00013066387,0.0014306585,0.003805592,0.0027098479],"genre_scores_gemma":[0.5552718,0.00052678416,0.42872983,0.0003844812,0.00017393769,0.00025793625,0.007939754,0.0003638424,0.006351519],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987789,0.0002528114,0.00009234127,0.00039833703,0.00033914344,0.0001384818],"domain_scores_gemma":[0.9969772,0.0012345236,0.00019107788,0.001041308,0.00045487387,0.00010105672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007892208,0.0013653517,0.0020164973,0.0014893401,0.0007906258,0.0014787653,0.0025813559,0.0015912162,0.0051179472],"category_scores_gemma":[0.0067847087,0.000654158,0.001173649,0.0025361942,0.00085896323,0.003921959,0.0031349491,0.002474268,0.002434176],"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.000684794,0.00045972868,0.0015177908,0.00045509567,0.0002357221,0.0003795322,0.00027211907,0.26503852,0.009277653,0.02025745,0.023710763,0.67771083],"study_design_scores_gemma":[0.000026457541,0.00004227125,0.00023478687,0.00001842641,0.000039446102,0.00011499452,0.00006890718,0.9686679,0.0029519477,0.026346928,0.0014741129,0.000013766999],"about_ca_topic_score_codex":0.0055303397,"about_ca_topic_score_gemma":0.009978562,"teacher_disagreement_score":0.0055303397,"about_ca_system_score_codex":0.00071761216,"about_ca_system_score_gemma":0.0019293039,"threshold_uncertainty_score":0.017121255},"labels":[],"label_agreement":null},{"id":"W4412620232","doi":"10.1007/978-981-96-9881-3_8","title":"GraphMMC: Class-Balanced Pseudo-Labels Generation for Graph Node Classification","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Neural Networks","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 Northern British Columbia","funders":"","keywords":"Computer science; Class (philosophy); Graph; Node (physics); Theoretical computer science; Artificial intelligence","score_opus":0.028297756309716926,"score_gpt":0.2743163402482338,"score_spread":0.2460185839385169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412620232","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.0093399715,0.0003962311,0.8579567,0.00048074182,0.0005113913,0.00085868704,0.009705538,0.11475517,0.0059956745],"genre_scores_gemma":[0.049422305,0.00013980703,0.91031647,0.00044057713,0.00010349684,0.0009007157,0.023070715,0.0075392444,0.008066648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868125,0.00022566017,0.00006016878,0.0005262757,0.00038029763,0.00012637737],"domain_scores_gemma":[0.9974546,0.0008800637,0.00009161871,0.0008833051,0.00055668084,0.0001336614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011496828,0.002409054,0.001421682,0.0031498966,0.0014574461,0.0021148147,0.004888564,0.0028978402,0.032893747],"category_scores_gemma":[0.0063620694,0.0011816128,0.0020592285,0.002503261,0.0007236459,0.002973374,0.0025618332,0.0034924005,0.015275948],"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.000531098,0.00034286993,0.0009595267,0.00044713638,0.000100896104,0.0001639024,0.00014716602,0.0217385,0.011891974,0.011516335,0.19734506,0.7548156],"study_design_scores_gemma":[0.00016414502,0.0000816066,0.00053601636,0.00008361335,0.00004121113,0.00015800163,0.0000814358,0.90530807,0.018282125,0.042760592,0.032454383,0.000048814043],"about_ca_topic_score_codex":0.008723738,"about_ca_topic_score_gemma":0.020201692,"teacher_disagreement_score":0.032893747,"about_ca_system_score_codex":0.0018753794,"about_ca_system_score_gemma":0.0021095523,"threshold_uncertainty_score":0.110040545},"labels":[],"label_agreement":null},{"id":"W4412643522","doi":"10.1007/978-981-95-0006-2_16","title":"Decoupled Graph Neural Networks with Hybrid Data Augmentation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Neural Networks","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 Victoria","funders":"","keywords":"Computer science; Artificial neural network; Graph; Theoretical computer science; Artificial intelligence","score_opus":0.01723756207831407,"score_gpt":0.25706174011811594,"score_spread":0.23982417803980188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412643522","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.0119344555,0.0006031084,0.97809213,0.00025306438,0.00022094298,0.00007168564,0.0005024569,0.0035652507,0.0047569717],"genre_scores_gemma":[0.34808904,0.0005644309,0.6275401,0.000499941,0.00019507113,0.00033241138,0.0028299312,0.0009574634,0.018991629],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996006,0.000102807186,0.000015244868,0.00012937222,0.000106720014,0.000045179953],"domain_scores_gemma":[0.9991455,0.00033596353,0.00003923501,0.00026921052,0.0001704808,0.00003970836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060760666,0.0013174741,0.0010733692,0.00075398915,0.00035901373,0.0010271412,0.0025167083,0.0015063868,0.0066402764],"category_scores_gemma":[0.0022296144,0.0008059849,0.00095587166,0.0013148842,0.0005875167,0.0022319101,0.002250728,0.002186215,0.0034335062],"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.0003575833,0.00025096437,0.0004845312,0.00022063486,0.00016036954,0.00010940624,0.000046400284,0.4638413,0.012387935,0.012889106,0.014018591,0.49523318],"study_design_scores_gemma":[0.000008527862,0.000020187865,0.00007541795,0.000006101148,0.000012069103,0.000014894814,0.0000045459337,0.99137974,0.0017522302,0.005717689,0.0010028242,0.000005824883],"about_ca_topic_score_codex":0.0036454434,"about_ca_topic_score_gemma":0.00925031,"teacher_disagreement_score":0.0066402764,"about_ca_system_score_codex":0.00044610436,"about_ca_system_score_gemma":0.00070583425,"threshold_uncertainty_score":0.022213995},"labels":[],"label_agreement":null},{"id":"W4412875489","doi":"10.1145/3711896.3736558","title":"Relational Deep Learning: Challenges, Foundations and Next-Generation Architectures","year":2025,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"McGill University","funders":"","keywords":"Computer science; Deep learning; Artificial intelligence; Data science; Cognitive science; Psychology","score_opus":0.06857409214224364,"score_gpt":0.27597253394409094,"score_spread":0.2073984418018473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412875489","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.025264252,0.038541198,0.8923274,0.025934473,0.00047717354,0.00008251812,0.0009814145,0.0021753996,0.014216143],"genre_scores_gemma":[0.42710814,0.056979008,0.49486312,0.004740819,0.0011578129,0.00029962067,0.003719121,0.0005737356,0.010558654],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989405,0.0003497401,0.000057858684,0.00025921612,0.00029664172,0.0000960372],"domain_scores_gemma":[0.99736965,0.0012587423,0.00010792407,0.00060022896,0.00049357244,0.00016982661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038879153,0.000793215,0.00086876575,0.00097129703,0.00048609785,0.0033709174,0.0031731834,0.0014701525,0.003426364],"category_scores_gemma":[0.0070707747,0.0005620503,0.0006770558,0.0016331394,0.0019610529,0.009568903,0.0029246109,0.0045504593,0.0012457287],"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.00014403039,0.0001587341,0.0031550045,0.00063054217,0.0001376374,0.000106816784,0.0002772202,0.10744346,0.0013545211,0.3945341,0.025577214,0.46648076],"study_design_scores_gemma":[0.000010304152,0.000059513393,0.0004977035,0.00018165357,0.000029270494,0.000067785186,0.00011846832,0.5654512,0.0012440352,0.40105307,0.03126368,0.000023294226],"about_ca_topic_score_codex":0.0069084526,"about_ca_topic_score_gemma":0.009966401,"teacher_disagreement_score":0.0069084526,"about_ca_system_score_codex":0.00212577,"about_ca_system_score_gemma":0.0018257205,"threshold_uncertainty_score":0.020561516},"labels":[],"label_agreement":null},{"id":"W4412876892","doi":"10.1145/3711896.3737132","title":"SMA-GNN: A Symbol-Aware Graph Neural Network for Signed Link Prediction in Recommender Systems","year":2025,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Computer science; Link (geometry); Symbol (formal); Recommender system; Artificial neural network; Graph; Artificial intelligence; Machine learning; Theoretical computer science; Computer network","score_opus":0.016182289637671154,"score_gpt":0.2561724045905201,"score_spread":0.23999011495284894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412876892","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.04428797,0.0011726585,0.94380057,0.0007259576,0.0002294077,0.00013416552,0.001211695,0.005051602,0.0033858703],"genre_scores_gemma":[0.62515527,0.0007285178,0.3595989,0.000782591,0.00017054573,0.00023825957,0.0034987938,0.0003020347,0.009525095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996952,0.00007383636,0.000015706119,0.00011805771,0.00006264403,0.0000345132],"domain_scores_gemma":[0.99937445,0.0002730258,0.00006091448,0.00010224934,0.00014957097,0.000039959476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005140028,0.0009701137,0.00082009536,0.00096637994,0.0004532639,0.0005520565,0.0019701612,0.0013348853,0.0028101183],"category_scores_gemma":[0.00304708,0.0005287389,0.0006751447,0.0010051673,0.0004604685,0.0015078699,0.0009615233,0.0016422339,0.0012154458],"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.00025372073,0.0002570101,0.0041278037,0.00021227768,0.00014476811,0.00016256455,0.00014648912,0.47198686,0.005995075,0.010658607,0.016706154,0.48934862],"study_design_scores_gemma":[0.000006842525,0.000018725994,0.00020839188,0.000007712188,0.000009863502,0.000017045693,0.000006546541,0.9945592,0.0005399164,0.0039407234,0.00067882956,0.0000061900946],"about_ca_topic_score_codex":0.014659404,"about_ca_topic_score_gemma":0.031858657,"teacher_disagreement_score":0.014659404,"about_ca_system_score_codex":0.00091235194,"about_ca_system_score_gemma":0.0008413779,"threshold_uncertainty_score":0.029148161},"labels":[],"label_agreement":null},{"id":"W4412876980","doi":"10.1145/3711896.3737599","title":"Training Industry-scale GNNs with GiGL","year":2025,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"University of Waterloo; Wilfrid Laurier University; North Carolina State University","keywords":"Scale (ratio); Computer science; Training (meteorology); Geography; Meteorology; Cartography","score_opus":0.018609947950918655,"score_gpt":0.26140003759870434,"score_spread":0.24279008964778567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412876980","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.04163553,0.0015055914,0.85457045,0.0025211328,0.00073231367,0.00027582527,0.0051200893,0.06829733,0.025341678],"genre_scores_gemma":[0.2253256,0.0014695765,0.7179335,0.0025809614,0.00015329193,0.00077429105,0.023736231,0.007844349,0.02018229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99952817,0.00012981193,0.000019877029,0.0001368882,0.00012787864,0.00005736479],"domain_scores_gemma":[0.9986663,0.00076114153,0.000048922673,0.00022607466,0.0002302238,0.00006730673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011861433,0.0012784494,0.0004721086,0.0007602633,0.00057362975,0.00088249746,0.0023249735,0.001488573,0.01562933],"category_scores_gemma":[0.006919647,0.00082593923,0.0010013182,0.0007706423,0.00050181575,0.0021835847,0.001690495,0.002586424,0.005888341],"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.00015802536,0.00018942835,0.003262326,0.0007253253,0.000107139254,0.00029544768,0.00021214971,0.5628076,0.0044183484,0.024700204,0.13679007,0.26633403],"study_design_scores_gemma":[0.000046891015,0.000046823316,0.00038620547,0.000065924614,0.000016577029,0.00007260995,0.000053490534,0.9374875,0.003964649,0.02624934,0.03159203,0.000018055338],"about_ca_topic_score_codex":0.007227654,"about_ca_topic_score_gemma":0.020921407,"teacher_disagreement_score":0.01562933,"about_ca_system_score_codex":0.0013524764,"about_ca_system_score_gemma":0.0011793278,"threshold_uncertainty_score":0.052285314},"labels":[],"label_agreement":null},{"id":"W4412888926","doi":"10.18653/v1/2025.findings-acl.24","title":"GUM-SAGE: A Novel Dataset and Approach for Graded Entity Salience Prediction","year":2025,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Killam Trusts; Georgetown University","keywords":"Salience (neuroscience); SAGE; Computer science; Artificial intelligence; Natural language processing","score_opus":0.018073711360074577,"score_gpt":0.2677527462332645,"score_spread":0.24967903487318993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412888926","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.054499283,0.0029277427,0.030824004,0.0009939431,0.0004602049,0.0008256285,0.8773915,0.022170788,0.009906791],"genre_scores_gemma":[0.034073606,0.0003435486,0.053614113,0.0002545251,0.00009972414,0.0007883861,0.9073418,0.00035162971,0.003132676],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987317,0.00027746113,0.00018700838,0.00042574035,0.00029432247,0.00008381385],"domain_scores_gemma":[0.9970606,0.0008306626,0.00031841034,0.0007538343,0.00078252144,0.0002539482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010679176,0.0016358132,0.0007424024,0.005387283,0.0009823121,0.0012013608,0.0018673119,0.0017053148,0.0042333235],"category_scores_gemma":[0.0066052545,0.00029495204,0.0008749582,0.0044302493,0.000446813,0.0022185622,0.0017105452,0.0013351605,0.0058059795],"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.0005758351,0.0005443494,0.020549862,0.0022496833,0.00022629889,0.0006342764,0.00059102906,0.0056475755,0.010669824,0.0047287494,0.7843837,0.16919883],"study_design_scores_gemma":[0.00055228034,0.0005178697,0.05884324,0.00039154565,0.0002579496,0.0014904483,0.0014241711,0.07279734,0.01904033,0.012672392,0.8317808,0.00023170089],"about_ca_topic_score_codex":0.010167833,"about_ca_topic_score_gemma":0.03965359,"teacher_disagreement_score":0.010167833,"about_ca_system_score_codex":0.000828295,"about_ca_system_score_gemma":0.0012091979,"threshold_uncertainty_score":0.0202173},"labels":[],"label_agreement":null},{"id":"W4412966531","doi":"10.1016/j.inffus.2025.103520","title":"QUARTER: An LLM-enhanced quaternion graph attention network for entity alignment between temporal knowledge graphs","year":2025,"lang":"en","type":"article","venue":"Information Fusion","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":1,"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":"Computer science; Quaternion; Quarter (Canadian coin); Knowledge graph; Graph; Artificial intelligence; Theoretical computer science; Mathematics; History; Geometry","score_opus":0.012164317643757175,"score_gpt":0.2747115916877629,"score_spread":0.2625472740440057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412966531","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.036392786,0.0016499291,0.935919,0.0007007613,0.0005242311,0.00016616624,0.0018918479,0.017595071,0.0051602568],"genre_scores_gemma":[0.61030495,0.00093933975,0.35843298,0.0012767767,0.00023596415,0.00018946477,0.0063810833,0.0007613892,0.021478083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996989,0.000036333007,0.000013871495,0.0001273195,0.00007214692,0.000051624746],"domain_scores_gemma":[0.99970275,0.00006759296,0.000025028985,0.000073691444,0.00009688488,0.00003404542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005541193,0.0010453202,0.0010344589,0.0013261928,0.00059223786,0.00087029865,0.002359297,0.0013312883,0.008756105],"category_scores_gemma":[0.0013631346,0.0005218452,0.0006593381,0.0018184173,0.0004005519,0.002081546,0.0021077532,0.001326803,0.0024031159],"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.0004951387,0.00025665588,0.0010323069,0.00015174605,0.00017211633,0.00017041393,0.00008600126,0.08164878,0.019250382,0.005256568,0.027891902,0.863588],"study_design_scores_gemma":[0.000019537943,0.000058703976,0.00048031146,0.000010199879,0.000034132507,0.000041103514,0.000022205297,0.986074,0.004764151,0.0051711355,0.0033095866,0.000015084625],"about_ca_topic_score_codex":0.02427691,"about_ca_topic_score_gemma":0.034639124,"teacher_disagreement_score":0.02427691,"about_ca_system_score_codex":0.0010937164,"about_ca_system_score_gemma":0.001230755,"threshold_uncertainty_score":0.04827124},"labels":[],"label_agreement":null},{"id":"W4413237958","doi":"10.1007/978-3-031-93257-1_9","title":"KG-ASI: A Knowledge Graph Enhanced Model-Based Retriever for Document Retrieval","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Advanced Graph Neural Networks","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":"Labrador Retriever; Information retrieval; Computer science; Graph; Medicine; Theoretical computer science; Surgery","score_opus":0.019017872780294647,"score_gpt":0.2598832846963172,"score_spread":0.24086541191602256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413237958","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.024998143,0.004458926,0.7873157,0.0004819614,0.00042533025,0.0005211633,0.0104254335,0.15818182,0.013191513],"genre_scores_gemma":[0.14091367,0.0019189414,0.8018515,0.0007942167,0.00018698926,0.0003645561,0.022606853,0.003175722,0.028187523],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99945706,0.00009180317,0.000037226855,0.000121084544,0.0002461269,0.000046707675],"domain_scores_gemma":[0.99959975,0.00011439631,0.000031826537,0.000120183475,0.000107846594,0.000026009353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006024618,0.0011341344,0.0019333408,0.00320296,0.00047797526,0.0014374268,0.0021568143,0.0012880198,0.013893093],"category_scores_gemma":[0.0011945001,0.0003829609,0.0010973059,0.0028225281,0.00031942705,0.0023852626,0.0012909416,0.00092653534,0.011959649],"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.0009805029,0.00035834464,0.0005428408,0.0007253975,0.00026360375,0.0002876393,0.00009092169,0.009504354,0.0674633,0.0042765997,0.08684445,0.82866204],"study_design_scores_gemma":[0.0003491503,0.0006919468,0.0025101092,0.000107075866,0.0005574784,0.0014621424,0.00018135925,0.75076944,0.12709767,0.016042963,0.10003936,0.0001913403],"about_ca_topic_score_codex":0.0049590254,"about_ca_topic_score_gemma":0.00688695,"teacher_disagreement_score":0.013893093,"about_ca_system_score_codex":0.00062112516,"about_ca_system_score_gemma":0.0006785732,"threshold_uncertainty_score":0.04647702},"labels":[],"label_agreement":null},{"id":"W4413417378","doi":"10.1109/tifs.2025.3598474","title":"Improving Ethereum Mixing Address Linking With Tensor Computation, Neighbor Data Utilization, and Asymmetric Information Modeling","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Advanced Graph Neural Networks","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":"Artificial Intelligence in Medicine (Canada)","funders":"National Natural Science Foundation of China","keywords":"Computer science; Computation; Mixing (physics); Tensor (intrinsic definition); Data modeling; Data mining; Theoretical computer science; Algorithm; Mathematics; Database","score_opus":0.024396067251862885,"score_gpt":0.2579054771110968,"score_spread":0.2335094098592339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413417378","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.12200791,0.00046663458,0.87114716,0.00034802937,0.00006176014,0.000072016905,0.00021948933,0.0025797193,0.0030972697],"genre_scores_gemma":[0.85950136,0.00027261488,0.13502787,0.00013242762,0.000058889225,0.00005417684,0.00072669715,0.00015978773,0.004066105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993193,0.00017456281,0.000038131748,0.00015074496,0.0002161543,0.00010120258],"domain_scores_gemma":[0.9988275,0.00033081966,0.00024235039,0.00030590736,0.00022056093,0.000072876035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010576022,0.0009081414,0.0007988578,0.0014896891,0.00066223333,0.0013050243,0.0009992146,0.0007918001,0.0015545299],"category_scores_gemma":[0.0041485853,0.00029768585,0.0005496963,0.0011409601,0.0006832617,0.0036437947,0.0015447873,0.0011000024,0.00061907084],"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.00043708098,0.0002749751,0.009876714,0.00014260458,0.000103329956,0.00027226648,0.0002720871,0.4554467,0.015439302,0.03524023,0.0048750676,0.47761962],"study_design_scores_gemma":[0.0000035337073,0.000022437558,0.00025690012,0.000003943948,0.000007671962,0.000031033418,0.000019447387,0.9900446,0.0031207667,0.0058162617,0.0006656705,0.000007785036],"about_ca_topic_score_codex":0.004831643,"about_ca_topic_score_gemma":0.007168634,"teacher_disagreement_score":0.004831643,"about_ca_system_score_codex":0.00082088896,"about_ca_system_score_gemma":0.001112874,"threshold_uncertainty_score":0.009607017},"labels":[],"label_agreement":null},{"id":"W4413796616","doi":"10.3233/ssw250009","title":"Knowledge Graph Completion for Action Prediction on Situational Graphs – A Case Study on Household Tasks","year":2025,"lang":"en","type":"book-chapter","venue":"Studies on the semantic web","topic":"Advanced Graph Neural Networks","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Knowledge graph; Situational ethics; Computer science; Graph; Machine learning; Artificial intelligence; Data science; Theoretical computer science; Psychology","score_opus":0.12493132450912324,"score_gpt":0.330926895850226,"score_spread":0.20599557134110275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413796616","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.3261667,0.002577325,0.64181477,0.0019355366,0.0001604398,0.0003961273,0.004280468,0.0033300272,0.019338619],"genre_scores_gemma":[0.74415594,0.0009280164,0.2397155,0.00022945058,0.000058636724,0.00015412812,0.0061827004,0.0003551027,0.008220504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943835,0.00024088906,0.00001793636,0.00017136823,0.00009476903,0.00003668182],"domain_scores_gemma":[0.996363,0.003009253,0.00008638728,0.00028785272,0.00016565721,0.00008792686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007986561,0.0005879746,0.0004065173,0.0007307683,0.00053201197,0.0005717951,0.0008946101,0.0010507071,0.004235302],"category_scores_gemma":[0.0056518763,0.00019672718,0.00048579904,0.0015223947,0.00044136148,0.0020469432,0.000692985,0.0013254718,0.00071188476],"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.00031595177,0.00064810796,0.0050751595,0.0005404847,0.00008802863,0.0008566872,0.000664857,0.45065823,0.0025549892,0.020645024,0.031473115,0.48647943],"study_design_scores_gemma":[0.000020360283,0.000063703934,0.0019922787,0.000035257097,0.000019484009,0.00013714406,0.00041581405,0.9518511,0.001919319,0.03270613,0.010824558,0.000014793956],"about_ca_topic_score_codex":0.015584379,"about_ca_topic_score_gemma":0.023996346,"teacher_disagreement_score":0.015584379,"about_ca_system_score_codex":0.00088808505,"about_ca_system_score_gemma":0.0007170475,"threshold_uncertainty_score":0.030987322},"labels":[],"label_agreement":null},{"id":"W4414189744","doi":"10.1016/j.inffus.2025.103744","title":"HyIE: An internal-external induced embedding for knowledge hypergraph link prediction","year":2025,"lang":"en","type":"article","venue":"Information Fusion","topic":"Advanced Graph Neural Networks","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":"Artificial Intelligence in Medicine (Canada)","funders":"National Key Research and Development Program of China; Department of Education of Liaoning Province; Natural Science Foundation of Liaoning Province; National Natural Science Foundation of China","keywords":"Hypergraph; Tuple; Embedding; Task (project management); Link (geometry); Code (set theory)","score_opus":0.014815556311270461,"score_gpt":0.2930214445258109,"score_spread":0.27820588821454045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414189744","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.016919736,0.0007281736,0.9718478,0.0004177774,0.00021283496,0.00016022737,0.0022332913,0.0052674417,0.0022127037],"genre_scores_gemma":[0.43961874,0.0008841987,0.5335932,0.0005974002,0.00023556099,0.000444383,0.01231523,0.0006789114,0.011632381],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990503,0.0002137295,0.00004699928,0.00030460462,0.0002965558,0.000087729044],"domain_scores_gemma":[0.99865496,0.00052897574,0.00007749685,0.0003895157,0.0002611212,0.000087944245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010634226,0.0012388156,0.0011346834,0.002170461,0.00060102023,0.0011577338,0.0018818321,0.0017860824,0.0040542358],"category_scores_gemma":[0.0045561674,0.00046504659,0.0011260465,0.0020059748,0.000604093,0.00328598,0.0032130373,0.0027145466,0.0018820507],"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.00052743516,0.0006121069,0.0029423272,0.00035436047,0.0003412902,0.00024326067,0.00019314709,0.13763651,0.0071247295,0.023729343,0.03561212,0.7906833],"study_design_scores_gemma":[0.0000236824,0.00006279501,0.0004425744,0.00003114032,0.00004747562,0.00005022384,0.000033849337,0.9670999,0.0024065052,0.02604285,0.0037409463,0.00001792216],"about_ca_topic_score_codex":0.005342093,"about_ca_topic_score_gemma":0.008235918,"teacher_disagreement_score":0.005342093,"about_ca_system_score_codex":0.00064176676,"about_ca_system_score_gemma":0.0012026007,"threshold_uncertainty_score":0.0135627985},"labels":[],"label_agreement":null},{"id":"W4414427902","doi":"10.1145/3749156","title":"A Comprehensive Benchmark on Spectral GNNs: The Impact on Efficiency, Memory, and Effectiveness","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Management of Data","topic":"Advanced Graph Neural Networks","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Nanyang Technological University; Ministry of Education - Singapore","keywords":"Benchmarking; Graph; Computation; Benchmark (surveying); Power graph analysis","score_opus":0.028643687810065883,"score_gpt":0.3161488555937306,"score_spread":0.28750516778366475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414427902","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.45228127,0.0070202127,0.48932168,0.0024427436,0.0009083007,0.00044166003,0.0028078696,0.013937554,0.030838685],"genre_scores_gemma":[0.79652655,0.0017975618,0.19302718,0.0006968562,0.00008587243,0.00023229622,0.0037485901,0.00089701265,0.0029881366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865294,0.0003347236,0.00010005021,0.00032916796,0.00036752413,0.00021562673],"domain_scores_gemma":[0.99500895,0.0026618678,0.00020336288,0.0010402646,0.0008963341,0.00018928103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022635348,0.001547973,0.0009944419,0.0013298,0.00079212955,0.001511725,0.0018737465,0.0016956822,0.0033911867],"category_scores_gemma":[0.013572955,0.00033197703,0.00081921206,0.0012606027,0.0010759989,0.0037612338,0.0013392575,0.0015108738,0.0010774477],"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.0008076993,0.00042196282,0.0047416165,0.001107908,0.0002222813,0.00017531673,0.00015894229,0.729959,0.00834077,0.02648868,0.014267781,0.21330804],"study_design_scores_gemma":[0.00006093071,0.00025602683,0.0007742235,0.000084399384,0.00005349481,0.00014101669,0.00014219698,0.96453166,0.010765629,0.018727886,0.0044343364,0.00002818169],"about_ca_topic_score_codex":0.009189421,"about_ca_topic_score_gemma":0.011574575,"teacher_disagreement_score":0.009189421,"about_ca_system_score_codex":0.0018499865,"about_ca_system_score_gemma":0.0018397497,"threshold_uncertainty_score":0.018271863},"labels":[],"label_agreement":null},{"id":"W4414925507","doi":"10.1016/j.knosys.2025.114537","title":"Efficient cluster-guided key timestamp discovery for temporal knowledge graph completion","year":2025,"lang":"en","type":"article","venue":"Knowledge-Based Systems","topic":"Advanced Graph Neural Networks","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":"York University","funders":"Hubei University; Ministry of Education of the People's Republic of China; National Natural Science Foundation of China","keywords":"Timestamp; Cluster analysis; Key (lock); Snapshot (computer storage); Relation (database); Temporal database; Graph; Feature learning","score_opus":0.02323406851963412,"score_gpt":0.292981318411024,"score_spread":0.2697472498913899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414925507","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.018416172,0.00047494003,0.97469145,0.00030904397,0.00014978005,0.00016446732,0.0010885404,0.0033960424,0.0013095652],"genre_scores_gemma":[0.45339304,0.0004623001,0.535665,0.00018200772,0.0001078464,0.00016647104,0.004899634,0.00039309615,0.004730671],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876237,0.00014204075,0.0000847733,0.00041637404,0.00040698325,0.0001874516],"domain_scores_gemma":[0.9975387,0.00076040614,0.00021573459,0.00068398606,0.000625669,0.0001756526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007964251,0.0010177958,0.0017494631,0.0024657347,0.0011810806,0.0016837777,0.0028128014,0.0010924086,0.0044943206],"category_scores_gemma":[0.006235545,0.00052985863,0.0009737094,0.0037624512,0.0007172184,0.0030535546,0.0029621315,0.00170786,0.0016308484],"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.0010034038,0.0003702613,0.0025759751,0.00048068375,0.0002105627,0.0002985433,0.0003921999,0.20253608,0.020061424,0.04100843,0.031048644,0.70001376],"study_design_scores_gemma":[0.000026220789,0.000042966407,0.0003824827,0.000013232381,0.00003576906,0.00008126979,0.00011266171,0.9583936,0.0062662354,0.031726353,0.0028980607,0.000021188787],"about_ca_topic_score_codex":0.021390632,"about_ca_topic_score_gemma":0.03404622,"teacher_disagreement_score":0.021390632,"about_ca_system_score_codex":0.0013791294,"about_ca_system_score_gemma":0.00472886,"threshold_uncertainty_score":0.042532206},"labels":[],"label_agreement":null},{"id":"W4415125331","doi":"10.1109/itc-egypt66095.2025.11186656","title":"Large Language Models in Intent-Based Networking: a Comprehensive Survey Across the Intent Lifecycle","year":2025,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"École de Technologie Supérieure","funders":"","keywords":"Adaptation (eye); TRACE (psycholinguistics); Interpretation (philosophy); Perspective (graphical); Taxonomy (biology); Decision support system","score_opus":0.03264229903850841,"score_gpt":0.31279302791893787,"score_spread":0.28015072888042947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415125331","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.017398827,0.34513932,0.581481,0.010655401,0.0007456688,0.00044413237,0.002429064,0.002961121,0.038745508],"genre_scores_gemma":[0.1891168,0.44955036,0.3368203,0.0034496924,0.0016199438,0.0009253588,0.007070942,0.0015589644,0.009887618],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99722654,0.00097197323,0.00031276897,0.00042986893,0.0009035441,0.0001552435],"domain_scores_gemma":[0.9888704,0.008707467,0.00039237333,0.0007613457,0.0010839707,0.00018452058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004377681,0.0014468638,0.001518511,0.0042259875,0.0007539436,0.0055306805,0.002548972,0.0017019981,0.0045545376],"category_scores_gemma":[0.013802178,0.0014176617,0.0019651037,0.004648581,0.0014446739,0.0103344275,0.0022973642,0.0035435895,0.0021478871],"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.00013518916,0.00027873032,0.0042212824,0.004756102,0.00023077594,0.0003594052,0.0018371649,0.063325986,0.0014612841,0.27670622,0.02969743,0.61699045],"study_design_scores_gemma":[0.000030284042,0.00016049207,0.0019447498,0.00416172,0.0002702679,0.0007970596,0.0012527113,0.2860679,0.0022139004,0.28889042,0.41401443,0.00019613779],"about_ca_topic_score_codex":0.010295713,"about_ca_topic_score_gemma":0.008527422,"teacher_disagreement_score":0.010295713,"about_ca_system_score_codex":0.0024816084,"about_ca_system_score_gemma":0.003962511,"threshold_uncertainty_score":0.023151636},"labels":[],"label_agreement":null},{"id":"W4415221919","doi":"10.1109/twc.2025.3619100","title":"A Deep Reinforcement Learning With Transformer Integration for Directed Acyclic Graph Scheduling in Edge Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Advanced Graph Neural Networks","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 Windsor; Carleton University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Directed acyclic graph; Reinforcement learning; Scheduling (production processes); Directed graph; Transformer; Job shop scheduling; Fair-share scheduling; Edge computing","score_opus":0.018165249650745268,"score_gpt":0.27414222639855773,"score_spread":0.25597697674781245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415221919","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.023392348,0.00021003427,0.9728421,0.0002803288,0.000057945854,0.00004518047,0.000049529222,0.0006082298,0.0025143435],"genre_scores_gemma":[0.87225616,0.00015060772,0.123844534,0.00029669813,0.00004054534,0.00008728743,0.0001246034,0.000099075856,0.0031004702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973375,0.00006992936,0.000011789522,0.00006901975,0.000051386836,0.00006416663],"domain_scores_gemma":[0.99936837,0.00036005865,0.000060978684,0.00003976061,0.000100241115,0.00007058307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075183314,0.0006044069,0.00072015653,0.0003527892,0.00026504425,0.0005959092,0.001131337,0.0006894252,0.0020796075],"category_scores_gemma":[0.0022771498,0.0003206426,0.00033530634,0.00036224007,0.0005325276,0.0008727995,0.00094108057,0.0011320269,0.00027261532],"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.00008678748,0.00007755601,0.00063520396,0.00004229454,0.000019600517,0.000042395903,0.000033552766,0.9333833,0.0013971009,0.007179527,0.001620728,0.055481866],"study_design_scores_gemma":[0.000004065246,0.000008124644,0.000015876014,0.0000011267816,0.0000015378384,0.0000026702087,0.0000016275125,0.9985411,0.00011942015,0.0012270245,0.00007651794,9.4794274e-7],"about_ca_topic_score_codex":0.0064671254,"about_ca_topic_score_gemma":0.007772401,"teacher_disagreement_score":0.0064671254,"about_ca_system_score_codex":0.0010090908,"about_ca_system_score_gemma":0.0016591841,"threshold_uncertainty_score":0.012858987},"labels":[],"label_agreement":null},{"id":"W4415295489","doi":"10.1093/bioinformatics/btag362","title":"Movi 2: Fast and Space-Efficient Queries on Pangenomes","year":2025,"lang":"en","type":"preprint","venue":"Bioinformatics","topic":"Advanced Graph Neural Networks","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":"Dalhousie University","funders":"","keywords":"Memory footprint; Search engine indexing; Space (punctuation); Footprint; Compression (physics); Variety (cybernetics)","score_opus":0.015049534014978837,"score_gpt":0.24618535397210797,"score_spread":0.23113581995712915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415295489","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.052050844,0.0024284434,0.6111247,0.002216955,0.0006414748,0.00068784243,0.03844696,0.27608216,0.016320638],"genre_scores_gemma":[0.16074945,0.0011665463,0.737072,0.00067524763,0.00038540518,0.0009697201,0.076380126,0.015354892,0.0072466605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982004,0.00027313398,0.00015508273,0.0005330547,0.0006694174,0.00016890436],"domain_scores_gemma":[0.9963457,0.0012648051,0.00021603193,0.0014626124,0.00050427346,0.00020650409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021941692,0.0018009199,0.0011564234,0.0031901076,0.001108123,0.0032598672,0.003519155,0.0013503914,0.011957232],"category_scores_gemma":[0.015246589,0.0011666868,0.0011779543,0.0051503475,0.0009902153,0.0052907835,0.0044583813,0.0018220919,0.005692327],"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.0014675393,0.0003338951,0.007664745,0.0016242926,0.00042432535,0.0004469911,0.00095413584,0.026626267,0.053889558,0.043242984,0.32740602,0.53591925],"study_design_scores_gemma":[0.00089596485,0.00036425763,0.005789649,0.0002174576,0.00018463358,0.0009201839,0.0006452211,0.6390938,0.08265811,0.095012195,0.17395015,0.0002683901],"about_ca_topic_score_codex":0.005022975,"about_ca_topic_score_gemma":0.008447524,"teacher_disagreement_score":0.011957232,"about_ca_system_score_codex":0.0012828972,"about_ca_system_score_gemma":0.0023227315,"threshold_uncertainty_score":0.040000916},"labels":[],"label_agreement":null},{"id":"W4415507753","doi":"10.1016/j.ipm.2025.104455","title":"DLGTrust: Graph neural network-based trust evaluation using dynamic line graph","year":2025,"lang":"en","type":"article","venue":"Information Processing & Management","topic":"Advanced Graph Neural Networks","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 British Columbia","funders":"Fundamental Research Funds for the Central Universities; Graduate Research and Innovation Projects of Jiangsu Province; Government of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Adaptability; Robustness (evolution); Graph; Dynamic network analysis; Global network; Adversarial system; Feature extraction; Artificial neural network; Exploit","score_opus":0.015648993961507193,"score_gpt":0.29236471202700687,"score_spread":0.27671571806549966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415507753","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.092353545,0.00078551617,0.88893,0.0007861742,0.00031482315,0.00041088334,0.0012854127,0.010060008,0.0050735874],"genre_scores_gemma":[0.8670806,0.00017698194,0.12732787,0.00018020894,0.00005906454,0.00016943841,0.0014418564,0.00026786447,0.0032961327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886703,0.0004160608,0.00006504463,0.00020237676,0.0003237094,0.00012579287],"domain_scores_gemma":[0.9975793,0.0009869231,0.00023022798,0.00036295483,0.0006708728,0.00016984773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017657921,0.0009353176,0.001091292,0.0013360815,0.0005211338,0.001251089,0.0014848369,0.0012563715,0.003880766],"category_scores_gemma":[0.0078006946,0.00028769491,0.0005245681,0.0010198244,0.00045918356,0.0025705195,0.0014209801,0.0012140129,0.0008631114],"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.0013585038,0.00062902813,0.0076824934,0.00027310502,0.0003350107,0.00023811728,0.00016106121,0.466972,0.003716159,0.010801196,0.026721977,0.48111138],"study_design_scores_gemma":[0.000015955506,0.000042176463,0.00022042499,0.0000052283444,0.000010887249,0.000011766177,0.000012181124,0.99621093,0.0005136448,0.0026379419,0.0003129049,0.00000594125],"about_ca_topic_score_codex":0.013858812,"about_ca_topic_score_gemma":0.017801946,"teacher_disagreement_score":0.013858812,"about_ca_system_score_codex":0.001610578,"about_ca_system_score_gemma":0.0011819927,"threshold_uncertainty_score":0.0275563},"labels":[],"label_agreement":null},{"id":"W4415626332","doi":"10.1016/j.eswa.2026.132374","title":"Modeling Heterophily in Multiplex Graphs: An Adaptive Approach for Node Classification","year":2025,"lang":"en","type":"preprint","venue":"Expert Systems with Applications","topic":"Advanced Graph Neural Networks","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 Montréal; Université du Québec à Montréal","funders":"","keywords":"Multiplex; Homophily; Node (physics); Graph; Class (philosophy); Directed graph","score_opus":0.07061930209504859,"score_gpt":0.3108450335913657,"score_spread":0.24022573149631715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415626332","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.11429203,0.0003094819,0.8832685,0.00043913216,0.00005361438,0.000064714724,0.00020075629,0.0003178503,0.0010539241],"genre_scores_gemma":[0.92602015,0.00026735797,0.07027064,0.00014032752,0.00013385869,0.00011901914,0.00025903666,0.000068378955,0.0027211104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992669,0.0002583441,0.000030238776,0.00024891002,0.00010061728,0.000094931864],"domain_scores_gemma":[0.9959997,0.0027175623,0.00043150724,0.00034068184,0.0003299167,0.00018069068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002153337,0.00075411954,0.0013217625,0.0015465916,0.0006647979,0.0013473731,0.0026663,0.001869221,0.0016685938],"category_scores_gemma":[0.008738752,0.0007322563,0.0010149799,0.0012859061,0.0009702025,0.0025820178,0.0012913635,0.0017550389,0.0003262267],"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.00012988021,0.00011056196,0.0036803323,0.000052613854,0.00008367092,0.0000654255,0.00010423845,0.93955415,0.0013590798,0.019462563,0.0011509707,0.034246422],"study_design_scores_gemma":[0.0000013591887,0.0000030556878,0.00009746783,0.0000014191687,0.0000034140096,0.000002761603,0.0000033355284,0.9963319,0.000049324393,0.0034758665,0.000028843382,0.0000013592055],"about_ca_topic_score_codex":0.0065231635,"about_ca_topic_score_gemma":0.007842443,"teacher_disagreement_score":0.0065231635,"about_ca_system_score_codex":0.0011512318,"about_ca_system_score_gemma":0.00060328346,"threshold_uncertainty_score":0.012970388},"labels":[],"label_agreement":null},{"id":"W4415722214","doi":"10.18280/ts.420512","title":"A Collaborative Learning Framework and Optimization Approach for Visual Tasks and Knowledge Graphs in Intelligent Education","year":2025,"lang":"","type":"article","venue":"Traitement du signal","topic":"Advanced Graph Neural Networks","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":"Collaborative learning; Knowledge graph; Task (project management); Collaborative software; Collaborative filtering","score_opus":0.011098715853871888,"score_gpt":0.30082413972688676,"score_spread":0.28972542387301486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415722214","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.005621335,0.00020707185,0.99184906,0.00024949823,0.00001846173,0.000032022814,0.00003739236,0.00020503896,0.0017801732],"genre_scores_gemma":[0.5587839,0.00047453018,0.43288007,0.00038799952,0.00012210153,0.00038823995,0.00031080082,0.00019034129,0.006461974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916553,0.00025650964,0.000041228148,0.00027628228,0.00014482695,0.000115691844],"domain_scores_gemma":[0.99898726,0.00054696423,0.00010222775,0.000099578734,0.00017008501,0.00009396508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015369005,0.0011296968,0.0011105632,0.001018223,0.00062259415,0.0014820774,0.002276202,0.001718999,0.003219306],"category_scores_gemma":[0.003740234,0.00061781454,0.0012689293,0.0010992666,0.0012357867,0.0025170015,0.0027332755,0.0021606928,0.00051775464],"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.00006117416,0.00012293916,0.00071143685,0.00008436722,0.000071707655,0.00008860956,0.00015281841,0.8776143,0.0014757594,0.03771186,0.0019375724,0.07996747],"study_design_scores_gemma":[0.0000044513667,0.000011934615,0.000049504935,0.000004458725,0.000006283303,0.000005572976,0.000009362255,0.9882108,0.00020251004,0.01110267,0.00038895817,0.000003384529],"about_ca_topic_score_codex":0.010843512,"about_ca_topic_score_gemma":0.010898271,"teacher_disagreement_score":0.010843512,"about_ca_system_score_codex":0.0016836757,"about_ca_system_score_gemma":0.0018359396,"threshold_uncertainty_score":0.021560788},"labels":[],"label_agreement":null},{"id":"W4416017186","doi":"10.1145/3746252.3761623","title":"QueryBridge: One Million Annotated Questions with SPARQL Queries - Dataset for Question Answering over Knowledge Graphs","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"SPARQL; Question answering; Benchmark (surveying); Knowledge graph; Natural language; Knowledge extraction; Linked data; Mean reciprocal rank","score_opus":0.01907335345570043,"score_gpt":0.3071836583070897,"score_spread":0.2881103048513893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416017186","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.02292865,0.0019479269,0.008417464,0.0014330706,0.00017345232,0.0005618585,0.9446085,0.013217031,0.0067120953],"genre_scores_gemma":[0.016178217,0.00020783863,0.011179324,0.00039269807,0.000020358642,0.0003667907,0.97026426,0.00027495573,0.0011155775],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963559,0.0009144194,0.00043691398,0.0011046279,0.0009313536,0.00025677524],"domain_scores_gemma":[0.99433446,0.0023361212,0.0003940135,0.0012061689,0.0012290451,0.00050022756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019561166,0.0026742101,0.0011041216,0.0040931846,0.0015915995,0.0019504386,0.0031750211,0.0047966917,0.012365572],"category_scores_gemma":[0.013641596,0.0006777194,0.0018490605,0.0043381373,0.0011947931,0.0039239046,0.0034033887,0.0027591714,0.009561625],"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.00079418416,0.0005920202,0.009491201,0.004606806,0.00028156905,0.0006397017,0.0007393037,0.008198626,0.005709348,0.0064649438,0.9183791,0.044103183],"study_design_scores_gemma":[0.0011760795,0.00056369096,0.03623402,0.00096605945,0.00029534352,0.0016751116,0.002586567,0.06264933,0.013637448,0.03266518,0.84726685,0.00028433045],"about_ca_topic_score_codex":0.036399372,"about_ca_topic_score_gemma":0.061875142,"teacher_disagreement_score":0.036399372,"about_ca_system_score_codex":0.0027695918,"about_ca_system_score_gemma":0.0029473281,"threshold_uncertainty_score":0.072375},"labels":[],"label_agreement":null},{"id":"W4416017410","doi":"10.1145/3746252.3761157","title":"Empirical Study of Over-Squashing in GNNs and Causal Estimation of Rewiring Strategies","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Ontario Tech University","funders":"","keywords":"Pairwise comparison; Empirical research; Graph; Uncorrelated; Node (physics); Range (aeronautics); Causal inference","score_opus":0.026987435852803048,"score_gpt":0.3531685401662192,"score_spread":0.3261811043134161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416017410","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.9094584,0.0022231624,0.08369777,0.00071744825,0.00010926536,0.00009618938,0.000600739,0.001265944,0.0018310804],"genre_scores_gemma":[0.9807616,0.00039628026,0.017180901,0.000095728945,0.000023733679,0.00006169418,0.00083922857,0.00011694109,0.0005239147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848145,0.00050347374,0.00012601516,0.00047065728,0.00025718223,0.00016114954],"domain_scores_gemma":[0.96583575,0.022460282,0.0034286547,0.0048310277,0.0026386804,0.0008055787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048076394,0.0009808153,0.0006152191,0.0016080713,0.00071920257,0.0006919437,0.0012795702,0.001073201,0.00076594163],"category_scores_gemma":[0.044941314,0.00047559472,0.00058382214,0.0011538519,0.0015657082,0.0030544738,0.0010447935,0.0017142702,0.00021757036],"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.00035428305,0.00020397118,0.068494834,0.0007313725,0.00032646986,0.00031182557,0.00044552403,0.81414425,0.0115036415,0.008429674,0.0037211296,0.0913331],"study_design_scores_gemma":[0.000031408243,0.00039221166,0.010613743,0.00007828437,0.00012279188,0.00034782838,0.00023953305,0.95958316,0.009892248,0.016818417,0.0018431874,0.000037100082],"about_ca_topic_score_codex":0.003849274,"about_ca_topic_score_gemma":0.008843187,"teacher_disagreement_score":0.0048076394,"about_ca_system_score_codex":0.0015226513,"about_ca_system_score_gemma":0.0008247831,"threshold_uncertainty_score":0.025425494},"labels":[],"label_agreement":null},{"id":"W4416017620","doi":"10.1145/3746252.3761152","title":"PriviRec: Confidential and Decentralized Graph Filtering for Recommender Systems","year":2025,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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; Agence Nationale de la Recherche","keywords":"Recommender system; Graph; Filter (signal processing); Aggregate (composite); Overhead (engineering); Collaborative filtering; Adjacency matrix","score_opus":0.011871318607505838,"score_gpt":0.27203517574353275,"score_spread":0.2601638571360269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416017620","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.0061659,0.00023811504,0.9872114,0.00042442707,0.000071020084,0.000103005776,0.00030658988,0.0031463352,0.002333253],"genre_scores_gemma":[0.4031288,0.00053543044,0.582889,0.00061335374,0.00022850587,0.0003594794,0.0016214855,0.0005200615,0.010103856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973641,0.00084093213,0.00010547602,0.0006122922,0.00087836065,0.00019878769],"domain_scores_gemma":[0.98988545,0.0032739162,0.00050442154,0.0048170793,0.0012271837,0.0002918274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032789644,0.0009463865,0.0014053013,0.00094894995,0.001356836,0.0018009422,0.0029147353,0.0019824868,0.0041659633],"category_scores_gemma":[0.013300495,0.00071247824,0.0009156892,0.0015422534,0.0010432339,0.0033288796,0.0024673538,0.0025214483,0.002024387],"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.0005765006,0.0003331684,0.0027095533,0.00037215892,0.00024849584,0.00024349772,0.00034447826,0.474381,0.0085510155,0.105086625,0.043208234,0.36394536],"study_design_scores_gemma":[0.00005678336,0.000043607663,0.00028034294,0.000012487217,0.000017694543,0.00007306776,0.000025963323,0.9594891,0.0017039485,0.032456238,0.0058179214,0.000022859644],"about_ca_topic_score_codex":0.008918393,"about_ca_topic_score_gemma":0.019527072,"teacher_disagreement_score":0.008918393,"about_ca_system_score_codex":0.001335116,"about_ca_system_score_gemma":0.003029302,"threshold_uncertainty_score":0.017732978},"labels":[],"label_agreement":null},{"id":"W4416026889","doi":"10.48550/arxiv.2511.04557","title":"Integrating Temporal and Structural Context in Graph Transformers for Relational Deep Learning","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Neural Networks","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":"Canadian Institute for Advanced Research; National Science Foundation","keywords":"Statistical relational learning; Deep learning; Relational database; Bottleneck; Feature learning; Relational model; Scalability; Graph","score_opus":0.034452809015373204,"score_gpt":0.28395939204992965,"score_spread":0.24950658303455645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416026889","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.033563323,0.00043099446,0.9609427,0.00042126796,0.000037820795,0.000048288908,0.00040797098,0.0027303603,0.0014173727],"genre_scores_gemma":[0.7514228,0.00067654817,0.24038373,0.0005351395,0.000060477974,0.00011958172,0.0022188248,0.00051990716,0.004062924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996106,0.00009797182,0.000017429848,0.00015826702,0.00007310572,0.000042705677],"domain_scores_gemma":[0.9991147,0.00037034106,0.00007437034,0.00025308412,0.00010539828,0.000082127954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089277385,0.0011422961,0.00074682134,0.0008244731,0.00044397873,0.0010619102,0.0021719474,0.00113329,0.0036423528],"category_scores_gemma":[0.0036223289,0.0005993022,0.0010705283,0.001084119,0.0009405616,0.004659606,0.0024712041,0.0027083703,0.0010142786],"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.00034970924,0.0003207495,0.0037657013,0.0002457947,0.00014181274,0.00023226808,0.00031120915,0.53641677,0.015128214,0.09051542,0.009717333,0.34285492],"study_design_scores_gemma":[0.000009600312,0.000031271727,0.00012653135,0.0000083161785,0.000013863902,0.000028080467,0.000016763646,0.95786643,0.001643665,0.03946944,0.00077921705,0.0000068730715],"about_ca_topic_score_codex":0.007477732,"about_ca_topic_score_gemma":0.018972734,"teacher_disagreement_score":0.007477732,"about_ca_system_score_codex":0.001597218,"about_ca_system_score_gemma":0.001105526,"threshold_uncertainty_score":0.014868438},"labels":[],"label_agreement":null},{"id":"W4416119567","doi":"","title":"Generalization and Distributed Learning of GFlowNets","year":2025,"lang":"en","type":"article","venue":"Research Explorer (The University of Manchester)","topic":"Advanced Graph Neural Networks","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":"Artificial Intelligence in Medicine (Canada)","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Engineering and Physical Sciences Research Council; Fundação de Amparo à Pesquisa do Estado de São Paulo; UK Research and Innovation","keywords":"Generalization; Feature (linguistics); Distributed learning; Key (lock); Active learning (machine learning)","score_opus":0.03736599860155435,"score_gpt":0.28325538532192346,"score_spread":0.2458893867203691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416119567","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.07043483,0.00020348451,0.92622423,0.00063311716,0.000029803467,0.000068014946,0.00010188018,0.00064940343,0.001655261],"genre_scores_gemma":[0.86952657,0.00017057719,0.12700143,0.0003929688,0.00007126207,0.0002222337,0.00040416818,0.0001521158,0.0020587177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852717,0.00048328156,0.00005528396,0.00052838976,0.00021626781,0.00018967479],"domain_scores_gemma":[0.99068695,0.006560579,0.0006163884,0.0012611413,0.0005653127,0.00030961278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042223088,0.0010331278,0.0012986042,0.000917078,0.0008104889,0.0011608856,0.0032160366,0.0016670504,0.0023275677],"category_scores_gemma":[0.020731306,0.00067997805,0.0010084704,0.0006179414,0.0024795295,0.0037020978,0.0035110782,0.0027049284,0.0003036472],"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.0001486346,0.000076680655,0.0026437852,0.000072226874,0.00004896034,0.00006722956,0.00012807458,0.89440084,0.0015037641,0.042844154,0.0013169362,0.056748662],"study_design_scores_gemma":[0.000011258665,0.00002158177,0.00014968694,0.000006099093,0.000004919325,0.000010676398,0.000008523778,0.9645421,0.0003550799,0.03473568,0.00015085866,0.0000036068068],"about_ca_topic_score_codex":0.0046739806,"about_ca_topic_score_gemma":0.0060282457,"teacher_disagreement_score":0.0046739806,"about_ca_system_score_codex":0.0021758191,"about_ca_system_score_gemma":0.001313717,"threshold_uncertainty_score":0.022329926},"labels":[],"label_agreement":null},{"id":"W4416249429","doi":"10.1109/ijcnn64981.2025.11229000","title":"Optimization of Graph Neural Networks Training Using Graph Reordering","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"National Natural Science Foundation of China","keywords":"Speedup; Graph; Artificial neural network; Training set; Convergence (economics); Dense graph; Attention network; Deep neural networks; Graph bandwidth","score_opus":0.03112615784146965,"score_gpt":0.2749506316482858,"score_spread":0.24382447380681616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416249429","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.1694486,0.00079279987,0.8157744,0.00075353554,0.00017074405,0.00016565312,0.00044791226,0.006504794,0.0059415777],"genre_scores_gemma":[0.61872685,0.0002709858,0.3750488,0.0003134354,0.000043730342,0.00021911704,0.0013234626,0.0005712987,0.0034823103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997054,0.00007797088,0.000016893755,0.00008048607,0.00006598951,0.00005324007],"domain_scores_gemma":[0.9988701,0.00067200675,0.0000911841,0.0001302629,0.00017938176,0.000057054967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046547037,0.0013426706,0.0007517722,0.0006235823,0.00039303213,0.0005600855,0.0012569532,0.00072727335,0.0025948158],"category_scores_gemma":[0.003429146,0.00042942353,0.00052789866,0.0006974865,0.00047346356,0.0012390977,0.00067217596,0.0008912019,0.00051487883],"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.00008140834,0.00005722387,0.0012705936,0.0000966359,0.000030628213,0.00008750698,0.000043529224,0.90170157,0.0031646555,0.0027200943,0.0031858222,0.08756027],"study_design_scores_gemma":[0.000006549052,0.000010866546,0.00008697206,0.0000023690159,0.0000028986842,0.000008145688,0.00001135107,0.99764293,0.00073313917,0.001280496,0.00021275006,0.000001462384],"about_ca_topic_score_codex":0.013219226,"about_ca_topic_score_gemma":0.029201137,"teacher_disagreement_score":0.013219226,"about_ca_system_score_codex":0.0010572266,"about_ca_system_score_gemma":0.0015467295,"threshold_uncertainty_score":0.026284575},"labels":[],"label_agreement":null},{"id":"W4416640682","doi":"10.1016/j.procs.2025.10.199","title":"TempHypE-GNN: Hyperbolic Graph Neural ODEs for Hierarchical Temporal Knowledge Graphs","year":2025,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Advanced Graph Neural Networks","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 Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ode; Ordinary differential equation; Euclidean geometry; Graph; Artificial neural network; Knowledge graph; Hyperbolic geometry","score_opus":0.014853810731522685,"score_gpt":0.2836115977305752,"score_spread":0.2687577869990525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416640682","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.025149075,0.0008377328,0.95410377,0.00075468933,0.00019468874,0.000118860204,0.0030891355,0.0080811065,0.007670976],"genre_scores_gemma":[0.48739353,0.0009949214,0.47928262,0.001092523,0.000119681994,0.00029098982,0.012972953,0.0011637318,0.016689152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999708,0.00004748025,0.000019322584,0.00011930275,0.000077144745,0.000028738472],"domain_scores_gemma":[0.9994766,0.0001949773,0.000050149007,0.00012723244,0.00011730842,0.00003364399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005213127,0.0011475082,0.0006815974,0.00084050803,0.00038250754,0.0012114085,0.002414192,0.0012505042,0.0044036885],"category_scores_gemma":[0.0031909083,0.0005643038,0.0012326791,0.00082173664,0.0006099676,0.0025141742,0.0015681649,0.0018583994,0.0014451665],"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.0000760032,0.000053068245,0.0012441851,0.00016779272,0.00009483119,0.00012957327,0.00007988208,0.81664604,0.0024177274,0.026508467,0.011385654,0.14119676],"study_design_scores_gemma":[0.000004127006,0.0000071719655,0.00007629296,0.0000055981977,0.000004445138,0.000013987483,0.000006225172,0.987038,0.00039166588,0.011175776,0.0012725047,0.0000041284666],"about_ca_topic_score_codex":0.023452701,"about_ca_topic_score_gemma":0.040763065,"teacher_disagreement_score":0.023452701,"about_ca_system_score_codex":0.0016944227,"about_ca_system_score_gemma":0.0011741695,"threshold_uncertainty_score":0.04663235},"labels":[],"label_agreement":null},{"id":"W4416701904","doi":"10.1016/j.inffus.2025.103998","title":"One model connects all graphs: Towards training one unified model for multi-domain graph pre-training using adaptive vector quantization","year":2025,"lang":"en","type":"article","venue":"Information Fusion","topic":"Advanced Graph Neural Networks","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":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Central China Normal University; China Postdoctoral Science Foundation; Natural Science Foundation of Hubei Province; Ministry of Education of the People's Republic of China; National Natural Science Foundation of China","keywords":"Codebook; Vector quantization; Graph; Quantization (signal processing); Linde–Buzo–Gray algorithm; Unified Model; Graph rewriting","score_opus":0.14712635504988855,"score_gpt":0.32211472557866716,"score_spread":0.1749883705287786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416701904","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.010520807,0.00022181377,0.98754984,0.00022672424,0.000048371734,0.000025904243,0.00010009149,0.0006766151,0.0006299094],"genre_scores_gemma":[0.57254064,0.00047659755,0.4205123,0.0005455377,0.00009269033,0.00016781458,0.0010269228,0.000396878,0.00424063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994729,0.0001425674,0.00002384111,0.00020387552,0.00009766943,0.000059114558],"domain_scores_gemma":[0.999012,0.00040018096,0.00007685555,0.00023827651,0.00020788971,0.00006483679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010154175,0.00087442895,0.0012090257,0.0007065392,0.00037268832,0.0010259545,0.002248871,0.0016448833,0.0020011703],"category_scores_gemma":[0.0035753117,0.00055173616,0.0009634753,0.00101629,0.00092469825,0.0026313388,0.0016951115,0.0032629997,0.0008049081],"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.00013319544,0.000116766496,0.00075448205,0.00010497772,0.000089465335,0.000053034975,0.0001213537,0.74256295,0.0049357344,0.022821201,0.0046763853,0.22363046],"study_design_scores_gemma":[0.000002581788,0.00001261046,0.000058908852,0.000005756495,0.0000058515366,0.000005658376,0.000007054505,0.9919086,0.0003803817,0.007377243,0.00023206543,0.0000031912405],"about_ca_topic_score_codex":0.007976851,"about_ca_topic_score_gemma":0.012320453,"teacher_disagreement_score":0.007976851,"about_ca_system_score_codex":0.00083738595,"about_ca_system_score_gemma":0.0009720974,"threshold_uncertainty_score":0.015860856},"labels":[],"label_agreement":null},{"id":"W4416829144","doi":"10.1016/j.engappai.2025.113229","title":"Spatiotemporal knowledge graph multi-hop reasoning based on large language models","year":2025,"lang":"en","type":"article","venue":"Engineering Applications of Artificial Intelligence","topic":"Advanced Graph Neural Networks","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":"Novelis (Canada)","funders":"National Natural Science Foundation of China","keywords":"Knowledge graph; Graph; Natural language; Generalization; Question answering; Natural language understanding; Knowledge representation and reasoning; Reasoning system; Language model","score_opus":0.019350466157026,"score_gpt":0.29547661817445187,"score_spread":0.27612615201742585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416829144","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.04297725,0.0005663811,0.945894,0.0011404832,0.000105024716,0.00019917001,0.0028725718,0.0024319,0.0038132393],"genre_scores_gemma":[0.6935125,0.00069018075,0.296368,0.00037618354,0.00008042751,0.00016337947,0.005139302,0.00023714965,0.003432924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988619,0.00020606456,0.00011680327,0.00042069392,0.00031083322,0.00008371358],"domain_scores_gemma":[0.99703765,0.0018934906,0.00021180116,0.0003974989,0.00035129456,0.00010827859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090849097,0.0007877868,0.0010808258,0.002909622,0.0010706986,0.0024254518,0.0023337812,0.0013133754,0.0038467553],"category_scores_gemma":[0.007321337,0.00059176615,0.002219508,0.0022076399,0.0009081378,0.0062525254,0.0020125418,0.0018376994,0.0007693692],"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.00045589998,0.00044964635,0.007033589,0.000677284,0.0005327909,0.0020898357,0.00096435915,0.57278466,0.008364415,0.12413259,0.01370308,0.26881185],"study_design_scores_gemma":[0.000012241629,0.000014806821,0.0003166022,0.000020223726,0.000065701955,0.00007441926,0.0000869012,0.9384664,0.001196578,0.05839874,0.0013318707,0.000015459203],"about_ca_topic_score_codex":0.03065238,"about_ca_topic_score_gemma":0.041353367,"teacher_disagreement_score":0.03065238,"about_ca_system_score_codex":0.001529916,"about_ca_system_score_gemma":0.0017588021,"threshold_uncertainty_score":0.060947895},"labels":[],"label_agreement":null},{"id":"W4416873377","doi":"10.1109/icdcsw63273.2025.00037","title":"Analysis and Tuning of Knowledge Distillation for Efficient Collaborative Learning","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Kootenay Association for Science & Technology","funders":"","keywords":"Hyperparameter; Collaborative learning; Transfer of learning; Set (abstract data type); Collaborative filtering; Knowledge transfer","score_opus":0.0092921168834062,"score_gpt":0.2884298949604294,"score_spread":0.2791377780770232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416873377","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.1911547,0.0012720975,0.8003903,0.0006176118,0.00008213157,0.00021147041,0.0001446392,0.0014723485,0.0046547567],"genre_scores_gemma":[0.91196966,0.00020998083,0.08669535,0.000110932226,0.000022469583,0.00015352949,0.00017810325,0.00010994201,0.00055000006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698395,0.0011948475,0.00018902689,0.0006990079,0.00061969546,0.00031356694],"domain_scores_gemma":[0.9833899,0.011841328,0.0007014139,0.002183241,0.0014036489,0.00048039845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007005278,0.0008507461,0.0010184112,0.000880501,0.0009486304,0.0016874173,0.0021759258,0.0015426435,0.0015613952],"category_scores_gemma":[0.041187964,0.00053338846,0.00043633397,0.00084374024,0.0015074183,0.004742548,0.003100677,0.002214328,0.00045791923],"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.00034986084,0.00042340797,0.0042828117,0.0003006105,0.00010404437,0.000073967814,0.0002544583,0.80266434,0.0050147404,0.01839845,0.0020742936,0.16605906],"study_design_scores_gemma":[0.000020869711,0.000047478345,0.00027682848,0.000013754694,0.000009647779,0.000017291322,0.000039550796,0.98994535,0.0022964524,0.0069427122,0.0003818381,0.000008194267],"about_ca_topic_score_codex":0.0038280387,"about_ca_topic_score_gemma":0.003770929,"teacher_disagreement_score":0.007005278,"about_ca_system_score_codex":0.0014975772,"about_ca_system_score_gemma":0.0025901208,"threshold_uncertainty_score":0.037047863},"labels":[],"label_agreement":null},{"id":"W4416968605","doi":"10.48550/arxiv.2512.01890","title":"Elastic Weight Consolidation for Knowledge Graph Continual Learning: An Empirical Evaluation","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Neural Networks","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":"Alberta Innovates; Natural Sciences and Engineering Research Council of Canada; Athabasca University","keywords":"Forgetting; Embedding; Consolidation (business); Artificial neural network; Task (project management); Graph; Contrast (vision); Relation (database)","score_opus":0.10110134083423716,"score_gpt":0.38533952337047955,"score_spread":0.2842381825362424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416968605","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.83002,0.00509191,0.14626125,0.0015415953,0.0005564922,0.0009172198,0.0016980951,0.008785027,0.0051284954],"genre_scores_gemma":[0.9128631,0.00061317964,0.08087873,0.00033615337,0.00008220958,0.00039323687,0.0028970083,0.00030884697,0.0016276141],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99613404,0.0016159669,0.00032596188,0.0008597905,0.00075671985,0.00030761134],"domain_scores_gemma":[0.9775348,0.011384687,0.0011391796,0.0064965873,0.0026640692,0.00078079285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011284467,0.0020837877,0.0011636972,0.001436237,0.0007814666,0.0012143846,0.0030412772,0.0023356336,0.0017280402],"category_scores_gemma":[0.041235212,0.00061012636,0.00084545364,0.0013643535,0.0017745949,0.005227386,0.0028520878,0.0030094462,0.0007346558],"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.0026620447,0.0028359732,0.03185986,0.0010791558,0.00068232295,0.00015906138,0.00031461733,0.466477,0.0057783956,0.0036902057,0.014783692,0.46967775],"study_design_scores_gemma":[0.00014008247,0.0010797726,0.0026468853,0.0000867297,0.00010790011,0.00007309895,0.00010046468,0.9843053,0.005626469,0.0043554693,0.0014472295,0.000030559306],"about_ca_topic_score_codex":0.0064049014,"about_ca_topic_score_gemma":0.010500704,"teacher_disagreement_score":0.011284467,"about_ca_system_score_codex":0.001597872,"about_ca_system_score_gemma":0.0015887484,"threshold_uncertainty_score":0.059678674},"labels":[],"label_agreement":null},{"id":"W4416968636","doi":"10.48550/arxiv.2512.01878","title":"Graph Distance as Surprise: Free Energy Minimization in Knowledge Graph Reasoning","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Neural Networks","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":"Alberta Innovates; Natural Sciences and Engineering Research Council of Canada; Athabasca University","keywords":"Surprise; Graph; Null graph; Moral graph; Clique-width; Directed graph; Graph theory; Graph rewriting","score_opus":0.021036755373346216,"score_gpt":0.27168736994520704,"score_spread":0.25065061457186083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416968636","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.03624282,0.00035394818,0.95627254,0.0015460501,0.00006175901,0.000040807212,0.00012377113,0.0002874002,0.0050708936],"genre_scores_gemma":[0.7547026,0.00047102018,0.23949827,0.0005601692,0.00007626612,0.0001546474,0.0003677132,0.0002849255,0.0038843218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985734,0.00056917424,0.000078396995,0.0003673889,0.00032647853,0.00008498648],"domain_scores_gemma":[0.99388736,0.004067826,0.0005054673,0.0007995988,0.00046182747,0.0002779584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021077923,0.0006544873,0.0008104734,0.00090962084,0.0008704574,0.0021484015,0.0016960955,0.0018332117,0.0036481337],"category_scores_gemma":[0.016216971,0.00047813065,0.0011608214,0.00082111155,0.0028892006,0.007270449,0.002621804,0.002339085,0.0003993069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015101639,0.00007226812,0.0019575795,0.00032908033,0.00013003637,0.00025049236,0.00078604097,0.2574373,0.0030525255,0.6604381,0.0030331886,0.072362386],"study_design_scores_gemma":[0.000008824337,0.000028670636,0.00021072818,0.0000170857,0.00001603679,0.000045756027,0.000072899435,0.26392424,0.0006552527,0.7338081,0.0011999318,0.00001249012],"about_ca_topic_score_codex":0.0017554215,"about_ca_topic_score_gemma":0.0018787009,"teacher_disagreement_score":0.0036481337,"about_ca_system_score_codex":0.0016630818,"about_ca_system_score_gemma":0.0009131795,"threshold_uncertainty_score":0.01220423},"labels":[],"label_agreement":null},{"id":"W4417069564","doi":"10.23977/cpcs.2025.090111","title":"Research on Fault Diagnosis and Disposal Suggestions Method of Power Communication Network Based on Dynamic Event Driven Knowledge Graph","year":2025,"lang":"","type":"article","venue":"Computing Performance and Communication systems","topic":"Advanced Graph Neural Networks","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":"Timestamp; Asynchronous communication; Telecommunications network; Event (particle physics); Fault (geology); Network topology; Knowledge-based systems; Root cause; Power (physics); Graph","score_opus":0.036703014734517994,"score_gpt":0.3836429242701658,"score_spread":0.3469399095356478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417069564","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.018542161,0.0005520428,0.97716767,0.00036676857,0.000051374893,0.00008694788,0.00013461204,0.0007841969,0.0023142428],"genre_scores_gemma":[0.7385222,0.0011676138,0.25468644,0.00018651059,0.00007030962,0.00014199603,0.00056200003,0.00009187321,0.004571081],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922967,0.00012323972,0.00005608747,0.00030296636,0.00022599411,0.00006209578],"domain_scores_gemma":[0.99931836,0.00027503524,0.00008166043,0.000069994894,0.00021589987,0.00003921605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005125717,0.0008029913,0.00063792494,0.0020183788,0.0006742641,0.001253132,0.0012894579,0.00076091057,0.0018643866],"category_scores_gemma":[0.0021959194,0.0003015754,0.00078798877,0.0014108415,0.00052717206,0.0026902913,0.00070037233,0.00069407787,0.00023559811],"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.00020062026,0.00015983496,0.005553688,0.0004866809,0.00017179643,0.0004423825,0.0006739934,0.29283625,0.008503604,0.044420436,0.0056597698,0.6408909],"study_design_scores_gemma":[0.00001613063,0.0000334575,0.00092061935,0.000018568066,0.00006008685,0.00014680393,0.00012318492,0.97521216,0.0036270288,0.017552093,0.0022693588,0.000020541294],"about_ca_topic_score_codex":0.0117927035,"about_ca_topic_score_gemma":0.008462403,"teacher_disagreement_score":0.0117927035,"about_ca_system_score_codex":0.0014562439,"about_ca_system_score_gemma":0.0013564768,"threshold_uncertainty_score":0.02344811},"labels":[],"label_agreement":null},{"id":"W4417093036","doi":"10.48550/arxiv.2505.10806","title":"RapidGNN: Communication Efficient Large-Scale Distributed Training of Graph Neural Networks","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Neural Networks","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":"Cache; Computation; Feature (linguistics); Overhead (engineering); Latency (audio); Training (meteorology); Artificial neural network; Graph; Energy consumption","score_opus":0.03409712801625521,"score_gpt":0.2749098831397769,"score_spread":0.24081275512352168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417093036","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.13162483,0.0025392405,0.8153251,0.0017592947,0.00052930164,0.00043386876,0.0022961837,0.03648359,0.009008569],"genre_scores_gemma":[0.6615264,0.000673688,0.3194924,0.000947937,0.00014961975,0.00054052763,0.0076446137,0.0012743904,0.007750524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994684,0.00012069716,0.000024404653,0.00020712009,0.00011217354,0.000067294015],"domain_scores_gemma":[0.99827135,0.0008969865,0.000106441075,0.00035892124,0.00028814646,0.000078247365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009770194,0.0013479006,0.00085143576,0.0006873243,0.0005700766,0.00075929455,0.0031319389,0.0011394966,0.0027236755],"category_scores_gemma":[0.004970337,0.00065726676,0.000700066,0.00086468447,0.0006177082,0.0021029175,0.0012477373,0.0018045796,0.0010683571],"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.00023548145,0.00021798069,0.0020391713,0.00023254212,0.000087401364,0.00013061933,0.00006793855,0.81932044,0.0024037887,0.0036668736,0.021611787,0.149986],"study_design_scores_gemma":[0.000022011078,0.000018823734,0.00012064994,0.000004127571,0.000006204514,0.000013179162,0.000010227398,0.995676,0.00063887844,0.0027485131,0.0007381177,0.0000031836196],"about_ca_topic_score_codex":0.017813481,"about_ca_topic_score_gemma":0.042866927,"teacher_disagreement_score":0.017813481,"about_ca_system_score_codex":0.0014426688,"about_ca_system_score_gemma":0.001782859,"threshold_uncertainty_score":0.035419583},"labels":[],"label_agreement":null},{"id":"W4417196708","doi":"10.1145/3780098","title":"Enhancing Interpretability of Graph Convolutional Networks for Multi-view Learning","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Multimedia Computing Communications and Applications","topic":"Advanced Graph Neural Networks","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Interpretability; Graph; Feature learning; Convolutional neural network; Feature (linguistics); Subspace topology; Variety (cybernetics)","score_opus":0.02565939714885769,"score_gpt":0.32000155520011303,"score_spread":0.29434215805125535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417196708","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.024048451,0.00018716889,0.9739206,0.00025424227,0.000019319968,0.000021300299,0.000085106265,0.0004829571,0.0009808617],"genre_scores_gemma":[0.77237636,0.0006010189,0.22196825,0.00038040284,0.00008621978,0.00012346728,0.0007511898,0.00026928773,0.0034438153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993217,0.00020845175,0.000028022532,0.00022531915,0.00014240832,0.00007418753],"domain_scores_gemma":[0.9981998,0.00088849943,0.00025759512,0.0002797158,0.0002831877,0.00009114456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011755857,0.001519067,0.0008621842,0.0008827027,0.00041038115,0.001082192,0.0019177255,0.0017682281,0.0013693925],"category_scores_gemma":[0.0055551725,0.0006038403,0.0010329689,0.00094426726,0.0013339117,0.0028200452,0.0021002796,0.0025407434,0.00036192976],"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.000113448004,0.00008107091,0.0018110349,0.00011848852,0.000086336986,0.00020146274,0.00021121591,0.827162,0.0122694755,0.03357608,0.0019068308,0.12246254],"study_design_scores_gemma":[0.0000028910274,0.000012482993,0.0001059569,0.0000039128995,0.0000065282975,0.000015220667,0.000005743582,0.9903094,0.0009308699,0.008394897,0.00020795826,0.000004086302],"about_ca_topic_score_codex":0.0068058874,"about_ca_topic_score_gemma":0.009257857,"teacher_disagreement_score":0.0068058874,"about_ca_system_score_codex":0.0013649148,"about_ca_system_score_gemma":0.0009648201,"threshold_uncertainty_score":0.013532579},"labels":[],"label_agreement":null},{"id":"W4417267046","doi":"10.1007/s10618-025-01180-w","title":"Certifying robustness of graph convolutional networks for node perturbation with polyhedra abstract interpretation","year":2025,"lang":"en","type":"article","venue":"Data Mining and Knowledge Discovery","topic":"Advanced Graph Neural Networks","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":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal; Mitacs; Knut och Alice Wallenbergs Stiftelse","keywords":"Robustness (evolution); Graph; Convolutional neural network; Adversarial system; Polyhedron; Training set","score_opus":0.031970765629140495,"score_gpt":0.29588145799663446,"score_spread":0.263910692367494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417267046","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.08703447,0.0003745577,0.90380573,0.0013030019,0.00017771011,0.00008572472,0.0007600314,0.0023874238,0.004071386],"genre_scores_gemma":[0.92251664,0.0003207202,0.07161448,0.00046748918,0.00021654434,0.00012121856,0.0015736077,0.0005769086,0.0025924048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99603623,0.0009125374,0.00022458608,0.0013185038,0.0011080079,0.00040020057],"domain_scores_gemma":[0.97530365,0.0153137455,0.0018317548,0.005014525,0.0019631581,0.000573186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004447351,0.0015028664,0.0016829441,0.0020160712,0.0008619669,0.0028603137,0.0036179363,0.002804296,0.003980623],"category_scores_gemma":[0.045672234,0.0007803928,0.0019986702,0.0011311937,0.0041475375,0.0053836405,0.005294321,0.0044952887,0.0005867841],"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.0006589548,0.00008332142,0.0033973847,0.00029923097,0.00025635524,0.00037511578,0.0001680826,0.7384124,0.007003783,0.1924198,0.0051121796,0.051813543],"study_design_scores_gemma":[0.000011492405,0.000027692377,0.00028842446,0.000018766106,0.000018260793,0.000037275895,0.000015703732,0.8305683,0.0022787997,0.16639976,0.0003245323,0.000011047775],"about_ca_topic_score_codex":0.0041252184,"about_ca_topic_score_gemma":0.0030242687,"teacher_disagreement_score":0.004447351,"about_ca_system_score_codex":0.0026717861,"about_ca_system_score_gemma":0.0017197995,"threshold_uncertainty_score":0.023520172},"labels":[],"label_agreement":null},{"id":"W4417525595","doi":"10.48550/arxiv.2504.21780","title":"MAGNET: an open-source library for mesh agglomeration by Graph Neural Networks","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Neural Networks","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":"Discretization; Python (programming language); Cluster analysis; Artificial neural network; Computation; Graph partition; Graph; Convolutional neural network; Partition (number theory)","score_opus":0.028620861627551304,"score_gpt":0.2765868882452868,"score_spread":0.2479660266177355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417525595","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.0024036907,0.00024026491,0.85218495,0.00023122672,0.00015532861,0.00011342731,0.005078486,0.13242921,0.007163387],"genre_scores_gemma":[0.060218867,0.0008535579,0.85416514,0.000655534,0.00010135095,0.0008941769,0.018062383,0.04701779,0.018031096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996295,0.000042470183,0.000025792238,0.00007345331,0.00018397308,0.00004485874],"domain_scores_gemma":[0.9994393,0.00019114008,0.000053611442,0.00012649248,0.00012904835,0.00006039118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005010508,0.001608778,0.0009017199,0.0010465452,0.0006744954,0.0014155478,0.00433288,0.0013480984,0.03920739],"category_scores_gemma":[0.0025516562,0.0009880738,0.0017123137,0.001020935,0.0006878738,0.002045397,0.0025533766,0.002421999,0.01814464],"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.00018711502,0.00019918838,0.002678583,0.0020620797,0.0003070202,0.00044557048,0.0003005043,0.34581986,0.01118026,0.068690404,0.2861921,0.28193724],"study_design_scores_gemma":[0.000059872273,0.00003440156,0.00044494547,0.00010071828,0.000021221977,0.00017676743,0.00003215063,0.8496811,0.007992968,0.04022096,0.10118046,0.000054568616],"about_ca_topic_score_codex":0.0056626513,"about_ca_topic_score_gemma":0.0139486585,"teacher_disagreement_score":0.03920739,"about_ca_system_score_codex":0.0009924046,"about_ca_system_score_gemma":0.001979323,"threshold_uncertainty_score":0.13116181},"labels":[],"label_agreement":null},{"id":"W6889109823","doi":"10.25384/sage.c.5019014.v1","title":"Comparing Perspectives of Canadian Men Diagnosed With Prostate Cancer and Health Care Professionals About Active Surveillance","year":2020,"lang":"en","type":"other","venue":"Sage Journals Data","topic":"Advanced Graph Neural Networks","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":"Viewpoints; Focus group; Prostate cancer; Qualitative research; Health professionals; Perspective (graphical); Standardization; Health care; Disease","score_opus":0.045021422897711126,"score_gpt":0.3382906772689971,"score_spread":0.293269254371286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6889109823","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.9902208,0.0009948204,0.0002777251,0.0039054237,0.00006326554,0.000093854,0.00029424365,0.0000055024557,0.0041443454],"genre_scores_gemma":[0.99580365,0.000888996,0.00034764962,0.0017482212,0.000024132758,0.000070755676,0.00017754317,0.000008901446,0.0009301909],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99042517,0.0040526697,0.00037174477,0.000558742,0.0022580621,0.0023335519],"domain_scores_gemma":[0.9844409,0.0060082837,0.0017547562,0.00021167166,0.004040376,0.0035439327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008162504,0.00054421666,0.00067790516,0.0026000636,0.016289491,0.0042649424,0.0016615568,0.0015837535,0.0026312785],"category_scores_gemma":[0.018781886,0.0005936451,0.00075107225,0.0032016886,0.007286152,0.0018348747,0.004851817,0.0026574514,0.00017382154],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008460535,0.000024673956,0.024705173,0.00013974776,0.000013638474,0.0003850366,0.9684368,0.00002637234,0.0004575537,0.0004234623,0.0009970897,0.0043059797],"study_design_scores_gemma":[0.000008558006,0.000044120552,0.02048352,0.00017321321,0.00001187706,0.00009797145,0.9741434,0.00006362879,0.00009145985,0.00006943964,0.0047791437,0.00003360954],"about_ca_topic_score_codex":0.9204353,"about_ca_topic_score_gemma":0.9384059,"teacher_disagreement_score":0.07956469,"about_ca_system_score_codex":0.052993353,"about_ca_system_score_gemma":0.054769013,"threshold_uncertainty_score":0.3844955},"labels":[],"label_agreement":null},{"id":"W6889933543","doi":"10.3205/17dgpraec065","title":"Die Bedeutung von Gleitgewebelappen bei schweren neuropathischen Schmerzsyndromen","year":2017,"lang":"de","type":"article","venue":"German Medical Science (German Research Foundation)","topic":"Advanced Graph Neural Networks","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":"Miller Group (Canada)","funders":"","keywords":"Nucleofection; Gestational period; TSG101; Dysgeusia; Diafiltration; Liquation; Triacetin; Emperipolesis; Demotion","score_opus":0.0803657934816971,"score_gpt":0.4380915166649187,"score_spread":0.3577257231832216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6889933543","genre_codex":"review","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.4052188,0.46623665,0.054019235,0.025537208,0.0021251822,0.000109967106,0.0010407297,0.00051610515,0.045196075],"genre_scores_gemma":[0.91374123,0.06996032,0.00940356,0.0013525606,0.00086804485,0.000030444891,0.00037607926,0.00006197102,0.004205735],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9998084,0.000061704224,0.000021909065,0.00003358014,0.000053512762,0.000020930034],"domain_scores_gemma":[0.9991111,0.0005027493,0.0001745053,0.000045047756,0.00010316807,0.00006340314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003639568,0.00039640814,0.00034709607,0.001034999,0.0002493559,0.00081323215,0.00031117335,0.0008011918,0.0026599271],"category_scores_gemma":[0.0033026028,0.00013547737,0.0003300234,0.0005274819,0.00050575804,0.0010702519,0.00034735276,0.0009869392,0.0006955373],"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.0015594555,0.00013477915,0.055238143,0.002629034,0.00044505319,0.016408604,0.00040033343,0.008094065,0.02428437,0.01011282,0.011694404,0.868999],"study_design_scores_gemma":[0.0004417367,0.0019089978,0.24781774,0.0059136236,0.002039261,0.29208785,0.0021996028,0.05812471,0.04820177,0.15948583,0.1813564,0.00042251305],"about_ca_topic_score_codex":0.0019790584,"about_ca_topic_score_gemma":0.0035255286,"teacher_disagreement_score":0.0026599271,"about_ca_system_score_codex":0.00040762307,"about_ca_system_score_gemma":0.0003170611,"threshold_uncertainty_score":0.008898318},"labels":[],"label_agreement":null},{"id":"W6891669911","doi":"10.4230/lipics.cp.2024.22","title":"Learning Lagrangian Multipliers for the Travelling Salesman Problem","year":2024,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Graph Neural Networks","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":"Artificial Intelligence in Medicine (Canada); Polytechnique Montréal","funders":"","keywords":"Lagrangian relaxation; Subgradient method; Lagrange multiplier; Travelling salesman problem; Metric (unit); Lagrangian; Relaxation (psychology); Augmented Lagrangian method; Bottleneck traveling salesman problem","score_opus":0.011075608698125449,"score_gpt":0.23553499333388206,"score_spread":0.2244593846357566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891669911","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.0115423305,0.00020245193,0.98409444,0.00032927102,0.000046418118,0.00008489169,0.00011381494,0.0003095818,0.0032768718],"genre_scores_gemma":[0.24705198,0.00048812153,0.7460074,0.00030020802,0.00011374883,0.00050270825,0.0006695432,0.000294941,0.0045714024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939513,0.00023934283,0.000029298577,0.00013476651,0.00013206727,0.0000693573],"domain_scores_gemma":[0.9976254,0.0016404407,0.00027370238,0.00012395864,0.00025659145,0.00007989721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018260578,0.0012850049,0.0009003686,0.0007200938,0.00047174466,0.0010127404,0.0011474272,0.0012490834,0.004892291],"category_scores_gemma":[0.007789147,0.00061842566,0.0008385989,0.0007462448,0.0008894153,0.0015020474,0.0010586018,0.0029385204,0.0009990181],"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.000040273997,0.000060098977,0.00033171815,0.00009769615,0.000023113675,0.00004071867,0.000041737985,0.9303565,0.0008766192,0.023270058,0.0023967286,0.042464677],"study_design_scores_gemma":[0.000010523268,0.000019860012,0.0000335845,0.000010142902,0.0000029922091,0.000006761161,0.000005381212,0.9895806,0.0002454749,0.00958539,0.0004963695,0.0000031056775],"about_ca_topic_score_codex":0.0029412126,"about_ca_topic_score_gemma":0.0036937427,"teacher_disagreement_score":0.004892291,"about_ca_system_score_codex":0.0013767941,"about_ca_system_score_gemma":0.0020580147,"threshold_uncertainty_score":0.016366363},"labels":[],"label_agreement":null},{"id":"W6892721638","doi":"10.5281/zenodo.12573103","title":"CIRAIG/Regioinvent: v1.0.1","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Advanced Graph Neural Networks","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":"Coal; Production (economics); Consumption (sociology); Electricity; Energy consumption; Electricity generation","score_opus":0.03245608995530128,"score_gpt":0.2483898152580734,"score_spread":0.21593372530277213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6892721638","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.0012359987,0.0008644961,0.04790876,0.0013701417,0.00081287714,0.00034890784,0.17635743,0.55081975,0.22028166],"genre_scores_gemma":[0.025532382,0.0012476529,0.04111288,0.0018131417,0.0003651145,0.0010060404,0.45742834,0.31422257,0.15727186],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987411,0.00022749508,0.00006655993,0.00023731125,0.00045290115,0.00027472357],"domain_scores_gemma":[0.99813807,0.0003144069,0.00009483223,0.00086470036,0.0003450928,0.00024288117],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0023733953,0.0032537591,0.0014137386,0.0035001938,0.0009245097,0.0057624667,0.006053607,0.0030230095,0.51726043],"category_scores_gemma":[0.0074650873,0.0016297152,0.0016252284,0.0037982534,0.001142475,0.0038802205,0.0040549426,0.002613606,0.58665615],"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.00009086518,0.000020277681,0.0001755221,0.00021572445,0.000017930233,0.000039927963,0.000022052818,0.0023109592,0.00021350356,0.006074192,0.97322685,0.017592212],"study_design_scores_gemma":[0.00016845032,0.000028919438,0.00022220878,0.00011722239,0.000009811401,0.000091542584,0.0000189633,0.007928874,0.0011365324,0.016630238,0.97359836,0.000048895396],"about_ca_topic_score_codex":0.012611499,"about_ca_topic_score_gemma":0.010899947,"teacher_disagreement_score":0.51726043,"about_ca_system_score_codex":0.002284612,"about_ca_system_score_gemma":0.0020980742,"threshold_uncertainty_score":0.6885694},"labels":[],"label_agreement":null},{"id":"W6894208205","doi":"10.5281/zenodo.7420702","title":"AAS Birmingham 2022 live streaming online Cheer &amp; Dance free","year":2022,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Advanced Graph Neural Networks","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":"Event (particle physics); Dance; Subject (documents); Work (physics)","score_opus":0.03011730903340559,"score_gpt":0.25073324595732593,"score_spread":0.22061593692392034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6894208205","genre_codex":"dataset","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.0003992646,0.00015282106,0.00044456605,0.00041135383,0.00048163,0.000051794155,0.98920923,0.004609639,0.0042396644],"genre_scores_gemma":[0.00087831967,0.00012552003,0.001065131,0.0002196375,0.00009515988,0.00013623381,0.99266326,0.0005232526,0.004293428],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99881506,0.00024222306,0.00009469061,0.0003482116,0.0003095738,0.00019027779],"domain_scores_gemma":[0.9972905,0.00038485267,0.00013460628,0.0007856349,0.00092536694,0.00047907338],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015887892,0.0020094642,0.0014306606,0.0029199838,0.001273747,0.0037974599,0.0026803175,0.001821621,0.14115131],"category_scores_gemma":[0.006293575,0.00072649965,0.001374597,0.0033843701,0.000379437,0.00307526,0.003613116,0.00170132,0.2817238],"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.00005954418,0.000011823881,0.00037173278,0.00015923151,0.000011351705,0.000009480951,0.000018118775,0.000053937572,0.00010039809,0.00016870296,0.9956676,0.0033680277],"study_design_scores_gemma":[0.000109998175,0.000031591317,0.0045933085,0.00025347265,0.000018802986,0.000045616,0.00015565843,0.0007397217,0.00031959818,0.0011752702,0.9925177,0.000039207964],"about_ca_topic_score_codex":0.020757008,"about_ca_topic_score_gemma":0.041558377,"teacher_disagreement_score":0.8588487,"about_ca_system_score_codex":0.0009920048,"about_ca_system_score_gemma":0.0015078534,"threshold_uncertainty_score":0.4721982},"labels":[],"label_agreement":null},{"id":"W6902125209","doi":"10.6084/m9.figshare.29105695","title":"Additional file 2 of RobusTAD: reference panel based annotation of nested topologically associating domains","year":2025,"lang":"en","type":"article","venue":"Figshare","topic":"Advanced Graph Neural Networks","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":"Annotation; Class (philosophy); Scheme (mathematics); Domain (mathematical analysis)","score_opus":0.0445831827471867,"score_gpt":0.2602684865925037,"score_spread":0.21568530384531698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6902125209","genre_codex":"dataset","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.000121688856,0.00004299009,0.00081098365,0.00013198963,0.00007739316,0.00005325143,0.995538,0.0012242795,0.001999372],"genre_scores_gemma":[0.0051925085,0.00018678959,0.007969925,0.0005031799,0.00015434904,0.0009014871,0.9699275,0.003550641,0.011613687],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984987,0.00024326616,0.00019966514,0.00048587643,0.0004073452,0.00016528749],"domain_scores_gemma":[0.97314113,0.016541138,0.0011530569,0.003132172,0.0051182257,0.0009141844],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0023123282,0.0013724857,0.001747642,0.0049193585,0.0015767058,0.003160874,0.0029278968,0.0018428585,0.8612525],"category_scores_gemma":[0.03541486,0.0008889049,0.0010910747,0.006156748,0.0005632843,0.0031203167,0.0023123238,0.0015473091,0.37859222],"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.00012698656,0.00001824493,0.0006310443,0.0013600257,0.000018620683,0.00004568814,0.000050465973,0.00017643409,0.00019145674,0.00075530546,0.9912208,0.0054050004],"study_design_scores_gemma":[0.0005965858,0.00005092045,0.0052190227,0.0010636165,0.00008436199,0.0002847774,0.00023094728,0.0005233065,0.0010690897,0.0083961645,0.98237544,0.00010578045],"about_ca_topic_score_codex":0.0072188964,"about_ca_topic_score_gemma":0.015794223,"teacher_disagreement_score":0.8612525,"about_ca_system_score_codex":0.0013076937,"about_ca_system_score_gemma":0.0028037694,"threshold_uncertainty_score":0.1979065},"labels":[],"label_agreement":null},{"id":"W6905874244","doi":"10.15468/dl.tugqmp","title":"Occurrence Download","year":2018,"lang":"en","type":"dataset","venue":"Global Biodiversity Information Facility","topic":"Advanced Graph Neural Networks","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":"Download; Matching (statistics); Range (aeronautics); Order (exchange); Data set","score_opus":0.013779079583120283,"score_gpt":0.22259782847285295,"score_spread":0.20881874888973267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6905874244","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.00011136483,0.0000510642,0.00007819639,0.000058996244,0.000019144036,0.000009262255,0.997895,0.0008395451,0.0009374332],"genre_scores_gemma":[0.00023863527,0.00003531201,0.00024890457,0.000042518273,0.0000035562684,0.000039116625,0.9988182,0.00012486141,0.00044885642],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990362,0.000120080666,0.00011170696,0.00032962233,0.00023760219,0.00016488292],"domain_scores_gemma":[0.9981205,0.0004195028,0.00015375997,0.0005765623,0.0005039298,0.00022578912],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00079951657,0.0022805464,0.0015658351,0.0044627558,0.0010809168,0.002378359,0.0033920151,0.002436503,0.10843462],"category_scores_gemma":[0.004881156,0.00079809775,0.0012872332,0.0083082,0.0004651962,0.0023046692,0.0024455031,0.0021770026,0.18188801],"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.000029044677,0.000017423308,0.0003783555,0.0003895062,0.000012991491,0.000018006342,0.000018863771,0.00015458965,0.00010867087,0.00035221773,0.99686074,0.0016595499],"study_design_scores_gemma":[0.000097034535,0.00001307667,0.0022249345,0.00018320681,0.000015149483,0.000066637265,0.00010180145,0.0004087945,0.0003042426,0.0010528942,0.9955123,0.000019935776],"about_ca_topic_score_codex":0.021748992,"about_ca_topic_score_gemma":0.042061646,"teacher_disagreement_score":0.8915654,"about_ca_system_score_codex":0.001702939,"about_ca_system_score_gemma":0.0021544327,"threshold_uncertainty_score":0.36274993},"labels":[],"label_agreement":null},{"id":"W6906063737","doi":"10.15468/dl.zgpsm8","title":"Occurrence Download","year":2024,"lang":"en","type":"dataset","venue":"Global Biodiversity Information Facility","topic":"Advanced Graph Neural Networks","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":"Download; Matching (statistics); Range (aeronautics); Data collection; Missing data","score_opus":0.01253783352573161,"score_gpt":0.22297756534163457,"score_spread":0.21043973181590298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6906063737","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.000093057344,0.00003787756,0.00005723831,0.000045854536,0.000014503254,0.0000068732725,0.9984102,0.00054843834,0.00078595313],"genre_scores_gemma":[0.00022931829,0.00003100069,0.00022982185,0.000037479083,0.0000032232929,0.000035759516,0.9988488,0.000100945814,0.00048364015],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99919957,0.000107025604,0.00008609432,0.0002762885,0.00019312013,0.00013788951],"domain_scores_gemma":[0.9983581,0.00039439942,0.00015050234,0.00046164438,0.00043027237,0.00020504049],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00070197706,0.0020613326,0.00136333,0.004194278,0.00090147293,0.0019584508,0.0027219146,0.0020929927,0.10485157],"category_scores_gemma":[0.0042313966,0.00071558455,0.0011282272,0.00805131,0.00041773368,0.0019352888,0.002036048,0.0019119696,0.16141818],"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.000024284429,0.000014862423,0.00040126403,0.0003467427,0.000012142857,0.000014744344,0.000017338687,0.00017814434,0.00009383223,0.00032890547,0.997029,0.0015386923],"study_design_scores_gemma":[0.000087735156,0.000012077727,0.0024484764,0.00016365205,0.000015417461,0.000051594845,0.000090571724,0.00041309113,0.0002623558,0.0010685518,0.995368,0.000018596085],"about_ca_topic_score_codex":0.026088048,"about_ca_topic_score_gemma":0.052510418,"teacher_disagreement_score":0.8951484,"about_ca_system_score_codex":0.0016488605,"about_ca_system_score_gemma":0.0020130917,"threshold_uncertainty_score":0.35076344},"labels":[],"label_agreement":null},{"id":"W6906380410","doi":"10.17605/osf.io/xney5","title":"Graph EquiJoin Dataset","year":2020,"lang":"en","type":"article","venue":"OSF Preprints (OSF Preprints)","topic":"Advanced Graph Neural Networks","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; Identification (biology); Graph theory; Field (mathematics)","score_opus":0.025439081970539356,"score_gpt":0.2649035579312501,"score_spread":0.23946447596071074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6906380410","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.0018556105,0.00047387998,0.00056536205,0.0003256639,0.00011371368,0.00007462797,0.9926963,0.0022755903,0.00161934],"genre_scores_gemma":[0.0020748193,0.00012268075,0.0012831312,0.00012939025,0.0000120868235,0.00011797283,0.99557257,0.00014121718,0.000546052],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99902225,0.00016437632,0.00008012354,0.00035866234,0.00024544052,0.00012911351],"domain_scores_gemma":[0.9982488,0.00047644833,0.00013998146,0.0005571481,0.00038147558,0.00019616784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079098524,0.0034663263,0.0015260566,0.0039874045,0.001305664,0.0016563296,0.0036158878,0.0035752673,0.03655383],"category_scores_gemma":[0.0053480733,0.0006116553,0.0018805292,0.005779096,0.00061324827,0.0015293347,0.0022368417,0.00283992,0.034638222],"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.00009713969,0.00010558048,0.000884804,0.0011088661,0.00007742782,0.00009277783,0.000032504227,0.0011992069,0.00045323354,0.0010228704,0.9889818,0.00594379],"study_design_scores_gemma":[0.0006251784,0.00012867126,0.007512429,0.0004520792,0.0001284551,0.00047976666,0.00023619505,0.0057871104,0.0016860222,0.0070882714,0.9758075,0.00006838158],"about_ca_topic_score_codex":0.018600633,"about_ca_topic_score_gemma":0.04519536,"teacher_disagreement_score":0.03655383,"about_ca_system_score_codex":0.0014901728,"about_ca_system_score_gemma":0.0015157365,"threshold_uncertainty_score":0.12228477},"labels":[],"label_agreement":null},{"id":"W6912148640","doi":"10.5281/zenodo.15799038","title":"Proceedings of the First International Workshop on Trends in Knowledge Representation and Reasoning (TKR'25)","year":2025,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Advanced Graph Neural Networks","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":"CLARITY; Representation (politics); Knowledge representation and reasoning; Field (mathematics); Process (computing)","score_opus":0.024116787702002988,"score_gpt":0.2728595405845455,"score_spread":0.2487427528825425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6912148640","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.011666235,0.09297462,0.48209688,0.050509185,0.08573166,0.0016569139,0.014794489,0.012546479,0.24802357],"genre_scores_gemma":[0.046130598,0.048013013,0.33540526,0.008708442,0.011665152,0.0012595578,0.06279187,0.0059047374,0.4801214],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9929293,0.002535463,0.0006934916,0.001174536,0.0021799488,0.00048731634],"domain_scores_gemma":[0.99039066,0.0024992872,0.00032946432,0.0018621882,0.003523303,0.0013951062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010134554,0.0015552369,0.0018501256,0.0028522182,0.0011521094,0.010278968,0.0033476478,0.0025394931,0.07661364],"category_scores_gemma":[0.013985493,0.0007772956,0.0021392005,0.0032517973,0.0015074916,0.009570783,0.004251342,0.005145061,0.043079004],"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.0003220158,0.00019323149,0.00028426063,0.00070248905,0.00009311685,0.0001684243,0.00034371729,0.0011040433,0.0024634923,0.021055724,0.6640574,0.30921206],"study_design_scores_gemma":[0.000033419885,0.00007282921,0.00051515386,0.0003429701,0.000049871283,0.00023817821,0.00021086694,0.0031303533,0.0014593692,0.01864752,0.97526556,0.000033938955],"about_ca_topic_score_codex":0.0054094037,"about_ca_topic_score_gemma":0.007478149,"teacher_disagreement_score":0.07661364,"about_ca_system_score_codex":0.003101113,"about_ca_system_score_gemma":0.0046544275,"threshold_uncertainty_score":0.25629812},"labels":[],"label_agreement":null},{"id":"W6912526499","doi":"10.5281/zenodo.3590121","title":"Saner 2020: Cross-Dataset Design Discussion Mining: Replication Package","year":2020,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Advanced Graph Neural Networks","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 Victoria","funders":"","keywords":"Python (programming language); Download; R package; Directory; Replication (statistics); JavaScript; Package design; Root (linguistics)","score_opus":0.0638414889590741,"score_gpt":0.28876346346519377,"score_spread":0.22492197450611967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6912526499","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":"reproducibility","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":"reproducibility","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002242579,0.0003282098,0.16425535,0.0034673538,0.0019336073,0.0030707496,0.5022265,0.29792768,0.024548054],"genre_scores_gemma":[0.014973386,0.00031035682,0.29402348,0.004414486,0.0006172859,0.026824126,0.37193328,0.25374532,0.033158246],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.989446,0.0051300013,0.0008938766,0.0023146302,0.0017439983,0.0004715005],"domain_scores_gemma":[0.9406721,0.028998945,0.0020777564,0.017102301,0.009262467,0.0018864087],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.02808236,0.0023209366,0.0017897512,0.002746077,0.0017809939,0.004566612,0.0039631794,0.0019353965,0.3104756],"category_scores_gemma":[0.105379574,0.0028790461,0.0036549931,0.0025686156,0.0010668996,0.004886662,0.0046719736,0.0040603788,0.2127143],"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.00029457535,0.000037051042,0.0006353853,0.00077115477,0.00015699737,0.00002317452,0.00022821402,0.00043411038,0.00062344124,0.0022853243,0.97965026,0.014860356],"study_design_scores_gemma":[0.0011172203,0.00007787276,0.0020667936,0.00037493886,0.00016277355,0.00006392713,0.0001685676,0.0040993076,0.003970547,0.019121446,0.96863973,0.00013681335],"about_ca_topic_score_codex":0.0027341335,"about_ca_topic_score_gemma":0.0065617254,"teacher_disagreement_score":0.9719176,"about_ca_system_score_codex":0.0013164217,"about_ca_system_score_gemma":0.0058612498,"threshold_uncertainty_score":0.9835229},"labels":[],"label_agreement":null},{"id":"W6912991590","doi":"10.5281/zenodo.7998401","title":"Towards Foundational Models for Molecular Learning on Large-Scale Multi-Task Datasets","year":2024,"lang":"en","type":"preprint","venue":"RWTH Publications (RWTH Aachen)","topic":"Advanced Graph Neural Networks","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":"HEC Montréal; Canadian Institute for Advanced Research; McGill University; Université de Montréal","funders":"","keywords":"Supervised learning; Training set; Graph; Labeled data; Data point; Range (aeronautics); Data type; Code (set theory)","score_opus":0.04311897580672169,"score_gpt":0.32654904923392114,"score_spread":0.28343007342719945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6912991590","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.025434807,0.0013430887,0.9496165,0.0015284278,0.0001510794,0.00026953628,0.007914639,0.011586903,0.0021551491],"genre_scores_gemma":[0.21242839,0.0012609042,0.73447704,0.0012709118,0.0002131405,0.0015261066,0.044563845,0.001385804,0.0028738426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972203,0.0009995608,0.00016426161,0.00089663744,0.0005057848,0.00021338458],"domain_scores_gemma":[0.9922815,0.003861481,0.0004701549,0.0018713808,0.0011253776,0.00039001842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054996707,0.0025227435,0.0023038667,0.0027882922,0.0012139977,0.0032292446,0.005769799,0.0027732882,0.0028398605],"category_scores_gemma":[0.018074485,0.0013433761,0.0037224565,0.0031661491,0.0015281498,0.005868906,0.00458158,0.0074858074,0.0026694427],"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.00039798603,0.00052796485,0.0059176725,0.0008550971,0.00043328505,0.00018290331,0.00022423382,0.7374039,0.0029930333,0.03508641,0.04372515,0.17225237],"study_design_scores_gemma":[0.000019177609,0.000029325669,0.00020776807,0.000028614777,0.000013225542,0.000012536411,0.000022908287,0.9757529,0.000488926,0.021702113,0.0017128056,0.000009775517],"about_ca_topic_score_codex":0.009961881,"about_ca_topic_score_gemma":0.022126537,"teacher_disagreement_score":0.009961881,"about_ca_system_score_codex":0.0028905813,"about_ca_system_score_gemma":0.003252519,"threshold_uncertainty_score":0.029085398},"labels":[],"label_agreement":null},{"id":"W6920813311","doi":"10.60692/n2jjj-3bs23","title":"InductiveQE Datasets","year":2022,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Advanced Graph Neural Networks","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":"Inference; Disjoint sets; Graph; Graph database; Training set; Set (abstract data type)","score_opus":0.030938026627628276,"score_gpt":0.21394666475156426,"score_spread":0.18300863812393597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6920813311","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.0009912214,0.00036759808,0.0021898714,0.00033216213,0.00013204371,0.00018872913,0.9839384,0.007492864,0.0043670554],"genre_scores_gemma":[0.0010244984,0.000087836146,0.0030042354,0.00018533586,0.0000113813385,0.00027339533,0.99393785,0.00039829724,0.0010772482],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957761,0.0008031448,0.0004392589,0.0012624268,0.0012988029,0.00042039438],"domain_scores_gemma":[0.9925519,0.0022164383,0.00029230642,0.0022351986,0.0024170566,0.00028714052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038045933,0.0033133219,0.0017292638,0.0056061675,0.0019590987,0.0032034575,0.007648389,0.0040727304,0.071784295],"category_scores_gemma":[0.018245908,0.0011375622,0.0036567596,0.0075662336,0.0009960529,0.004258332,0.004082963,0.0035231707,0.08570302],"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.0001137995,0.0000918898,0.0007958644,0.0010728259,0.00008298829,0.00006711751,0.000037727543,0.0020243046,0.00042672394,0.00193107,0.9852211,0.008134684],"study_design_scores_gemma":[0.0004566464,0.00008275871,0.0030474481,0.0003437887,0.00008201433,0.00022592317,0.00018248435,0.005958988,0.0021533195,0.008038541,0.97933733,0.00009077528],"about_ca_topic_score_codex":0.020291543,"about_ca_topic_score_gemma":0.036194656,"teacher_disagreement_score":0.071784295,"about_ca_system_score_codex":0.0032076614,"about_ca_system_score_gemma":0.0033412187,"threshold_uncertainty_score":0.24014235},"labels":[],"label_agreement":null},{"id":"W6921019684","doi":"10.60692/ybpez-88h20","title":"InductiveQE Datasets","year":2022,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Advanced Graph Neural Networks","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":"Inference; Disjoint sets; Graph; Graph database; Training set; Set (abstract data type)","score_opus":0.030938026627628276,"score_gpt":0.21394666475156426,"score_spread":0.18300863812393597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6921019684","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.0009912214,0.00036759808,0.0021898714,0.00033216213,0.00013204371,0.00018872913,0.9839384,0.007492864,0.0043670554],"genre_scores_gemma":[0.0010244984,0.000087836146,0.0030042354,0.00018533586,0.0000113813385,0.00027339533,0.99393785,0.00039829724,0.0010772482],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957761,0.0008031448,0.0004392589,0.0012624268,0.0012988029,0.00042039438],"domain_scores_gemma":[0.9925519,0.0022164383,0.00029230642,0.0022351986,0.0024170566,0.00028714052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038045933,0.0033133219,0.0017292638,0.0056061675,0.0019590987,0.0032034575,0.007648389,0.0040727304,0.071784295],"category_scores_gemma":[0.018245908,0.0011375622,0.0036567596,0.0075662336,0.0009960529,0.004258332,0.004082963,0.0035231707,0.08570302],"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.0001137995,0.0000918898,0.0007958644,0.0010728259,0.00008298829,0.00006711751,0.000037727543,0.0020243046,0.00042672394,0.00193107,0.9852211,0.008134684],"study_design_scores_gemma":[0.0004566464,0.00008275871,0.0030474481,0.0003437887,0.00008201433,0.00022592317,0.00018248435,0.005958988,0.0021533195,0.008038541,0.97933733,0.00009077528],"about_ca_topic_score_codex":0.020291543,"about_ca_topic_score_gemma":0.036194656,"teacher_disagreement_score":0.071784295,"about_ca_system_score_codex":0.0032076614,"about_ca_system_score_gemma":0.0033412187,"threshold_uncertainty_score":0.24014235},"labels":[],"label_agreement":null},{"id":"W6921910029","doi":"10.1016/j.eswa.2025.129026","title":"DECTUIL: Cross-social network user identity linkage via dynamic embedding and clustering model driven by three-way decision","year":2025,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Advanced Graph Neural Networks","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; Université de Montréal","funders":"Science and Technology Service Network Plan; National Key Research and Development Program of China; Sichuan Province Science and Technology Support Program; Organization Department of Sichuan Provincial Party Committee; Chinese Academy of Sciences; National Natural Science Foundation of China","keywords":"Cluster analysis; Embedding; Robustness (evolution); Entropy (arrow of time); Smoothing; Linkage (software); Word embedding; Constrained clustering","score_opus":0.008314776252196229,"score_gpt":0.3051760184642313,"score_spread":0.2968612422120351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6921910029","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.03978003,0.0005862072,0.9465473,0.0007937603,0.00029962786,0.00023610919,0.0013018494,0.008129043,0.002326133],"genre_scores_gemma":[0.559707,0.0003634437,0.41229388,0.0006505897,0.00023744308,0.000437821,0.005628404,0.0010914083,0.019589981],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871004,0.00040485378,0.000042444193,0.0004180254,0.00024691471,0.00017768663],"domain_scores_gemma":[0.9970933,0.001444818,0.00016298106,0.00055894663,0.0004944664,0.00024544133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025524744,0.0013322092,0.0024388526,0.0018400318,0.0013851804,0.0021653334,0.00426959,0.0024605258,0.0045050792],"category_scores_gemma":[0.005903816,0.0008933243,0.0014249458,0.0018925294,0.0010361035,0.0037316564,0.0048968173,0.0030842184,0.0023740986],"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.0008589756,0.00084036676,0.0046072984,0.00021871564,0.00048746332,0.0003081099,0.00036016136,0.58848816,0.0019721547,0.02115588,0.026600957,0.35410175],"study_design_scores_gemma":[0.000007731204,0.00002014753,0.000097218486,0.0000029304208,0.000005735374,0.000011561624,0.000011500635,0.99690884,0.00020885054,0.0023673454,0.00035121164,0.0000069748357],"about_ca_topic_score_codex":0.021410596,"about_ca_topic_score_gemma":0.027221553,"teacher_disagreement_score":0.021410596,"about_ca_system_score_codex":0.0016588824,"about_ca_system_score_gemma":0.0018558457,"threshold_uncertainty_score":0.042571902},"labels":[],"label_agreement":null},{"id":"W6930447306","doi":"10.5281/zenodo.12733954","title":"GlucoTrust USA: Reviews, Work, Benefits, Order, Price &amp; Ingredients?","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Advanced Graph Neural Networks","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":"Limiting; Population; Work (physics); Filter (signal processing); Noise (video)","score_opus":0.049953219162798844,"score_gpt":0.26567583107432846,"score_spread":0.2157226119115296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930447306","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.0023430767,0.070667855,0.0031606043,0.010951253,0.016667327,0.0007279758,0.008704433,0.008036301,0.87874115],"genre_scores_gemma":[0.007110997,0.051529218,0.004472713,0.009100084,0.0039307713,0.0004077542,0.005984312,0.0029166448,0.91454744],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994553,0.00009553944,0.000050004193,0.00006269246,0.00028705204,0.000049456332],"domain_scores_gemma":[0.99873596,0.00030337568,0.00016505973,0.00011846647,0.00045930804,0.00021781548],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008492137,0.0011641585,0.00060224504,0.0017310015,0.00055871205,0.0032231705,0.0009158275,0.0017153673,0.41887727],"category_scores_gemma":[0.002655185,0.00042192085,0.0006556879,0.0019874594,0.00043602337,0.0038879984,0.0013482769,0.0015009107,0.3719409],"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.00013652023,0.00007892502,0.00006894034,0.0021271887,0.0000070419737,0.00005170218,0.00006498055,0.00002163414,0.002147984,0.0018625115,0.7357829,0.2576496],"study_design_scores_gemma":[0.00001068661,0.000028495722,0.00015580015,0.0002961133,0.000004472815,0.00005040788,0.00002512701,0.000007293169,0.00039804186,0.00019309095,0.9988248,0.0000058334613],"about_ca_topic_score_codex":0.00079850084,"about_ca_topic_score_gemma":0.0022680222,"teacher_disagreement_score":0.58112276,"about_ca_system_score_codex":0.0005738567,"about_ca_system_score_gemma":0.00094732514,"threshold_uncertainty_score":0.82890105},"labels":[],"label_agreement":null},{"id":"W6931768603","doi":"10.5281/zenodo.5710811","title":"SESYNC-ci/gis-abm-lesson: Handouts - Zenodo","year":2021,"lang":"fr","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Advanced Graph Neural Networks","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 en Abitibi-Témiscamingue","funders":"","keywords":"Identification (biology); Interpretation (philosophy); Perspective (graphical); Set (abstract data type)","score_opus":0.0484813716483236,"score_gpt":0.2557657984214514,"score_spread":0.2072844267731278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931768603","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.0011154674,0.0006039207,0.005123105,0.009193971,0.0023418125,0.00067413744,0.07115883,0.03235068,0.87743807],"genre_scores_gemma":[0.008455839,0.0014645897,0.009369866,0.008153368,0.0011609921,0.0012862132,0.060818225,0.017517101,0.8917738],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994547,0.00011862162,0.000039940165,0.00008878665,0.00019006149,0.00010797954],"domain_scores_gemma":[0.9952212,0.0015019902,0.00019176216,0.00046579388,0.0011799672,0.0014393621],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012284138,0.00084625476,0.0007118667,0.0014460505,0.00087465433,0.002902171,0.0019807694,0.0016009856,0.8666817],"category_scores_gemma":[0.009680698,0.00061730656,0.00061771,0.0012790905,0.00035946546,0.0026579292,0.0026580545,0.0018324918,0.7051719],"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.000017004953,0.000019702307,0.00009350763,0.000043474764,6.308545e-7,0.00001814719,0.00001622839,0.00002847506,0.000018575218,0.00026607787,0.98330414,0.016174013],"study_design_scores_gemma":[0.00004024762,0.000011195968,0.00041851326,0.000116437805,0.0000014278752,0.000057357018,0.000058129775,0.00009595732,0.000091810216,0.00093391037,0.99816966,0.000005238834],"about_ca_topic_score_codex":0.0061434843,"about_ca_topic_score_gemma":0.0129326405,"teacher_disagreement_score":0.8666817,"about_ca_system_score_codex":0.001508769,"about_ca_system_score_gemma":0.0026273709,"threshold_uncertainty_score":0.1901623},"labels":[],"label_agreement":null},{"id":"W6931846142","doi":"10.5683/sp3/kc4irp","title":"Travel Survey of Residents of Canada, 2012: Person File, October","year":2012,"lang":"en","type":"dataset","venue":"Borealis","topic":"Advanced Graph Neural Networks","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":"TRIPS architecture; Tourism; Travel survey; Accommodation; Travel behavior; Survey data collection; Domestic tourism; Destinations; Survey methodology","score_opus":0.029332730768319527,"score_gpt":0.25230688705884613,"score_spread":0.2229741562905266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931846142","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.00083648885,0.00006941707,0.00003476132,0.00009799987,0.000023381399,0.000062958614,0.99543166,0.000052853306,0.00339044],"genre_scores_gemma":[0.008329431,0.0004906104,0.00048519133,0.00027708622,0.000033309585,0.00046868823,0.9763614,0.00006903684,0.013485162],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981932,0.000079157566,0.00018667366,0.00025606432,0.00083259935,0.00045230056],"domain_scores_gemma":[0.98997283,0.000262537,0.0004551043,0.0002913162,0.00842076,0.00059751974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010844651,0.0010765089,0.0011225952,0.0047280486,0.0026494358,0.0023136067,0.002020192,0.00073541305,0.05107644],"category_scores_gemma":[0.007337236,0.00089851534,0.00075665815,0.023839254,0.00029535728,0.0011694769,0.0010052243,0.001290214,0.024033284],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006430124,0.000029555038,0.011363929,0.00028983323,0.00002211437,0.00002200726,0.000090215995,0.00012645766,0.000021751492,0.00019503443,0.98313993,0.0046348847],"study_design_scores_gemma":[0.00023910488,0.000041527794,0.59540206,0.00072930765,0.0000825719,0.00007671968,0.0012930541,0.0008354798,0.00029761606,0.00020268546,0.40071493,0.00008490176],"about_ca_topic_score_codex":0.9863637,"about_ca_topic_score_gemma":0.9900513,"teacher_disagreement_score":0.05107644,"about_ca_system_score_codex":0.024855476,"about_ca_system_score_gemma":0.04319987,"threshold_uncertainty_score":0.18033999},"labels":[],"label_agreement":null},{"id":"W6939194279","doi":"10.60692/c9eaj-3xs44","title":"InductiveQE Datasets","year":2022,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Advanced Graph Neural Networks","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":"Inference; Disjoint sets; Graph; Graph database; Missing data; Statistical inference","score_opus":0.030938026627628276,"score_gpt":0.21394666475156426,"score_spread":0.18300863812393597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6939194279","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.0013587979,0.00058596063,0.002785307,0.00050121156,0.00011530906,0.00023199494,0.97966135,0.0088120205,0.0059479806],"genre_scores_gemma":[0.001439255,0.0001490979,0.003525585,0.00021581547,0.000010639954,0.00025345845,0.9930179,0.00034832064,0.0010399573],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99607384,0.0007960587,0.00041121145,0.0011411554,0.0011793681,0.0003984319],"domain_scores_gemma":[0.9944372,0.0020875118,0.0002246307,0.0013976219,0.0015586618,0.00029432654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027943223,0.003373958,0.001452526,0.005749966,0.0016777281,0.0030671163,0.00655717,0.00354364,0.057939686],"category_scores_gemma":[0.015744092,0.00093722495,0.0030652334,0.007851234,0.00089581317,0.0044648517,0.0039948444,0.003530036,0.055822514],"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.00012578724,0.00011796114,0.00092774903,0.0014587416,0.000076140306,0.0000884154,0.00006556703,0.0024315617,0.0004775249,0.0033051155,0.9798284,0.0110970335],"study_design_scores_gemma":[0.00039517105,0.00008207018,0.0029802944,0.00038311174,0.000071812836,0.0002468257,0.00026118915,0.009019077,0.002051029,0.009877769,0.9745455,0.00008611444],"about_ca_topic_score_codex":0.031580735,"about_ca_topic_score_gemma":0.051037394,"teacher_disagreement_score":0.057939686,"about_ca_system_score_codex":0.0038070031,"about_ca_system_score_gemma":0.003482107,"threshold_uncertainty_score":0.19382751},"labels":[],"label_agreement":null},{"id":"W6939608453","doi":"10.6084/m9.figshare.29105695.v1","title":"Additional file 2 of RobusTAD: reference panel based annotation of nested topologically associating domains","year":2025,"lang":"en","type":"article","venue":"Figshare","topic":"Advanced Graph Neural Networks","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":"Annotation; Class (philosophy); Scheme (mathematics); Domain (mathematical analysis)","score_opus":0.0445831827471867,"score_gpt":0.2602684865925037,"score_spread":0.21568530384531698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6939608453","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.000121688856,0.00004299009,0.00081098365,0.00013198963,0.00007739316,0.00005325143,0.995538,0.0012242795,0.001999372],"genre_scores_gemma":[0.0051925085,0.00018678959,0.007969925,0.0005031799,0.00015434904,0.0009014871,0.9699275,0.003550641,0.011613687],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984987,0.00024326616,0.00019966514,0.00048587643,0.0004073452,0.00016528749],"domain_scores_gemma":[0.97314113,0.016541138,0.0011530569,0.003132172,0.0051182257,0.0009141844],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0023123282,0.0013724857,0.001747642,0.0049193585,0.0015767058,0.003160874,0.0029278968,0.0018428585,0.8612525],"category_scores_gemma":[0.03541486,0.0008889049,0.0010910747,0.006156748,0.0005632843,0.0031203167,0.0023123238,0.0015473091,0.37859222],"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.00012698656,0.00001824493,0.0006310443,0.0013600257,0.000018620683,0.00004568814,0.000050465973,0.00017643409,0.00019145674,0.00075530546,0.9912208,0.0054050004],"study_design_scores_gemma":[0.0005965858,0.00005092045,0.0052190227,0.0010636165,0.00008436199,0.0002847774,0.00023094728,0.0005233065,0.0010690897,0.0083961645,0.98237544,0.00010578045],"about_ca_topic_score_codex":0.0072188964,"about_ca_topic_score_gemma":0.015794223,"teacher_disagreement_score":0.8612525,"about_ca_system_score_codex":0.0013076937,"about_ca_system_score_gemma":0.0028037694,"threshold_uncertainty_score":0.1979065},"labels":[],"label_agreement":null},{"id":"W6968975868","doi":"10.5281/zenodo.6936226","title":"OpenAlex: A fully-open index of scholarly works, authors, venues, institutions, and concepts","year":2022,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Advanced Graph Neural Networks","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":"OpenAlex","funders":"","keywords":"Transparency (behavior); Microsoft excel; Open data; Semantic Web; Index (typography); Graph","score_opus":0.05845903935785887,"score_gpt":0.3004857062332492,"score_spread":0.24202666687539034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6968975868","genre_codex":"dataset","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.00843256,0.003849037,0.08140149,0.0050052665,0.004033756,0.0005103506,0.49088684,0.1011494,0.30473122],"genre_scores_gemma":[0.03998906,0.0048005288,0.11796935,0.0014702792,0.0013268905,0.0005136011,0.67254204,0.03447751,0.12691078],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974004,0.00037868434,0.00034542484,0.00037543653,0.0012624654,0.0002376223],"domain_scores_gemma":[0.9876632,0.0031605277,0.0011040187,0.0028696402,0.002905278,0.0022972387],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0028502336,0.0011538287,0.0009674942,0.0240672,0.0021401423,0.010234628,0.0015762623,0.001544944,0.08310033],"category_scores_gemma":[0.019967126,0.0008463072,0.0007622554,0.019839479,0.0012272934,0.013443766,0.012003363,0.0019490386,0.065433085],"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.00016291579,0.000044896067,0.0014776603,0.0011866372,0.000045303415,0.00014111292,0.0011302851,0.00045404112,0.0020011226,0.071608596,0.76670146,0.15504593],"study_design_scores_gemma":[0.000008667804,0.0000068148397,0.0004502556,0.0001175176,0.0000075052794,0.000049149836,0.00019867184,0.0001983381,0.00042769263,0.008347556,0.9901725,0.000015342282],"about_ca_topic_score_codex":0.005183159,"about_ca_topic_score_gemma":0.014545781,"teacher_disagreement_score":0.99842376,"about_ca_system_score_codex":0.002330293,"about_ca_system_score_gemma":0.005234837,"threshold_uncertainty_score":0.27799827},"labels":[],"label_agreement":null},{"id":"W6976866797","doi":"10.60692/hk0kf-nrc03","title":"InductiveQE Datasets","year":2022,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Advanced Graph Neural Networks","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":"Inference; Disjoint sets; Graph; Graph database; Training set; Set (abstract data type)","score_opus":0.030938026627628276,"score_gpt":0.21394666475156426,"score_spread":0.18300863812393597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6976866797","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.0009912214,0.00036759808,0.0021898714,0.00033216213,0.00013204371,0.00018872913,0.9839384,0.007492864,0.0043670554],"genre_scores_gemma":[0.0010244984,0.000087836146,0.0030042354,0.00018533586,0.0000113813385,0.00027339533,0.99393785,0.00039829724,0.0010772482],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957761,0.0008031448,0.0004392589,0.0012624268,0.0012988029,0.00042039438],"domain_scores_gemma":[0.9925519,0.0022164383,0.00029230642,0.0022351986,0.0024170566,0.00028714052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038045933,0.0033133219,0.0017292638,0.0056061675,0.0019590987,0.0032034575,0.007648389,0.0040727304,0.071784295],"category_scores_gemma":[0.018245908,0.0011375622,0.0036567596,0.0075662336,0.0009960529,0.004258332,0.004082963,0.0035231707,0.08570302],"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.0001137995,0.0000918898,0.0007958644,0.0010728259,0.00008298829,0.00006711751,0.000037727543,0.0020243046,0.00042672394,0.00193107,0.9852211,0.008134684],"study_design_scores_gemma":[0.0004566464,0.00008275871,0.0030474481,0.0003437887,0.00008201433,0.00022592317,0.00018248435,0.005958988,0.0021533195,0.008038541,0.97933733,0.00009077528],"about_ca_topic_score_codex":0.020291543,"about_ca_topic_score_gemma":0.036194656,"teacher_disagreement_score":0.071784295,"about_ca_system_score_codex":0.0032076614,"about_ca_system_score_gemma":0.0033412187,"threshold_uncertainty_score":0.24014235},"labels":[],"label_agreement":null},{"id":"W6979365150","doi":"","title":"FedSA-GCL: A Semi-Asynchronous Federated Graph Learning Framework with Personalized Aggregation and Cluster-Aware Broadcasting","year":2025,"lang":"en","type":"article","venue":"ArXiv.org","topic":"Advanced Graph Neural Networks","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; Asynchronous communication; Robustness (evolution); Knowledge graph; Feature learning; Federated learning","score_opus":0.012700115150304125,"score_gpt":0.2486766224215193,"score_spread":0.2359765072712152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6979365150","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.011374567,0.000198157,0.9747824,0.00037217705,0.00006991013,0.0001140312,0.00030916947,0.011511209,0.0012683342],"genre_scores_gemma":[0.41761476,0.00020370804,0.5728585,0.0006711905,0.00011501599,0.00035544345,0.0021163789,0.0010086771,0.005056437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984097,0.0005129381,0.00005907257,0.0005255742,0.00033762908,0.00015510473],"domain_scores_gemma":[0.9972621,0.00081402494,0.00016608633,0.0010129776,0.0004993876,0.0002453174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024068798,0.0011706277,0.0015033131,0.0012693517,0.0014720073,0.0018705468,0.0051981783,0.0016979065,0.0026313735],"category_scores_gemma":[0.006154966,0.0005535803,0.0009186622,0.0014361091,0.0012123217,0.0043209484,0.0031429417,0.0022465622,0.0011403026],"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.000504008,0.00050162006,0.0023446344,0.00021840131,0.0001297117,0.00018612089,0.00034891145,0.5562947,0.006031551,0.029175619,0.02906032,0.3752043],"study_design_scores_gemma":[0.000024806157,0.000020987962,0.00008522105,0.0000040945324,0.0000061438377,0.000021364755,0.000026546102,0.98563427,0.0009577381,0.011722948,0.0014880097,0.000007851549],"about_ca_topic_score_codex":0.013076575,"about_ca_topic_score_gemma":0.023478039,"teacher_disagreement_score":0.013076575,"about_ca_system_score_codex":0.002340069,"about_ca_system_score_gemma":0.0030960345,"threshold_uncertainty_score":0.026000917},"labels":[],"label_agreement":null},{"id":"W6987952452","doi":"","title":"On Using Embeddings for Ownership Verification of Graph Neural Networks","year":2023,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Advanced Graph Neural Networks","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":"Blackberry (Canada)","funders":"","keywords":"Embedding; Graph; Artificial neural network; Benchmark (surveying); Suspect; Node (physics); Pattern recognition (psychology); Feature extraction","score_opus":0.02383654630530054,"score_gpt":0.24197872543077387,"score_spread":0.21814217912547332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6987952452","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.11128005,0.00088160136,0.8784547,0.0015110833,0.00019344706,0.00013000483,0.00057500595,0.0035543225,0.0034197906],"genre_scores_gemma":[0.8595351,0.00039108985,0.13513279,0.000562145,0.000090033485,0.00009463111,0.001441253,0.00033528628,0.002417523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967077,0.0012596669,0.0002513966,0.00074192125,0.0007604156,0.00027886202],"domain_scores_gemma":[0.9819719,0.009043255,0.0016523746,0.0053157,0.0016797873,0.00033685527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003532551,0.0013526188,0.0011899258,0.0017453715,0.0008611755,0.0019839043,0.002320526,0.0027264915,0.002578833],"category_scores_gemma":[0.039721914,0.0007598077,0.0009935223,0.0009561609,0.002467079,0.008007788,0.0038639838,0.003200017,0.00075633015],"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.00051696703,0.00017444251,0.009804367,0.00019539728,0.00016179381,0.00034758507,0.00036638373,0.62776625,0.0061771353,0.07662252,0.0048886887,0.27297848],"study_design_scores_gemma":[0.000009332177,0.00003621115,0.00025775682,0.000021547512,0.000008219359,0.000045511926,0.000029980818,0.9578176,0.0019551022,0.03923582,0.00057041587,0.000012422811],"about_ca_topic_score_codex":0.0031096514,"about_ca_topic_score_gemma":0.00385391,"teacher_disagreement_score":0.003532551,"about_ca_system_score_codex":0.0014835444,"about_ca_system_score_gemma":0.0010216497,"threshold_uncertainty_score":0.018682122},"labels":[],"label_agreement":null},{"id":"W6992927739","doi":"","title":"Neural Graph Reasoning:A Survey on Complex Logical Query Answering","year":2024,"lang":"en","type":"article","venue":"VU Research Portal","topic":"Advanced Graph Neural Networks","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 Montréal","funders":"","keywords":"Graph; Question answering; Logical consequence; Task (project management); Graph database; Taxonomy (biology); Modalities; Field (mathematics)","score_opus":0.17289153470890456,"score_gpt":0.41016587679040795,"score_spread":0.2372743420815034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6992927739","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.015462874,0.19130738,0.7611461,0.0067691985,0.00047192283,0.0003374157,0.001650322,0.002390673,0.02046423],"genre_scores_gemma":[0.24322194,0.2568627,0.47743335,0.0039630234,0.0018410363,0.00048664253,0.006201888,0.0007169463,0.009272442],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984842,0.0004175291,0.00012689222,0.00035990134,0.00053598406,0.00007556571],"domain_scores_gemma":[0.99551684,0.0031639067,0.00012048636,0.0004059754,0.0007033087,0.000089603804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028492864,0.001088947,0.0011942743,0.0033692855,0.00054516125,0.0024285654,0.0026361432,0.0014273179,0.0045940904],"category_scores_gemma":[0.008847184,0.00054593995,0.00094583794,0.005110613,0.00089359755,0.006359971,0.0016206609,0.001713629,0.0013835806],"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.00014004245,0.00021270328,0.0024513793,0.0027386693,0.00015984886,0.00010427845,0.00030103233,0.047121998,0.0013997289,0.07965321,0.029894205,0.8358228],"study_design_scores_gemma":[0.000039216346,0.00017149378,0.0019844088,0.00090095977,0.00019190555,0.00051726814,0.00044585817,0.47552678,0.0033219093,0.356592,0.1602266,0.000081697326],"about_ca_topic_score_codex":0.006595137,"about_ca_topic_score_gemma":0.0061332304,"teacher_disagreement_score":0.006595137,"about_ca_system_score_codex":0.0017520864,"about_ca_system_score_gemma":0.0017719994,"threshold_uncertainty_score":0.01536876},"labels":[],"label_agreement":null},{"id":"W6996530909","doi":"","title":"Semi-supervised Learning Based on Graph Stochastic Co-Training","year":2023,"lang":"en","type":"article","venue":"Electronic Institutional Repository of the National Aviation University of Ukraine (National Aviation University, Ukraine)","topic":"Advanced Graph Neural Networks","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":"Chen; Graph; Feature (linguistics); Feature selection; Artificial neural network; Set (abstract data type); Eleventh","score_opus":0.01658121056133718,"score_gpt":0.22285778968929412,"score_spread":0.20627657912795694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6996530909","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.006005005,0.0004969771,0.9905979,0.0003251432,0.000056396926,0.00006848372,0.00014916708,0.0009577521,0.0013432467],"genre_scores_gemma":[0.50622153,0.000900664,0.48114207,0.0007436047,0.00041629205,0.0007754926,0.0024629913,0.0006505075,0.006686876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99513656,0.0022068592,0.00020827576,0.0011597561,0.0009986949,0.00028977677],"domain_scores_gemma":[0.98746383,0.0072254306,0.0010234278,0.0021980635,0.0016975862,0.00039163238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004272391,0.0016361129,0.0031867612,0.0027040334,0.0014558696,0.0021120943,0.0042702514,0.0028195074,0.0035906225],"category_scores_gemma":[0.014268025,0.0013923376,0.002017071,0.0030141869,0.0027249022,0.0034099387,0.004056553,0.0033247687,0.0017578304],"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.00026488162,0.00017443775,0.001639694,0.00022577969,0.0002211483,0.00019980475,0.00029508016,0.74123824,0.0012786327,0.039623946,0.013843388,0.20099494],"study_design_scores_gemma":[0.000006676803,0.000014637485,0.00007415423,0.000009810512,0.000007320833,0.000023505238,0.000006147833,0.9879396,0.0002776678,0.011159836,0.0004743631,0.000006368541],"about_ca_topic_score_codex":0.007174524,"about_ca_topic_score_gemma":0.010663437,"teacher_disagreement_score":0.007174524,"about_ca_system_score_codex":0.0018489134,"about_ca_system_score_gemma":0.0022466497,"threshold_uncertainty_score":0.02259481},"labels":[],"label_agreement":null},{"id":"W7000716831","doi":"","title":"Graph-based machine learning algorithms for predicting disease outcomes","year":2019,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Advanced Graph Neural Networks","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":"Graph; Autoencoder; Artificial neural network; Convolutional neural network; Deep learning; Software deployment; Task (project management)","score_opus":0.018372980468401554,"score_gpt":0.2626573381445462,"score_spread":0.24428435767614468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7000716831","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.012110492,0.0028507384,0.9797963,0.0010806953,0.0001358115,0.00011114791,0.00096229353,0.0015010106,0.0014514604],"genre_scores_gemma":[0.4286576,0.005837474,0.5519902,0.00092616637,0.00059602596,0.0005675621,0.006259295,0.00027349673,0.00489212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993197,0.00023054321,0.00005034852,0.00022451433,0.0001282551,0.000046635785],"domain_scores_gemma":[0.99610496,0.0028388198,0.0003927359,0.00025757353,0.00032208796,0.000084005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016352837,0.0017878338,0.0014889636,0.0034749927,0.00041235823,0.0009380985,0.001970527,0.0014417095,0.0021568697],"category_scores_gemma":[0.0072192247,0.0005634508,0.001234197,0.0028714328,0.0007121673,0.0016258723,0.0009745632,0.0026422585,0.0012580341],"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.00009568624,0.00017873969,0.0061233155,0.0003022177,0.00025974176,0.0000835604,0.00006254686,0.65245205,0.00073278585,0.018841539,0.009712401,0.31115538],"study_design_scores_gemma":[0.000013376307,0.000029145409,0.00065812934,0.000022079981,0.000023129782,0.000019065308,0.00000927157,0.9642394,0.00021324508,0.03372671,0.0010359981,0.000010402765],"about_ca_topic_score_codex":0.008249129,"about_ca_topic_score_gemma":0.010068263,"teacher_disagreement_score":0.008249129,"about_ca_system_score_codex":0.0011078417,"about_ca_system_score_gemma":0.0009640648,"threshold_uncertainty_score":0.016402245},"labels":[],"label_agreement":null},{"id":"W7010018281","doi":"","title":"Finding and explaining relations in a biographical knowledge graph based on life events : Case BiographySampo","year":2023,"lang":"en","type":"article","venue":"Aaltodoc (Aalto University)","topic":"Advanced Graph Neural Networks","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":"Artificial Intelligence in Medicine (Canada)","funders":"China Scholarship Council","keywords":"Nucleofection; Gestational period; TSG101; Dysgeusia; Liquation; Diafiltration; Emperipolesis; Triacetin; Demotion","score_opus":0.027197129583931404,"score_gpt":0.24915462378873013,"score_spread":0.2219574942047987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7010018281","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.698264,0.0031664574,0.24127196,0.008153433,0.00018861808,0.00057460385,0.017137503,0.0016906239,0.029552823],"genre_scores_gemma":[0.87119704,0.0012406169,0.11225884,0.0001666837,0.000034766195,0.00010209733,0.010113041,0.000094350784,0.0047925515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963224,0.00013961126,0.000027457261,0.00011474322,0.00005712759,0.00002888698],"domain_scores_gemma":[0.99733526,0.0019886035,0.00020294126,0.00025493526,0.00012897,0.000089190704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005184287,0.00045880966,0.00014487689,0.0035519185,0.00083215,0.0011260755,0.0006149958,0.000989009,0.006588935],"category_scores_gemma":[0.0042077326,0.00017823238,0.00056520215,0.0030996746,0.0005537555,0.0026428027,0.00093548157,0.00079731515,0.0008846544],"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.0005611571,0.0011753258,0.19197915,0.0018476703,0.00034987764,0.009581329,0.015152125,0.02961673,0.009824567,0.07316071,0.04118322,0.6255682],"study_design_scores_gemma":[0.0001331573,0.00028936018,0.11447972,0.001319605,0.0007969937,0.0066371537,0.028716104,0.37998813,0.02007296,0.14040181,0.30701333,0.00015166003],"about_ca_topic_score_codex":0.012868943,"about_ca_topic_score_gemma":0.023045233,"teacher_disagreement_score":0.012868943,"about_ca_system_score_codex":0.00076537434,"about_ca_system_score_gemma":0.0009735943,"threshold_uncertainty_score":0.025588095},"labels":[],"label_agreement":null},{"id":"W7015712645","doi":"","title":"Towards Machine Learning on Temporal Graphs","year":2025,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Advanced Graph Neural Networks","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":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; McGill University; Canadian Institute for Advanced Research","keywords":"Constructive; Database transaction; Graph; Uncountable set","score_opus":0.015968479930179722,"score_gpt":0.25081264000087033,"score_spread":0.23484416007069062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7015712645","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.013941153,0.001506892,0.97693616,0.0014628452,0.00022172208,0.000029403347,0.00029641806,0.0013644608,0.0042409822],"genre_scores_gemma":[0.2665514,0.0038356753,0.70309365,0.00085045805,0.0006365125,0.00018252898,0.0025638882,0.00089201174,0.021393873],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995603,0.00016980954,0.000017593347,0.00014710457,0.000074594485,0.000030586027],"domain_scores_gemma":[0.9976131,0.0016645135,0.00008572039,0.00029877666,0.00025743048,0.000080469574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093571475,0.0005510954,0.00069204654,0.001435226,0.00048787755,0.0012281359,0.00090839627,0.0006331641,0.0043095816],"category_scores_gemma":[0.005612631,0.00047324874,0.00087228947,0.0017348859,0.0008484344,0.0031305517,0.0012918944,0.0021110657,0.0015345579],"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.00015966472,0.00010547358,0.0012284414,0.00033344587,0.00013715557,0.00007432056,0.00028352768,0.18214951,0.00470775,0.27041453,0.032706317,0.50769985],"study_design_scores_gemma":[0.0000119726765,0.000020786163,0.00028964097,0.000035026897,0.000017599314,0.000019205294,0.00003451501,0.7056525,0.0015772391,0.28159526,0.010737311,0.000009022035],"about_ca_topic_score_codex":0.0041892384,"about_ca_topic_score_gemma":0.0041043162,"teacher_disagreement_score":0.0043095816,"about_ca_system_score_codex":0.0007156033,"about_ca_system_score_gemma":0.0005724764,"threshold_uncertainty_score":0.014417052},"labels":[],"label_agreement":null},{"id":"W7019398766","doi":"","title":"Geometric deep learning: features, graphs, and affinity supervision","year":2020,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Advanced Graph Neural Networks","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":"Stability (learning theory); Identification (biology); Artificial neural network; Work (physics)","score_opus":0.01303046553968749,"score_gpt":0.2302943370639032,"score_spread":0.21726387152421572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7019398766","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.043658827,0.0039232215,0.9296726,0.0040032673,0.0005155072,0.000051806524,0.0011126802,0.0027927808,0.014269326],"genre_scores_gemma":[0.5795464,0.0046048104,0.37998816,0.0007170969,0.00056868896,0.0001296183,0.0044846376,0.0005300064,0.029430589],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997315,0.000051574465,0.000009889715,0.00009603142,0.000081037186,0.00003001875],"domain_scores_gemma":[0.99934477,0.00017762721,0.00006715062,0.00014360565,0.00019532788,0.00007143274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039737558,0.00052913284,0.00057278975,0.00055278785,0.0003063891,0.00090328965,0.0011072562,0.00081368943,0.0057016537],"category_scores_gemma":[0.0027934227,0.0003629496,0.00035483003,0.00090632786,0.00066486344,0.0017714031,0.0012547044,0.001964065,0.0021594923],"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.00013708879,0.00011302768,0.0016505342,0.00018100932,0.0000409926,0.00003219351,0.00006510838,0.09075117,0.0035576054,0.0918116,0.06616573,0.74549395],"study_design_scores_gemma":[0.000024560562,0.00005237763,0.0011276035,0.000051901327,0.00002444888,0.00004852244,0.000030074527,0.8180675,0.004568563,0.16078417,0.015202483,0.000017792589],"about_ca_topic_score_codex":0.004684005,"about_ca_topic_score_gemma":0.0068491725,"teacher_disagreement_score":0.0057016537,"about_ca_system_score_codex":0.00077605515,"about_ca_system_score_gemma":0.0008385425,"threshold_uncertainty_score":0.019073963},"labels":[],"label_agreement":null},{"id":"W7024864190","doi":"","title":"the_villageboy_a.k.a._Rich.vom.Dorf._-_minimalfrickeltech_mix_2.mp3","year":2006,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Advanced Graph Neural Networks","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":"Anticipation (artificial intelligence); World War II; Period (music); Sound (geography)","score_opus":0.005079242722596964,"score_gpt":0.18300485860802967,"score_spread":0.1779256158854327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024864190","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.0011626539,0.00064402097,0.005773666,0.00048045404,0.00082147174,0.0001484934,0.01275256,0.017044997,0.96117175],"genre_scores_gemma":[0.003102489,0.00036703813,0.0025021555,0.00014902225,0.000074395284,0.00007229291,0.004390957,0.007917272,0.9814244],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99979395,0.000016447935,0.0000053569606,0.00006761027,0.000081098064,0.00003556202],"domain_scores_gemma":[0.9996202,0.000045626657,0.000012134934,0.000065881206,0.000099354875,0.00015672839],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002988415,0.0013973402,0.0009628577,0.001139331,0.0013822451,0.003229579,0.0012359205,0.0010674141,0.9150038],"category_scores_gemma":[0.0007207556,0.00075118645,0.0007032445,0.0011690336,0.0003725981,0.0024534995,0.0027828945,0.0010718819,0.8434982],"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.00013960229,0.000023907633,0.00009530995,0.00019141004,0.0000049596074,0.000064871085,0.00008890831,0.00007641131,0.0026897115,0.0015554404,0.9086877,0.08638163],"study_design_scores_gemma":[0.000013487035,0.00001850782,0.0003461817,0.000040900253,0.0000029356688,0.00007279003,0.0000592518,0.000095621304,0.0005848481,0.0002993718,0.99845695,0.00000914094],"about_ca_topic_score_codex":0.003214569,"about_ca_topic_score_gemma":0.00855524,"teacher_disagreement_score":0.08499622,"about_ca_system_score_codex":0.00053580606,"about_ca_system_score_gemma":0.0004104608,"threshold_uncertainty_score":0.12123674},"labels":[],"label_agreement":null},{"id":"W7025150176","doi":"","title":"Trump win in 2024 could harm fight against climate change -Canada PM","year":2023,"lang":"en","type":"other","venue":"","topic":"Advanced Graph Neural Networks","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":"Climate change; Harm; Government (linguistics); Global warming","score_opus":0.024553779217756925,"score_gpt":0.25304290429357373,"score_spread":0.2284891250758168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7025150176","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.0021534604,0.002706951,0.00096592045,0.18123357,0.015034329,0.0000864525,0.0038731152,0.00069048017,0.7932557],"genre_scores_gemma":[0.01691703,0.0010017435,0.00053114723,0.017386863,0.0008261537,0.000034014207,0.00062252017,0.00020419585,0.9624764],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99905366,0.000056136283,0.000010761168,0.00008856764,0.0004274965,0.00036345745],"domain_scores_gemma":[0.9979371,0.00013102428,0.00003223634,0.00006870202,0.0009295858,0.00090144906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009126528,0.00066801725,0.0003406136,0.000782142,0.0071600764,0.005828958,0.0010604509,0.005325336,0.16989486],"category_scores_gemma":[0.0040764497,0.00029329033,0.00055174035,0.00070529565,0.001483221,0.0018985312,0.0019625877,0.005322957,0.032429434],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011306936,0.0000063066263,0.00017673855,0.00001111789,0.000002003056,0.000015225815,0.000022208302,0.000096210395,0.00002863574,0.009571,0.98130167,0.008757546],"study_design_scores_gemma":[0.000011686471,0.0000073243464,0.0007151909,0.000051186264,0.0000032410312,0.000012559929,0.00017063391,0.00032459066,0.000110530906,0.005602201,0.9929818,0.000009077968],"about_ca_topic_score_codex":0.77860856,"about_ca_topic_score_gemma":0.9247071,"teacher_disagreement_score":0.22139144,"about_ca_system_score_codex":0.018751413,"about_ca_system_score_gemma":0.034246854,"threshold_uncertainty_score":0.56835496},"labels":[],"label_agreement":null},{"id":"W7030399226","doi":"","title":"NAIT and the Future of Automotive Training | EV Life","year":2023,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Advanced Graph Neural Networks","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":"Apprenticeship; Automotive industry; Training (meteorology); Technician; Service (business)","score_opus":0.00645751075267161,"score_gpt":0.18570880050849134,"score_spread":0.17925128975581972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7030399226","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.0017899463,0.0116449,0.0005179767,0.28699905,0.01754735,0.000013758493,0.0007337569,0.0004486429,0.6803046],"genre_scores_gemma":[0.016833689,0.006547741,0.00063534797,0.025033528,0.001843247,0.000022371221,0.0006112474,0.00021719429,0.94825566],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99877185,0.00021173658,0.00002277944,0.00009435588,0.00044622572,0.00045304335],"domain_scores_gemma":[0.9972555,0.00011715661,0.00005835085,0.00007212057,0.0005354144,0.0019614662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012560597,0.00034140926,0.0002830947,0.000664988,0.005103381,0.008827286,0.0011315676,0.0034373002,0.21632503],"category_scores_gemma":[0.0021371199,0.00020948243,0.00026441299,0.0009510938,0.0016151861,0.005008986,0.0034647158,0.0040044882,0.075847164],"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.000007837973,0.000014355804,0.00016848095,0.000023395736,6.7405455e-7,0.000010130677,0.00012695845,0.000017944943,0.000035617024,0.009394551,0.9636227,0.02657739],"study_design_scores_gemma":[0.0000012105302,0.0000031209133,0.00024297425,0.000042612515,4.1356878e-7,0.000011361131,0.0004615863,0.000015330354,0.000015881411,0.0014125492,0.99779046,0.0000024037604],"about_ca_topic_score_codex":0.05232607,"about_ca_topic_score_gemma":0.1519471,"teacher_disagreement_score":0.21632503,"about_ca_system_score_codex":0.0047762287,"about_ca_system_score_gemma":0.008945646,"threshold_uncertainty_score":0.7236793},"labels":[],"label_agreement":null},{"id":"W7030429921","doi":"","title":"\"The Miroir des dames in Fifteenth-Century England\"","year":2021,"lang":"en","type":"article","venue":"Data Archiving and Networked Services (DANS)","topic":"Advanced Graph Neural Networks","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 British Columbia","funders":"","keywords":"Feature (linguistics); Work (physics); Power (physics)","score_opus":0.01324472743148445,"score_gpt":0.2403076137135178,"score_spread":0.22706288628203336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7030429921","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.19728126,0.032390855,0.0047674547,0.10238951,0.003468293,0.000054493805,0.00061077654,0.00013117705,0.6589063],"genre_scores_gemma":[0.7282812,0.005114231,0.0007563532,0.0054699956,0.00025309445,0.000033186072,0.00005482281,0.00008269491,0.25995445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9993548,0.00023604388,0.000025327472,0.000108995126,0.00009371679,0.00018101446],"domain_scores_gemma":[0.9995926,0.00015416912,0.000045738056,0.000045025605,0.000074672054,0.00008769952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012988341,0.00025154412,0.00026972388,0.0005310504,0.0067980145,0.004402982,0.00040044385,0.0017216875,0.013271757],"category_scores_gemma":[0.0029810101,0.00029109043,0.000120161916,0.0006345607,0.010985995,0.0037219138,0.003383759,0.0029660899,0.0013300951],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006831845,0.000009455108,0.0005440232,0.00007325971,0.0000027416863,0.0004384555,0.06751501,0.000065191474,0.0002823394,0.9035617,0.018835926,0.00860355],"study_design_scores_gemma":[0.000011930234,0.000013045058,0.001909045,0.00018816825,0.0000038768458,0.00018794085,0.017513094,0.00006209736,0.00027516394,0.03999736,0.93981874,0.000019445144],"about_ca_topic_score_codex":0.0733125,"about_ca_topic_score_gemma":0.15311384,"teacher_disagreement_score":0.0733125,"about_ca_system_score_codex":0.0071881064,"about_ca_system_score_gemma":0.0046432586,"threshold_uncertainty_score":0.1457715},"labels":[],"label_agreement":null},{"id":"W7033541256","doi":"","title":"Press Release (1964-02-28) UMD spring quarter application submission deadline arriving","year":2018,"lang":"en","type":"other","venue":"University of Minnesota Digital Conservancy (University of Minnesota)","topic":"Advanced Graph Neural Networks","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":"Spring (device); Quarter (Canadian coin); Press release; Hydrology (agriculture)","score_opus":0.009332199771230993,"score_gpt":0.18307181098618422,"score_spread":0.17373961121495324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7033541256","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.0014825066,0.00067071285,0.002048946,0.0034252773,0.012612301,0.00077224895,0.030910471,0.00791873,0.9401588],"genre_scores_gemma":[0.0012245676,0.000108774955,0.00021779684,0.00016472419,0.00039016904,0.00006027127,0.0035450906,0.00076221064,0.99352646],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999146,0.00009179097,0.00003837222,0.00012235907,0.0004423987,0.00015914618],"domain_scores_gemma":[0.9964353,0.00039427553,0.000095778894,0.0002997211,0.001693963,0.0010809513],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012013396,0.0011647941,0.0013896815,0.0022101274,0.0017363217,0.006236963,0.0016239223,0.0019039724,0.87950456],"category_scores_gemma":[0.005897903,0.0005353264,0.0007646912,0.001663888,0.0004694687,0.0016665641,0.0016655759,0.0014434418,0.8675257],"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.000085824555,0.000024004496,0.000049286966,0.000062135274,0.0000024775397,0.00001632157,0.0000101469905,0.000042869553,0.00015746446,0.0006294089,0.98282444,0.01609553],"study_design_scores_gemma":[0.00005741146,0.00007416237,0.00077472813,0.00007141314,0.000004054605,0.00001878829,0.000047319063,0.000194332,0.00039885464,0.00097007124,0.9973788,0.000010061405],"about_ca_topic_score_codex":0.006967615,"about_ca_topic_score_gemma":0.016425489,"teacher_disagreement_score":0.12049544,"about_ca_system_score_codex":0.0016187078,"about_ca_system_score_gemma":0.0021110526,"threshold_uncertainty_score":0.17187202},"labels":[],"label_agreement":null},{"id":"W7034269136","doi":"","title":"Time course of corticospinal excitability in a simple reaction time task","year":2015,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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; University of Ottawa","funders":"","keywords":"Stimulus (psychology); Transcranial magnetic stimulation; Task (project management); Stimulation; Context (archaeology); Electroencephalography","score_opus":0.01748998912153622,"score_gpt":0.26900831238324335,"score_spread":0.25151832326170714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034269136","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.9956911,0.00013851709,0.0029959283,0.000019803065,0.000009628903,0.0000866822,0.00022278067,0.00006210769,0.0007735219],"genre_scores_gemma":[0.99612373,0.00008680732,0.0023435832,0.000023913211,0.000008393718,0.00014229117,0.00030400875,0.0000264463,0.0009408205],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9996586,0.000060340462,0.000028194883,0.000091237285,0.00012293604,0.000038565482],"domain_scores_gemma":[0.9985582,0.000686677,0.0003562868,0.00008971244,0.00018652389,0.00012259747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046006334,0.00032225397,0.00042027002,0.00028721968,0.000090660076,0.00029515658,0.00015872125,0.0003279871,0.0010076574],"category_scores_gemma":[0.0043068,0.00015322994,0.00015022981,0.00027501915,0.0001856147,0.00030720897,0.00021565004,0.00044916128,0.000285995],"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.0040345825,0.00025957046,0.010424008,0.0001382017,0.00005375033,0.00014627933,0.00044498863,0.0005263681,0.96863705,0.00010685758,0.00012104785,0.015107452],"study_design_scores_gemma":[0.000113220914,0.0038202878,0.8958512,0.000015873524,0.000055429988,0.00038385182,0.0001262129,0.0041961917,0.09450618,0.00029403198,0.0005943076,0.00004326949],"about_ca_topic_score_codex":0.00085993984,"about_ca_topic_score_gemma":0.0014577329,"teacher_disagreement_score":0.0010076574,"about_ca_system_score_codex":0.00016040183,"about_ca_system_score_gemma":0.00015601597,"threshold_uncertainty_score":0.0033709407},"labels":[],"label_agreement":null},{"id":"W7034758931","doi":"","title":"Understanding how family values shape the health-seeking behaviors of older adults in rural China","year":2025,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Advanced Graph Neural Networks","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":"University of Toronto; China Scholarship Council; McGill University Health Centre; Renmin University of China; National Natural Science Foundation of China; McGill University","keywords":"China; Population; Family values; Rural area; Family life","score_opus":0.029276094009003873,"score_gpt":0.2664954388128802,"score_spread":0.2372193448038763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034758931","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.99914825,0.00008885606,0.000033396453,0.00027999576,0.000002868399,0.0000020622801,0.00006004996,6.869716e-7,0.00038380164],"genre_scores_gemma":[0.9994443,0.00009144602,0.00003536067,0.000058714795,0.0000019070457,0.0000034203467,0.000048952657,7.0387637e-7,0.00031511273],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.9997414,0.000071051865,0.000010584632,0.000048201564,0.000028362543,0.00010044229],"domain_scores_gemma":[0.99876803,0.00030339527,0.00032938083,0.00006403108,0.00014324614,0.0003919743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069800514,0.0002270624,0.00025337224,0.00048640996,0.0010260879,0.00075945887,0.00042852736,0.00041401607,0.002271545],"category_scores_gemma":[0.0024893864,0.00021159726,0.00044768184,0.0009937959,0.0005342074,0.000648785,0.0007241481,0.0007476894,0.00012689798],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039446037,0.00007645231,0.9844029,0.000016564116,0.000062859406,0.000051845844,0.007281653,0.0001010353,0.00023623984,0.00026475833,0.00029210563,0.0071741235],"study_design_scores_gemma":[0.0000018160581,0.0000163427,0.9952461,0.000010634236,0.000015971551,0.000007568186,0.0041992064,0.00020930289,0.000017911258,0.0001331733,0.00013857844,0.0000033547324],"about_ca_topic_score_codex":0.24537835,"about_ca_topic_score_gemma":0.35654494,"teacher_disagreement_score":0.24537835,"about_ca_system_score_codex":0.0015679918,"about_ca_system_score_gemma":0.0018812141,"threshold_uncertainty_score":0.4879002},"labels":[],"label_agreement":null},{"id":"W7038331441","doi":"","title":"Government of Canada Invests $16.7 Million to Support Ontario's Power Grid Operator With Delivering Reliable, Affordable and Clean Energy","year":2024,"lang":"en","type":"other","venue":"","topic":"Advanced Graph Neural Networks","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":"Government (linguistics); Operator (biology); Electricity; Power (physics); Clean energy; Renewable energy","score_opus":0.004298751643616399,"score_gpt":0.1753533632370587,"score_spread":0.1710546115934423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7038331441","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.004947038,0.0015740321,0.0022802774,0.030180754,0.001766646,0.00027209808,0.033435628,0.0018795487,0.92366403],"genre_scores_gemma":[0.014735247,0.0010761401,0.0014910583,0.0025181416,0.000093477094,0.00003592279,0.0061121024,0.00033324613,0.9736048],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989189,0.000027156208,0.000013754027,0.000054517735,0.0006746911,0.0003109527],"domain_scores_gemma":[0.9965329,0.00011097889,0.00005043208,0.000086713466,0.002261592,0.000957198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076049013,0.0008453231,0.00044236038,0.0014533665,0.0049104756,0.0030318522,0.0010484598,0.002440145,0.23296978],"category_scores_gemma":[0.0021316996,0.0004844407,0.00078463193,0.0017980146,0.0013622929,0.0011204606,0.0014043909,0.0014293403,0.05170265],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053895463,0.000027273718,0.0007465819,0.00006934975,0.0000075430326,0.00004400594,0.0000469243,0.00017408175,0.0003187288,0.0043490943,0.96798193,0.026180487],"study_design_scores_gemma":[0.000032961412,0.000020766627,0.0027363682,0.000051683324,0.000008813611,0.000022657872,0.0002386763,0.0008330538,0.00032830794,0.0010828724,0.9946285,0.000015381902],"about_ca_topic_score_codex":0.9754406,"about_ca_topic_score_gemma":0.992093,"teacher_disagreement_score":0.9769272,"about_ca_system_score_codex":0.023072787,"about_ca_system_score_gemma":0.07016578,"threshold_uncertainty_score":0.77936155},"labels":[],"label_agreement":null},{"id":"W7038977132","doi":"","title":"kutte kamine betichod!!!===== I877288-2779 Gmail customer support number usa===Gmail customer support number usa canada ===!!","year":2016,"lang":"en","type":"other","venue":"OSF Preprints (OSF Preprints)","topic":"Advanced Graph Neural Networks","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":"Phone; Service (business); Service desk; Service provider; Telephone number","score_opus":0.009929774591186338,"score_gpt":0.257385942899275,"score_spread":0.2474561683080887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7038977132","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.0011243324,0.0024404256,0.003306977,0.0049448693,0.0038073563,0.00011225095,0.0011757546,0.003281483,0.9798064],"genre_scores_gemma":[0.0022583758,0.00078208395,0.0006011376,0.0006327605,0.00015104376,0.000023977307,0.00026439727,0.00041680227,0.9948695],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99956375,0.00004062575,0.000015048956,0.00011952512,0.00019246119,0.00006867325],"domain_scores_gemma":[0.9985707,0.00015034011,0.00004595779,0.00008521324,0.0006555274,0.00049223134],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004783463,0.0008387911,0.00078408374,0.0009919339,0.0021091758,0.0034489494,0.0007153507,0.0011476574,0.8101765],"category_scores_gemma":[0.0025722133,0.0003714304,0.000287085,0.0006101223,0.00044091127,0.0022065425,0.0019116666,0.0018650602,0.7529237],"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.00006182246,0.000027841314,0.00016921747,0.00008531564,0.0000019504264,0.00008640895,0.00009226448,0.000058106467,0.00050581194,0.0026548842,0.9223107,0.07394577],"study_design_scores_gemma":[0.000005177686,0.00001788,0.00028121343,0.00006692087,0.0000019386218,0.00020339848,0.000108143686,0.00007688615,0.00029834837,0.00029245336,0.99864084,0.000006816508],"about_ca_topic_score_codex":0.0031282338,"about_ca_topic_score_gemma":0.004963759,"teacher_disagreement_score":0.18982351,"about_ca_system_score_codex":0.0012005898,"about_ca_system_score_gemma":0.0012671545,"threshold_uncertainty_score":0.27076012},"labels":[],"label_agreement":null},{"id":"W7039030730","doi":"","title":"La paradiplomacia de los gobiernos subnacionales en América del Norte","year":2018,"lang":"en","type":"article","venue":"Dialnet (Universidad de la Rioja)","topic":"Advanced Graph Neural Networks","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":"Government (linguistics); Public policy; Conceptual framework; International relations; Qualitative research; The Conceptual Framework; Work (physics); State (computer science)","score_opus":0.008294440681341692,"score_gpt":0.258458711079855,"score_spread":0.2501642703985133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7039030730","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.88543445,0.005165673,0.00082563626,0.0031288064,0.000056850426,0.00007125134,0.00079037045,0.000042385258,0.10448452],"genre_scores_gemma":[0.96643627,0.0040943786,0.0009685005,0.00022296466,0.000016277549,0.00004592526,0.00029918086,0.00001627331,0.027900316],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995782,0.000096709795,0.000011476837,0.00006204804,0.00012375104,0.0001278042],"domain_scores_gemma":[0.9991049,0.00023994216,0.00018925245,0.00004736964,0.000315463,0.00010297801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093446026,0.00017522385,0.0001870877,0.0010191672,0.0014801556,0.0014526767,0.00037355893,0.00022858274,0.0031618432],"category_scores_gemma":[0.0018913886,0.00009494458,0.00009372972,0.0022426995,0.0016086019,0.000586383,0.0009575891,0.00050982815,0.00017376983],"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.0005215212,0.00011249715,0.23438755,0.0019559395,0.000048532886,0.0050702766,0.315464,0.0009842588,0.007997801,0.15267286,0.019816447,0.26096842],"study_design_scores_gemma":[0.000020361991,0.000031164738,0.4051189,0.0008364737,0.000052195588,0.0004930447,0.25544778,0.0005904056,0.00094962906,0.0030010063,0.33342704,0.000031952324],"about_ca_topic_score_codex":0.8080249,"about_ca_topic_score_gemma":0.9378867,"teacher_disagreement_score":0.19197512,"about_ca_system_score_codex":0.008983476,"about_ca_system_score_gemma":0.010372233,"threshold_uncertainty_score":0.38621134},"labels":[],"label_agreement":null},{"id":"W7039115838","doi":"","title":"Le plan intercommunal de sauvegarde : « de la conception à la mise en œuvre »","year":2024,"lang":"en","type":"dissertation","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Graph Neural Networks","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":"Institute on Governance","funders":"","keywords":"Context (archaeology); Face (sociological concept); Work (physics)","score_opus":0.007585132879235562,"score_gpt":0.24171623878617993,"score_spread":0.23413110590694436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7039115838","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.02697245,0.034649167,0.28095838,0.1085196,0.0077418988,0.0005132537,0.0014201206,0.0015969768,0.5376281],"genre_scores_gemma":[0.5853305,0.025748104,0.16483304,0.007748125,0.0012217688,0.00077407324,0.0020905002,0.0005976425,0.21165623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99796593,0.00076367136,0.000060625698,0.0002851501,0.0006950469,0.00022960383],"domain_scores_gemma":[0.99862146,0.00039390125,0.00014366534,0.00017683141,0.0004513245,0.00021287896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027848275,0.0008481143,0.00036406372,0.0011444929,0.0020436633,0.0067041307,0.0012197834,0.0025705025,0.00889378],"category_scores_gemma":[0.0043709213,0.0003143001,0.0005551147,0.0013428017,0.005357164,0.0046993466,0.0024525544,0.0038925298,0.0032297417],"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.00005913259,0.00004749824,0.0011542019,0.00030736724,0.000030923675,0.00011944975,0.0028273675,0.0045461147,0.000892861,0.7434637,0.059889775,0.18666154],"study_design_scores_gemma":[0.0000138264895,0.000026765314,0.0012198043,0.00036840676,0.000009216851,0.00012174096,0.0016344241,0.0042256434,0.0008346273,0.118206285,0.87330806,0.00003115473],"about_ca_topic_score_codex":0.03746724,"about_ca_topic_score_gemma":0.019033294,"teacher_disagreement_score":0.03746724,"about_ca_system_score_codex":0.0062014717,"about_ca_system_score_gemma":0.012050413,"threshold_uncertainty_score":0.074498296},"labels":[],"label_agreement":null},{"id":"W7043375682","doi":"","title":"From social networks to biological graphs: Addressing design issues and exploring practical applications in graph representation learning","year":2025,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Advanced Graph Neural Networks","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":"Graph; Representation (politics); Knowledge representation and reasoning; Social network (sociolinguistics); Feature learning","score_opus":0.12167938411064906,"score_gpt":0.3474987738074528,"score_spread":0.22581938969680376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7043375682","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.018065788,0.0006441077,0.9722775,0.003267878,0.0001291246,0.00008805332,0.00034090114,0.00071602676,0.004470719],"genre_scores_gemma":[0.32893884,0.0025900775,0.6544114,0.00079739763,0.00025496582,0.00040624544,0.0014277056,0.0005795181,0.010593954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930084,0.00037483996,0.00002871762,0.00016066234,0.000105875224,0.000029069133],"domain_scores_gemma":[0.99434596,0.004022564,0.00021582813,0.0006551654,0.000597214,0.00016328174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017051243,0.0004167934,0.0005044756,0.0007610875,0.00050086505,0.0015910865,0.0012249465,0.0007436083,0.0074983323],"category_scores_gemma":[0.014480438,0.00039271507,0.00076968485,0.0011989275,0.00094140694,0.0045958045,0.0014257806,0.0015449132,0.0014699132],"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.00013344536,0.00024010336,0.0028099655,0.0008594137,0.000092390466,0.00014143286,0.0007623698,0.13137391,0.0062726648,0.32408372,0.025134923,0.5080956],"study_design_scores_gemma":[0.000023036006,0.000061727966,0.00071142026,0.000071822156,0.00003919487,0.0001044777,0.00018799082,0.5425865,0.0028122368,0.43878937,0.014595269,0.000016920674],"about_ca_topic_score_codex":0.0018435197,"about_ca_topic_score_gemma":0.0036814057,"teacher_disagreement_score":0.0074983323,"about_ca_system_score_codex":0.00077946373,"about_ca_system_score_gemma":0.00072141254,"threshold_uncertainty_score":0.025084376},"labels":[],"label_agreement":null},{"id":"W7043807940","doi":"","title":"Triangle count estimation and label prediction over uncertain streaming graphs","year":2024,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Advanced Graph Neural Networks","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":"Blackberry (Canada)","funders":"","keywords":"Probabilistic logic; Graph; Uncertain data; Scope (computer science); Enhanced Data Rates for GSM Evolution; Graph theory; Dynamic network analysis","score_opus":0.010007076613353545,"score_gpt":0.21949615933815558,"score_spread":0.20948908272480204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7043807940","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.032388024,0.00017437521,0.96573955,0.0003308498,0.000040446725,0.00003232731,0.00023112685,0.0002674527,0.0007958822],"genre_scores_gemma":[0.72188616,0.00062657567,0.2706103,0.00018042116,0.00019720224,0.00011923632,0.001966727,0.00025495334,0.0041584023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988312,0.00034209146,0.00005429768,0.00039552726,0.00026100271,0.00011592058],"domain_scores_gemma":[0.9903989,0.0071002087,0.0007685393,0.0006398353,0.00083571946,0.00025697146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001956379,0.00072552066,0.0010464371,0.0017296992,0.00049638195,0.0017679537,0.0026307052,0.0011962901,0.0016764282],"category_scores_gemma":[0.018519616,0.0005852543,0.00080028526,0.0017892946,0.0010470335,0.0033593823,0.0014124372,0.0020603763,0.00040197163],"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.00009885225,0.000030219619,0.0029398375,0.00006242637,0.00003414451,0.00008386602,0.00010851517,0.9221605,0.0009290868,0.028622972,0.001378503,0.043551143],"study_design_scores_gemma":[0.0000010700992,0.000002898939,0.000108980734,0.0000025913805,0.0000013623383,0.000004648352,0.0000073910182,0.9895698,0.00013662534,0.010047227,0.00011538862,0.0000020678776],"about_ca_topic_score_codex":0.012288787,"about_ca_topic_score_gemma":0.011279217,"teacher_disagreement_score":0.012288787,"about_ca_system_score_codex":0.0019884119,"about_ca_system_score_gemma":0.0008067037,"threshold_uncertainty_score":0.024434507},"labels":[],"label_agreement":null},{"id":"W7065870066","doi":"","title":"Exploring the Role of ABCF1 in Mucosal Immunity of Human Airway Epithelial Cells","year":2024,"lang":"en","type":"dissertation","venue":"MacSphere (McMaster University)","topic":"Advanced Graph Neural Networks","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":"Canadian Institutes of Health Research; University of Waterloo","keywords":"In silico; Immune system; Transcriptome; Gene silencing; Function (biology); Receptor; Mucosal immunology; Immunity; Signal transduction; Innate immune system","score_opus":0.019825617184072285,"score_gpt":0.21564546848078298,"score_spread":0.1958198512967107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7065870066","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.9813922,0.0054822443,0.006255551,0.00035479822,0.000024824245,0.00005802612,0.004140619,0.00017945653,0.0021122817],"genre_scores_gemma":[0.9824471,0.003050502,0.008380113,0.00010161108,0.0000072700936,0.000070789865,0.005194233,0.000014112179,0.00073433784],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998661,0.000022681636,0.00000881907,0.000031750755,0.000045131488,0.000025394405],"domain_scores_gemma":[0.99993074,0.000024806208,0.000017501568,0.0000045187358,0.000015245745,0.0000072081625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017979914,0.00020265704,0.00045516097,0.0004984038,0.0002499829,0.00048399274,0.00017721883,0.0003294095,0.00123205],"category_scores_gemma":[0.00040848932,0.00009175953,0.0006001836,0.00072431925,0.00009948724,0.0002828853,0.00019556911,0.00021736507,0.00031528505],"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.0006380584,0.00017738224,0.057514016,0.0019417405,0.0002783401,0.0012780107,0.0002026511,0.01385118,0.85854465,0.0014678366,0.0014222047,0.06268389],"study_design_scores_gemma":[0.00009906913,0.0011681883,0.30189478,0.0002982055,0.0007075299,0.0030888917,0.0008979069,0.1603351,0.48830816,0.0035755238,0.039526146,0.00010038291],"about_ca_topic_score_codex":0.0021644672,"about_ca_topic_score_gemma":0.0023829534,"teacher_disagreement_score":0.0021644672,"about_ca_system_score_codex":0.00035333014,"about_ca_system_score_gemma":0.0003720426,"threshold_uncertainty_score":0.0043037534},"labels":[],"label_agreement":null},{"id":"W7066303043","doi":"","title":"~Help Usa@ +1-800-882-0652...((( avg tech support","year":2016,"lang":"en","type":"other","venue":"OSF Preprints (OSF Preprints)","topic":"Advanced Graph Neural Networks","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":"Phone; Service (business); Mobile phone; Smart phone; Phone call","score_opus":0.012637548418814995,"score_gpt":0.2617222552413493,"score_spread":0.2490847068225343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7066303043","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.0008254107,0.0002256941,0.0012111393,0.0025579005,0.0017093547,0.00018700566,0.002455944,0.005553544,0.98527414],"genre_scores_gemma":[0.0012247361,0.00011968409,0.0003130403,0.00066687644,0.00010081439,0.000049767626,0.0008092892,0.0006732048,0.9960426],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994861,0.000056679808,0.000019867512,0.00012738748,0.00020492203,0.00010503571],"domain_scores_gemma":[0.9972429,0.00021616317,0.000085688414,0.00016930891,0.0008629935,0.0014229823],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005255255,0.0013163829,0.0008020034,0.0012011245,0.0022700885,0.0036170254,0.0012670513,0.0020265924,0.9623707],"category_scores_gemma":[0.0031136214,0.00056067604,0.0004643071,0.0008421077,0.0004313004,0.003032466,0.0038214747,0.0012763281,0.9533248],"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.00002458866,0.000044005465,0.00012777292,0.000047551675,0.0000012875392,0.00003506966,0.000045766254,0.00001866597,0.00032669012,0.0005755885,0.9691749,0.029578034],"study_design_scores_gemma":[0.0000104351575,0.000021761372,0.0003623056,0.000037795387,0.0000025115464,0.00006244529,0.00011757323,0.00005671406,0.00016270396,0.00018447117,0.99897575,0.000005627585],"about_ca_topic_score_codex":0.002571433,"about_ca_topic_score_gemma":0.006120762,"teacher_disagreement_score":0.037629306,"about_ca_system_score_codex":0.00070510653,"about_ca_system_score_gemma":0.0010608429,"threshold_uncertainty_score":0.053673625},"labels":[],"label_agreement":null},{"id":"W7089239549","doi":"10.1109/rew66121.2025.00043","title":"Model-Driven Integration of Domain Knowledge into Machine Learning Workflows: A Case for Multidisciplinary System Design","year":2025,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Hitachi (Canada)","funders":"","keywords":"Workflow; Domain (mathematical analysis); Domain knowledge; Multidisciplinary approach; Domain engineering; Knowledge engineering; Expert system; Subject-matter expert; Knowledge-based systems","score_opus":0.03192924940363819,"score_gpt":0.30524717099899357,"score_spread":0.2733179215953554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7089239549","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.060748827,0.00030052694,0.92774796,0.0029429614,0.0000563828,0.00021593668,0.00010907256,0.0018094734,0.006068869],"genre_scores_gemma":[0.5073215,0.00027415098,0.48955762,0.00031651242,0.000022141174,0.00015806443,0.00028254357,0.00032663374,0.0017408972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947778,0.0030293239,0.00023319616,0.0006203152,0.0010461182,0.00029327613],"domain_scores_gemma":[0.9896853,0.005050536,0.00052577094,0.0031294406,0.0011751103,0.00043395406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076206983,0.0008439582,0.00070496136,0.00086618314,0.0013378246,0.0038195455,0.0021151376,0.0021762983,0.0013377399],"category_scores_gemma":[0.010572633,0.00066914957,0.0011252124,0.0009461729,0.002161499,0.0043971622,0.0031337673,0.003375252,0.00045823187],"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.00023143849,0.00060804037,0.004876537,0.0003423383,0.00012407353,0.0012486712,0.0026983237,0.6887436,0.012223939,0.1268601,0.0030067507,0.15903611],"study_design_scores_gemma":[0.000028110706,0.000071069815,0.0004946707,0.000067447196,0.00003209015,0.00015445004,0.00024275726,0.89583164,0.007092659,0.08201625,0.013923159,0.0000456698],"about_ca_topic_score_codex":0.006538785,"about_ca_topic_score_gemma":0.008687595,"teacher_disagreement_score":0.0076206983,"about_ca_system_score_codex":0.0024861854,"about_ca_system_score_gemma":0.0035510259,"threshold_uncertainty_score":0.040302575},"labels":[],"label_agreement":null},{"id":"W7092205149","doi":"10.1145/3725843.3756105","title":"TransFusion: End-to-End Transformer Acceleration via Graph Fusion and Pipelining","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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 Alberta","funders":"","keywords":"Transformer; Graph; Fusion; Acceleration; Minification","score_opus":0.014496647724907052,"score_gpt":0.26406587171164675,"score_spread":0.2495692239867397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7092205149","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.040285178,0.00048542573,0.93176067,0.0002281589,0.00009995034,0.00010296873,0.00035718898,0.018729564,0.007950856],"genre_scores_gemma":[0.58338785,0.0002782866,0.40528923,0.00025548317,0.000034019293,0.00011575714,0.0011501706,0.0013657166,0.0081235105],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996965,0.000046425244,0.000016156899,0.00007436852,0.000104176754,0.00006231877],"domain_scores_gemma":[0.999582,0.00014423026,0.00002648446,0.00011390103,0.000092872484,0.000040643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040808882,0.0009221051,0.00039553505,0.00042568427,0.00039730986,0.0008210584,0.0013736594,0.000349325,0.006848634],"category_scores_gemma":[0.0013238468,0.00030423483,0.00050687115,0.00047169995,0.0005356662,0.0017138746,0.0011369187,0.0010759629,0.001335862],"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.0008700135,0.00023027047,0.002620626,0.0002939236,0.00013023416,0.00040195553,0.0003889416,0.30394158,0.078102805,0.04537102,0.029801551,0.5378471],"study_design_scores_gemma":[0.000034840836,0.000122005375,0.00027270068,0.000011416674,0.000026321597,0.00008459692,0.000047982136,0.94627684,0.028751023,0.017439514,0.0069153053,0.000017505994],"about_ca_topic_score_codex":0.010111199,"about_ca_topic_score_gemma":0.02520875,"teacher_disagreement_score":0.010111199,"about_ca_system_score_codex":0.0010704737,"about_ca_system_score_gemma":0.0020873873,"threshold_uncertainty_score":0.022910953},"labels":[],"label_agreement":null},{"id":"W7095314690","doi":"","title":"Estimation of population size from biased samples using non-parametric binary regression. Statistica Sinica","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Estimator; Sampling (signal processing); Covariate; Abundance estimation; Population; Smoothing; Population size; Sample size determination; Kernel (algebra)","score_opus":0.05778569613823359,"score_gpt":0.3013149440289047,"score_spread":0.2435292478906711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7095314690","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.03929334,0.00064798386,0.9588248,0.00016099043,0.00007340746,0.00009364884,0.00025857225,0.00029036286,0.00035684602],"genre_scores_gemma":[0.47254968,0.0004286767,0.52313393,0.0002395175,0.000083189036,0.00072197453,0.00097396836,0.00016448981,0.0017045833],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9856075,0.011375483,0.00043250085,0.0012908384,0.001137832,0.00015584039],"domain_scores_gemma":[0.922876,0.061376646,0.0058138752,0.0071639093,0.0025134224,0.00025617064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02877619,0.000503914,0.0013769778,0.001809434,0.00037180135,0.00090583914,0.0021401963,0.0011376012,0.0019904312],"category_scores_gemma":[0.12523066,0.0004616569,0.00093151926,0.0014580332,0.0018199674,0.0012511958,0.0014437324,0.0015021446,0.00047871142],"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.0010845579,0.00029338105,0.10161167,0.0017389108,0.0017926713,0.0004115448,0.0007544769,0.15852346,0.012845028,0.100462995,0.0065325857,0.61394876],"study_design_scores_gemma":[0.00015486061,0.0002082568,0.04196943,0.0001724525,0.00024028575,0.0003459105,0.00008903649,0.855792,0.007686171,0.0880008,0.005262766,0.0000780104],"about_ca_topic_score_codex":0.0022664669,"about_ca_topic_score_gemma":0.0022947283,"teacher_disagreement_score":0.02877619,"about_ca_system_score_codex":0.0008507043,"about_ca_system_score_gemma":0.00066727726,"threshold_uncertainty_score":0.15218484},"labels":[],"label_agreement":null},{"id":"W7097747698","doi":"","title":"QA Sys t em Met i s Based on Semant i c Gr aph Mat chi ng","year":2015,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Knowledge graph; Graph; Semantic similarity; Interrogative; Matching (statistics); Semantic matching; Question answering","score_opus":0.02804918809838306,"score_gpt":0.2510899998782033,"score_spread":0.22304081177982024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097747698","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.057929147,0.00056757353,0.84702414,0.0012506288,0.00012422516,0.0011015068,0.0045230347,0.06765535,0.019824361],"genre_scores_gemma":[0.3803713,0.00037213252,0.59158367,0.00046754238,0.00009778272,0.00043955274,0.010553306,0.0010834389,0.015031266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865294,0.00029678294,0.00012176544,0.00045466892,0.000412509,0.000061319435],"domain_scores_gemma":[0.99822384,0.0006242118,0.00015884364,0.00037429907,0.00054328016,0.00007555625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014767542,0.0007524377,0.0008204901,0.0031351652,0.0009779969,0.0019671202,0.0011551072,0.00090157345,0.0093612885],"category_scores_gemma":[0.004770364,0.00043345438,0.001066383,0.0014585243,0.00075558375,0.004475721,0.0012442038,0.0009971453,0.0035941182],"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.0009736179,0.0007713881,0.011526625,0.0013258405,0.0003475127,0.00060710957,0.00209539,0.02090687,0.06894896,0.06797548,0.052815873,0.7717054],"study_design_scores_gemma":[0.00017285284,0.00049258355,0.010891872,0.0001379431,0.00022849783,0.00072123366,0.00088817853,0.7828217,0.069522254,0.057889227,0.076109186,0.0001245087],"about_ca_topic_score_codex":0.008122127,"about_ca_topic_score_gemma":0.008921054,"teacher_disagreement_score":0.0093612885,"about_ca_system_score_codex":0.0011709572,"about_ca_system_score_gemma":0.0013800294,"threshold_uncertainty_score":0.031316638},"labels":[],"label_agreement":null},{"id":"W7098697210","doi":"","title":"Empirically Estimated “True ” PPP Indexes","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Purchasing power parity; Price index; Index (typography); Measure (data warehouse); Axiom; Purchasing power; Reliability (semiconductor); Key (lock)","score_opus":0.050115698916507245,"score_gpt":0.2791068964436274,"score_spread":0.22899119752712016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7098697210","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.38512623,0.0016168865,0.42680457,0.0012103397,0.00045626194,0.00021856326,0.012501509,0.000661305,0.1714044],"genre_scores_gemma":[0.93793654,0.00068632996,0.05234883,0.000088734385,0.00007672206,0.00017889233,0.006544405,0.00010729522,0.0020323142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952915,0.0017662313,0.00046094978,0.0006659501,0.0015641369,0.00025124822],"domain_scores_gemma":[0.97338593,0.0169462,0.0026615444,0.0025896411,0.0042250124,0.00019165175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006469979,0.0004546458,0.00055932935,0.004350339,0.0006565643,0.003033875,0.0008515518,0.0005963629,0.007012705],"category_scores_gemma":[0.09029646,0.0002348318,0.00031487775,0.006558323,0.0012806004,0.0050151334,0.001909129,0.0012067104,0.0017156459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025844335,0.0000675012,0.08845814,0.0003880027,0.00013527012,0.00020935327,0.0010346038,0.08296618,0.00068878866,0.6540551,0.01457565,0.15716289],"study_design_scores_gemma":[0.00006845671,0.00014072283,0.07392176,0.0003323486,0.000079343125,0.0005899,0.0017114767,0.18187962,0.0059844637,0.6799983,0.0551288,0.00016485887],"about_ca_topic_score_codex":0.0016939049,"about_ca_topic_score_gemma":0.0013116266,"teacher_disagreement_score":0.007012705,"about_ca_system_score_codex":0.0018565023,"about_ca_system_score_gemma":0.0008871835,"threshold_uncertainty_score":0.03421694},"labels":[],"label_agreement":null},{"id":"W7098895584","doi":"","title":"CENTRE FOR THE STUDY OF LIVING STANDARDS MOVING FROM A GDP-BASED TO A WELL-BEING BASED METRIC OF ECONOMIC PERFORMANCE AND SOCIAL PROGRESS: RESULTS FROM THE INDEX OF ECONOMIC WELL-BEING FOR OECD COUNTRIES,","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Index (typography); Economic indicator; Economic impact analysis; Economic analysis; Standard of living; Ninth; Economic data; Economic sector; Economic forecasting","score_opus":0.01361307569009377,"score_gpt":0.2460716826577858,"score_spread":0.23245860696769205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7098895584","genre_codex":"dataset","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.16233836,0.06071133,0.010583832,0.025512245,0.003412112,0.0016479875,0.588237,0.0007078642,0.1468493],"genre_scores_gemma":[0.6550152,0.039632138,0.024875458,0.0017708851,0.001005029,0.0070495913,0.20204459,0.0004248221,0.0681822],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.99851936,0.00059330795,0.000118509364,0.0001656308,0.00039911448,0.00020400896],"domain_scores_gemma":[0.9934349,0.001186122,0.00083343073,0.0006010028,0.0032508315,0.00069367705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031738007,0.0006349515,0.0007330812,0.002012424,0.0005534545,0.0012563756,0.0008328604,0.0003408759,0.010205345],"category_scores_gemma":[0.007824598,0.00013823141,0.00079855946,0.0046009882,0.00035244433,0.0007981897,0.0016085077,0.0010987195,0.0035150626],"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.0010104646,0.0004586674,0.3177692,0.0016355211,0.00071163307,0.0002694977,0.0015412067,0.0021013427,0.00042367508,0.016459445,0.33163542,0.32598394],"study_design_scores_gemma":[0.00008632503,0.0002510634,0.8741145,0.00056163076,0.00013772787,0.00007100917,0.00095626904,0.00063660194,0.00035299986,0.0013860101,0.12141436,0.000031509706],"about_ca_topic_score_codex":0.16225891,"about_ca_topic_score_gemma":0.10868996,"teacher_disagreement_score":0.16225891,"about_ca_system_score_codex":0.0019218854,"about_ca_system_score_gemma":0.006207743,"threshold_uncertainty_score":0.32262892},"labels":[],"label_agreement":null},{"id":"W7099272442","doi":"","title":"COLLABORATION IN DISASTER MITIGATION 1 Suggestions for Canadian Inter-Organizational Collaboration in Disaster Mitigation","year":2001,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Disaster mitigation; Emergency management; Key (lock); Risk management; Disaster response; Climate change mitigation","score_opus":0.007525727055850006,"score_gpt":0.2613602399115461,"score_spread":0.2538345128556961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099272442","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.021690255,0.005909595,0.010816429,0.7869327,0.0016182119,0.00025841827,0.0002705887,0.00021416928,0.17228973],"genre_scores_gemma":[0.7849202,0.012443063,0.052295145,0.07539276,0.0004555026,0.0005997241,0.00054638064,0.000113724804,0.07323342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9880894,0.0048691677,0.00028948314,0.0005756086,0.0018800676,0.004296245],"domain_scores_gemma":[0.9790947,0.0020825025,0.0007956548,0.0003881774,0.0071244165,0.01051463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011225656,0.00051145046,0.00039455266,0.0021830655,0.02075748,0.011435673,0.0023910678,0.0045012403,0.016595177],"category_scores_gemma":[0.015413056,0.00043730834,0.0007572388,0.0039034605,0.0059333243,0.0066345953,0.009033648,0.0047209095,0.0011018756],"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.00014138891,0.00017606273,0.012419289,0.00083947985,0.00005510457,0.0009166805,0.02964409,0.004764985,0.0006011459,0.45027578,0.39153537,0.1086306],"study_design_scores_gemma":[0.00016432125,0.00007191779,0.015976144,0.0012727319,0.00006612248,0.00024481016,0.10214329,0.002348432,0.00049479643,0.09469467,0.782391,0.0001317626],"about_ca_topic_score_codex":0.90871805,"about_ca_topic_score_gemma":0.9668513,"teacher_disagreement_score":0.09128195,"about_ca_system_score_codex":0.06775712,"about_ca_system_score_gemma":0.31079873,"threshold_uncertainty_score":0.49161464},"labels":[],"label_agreement":null},{"id":"W7099591334","doi":"","title":"A profile of income assistance recipients in Winnipeg&amp;apos;s inner city","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Inner city; Poverty; Inner Cities; Population","score_opus":0.05487229303393986,"score_gpt":0.31435445735791556,"score_spread":0.2594821643239757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099591334","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.99558854,0.000088131084,0.000027701148,0.0003952056,0.0000044188546,0.000037766258,0.0018358736,0.0000051654306,0.0020173024],"genre_scores_gemma":[0.99291384,0.0003069276,0.00009508029,0.00019986834,0.000006601246,0.000035569592,0.001351147,0.0000077695095,0.005083194],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9996749,0.000026319176,0.000018576506,0.000028582112,0.000055141456,0.0001963741],"domain_scores_gemma":[0.99933064,0.000017477892,0.00012816761,0.0000081136,0.00013050367,0.00038520698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001719397,0.00018740908,0.00025973906,0.0019152536,0.0015917117,0.0011548839,0.0005161013,0.00039981102,0.004050089],"category_scores_gemma":[0.0006103959,0.0002065018,0.00014914165,0.0028878767,0.00032638287,0.0005985042,0.0013605542,0.00054831145,0.0009996193],"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.0000586721,0.0000958753,0.9860838,0.0000249903,0.000012974655,0.00033424457,0.0043294514,0.00006796101,0.00037911514,0.00015823016,0.0031767092,0.0052778665],"study_design_scores_gemma":[0.00000240849,0.000030554154,0.98182195,0.000012249613,0.0000057357947,0.00012709232,0.015765226,0.00008746272,0.00004611956,0.000016182865,0.0020786782,0.0000062481363],"about_ca_topic_score_codex":0.53076106,"about_ca_topic_score_gemma":0.7879341,"teacher_disagreement_score":0.46923894,"about_ca_system_score_codex":0.001650003,"about_ca_system_score_gemma":0.0023757706,"threshold_uncertainty_score":0.9440048},"labels":[],"label_agreement":null},{"id":"W7099777008","doi":"","title":"AUTHENTICITY IN NINETEENTH-CENTURY BACH INTERPRETATION","year":2016,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Interpretation (philosophy); Promotion (chess); Work (physics)","score_opus":0.006566258521323059,"score_gpt":0.22692349706451515,"score_spread":0.22035723854319209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099777008","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.058162715,0.0030163927,0.009536227,0.0069534415,0.000517335,0.00002660324,0.000089224195,0.000080711725,0.9216173],"genre_scores_gemma":[0.96150875,0.0005594938,0.0011560016,0.00039764828,0.0001897376,0.000010414263,0.000048190665,0.000056186545,0.03607351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966028,0.0019728453,0.00013324879,0.00036179592,0.0005978811,0.0003314493],"domain_scores_gemma":[0.99832934,0.00062091503,0.00015284175,0.00029928214,0.00047374796,0.00012385414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003919581,0.00033834839,0.0002408134,0.00111161,0.004038392,0.0045291693,0.00056209235,0.001288283,0.008308558],"category_scores_gemma":[0.0070101097,0.00021661964,0.000182239,0.0007553862,0.018337447,0.00392902,0.0025307648,0.002575254,0.0013723877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033038254,0.0000051804427,0.0003391516,0.000020385436,0.0000015803224,0.00007647263,0.032021407,0.00007272316,0.000083715735,0.955374,0.0033933767,0.008579145],"study_design_scores_gemma":[0.00004109208,0.000047958565,0.0025802369,0.00024032283,0.000009502214,0.0005483278,0.022286333,0.00093142496,0.00091610785,0.46579826,0.506558,0.00004229609],"about_ca_topic_score_codex":0.008491026,"about_ca_topic_score_gemma":0.012021274,"teacher_disagreement_score":0.008491026,"about_ca_system_score_codex":0.005864471,"about_ca_system_score_gemma":0.0016581939,"threshold_uncertainty_score":0.04254991},"labels":[],"label_agreement":null},{"id":"W7102416460","doi":"10.1016/j.ipm.2025.104460","title":"Text-free inductive knowledge graph embedding via meta graph-based prompt learning","year":2025,"lang":"en","type":"article","venue":"Information Processing & Management","topic":"Advanced Graph Neural Networks","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":"York University","funders":"Central China Normal University; China Postdoctoral Science Foundation; National Social Science Fund of China; Natural Science Foundation of Hubei Province; Ministry of Education of the People's Republic of China; National Outstanding Youth Science Fund Project of National Natural Science Foundation of China; National Natural Science Foundation of China","keywords":"Embedding; Graph; Knowledge graph; Node (physics); Inductive bias; Construct (python library); Bridge (graph theory); Entity linking","score_opus":0.013638960100838081,"score_gpt":0.2767357352978942,"score_spread":0.2630967751970561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7102416460","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.013622997,0.00040596782,0.9701644,0.00071796746,0.00024240775,0.0002447698,0.0028497842,0.008043016,0.00370872],"genre_scores_gemma":[0.44250926,0.00056026014,0.52987117,0.0007787115,0.00022640376,0.0006440915,0.013408641,0.00082394463,0.011177476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986964,0.00034125012,0.00008779027,0.00047955522,0.00029543327,0.000099655364],"domain_scores_gemma":[0.9954591,0.0024081457,0.00018844301,0.00091122004,0.00088252214,0.00015064288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009621562,0.0011371537,0.0009105734,0.0021760922,0.00083954,0.0011852132,0.0026945577,0.0019613665,0.012046332],"category_scores_gemma":[0.009511447,0.00050342456,0.0012826846,0.0024015433,0.0007525861,0.0048531136,0.0035761662,0.0031075943,0.004936299],"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.0007869326,0.00060926314,0.0019322442,0.0008764407,0.00014888484,0.00045633054,0.00042888135,0.07314164,0.012718775,0.034552425,0.0466695,0.8276787],"study_design_scores_gemma":[0.00007469144,0.00017491572,0.00056394574,0.00010662578,0.00010698411,0.00019815746,0.00020077436,0.8555964,0.011365583,0.1172165,0.01435398,0.000041337487],"about_ca_topic_score_codex":0.0026985838,"about_ca_topic_score_gemma":0.006372809,"teacher_disagreement_score":0.012046332,"about_ca_system_score_codex":0.0007710077,"about_ca_system_score_gemma":0.0017871038,"threshold_uncertainty_score":0.040299},"labels":[],"label_agreement":null},{"id":"W7103204158","doi":"","title":"Tractable Shapley Values and Interactions via Tensor Networks","year":2025,"lang":"","type":"article","venue":"arXiv (Cornell University)","topic":"Advanced Graph Neural Networks","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 Montréal","funders":"","keywords":"Multilinear map; Computation; Key (lock); Enumeration; Tensor (intrinsic definition); Scheme (mathematics)","score_opus":0.03514825441037215,"score_gpt":0.19567274841162163,"score_spread":0.1605244940012495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7103204158","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.07102917,0.00025243376,0.9164615,0.0006891133,0.000069018526,0.00011230206,0.00047710518,0.0012271605,0.009682138],"genre_scores_gemma":[0.7538018,0.00022653477,0.23799689,0.00024671343,0.000109752626,0.00027302385,0.001005578,0.00047322942,0.0058665643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982004,0.0007250716,0.00006944121,0.0003777767,0.00037538452,0.00025184202],"domain_scores_gemma":[0.996117,0.0022059618,0.00034457442,0.00077295373,0.00031504553,0.00024448507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025462687,0.0015895519,0.0013360719,0.0010839909,0.0010168009,0.0024942837,0.001879545,0.0011140221,0.00778547],"category_scores_gemma":[0.012921798,0.0006765037,0.0011391758,0.0012954675,0.0019137611,0.0058583026,0.0028984603,0.0027038364,0.00097558653],"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.00023558545,0.00012225148,0.0024694682,0.00016478356,0.00006457591,0.00012754269,0.00017606028,0.68282044,0.001484184,0.22014074,0.0064520724,0.08574233],"study_design_scores_gemma":[0.000011153664,0.00002028642,0.00009250669,0.000009670217,0.0000065238305,0.000015141218,0.000017140075,0.8569533,0.00035355,0.14196159,0.0005532172,0.0000058342425],"about_ca_topic_score_codex":0.0028453183,"about_ca_topic_score_gemma":0.005307692,"teacher_disagreement_score":0.00778547,"about_ca_system_score_codex":0.0025051737,"about_ca_system_score_gemma":0.0019036107,"threshold_uncertainty_score":0.026044965},"labels":[],"label_agreement":null},{"id":"W7114821263","doi":"","title":"Can TabPFN Compete with GNNs for Node Classification via Graph Tabularization?","year":2025,"lang":"","type":"article","venue":"ArXiv.org","topic":"Advanced Graph Neural Networks","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":"Kootenay Association for Science & Technology","funders":"","keywords":"Graph; Node (physics); Training set; Generalization; Benchmark (surveying); Bridge (graph theory); Feature (linguistics); Feature learning","score_opus":0.025778387898292104,"score_gpt":0.26439843270514785,"score_spread":0.23862004480685575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7114821263","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.26891878,0.0022449843,0.70279765,0.0031701017,0.0004386009,0.00018078214,0.0018682689,0.011253821,0.009127038],"genre_scores_gemma":[0.83522654,0.00052189105,0.15284339,0.0013205186,0.00013469801,0.00015104492,0.0047807274,0.00062419486,0.004396965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995322,0.00014898155,0.000019981071,0.00018148827,0.00005639278,0.000060910967],"domain_scores_gemma":[0.99756765,0.001194927,0.00018407348,0.0006484458,0.0002657051,0.00013930496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015970842,0.0010511315,0.0011312632,0.001146551,0.0006260444,0.0011574262,0.0025445991,0.0019692397,0.0034033402],"category_scores_gemma":[0.0082997065,0.000490061,0.0010257507,0.0012092895,0.0012138359,0.005368961,0.0015378314,0.0025372296,0.0015865881],"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.0004439592,0.00028203393,0.008992872,0.0003915405,0.00014399465,0.00016023936,0.00026575133,0.506417,0.004542835,0.029734205,0.027208213,0.4214174],"study_design_scores_gemma":[0.0000154247,0.00003888019,0.00023412921,0.000016501293,0.000008535422,0.00002414142,0.0000317264,0.97262585,0.0006179841,0.025415014,0.00096569594,0.000006194084],"about_ca_topic_score_codex":0.0059917644,"about_ca_topic_score_gemma":0.011801448,"teacher_disagreement_score":0.0059917644,"about_ca_system_score_codex":0.0014246838,"about_ca_system_score_gemma":0.0010466464,"threshold_uncertainty_score":0.011913776},"labels":[],"label_agreement":null},{"id":"W7115001468","doi":"10.1007/s13278-025-01514-y","title":"An LLM-guided framework for link prediction in homogeneous graphs","year":2025,"lang":"en","type":"article","venue":"Social Network Analysis and Mining","topic":"Advanced Graph Neural Networks","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":"Algoma University; Ontario Forest Research Institute; University of Windsor","funders":"","keywords":"Homogeneous; Intersection (aeronautics); Graph; Link (geometry); Social network (sociolinguistics); Similarity (geometry); Social network analysis","score_opus":0.01413249501823728,"score_gpt":0.29955431168627084,"score_spread":0.28542181666803357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7115001468","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.047651954,0.0010649367,0.9404697,0.00096910103,0.00010569184,0.000118264536,0.0012082825,0.0062256227,0.0021864362],"genre_scores_gemma":[0.72271574,0.0004988873,0.2640197,0.0008526304,0.00023237172,0.0002868743,0.0039239926,0.0005949448,0.0068748426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991447,0.0002746758,0.00003935534,0.0003022598,0.00014117149,0.00009786967],"domain_scores_gemma":[0.99725527,0.0017034871,0.00023932672,0.0003031661,0.00034682764,0.0001519667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016624643,0.0012527251,0.0013134186,0.00340286,0.0007708131,0.001309746,0.0031223986,0.0020118007,0.003581165],"category_scores_gemma":[0.0070829815,0.0006205258,0.0012098241,0.0023668658,0.0008821658,0.00312519,0.0016783399,0.0022597795,0.0015490176],"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.00020601173,0.00026606914,0.0040975385,0.0001622937,0.00011343799,0.00024537748,0.0001347865,0.8111209,0.0019582885,0.015252669,0.009437168,0.15700546],"study_design_scores_gemma":[0.0000035547466,0.0000057547727,0.000053023417,0.0000047366416,0.000003831645,0.0000053229696,0.0000052570435,0.9933515,0.000137985,0.0061999345,0.00022716254,0.0000020643852],"about_ca_topic_score_codex":0.015055705,"about_ca_topic_score_gemma":0.027975144,"teacher_disagreement_score":0.015055705,"about_ca_system_score_codex":0.0016936662,"about_ca_system_score_gemma":0.0013775942,"threshold_uncertainty_score":0.029936135},"labels":[],"label_agreement":null},{"id":"W7115813723","doi":"","title":"DOMAIN-SPECIFIC ADAPTATION AND MULTI-HOP REASONING IN CHEMISTRY AND BIOMEDICINE","year":2025,"lang":"en","type":"dissertation","venue":"MacSphere (McMaster University)","topic":"Advanced Graph Neural Networks","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":"Alliance de recherche numérique du Canada; Mitacs; McMaster University","keywords":"Biomedicine; Adaptation (eye); Pipeline (software); Bridge (graph theory); Embedding; Domain (mathematical analysis)","score_opus":0.013363919174536894,"score_gpt":0.21094524971601417,"score_spread":0.19758133054147728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7115813723","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.0741724,0.0019946883,0.8984077,0.0035653515,0.00029741027,0.00031836127,0.002379186,0.010308903,0.008555974],"genre_scores_gemma":[0.4069082,0.0012305733,0.5729604,0.0012952607,0.00020484201,0.00039409095,0.008842873,0.0010422119,0.007121551],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704427,0.0014019302,0.00017168921,0.0008932163,0.00037669466,0.000112206675],"domain_scores_gemma":[0.99299264,0.0048356415,0.00029984114,0.0012158738,0.0005064496,0.00014957791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003622143,0.0012815155,0.00060097873,0.0014694983,0.000842109,0.0018605384,0.001945904,0.0019168559,0.004245103],"category_scores_gemma":[0.015304875,0.00062983215,0.0017354393,0.0014052251,0.0015062562,0.006077709,0.0032018197,0.0041459957,0.0021912],"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.0003678352,0.0005175982,0.0042410456,0.0011857084,0.00022974085,0.00037861321,0.0010389234,0.24490488,0.017947976,0.06417629,0.025949163,0.6390623],"study_design_scores_gemma":[0.000038162856,0.000077969766,0.0008544789,0.00008029999,0.00005452976,0.0001460424,0.00021685964,0.870835,0.014058772,0.09632291,0.017279273,0.000035803125],"about_ca_topic_score_codex":0.0038526359,"about_ca_topic_score_gemma":0.0067923763,"teacher_disagreement_score":0.004245103,"about_ca_system_score_codex":0.0016191055,"about_ca_system_score_gemma":0.0018977552,"threshold_uncertainty_score":0.01915598},"labels":[],"label_agreement":null},{"id":"W7116390015","doi":"10.1016/j.asoc.2025.114506","title":"Contrastive learning with transformers for meta-path-free heterogeneous graph embedding","year":2025,"lang":"en","type":"article","venue":"Applied Soft Computing","topic":"Advanced Graph Neural Networks","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":"Mount Royal University","funders":"","keywords":"Graph; Feature learning; Embedding; Cluster analysis; Graph embedding; Transformer; Clustering coefficient; Artificial neural network","score_opus":0.011827145870331337,"score_gpt":0.2519593064691699,"score_spread":0.24013216059883857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116390015","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.01619591,0.00017133236,0.9808522,0.00015235404,0.000040033112,0.000045785044,0.00014042635,0.0006073854,0.0017946387],"genre_scores_gemma":[0.69587106,0.00031188523,0.29715145,0.00025535058,0.00008187869,0.0001731873,0.00077580166,0.0004041171,0.0049752668],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993767,0.00021303387,0.000032546403,0.00021051981,0.00011540243,0.000051845585],"domain_scores_gemma":[0.9980292,0.001137365,0.00010897613,0.0004270447,0.00020687155,0.00009049572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001247748,0.0008157059,0.0007892618,0.001133019,0.00042221032,0.0010786221,0.0018363476,0.001044681,0.005098652],"category_scores_gemma":[0.006420989,0.00041272122,0.0007667153,0.0009976076,0.001100807,0.0037461892,0.002689016,0.002138022,0.0009981628],"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.00053428457,0.0002443207,0.001474027,0.0003994459,0.00013607524,0.00022070683,0.00027681413,0.26359308,0.014002576,0.25044265,0.007160674,0.4615154],"study_design_scores_gemma":[0.000016887008,0.000058627957,0.00011570183,0.00001737229,0.000022266884,0.000044248038,0.000024485658,0.8821234,0.0022428895,0.11422957,0.0010964264,0.000008214294],"about_ca_topic_score_codex":0.0013896882,"about_ca_topic_score_gemma":0.002855657,"teacher_disagreement_score":0.005098652,"about_ca_system_score_codex":0.0007218833,"about_ca_system_score_gemma":0.00073732034,"threshold_uncertainty_score":0.017056644},"labels":[],"label_agreement":null},{"id":"W7117357404","doi":"10.1016/j.jprocont.2025.103614","title":"Robust soft sensing with causal and injectivity-preserving Graph Neural Network","year":2025,"lang":"en","type":"article","venue":"Journal of Process Control","topic":"Advanced Graph Neural Networks","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 Alberta","funders":"Canadian Centre for Clean Coal/Carbon and Mineral Processing Technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Robustness (evolution); Graph; A priori and a posteriori; Benchmark (surveying); Artificial neural network; Noise (video); Graph theory; Pattern recognition (psychology)","score_opus":0.009426928147155785,"score_gpt":0.23622733935786902,"score_spread":0.22680041121071323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117357404","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.023469744,0.000120324476,0.9750208,0.00015457737,0.000020148722,0.000020348856,0.00004074115,0.0003256895,0.0008276207],"genre_scores_gemma":[0.87706065,0.00015530435,0.12026331,0.00016773693,0.000030663767,0.000072934636,0.00014992556,0.000071262155,0.002028213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966943,0.000095256386,0.000014477808,0.00010149237,0.00008423961,0.0000351772],"domain_scores_gemma":[0.9990489,0.0005337778,0.0001422191,0.00010755828,0.00012889477,0.000038704402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008056463,0.00109404,0.0006127572,0.00045225612,0.00030680123,0.0006812532,0.0011267982,0.0010454586,0.0007900752],"category_scores_gemma":[0.0032422445,0.00043206214,0.0005438256,0.00037965085,0.0009967578,0.0015942021,0.0012869763,0.001398071,0.0001668237],"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.00004453806,0.000022274287,0.00035579025,0.000029582181,0.000019201674,0.000036437435,0.00003115402,0.96372575,0.0021719476,0.0061497767,0.00027031908,0.027143242],"study_design_scores_gemma":[0.000001345044,0.0000062421673,0.000024906287,0.0000012450021,0.0000012301535,0.0000029463704,0.0000015419109,0.9976636,0.00031363202,0.0019447956,0.000036967274,0.000001522519],"about_ca_topic_score_codex":0.0054600076,"about_ca_topic_score_gemma":0.006540879,"teacher_disagreement_score":0.0054600076,"about_ca_system_score_codex":0.0009062747,"about_ca_system_score_gemma":0.0008210443,"threshold_uncertainty_score":0.01085645},"labels":[],"label_agreement":null},{"id":"W7117726295","doi":"10.1145/3773274.3774662","title":"A Hybrid GraphRAG Framework for Geospatial Contextualization in Decision Support Systems","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Contextualization; Geospatial analysis; Flexibility (engineering); Decision support system; Architecture; Graph; Knowledge representation and reasoning; Face (sociological concept); Bayesian network","score_opus":0.015071684943805595,"score_gpt":0.3036364563265237,"score_spread":0.2885647713827181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117726295","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.0054923105,0.00043058072,0.98809344,0.0003847188,0.000027307417,0.000056636753,0.0004663876,0.003382332,0.001666398],"genre_scores_gemma":[0.2303697,0.00060322037,0.7641368,0.0003103428,0.00004870117,0.00015360313,0.0016805782,0.0003541815,0.002342978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993969,0.00024842398,0.00004211927,0.00015868821,0.000116588424,0.00003716456],"domain_scores_gemma":[0.99951756,0.00021499806,0.00003343337,0.00012361947,0.00008091451,0.00002944099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008445418,0.0005545037,0.000534283,0.0013945173,0.00050899055,0.0015881683,0.0014615629,0.00087987486,0.0036809756],"category_scores_gemma":[0.002167039,0.00031441278,0.0009969216,0.0013961917,0.0007027816,0.0028721853,0.0015700475,0.0010248941,0.0010092782],"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.00014523615,0.00017856677,0.0010018331,0.00041080778,0.0001379313,0.0003361491,0.00053701416,0.49892953,0.0068478934,0.20398083,0.011105057,0.2763891],"study_design_scores_gemma":[0.000015978983,0.000031719723,0.00015981766,0.000031874584,0.000032133434,0.000050282335,0.00006201045,0.87206423,0.0015907349,0.11307721,0.012866958,0.000017141298],"about_ca_topic_score_codex":0.015546159,"about_ca_topic_score_gemma":0.021551637,"teacher_disagreement_score":0.015546159,"about_ca_system_score_codex":0.0008620178,"about_ca_system_score_gemma":0.0012053818,"threshold_uncertainty_score":0.030911386},"labels":[],"label_agreement":null},{"id":"W7117985678","doi":"10.1145/3712285.3787177","title":"10.1145/3712285.3787177","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Advanced Graph Neural Networks","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":"Session (web analytics); Training (meteorology); Artificial neural network; Graph","score_opus":0.00477333206998846,"score_gpt":0.17575072235871814,"score_spread":0.17097739028872969,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117985678","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.0028497912,0.009841099,0.016440293,0.0019431912,0.0028368852,0.00056809955,0.035911918,0.025430433,0.9041784],"genre_scores_gemma":[0.0042440034,0.0031535462,0.0027267926,0.0008642509,0.00016738311,0.00024022233,0.014024859,0.002264009,0.9723149],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993036,0.000053673015,0.000054569424,0.00021382529,0.00023749018,0.00013678242],"domain_scores_gemma":[0.9987526,0.00029023262,0.00006348402,0.00041869437,0.0002758551,0.00019919395],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016161166,0.0035700612,0.0026957225,0.0029206227,0.0021762757,0.0043502375,0.0031519064,0.0050499975,0.9413015],"category_scores_gemma":[0.002779295,0.0018069597,0.0013089104,0.010311375,0.0013819594,0.008708284,0.0053164475,0.0028572704,0.9626245],"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.0002331289,0.00015513349,0.00036625817,0.0005187146,0.000043093554,0.00017441179,0.00005604284,0.00073466735,0.0010123757,0.0039930944,0.69844574,0.2942673],"study_design_scores_gemma":[0.000044904606,0.000038439794,0.00089157536,0.00028708935,0.000046659123,0.00014180329,0.00006656347,0.0013237261,0.0006127719,0.0017446827,0.99476564,0.00003623718],"about_ca_topic_score_codex":0.0220856,"about_ca_topic_score_gemma":0.018639138,"teacher_disagreement_score":0.058698475,"about_ca_system_score_codex":0.002299712,"about_ca_system_score_gemma":0.0010347433,"threshold_uncertainty_score":0.08372623},"labels":[],"label_agreement":null},{"id":"W7124274261","doi":"10.65109/uxfg1018","title":"Sum-Product-Max Networks for Tractable Decision Making: (Extended Abstract)","year":2016,"lang":"","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Context (archaeology); Set (abstract data type); Stability (learning theory); Decision theory; Feature (linguistics)","score_opus":0.024526551018238387,"score_gpt":0.29098619774469187,"score_spread":0.2664596467264535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124274261","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.010401507,0.0017738729,0.9719374,0.0019037459,0.0002786032,0.00009472319,0.0005047475,0.00032637376,0.012779115],"genre_scores_gemma":[0.5022825,0.003944792,0.450791,0.0015795915,0.001091429,0.000940449,0.0017192202,0.0007810304,0.036870014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979243,0.0011169247,0.00007966896,0.00044095484,0.0002547382,0.00018342453],"domain_scores_gemma":[0.992454,0.006123086,0.00028601498,0.00044635576,0.00049264653,0.00019788225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004173919,0.0020657317,0.00274987,0.00092701835,0.0009994773,0.0033267809,0.002880266,0.0031503264,0.01678124],"category_scores_gemma":[0.019061208,0.0012257793,0.0018399111,0.0027046043,0.0025268449,0.0059632165,0.0031051713,0.00522628,0.002426218],"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.00026338457,0.00023941405,0.0004121431,0.00062074,0.00020789994,0.00013474582,0.00018050104,0.50713867,0.000518778,0.388068,0.023119675,0.07909607],"study_design_scores_gemma":[0.000020957084,0.000019332365,0.000055237786,0.000032586508,0.000020138552,0.0000143635525,0.000010873087,0.6649132,0.00018135349,0.33328325,0.001435828,0.000012842098],"about_ca_topic_score_codex":0.0060086036,"about_ca_topic_score_gemma":0.0077455696,"teacher_disagreement_score":0.01678124,"about_ca_system_score_codex":0.0027162032,"about_ca_system_score_gemma":0.0025150054,"threshold_uncertainty_score":0.056138813},"labels":[],"label_agreement":null},{"id":"W7125482623","doi":"10.1109/healthcom60686.2025.11343158","title":"CHARM: Leveraging Reused Medical Knowledge Graphs and LLMs for Community Health Resource Recommendation","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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 Guelph; Algoma University","funders":"","keywords":"Resource (disambiguation); Community health; Health care; Key (lock); Public health; The Internet","score_opus":0.049249382275130295,"score_gpt":0.35348972798559075,"score_spread":0.30424034571046044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125482623","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.11191107,0.012213298,0.734516,0.006315652,0.0012677766,0.0014002721,0.06381862,0.056196403,0.012360853],"genre_scores_gemma":[0.52113855,0.0020718616,0.41268763,0.0018309861,0.0005666456,0.00046511996,0.05116835,0.0008936156,0.009177269],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922395,0.00019748267,0.000054358363,0.00023967387,0.00020964762,0.000074893665],"domain_scores_gemma":[0.99795663,0.0010389211,0.00012256428,0.00043060232,0.0003072439,0.00014396018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009780923,0.0012467104,0.0010005935,0.0071583744,0.00064335315,0.0010875273,0.001521662,0.0018159403,0.0054619396],"category_scores_gemma":[0.0076983273,0.0004398119,0.0012935571,0.00424083,0.00027265248,0.0019211895,0.0016069983,0.0011311236,0.0022840493],"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.0008384965,0.0009700624,0.020446455,0.0010713595,0.00097372447,0.00054308,0.0002251342,0.058447562,0.006461414,0.004558668,0.14473145,0.7607326],"study_design_scores_gemma":[0.00012588204,0.00018876781,0.0045188223,0.00019715495,0.00033881873,0.00032692106,0.00013637029,0.94375235,0.003903285,0.021429028,0.025016325,0.00006634644],"about_ca_topic_score_codex":0.031935688,"about_ca_topic_score_gemma":0.09315234,"teacher_disagreement_score":0.031935688,"about_ca_system_score_codex":0.00093601877,"about_ca_system_score_gemma":0.0017355715,"threshold_uncertainty_score":0.06349963},"labels":[],"label_agreement":null},{"id":"W7125612209","doi":"10.1109/cascon66301.2025.00043","title":"Intrinsic Defenses Against Backdoor Attacks in High-Order Graph Neural Networks via Semantic and Outlier-Guided Subgraph Policies","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Brock University","funders":"","keywords":"Backdoor; Camouflage; Leverage (statistics); Cluster analysis; Embedding; Graph; Exploit; Artificial neural network","score_opus":0.012110788314365177,"score_gpt":0.25928912104783297,"score_spread":0.2471783327334678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125612209","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.14949074,0.0004275363,0.8443134,0.0008296129,0.00005098437,0.00009298223,0.00017092591,0.002662878,0.001960996],"genre_scores_gemma":[0.95171475,0.00017333274,0.046418875,0.00020967305,0.000023633274,0.000056555462,0.00020127172,0.00013766307,0.001064236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983158,0.0005601258,0.00008442912,0.00043100817,0.00040527448,0.00020345992],"domain_scores_gemma":[0.99397594,0.0027807704,0.0010323127,0.0013690825,0.00053726544,0.00030471894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024931014,0.0011185617,0.0010295543,0.0008588446,0.00065728737,0.0011302098,0.0021367732,0.0014765011,0.0010897154],"category_scores_gemma":[0.011101175,0.0004829503,0.0010114069,0.0005617432,0.0019179637,0.0034952362,0.002305454,0.0023957563,0.00027404833],"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.00014321583,0.000075245014,0.0020720637,0.000057683545,0.000058107806,0.000087294386,0.00010352249,0.945548,0.0031488007,0.015879719,0.0008038114,0.03202248],"study_design_scores_gemma":[0.000004684335,0.000024788073,0.00010004543,0.000004213138,0.000006456717,0.000018120889,0.000008271777,0.98819077,0.00089763827,0.010607118,0.00013366749,0.0000041042326],"about_ca_topic_score_codex":0.0043324274,"about_ca_topic_score_gemma":0.0059873783,"teacher_disagreement_score":0.0043324274,"about_ca_system_score_codex":0.0020881342,"about_ca_system_score_gemma":0.0015187748,"threshold_uncertainty_score":0.015150487},"labels":[],"label_agreement":null},{"id":"W7125614367","doi":"10.1109/cascon66301.2025.00106","title":"Generating Labeled Graphs Using Conditional Wasserstein GANs","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Brock University","funders":"","keywords":"Discriminator; Graph; Adjacency matrix; Generator (circuit theory); Adjacency list; Class (philosophy); Node (physics); Source code; Feature (linguistics)","score_opus":0.022151605167094995,"score_gpt":0.28992080758811356,"score_spread":0.26776920242101854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125614367","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.023732862,0.00019532545,0.97092324,0.00039454649,0.000053761807,0.000078549725,0.0004265446,0.0016164422,0.0025787288],"genre_scores_gemma":[0.66904104,0.00030955498,0.3178408,0.0009196344,0.00008416619,0.00035034816,0.0038058923,0.00096402684,0.0066845096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928623,0.0002730621,0.000017389548,0.00024042623,0.0001306412,0.000052278185],"domain_scores_gemma":[0.99805933,0.0012312331,0.00014892184,0.00028126768,0.00019336425,0.000085820335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012256941,0.0011746282,0.0006767319,0.00078008015,0.0003538504,0.0007027709,0.0017224138,0.0011286502,0.0025655376],"category_scores_gemma":[0.0048634047,0.00055711914,0.0008564354,0.0006470522,0.0010676938,0.0013784033,0.0013290598,0.0018954636,0.00069928257],"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.000079605874,0.000054244156,0.0009755762,0.00006910647,0.000043705277,0.000115052135,0.00007059539,0.9077797,0.0031678183,0.027693795,0.005941657,0.0540091],"study_design_scores_gemma":[0.0000055777127,0.0000070590313,0.00004627168,0.0000042949982,0.0000030508802,0.000013486789,0.0000037530513,0.9857944,0.00047567603,0.013268944,0.0003746155,0.0000027267415],"about_ca_topic_score_codex":0.0033491296,"about_ca_topic_score_gemma":0.008108324,"teacher_disagreement_score":0.0033491296,"about_ca_system_score_codex":0.0011740101,"about_ca_system_score_gemma":0.0007217106,"threshold_uncertainty_score":0.008582592},"labels":[],"label_agreement":null},{"id":"W7125647762","doi":"10.1109/cascon66301.2025.00055","title":"GrIIM: Graph-Based IED Impact Assessment Using MCDM","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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 New Brunswick","funders":"","keywords":"Multiple-criteria decision analysis; Risk assessment; Work (physics); Matching (statistics); Process (computing); Fuzzy logic","score_opus":0.025683518980690094,"score_gpt":0.366773346043733,"score_spread":0.3410898270630429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125647762","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.022728002,0.00025522275,0.9489747,0.0003429035,0.00012979185,0.00034443915,0.0049572173,0.010422784,0.011844966],"genre_scores_gemma":[0.2483692,0.00014811642,0.74277675,0.00013455682,0.00002998431,0.00037719723,0.0038266233,0.00066538557,0.0036721397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992249,0.00025090962,0.00003204025,0.00011214867,0.0003265638,0.000053319636],"domain_scores_gemma":[0.99851376,0.0008172064,0.00009568285,0.00015938513,0.00035225024,0.0000616969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012532228,0.0014335854,0.0012931869,0.004121942,0.00048252952,0.0012017008,0.001592782,0.0012264199,0.018497147],"category_scores_gemma":[0.0052236007,0.0005245941,0.0013452292,0.0025168853,0.0003008985,0.0011751396,0.0015883226,0.0011797836,0.0015899272],"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.00024298683,0.00041981097,0.003968458,0.00081022223,0.00041887155,0.00017627559,0.00011066533,0.71535057,0.002950967,0.019589199,0.018887918,0.23707403],"study_design_scores_gemma":[0.000027016133,0.000036580237,0.0004432237,0.000027397802,0.000023316654,0.000017098162,0.000039497554,0.9873841,0.00071266264,0.008288117,0.0029869277,0.000014028783],"about_ca_topic_score_codex":0.0132399555,"about_ca_topic_score_gemma":0.022857739,"teacher_disagreement_score":0.018497147,"about_ca_system_score_codex":0.0007652631,"about_ca_system_score_gemma":0.001127328,"threshold_uncertainty_score":0.0618791},"labels":[],"label_agreement":null},{"id":"W7125934732","doi":"10.1109/smc58881.2025.11343641","title":"GEE: Graphormer-Enhanced Encoder Model for Anomaly Detection in Weighted Signed Networks","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"New York Institute of Technology","funders":"","keywords":"Encoder; Embedding; Autoencoder; Encoding (memory); Anomaly detection; Enhanced Data Rates for GSM Evolution","score_opus":0.010632243236059618,"score_gpt":0.2554995147253244,"score_spread":0.24486727148926477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125934732","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.020073501,0.00017515957,0.9758552,0.00030879682,0.00004926779,0.000047437337,0.00040749638,0.0016000884,0.0014830165],"genre_scores_gemma":[0.7460846,0.00034472183,0.24052168,0.00039163558,0.000075049174,0.00013920917,0.0012119573,0.00034908214,0.010882114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956876,0.00010921629,0.000019726342,0.00013284392,0.00012096291,0.000048404618],"domain_scores_gemma":[0.9983675,0.0007704862,0.00016742307,0.0002560365,0.00036841666,0.00007012959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009337816,0.0006375126,0.00055270357,0.0007654436,0.00024130526,0.0007862426,0.0016573177,0.0008907986,0.0034843613],"category_scores_gemma":[0.0059254435,0.0003271711,0.00041029742,0.00074931607,0.0006265667,0.0028382244,0.00095492136,0.0015166656,0.0007877009],"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.0003313529,0.00014975773,0.0030089684,0.00015406379,0.00006796852,0.00023792108,0.00020068965,0.53471154,0.0105551835,0.11254798,0.00911805,0.3289165],"study_design_scores_gemma":[0.0000047088847,0.000014407069,0.00011018754,0.0000034452707,0.000004932977,0.000024523311,0.000004411059,0.9818527,0.0012150832,0.016210558,0.00054963416,0.00000535749],"about_ca_topic_score_codex":0.0067647775,"about_ca_topic_score_gemma":0.0112263225,"teacher_disagreement_score":0.0067647775,"about_ca_system_score_codex":0.001146267,"about_ca_system_score_gemma":0.0010065885,"threshold_uncertainty_score":0.013450801},"labels":[],"label_agreement":null},{"id":"W7125961461","doi":"10.21428/594757db.9a835c96","title":"Fast Graph Neural Network for Image Classification","year":2025,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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 Windsor","funders":"","keywords":"Preprocessor; Voronoi diagram; Convolutional neural network; Contextual image classification; Pattern recognition (psychology); Graph; Delaunay triangulation; Pixel; Benchmark (surveying)","score_opus":0.01708352924429125,"score_gpt":0.27772869100038944,"score_spread":0.2606451617560982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125961461","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.020977931,0.0026259595,0.9690138,0.0007325504,0.00019483743,0.00007862114,0.00054304325,0.0028811658,0.002952074],"genre_scores_gemma":[0.6123784,0.0023342187,0.37148914,0.00059192354,0.00022064496,0.000214769,0.002618886,0.00032549837,0.009826618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999663,0.00006519735,0.000015209921,0.00010842403,0.00010167899,0.00004646346],"domain_scores_gemma":[0.99950993,0.00020929564,0.00006373114,0.000059044964,0.00013234635,0.00002558575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004686398,0.0009756618,0.0008970799,0.0017529466,0.00036618544,0.00091306906,0.0015118468,0.0012842977,0.002567664],"category_scores_gemma":[0.0022867597,0.00037554474,0.00075099315,0.002070878,0.00059336424,0.001625719,0.0007898351,0.001446686,0.0010052961],"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.00012835347,0.00006806635,0.0011303278,0.00015988373,0.000089012625,0.00007786761,0.000044272023,0.60838354,0.0038340522,0.020583443,0.009504419,0.35599673],"study_design_scores_gemma":[0.0000020917864,0.000006023273,0.00008478375,0.0000046963687,0.0000039399747,0.0000089061605,0.0000039268907,0.9913078,0.00041572977,0.00753384,0.00062555575,0.0000027106128],"about_ca_topic_score_codex":0.01693902,"about_ca_topic_score_gemma":0.017472567,"teacher_disagreement_score":0.01693902,"about_ca_system_score_codex":0.0016453359,"about_ca_system_score_gemma":0.0009304553,"threshold_uncertainty_score":0.033680856},"labels":[],"label_agreement":null},{"id":"W7126407239","doi":"10.21428/594757db.d853176e","title":"SAGNN+CS: A Resilient Graph Neural Network Framework Against Backdoor Threats","year":2025,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Brock University","funders":"","keywords":"Backdoor; Leverage (statistics); Adversarial system; Vulnerability (computing); Resilience (materials science); Graph; Robustness (evolution); Vulnerability assessment","score_opus":0.0122206421476452,"score_gpt":0.2719084881466722,"score_spread":0.259687845999027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7126407239","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.020472206,0.00043228126,0.97181016,0.0005530175,0.00010013455,0.00008495757,0.00024178305,0.0037706166,0.002534813],"genre_scores_gemma":[0.68540394,0.0006423682,0.30421683,0.0006039376,0.00010491485,0.00021961094,0.0010116352,0.0004980043,0.0072987997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995129,0.00014854157,0.000021892734,0.00013096289,0.00012955283,0.00005618705],"domain_scores_gemma":[0.9991035,0.00033167913,0.00011041603,0.00021729385,0.00018402997,0.000053085965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010661646,0.00094802276,0.00058461673,0.000985134,0.0004943687,0.0009491746,0.0022355833,0.0013023175,0.002590457],"category_scores_gemma":[0.003435406,0.00035181455,0.00074486004,0.00059258565,0.0010929946,0.002043591,0.0016745372,0.0018157267,0.0007260438],"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.00006448806,0.00004297285,0.0007183984,0.00008271891,0.00006535359,0.00006881268,0.000041567582,0.90547085,0.0028621724,0.019124107,0.003296512,0.06816204],"study_design_scores_gemma":[0.0000030772194,0.0000177076,0.00005170132,0.00000507189,0.0000064499104,0.000017150262,0.0000063761163,0.98600394,0.00080603355,0.012212304,0.00086599565,0.0000041704516],"about_ca_topic_score_codex":0.006145791,"about_ca_topic_score_gemma":0.011887708,"teacher_disagreement_score":0.006145791,"about_ca_system_score_codex":0.0013085883,"about_ca_system_score_gemma":0.0013062939,"threshold_uncertainty_score":0.012220085},"labels":[],"label_agreement":null},{"id":"W7126423241","doi":"10.21428/594757db.269457de","title":"GCE: Confidence Calibration Error for ImprovedTrustworthiness of Graph Neural Networks","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Vector Institute; Toronto Metropolitan University","funders":"","keywords":"Graph; Artificial neural network; Confidence interval; Calibration; Homogeneous; Pattern recognition (psychology); Code (set theory); Training set; Error function","score_opus":0.01637108806119735,"score_gpt":0.2768592316950903,"score_spread":0.26048814363389294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7126423241","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.11976585,0.0016180929,0.86497617,0.0024819772,0.00033925337,0.00018169178,0.00071592384,0.00563851,0.0042825523],"genre_scores_gemma":[0.8762785,0.000437487,0.11792864,0.0005885622,0.0001275588,0.00016218759,0.0011646322,0.0007069728,0.00260542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975177,0.0007954689,0.0001618896,0.00056563737,0.000748677,0.00021067601],"domain_scores_gemma":[0.98209184,0.009678373,0.0018285989,0.003192739,0.0027125562,0.0004959711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061167316,0.0015348062,0.0012217247,0.0015976112,0.000782612,0.0017480829,0.0032234981,0.0024677787,0.0028165595],"category_scores_gemma":[0.052801717,0.00063039846,0.00074350054,0.0009660443,0.0016702747,0.0041827844,0.0032731115,0.0037989682,0.00072227244],"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.00031978163,0.00013529486,0.0072266525,0.00019255649,0.00012976606,0.00015636528,0.00017755975,0.8282077,0.0022333555,0.013990759,0.00744916,0.13978113],"study_design_scores_gemma":[0.000012011214,0.000036679834,0.00039270532,0.000027918919,0.000010580961,0.000036964768,0.000012154559,0.98898715,0.001136473,0.008899436,0.00043795494,0.000009961435],"about_ca_topic_score_codex":0.006186683,"about_ca_topic_score_gemma":0.00736019,"teacher_disagreement_score":0.006186683,"about_ca_system_score_codex":0.0025271524,"about_ca_system_score_gemma":0.0015357389,"threshold_uncertainty_score":0.032348752},"labels":[],"label_agreement":null},{"id":"W7126465581","doi":"10.21428/594757db.c800bcad","title":"How Robust Are Higher-Order Graph Neural Networks to Backdoor Attacks?","year":2025,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Brock University","funders":"","keywords":"Backdoor; Adversarial system; Artificial neural network; Software deployment; Guard (computer science); Deep neural networks","score_opus":0.017841941291305514,"score_gpt":0.2470336044121141,"score_spread":0.2291916631208086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7126465581","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.38874543,0.0025205961,0.5917248,0.003574485,0.00046863477,0.00014457983,0.00032743855,0.0024122782,0.010081774],"genre_scores_gemma":[0.98159707,0.00054733857,0.01561214,0.00023935807,0.000042126496,0.000032040938,0.00012498214,0.000094093295,0.0017107904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894685,0.0002634227,0.000048375146,0.00025561257,0.00028967625,0.00019601278],"domain_scores_gemma":[0.99492055,0.002463229,0.00072958984,0.0011519983,0.0005334992,0.00020125447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018238896,0.0008888952,0.00077485293,0.0006161172,0.00053652,0.0016263307,0.0012230083,0.0015821251,0.002209157],"category_scores_gemma":[0.016172048,0.00041350722,0.00058149087,0.00033548844,0.0016396794,0.0039435616,0.0012044613,0.0021454715,0.00065953354],"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.00042115606,0.00011685405,0.0048729624,0.00030261718,0.00025825584,0.00022830871,0.0002073334,0.7941118,0.021134567,0.06248393,0.0035603377,0.11230176],"study_design_scores_gemma":[0.000014781371,0.0001825455,0.0009113168,0.00004142744,0.000047386533,0.00020209086,0.00009245575,0.9427948,0.00735938,0.04668469,0.0016351714,0.000034039116],"about_ca_topic_score_codex":0.0021461006,"about_ca_topic_score_gemma":0.002928224,"teacher_disagreement_score":0.002209157,"about_ca_system_score_codex":0.0008952347,"about_ca_system_score_gemma":0.0007683365,"threshold_uncertainty_score":0.00964576},"labels":[],"label_agreement":null},{"id":"W7127992935","doi":"10.32628/cseit25113676","title":"Real-Time Enterprise Data Harmonization Using Graph Neural Networks for Cross-System Integration and Customer Intelligence","year":2024,"lang":"","type":"article","venue":"International Journal of Scientific Research in Computer Science Engineering and Information Technology","topic":"Advanced Graph Neural Networks","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Enterprise information system; Enterprise private network; Enterprise integration; Enterprise life cycle; Data integration; Enterprise software; Graph; Enterprise data management; Big data","score_opus":0.04446078706468331,"score_gpt":0.3548634606905654,"score_spread":0.3104026736258821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7127992935","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.046123877,0.00030454213,0.9485014,0.0005081544,0.000049169692,0.00007647282,0.00025840636,0.0021786524,0.0019993172],"genre_scores_gemma":[0.7171884,0.00030861257,0.27884647,0.00026430056,0.000029643552,0.0001026649,0.0011528035,0.00018292852,0.0019241081],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918884,0.00022026818,0.000049970844,0.00025913076,0.00018885959,0.00009278709],"domain_scores_gemma":[0.9988194,0.00042297933,0.00015980795,0.00030097654,0.00025245157,0.0000443532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013431988,0.00058255706,0.00041387006,0.0014461103,0.0006549762,0.0016682096,0.0014418509,0.0007111656,0.0012887255],"category_scores_gemma":[0.0047710952,0.00037317094,0.00061299873,0.0019617362,0.0006376636,0.0033881457,0.002187506,0.0011645189,0.00036266042],"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.00017899947,0.00018071005,0.0066901287,0.000106242376,0.0001487412,0.00019228505,0.00033567604,0.66749716,0.0064393524,0.025200501,0.00384749,0.28918275],"study_design_scores_gemma":[0.0000031945085,0.000015502248,0.00044614298,0.000006169103,0.000013251078,0.00001913166,0.00006316215,0.98194444,0.0018917284,0.014470798,0.0011199856,0.0000064701667],"about_ca_topic_score_codex":0.015128257,"about_ca_topic_score_gemma":0.02033865,"teacher_disagreement_score":0.015128257,"about_ca_system_score_codex":0.0016574505,"about_ca_system_score_gemma":0.0013412322,"threshold_uncertainty_score":0.030080378},"labels":[],"label_agreement":null},{"id":"W7128052105","doi":"10.22260/crc-csce-2025/0146","title":"Enhancing Job Hazard Analysis Knowledge Retrieval Through Knowledge Graphs and Large Language Models","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Knowledge graph; Job analysis; Knowledge-based systems; Knowledge representation and reasoning; Knowledge base; Domain knowledge; Hazard; Knowledge extraction","score_opus":0.015841441701998398,"score_gpt":0.3033742773309586,"score_spread":0.2875328356289602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128052105","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.020960927,0.0005122937,0.9530658,0.001401995,0.000074448,0.0003514604,0.0028553822,0.015236244,0.0055414853],"genre_scores_gemma":[0.20019263,0.0008221704,0.7838823,0.0006488329,0.000045179673,0.00031547793,0.009496465,0.00072394614,0.0038729024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984289,0.0004957722,0.00014770236,0.0003686604,0.0004789049,0.00008002907],"domain_scores_gemma":[0.9953542,0.0026630412,0.0003503168,0.00085161376,0.00066200143,0.000118915785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018717136,0.0011619821,0.00059089257,0.0048773335,0.0008170444,0.0026880188,0.0018957973,0.0009820412,0.0026466993],"category_scores_gemma":[0.0092921425,0.0004986723,0.001791222,0.0024991874,0.00064404553,0.0045904396,0.002953992,0.001562333,0.0015338061],"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.00027684707,0.0006770265,0.00743538,0.0014970251,0.00035148836,0.00094679475,0.0021460762,0.11099944,0.027075456,0.044573624,0.031114906,0.77290595],"study_design_scores_gemma":[0.00004831598,0.00011212053,0.002940204,0.00025768534,0.00026779785,0.00031351738,0.0009000422,0.7911359,0.026455559,0.112699896,0.06474627,0.00012265157],"about_ca_topic_score_codex":0.015519681,"about_ca_topic_score_gemma":0.03550955,"teacher_disagreement_score":0.015519681,"about_ca_system_score_codex":0.0015457069,"about_ca_system_score_gemma":0.0027323568,"threshold_uncertainty_score":0.030858696},"labels":[],"label_agreement":null},{"id":"W7129401639","doi":"10.1109/icipw68931.2025.11386014","title":"Lightweight Transformer for Image Interpolation Via Unrolling of Multiple Learned Graph Laplacian Regularizers","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Laplacian matrix; Graph; Pattern recognition (psychology); Pixel; Minification; Transformer; Quadratic equation","score_opus":0.013084271294059894,"score_gpt":0.26776023530257004,"score_spread":0.25467596400851017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7129401639","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.010348304,0.00004133156,0.98583,0.00007909438,0.000024812598,0.000031110754,0.000033769564,0.0020734756,0.001538095],"genre_scores_gemma":[0.42960638,0.000118033655,0.56031704,0.00027192556,0.000044298216,0.00012337351,0.00026095827,0.00075818074,0.008499773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976283,0.000034704466,0.000009895725,0.000060848488,0.00009727095,0.000034519486],"domain_scores_gemma":[0.99965584,0.00010309181,0.00003851668,0.00010028238,0.00006875377,0.000033502798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000552322,0.0008128839,0.0005986582,0.00040720418,0.00024809854,0.00067352323,0.0015548954,0.00072388974,0.00533367],"category_scores_gemma":[0.0018155634,0.00035156644,0.0005109254,0.00033331022,0.00078100356,0.0014625089,0.001295177,0.0015650189,0.0015164858],"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.00030519374,0.00019205871,0.0008095831,0.00018094647,0.00006499109,0.00017956435,0.00013372237,0.46221954,0.050801203,0.052223243,0.006893417,0.4259966],"study_design_scores_gemma":[0.000009982327,0.00004541807,0.000045632412,0.0000040806426,0.0000055354913,0.00003667738,0.000009062648,0.9847574,0.006088748,0.008066612,0.0009253731,0.000005382885],"about_ca_topic_score_codex":0.0025043373,"about_ca_topic_score_gemma":0.006747319,"teacher_disagreement_score":0.00533367,"about_ca_system_score_codex":0.0006524968,"about_ca_system_score_gemma":0.00092056755,"threshold_uncertainty_score":0.017842889},"labels":[],"label_agreement":null},{"id":"W7131417874","doi":"10.1109/icdm65498.2025.00107","title":"Federated Graph Out-of-Distribution Generalization via Representation Propagation and Scattering","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Generalization; Robustness (evolution); Graph; Representation (politics); Feature learning; Upper and lower bounds; Feature (linguistics); Topology (electrical circuits); Generalization error","score_opus":0.018530117092676813,"score_gpt":0.2835511549845922,"score_spread":0.2650210378919154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7131417874","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.028037013,0.00023908753,0.9659561,0.00047106462,0.000045437722,0.00007795947,0.00021907185,0.003819962,0.0011343751],"genre_scores_gemma":[0.71675754,0.0002902502,0.27407637,0.0009195381,0.00010274226,0.00024048181,0.0018108576,0.00063351745,0.005168694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976707,0.00074153766,0.00008440248,0.00075079186,0.00053514814,0.00021725515],"domain_scores_gemma":[0.9945581,0.002054701,0.00037551086,0.0023108192,0.0005039874,0.00019698653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025814676,0.002005508,0.0021252008,0.0013252307,0.0011495135,0.0017143429,0.0039060274,0.0021846374,0.0024852988],"category_scores_gemma":[0.010065973,0.0007664604,0.0017304075,0.0017011637,0.0019622787,0.004889142,0.004678275,0.003249464,0.001064604],"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.00028214688,0.00032120597,0.0024166787,0.0001516051,0.00014487894,0.0002630935,0.00025539714,0.66128314,0.0062126117,0.021116655,0.01022874,0.2973239],"study_design_scores_gemma":[0.0000130537655,0.000029995716,0.00009592607,0.0000049451437,0.000009199234,0.000046765796,0.000020906622,0.98007435,0.0013026929,0.017910998,0.00048395328,0.0000071785553],"about_ca_topic_score_codex":0.00538702,"about_ca_topic_score_gemma":0.007927007,"teacher_disagreement_score":0.00538702,"about_ca_system_score_codex":0.0019124954,"about_ca_system_score_gemma":0.0017391185,"threshold_uncertainty_score":0.01387614},"labels":[],"label_agreement":null},{"id":"W7131619484","doi":"10.1109/ickg66886.2025.00021","title":"Quantifying Informativeness in Knowledge Graph-Augmented In-Context Learning for Multiple Choice Query Answering","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Brock University","funders":"","keywords":"Leverage (statistics); Key (lock); Knowledge graph; Selection (genetic algorithm); Embedding; Question answering; Pipeline (software)","score_opus":0.04087843100487856,"score_gpt":0.32742858056182517,"score_spread":0.2865501495569466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7131619484","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.22073066,0.0029216122,0.75639856,0.0018115023,0.0001455018,0.0003652362,0.0017524047,0.012250297,0.0036241587],"genre_scores_gemma":[0.8746204,0.00037563837,0.11997844,0.0005936814,0.00008188839,0.00019298127,0.0027901102,0.00020706178,0.0011598488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981693,0.00079700677,0.00007812887,0.0006080874,0.00021216008,0.0001352429],"domain_scores_gemma":[0.9924051,0.0060489974,0.00030810205,0.000620094,0.00039132268,0.00022632797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002640917,0.0019379513,0.0013176523,0.0017845436,0.00074118265,0.0013980344,0.0025731334,0.002508232,0.0025724384],"category_scores_gemma":[0.015150211,0.0005620262,0.0011957245,0.0013715907,0.0010148876,0.0054173823,0.002688443,0.0032833389,0.0009881585],"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.001150237,0.000699278,0.011850702,0.0007895567,0.00027873475,0.0003720454,0.0009697202,0.55941826,0.010328506,0.011341536,0.009799499,0.39300188],"study_design_scores_gemma":[0.000028772436,0.00011476586,0.0007247438,0.000018578547,0.00004153188,0.000047679332,0.000076016666,0.9770383,0.0016365821,0.019416347,0.0008421531,0.000014350529],"about_ca_topic_score_codex":0.008812467,"about_ca_topic_score_gemma":0.014095041,"teacher_disagreement_score":0.008812467,"about_ca_system_score_codex":0.0014727897,"about_ca_system_score_gemma":0.0010967604,"threshold_uncertainty_score":0.017522335},"labels":[],"label_agreement":null},{"id":"W7131654614","doi":"10.1109/ickg66886.2025.00028","title":"Intent-Driven Smart Manufacturing Integrating Knowledge Graphs and Large Language Models","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"École de Technologie Supérieure","funders":"","keywords":"JSON; Inference; Industry 4.0; Natural language understanding; Knowledge graph; Natural language; Knowledge representation and reasoning; Automation","score_opus":0.013635065804805552,"score_gpt":0.27153228312723826,"score_spread":0.2578972173224327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7131654614","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.058483556,0.00072540797,0.8515254,0.00094783976,0.00020166974,0.00037684737,0.0054828697,0.076130494,0.0061259298],"genre_scores_gemma":[0.36333692,0.00037536278,0.59954214,0.0009795976,0.000041089097,0.0002919461,0.028722556,0.0020969613,0.0046135113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99872005,0.00035832584,0.00006136093,0.00047369162,0.00029221224,0.000094449104],"domain_scores_gemma":[0.998285,0.0008208817,0.00008048294,0.00054702774,0.00019493679,0.00007167495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001242989,0.0014151359,0.00063626305,0.0011899683,0.00063807116,0.0015804997,0.0027838794,0.0015658322,0.0032042542],"category_scores_gemma":[0.0058775097,0.0006527089,0.0016705579,0.00091771473,0.000760476,0.0037570372,0.002546724,0.0023512968,0.0021694296],"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.00043532628,0.0007065874,0.0056131966,0.001037453,0.00029079252,0.00077481056,0.00075673434,0.45564565,0.023369791,0.024771493,0.0493062,0.43729186],"study_design_scores_gemma":[0.000029303226,0.00004929417,0.00043171732,0.000028681556,0.000026371634,0.00009243909,0.00013548408,0.9576444,0.0068649845,0.025957694,0.008714458,0.000025160965],"about_ca_topic_score_codex":0.02207744,"about_ca_topic_score_gemma":0.05211762,"teacher_disagreement_score":0.02207744,"about_ca_system_score_codex":0.001475839,"about_ca_system_score_gemma":0.0020303125,"threshold_uncertainty_score":0.043897867},"labels":[],"label_agreement":null},{"id":"W7132676662","doi":"","title":"Pre-training molecular graph representation with 3D geometry: rethinking self-supervised learning on structured data","year":2021,"lang":"en","type":"article","venue":"NPARC","topic":"Advanced Graph Neural Networks","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":"Discriminative model; Graph; Molecular graph; Feature learning; Representation (politics); Consistency (knowledge bases); Graph property; External Data Representation; Encoder","score_opus":0.032018628159558325,"score_gpt":0.27779923183646804,"score_spread":0.2457806036769097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132676662","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.077307135,0.00074061623,0.91456056,0.00077954336,0.000098566394,0.000095764146,0.0003858449,0.0040792017,0.0019528259],"genre_scores_gemma":[0.6993558,0.00047539992,0.2926737,0.0008187512,0.00012610968,0.0001777948,0.0028599668,0.0004986888,0.0030137773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991359,0.00028899618,0.000028946277,0.00031149486,0.0001643643,0.000070330694],"domain_scores_gemma":[0.9965328,0.0017405571,0.0002810883,0.0008918386,0.0004157858,0.0001378942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001153953,0.00120463,0.0012662653,0.0010720697,0.0005507035,0.0008573384,0.0031551442,0.001982001,0.0018900495],"category_scores_gemma":[0.006020291,0.0006535984,0.0009800863,0.0011279786,0.0015298876,0.002875492,0.0019308187,0.002890928,0.000937316],"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.00018665312,0.0003035452,0.0028055315,0.00024004444,0.000108447275,0.00018306945,0.00016861965,0.6462679,0.0073624128,0.013211001,0.0094534755,0.3197093],"study_design_scores_gemma":[0.0000067505307,0.000028560127,0.00010167255,0.0000060506923,0.0000044884937,0.000015621044,0.000011061133,0.9919418,0.0010532672,0.0064713294,0.00035544633,0.000003914314],"about_ca_topic_score_codex":0.004201256,"about_ca_topic_score_gemma":0.0067334063,"teacher_disagreement_score":0.004201256,"about_ca_system_score_codex":0.00088711706,"about_ca_system_score_gemma":0.0010682086,"threshold_uncertainty_score":0.008353591},"labels":[],"label_agreement":null},{"id":"W7132859330","doi":"","title":"Knowledge Translation","year":2022,"lang":"","type":"dissertation","venue":"TSpace","topic":"Advanced Graph Neural Networks","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":"Schema (genetic algorithms); Domain knowledge; Knowledge base; Knowledge acquisition; Domain (mathematical analysis); Set (abstract data type); Knowledge-based systems; Graph; Subject-matter expert","score_opus":0.06459505587284078,"score_gpt":0.38787454202951394,"score_spread":0.3232794861566731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132859330","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.0036870935,0.0028761814,0.2984284,0.0062867515,0.0047566784,0.0015054392,0.02028716,0.021281878,0.6408905],"genre_scores_gemma":[0.07812356,0.0070376336,0.37281483,0.0056932573,0.0012197176,0.0020531372,0.082262754,0.009686756,0.4411084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99565446,0.0012156327,0.0005996929,0.00093729154,0.0012485986,0.00034422727],"domain_scores_gemma":[0.99262416,0.0020521947,0.0002050914,0.002787109,0.0021076247,0.00022395318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033048072,0.0015032586,0.00095043064,0.0047418317,0.0019315493,0.008438403,0.0031737806,0.0026035393,0.18996969],"category_scores_gemma":[0.018202394,0.00086183514,0.002060846,0.004976432,0.0015057742,0.0073610367,0.008505217,0.0026739978,0.13723445],"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.00017813001,0.0001352179,0.00038610023,0.0013480581,0.00008505506,0.00061754626,0.0012408386,0.0018093057,0.0023337768,0.17403802,0.27336913,0.54445887],"study_design_scores_gemma":[0.000028463333,0.000020199102,0.00014408506,0.00028709797,0.000019422785,0.00026220563,0.00035195323,0.001709737,0.0018190632,0.046133574,0.94920063,0.00002367068],"about_ca_topic_score_codex":0.0031102572,"about_ca_topic_score_gemma":0.0022616382,"teacher_disagreement_score":0.18996969,"about_ca_system_score_codex":0.0023637153,"about_ca_system_score_gemma":0.0041648913,"threshold_uncertainty_score":0.6355119},"labels":[],"label_agreement":null},{"id":"W7133394521","doi":"","title":"Decimated Framelet System on Graphs and Fast <i>G</i>-Framelet Transforms","year":2022,"lang":"en","type":"article","venue":"CityU Scholars","topic":"Advanced Graph Neural Networks","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":"Shanghai Jiao Tong University; European Commission; City University of Hong Kong; National Science Foundation","keywords":"External Data Representation; Graph; Pattern recognition (psychology); Orthonormal basis; Voltage graph; Graph theory; Representation (politics); Artificial neural network","score_opus":0.008474589290824047,"score_gpt":0.21758256318807503,"score_spread":0.209107973897251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133394521","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.011153744,0.00012299312,0.9873979,0.000107933694,0.000037347232,0.0000127969915,0.00003602028,0.00015734181,0.0009738813],"genre_scores_gemma":[0.24115923,0.00070928916,0.7527977,0.00014182624,0.00009601908,0.000067889836,0.0003291429,0.00014308057,0.0045557655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980074,0.000046895337,0.000008519491,0.000041473533,0.00007852001,0.000023885212],"domain_scores_gemma":[0.99956316,0.00017220277,0.000053617012,0.00009047548,0.00009903968,0.000021561846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041763438,0.0004847643,0.00034856537,0.0005664317,0.0002551825,0.0006786114,0.0005953267,0.00075230905,0.0016906199],"category_scores_gemma":[0.0016293196,0.0002254172,0.00038226586,0.00074730656,0.0006102985,0.001155587,0.00053570926,0.00096885796,0.00069774216],"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.0001937534,0.000055609624,0.0009353095,0.00012003057,0.00002792933,0.00039053618,0.0003031371,0.4095856,0.077889666,0.21941128,0.005621472,0.28546572],"study_design_scores_gemma":[0.000005739517,0.000027974824,0.0001700625,0.000006082963,0.0000040367913,0.00009801323,0.000022738404,0.9711566,0.009853861,0.015487189,0.0031535418,0.000014046316],"about_ca_topic_score_codex":0.0018755811,"about_ca_topic_score_gemma":0.0015144994,"teacher_disagreement_score":0.0018755811,"about_ca_system_score_codex":0.0004911925,"about_ca_system_score_gemma":0.00040410433,"threshold_uncertainty_score":0.005655706},"labels":[],"label_agreement":null},{"id":"W7134193716","doi":"10.1109/bigdata66926.2025.11401973","title":"Enhanced ESG Data Processing Using Retrieval-Augmented AI","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Brock University","funders":"","keywords":"Data processing; Feature (linguistics); Signal processing; Data processing system; Identification (biology)","score_opus":0.051229893386244715,"score_gpt":0.35537674837825034,"score_spread":0.3041468549920056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7134193716","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.027014619,0.00076287566,0.9521068,0.0005668746,0.00050025905,0.00014184034,0.0011306077,0.009404741,0.008371465],"genre_scores_gemma":[0.34933287,0.0006729711,0.6278098,0.000614634,0.0003253521,0.00012511207,0.0037982417,0.00074553606,0.016575504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996331,0.000055818964,0.000021285725,0.00007688844,0.00015447338,0.000058480982],"domain_scores_gemma":[0.99941325,0.00014967169,0.000026317106,0.00014659799,0.00023714936,0.000026965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004403961,0.0009895802,0.0007986603,0.0014798456,0.0004060486,0.0014038333,0.0010532,0.0008221106,0.009413724],"category_scores_gemma":[0.0016552347,0.0002312543,0.00063082454,0.0019121523,0.00036571707,0.0014055369,0.0010286102,0.0010942551,0.004100607],"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.00050742517,0.00017200835,0.0010403186,0.00019004632,0.00008995535,0.00029581878,0.00009281765,0.058066223,0.07140749,0.005077347,0.015615999,0.8474446],"study_design_scores_gemma":[0.000032156597,0.00010320921,0.0013837161,0.000019483492,0.00004981542,0.0001817717,0.000105696854,0.9481278,0.032298237,0.007376663,0.010290445,0.000031001444],"about_ca_topic_score_codex":0.0067077605,"about_ca_topic_score_gemma":0.009549138,"teacher_disagreement_score":0.009413724,"about_ca_system_score_codex":0.0003409721,"about_ca_system_score_gemma":0.00068036723,"threshold_uncertainty_score":0.031492054},"labels":[],"label_agreement":null},{"id":"W7134973199","doi":"10.1109/icdmw69685.2025.00120","title":"Smooth Transitions in Graph Self-Supervision: Mitigating Feature Twist Across Abstraction Levels","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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","funders":"","keywords":"Feature (linguistics); Twist; Abstraction; Graph; Context (archaeology)","score_opus":0.016515769884600916,"score_gpt":0.2965794799860514,"score_spread":0.2800637101014505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7134973199","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.11733922,0.00026357893,0.87928766,0.0003324928,0.00003753924,0.00006463358,0.0001183907,0.0016960683,0.00086045143],"genre_scores_gemma":[0.8665375,0.00011918401,0.13080357,0.0002620677,0.00004872641,0.00009062676,0.0004281262,0.00030720068,0.001403005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904186,0.00024356034,0.000038575818,0.00035383535,0.00022501644,0.000097219054],"domain_scores_gemma":[0.99460804,0.0025281783,0.0007484692,0.0013608084,0.0004820003,0.00027244448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016679333,0.00086785736,0.0010224652,0.00077401643,0.0006607972,0.0010182749,0.0024421376,0.0013341798,0.001204373],"category_scores_gemma":[0.010312266,0.00065781537,0.0006607887,0.0006338684,0.0018046476,0.0032004078,0.0027380993,0.002986619,0.00037956325],"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.0004824007,0.00031451212,0.0092752995,0.0002513835,0.000113688104,0.0002671724,0.0007671924,0.6536933,0.026937101,0.023994619,0.005008891,0.2788944],"study_design_scores_gemma":[0.00000994284,0.000058073474,0.0006084008,0.000008945318,0.0000063198004,0.00003621403,0.000026749169,0.9858643,0.0029333492,0.0100247525,0.00041494318,0.000007919786],"about_ca_topic_score_codex":0.002652125,"about_ca_topic_score_gemma":0.005619863,"teacher_disagreement_score":0.002652125,"about_ca_system_score_codex":0.0010479195,"about_ca_system_score_gemma":0.00086081825,"threshold_uncertainty_score":0.008820951},"labels":[],"label_agreement":null},{"id":"W7135252846","doi":"","title":"Utilizing Specialized Graph Partitioning and Adaptive GNNs: A Comparative Study for Large-Scale Traffic Forecasting","year":2025,"lang":"","type":"dissertation","venue":"ResearchSpace (University of Auckland)","topic":"Advanced Graph Neural Networks","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 partition; Intelligent transportation system; Artificial neural network; Convolutional neural network; Baseline (sea); Graph theory; Deep learning","score_opus":0.1006540449161022,"score_gpt":0.32789799728863234,"score_spread":0.22724395237253014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7135252846","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.749983,0.0043975925,0.23344927,0.00076126005,0.0003147408,0.00017843554,0.0007344864,0.001826192,0.0083551025],"genre_scores_gemma":[0.96475005,0.0010587361,0.031941563,0.00008060341,0.000050769944,0.00003820803,0.0011319807,0.0001036354,0.00084446673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997389,0.000073976815,0.000015010796,0.000080350954,0.000051559502,0.00004013689],"domain_scores_gemma":[0.99897623,0.00053015363,0.000070497255,0.00014835608,0.00021773849,0.000057115256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008411418,0.001019341,0.0004974111,0.00083102396,0.00031951687,0.0006403475,0.0010858916,0.0007171934,0.00085942046],"category_scores_gemma":[0.003342586,0.00026819424,0.00050751586,0.00084806664,0.00042762942,0.0020142961,0.00050776894,0.000817436,0.00019006323],"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.00018329865,0.00009287254,0.0029484183,0.00011663666,0.00005184593,0.000056705234,0.000051235704,0.9216028,0.0011164289,0.0028782687,0.0013730235,0.06952857],"study_design_scores_gemma":[0.0000058867345,0.000035069046,0.0004616301,0.0000053588187,0.000010411311,0.000008267117,0.000021606133,0.9976277,0.0004337312,0.0010425465,0.0003443734,0.0000034168265],"about_ca_topic_score_codex":0.025304234,"about_ca_topic_score_gemma":0.019465487,"teacher_disagreement_score":0.025304234,"about_ca_system_score_codex":0.0011458119,"about_ca_system_score_gemma":0.0007390037,"threshold_uncertainty_score":0.05031389},"labels":[],"label_agreement":null},{"id":"W7136144675","doi":"10.1145/3787330.3787359","title":"Resume-Job Compatibility Scoring Using Graph Neural Networks and Large Language Models","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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 Windsor","funders":"","keywords":"ENCODE; Compatibility (geochemistry); Graph; Artificial neural network; Disk formatting","score_opus":0.027484263782413896,"score_gpt":0.29563723222559957,"score_spread":0.26815296844318565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7136144675","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.18941471,0.0008285685,0.79132986,0.0010407573,0.0002911997,0.000263291,0.002401894,0.008431687,0.0059980387],"genre_scores_gemma":[0.8794859,0.00017360541,0.11057418,0.00024478039,0.00007920427,0.0001626712,0.0035349615,0.00027306235,0.0054716733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989281,0.00036758845,0.000071154835,0.00034592897,0.00019187566,0.00009523623],"domain_scores_gemma":[0.9978947,0.0010831252,0.00023713637,0.0002484175,0.0004011441,0.00013554173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014139324,0.0013983294,0.0007268029,0.0022730173,0.0004900918,0.001480396,0.0014577564,0.0012179306,0.002899716],"category_scores_gemma":[0.0070155747,0.00027351792,0.000703846,0.0016201664,0.00045486644,0.0024632649,0.0015047208,0.0015413249,0.0013916277],"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.000708718,0.00053133606,0.027528495,0.00025651645,0.00035298237,0.0005921058,0.0002732646,0.33246368,0.0075143436,0.013084248,0.020627841,0.5960665],"study_design_scores_gemma":[0.00001338497,0.00004635223,0.0016365636,0.000010659661,0.000018863417,0.000034866585,0.000050233797,0.98300505,0.0011212347,0.013412745,0.00063101767,0.000019017274],"about_ca_topic_score_codex":0.010178676,"about_ca_topic_score_gemma":0.020518523,"teacher_disagreement_score":0.010178676,"about_ca_system_score_codex":0.000850308,"about_ca_system_score_gemma":0.00081173715,"threshold_uncertainty_score":0.020238876},"labels":[],"label_agreement":null},{"id":"W7138864149","doi":"10.1109/globecom59602.2025.11432441","title":"Graph Integrated Transformers for Community Detection in Social Networks","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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":"Transformer; Cluster analysis; Graph; Hidden Markov model; Benchmark (surveying); Clustering coefficient","score_opus":0.02099661305245954,"score_gpt":0.285468170040531,"score_spread":0.26447155698807145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7138864149","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.019245028,0.0003633751,0.97727907,0.00019210014,0.000031112806,0.00009454422,0.00021400256,0.0012888405,0.0012919769],"genre_scores_gemma":[0.7033082,0.00075928663,0.2890475,0.00029301416,0.000096826036,0.00020804137,0.0014276013,0.00036398065,0.004495575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991266,0.00023179353,0.000037858383,0.0002754775,0.0002529527,0.00007523039],"domain_scores_gemma":[0.9978357,0.0010294537,0.0002894305,0.00029866723,0.00041753182,0.0001292214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011544643,0.0011599306,0.00079315295,0.003637706,0.0007253447,0.0011834758,0.0019647465,0.0012644412,0.0020996782],"category_scores_gemma":[0.0071560843,0.0005216681,0.0011131597,0.0024690842,0.0012836069,0.0040418147,0.0017630341,0.0015256243,0.0008075793],"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.00029012107,0.00020016693,0.007443615,0.00037449927,0.00019708423,0.00028336723,0.0003375494,0.5114722,0.013130638,0.07933231,0.008028581,0.37890995],"study_design_scores_gemma":[0.0000060313773,0.000021269076,0.00035302227,0.00000863315,0.000013652119,0.00006157963,0.000026916337,0.96294296,0.0013690896,0.03429727,0.00089156267,0.000008000708],"about_ca_topic_score_codex":0.008810822,"about_ca_topic_score_gemma":0.015875744,"teacher_disagreement_score":0.008810822,"about_ca_system_score_codex":0.0017587317,"about_ca_system_score_gemma":0.0010875071,"threshold_uncertainty_score":0.017519057},"labels":[],"label_agreement":null},{"id":"W7139048563","doi":"10.1109/globecom59602.2025.11431685","title":"Early-Exit Strategies for Dynamic Graph CNNs to Accelerate Inference of Point Clouds","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Inference; Scalability; Graph; Convolutional neural network; Point (geometry); Point cloud; Virtual reality","score_opus":0.02197882508928876,"score_gpt":0.3167243111566917,"score_spread":0.2947454860674029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7139048563","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.03483075,0.00022266459,0.9571564,0.0002051386,0.00008590135,0.00006659075,0.00017961611,0.0050139925,0.0022389858],"genre_scores_gemma":[0.6487196,0.00024099335,0.34047094,0.00037269475,0.000056308432,0.00017569512,0.0014049119,0.0008570883,0.0077018137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970454,0.00003465584,0.00001568447,0.00009240817,0.00009127794,0.00006133724],"domain_scores_gemma":[0.99941504,0.00018805501,0.000048633185,0.00012307605,0.00016415422,0.00006103721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005741037,0.0012909406,0.00058992836,0.00058730226,0.00043080444,0.00081118813,0.0024877728,0.0009452267,0.005591987],"category_scores_gemma":[0.0030635872,0.0005352841,0.0005169033,0.00037956596,0.0007300295,0.0022629846,0.0017647847,0.0019338313,0.0012544045],"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.00057361857,0.00019788132,0.0030868696,0.0001859892,0.000088653134,0.00027985842,0.00020087879,0.57282466,0.02977158,0.025568629,0.00985647,0.35736495],"study_design_scores_gemma":[0.00000944201,0.000028944618,0.00012254258,0.0000067688275,0.0000058878127,0.000024552332,0.000008973494,0.9897961,0.0052971346,0.0037629374,0.0009308964,0.000005736237],"about_ca_topic_score_codex":0.008370386,"about_ca_topic_score_gemma":0.018417664,"teacher_disagreement_score":0.008370386,"about_ca_system_score_codex":0.0010427798,"about_ca_system_score_gemma":0.0011237678,"threshold_uncertainty_score":0.018707037},"labels":[],"label_agreement":null},{"id":"W7147212645","doi":"10.1109/iccsm66818.2025.00011","title":"HeuGAT: Integrating Heuristic and Graph Attention Network for Improved Link Prediction and Breakup Prediction in Social Network Structures","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Graph Neural Networks","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 Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Attention network; Breakup; Graph; Link (geometry); Social network (sociolinguistics); Heuristic; Network structure; Network science","score_opus":0.008024598306539243,"score_gpt":0.2497511939309358,"score_spread":0.24172659562439658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7147212645","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.25061023,0.0019984064,0.730352,0.0015706597,0.0002865715,0.0002262081,0.0012587946,0.008552553,0.005144613],"genre_scores_gemma":[0.90678555,0.0004046496,0.08595754,0.0005644958,0.00011456164,0.000118357595,0.001699917,0.00020727483,0.0041475534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996306,0.00008043761,0.000014550909,0.00014024823,0.00006380038,0.000070416936],"domain_scores_gemma":[0.99877995,0.00061479805,0.00014420788,0.00014946704,0.00017335189,0.00013827936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009562739,0.0012693119,0.0009831492,0.0019163607,0.0006361415,0.0012027095,0.0021447632,0.0015903481,0.0019340476],"category_scores_gemma":[0.0039787213,0.00047871002,0.00075420365,0.000981564,0.00068086054,0.0027653596,0.0014751668,0.0019097959,0.0005518242],"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.00035193868,0.0004012906,0.017341936,0.00019154011,0.00021586138,0.0002768888,0.00024224485,0.6723114,0.004477696,0.010209794,0.011443612,0.28253576],"study_design_scores_gemma":[0.0000053244594,0.000023269062,0.00035632774,0.000006411368,0.0000111096,0.000012664786,0.000010602978,0.9952512,0.00041848855,0.0035993597,0.0002995797,0.000005555846],"about_ca_topic_score_codex":0.020254776,"about_ca_topic_score_gemma":0.03813703,"teacher_disagreement_score":0.020254776,"about_ca_system_score_codex":0.00172735,"about_ca_system_score_gemma":0.0010924195,"threshold_uncertainty_score":0.040273786},"labels":[],"label_agreement":null},{"id":"W7162471993","doi":"10.65521/ijeecs.v14i2.2102","title":"A Comprehensive Review of Graph Neural Networks for Malware Classification Pipelines: Architectures, Robustness, and Intelligent Security Applications","year":2025,"lang":"","type":"article","venue":"International Journal of Electrical Electronics and Computer Systems","topic":"Advanced Graph Neural Networks","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":"Malware; Adversarial system; Convolutional neural network; Robustness (evolution); Graph; Feature learning; Deep learning; Artificial neural network","score_opus":0.014402124589512596,"score_gpt":0.2866829854489121,"score_spread":0.27228086085939945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7162471993","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.0049618394,0.89371574,0.08505005,0.001964879,0.00096729456,0.00010662134,0.00038601685,0.0006497435,0.01219785],"genre_scores_gemma":[0.036755733,0.9169766,0.036891393,0.0008358092,0.0009320334,0.00012354208,0.0009169383,0.00013816555,0.0064298557],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99971396,0.000048195183,0.000033163324,0.00007179672,0.00011020578,0.000022607615],"domain_scores_gemma":[0.99919254,0.00044921934,0.00007028641,0.00004243478,0.00022092053,0.000024550798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070020015,0.001337757,0.00079498946,0.001984178,0.00030835747,0.0011304994,0.0012414781,0.000951304,0.0029389146],"category_scores_gemma":[0.0023287528,0.0005968721,0.00081781397,0.0021314877,0.00038168632,0.0021991346,0.0005575933,0.0012421701,0.0014692498],"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.000050099803,0.000058000678,0.00086450396,0.0054845014,0.00013656111,0.000091036745,0.00006722821,0.017092442,0.0018480674,0.015787916,0.022014955,0.9365047],"study_design_scores_gemma":[0.000025876829,0.00048285763,0.0035950514,0.007014451,0.0005690501,0.0014852042,0.00015119587,0.12651727,0.008556983,0.057921786,0.79348356,0.00019683978],"about_ca_topic_score_codex":0.0033365295,"about_ca_topic_score_gemma":0.0042517777,"teacher_disagreement_score":0.0033365295,"about_ca_system_score_codex":0.0009324503,"about_ca_system_score_gemma":0.0010291429,"threshold_uncertainty_score":0.009831667},"labels":[],"label_agreement":null}]}