{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":423,"total_is_capped":false,"direct_labels_cover":2,"predictions_cover":423,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"6aa74f43c8e5","filters":{"topic":"Graph Theory and Algorithms"}},"results":[{"id":"W2291620117","doi":"10.14778/2850469.2850471","title":"K-core decomposition of large networks on a single PC","year":2015,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":214,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Decomposition; Implementation; Core (optical fiber); Metric (unit); Graph; Multi-core processor; Vertex (graph theory); Theoretical computer science; Parallel computing; Algorithm","authors":[{"name":"Wissam Khaouid","is_ca":true},{"name":"Marina Barsky","is_ca":true},{"name":"Venkatesh Srinivasan","is_ca":true},{"name":"Alex Thomo","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03872705365176489,"gpt":0.2674381582051575,"spread":0.2287111045533927,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001044933,0.0008093466,0.000688081,0.0009295138,0.001004282,0.001489421,0.001622701,0.0007513224,0.004907934],"category_scores_gemma":[0.006103801,0.0004983993,0.000692374,0.001494264,0.000873805,0.00350875,0.001758532,0.001221925,0.001373386],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001557698,"about_ca_system_score_gemma":0.001722905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006659556,"about_ca_topic_score_gemma":0.01219268,"domain_scores_codex":[0.9992757,0.0001394419,0.00004479252,0.000194746,0.0002080358,0.0001373329],"domain_scores_gemma":[0.9969958,0.00091551,0.0001971889,0.001301556,0.0004269131,0.000163088],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009009505,0.0003024004,0.005754163,0.0003796038,0.0001456611,0.0003656886,0.0007113432,0.6121204,0.01832686,0.06540336,0.01755828,0.2780312],"study_design_scores_gemma":[0.00003876512,0.00005571471,0.00058392,0.00001401064,0.00001610355,0.0000623538,0.0001594962,0.9538427,0.004528257,0.03723431,0.003454772,0.000009485914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1806637,0.0003358126,0.8000292,0.0005712329,0.0000842087,0.0001789682,0.0004402823,0.006468044,0.01122853],"genre_scores_gemma":[0.5085057,0.000204562,0.4843883,0.000176829,0.00002603422,0.0002135139,0.001068089,0.0006452482,0.004771732],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006659556,"threshold_uncertainty_score":0.0164187,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115139257","doi":"10.1109/tpami.2004.1265866","title":"An eigenspace projection clustering method for inexact graph matching","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Pattern Analysis and Machine Intelligence","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":208,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Cluster analysis; Computer science; Eigenvalues and eigenvectors; Matching (statistics); Combinatorics; Graph homomorphism; Projection method; Graph; Theoretical computer science; Algorithm; Mathematics; Line graph; Artificial intelligence; Graph power; Dykstra's projection algorithm","authors":[{"name":"Terry Caelli","is_ca":true},{"name":"Serhiy Kosinov","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02158284435524615,"gpt":0.304401850513753,"spread":0.2828190061585069,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00163636,0.0008474576,0.001374229,0.002139958,0.001091897,0.001328387,0.002250588,0.001830319,0.003479816],"category_scores_gemma":[0.004480198,0.0005774199,0.001089464,0.002229648,0.0016743,0.002503087,0.002261158,0.001988924,0.001840768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008330874,"about_ca_system_score_gemma":0.001276695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002777929,"about_ca_topic_score_gemma":0.002487994,"domain_scores_codex":[0.9981734,0.0005755369,0.00006601034,0.0004025443,0.0007028523,0.00007958486],"domain_scores_gemma":[0.9984195,0.0004766466,0.0001203493,0.0005308336,0.0003807301,0.00007192229],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001541524,0.0001325898,0.000661201,0.0002011814,0.000145726,0.0002171717,0.000334558,0.3396819,0.02459366,0.2050346,0.005248612,0.4235947],"study_design_scores_gemma":[0.000008736372,0.00002451787,0.0001684781,0.000007791023,0.000009704216,0.0001031351,0.00002770692,0.9585459,0.003640506,0.03445698,0.00297682,0.00002972717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001713594,0.00006308052,0.9973259,0.00004577482,0.00001906023,0.00002325614,0.00001538724,0.0002579185,0.000535983],"genre_scores_gemma":[0.05852735,0.0001640499,0.9383032,0.00008528726,0.00004169679,0.0001309416,0.0001764288,0.0002307359,0.002340273],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003479816,"threshold_uncertainty_score":0.01164114,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111607365","doi":"10.14778/1687627.1687727","title":"Distance-join","year":2009,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":207,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Reachability; Join (topology); Graph; Theoretical computer science; Query optimization; Shortest path problem; Data mining; Mathematics; Combinatorics","authors":[{"name":"Lei Zou","is_ca":false},{"name":"Lei Chen","is_ca":false},{"name":"M. TAMER ÖZSU","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006708040847259433,"gpt":0.2017328283834329,"spread":0.1950247875361735,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002386493,0.001283068,0.002016978,0.003012727,0.001931449,0.003174458,0.004250894,0.001579977,0.02229116],"category_scores_gemma":[0.008770889,0.000670936,0.001654,0.005367994,0.0006916338,0.005055226,0.004442924,0.001840227,0.008290081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009400303,"about_ca_system_score_gemma":0.001435233,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002195672,"about_ca_topic_score_gemma":0.003737273,"domain_scores_codex":[0.9952506,0.0006800601,0.0005134137,0.001286386,0.001969492,0.0003001595],"domain_scores_gemma":[0.9952947,0.001164407,0.0003038366,0.002207682,0.0007572607,0.0002720557],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001196244,0.0006818881,0.0036315,0.0008906203,0.0003523468,0.0002803667,0.0004701106,0.04489188,0.01064876,0.08609165,0.08818434,0.7626804],"study_design_scores_gemma":[0.0003860822,0.0007611435,0.001998132,0.0001244409,0.0002042013,0.001628282,0.0007702838,0.4901126,0.03217194,0.2459951,0.2256812,0.0001665319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01479942,0.001453367,0.9535672,0.0006500403,0.0004368774,0.0006011936,0.004519517,0.008758062,0.01521421],"genre_scores_gemma":[0.1477823,0.0008740947,0.8205541,0.0004753306,0.0003240766,0.0005161673,0.01379753,0.00144472,0.01423155],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02229116,"threshold_uncertainty_score":0.07457131,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2281494333","doi":"10.14778/2732977.2732980","title":"An experimental comparison of pregel-like graph processing systems","year":2014,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":194,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; PageRank; Graph; Global Positioning System; Theoretical computer science; Operating system","authors":[{"name":"Minyang Han","is_ca":true},{"name":"Khuzaima Daudjee","is_ca":true},{"name":"Khaled Ammar","is_ca":true},{"name":"M. TAMER ÖZSU","is_ca":true},{"name":"Xingfang Wang","is_ca":true},{"name":"Tianqi Jin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01446843168368664,"gpt":0.2619565896032245,"spread":0.2474881579195378,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002942332,0.0009901201,0.0007837994,0.001370539,0.001074618,0.001304857,0.002257702,0.001041106,0.005131413],"category_scores_gemma":[0.01514348,0.0004561732,0.0004329174,0.002255257,0.001165439,0.003750167,0.001443139,0.001396111,0.001598715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00114925,"about_ca_system_score_gemma":0.001108922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003723283,"about_ca_topic_score_gemma":0.004334174,"domain_scores_codex":[0.996111,0.000976745,0.0004185251,0.0008782812,0.001162424,0.000453091],"domain_scores_gemma":[0.9811161,0.009237604,0.0006786254,0.004518917,0.00353776,0.0009110452],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.01845503,0.01262326,0.02545566,0.005010725,0.001191484,0.0008346339,0.002395611,0.271425,0.140011,0.02430998,0.1219485,0.376339],"study_design_scores_gemma":[0.002178128,0.01621729,0.04262516,0.0001929922,0.0003899345,0.0007900703,0.003043364,0.6974812,0.1731431,0.01885989,0.04481376,0.000265045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9606584,0.0009395862,0.01328007,0.0006226831,0.0004130526,0.000385699,0.002066679,0.008253878,0.01337993],"genre_scores_gemma":[0.9405051,0.0004830335,0.04441259,0.0003096818,0.0001005641,0.0003324647,0.008400084,0.0008593379,0.004597082],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005131413,"threshold_uncertainty_score":0.01716632,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3112520120","doi":"10.1145/3434642","title":"The future is big graphs","year":2021,"lang":"en","type":"article","venue":"Communications of the ACM","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":152,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; University of Waterloo","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Computer science; Big data; Data mining","authors":[{"name":"Sherif Sakr","is_ca":false},{"name":"Angela Bonifati","is_ca":false},{"name":"Hannes Voigt","is_ca":false},{"name":"Alexandru Iosup","is_ca":false},{"name":"Khaled Ammar","is_ca":false},{"name":"Renzo Angles","is_ca":false},{"name":"Walid G. Aref","is_ca":false},{"name":"Marcelo Arenas","is_ca":false},{"name":"Maciej Besta","is_ca":false},{"name":"Peter Boncz","is_ca":false},{"name":"Khuzaima Daudjee","is_ca":true},{"name":"Emanuele Della Valle","is_ca":false},{"name":"Stefania Dumbrava","is_ca":false},{"name":"Olaf Hartig","is_ca":false},{"name":"Bernhard Haslhofer","is_ca":false},{"name":"Tim Hegeman","is_ca":false},{"name":"Jan Hidders","is_ca":false},{"name":"Katja Hose","is_ca":false},{"name":"Adriana Iamnitchi","is_ca":false},{"name":"Vasiliki Kalavri","is_ca":false},{"name":"Hugo Kapp","is_ca":false},{"name":"Wim Martens","is_ca":false},{"name":"M. TAMER ÖZSU","is_ca":true},{"name":"Eric Peukert","is_ca":false},{"name":"Stefan Plantikow","is_ca":false},{"name":"Mohamed Ragab","is_ca":false},{"name":"Matei Ripeanu","is_ca":true},{"name":"Semih Salihoğlu","is_ca":true},{"name":"Christian Schulz","is_ca":false},{"name":"Petra Selmer","is_ca":false},{"name":"Juan Sequeda","is_ca":false},{"name":"Joshua Shinavier","is_ca":false},{"name":"Gábor Szárnyas","is_ca":false},{"name":"Riccardo Tommasini","is_ca":false},{"name":"Antonino Tumeo","is_ca":false},{"name":"Alexandru Uta","is_ca":false},{"name":"Ana Lucia Vărbănescu","is_ca":false},{"name":"Hsiang‐Yun Wu","is_ca":false},{"name":"Nikolay Yakovets","is_ca":false},{"name":"Da Yan","is_ca":false},{"name":"Eiko Yoneki","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0262475119673398,"gpt":0.2651093371293197,"spread":0.2388618251619799,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007913732,0.000834813,0.001033063,0.001870344,0.002722195,0.007211911,0.002409007,0.004464176,0.01973106],"category_scores_gemma":[0.03050114,0.0007099941,0.0006796123,0.002413703,0.00713389,0.03617739,0.006397156,0.00682635,0.00735206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001939831,"about_ca_system_score_gemma":0.002939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002441772,"about_ca_topic_score_gemma":0.00370517,"domain_scores_codex":[0.9962839,0.001250317,0.00009090354,0.0005986728,0.001276772,0.0004995234],"domain_scores_gemma":[0.9704283,0.014532,0.0008014298,0.006175839,0.00427067,0.003791785],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000204819,0.0000674461,0.001257933,0.0006926771,0.00007204113,0.0001271498,0.0005978203,0.004099139,0.002156075,0.5207117,0.342995,0.1270182],"study_design_scores_gemma":[0.00001567719,0.00002506135,0.0004820013,0.0002067367,0.00001616901,0.0001092066,0.0007209374,0.005831504,0.0007910514,0.7183923,0.2733688,0.00004055414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"commentary","genre_gemma":"commentary","genre_scores_codex":[0.02314564,0.1063579,0.3078909,0.4528985,0.01714486,0.0001526129,0.002436728,0.005697962,0.08427496],"genre_scores_gemma":[0.4817185,0.08578528,0.2698524,0.08724675,0.01815892,0.0003686694,0.004503118,0.004166299,0.04820006],"genre_candidate":"commentary","genre_consensus":"commentary","teacher_disagreement_score":0.01973106,"threshold_uncertainty_score":0.06600702,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030488300","doi":"10.1007/s11263-006-6993-y","title":"Object Recognition as Many-to-Many Feature Matching","year":2006,"lang":"en","type":"article","venue":"International Journal of Computer Vision","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":145,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Pattern recognition (psychology); Artificial intelligence; Embedding; Feature vector; Mathematics; Cognitive neuroscience of visual object recognition; Matching (statistics); Computer science; Feature extraction","authors":[{"name":"M. Fatih Demirci","is_ca":false},{"name":"Ali Shokoufandeh","is_ca":false},{"name":"Yakov Keselman","is_ca":false},{"name":"Lars Bretzner","is_ca":false},{"name":"Sven Dickinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006716534434750066,"gpt":0.2619409834550265,"spread":0.2552244490202764,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000676643,0.0007759494,0.002755654,0.00166088,0.0008242343,0.002780585,0.003142431,0.00280147,0.005267194],"category_scores_gemma":[0.003010379,0.0006335875,0.001236401,0.003328495,0.001410329,0.005453905,0.002783399,0.001413517,0.002738121],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008146014,"about_ca_system_score_gemma":0.0008416477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002451412,"about_ca_topic_score_gemma":0.001987426,"domain_scores_codex":[0.9984967,0.0003103079,0.0001149302,0.0004837339,0.0004516216,0.000142739],"domain_scores_gemma":[0.9989793,0.0003787205,0.0001111439,0.0003295127,0.0001453025,0.00005612873],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003265973,0.0002513811,0.001089827,0.0004920069,0.0001804721,0.0002520114,0.0001874518,0.08429714,0.02425842,0.1261285,0.008713478,0.7538227],"study_design_scores_gemma":[0.00003427692,0.00009185287,0.0006904475,0.00002572023,0.00004553964,0.000295791,0.00007537359,0.65167,0.006035849,0.3356537,0.005339989,0.00004138712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009500426,0.001096485,0.9853425,0.0003846502,0.0001657276,0.00008206363,0.0001201778,0.001371612,0.001936382],"genre_scores_gemma":[0.4311897,0.001919503,0.5550925,0.000657304,0.000397038,0.0002511991,0.0007877473,0.0002875922,0.009417475],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005267194,"threshold_uncertainty_score":0.01762056,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2263157912","doi":"10.14778/2777598.2777604","title":"Giraph unchained","year":2015,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":145,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Asynchronous communication; Computer science; Scalability; Computation; Synchronization (alternating current); Distributed computing; Bulk synchronous parallel; Graph; Parallel computing; Model of computation; Theoretical computer science; Algorithm; Computer network; Operating system","authors":[{"name":"Minyang Han","is_ca":true},{"name":"Khuzaima Daudjee","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01784287209176177,"gpt":0.2045423580511298,"spread":0.186699485959368,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008898036,0.0009498689,0.0005114599,0.0008898854,0.0009648312,0.001621802,0.002527288,0.0008274679,0.03614961],"category_scores_gemma":[0.00371105,0.0007601601,0.000698999,0.0008320847,0.000949964,0.002846458,0.003092166,0.001449063,0.01751194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007970097,"about_ca_system_score_gemma":0.00140635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003738397,"about_ca_topic_score_gemma":0.004241342,"domain_scores_codex":[0.99888,0.0001983027,0.00005203603,0.0003854765,0.0003326828,0.0001515285],"domain_scores_gemma":[0.9975011,0.0003253622,0.00006185065,0.001562279,0.0003954964,0.0001538913],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002802666,0.0004121504,0.004937518,0.001177407,0.0002076484,0.0004404066,0.0008129368,0.03496903,0.04192726,0.1180406,0.4265827,0.3676897],"study_design_scores_gemma":[0.0005006552,0.0003870334,0.002884306,0.000134634,0.0001240639,0.0006624658,0.0002227802,0.2142584,0.06176837,0.1023443,0.6165552,0.0001577307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"software","genre_gemma":"empirical","genre_scores_codex":[0.04708662,0.0009178909,0.3444376,0.0008246782,0.0008671346,0.0004965434,0.006878052,0.4479538,0.1505377],"genre_scores_gemma":[0.4396507,0.0008581638,0.3707804,0.001507328,0.0002539694,0.0009523212,0.02697431,0.03543712,0.1235856],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03614961,"threshold_uncertainty_score":0.1209325,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2157427457","doi":"10.1145/2370816.2370866","title":"A yoke of oxen and a thousand chickens for heavy lifting graph processing","year":2012,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":134,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Locality; Computer science; Parallel computing; Memory footprint; Graph; Load balancing (electrical power); Footprint; Theoretical computer science; Mathematics; Programming language; Geography","authors":[{"name":"Abdullah Gharaibeh","is_ca":true},{"name":"Lauro Beltrão Costa","is_ca":true},{"name":"Elizeu Santos‐Neto","is_ca":true},{"name":"Matei Ripeanu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01594948625158187,"gpt":0.2518402161443657,"spread":0.2358907298927839,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003835678,0.002087692,0.001166598,0.002024544,0.003155929,0.005127872,0.002385397,0.002546293,0.05675963],"category_scores_gemma":[0.01214251,0.001299802,0.001529743,0.00141029,0.007204032,0.01767167,0.007183078,0.008058336,0.02145614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001993737,"about_ca_system_score_gemma":0.002170874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003121288,"about_ca_topic_score_gemma":0.003743298,"domain_scores_codex":[0.9977611,0.0005224515,0.0001296811,0.0005818406,0.0007632031,0.0002416633],"domain_scores_gemma":[0.9936899,0.00211814,0.0001942837,0.002185517,0.0009672173,0.0008450141],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001145023,0.0002790259,0.001291221,0.0007620925,0.0001397106,0.000484771,0.0009351048,0.003584273,0.009523676,0.4270728,0.2666222,0.28816],"study_design_scores_gemma":[0.0001633122,0.0003549735,0.0007965751,0.0006386795,0.00005656058,0.0006323087,0.0005649274,0.009433122,0.002563176,0.3148163,0.669857,0.0001230526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02344992,0.03385732,0.5794005,0.1426771,0.0328878,0.0005393114,0.001071873,0.01016213,0.175954],"genre_scores_gemma":[0.135508,0.02022344,0.5462157,0.02888831,0.01240674,0.0005884682,0.001190303,0.004981529,0.2499975],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.05675963,"threshold_uncertainty_score":0.1898798,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2113894747","doi":"10.1109/tpami.2006.207","title":"Graphical Models and Point Pattern Matching","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Pattern Analysis and Machine Intelligence","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":131,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Australian Government; National ICT Australia","keywords":"Euclidean geometry; 3-dimensional matching; Matching (statistics); Algorithm; Time complexity; Graphical model; Mathematics; Graph; Euclidean distance; Point (geometry); Mathematical optimization; Polynomial; Dimension (graph theory); Blossom algorithm; Computer science; Artificial intelligence; Combinatorics","authors":[{"name":"Tibério S. Caetano","is_ca":false},{"name":"Terry Caelli","is_ca":false},{"name":"Dale Schuurmans","is_ca":true},{"name":"Dante Augusto Couto Barone","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01418689186455034,"gpt":0.241652290326984,"spread":0.2274653984624336,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001667594,0.001482758,0.001464882,0.002872385,0.001044404,0.002639622,0.003608232,0.002989857,0.006859635],"category_scores_gemma":[0.01213226,0.001165304,0.002507418,0.004099869,0.002400815,0.00635948,0.003852411,0.002677025,0.002156335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001365043,"about_ca_system_score_gemma":0.001234991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003281541,"about_ca_topic_score_gemma":0.003047644,"domain_scores_codex":[0.9962845,0.001256346,0.0002037269,0.0009460797,0.001089826,0.0002196112],"domain_scores_gemma":[0.9954862,0.002140312,0.0006116718,0.001261335,0.0003752091,0.0001252689],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008572832,0.00006348596,0.0005808424,0.0002472606,0.00009966279,0.0002114158,0.0002400767,0.3342757,0.001874181,0.553497,0.004328483,0.1044962],"study_design_scores_gemma":[0.00001924328,0.00002406734,0.000117055,0.00003000326,0.00002347579,0.0001363834,0.00003986615,0.4195789,0.0007347261,0.5709933,0.008280628,0.0000223296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001691849,0.0001447182,0.9963325,0.0001584665,0.00001974088,0.00002857007,0.0001059756,0.0003520082,0.001166235],"genre_scores_gemma":[0.1680174,0.001012896,0.822682,0.0003476045,0.0001617441,0.0003702607,0.001567216,0.0003918224,0.005449187],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006859635,"threshold_uncertainty_score":0.02294773,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2612186437","doi":"10.1145/3035918.3056445","title":"Graphflow","year":2017,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":125,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Graph database; Join (topology); Graph; Induced subgraph isomorphism problem; Subgraph isomorphism problem; Theoretical computer science; Base (topology); Combinatorics; Mathematics; Line graph","authors":[{"name":"Chathura Kankanamge","is_ca":true},{"name":"Siddhartha Sahu","is_ca":true},{"name":"Amine Mhedbhi","is_ca":true},{"name":"Jeremy Chen","is_ca":true},{"name":"Semih Salihoğlu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01315987659189384,"gpt":0.2454575349116648,"spread":0.2322976583197709,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002884553,0.001898619,0.001076619,0.00218541,0.00105419,0.003444505,0.005682576,0.001416822,0.03290858],"category_scores_gemma":[0.008734173,0.001511691,0.001825678,0.002098137,0.001029241,0.0076066,0.004224746,0.002191438,0.01103755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002067487,"about_ca_system_score_gemma":0.002473584,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00878629,"about_ca_topic_score_gemma":0.00893779,"domain_scores_codex":[0.9976817,0.0002816035,0.0002168105,0.000696386,0.0009065296,0.0002169263],"domain_scores_gemma":[0.9962579,0.001158477,0.0001925872,0.001480977,0.0006927307,0.000217331],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001655674,0.0004278068,0.005319701,0.001476642,0.0002579215,0.000365577,0.0006340359,0.01970853,0.01079292,0.1825654,0.497762,0.2790339],"study_design_scores_gemma":[0.0003722495,0.0002273618,0.001699906,0.0002417582,0.0001047188,0.0005337134,0.0001538285,0.1149069,0.02333533,0.1767937,0.6814816,0.0001489249],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.01132062,0.001414555,0.476386,0.00180806,0.000608367,0.001187181,0.05902361,0.3840145,0.06423719],"genre_scores_gemma":[0.1619542,0.002461372,0.5034648,0.003601176,0.0002670735,0.002428448,0.2335268,0.05170367,0.04059253],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.03290858,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2765269579","doi":"10.1145/3125644","title":"Communication Steps for Parallel Query Processing","year":2017,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":106,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Alberta Innovates - Technology Futures; Wisconsin Alumni Research Foundation; National Science Foundation","keywords":"Computer science; Skew; Joins; Upper and lower bounds; Parallel computing; Matching (statistics); Binary logarithm; Communication complexity; Simple (philosophy); Graph; Algorithm; Theoretical computer science; Combinatorics; Mathematics","authors":[{"name":"Paul Beame","is_ca":false},{"name":"Paraschos Koutris","is_ca":false},{"name":"Dan Suciu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03760960977898024,"gpt":0.3058304111590551,"spread":0.2682208013800749,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003970946,0.001363899,0.001381751,0.0009434355,0.002432597,0.003272889,0.00300795,0.001602061,0.007194223],"category_scores_gemma":[0.01783284,0.0009085615,0.001470283,0.002670432,0.001979321,0.008635825,0.003964625,0.003019598,0.001801415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002015316,"about_ca_system_score_gemma":0.002238621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00342472,"about_ca_topic_score_gemma":0.003134675,"domain_scores_codex":[0.9948691,0.001214203,0.0003459483,0.001044318,0.00180995,0.0007164894],"domain_scores_gemma":[0.9880492,0.007940753,0.0006061398,0.002041994,0.001032667,0.0003292821],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001455495,0.00055772,0.002395129,0.0007964535,0.0001942546,0.0003951969,0.001170417,0.4906895,0.01572586,0.2880273,0.01648192,0.1821108],"study_design_scores_gemma":[0.00009140948,0.000108259,0.0001842722,0.00001629071,0.00003735415,0.00009255246,0.0001664736,0.8066121,0.005283442,0.1826584,0.004727656,0.00002175203],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07550786,0.0009315846,0.9056692,0.00248205,0.0001720119,0.0003861458,0.00030698,0.002016405,0.01252782],"genre_scores_gemma":[0.4846696,0.0006254312,0.5028993,0.0007303961,0.0002463975,0.0008380392,0.0007648863,0.0006209838,0.008604835],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007194223,"threshold_uncertainty_score":0.02406704,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2042145470","doi":"10.1109/tsmca.2011.2159587","title":"Efficient Role Transfer Based on Kuhn–Munkres Algorithm","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics - Part A Systems and Humans","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nipissing University","funders":"","keywords":"Computer science; Algorithm; Mathematical optimization; Transfer (computing); Efficient algorithm; Mathematics; Parallel computing","authors":[{"name":"Haibin Zhu","is_ca":true},{"name":"MengChu Zhou","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02043576821450047,"gpt":0.2062182806217014,"spread":0.1857825124072009,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014126,0.0008237138,0.001733077,0.00114386,0.00132697,0.001429291,0.002445883,0.001620365,0.006791893],"category_scores_gemma":[0.003295647,0.0003945653,0.0008212336,0.001519366,0.001100149,0.004157924,0.00237725,0.001404631,0.001817687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008914193,"about_ca_system_score_gemma":0.002058753,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001740087,"about_ca_topic_score_gemma":0.001506939,"domain_scores_codex":[0.9985325,0.0005039907,0.00007315054,0.0002849819,0.0003338808,0.0002713668],"domain_scores_gemma":[0.9989468,0.0004242846,0.0001023998,0.0002681915,0.0001738312,0.00008440808],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004398791,0.0005063996,0.0006997091,0.0002537431,0.00006653804,0.0001831243,0.0004135812,0.3789392,0.007220542,0.1539751,0.009235123,0.448067],"study_design_scores_gemma":[0.00008801877,0.0001264204,0.0001502747,0.00001611993,0.00001946095,0.0001554816,0.0001555638,0.91847,0.004512885,0.07138469,0.004892234,0.00002887534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02280447,0.0002175374,0.9704775,0.0001901556,0.00003783368,0.0001239866,0.0000373225,0.0008618414,0.005249319],"genre_scores_gemma":[0.3508953,0.0002431461,0.6401044,0.000104708,0.00003340899,0.000321165,0.0001906489,0.000174289,0.007932928],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006791893,"threshold_uncertainty_score":0.02272111,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2928052000","doi":"10.1145/3302424.3303974","title":"GraphBolt","year":2019,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Leverage (statistics); Computation; Graph; Graph algorithms; Snapshot (computer storage); Reuse; Theoretical computer science; Parallel computing; Algorithm; Artificial intelligence","authors":[{"name":"Mugilan Mariappan","is_ca":true},{"name":"Keval Vora","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.002605424059160833,"gpt":0.1735272172267888,"spread":0.170921793167628,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001030767,0.001725391,0.001026832,0.001631386,0.001006367,0.003595114,0.003658805,0.001808156,0.148165],"category_scores_gemma":[0.005950403,0.00124003,0.001629813,0.001791063,0.0008448255,0.004807245,0.003554601,0.003224347,0.1061867],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001256738,"about_ca_system_score_gemma":0.001758681,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003688389,"about_ca_topic_score_gemma":0.005277497,"domain_scores_codex":[0.9987392,0.0001974908,0.00009482582,0.000347283,0.0004860815,0.0001351629],"domain_scores_gemma":[0.9980893,0.0004538456,0.00009089516,0.0007865251,0.0004323387,0.0001471303],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004449517,0.0001345305,0.0006858939,0.0009574628,0.0001328017,0.000282982,0.0001844733,0.005258332,0.006099834,0.07285897,0.7323582,0.1806016],"study_design_scores_gemma":[0.0002119195,0.00006497522,0.0003358457,0.0001272381,0.00003892467,0.0003920941,0.00007481298,0.02862994,0.008944746,0.09770822,0.8634046,0.00006667649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"software","genre_gemma":"methods","genre_scores_codex":[0.002637119,0.001546783,0.3815649,0.002092011,0.0009964313,0.0004654412,0.03116314,0.4647137,0.1148204],"genre_scores_gemma":[0.07660173,0.00294546,0.4469368,0.003645732,0.0004486117,0.001735515,0.1460237,0.1605327,0.1611297],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.148165,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3014850249","doi":"10.1145/3342195.3387548","title":"Peregrine","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":93,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Graph; Theoretical computer science; Computation; Algorithm","authors":[{"name":"Kasra Jamshidi","is_ca":true},{"name":"Rakesh Mahadasa","is_ca":true},{"name":"Keval Vora","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0300596120281239,"gpt":0.2471642315886921,"spread":0.2171046195605682,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006535377,0.001278565,0.001038757,0.001777131,0.001515487,0.003980965,0.001677931,0.002326123,0.3953781],"category_scores_gemma":[0.0032458,0.0004345232,0.000649156,0.001187165,0.0008899299,0.003087692,0.002539508,0.002053165,0.2738654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001327363,"about_ca_system_score_gemma":0.001099312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001226129,"about_ca_topic_score_gemma":0.001292603,"domain_scores_codex":[0.9987199,0.0001640573,0.00006529532,0.0005668113,0.0003504529,0.0001335056],"domain_scores_gemma":[0.9985821,0.0003848466,0.0001501985,0.0002628433,0.0003507762,0.0002691393],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004918769,0.0001367595,0.001289011,0.001010967,0.00004061,0.001039985,0.0004933457,0.001403458,0.003539005,0.05419915,0.514095,0.4222609],"study_design_scores_gemma":[0.00001764093,0.00003692239,0.0003828538,0.0001309856,0.00001285261,0.0007094853,0.00007226819,0.0007332131,0.00165821,0.007593143,0.9886336,0.00001865484],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.01117783,0.02221677,0.03335076,0.0220986,0.01592834,0.00023907,0.006771306,0.01221912,0.8759981],"genre_scores_gemma":[0.07561874,0.0118429,0.0123347,0.005114868,0.003195853,0.0002211378,0.004104393,0.002791387,0.8847761],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.6046219,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2165971212","doi":"10.1145/1835804.1835873","title":"Neighbor query friendly compression of social networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Social network (sociolinguistics); Theoretical computer science; Benchmark (surveying); Data mining; Sublinear function; Data compression; k-nearest neighbors algorithm; Compression (physics); Algorithm; Social media; Artificial intelligence; World Wide Web; Mathematics; Discrete mathematics","authors":[{"name":"Hossein Maserrat","is_ca":true},{"name":"Jian Pei","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004371475453233396,"gpt":0.2207293016155749,"spread":0.2163578261623415,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007839297,0.0006868908,0.0008851004,0.001700179,0.0006899672,0.001315907,0.001418527,0.0007005589,0.002205898],"category_scores_gemma":[0.01029125,0.0003037969,0.0005104454,0.00292289,0.0008800165,0.005118994,0.001860562,0.001030617,0.0009892475],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009583425,"about_ca_system_score_gemma":0.0009555821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001778827,"about_ca_topic_score_gemma":0.002238595,"domain_scores_codex":[0.9987265,0.0002757485,0.0001191786,0.0002408429,0.0005238554,0.0001138372],"domain_scores_gemma":[0.9944504,0.001780936,0.0005075255,0.002461505,0.0006577326,0.0001419327],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001111441,0.0003351942,0.009551226,0.000713153,0.0001568368,0.000654117,0.001944448,0.1651927,0.04786123,0.1140675,0.0296659,0.6287462],"study_design_scores_gemma":[0.00009662106,0.000280528,0.00254653,0.00007746651,0.00007284492,0.0008977454,0.0009556459,0.7982685,0.0470785,0.1295214,0.0201415,0.00006269589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2449386,0.002628683,0.7296799,0.003302114,0.0002588956,0.0004666625,0.004826611,0.004977799,0.008920666],"genre_scores_gemma":[0.7630053,0.001373714,0.2241555,0.0004625519,0.0002532181,0.0003885706,0.005484811,0.0002651348,0.004611304],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002205898,"threshold_uncertainty_score":0.007379472,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2755658662","doi":"10.1007/s00778-019-00548-x","title":"The ubiquity of large graphs and surprising challenges of graph processing: extended survey","year":2019,"lang":"en","type":"article","venue":"The VLDB Journal","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Suite; Graph; Scalability; Graph drawing; Visualization; Call graph; Data visualization","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.02115508178165599,"gpt":0.263779211117652,"spread":0.242624129335996,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003521405,0.0008484069,0.001525213,0.003811397,0.001094366,0.004307706,0.002686842,0.002150926,0.003870468],"category_scores_gemma":[0.0199426,0.001033507,0.0007591307,0.007085608,0.003670955,0.01496999,0.002497525,0.002925726,0.00127783],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001587449,"about_ca_system_score_gemma":0.001459882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002360604,"about_ca_topic_score_gemma":0.002826448,"domain_scores_codex":[0.9978035,0.0005830643,0.0001008938,0.0007293304,0.0006286118,0.0001545708],"domain_scores_gemma":[0.9681472,0.02594262,0.001152995,0.002463004,0.001640864,0.0006534325],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000164054,0.0001794589,0.01260582,0.004672566,0.0001931829,0.000267284,0.0004383849,0.01874274,0.001927419,0.2863099,0.04613047,0.6283687],"study_design_scores_gemma":[0.00002156128,0.0000994178,0.006019396,0.0008891069,0.00009043835,0.001478394,0.0007428388,0.04954101,0.001610467,0.7115039,0.2279352,0.00006834722],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.05113453,0.5899597,0.2586038,0.05807485,0.001236712,0.0001152062,0.001843052,0.00136651,0.03766572],"genre_scores_gemma":[0.3021656,0.5546473,0.1201978,0.008320748,0.006998458,0.0001373027,0.00286681,0.0005662181,0.004099707],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.004307706,"threshold_uncertainty_score":0.01862317,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W135963718","doi":"10.1007/978-3-642-38868-2_32","title":"Diffeomorphic Spectral Matching of Cortical Surfaces","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Villum Fonden","keywords":"Computer science; Polygon mesh; Diffeomorphism; Atlas (anatomy); Vertex (graph theory); Algorithm; Graph; Theoretical computer science; Computer graphics (images); Mathematics; Pure mathematics","authors":[{"name":"Hervé Lombaert","is_ca":true},{"name":"Jon Sporring","is_ca":true},{"name":"Kaleem Siddiqi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009230270406521118,"gpt":0.2256139649436615,"spread":0.2163836945371403,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002200237,0.0003036593,0.0004148643,0.001822786,0.0006677948,0.001425788,0.0006953256,0.000878039,0.004512611],"category_scores_gemma":[0.002149862,0.0003309964,0.0002975883,0.0006846374,0.000777536,0.001106728,0.001322314,0.0005147289,0.0009115934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005587544,"about_ca_system_score_gemma":0.0003185148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008588646,"about_ca_topic_score_gemma":0.000788699,"domain_scores_codex":[0.9997545,0.00003891093,0.000009926702,0.00005961084,0.00008881083,0.00004835233],"domain_scores_gemma":[0.9996167,0.00007372059,0.00006728461,0.00007997733,0.00008418177,0.00007801655],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000202156,0.00009444143,0.00252086,0.0001147101,0.00003995948,0.0006115793,0.0005333034,0.01751039,0.05078766,0.8385014,0.002428894,0.08665458],"study_design_scores_gemma":[0.00003304676,0.00006931752,0.004155551,0.00002860128,0.0000221581,0.001195834,0.0006515853,0.1064549,0.01151937,0.8687935,0.007047401,0.00002878873],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.8260836,0.0003284575,0.1379476,0.0003412632,0.000108615,0.00005136743,0.0001183147,0.0004714782,0.03454919],"genre_scores_gemma":[0.9820796,0.0001320618,0.01124924,0.00003975414,0.00003080628,0.00001786314,0.00009478945,0.0001033181,0.00625251],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.004512611,"threshold_uncertainty_score":0.01509619,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3116457585","doi":"10.14778/3184470.3184473","title":"Distributed evaluation of subgraph queries using worst-case optimal low-memory dataflows","year":2018,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Dataflow; Computer science; Computation; Memory footprint; Joins; Massively parallel; Graph; Parallel computing; Theoretical computer science; Distributed computing; Algorithm","authors":[{"name":"Khaled Ammar","is_ca":true},{"name":"Frank McSherry","is_ca":false},{"name":"Semih Salihoğlu","is_ca":true},{"name":"Manas Joglekar","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03065908720145722,"gpt":0.2718627820000141,"spread":0.2412036947985569,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005171113,0.001067744,0.001618126,0.0009742317,0.001255654,0.002769422,0.003058501,0.00138872,0.001591856],"category_scores_gemma":[0.0213129,0.0006748031,0.0008730162,0.001336514,0.002922413,0.005713324,0.002883933,0.001259487,0.0003052631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002627685,"about_ca_system_score_gemma":0.002678831,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003751612,"about_ca_topic_score_gemma":0.0044871,"domain_scores_codex":[0.9945194,0.00146294,0.000326015,0.001485547,0.00137901,0.0008270432],"domain_scores_gemma":[0.9841303,0.009797818,0.001165257,0.003268433,0.001074188,0.0005639633],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001329644,0.0002738374,0.00489978,0.0001403365,0.000114581,0.0001818328,0.0003167517,0.8722506,0.01727868,0.02375092,0.002478688,0.07698438],"study_design_scores_gemma":[0.0000326567,0.00005097751,0.000162164,0.000003465221,0.00001261187,0.00002336297,0.00004155096,0.9792029,0.004240832,0.01601687,0.0002064398,0.000006135807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2922277,0.0004790895,0.6986961,0.00107019,0.00008152809,0.0001807922,0.0002302233,0.00357495,0.003459425],"genre_scores_gemma":[0.8840423,0.000066141,0.1147208,0.0001132869,0.00004586818,0.00009535775,0.0001881284,0.0001899793,0.000538242],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005171113,"threshold_uncertainty_score":0.02734774,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100910553","doi":"10.1109/icdar.1995.599026","title":"Mathematics recognition using graph rewriting","year":2002,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Rewriting; Computer science; Graph; Graph rewriting; Graph theory; Theoretical computer science; Programming language; Mathematics; Combinatorics","authors":[{"name":"A. Grbavec","is_ca":true},{"name":"Dorothea Blostein","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07381043941321488,"gpt":0.2375514692543326,"spread":0.1637410298411177,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001278027,0.0007362917,0.0009385604,0.001850833,0.001296538,0.00334472,0.001612513,0.001090943,0.006340528],"category_scores_gemma":[0.005622865,0.000481059,0.002379682,0.001379007,0.003606157,0.005349443,0.002436438,0.001698121,0.002759772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001393921,"about_ca_system_score_gemma":0.001088635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002912187,"about_ca_topic_score_gemma":0.002494283,"domain_scores_codex":[0.9977397,0.0006919267,0.000197107,0.0006862535,0.00053959,0.0001453883],"domain_scores_gemma":[0.9967547,0.001513219,0.000242622,0.001008547,0.0003632185,0.0001176669],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003351975,0.00003846868,0.000361277,0.0002093984,0.00004140112,0.0003063473,0.0008042053,0.01897308,0.008644056,0.8583841,0.003997889,0.1082062],"study_design_scores_gemma":[0.00001912093,0.00004160435,0.0001921516,0.00005555535,0.00003693239,0.0004358099,0.0001440269,0.08483624,0.009682467,0.8531029,0.05139637,0.00005692397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004079414,0.0002530728,0.9846162,0.000386263,0.00009699261,0.00006311351,0.00006936002,0.001279057,0.009156519],"genre_scores_gemma":[0.1244365,0.0009121106,0.8627204,0.0003543244,0.0001416994,0.000166326,0.0006215266,0.0009041062,0.009742963],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006340528,"threshold_uncertainty_score":0.02121121,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169658931","doi":"10.1177/1094342005051196","title":"CGMGRAPH/CGMLIB: Implementing and Testing CGM Graph Algorithms on PC Clusters and Shared Memory Machines","year":2005,"lang":"en","type":"article","venue":"The International Journal of High Performance Computing Applications","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parallel computing; Scalability; Gigabit Ethernet; Speedup; Graph; Algorithm; Ethernet; Theoretical computer science; Operating system","authors":[{"name":"Albert P.C. Chan","is_ca":false},{"name":"Frank Dehne","is_ca":false},{"name":"Ryan Taylor","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01468599920268331,"gpt":0.2610724801576682,"spread":0.2463864809549849,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002705769,0.002103402,0.0008897395,0.001533267,0.001054839,0.001060248,0.005214197,0.001408675,0.006173452],"category_scores_gemma":[0.008839506,0.0009640321,0.0008572479,0.002459876,0.001323965,0.00275611,0.001864755,0.001654875,0.001906409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001664301,"about_ca_system_score_gemma":0.002524101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02139413,"about_ca_topic_score_gemma":0.01266001,"domain_scores_codex":[0.9968628,0.0008264703,0.0001463743,0.0004773238,0.001281263,0.0004058092],"domain_scores_gemma":[0.9937263,0.003062572,0.0002709799,0.001680239,0.0009580758,0.0003019104],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.002876084,0.002308366,0.01111911,0.001754918,0.0003945805,0.0004726444,0.0009342986,0.3615296,0.02350968,0.01861121,0.07433199,0.5021574],"study_design_scores_gemma":[0.0006321999,0.0007124921,0.003454336,0.00006490449,0.00008139022,0.0001348844,0.0002172137,0.9089527,0.05968039,0.005725567,0.02027011,0.00007382526],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3047507,0.0008764974,0.4644034,0.0005158294,0.0002851547,0.0008633564,0.003454992,0.1981466,0.02670351],"genre_scores_gemma":[0.4576504,0.0004242929,0.5204799,0.0002604661,0.00005162674,0.0006124893,0.006709071,0.009038732,0.004772904],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02139413,"threshold_uncertainty_score":0.04253924,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149071703","doi":"10.1145/2600212.2600233","title":"Computation and communication efficient graph processing with distributed immutable view","year":2014,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"Program for New Century Excellent Talents in University; Ministry of Education, Science and Technology; Foundation for the Author of National Excellent Doctoral Dissertation of the People's Republic of China; Ministry of Education of the People's Republic of China; Shanghai Science and Technology Development Foundation","keywords":"Computer science; Computation; Vertex (graph theory); Parallel computing; Multi-core processor; Theoretical computer science; Graph partition; Graph; Cyclops; Algorithm","authors":[{"name":"Rong Chen","is_ca":false},{"name":"Xin Ding","is_ca":false},{"name":"Peng Wang","is_ca":false},{"name":"Haibo Chen","is_ca":false},{"name":"Binyu Zang","is_ca":false},{"name":"Haibing Guan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006113506646535271,"gpt":0.2129358644929133,"spread":0.206822357846378,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005802297,0.0009652835,0.0006961742,0.0009708811,0.0008565309,0.001650321,0.002617144,0.0006192308,0.003725873],"category_scores_gemma":[0.002255066,0.0005834536,0.001216437,0.001494251,0.0009750949,0.002466808,0.002149484,0.001533488,0.001157978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001408125,"about_ca_system_score_gemma":0.002716674,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009446078,"about_ca_topic_score_gemma":0.01590332,"domain_scores_codex":[0.9991007,0.0001405825,0.00005011958,0.0002438492,0.0003378586,0.0001268601],"domain_scores_gemma":[0.9986007,0.0003397054,0.00008709964,0.0005958468,0.000278847,0.00009780612],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001073183,0.00034746,0.004343107,0.001028565,0.000344109,0.0005922371,0.0007768453,0.3738153,0.07528861,0.1293384,0.07341821,0.339634],"study_design_scores_gemma":[0.0001956788,0.0001022125,0.0006710751,0.00002479393,0.00005159211,0.0001217625,0.00008555916,0.8924076,0.02715823,0.05636804,0.02276726,0.00004630756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02330102,0.0002964372,0.9392675,0.0002926268,0.000123957,0.0001357283,0.0007506091,0.02929148,0.006540589],"genre_scores_gemma":[0.2371691,0.0003221679,0.7521141,0.0002472883,0.00006498993,0.0003574511,0.003274759,0.001921124,0.004528931],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009446078,"threshold_uncertainty_score":0.0187822,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2948167003","doi":"10.1109/icde48307.2020.00112","title":"GSI: GPU-friendly Subgraph Isomorphism","year":2020,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Subgraph isomorphism problem; Induced subgraph isomorphism problem; Bottleneck; Graph isomorphism; Scalability; Scaling; Isomorphism (crystallography)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01416292185798231,"gpt":0.204642834684563,"spread":0.1904799128265807,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003322857,0.0009860623,0.000805436,0.001122208,0.0009053481,0.00105229,0.001804362,0.0007894739,0.005085784],"category_scores_gemma":[0.001554981,0.0003863127,0.0009187278,0.002331951,0.0006119477,0.001950265,0.002250277,0.001334807,0.001493785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009452776,"about_ca_system_score_gemma":0.00184867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006701968,"about_ca_topic_score_gemma":0.01270671,"domain_scores_codex":[0.9994892,0.00007564842,0.0000230496,0.0001470481,0.0001724086,0.00009269274],"domain_scores_gemma":[0.9994544,0.0001129102,0.0000387244,0.0002356261,0.00009822828,0.00006012751],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004247924,0.000469343,0.004726264,0.000409777,0.0001945757,0.0003715623,0.0004472064,0.1750948,0.04607685,0.0719249,0.07175436,0.6281056],"study_design_scores_gemma":[0.00009835282,0.0001362618,0.000863026,0.00001481532,0.00003108318,0.0002097341,0.000154373,0.9080333,0.01880925,0.04778779,0.02383143,0.00003059859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04544698,0.0004804722,0.9245686,0.0005215305,0.0001904852,0.0002625346,0.001028849,0.01621537,0.01128523],"genre_scores_gemma":[0.2424134,0.0003211332,0.7430702,0.000293168,0.00006740246,0.0002903765,0.005365126,0.001043384,0.007135803],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006701968,"threshold_uncertainty_score":0.01701367,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156519507","doi":"10.1109/ipdps.2013.37","title":"On Graphs, GPUs, and Blind Dating: A Workload to Processor Matchmaking Quest","year":2013,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Nvidia","keywords":"Computer science; Workload; Graph partition; Partition (number theory); Parallel computing; Implementation; Distributed computing; Graph; Supercomputer; Theoretical computer science; Operating system","authors":[{"name":"Abdullah Gharaibeh","is_ca":true},{"name":"Lauro Beltrão Costa","is_ca":true},{"name":"Elizeu Santos‐Neto","is_ca":true},{"name":"Matei Ripeanu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01157660791846328,"gpt":0.2409685471372236,"spread":0.2293919392187604,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00171394,0.001028627,0.001108065,0.0008972355,0.00133043,0.003374901,0.002333032,0.001499907,0.006003309],"category_scores_gemma":[0.01122908,0.0006182024,0.0005335115,0.002412818,0.001473779,0.007308342,0.002715878,0.002103129,0.001380029],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001330526,"about_ca_system_score_gemma":0.001351874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005181109,"about_ca_topic_score_gemma":0.008663924,"domain_scores_codex":[0.9982003,0.0006635178,0.00006456726,0.000299844,0.000463836,0.000307839],"domain_scores_gemma":[0.9959973,0.001917827,0.0001593722,0.001009169,0.0005655211,0.0003507913],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001545536,0.0005135743,0.008905105,0.0005761021,0.0001854115,0.000500299,0.0009588922,0.2834098,0.02143461,0.1815027,0.05784458,0.4426235],"study_design_scores_gemma":[0.0001150678,0.000242123,0.002741738,0.00008294794,0.00006922871,0.0003745475,0.0007117998,0.72009,0.01279706,0.2297942,0.03292033,0.00006091865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4417517,0.01435,0.4709498,0.01907851,0.002035975,0.0002269843,0.0006522349,0.006012244,0.04494251],"genre_scores_gemma":[0.8205824,0.004233529,0.1611777,0.001542105,0.0006772755,0.0001385931,0.0006386637,0.001183154,0.009826471],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006003309,"threshold_uncertainty_score":0.02008313,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111157038","doi":"10.1109/icpr.2002.1047427","title":"A new algorithm for inexact graph matching","year":2003,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Subgraph isomorphism problem; Matching (statistics); Factor-critical graph; Blossom algorithm; Algorithm; Graph isomorphism; 3-dimensional matching; Computer science; Graph; Distance-hereditary graph; Optimal matching; Mathematics; Line graph; Theoretical computer science; Voltage graph","authors":[{"name":"Adel Hlaoui","is_ca":true},{"name":"Shengrui Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01168720470694194,"gpt":0.2364212628795303,"spread":0.2247340581725883,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001406707,0.001465732,0.001597789,0.004152659,0.002018849,0.002576595,0.003695745,0.002718692,0.009264743],"category_scores_gemma":[0.007637127,0.0008713233,0.001391286,0.004482189,0.001314751,0.007059539,0.004259456,0.00294858,0.004777197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001126756,"about_ca_system_score_gemma":0.002482488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003595387,"about_ca_topic_score_gemma":0.003140036,"domain_scores_codex":[0.9970511,0.0004286106,0.000250353,0.0008663842,0.00120548,0.0001981205],"domain_scores_gemma":[0.9961915,0.0009455508,0.0003212483,0.001151343,0.001195804,0.0001946167],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002889718,0.0001877929,0.0007402068,0.0002285458,0.0001162658,0.0002365184,0.00018412,0.07003593,0.01129651,0.06966282,0.01905026,0.8279721],"study_design_scores_gemma":[0.0001198038,0.0001594886,0.0004085517,0.00004874329,0.00006314339,0.0009282539,0.0001344088,0.8140966,0.01569497,0.1196538,0.04861249,0.00007988758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001453592,0.00009962723,0.995732,0.0001140237,0.00008775009,0.0000741747,0.00007769231,0.001300565,0.001060527],"genre_scores_gemma":[0.01976218,0.0001526604,0.9759179,0.0001167321,0.00005881152,0.0001703916,0.0005065624,0.0002986169,0.003016168],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009264743,"threshold_uncertainty_score":0.03099364,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4213139879","doi":"10.1016/j.patcog.2022.108588","title":"Robust image matching via local graph structure consensus","year":2022,"lang":"en","type":"article","venue":"Pattern Recognition","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Correctness; Computer science; Robustness (evolution); Graph; Linear programming; Matching (statistics); Artificial intelligence; Mathematical optimization; Feature vector; Theoretical computer science; Mathematics; Algorithm; Pattern recognition (psychology)","authors":[{"name":"Xingyu Jiang","is_ca":false},{"name":"Yifan Xia","is_ca":false},{"name":"Xiao–Ping Zhang","is_ca":true},{"name":"Jiayi Ma","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01826922808410359,"gpt":0.2101530500746149,"spread":0.1918838219905113,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001184174,0.0008591744,0.001566807,0.00213943,0.0006123112,0.001192824,0.002434986,0.001982767,0.002256783],"category_scores_gemma":[0.006337816,0.0006893835,0.00110728,0.00167674,0.001149649,0.002296576,0.002667617,0.001415549,0.001118158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007852756,"about_ca_system_score_gemma":0.0009721011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002279662,"about_ca_topic_score_gemma":0.002095342,"domain_scores_codex":[0.9982496,0.0003546998,0.00007517044,0.0006069098,0.0005722193,0.0001412418],"domain_scores_gemma":[0.9975098,0.000880355,0.0003388809,0.0007146817,0.0004463963,0.0001097728],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005086786,0.0002069791,0.0009360554,0.0002094592,0.0002539395,0.0002864033,0.0001815175,0.4834219,0.05983468,0.03666023,0.005181203,0.412319],"study_design_scores_gemma":[0.00001742996,0.00004183029,0.0001626332,0.000004012903,0.00001672885,0.00005066353,0.00001649886,0.9742983,0.007605722,0.01725468,0.0005187569,0.00001280693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009429111,0.00007239809,0.9887969,0.0001035225,0.00003222809,0.00003057053,0.00002977117,0.0006052394,0.0009002912],"genre_scores_gemma":[0.5690651,0.0001831416,0.4242623,0.0002669014,0.00007738065,0.0001665419,0.0003365729,0.0003664311,0.005275549],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002434986,"threshold_uncertainty_score":0.007549703,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012399061","doi":"10.1007/s00500-013-1065-z","title":"A Granular Computing approach to the design of optimized graph classification systems","year":2013,"lang":"en","type":"article","venue":"Soft Computing","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Benchmarking; Theoretical computer science; Embedding; Graph; Granular computing; Graph rewriting; ENCODE; Graph embedding; Data mining; Artificial intelligence; Rough set","authors":[{"name":"Filippo Maria Bianchi","is_ca":false},{"name":"Lorenzo Livi","is_ca":false},{"name":"Antonello Rizzi","is_ca":false},{"name":"Alireza Sadeghian","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03306315459036092,"gpt":0.2313781869481714,"spread":0.1983150323578105,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001774266,0.0006708404,0.00176537,0.001416051,0.0009244344,0.002680418,0.002176347,0.001294619,0.003043927],"category_scores_gemma":[0.007771942,0.0008594937,0.0008559508,0.00166877,0.001014524,0.002483585,0.002182982,0.001766686,0.0005222527],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001331752,"about_ca_system_score_gemma":0.001617051,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003147589,"about_ca_topic_score_gemma":0.004065341,"domain_scores_codex":[0.9988087,0.0003226091,0.00009931229,0.0002075733,0.0003929964,0.0001687419],"domain_scores_gemma":[0.9978341,0.0009095868,0.0002250872,0.000365878,0.0005166887,0.0001486081],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001657331,0.0001022003,0.000669062,0.0001258956,0.00005588812,0.00006204213,0.00008585631,0.8208985,0.004036933,0.06425792,0.002331792,0.1072081],"study_design_scores_gemma":[0.000006049991,0.00001916028,0.0000535032,0.000006882095,0.000005628848,0.000006585134,0.000007945309,0.9791693,0.0004035373,0.02003679,0.0002802365,0.000004410901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01339524,0.0001536955,0.9841624,0.0002513652,0.00004254209,0.00007602174,0.00005572621,0.0003551707,0.00150772],"genre_scores_gemma":[0.5452198,0.0002590212,0.4509473,0.0002435542,0.00009161826,0.0003393231,0.0002853139,0.0002363004,0.002377677],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003147589,"threshold_uncertainty_score":0.01018292,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963904000","doi":"10.1109/icde.2019.00100","title":"Time Constrained Continuous Subgraph Search Over Streaming Graphs","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Subgraph isomorphism problem; Induced subgraph isomorphism problem; Popularity; Streaming data; Graph; Concurrency; Theoretical computer science; Distributed computing; Data mining","authors":[{"name":"Youhuan Li","is_ca":false},{"name":"Lei Zou","is_ca":false},{"name":"M. TAMER ÖZSU","is_ca":true},{"name":"Dongyan Zhao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01140150432744632,"gpt":0.2401157780501023,"spread":0.2287142737226559,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001091906,0.0006430629,0.0009437096,0.001028233,0.0005583136,0.0009339151,0.001227575,0.000859744,0.002093161],"category_scores_gemma":[0.007793874,0.0004184824,0.0006741918,0.002058594,0.0008402894,0.002583186,0.001145252,0.0008227998,0.0002209834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001060413,"about_ca_system_score_gemma":0.001545529,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009177228,"about_ca_topic_score_gemma":0.01055371,"domain_scores_codex":[0.999022,0.0003563571,0.00004557236,0.0002737925,0.0001679763,0.0001343031],"domain_scores_gemma":[0.9951389,0.003629703,0.0003384948,0.000426986,0.000255807,0.000210194],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000315053,0.000161011,0.003072514,0.0002214934,0.00007559405,0.000331019,0.0002426373,0.8885345,0.005197696,0.03713609,0.003527809,0.06118464],"study_design_scores_gemma":[0.00002500521,0.0000207373,0.0002359974,0.000002884103,0.000007318848,0.00002860097,0.00004975284,0.9615571,0.0007824805,0.0369231,0.0003627558,0.000004169442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2227432,0.0003505498,0.7712385,0.0008984917,0.00004145532,0.000154445,0.0008409153,0.001275306,0.002457124],"genre_scores_gemma":[0.7983884,0.0002508067,0.1966763,0.0001339724,0.00006220072,0.0001300788,0.001776916,0.0002090865,0.002372181],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009177228,"threshold_uncertainty_score":0.01824766,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3029888401","doi":"10.1109/icde48307.2020.00122","title":"G-thinker: A Distributed Framework for Mining Subgraphs in a Big Graph","year":2020,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Parallel computing; Speedup; Bipartite graph; Scheduling (production processes); Vertex (graph theory); Computation; Cache; Graph; Documentation; Theoretical computer science; Distributed computing; Algorithm; Operating system; Mathematics","authors":[{"name":"Da Yan","is_ca":false},{"name":"Guimu Guo","is_ca":false},{"name":"Md Mashiur Rahman Chowdhury","is_ca":false},{"name":"M. TAMER ÖZSU","is_ca":true},{"name":"Wei‐Shinn Ku","is_ca":false},{"name":"John C. S. Lui","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03263031059648514,"gpt":0.2517556690995332,"spread":0.219125358503048,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00193405,0.002088366,0.00110348,0.002088116,0.00115641,0.002378378,0.005512196,0.001285642,0.01351555],"category_scores_gemma":[0.006470582,0.001623721,0.00224644,0.002537458,0.001455158,0.005128277,0.003597048,0.002222544,0.005158707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001110663,"about_ca_system_score_gemma":0.002089388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005849129,"about_ca_topic_score_gemma":0.01201126,"domain_scores_codex":[0.9990577,0.0001642618,0.00006584853,0.0003579882,0.0002633896,0.00009068752],"domain_scores_gemma":[0.99766,0.0008729044,0.0001487335,0.0008277041,0.0002510107,0.0002394988],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001875283,0.0003836302,0.006713934,0.002465726,0.0006458962,0.000635956,0.001350094,0.1256884,0.03497316,0.1007608,0.2293829,0.4951242],"study_design_scores_gemma":[0.0004968214,0.0001396016,0.00126693,0.00009348772,0.0001029224,0.0003386597,0.0002105703,0.8030759,0.01306171,0.1161816,0.06491665,0.0001150985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003077274,0.0002125545,0.8749865,0.0002009675,0.00007007511,0.0002001306,0.00153362,0.1180363,0.001682669],"genre_scores_gemma":[0.05792679,0.0003077473,0.9209162,0.0002211281,0.00005259124,0.0005567049,0.007109473,0.009587699,0.003321708],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01351555,"threshold_uncertainty_score":0.04521406,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2266577329","doi":"10.14778/2904483.2904488","title":"A general-purpose query-centric framework for querying big graphs","year":2016,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scalability; Graph database; Workload; Theoretical computer science; Graph; Analytics; Big data; Computation; Vertex (graph theory); Database; Data mining; Programming language; Operating system","authors":[{"name":"Da Yan","is_ca":false},{"name":"James Cheng","is_ca":false},{"name":"M. TAMER ÖZSU","is_ca":true},{"name":"Fan Yang","is_ca":false},{"name":"Yi Lu","is_ca":false},{"name":"John C. S. Lui","is_ca":false},{"name":"Qizhen Zhang","is_ca":false},{"name":"Wilfred Ng","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01658014292098604,"gpt":0.2329751982869722,"spread":0.2163950553659861,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004428691,0.002286095,0.001755805,0.002367698,0.001990989,0.004599622,0.007523139,0.001836366,0.005400068],"category_scores_gemma":[0.007963038,0.001613205,0.002415364,0.003746558,0.003006537,0.01086246,0.006605392,0.004172469,0.002906909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002271332,"about_ca_system_score_gemma":0.003602477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01523617,"about_ca_topic_score_gemma":0.02214862,"domain_scores_codex":[0.9965644,0.0005669067,0.0003191299,0.0009754357,0.00123533,0.0003388797],"domain_scores_gemma":[0.9947983,0.0013617,0.0002119038,0.002596169,0.0006905089,0.0003413438],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002887221,0.0008361939,0.009019652,0.002347265,0.0006197346,0.0007213224,0.002417513,0.1019322,0.07424613,0.3010722,0.2172876,0.286613],"study_design_scores_gemma":[0.0003976579,0.0002614893,0.001492588,0.00009343072,0.0001327644,0.0005719675,0.0004515617,0.7000275,0.03590208,0.1611803,0.09926668,0.0002219355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006401502,0.0004587153,0.8889679,0.0005113642,0.00008475239,0.0003511609,0.001696225,0.09827921,0.003249144],"genre_scores_gemma":[0.1407674,0.0007874059,0.8309201,0.000911895,0.0001532254,0.0007267605,0.01015049,0.01053347,0.00504919],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01523617,"threshold_uncertainty_score":0.03029495,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1704319585","doi":"10.1145/2714568","title":"A Distributed Algorithm for Large-Scale Graph Partitioning","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Autonomous and Adaptive Systems","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"Stiftelsen för Strategisk Forskning","keywords":"Computer science; Graph partition; Distributed algorithm; Algorithm; Vertex (graph theory); Graph; Theoretical computer science; Distributed computing","authors":[{"name":"Fatemeh Rahimian","is_ca":false},{"name":"Amir H. Payberah","is_ca":false},{"name":"Šarūnas Girdzijauskas","is_ca":false},{"name":"Márk Jelasity","is_ca":false},{"name":"Seif Haridi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02859517343952471,"gpt":0.2457919799450255,"spread":0.2171968065055008,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007658711,0.001016499,0.001088914,0.0009234947,0.0013054,0.00124293,0.002184994,0.001446794,0.004544901],"category_scores_gemma":[0.00274497,0.0005163015,0.0008326497,0.001222941,0.0006888303,0.001735367,0.002212128,0.00150851,0.001396434],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001118185,"about_ca_system_score_gemma":0.001920485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003199067,"about_ca_topic_score_gemma":0.005315423,"domain_scores_codex":[0.9991721,0.0001580987,0.00004427325,0.0002549471,0.000274643,0.00009592214],"domain_scores_gemma":[0.9989415,0.0003855565,0.00008383218,0.0002683477,0.0002382692,0.00008255799],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003663074,0.0002330362,0.0007727457,0.0002089383,0.0001122617,0.0001589501,0.000202227,0.4820642,0.01425314,0.04597347,0.01592592,0.4397288],"study_design_scores_gemma":[0.00009034947,0.00004689111,0.0001273509,0.000006618312,0.00001252931,0.00008202731,0.00003417894,0.973559,0.001801804,0.02012591,0.004102013,0.00001132909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004307413,0.000125896,0.9922472,0.0001789451,0.00005859429,0.00009498348,0.000058157,0.001285932,0.001642784],"genre_scores_gemma":[0.1334787,0.0001201433,0.8618774,0.0001320059,0.00005452483,0.0003336293,0.0003905586,0.0002267187,0.003386359],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004544901,"threshold_uncertainty_score":0.01520425,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012165244","doi":"10.1007/s00500-005-0464-1","title":"Median graph computation for graph clustering","year":2005,"lang":"en","type":"article","venue":"Soft Computing","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Cluster analysis; Computer science; Clustering coefficient; Graph; Computation; Theoretical computer science; Algorithm; Artificial intelligence","authors":[{"name":"Adel Hlaoui","is_ca":true},{"name":"Shengrui Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01566877939288301,"gpt":0.2595915060603086,"spread":0.2439227266674256,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001456126,0.0009688419,0.002650841,0.003063249,0.001917974,0.00252994,0.002621259,0.001732014,0.006829849],"category_scores_gemma":[0.009214314,0.000831573,0.001439929,0.00428897,0.001288923,0.003659579,0.002274422,0.002309287,0.001682912],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002131296,"about_ca_system_score_gemma":0.002333497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006475793,"about_ca_topic_score_gemma":0.008994193,"domain_scores_codex":[0.9985448,0.0004372913,0.00006835553,0.0003541999,0.0004635016,0.000131871],"domain_scores_gemma":[0.9972613,0.00113732,0.000212141,0.0006819948,0.0005408246,0.0001664514],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005089152,0.0002109869,0.00148903,0.0003741774,0.000227313,0.00009034418,0.000262337,0.333792,0.004383311,0.1499738,0.02127453,0.4874131],"study_design_scores_gemma":[0.00002667186,0.00002711142,0.0002708503,0.00002061431,0.00002801969,0.00003351829,0.00006142803,0.8039633,0.002046699,0.1902937,0.003212655,0.00001542875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008140032,0.000309862,0.9882952,0.0003059454,0.00008495004,0.00005337001,0.0001926003,0.00107735,0.001540687],"genre_scores_gemma":[0.2210496,0.000473021,0.7699447,0.0002522423,0.0001753983,0.0002566063,0.001248979,0.0005975652,0.006001836],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006829849,"threshold_uncertainty_score":0.02284813,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2948637333","doi":"10.1145/3299869.3300076","title":"Experimental Analysis of Streaming Algorithms for Graph Partitioning","year":2019,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Graph partition; Scalability; Graph; Algorithm; Theoretical computer science; Database","authors":[{"name":"Anil Pacaci","is_ca":true},{"name":"M. TAMER ÖZSU","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01666396051973259,"gpt":0.2701431195513945,"spread":0.2534791590316619,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002522588,0.001112464,0.0009064565,0.001541851,0.0009942856,0.0008575819,0.00162875,0.0007675044,0.003336591],"category_scores_gemma":[0.0187063,0.0003074141,0.0005125619,0.002769569,0.0007085652,0.002076281,0.0008923869,0.001024562,0.000932616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001243341,"about_ca_system_score_gemma":0.0009754234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003351333,"about_ca_topic_score_gemma":0.002958432,"domain_scores_codex":[0.9962399,0.001073282,0.0003298953,0.0006359383,0.001299492,0.0004214585],"domain_scores_gemma":[0.9793342,0.01122616,0.0009409917,0.004240565,0.003730874,0.0005271567],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.005493894,0.004014169,0.008887535,0.003133405,0.0005339326,0.0003914799,0.0005564985,0.4162627,0.1047139,0.01147174,0.02879004,0.4157507],"study_design_scores_gemma":[0.0003568357,0.002548684,0.006873012,0.00007164893,0.0001143488,0.0004907156,0.0003916589,0.9100696,0.06081124,0.00895396,0.00926017,0.00005809355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8520004,0.003897205,0.1148976,0.0006372804,0.0005682308,0.0009344975,0.003849422,0.006446876,0.01676845],"genre_scores_gemma":[0.8668201,0.001059428,0.1216243,0.0001306325,0.0001076951,0.0003577693,0.00700152,0.0007188818,0.002179662],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003351333,"threshold_uncertainty_score":0.01334089,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3166524313","doi":"10.1145/3446980","title":"Optimizing One-time and Continuous Subgraph Queries using Worst-case Optimal Joins","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Database Systems","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Joins; Query plan; Query optimization; Spatial query; Vertex (graph theory); Computation; Theoretical computer science; Graph; Sargable; Algorithm; Database; Web search query; Search engine; Information retrieval","authors":[{"name":"Amine Mhedhbi","is_ca":true},{"name":"Chathura Kankanamge","is_ca":true},{"name":"Semih Salihoğlu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03081097010833498,"gpt":0.24837275789465,"spread":0.2175617877863151,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002596465,0.00156181,0.001544197,0.0008175771,0.0007957364,0.002458572,0.00194608,0.001020904,0.002735033],"category_scores_gemma":[0.00552527,0.0006355086,0.00160293,0.001595981,0.001564346,0.003597496,0.002161975,0.00187706,0.0004317099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002204553,"about_ca_system_score_gemma":0.002776509,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008217824,"about_ca_topic_score_gemma":0.009994023,"domain_scores_codex":[0.9962053,0.000866317,0.0001891881,0.0007288205,0.001415471,0.000594979],"domain_scores_gemma":[0.9970862,0.001703308,0.0002422659,0.0004741844,0.0003131272,0.0001810089],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003593125,0.0002692761,0.00172318,0.0001781436,0.00009899172,0.0001554274,0.0002167011,0.8705576,0.006669228,0.03302196,0.003574761,0.08317532],"study_design_scores_gemma":[0.00003634483,0.0001096924,0.0001947685,0.000008450147,0.00002459657,0.00004463968,0.00008472594,0.973066,0.002795742,0.02227557,0.001346654,0.00001275783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07978179,0.0006375266,0.9092821,0.0005463997,0.00006422085,0.0002457045,0.0004664778,0.002230835,0.006744858],"genre_scores_gemma":[0.4450021,0.0002994135,0.5498627,0.0001925811,0.0000599535,0.0002407262,0.0009073002,0.0007447496,0.00269038],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008217824,"threshold_uncertainty_score":0.01633996,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2157149375","doi":"10.1142/s0218001404003186","title":"INEXACT GRAPH MATCHING USING EIGEN-SUBSPACE PROJECTION CLUSTERING","year":2004,"lang":"en","type":"article","venue":"International Journal of Pattern Recognition and Artificial Intelligence","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Vertex (graph theory); Subspace topology; Combinatorics; Cluster analysis; Mathematics; Matching (statistics); Graph; Pattern recognition (psychology); Computer science; Artificial intelligence","authors":[{"name":"Terry Caelli","is_ca":true},{"name":"Serhiy Kosinov","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08839100040127454,"gpt":0.3158971288049581,"spread":0.2275061284036836,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001284443,0.0007986081,0.001632025,0.00230602,0.0008580115,0.001833639,0.001710003,0.001667784,0.001555543],"category_scores_gemma":[0.005666769,0.0006649427,0.001051604,0.002936475,0.001606858,0.003532902,0.002520435,0.001369723,0.0007071492],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007599302,"about_ca_system_score_gemma":0.001001086,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002804875,"about_ca_topic_score_gemma":0.002655972,"domain_scores_codex":[0.9982396,0.0006169552,0.00007821146,0.0004117638,0.0005512381,0.0001022552],"domain_scores_gemma":[0.9974775,0.0009944743,0.0003228561,0.0007577054,0.0003453259,0.000102214],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000124342,0.00008428642,0.001129402,0.0001122201,0.0001362691,0.0001892314,0.0002585474,0.6610849,0.007894061,0.0599815,0.002088857,0.2669164],"study_design_scores_gemma":[0.000005084369,0.00001461991,0.0001659272,0.000004288849,0.000005983041,0.00005344203,0.00003427823,0.9637005,0.001767048,0.03366476,0.0005726113,0.00001147683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009115392,0.00008809091,0.9898493,0.00006747712,0.000009182724,0.00001857454,0.0000256138,0.0003339253,0.0004923313],"genre_scores_gemma":[0.2300316,0.0002307925,0.7672163,0.00007736525,0.0000345107,0.0001002213,0.0003437464,0.0001642874,0.001801212],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002804875,"threshold_uncertainty_score":0.006792903,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2142955537","doi":"10.1145/2063576.2063747","title":"Practical representations for web and social graphs","year":2011,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Ciencia e Innovación","keywords":"Computer science; Theoretical computer science; Search engine indexing; Graph; Focus (optics); Artificial intelligence","authors":[{"name":"Francisco Claude","is_ca":true},{"name":"Susana Ladra","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07751962445504977,"gpt":0.323755814836158,"spread":0.2462361903811082,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009965084,0.0009983111,0.0008363122,0.001857033,0.0007251671,0.003194578,0.001790154,0.001484789,0.01167228],"category_scores_gemma":[0.009724297,0.0005477674,0.001079864,0.004414408,0.0008088301,0.006582951,0.002287078,0.001923004,0.003345327],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001238056,"about_ca_system_score_gemma":0.0009698421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002680598,"about_ca_topic_score_gemma":0.004504452,"domain_scores_codex":[0.9986823,0.0004098947,0.0001212575,0.0002132459,0.0004638558,0.0001093827],"domain_scores_gemma":[0.9970371,0.001009979,0.0002189411,0.001270608,0.0003655603,0.0000977965],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003009289,0.0001746331,0.00113036,0.0006320702,0.00006140029,0.0002944893,0.0005386014,0.1808866,0.00362082,0.3605199,0.03234946,0.4194907],"study_design_scores_gemma":[0.00005072841,0.00005817827,0.0001857622,0.00008046215,0.00002890768,0.0003731306,0.0003855099,0.5876081,0.00255115,0.3743218,0.0343313,0.00002494387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01138646,0.0004825532,0.9769131,0.0008093519,0.0001059929,0.0001638623,0.001960537,0.003506918,0.00467123],"genre_scores_gemma":[0.184879,0.000968806,0.8012808,0.0002509356,0.0001081425,0.0004978043,0.006162759,0.0005124751,0.005339319],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01167228,"threshold_uncertainty_score":0.03904772,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2054042055","doi":"10.1115/1.1564574","title":"A New Method for Detection of Graph Isomorphism Based on the Quadratic Form","year":2003,"lang":"en","type":"article","venue":"Journal of Mechanical Design","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quadric; Quadratic equation; Eigenvalues and eigenvectors; Isomorphism (crystallography); Mathematics; Kinematics; Graph isomorphism; Quadratic programming; Combinatorics; Graph; Quadratic function; Discrete mathematics; Mathematical optimization; Geometry; Line graph","authors":[{"name":"P. R. He and","is_ca":true},{"name":"Wenjun Zhang","is_ca":true},{"name":"Q. Li and","is_ca":false},{"name":"Fang–Jing Wu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03585004642022476,"gpt":0.2739377302508366,"spread":0.2380876838306118,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001321209,0.0009662492,0.00116431,0.004573007,0.0009675763,0.001426899,0.002111552,0.001149454,0.005028798],"category_scores_gemma":[0.004869843,0.0005973764,0.001055877,0.001924765,0.001694756,0.003869202,0.002554114,0.001570634,0.001538631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005649191,"about_ca_system_score_gemma":0.0008545169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001161906,"about_ca_topic_score_gemma":0.001037445,"domain_scores_codex":[0.9974859,0.0004228789,0.0001554504,0.0006552579,0.00112793,0.0001526066],"domain_scores_gemma":[0.9971425,0.0008241643,0.0002388646,0.0005504687,0.00108304,0.0001610391],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002597529,0.0002368546,0.002216355,0.0004856547,0.0001341714,0.0003358946,0.0004155734,0.0183594,0.06962894,0.1071325,0.007062718,0.7937323],"study_design_scores_gemma":[0.0002014015,0.0006631544,0.003105865,0.00009171323,0.0001237271,0.002470798,0.0003586971,0.7353424,0.05757235,0.1576741,0.04210116,0.0002946996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003610668,0.00006692519,0.9946572,0.000063505,0.0000559238,0.0000691678,0.00003597705,0.0005053851,0.0009352234],"genre_scores_gemma":[0.05418565,0.0001097296,0.9434048,0.00007355319,0.00007536139,0.0001241005,0.0002239497,0.0002100281,0.001592872],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005028798,"threshold_uncertainty_score":0.01682293,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2014871820","doi":"10.1007/s00778-011-0238-6","title":"Answering pattern match queries in large graph databases via graph embedding","year":2011,"lang":"en","type":"article","venue":"The VLDB Journal","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Reachability; Graph database; Graph; Factor-critical graph; Theoretical computer science; Web search query; Data mining; Information retrieval; Line graph; Search engine; Voltage graph","authors":[{"name":"Lei Zou","is_ca":false},{"name":"Lei Chen","is_ca":false},{"name":"M. TAMER ÖZSU","is_ca":true},{"name":"Dongyan Zhao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03072226293727882,"gpt":0.2576678277286159,"spread":0.226945564791337,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001842251,0.001312567,0.003172606,0.004395175,0.001218763,0.00486026,0.003630594,0.003088491,0.002675725],"category_scores_gemma":[0.01662506,0.001258675,0.001673419,0.007504971,0.001211982,0.01623135,0.003637803,0.00240974,0.001090825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001204907,"about_ca_system_score_gemma":0.001401393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004410752,"about_ca_topic_score_gemma":0.007966775,"domain_scores_codex":[0.995567,0.001019758,0.0005335532,0.001329583,0.001263476,0.0002865019],"domain_scores_gemma":[0.9845557,0.00989353,0.001134136,0.003077355,0.000910357,0.0004290743],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003032586,0.002043365,0.02887049,0.002256018,0.001006259,0.001218014,0.001456556,0.2765237,0.02825109,0.0500709,0.05078782,0.5544832],"study_design_scores_gemma":[0.0001532705,0.0001712054,0.001330664,0.00003580336,0.000177047,0.0004438621,0.0007721808,0.8356786,0.005777818,0.1521964,0.00322344,0.00003972288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3495128,0.003650072,0.6187513,0.005936002,0.000264139,0.0004587381,0.007378902,0.01054663,0.003501387],"genre_scores_gemma":[0.6912882,0.001262445,0.2905577,0.0008018891,0.0002860343,0.0001603419,0.01232036,0.0005903595,0.002732602],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00486026,"threshold_uncertainty_score":0.009742856,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075824405","doi":"10.1145/2535753.2535755","title":"The energy case for graph processing on hybrid CPU and GPU systems","year":2013,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Energy consumption; Graph; Parallel computing; Efficient energy use; Central processing unit; General-purpose computing on graphics processing units; Power consumption; Theoretical computer science; Power (physics); Operating system; Graphics","authors":[{"name":"Abdullah Gharaibeh","is_ca":true},{"name":"Elizeu Santos‐Neto","is_ca":true},{"name":"Lauro Beltrão Costa","is_ca":true},{"name":"Matei Ripeanu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0101561845851264,"gpt":0.2110256177629151,"spread":0.2008694331777887,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004387598,0.0005147831,0.0005097278,0.0004143842,0.0006905112,0.001410113,0.00119298,0.0008757047,0.008010497],"category_scores_gemma":[0.00233998,0.0003689405,0.0003434992,0.0009120805,0.0008655986,0.003051348,0.0009878606,0.0006152273,0.0008144376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005583024,"about_ca_system_score_gemma":0.0002869832,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001816872,"about_ca_topic_score_gemma":0.003194745,"domain_scores_codex":[0.9995151,0.0001075767,0.0000197637,0.0001182291,0.0001153211,0.0001239757],"domain_scores_gemma":[0.9990141,0.0005610838,0.0000420084,0.0001985398,0.0001201832,0.00006398916],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001650337,0.0003969887,0.006786057,0.0005645798,0.0002451345,0.001641874,0.0004012918,0.6713948,0.0530734,0.1607907,0.01296673,0.09008805],"study_design_scores_gemma":[0.00008026529,0.0001634797,0.001841591,0.0000188039,0.00004117134,0.0004530962,0.0002223588,0.9253893,0.009214001,0.05796489,0.004587661,0.00002331811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7699497,0.002097755,0.1893277,0.002707665,0.000233143,0.0000668797,0.0003161996,0.0008366978,0.03446421],"genre_scores_gemma":[0.9710129,0.0002295442,0.0241804,0.0001722282,0.0000365774,0.00005107614,0.0000881203,0.0001089679,0.004120082],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008010497,"threshold_uncertainty_score":0.02679783,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1831273253","doi":"10.1007/978-3-642-12200-2_17","title":"Compact Rich-Functional Binary Relation Representations","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Binary relation; Binary number; Redundancy (engineering); Relation (database); Theoretical computer science; Data structure; Set operations; Binary data; Abstraction; Representation (politics); Set (abstract data type); Algorithm; Data mining; Mathematics; Arithmetic; Discrete mathematics; Programming language","authors":[{"name":"Jérémy Barbay","is_ca":false},{"name":"Francisco Claude","is_ca":true},{"name":"Gonzalo Navarro","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01898075420139992,"gpt":0.2507049437817532,"spread":0.2317241895803533,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006127295,0.0005869659,0.0006272846,0.001328542,0.0008156034,0.002945443,0.001033084,0.0008330179,0.01762563],"category_scores_gemma":[0.002114858,0.0005468539,0.0005860042,0.002095851,0.001195777,0.00768039,0.001850127,0.002235342,0.003645774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005943219,"about_ca_system_score_gemma":0.0002938773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003482551,"about_ca_topic_score_gemma":0.0005927969,"domain_scores_codex":[0.9994206,0.0001228723,0.00004889766,0.0001155735,0.0002105831,0.00008145154],"domain_scores_gemma":[0.9989687,0.000324186,0.00007899123,0.0003868559,0.0001775284,0.00006375188],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002524835,0.00001413902,0.00004370782,0.00004968593,0.000004410058,0.00004225901,0.0001993694,0.0006826879,0.001308336,0.9612234,0.00322172,0.03318509],"study_design_scores_gemma":[0.000006006776,0.00001108509,0.00006737084,0.00002026632,0.000008538555,0.0001404704,0.00006699833,0.005048024,0.001016355,0.9769104,0.01669585,0.000008792057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05780927,0.001190157,0.8130309,0.001046625,0.0003023371,0.0001002958,0.001494404,0.002598833,0.1224272],"genre_scores_gemma":[0.6532571,0.001471565,0.2462247,0.0005502405,0.0004034362,0.0002239682,0.002735391,0.001396135,0.09373746],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01762563,"threshold_uncertainty_score":0.0589636,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2174092017","doi":"10.1007/978-3-540-78808-9_13","title":"Characterization of Graphs Using Degree Cores","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; Dalhousie University","funders":"","keywords":"Computer science; Degree (music); Characterization (materials science); Physics; Optics","authors":[{"name":"John J. Healy","is_ca":true},{"name":"Jeannette Janssen","is_ca":true},{"name":"Evangelos Milios","is_ca":true},{"name":"William Aiello","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03173046588125576,"gpt":0.2371708019624398,"spread":0.205440336081184,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006436841,0.001003214,0.0009188898,0.003602003,0.001097664,0.0032445,0.001328829,0.0008992708,0.0057104],"category_scores_gemma":[0.0046154,0.0006281931,0.0007709846,0.003226102,0.001476276,0.005700029,0.001630323,0.001857872,0.0008030614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001030323,"about_ca_system_score_gemma":0.0005011695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005583054,"about_ca_topic_score_gemma":0.0008628449,"domain_scores_codex":[0.9992241,0.000130529,0.00005117055,0.000243292,0.0002280144,0.0001229155],"domain_scores_gemma":[0.9964004,0.001835728,0.0004261149,0.0004984168,0.000487507,0.0003519807],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002827299,0.0001246358,0.003333678,0.0004917794,0.00003644384,0.000254523,0.0006775616,0.01130115,0.01508565,0.8713409,0.011164,0.08590689],"study_design_scores_gemma":[0.00002757683,0.00008989337,0.002277114,0.0001246442,0.00004411655,0.0008362607,0.0004107962,0.04775594,0.006996375,0.9224429,0.01895964,0.00003478884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4767549,0.0019397,0.3991143,0.002129059,0.0003174637,0.000411666,0.003040728,0.001298708,0.1149933],"genre_scores_gemma":[0.8557696,0.001598467,0.1135152,0.0005334332,0.0005008456,0.0002505074,0.003602134,0.0006306309,0.02359924],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0057104,"threshold_uncertainty_score":0.01910317,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2129793745","doi":"","title":"Compressing pattern databases","year":2004,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Table (database); Database; Uncompressed video; Tile; Heuristic; Pattern search; Function (biology); Data mining; Algorithm; Artificial intelligence","authors":[{"name":"Ariel Felner","is_ca":false},{"name":"Ram Meshulam","is_ca":false},{"name":"Robert C. Holte","is_ca":true},{"name":"Richard E. Korf","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02648172879963302,"gpt":0.2554887542560906,"spread":0.2290070254564576,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007135539,0.0009187934,0.001335616,0.002169325,0.0006078948,0.001926175,0.002147255,0.0006637331,0.005777795],"category_scores_gemma":[0.007785128,0.000613652,0.0006692784,0.005688472,0.0006001974,0.006938201,0.002200813,0.001004348,0.001327975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005936751,"about_ca_system_score_gemma":0.001033436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002399457,"about_ca_topic_score_gemma":0.002219599,"domain_scores_codex":[0.998935,0.0001495831,0.0001206105,0.0002322766,0.0004276784,0.0001348487],"domain_scores_gemma":[0.9947876,0.001605599,0.0003558501,0.00247065,0.0006540097,0.0001262841],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001466282,0.000385234,0.004075881,0.0006918923,0.0001587746,0.0007398952,0.0006424413,0.08991557,0.04282249,0.03449256,0.02225106,0.8023579],"study_design_scores_gemma":[0.0003874527,0.0009797972,0.00332866,0.0001854657,0.0002428181,0.002257792,0.001317155,0.6863261,0.1105235,0.1235679,0.07074855,0.0001347827],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3468337,0.003113332,0.6215413,0.001267556,0.000295853,0.0005503644,0.005846935,0.010039,0.010512],"genre_scores_gemma":[0.5283616,0.002074031,0.4507667,0.0003443205,0.0001470561,0.00056569,0.01091492,0.0007902468,0.006035341],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005777795,"threshold_uncertainty_score":0.01932871,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2218076943","doi":"10.1109/bigdata.2015.7363954","title":"DISTINGER: A distributed graph data structure for massive dynamic graph processing","year":2015,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scalability; Graph database; Theoretical computer science; Graph; Analytics; Data mining; Database","authors":[{"name":"Guoyao Feng","is_ca":true},{"name":"Meng Xiao","is_ca":true},{"name":"Khaled Ammar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03507818747675246,"gpt":0.2836490339052459,"spread":0.2485708464284934,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001029095,0.001085389,0.0008896221,0.002173197,0.0009711157,0.001653876,0.004443397,0.0009098675,0.007732197],"category_scores_gemma":[0.006420734,0.0006864236,0.0008370209,0.003313244,0.0008524006,0.00404753,0.003337743,0.001831733,0.002657412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001204198,"about_ca_system_score_gemma":0.00164615,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004562236,"about_ca_topic_score_gemma":0.01005491,"domain_scores_codex":[0.9992189,0.0001281859,0.00007025429,0.0001827919,0.0003420495,0.00005773358],"domain_scores_gemma":[0.9971797,0.0005824365,0.000203557,0.00135482,0.0004193109,0.0002602774],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001078096,0.0004866857,0.005165123,0.0008712481,0.0002701144,0.0003381254,0.0006795421,0.1422575,0.01704472,0.07880573,0.1764669,0.5765361],"study_design_scores_gemma":[0.0002975574,0.0002665642,0.001097527,0.00005863445,0.00005620786,0.0002954218,0.0002049975,0.8046854,0.01605938,0.09792568,0.07894786,0.0001048001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01269449,0.00040971,0.9101713,0.0006772521,0.000212816,0.00035555,0.005221051,0.06680161,0.003456208],"genre_scores_gemma":[0.141215,0.000421462,0.8348976,0.0003705614,0.00009733147,0.0006055053,0.0143782,0.003234313,0.004780032],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007732197,"threshold_uncertainty_score":0.02586675,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4393502087","doi":"10.5281/zenodo.61234","title":"Mapp Dataset","year":2016,"lang":"en","type":"dataset","venue":"Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Computer science","authors":[{"name":"Émilie Van Haute","is_ca":false},{"name":"Emilien Paulis","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008696954149617473,"gpt":0.1967340076495968,"spread":0.1880370534999793,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009675251,0.001856673,0.001293012,0.003712344,0.0008668668,0.001903235,0.002881237,0.002096117,0.05757966],"category_scores_gemma":[0.006060747,0.0004816814,0.00134643,0.005847864,0.0003947678,0.001609713,0.001727359,0.001909594,0.07541851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00159388,"about_ca_system_score_gemma":0.002159127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01754845,"about_ca_topic_score_gemma":0.04291837,"domain_scores_codex":[0.9987795,0.0002257835,0.0001681923,0.0003834444,0.0002781529,0.000164973],"domain_scores_gemma":[0.9977294,0.0006431441,0.0002116522,0.0005666013,0.000635664,0.0002135835],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005036471,0.00003641366,0.0009459252,0.0005363929,0.00002748213,0.00002880462,0.00002231666,0.0004297686,0.00009947564,0.0007801457,0.9933649,0.003678069],"study_design_scores_gemma":[0.0001718949,0.0000219935,0.004061471,0.0002209126,0.00002392345,0.0001021061,0.0001246392,0.0008945407,0.0002409863,0.001836709,0.9922807,0.00002010399],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"dataset","genre_gemma":"dataset","genre_scores_codex":[0.0002506733,0.0001119881,0.0001186774,0.0001300045,0.00003638556,0.00001802231,0.9979334,0.0003309856,0.001069871],"genre_scores_gemma":[0.000531854,0.00007848371,0.0003796956,0.00005725117,0.000009180345,0.00006554352,0.9981022,0.00003827424,0.0007375964],"genre_candidate":"dataset","genre_consensus":"dataset","teacher_disagreement_score":0.05757966,"threshold_uncertainty_score":0.1926232,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4289866493","doi":"10.1109/icde53745.2022.00242","title":"Out-of-Core Edge Partitioning at Linear Run-Time","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 38th International Conference on Data Engineering (ICDE)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Stateful firewall; Graph partition; Enhanced Data Rates for GSM Evolution; Cluster analysis; Partition (number theory); Stateless protocol; Streaming algorithm; Vertex (graph theory); Graph; Parallel computing; Algorithm; Theoretical computer science; Combinatorics; Mathematics; Upper and lower bounds; Computer network; Artificial intelligence","authors":[{"name":"Ruben Mayer","is_ca":false},{"name":"Kamil Orujzade","is_ca":false},{"name":"Hans‐Arno Jacobsen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07982544312203282,"gpt":0.2879417393873339,"spread":0.208116296265301,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006394202,0.001276852,0.0008431266,0.0006088742,0.0006967597,0.0011774,0.002471447,0.000694931,0.00292793],"category_scores_gemma":[0.00277342,0.000488095,0.0006148703,0.0009114818,0.0004867249,0.003042354,0.001808789,0.001060625,0.001530983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008651661,"about_ca_system_score_gemma":0.001909764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003212765,"about_ca_topic_score_gemma":0.009027733,"domain_scores_codex":[0.9992288,0.0001291542,0.0000560246,0.0001897386,0.0002519969,0.0001442266],"domain_scores_gemma":[0.9974678,0.0008724316,0.0001677529,0.0009708407,0.000352033,0.0001690744],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001493029,0.0008048574,0.004342214,0.0004532436,0.0001263253,0.0002023345,0.000366431,0.2729841,0.07950774,0.01369341,0.01904887,0.6069775],"study_design_scores_gemma":[0.0000710128,0.0001127161,0.0006957454,0.000007552524,0.00001974796,0.00008156423,0.00006160726,0.9711208,0.01573105,0.009444385,0.002638041,0.00001567834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1480016,0.0005215924,0.8231774,0.0004083373,0.00009611965,0.0003797877,0.0004299382,0.01973537,0.007249931],"genre_scores_gemma":[0.4629265,0.0002031085,0.5283616,0.0001688781,0.00003901511,0.0002326523,0.001984168,0.00110044,0.004983677],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003212765,"threshold_uncertainty_score":0.009794891,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2485298192","doi":"10.1109/infocom.2016.7524627","title":"Sketch-based data placement among geo-distributed datacenters for cloud storages","year":2016,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"British Columbia Knowledge Development Fund; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Overhead (engineering); Cloud computing; Distributed computing; Scheme (mathematics); Sketch; Big data; Variety (cybernetics); Data mining; Algorithm; Artificial intelligence","authors":[{"name":"Boyang Yu","is_ca":true},{"name":"Jianping Pan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03447830499677029,"gpt":0.2654412053144707,"spread":0.2309629003177004,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007415129,0.0008339261,0.001092597,0.0008929874,0.000771273,0.001342305,0.001535441,0.0009502636,0.002157097],"category_scores_gemma":[0.004608218,0.0005256648,0.0005598209,0.001608894,0.0008088247,0.00214833,0.002791608,0.0008624036,0.0004794046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007906913,"about_ca_system_score_gemma":0.0009926084,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002370449,"about_ca_topic_score_gemma":0.002809257,"domain_scores_codex":[0.9993883,0.000147528,0.00005379061,0.000153406,0.0001788691,0.00007804329],"domain_scores_gemma":[0.9978197,0.000734213,0.000251671,0.0006598642,0.0002737854,0.000260761],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004604114,0.00008371133,0.003456249,0.0002640403,0.00005625132,0.0002927416,0.0004108552,0.8028024,0.01515227,0.0207156,0.003477565,0.1528279],"study_design_scores_gemma":[0.00001728469,0.00005062022,0.0002272471,0.00001062064,0.000007701753,0.00005743614,0.0001018272,0.9896103,0.003457292,0.004998832,0.00144657,0.00001421844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05632688,0.0005030674,0.9402838,0.0002731794,0.00007796682,0.0001095941,0.0002232152,0.00112568,0.001076805],"genre_scores_gemma":[0.7204742,0.0004593261,0.2769367,0.00006198981,0.00005228724,0.0001200717,0.0004013221,0.00007725984,0.001416755],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002370449,"threshold_uncertainty_score":0.007216215,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2624082338","doi":"10.1145/3078447.3078459","title":"Do We Need Specialized Graph Databases?","year":2017,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Graph database; Benchmarking; RDF; Wait-for graph; Graph; Architecture; Workload; Relational database management system; Database; Relational database; Theoretical computer science; Distributed computing; Information retrieval; Semantic Web; Operating system","authors":[{"name":"Anil Pacaci","is_ca":true},{"name":"Alice Zhou","is_ca":true},{"name":"Jimmy Lin","is_ca":true},{"name":"M. TAMER ÖZSU","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04281900210434345,"gpt":0.2929908326249927,"spread":0.2501718305206492,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0146639,0.001386855,0.002054445,0.001592865,0.001475595,0.007647929,0.01217356,0.003721042,0.008127791],"category_scores_gemma":[0.04826091,0.001130673,0.001160604,0.006018892,0.001543817,0.03213454,0.00356775,0.004379496,0.003388745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002494949,"about_ca_system_score_gemma":0.004380309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006914275,"about_ca_topic_score_gemma":0.007575273,"domain_scores_codex":[0.9845991,0.004760025,0.001078295,0.002208346,0.00567364,0.001680583],"domain_scores_gemma":[0.9544387,0.01322989,0.001848817,0.01627942,0.01092648,0.003276707],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003434306,0.002003536,0.03552684,0.003928714,0.0005890048,0.0006836799,0.001292057,0.0248311,0.02459311,0.1549967,0.1775994,0.5705215],"study_design_scores_gemma":[0.001526148,0.001987692,0.01507004,0.001511715,0.0007954531,0.003030823,0.01001175,0.2371403,0.07791448,0.304202,0.3463992,0.0004104122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3784541,0.03577603,0.3925645,0.09783509,0.00441826,0.001229978,0.005988268,0.03956918,0.04416467],"genre_scores_gemma":[0.5833915,0.007270352,0.3796704,0.01117154,0.0006698359,0.0003766383,0.01038523,0.003347692,0.003716838],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0146639,"threshold_uncertainty_score":0.07755107,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2732621197","doi":"10.1109/tpds.2017.2720174","title":"Combining Vertex-Centric Graph Processing with SPARQL for Large-Scale RDF Data Analytics","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"SPARQL; Named graph; Computer science; RDF; Analytics; RDF Schema; Graph; Graph database; Linked data; Theoretical computer science; PageRank; Information retrieval; Database; Semantic Web","authors":[{"name":"Ibrahim Abdelaziz","is_ca":false},{"name":"Razen Harbi","is_ca":false},{"name":"Semih Salihoğlu","is_ca":true},{"name":"Panos Kalnis","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04261578362629414,"gpt":0.2699335214137163,"spread":0.2273177377874221,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003880937,0.00133159,0.000874934,0.001720599,0.001008856,0.004532264,0.003546835,0.000924542,0.003519642],"category_scores_gemma":[0.01096938,0.0009087247,0.001758161,0.002789089,0.001609455,0.008589801,0.004327673,0.002747329,0.001948607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001587918,"about_ca_system_score_gemma":0.002948797,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01064779,"about_ca_topic_score_gemma":0.01693923,"domain_scores_codex":[0.9963993,0.0006722561,0.0003961902,0.0007976952,0.001485958,0.0002486966],"domain_scores_gemma":[0.9939628,0.001617627,0.0002527616,0.002858751,0.001066405,0.0002416077],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008007433,0.0005619231,0.01096107,0.00126665,0.0007096108,0.0008499136,0.001136691,0.2226011,0.03689119,0.2828972,0.1162821,0.3250419],"study_design_scores_gemma":[0.0001030627,0.00006190158,0.0006983447,0.00007400344,0.0001032188,0.0002244966,0.0003033803,0.7005505,0.03127876,0.2128379,0.05367385,0.00009061654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006388084,0.0002153014,0.9407098,0.0005895848,0.0001092387,0.0001681184,0.001454612,0.04686168,0.003503535],"genre_scores_gemma":[0.1386419,0.0005780834,0.8399936,0.000971331,0.00013006,0.0002947964,0.01086507,0.005976227,0.002548918],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01064779,"threshold_uncertainty_score":0.02117163,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3196580506","doi":"10.14778/3476249.3476297","title":"Columnar storage and list-based processing for graph database management systems","year":2021,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Joins; Scalability; Column (typography); Query optimization; Graph; Block (permutation group theory); Parallel computing; Online aggregation; Database; Relational database management system; Theoretical computer science; Sargable; Relational database; Information retrieval; Web search query; Programming language; Search engine","authors":[{"name":"Pranjal Gupta","is_ca":true},{"name":"Amine Mhedhbi","is_ca":true},{"name":"Semih Salihoğlu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01340213496723072,"gpt":0.2220701710286801,"spread":0.2086680360614494,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000583603,0.0005296627,0.0004315663,0.001385988,0.0007873286,0.002143348,0.001766963,0.0004374172,0.003710844],"category_scores_gemma":[0.002871273,0.0004035817,0.0004248376,0.00336502,0.0008326918,0.003648446,0.001405844,0.0009672403,0.0009807523],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001138034,"about_ca_system_score_gemma":0.00133729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003211176,"about_ca_topic_score_gemma":0.005196213,"domain_scores_codex":[0.9993232,0.0001231797,0.00005995003,0.0001075329,0.000299145,0.0000870228],"domain_scores_gemma":[0.9977058,0.0006479514,0.0002113509,0.0009682889,0.0003910663,0.00007563711],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004798562,0.0002997101,0.003729548,0.0006806629,0.00009835382,0.0002436949,0.000719353,0.0675694,0.07469368,0.1982266,0.03517022,0.618089],"study_design_scores_gemma":[0.00008374858,0.000390992,0.001608155,0.00009189144,0.000108215,0.0007497866,0.0003778181,0.6278543,0.1183002,0.1730792,0.07724177,0.0001138994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03299288,0.001512413,0.953822,0.001079494,0.000154168,0.000154495,0.0005201806,0.005105034,0.0046594],"genre_scores_gemma":[0.2223572,0.001579377,0.7673827,0.0007778205,0.0002463362,0.0002136493,0.001246411,0.0006452319,0.005551349],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003710844,"threshold_uncertainty_score":0.01241398,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2955938631","doi":"","title":"LUMOS: Dependency-Driven Disk-based Graph Processing.","year":2019,"lang":"en","type":"article","venue":"USENIX Annual Technical Conference","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Dependency (UML); Graph; Dependency graph; Parallel computing; Theoretical computer science; Artificial intelligence","authors":[{"name":"Keval Vora","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01151107087650313,"gpt":0.2390502115809077,"spread":0.2275391407044045,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004004501,0.001382248,0.0008622445,0.001810216,0.0009059544,0.001380723,0.003149648,0.0007906081,0.01841595],"category_scores_gemma":[0.002835063,0.0007559914,0.0009331982,0.001905351,0.0006321071,0.002188374,0.00213841,0.001281141,0.006984055],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000838346,"about_ca_system_score_gemma":0.001489192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007808431,"about_ca_topic_score_gemma":0.02285837,"domain_scores_codex":[0.9995634,0.00007210371,0.00002039683,0.0001106202,0.0001759578,0.00005753705],"domain_scores_gemma":[0.998866,0.0003578488,0.00006936905,0.0003750531,0.0002352071,0.00009653495],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001157678,0.0004750733,0.002142181,0.0008962018,0.0002018281,0.0002873531,0.0002552702,0.06994438,0.0338134,0.03191028,0.2510332,0.6078832],"study_design_scores_gemma":[0.0001769092,0.0001754203,0.0008114921,0.0000509257,0.00005694283,0.000159655,0.0001762684,0.8782206,0.02886278,0.05869496,0.03256349,0.00005052419],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02494157,0.0009058603,0.8444397,0.0006072547,0.0003740774,0.0003849553,0.006472891,0.108769,0.01310467],"genre_scores_gemma":[0.2015332,0.0005988161,0.7537618,0.0005785051,0.0001217807,0.000490735,0.01674484,0.006785525,0.01938481],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01841595,"threshold_uncertainty_score":0.06160754,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976692187","doi":"10.1109/hpec.2014.7040962","title":"GasCL: A vertex-centric graph model for GPUs","year":2014,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Parallel computing; Vertex (graph theory); Graph; Theoretical computer science","authors":[{"name":"Shuai Che","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01287316053459526,"gpt":0.2188993538547293,"spread":0.206026193320134,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000598971,0.001159331,0.0006706812,0.0008565207,0.0008841968,0.001984252,0.005173377,0.001419273,0.009855047],"category_scores_gemma":[0.002354745,0.0006253765,0.001451001,0.001305581,0.0008145696,0.002671849,0.001667909,0.002255121,0.002976553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001797647,"about_ca_system_score_gemma":0.002068223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01385673,"about_ca_topic_score_gemma":0.02064576,"domain_scores_codex":[0.999508,0.0001143841,0.00002478324,0.0001017251,0.0001856902,0.00006547896],"domain_scores_gemma":[0.9990767,0.0002098576,0.00004983955,0.0002617447,0.0003010532,0.0001007637],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005548508,0.0002353246,0.002184259,0.0006017107,0.000147429,0.0003875718,0.0004210454,0.5809164,0.01552684,0.2102883,0.08405594,0.1046804],"study_design_scores_gemma":[0.00009266671,0.00006594741,0.0001611817,0.00002809104,0.00001704377,0.00007930492,0.00004363408,0.9090335,0.002871503,0.05364706,0.03393519,0.00002475871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01301102,0.0003155304,0.9502799,0.0008144441,0.000210103,0.0001917239,0.001124411,0.02327948,0.01077345],"genre_scores_gemma":[0.1701571,0.0006700165,0.8068547,0.0007832117,0.0001031199,0.0008017877,0.003108818,0.004957768,0.0125635],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01385673,"threshold_uncertainty_score":0.03296846,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}