{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004854322,0.0001043164,0.0001476297,0.00006495639,0.00006162973,0.00003066371,0.0007489573,0.00003748217,0.00000230686],"category_scores_gemma":[0.00003253711,0.00007150745,0.00009612005,0.0003256519,0.00004476551,0.0001916101,0.0002917486,0.00009273659,0.000003084686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003742294,"about_ca_system_score_gemma":0.00001228692,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004021636,"about_ca_topic_score_gemma":3.415276e-7,"domain_scores_codex":[0.999089,0.000008435948,0.0002071204,0.0001882059,0.0003082777,0.000198966],"domain_scores_gemma":[0.9993529,0.00002716046,0.0002195235,0.0001602786,0.0001722473,0.00006793695],"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.00009773434,0.001020113,0.001915587,0.00005892437,0.00006399117,0.00000102843,0.002683525,0.0009016492,0.03965887,0.9423572,0.002753726,0.008487668],"study_design_scores_gemma":[0.00212539,0.001475176,0.001559494,0.0004379577,0.00004336684,0.00003017535,0.0004968683,0.05340236,0.7251322,0.2134905,0.001447493,0.0003590166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9472895,0.0002370289,0.03318288,0.001154628,0.001051487,0.0006156883,0.000007126313,0.0001291706,0.01633245],"genre_scores_gemma":[0.9958159,0.000003565747,0.003884388,0.000171841,0.00004873957,0.00001191627,4.93178e-7,0.000005771841,0.00005734892],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7288666,"threshold_uncertainty_score":0.2915989,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005698864,0.0002401824,0.0002933635,0.0007278481,0.0004249674,0.0002199072,0.0004212653,0.00007065207,0.00001371093],"category_scores_gemma":[0.000002390908,0.000213145,0.0003111023,0.001204487,0.0000363401,0.0005043312,0.000004385919,0.0002275801,0.00000412681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003308161,"about_ca_system_score_gemma":0.00001867495,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001647794,"about_ca_topic_score_gemma":0.002739017,"domain_scores_codex":[0.9984656,0.0001153495,0.0003207785,0.0006337934,0.0001883782,0.0002760844],"domain_scores_gemma":[0.9990897,0.0001125262,0.0001065841,0.0004833417,0.00007222587,0.0001355888],"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.00001590247,0.000151721,0.00002614527,0.00001824367,0.0002567551,0.000003286535,0.001082324,0.4445331,0.001375669,0.0006121147,1.719083e-7,0.5519245],"study_design_scores_gemma":[0.0002365034,0.0004454069,0.000190459,0.00003375323,0.000402793,0.0000359456,0.0002394295,0.8053698,0.1676376,0.02497539,0.00001091319,0.0004220223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002943449,0.00002776352,0.9960901,0.0002442198,0.0002518717,0.0002376789,0.0000340666,0.000156997,0.00001386055],"genre_scores_gemma":[0.8985189,0.00006499442,0.101018,0.0002747142,0.0000245445,0.00005198726,0.000004647955,0.00001354748,0.00002865011],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8955754,"threshold_uncertainty_score":0.8691801,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002380526,0.00009968995,0.0001139967,0.00004226512,0.0001025072,0.00006288253,0.001150644,0.00002235302,0.000005090124],"category_scores_gemma":[0.00002376777,0.00006389889,0.00009797885,0.0003516093,0.00004410175,0.0002768878,0.0001550382,0.00008518712,0.000006999832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002200326,"about_ca_system_score_gemma":0.00000958292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001856344,"about_ca_topic_score_gemma":1.220936e-7,"domain_scores_codex":[0.9991654,0.000004138079,0.0001675892,0.0002033222,0.0002597719,0.0001998134],"domain_scores_gemma":[0.9995786,0.0000124418,0.0001231679,0.0001677677,0.00007104229,0.00004697769],"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.000005583996,0.00008432592,0.0002975663,0.000009975845,0.000007881727,3.385319e-7,0.0005244343,0.000004427763,0.01656543,0.9604617,0.001017672,0.02102064],"study_design_scores_gemma":[0.0004583646,0.0001904768,0.006579966,0.00008686649,0.00001124568,0.00001658393,0.0001006456,0.001393803,0.3070242,0.6775364,0.006393623,0.0002077344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5986049,0.001445427,0.1071811,0.03910148,0.002734032,0.002176824,0.00001096872,0.0009812367,0.247764],"genre_scores_gemma":[0.9914644,0.00001197622,0.007607733,0.0004128946,0.00003723623,0.00000730535,7.754238e-8,0.000002892321,0.000455514],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3928594,"threshold_uncertainty_score":0.2605721,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005404567,0.000166133,0.0002948778,0.0001039607,0.0001590739,0.0001137468,0.001488606,0.00004601939,0.000001874752],"category_scores_gemma":[0.00001424586,0.0001154004,0.0001043307,0.000378179,0.0001356247,0.0005377532,0.0002542168,0.0001047914,0.000001290614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000232192,"about_ca_system_score_gemma":0.0000162564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001706076,"about_ca_topic_score_gemma":2.42743e-7,"domain_scores_codex":[0.9985229,0.0000259634,0.0004213991,0.0003184341,0.0004688017,0.0002425093],"domain_scores_gemma":[0.9990125,0.00002345284,0.0004659955,0.0002550271,0.0001629223,0.00008010418],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003878691,0.001202476,0.009021328,0.0004813844,0.00004875325,1.468379e-7,0.01126399,0.0004860153,0.5828564,0.3839421,0.0002863892,0.01037217],"study_design_scores_gemma":[0.0005098546,0.0004999023,0.0006072192,0.0002745086,0.00001900689,0.000009795583,0.001905418,0.06426916,0.9246236,0.006785608,0.0002866952,0.0002092025],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9746047,0.001003672,0.01968969,0.00009614123,0.0007305464,0.0006141273,0.000002396478,0.0001428028,0.003115919],"genre_scores_gemma":[0.9953004,0.000002031,0.00453549,0.00002842945,0.00004443857,0.00004208576,3.511678e-7,0.00001007792,0.00003666986],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3771565,"threshold_uncertainty_score":0.4705893,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0003032802,0.00005199678,0.00005993617,0.0000188052,0.0007636145,0.00006786056,0.04318247,0.00002582008,0.000002929526],"category_scores_gemma":[0.0007207502,0.00002969519,0.0001196462,0.0006840457,0.0002340618,0.00007562473,0.02187453,0.0001645899,0.00001047521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004643853,"about_ca_system_score_gemma":0.00005356432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002877033,"about_ca_topic_score_gemma":0.00002275748,"domain_scores_codex":[0.9993137,0.000254832,0.000128617,0.00009719501,0.0001108379,0.00009478541],"domain_scores_gemma":[0.95916,0.0003719058,0.00007799869,0.04024189,0.000128503,0.00001965862],"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":[5.719e-7,0.00004538101,0.0002402276,0.000002025682,0.00002468663,1.517596e-7,0.0007538539,0.00000185887,0.000553059,0.9490302,0.01289265,0.03645531],"study_design_scores_gemma":[0.00005536025,0.000003985646,0.002380536,0.00001014737,0.000005601318,0.000006316767,0.0002313192,0.00033996,0.005426652,0.8827533,0.1087438,0.00004308632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"commentary","genre_gemma":"empirical","genre_scores_codex":[0.01232653,0.02825863,0.003849287,0.9436155,0.001791214,0.0002043715,0.00001542249,0.00008889048,0.009850174],"genre_scores_gemma":[0.8175187,0.004707798,0.1737,0.002591582,0.00007237594,0.00003035808,0.00000333838,0.00001014001,0.001365689],"genre_candidate":"commentary","genre_consensus":null,"teacher_disagreement_score":0.9410239,"threshold_uncertainty_score":0.9860364,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005111942,0.0001477812,0.0001742611,0.0004953267,0.00007928398,0.0004709812,0.00133878,0.00006293285,0.00002464578],"category_scores_gemma":[0.00001075179,0.0001255545,0.0001915268,0.0002230417,0.00001886986,0.0009945761,0.000273612,0.0002757153,0.0001394816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006553161,"about_ca_system_score_gemma":0.00004108154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001330286,"about_ca_topic_score_gemma":0.00000105549,"domain_scores_codex":[0.9983357,0.00009966923,0.0004075302,0.0002183256,0.0007664352,0.0001723079],"domain_scores_gemma":[0.9987253,0.0001140509,0.0003175562,0.0001688572,0.0005749357,0.0000993108],"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.0002272644,0.0004413384,0.0001928028,0.00001006259,0.0001590873,0.001385461,0.0008489062,0.005879484,0.007479907,0.06375423,0.01616584,0.9034556],"study_design_scores_gemma":[0.00256366,0.00169806,0.02631174,0.001114836,0.00002805807,0.006371295,0.00003917145,0.0721544,0.01160772,0.8528182,0.02454844,0.0007444553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1846332,0.00005079479,0.8085292,0.002687603,0.003297763,0.00005587229,0.00000274128,0.00004001657,0.0007028269],"genre_scores_gemma":[0.8118745,0.000009972769,0.1849952,0.001273435,0.001676402,9.684294e-7,0.000005979102,0.0000102803,0.0001532551],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9027112,"threshold_uncertainty_score":0.5119963,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005284773,0.0001049482,0.0001204823,0.00006554927,0.00006842081,0.00005789895,0.001294556,0.00002751794,0.000003592986],"category_scores_gemma":[0.00006864707,0.00006644407,0.00008978057,0.0004470847,0.00006702289,0.0002758444,0.0004647293,0.00008348611,0.00001221543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002863823,"about_ca_system_score_gemma":0.00002752375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007572339,"about_ca_topic_score_gemma":1.953481e-7,"domain_scores_codex":[0.9990572,0.000007187637,0.0001711054,0.0002034064,0.0003593831,0.000201657],"domain_scores_gemma":[0.99939,0.00001632228,0.0001321786,0.0001803482,0.0001832018,0.00009794727],"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.00001310532,0.0001099081,0.001106457,0.00002251225,0.00003021914,6.090736e-7,0.002252881,0.00002505738,0.01006072,0.9759554,0.004424277,0.005998838],"study_design_scores_gemma":[0.00131237,0.000283117,0.0008901194,0.00007830159,0.00002107766,0.00003574569,0.0006269273,0.005190035,0.3124523,0.6690939,0.009709193,0.0003068535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.782061,0.000887935,0.02929216,0.01640356,0.00435679,0.001724463,0.000009095242,0.0008121827,0.1644528],"genre_scores_gemma":[0.9900244,0.000004040994,0.00901067,0.0002543683,0.00005022741,0.00001886357,1.070539e-7,0.000005529686,0.0006317592],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3068615,"threshold_uncertainty_score":0.2709511,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004578471,0.00007141505,0.0001089731,0.00006583746,0.0001213972,0.00004844155,0.0001721221,0.00002794923,0.00000247641],"category_scores_gemma":[0.00002600892,0.00005453471,0.0000381873,0.0001947223,0.00004868997,0.0004406963,0.00007971287,0.00003983248,5.909013e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001895013,"about_ca_system_score_gemma":0.00001248984,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003089722,"about_ca_topic_score_gemma":0.000001272438,"domain_scores_codex":[0.9994227,0.00002097786,0.0001226408,0.0001366502,0.00007287953,0.0002241218],"domain_scores_gemma":[0.9996223,0.00007545297,0.00005729399,0.0001346507,0.00003760025,0.00007270379],"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.00003534248,0.0002837158,0.04682463,0.0003762534,0.00004549632,0.000001076734,0.01527817,0.000007001655,0.003830003,0.613251,0.0002002961,0.319867],"study_design_scores_gemma":[0.004499132,0.001048618,0.06360689,0.0004909206,0.0001141535,0.0002518485,0.002778337,0.143584,0.1337617,0.6425092,0.005494745,0.001860342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3018043,0.0006372885,0.6954016,0.0001593591,0.00009249926,0.0001485856,0.000001131459,0.00007519664,0.001679983],"genre_scores_gemma":[0.8808181,0.000003709261,0.1189303,0.0001185868,0.00004711608,0.000008932398,3.247063e-7,0.000004362781,0.00006859617],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5790137,"threshold_uncertainty_score":0.2223861,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002963914,0.00024447,0.0003065208,0.0005580909,0.0002837016,0.0002242419,0.0003415053,0.00007020831,0.00004163611],"category_scores_gemma":[6.670886e-7,0.0002082601,0.000233657,0.000826817,0.000100917,0.0004080629,0.000009696412,0.000297274,0.000009589849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001063866,"about_ca_system_score_gemma":0.00000645856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001921649,"about_ca_topic_score_gemma":0.001079966,"domain_scores_codex":[0.998429,0.0001047916,0.0003600688,0.0005955256,0.0002418783,0.0002687498],"domain_scores_gemma":[0.9992176,0.0001227189,0.00007830992,0.0004136779,0.00004127983,0.0001263865],"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.000006646779,0.0002125579,0.0006395463,0.00001748611,0.0002871162,0.0000286072,0.0004811337,0.05665629,0.0002465413,0.004590978,0.000003353838,0.9368297],"study_design_scores_gemma":[0.0001343142,0.0001055018,0.001600861,0.00002745781,0.0003019737,0.00004688354,0.00005536658,0.8776383,0.01769035,0.1019687,0.00001114002,0.0004191611],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02142722,0.0001355107,0.9775597,0.0004779226,0.0001096876,0.00008140492,0.0000261036,0.00009912279,0.00008330453],"genre_scores_gemma":[0.9972851,0.0001826665,0.001972145,0.0004373973,0.000019146,0.0000134008,0.000003343224,0.00001035461,0.00007646642],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9758579,"threshold_uncertainty_score":0.8492599,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001062197,0.00003227857,0.00003297768,0.00002042453,0.0003308903,0.0002640671,0.001138351,0.00001188808,0.00002742311],"category_scores_gemma":[0.00001230509,0.00002447152,0.00003090239,0.00002324917,0.00003711505,0.0004328212,0.0001563063,0.00002741297,0.0001252355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":8.742254e-7,"about_ca_system_score_gemma":0.000004222327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005352518,"about_ca_topic_score_gemma":0.000001486693,"domain_scores_codex":[0.9997104,0.000007381269,0.00003326865,0.0001068156,0.00005423529,0.00008787856],"domain_scores_gemma":[0.9991736,0.000008608691,0.00002181957,0.0007497704,0.00001172847,0.00003448414],"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":[1.706525e-7,0.000005980244,0.0004677623,3.620221e-7,0.000001804041,0.00000485518,0.00002741765,3.622973e-7,0.00007886035,0.9431211,0.0003543172,0.05593697],"study_design_scores_gemma":[0.0002039174,0.00002967565,0.03382622,0.00000387236,0.000001126599,0.00001076171,0.000006261816,0.01227977,0.006077128,0.9382281,0.009184833,0.0001483803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01052081,0.0000133133,0.8360302,0.001232093,0.0004966432,0.00002528024,1.766466e-7,0.0001355998,0.1515459],"genre_scores_gemma":[0.9605957,0.000002058386,0.03713561,0.0002131445,0.00002460419,0.00000139793,5.234873e-8,0.000001172912,0.002026264],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9500749,"threshold_uncertainty_score":0.2546405,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0007938588,0.0000396688,0.00007815321,0.00002201037,0.0006218582,0.000265976,0.006975184,0.00001969772,6.353931e-7],"category_scores_gemma":[0.0006177463,0.0000231854,0.00009813718,0.00002832853,0.00005196342,0.0006864865,0.0007119059,0.0001164908,9.931789e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009407018,"about_ca_system_score_gemma":0.00004243071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001079619,"about_ca_topic_score_gemma":0.000001072978,"domain_scores_codex":[0.9995686,0.00005143645,0.0001486013,0.00004451535,0.0001102981,0.00007658151],"domain_scores_gemma":[0.9975039,0.00008132352,0.0005688457,0.001699593,0.0001209433,0.0000254302],"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.000192721,0.0004294167,0.007045619,0.0001263917,0.0001827221,0.00001351335,0.006832731,0.001071745,0.005712233,0.2213235,0.02037051,0.7366989],"study_design_scores_gemma":[0.0006117736,0.00006597264,0.01820145,0.0001762754,0.00001649484,0.00009024875,0.00006617589,0.008426005,0.00182635,0.9653071,0.005127762,0.00008443273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1180173,0.001353339,0.8148931,0.06307626,0.001345788,0.0002376535,0.000001310479,0.00001927539,0.00105597],"genre_scores_gemma":[0.8377529,0.00001994161,0.161764,0.0002040291,0.00008343023,0.000001486471,3.533226e-8,0.000002751656,0.0001714866],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7439836,"threshold_uncertainty_score":0.9983975,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005030635,0.0004005097,0.0004457186,0.0003153711,0.0005706843,0.0003629844,0.0003682606,0.0001727927,0.00002123962],"category_scores_gemma":[7.540467e-7,0.0003448199,0.0001423268,0.0002159191,0.0001709787,0.00009922477,0.00000403609,0.0002879781,0.00004134656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002791134,"about_ca_system_score_gemma":0.00002852994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000299198,"about_ca_topic_score_gemma":0.00002683028,"domain_scores_codex":[0.9976041,0.0002707197,0.0005245976,0.0007156244,0.0004272813,0.0004576758],"domain_scores_gemma":[0.9987994,0.00009124731,0.00008068508,0.0006614498,0.0000769628,0.0002902812],"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.0004901853,0.00737474,0.0001932276,0.002132479,0.001292688,0.000693044,0.1148463,0.169104,0.001675224,0.5838779,0.0009009806,0.1174192],"study_design_scores_gemma":[0.001823147,0.001396188,0.0002709528,0.000693023,0.0001157021,0.0001519746,0.002583808,0.9839339,0.0009004691,0.0004220501,0.006738191,0.000970639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05466153,0.0007564778,0.9368472,0.00002707572,0.002126806,0.0007533795,0.00008269399,0.0002551865,0.00448965],"genre_scores_gemma":[0.9977273,0.00004508724,0.0004014576,0.00007860523,0.0001046343,0.0001648354,0.000001825163,0.00003295286,0.001443306],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9430658,"threshold_uncertainty_score":0.9999004,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008450477,0.0000323815,0.00003582487,0.00003604247,0.00001857627,0.00003449792,0.0003632033,0.00001200287,0.0001782206],"category_scores_gemma":[0.000001394663,0.00002446118,0.00002983194,0.0001751534,0.000007130744,0.0001992948,0.00006124838,0.00002883165,0.001273119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001177216,"about_ca_system_score_gemma":0.000004433816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001515732,"about_ca_topic_score_gemma":1.745059e-7,"domain_scores_codex":[0.9996832,0.00001138789,0.00003865801,0.000115594,0.00006189718,0.00008923544],"domain_scores_gemma":[0.9996682,0.00001701058,0.000008106346,0.0002699177,0.00001017509,0.0000265419],"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":[2.011065e-7,0.0000063228,0.0008135649,7.248524e-7,0.000001611242,9.162135e-7,0.0000388986,0.000003073077,0.0003557701,0.9884955,0.0001910427,0.01009233],"study_design_scores_gemma":[0.0004306872,0.0001193956,0.01129673,0.000006588324,0.000001379094,0.00002099175,0.00004291763,0.03189325,0.01184362,0.9171841,0.02685856,0.0003018585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1046505,0.00002754344,0.6871631,0.0003969578,0.0006466332,0.00006763011,1.519177e-7,0.0002727586,0.2067747],"genre_scores_gemma":[0.9744987,0.000001049799,0.02019713,0.0005364616,0.000009694736,0.000001017971,1.256739e-7,0.00000140063,0.004754391],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8698482,"threshold_uncertainty_score":0.9995045,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009600286,0.000132258,0.0001486483,0.00004150561,0.00003419409,0.0001561379,0.001491821,0.00008114147,0.00009246677],"category_scores_gemma":[0.00001240888,0.0001085826,0.0001094032,0.00011322,0.00001903807,0.00007169018,0.002577908,0.000360063,0.0002750998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006467963,"about_ca_system_score_gemma":0.00004591147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006316071,"about_ca_topic_score_gemma":5.036907e-7,"domain_scores_codex":[0.9991558,0.00003588487,0.0001118238,0.0004371001,0.0001314091,0.0001279483],"domain_scores_gemma":[0.9991905,0.00002193672,0.00004048074,0.0006284053,0.00002698534,0.00009165399],"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":[6.503296e-7,0.00001443342,0.00001495421,0.00002484001,0.00001631121,0.00002874302,0.000226794,0.00005621602,0.00004786198,0.9752172,0.001903693,0.02244826],"study_design_scores_gemma":[0.00007842429,0.0000242079,0.0003051178,0.00001849851,0.000004069951,0.00000713226,0.000008801821,0.07366031,0.0009771435,0.9176074,0.007047566,0.000261382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005746683,0.00007615207,0.9508812,0.005604459,0.0008696992,0.00008521339,0.000002262435,0.0005062001,0.04140015],"genre_scores_gemma":[0.6499121,0.00002855824,0.3437451,0.002700616,0.0003687216,0.00002398282,0.00001059046,0.00001376581,0.003196551],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6493374,"threshold_uncertainty_score":0.4427872,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001937414,0.00006655828,0.00009995981,0.00003796078,0.0001080198,0.00003231435,0.0005219842,0.00007013447,0.0001186682],"category_scores_gemma":[0.000006829692,0.00005132645,0.00006056895,0.000180471,0.00007135059,0.0002135685,0.0001569086,0.0001768632,0.000009523798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001383132,"about_ca_system_score_gemma":0.00001364289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006990771,"about_ca_topic_score_gemma":0.000004665118,"domain_scores_codex":[0.9994199,0.00003661663,0.0001270904,0.0001555729,0.0001128355,0.0001479526],"domain_scores_gemma":[0.9995667,0.00005853465,0.00005705132,0.0002310202,0.00004217304,0.0000444605],"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.00000349545,0.00004527225,0.0001784392,0.000002280834,0.000004436041,0.000001776569,0.0001858747,0.00003123108,0.005862469,0.9609212,0.00105104,0.03171244],"study_design_scores_gemma":[0.001304707,0.0002479377,0.03588672,0.00002516473,0.00001383108,0.00002379833,0.0001407645,0.7331586,0.04458891,0.1637238,0.02016067,0.0007250762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07083888,0.00001139017,0.911992,0.0002271058,0.0009732559,0.00004916256,8.604538e-7,0.0001059029,0.01580145],"genre_scores_gemma":[0.9770422,6.82259e-7,0.02246292,0.0001198996,0.0001283221,0.000001914823,8.932757e-7,0.000003162257,0.0002400367],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9062033,"threshold_uncertainty_score":0.2093032,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00607511,0.0001020017,0.0001898683,0.00008984667,0.0003755043,0.0001030082,0.0009407395,0.00003630782,0.000003241106],"category_scores_gemma":[0.00006336103,0.00005167711,0.00008557205,0.0003350776,0.0001908733,0.000272767,0.0001813483,0.0002671097,9.784143e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003569272,"about_ca_system_score_gemma":0.00005263678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007987756,"about_ca_topic_score_gemma":0.00002260415,"domain_scores_codex":[0.998464,0.0005570263,0.000289386,0.0001396087,0.0003029215,0.0002470809],"domain_scores_gemma":[0.9985958,0.0004213887,0.0003602132,0.000372018,0.0001945311,0.00005607519],"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.000165335,0.0003048096,0.0157202,0.0001505586,0.0001953532,0.000009244594,0.01105768,0.0000342669,0.00425242,0.690506,0.00008848106,0.2775156],"study_design_scores_gemma":[0.0007886101,0.0002835306,0.3731585,0.00018093,0.00001898131,0.000257134,0.001198032,0.002037464,0.004716454,0.6170143,0.0001545348,0.000191523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9770731,0.01087216,0.01053594,0.0006123199,0.0003372148,0.0001035125,0.000003447588,0.0000173813,0.0004448731],"genre_scores_gemma":[0.9978763,0.001595603,0.000455316,0.00002450358,0.0000152097,6.114546e-7,1.172443e-7,0.000005328564,0.00002697661],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3574383,"threshold_uncertainty_score":0.2888113,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006818071,0.0001666484,0.0002348844,0.0002554106,0.0001634963,0.0002709729,0.001920894,0.00005419086,0.00002398251],"category_scores_gemma":[0.00007241254,0.000132756,0.00006072725,0.001553085,0.0005894588,0.0008682028,0.0005015128,0.0002992223,0.00002760984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000298973,"about_ca_system_score_gemma":0.00008449538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007236558,"about_ca_topic_score_gemma":0.00001119914,"domain_scores_codex":[0.9980646,0.0000979767,0.0002987815,0.0005563509,0.0004724015,0.0005098806],"domain_scores_gemma":[0.9986332,0.0004620442,0.00008902319,0.0005939882,0.00009737396,0.0001243856],"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.00001119329,0.0004095659,0.01962901,0.00006588752,0.00001857773,0.00007057465,0.007856832,0.1523804,0.1160911,0.06495646,0.000008988801,0.6385013],"study_design_scores_gemma":[0.0001502777,0.0001251908,0.03753714,0.00003700549,0.000001178248,0.00003201019,0.000001259964,0.6626872,0.03788758,0.2613663,9.639342e-7,0.0001738491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4461074,0.00003169805,0.5529917,0.0003448464,0.0003785935,0.00008963799,3.017288e-7,0.00004444706,0.00001138111],"genre_scores_gemma":[0.7319933,0.000001772075,0.2677062,0.0002474811,0.00004377524,0.000003325317,1.377312e-7,0.000003613774,5.012575e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6383275,"threshold_uncertainty_score":0.5413632,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001575045,0.0001603577,0.0001999588,0.0001211363,0.0002202373,0.00006832754,0.0009290031,0.00004562025,0.00002090053],"category_scores_gemma":[0.0001480197,0.0001177155,0.0001183665,0.0007308742,0.0003340814,0.0006242341,0.0005400721,0.00009278167,0.000002155264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005499443,"about_ca_system_score_gemma":0.00006536766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004552956,"about_ca_topic_score_gemma":0.000002771641,"domain_scores_codex":[0.9983817,0.00003534837,0.0003655687,0.0003188536,0.0006482508,0.000250301],"domain_scores_gemma":[0.998414,0.00003438453,0.0003844012,0.0003204366,0.0007854073,0.00006138466],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0004689822,0.002076812,0.006718559,0.0008952398,0.0007970812,0.00002647083,0.02174058,0.004421323,0.6214676,0.2684966,0.001857233,0.07103355],"study_design_scores_gemma":[0.001040342,0.0002148137,0.0007748189,0.0002316734,0.0001559275,0.0002184437,0.0010273,0.2044587,0.7731073,0.01842613,0.00007391285,0.0002706313],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9861336,0.00008773525,0.01235624,0.0001112528,0.0003963686,0.0004527783,0.00003512334,0.00004283714,0.0003839976],"genre_scores_gemma":[0.9856083,0.000003871512,0.01424851,0.00002686985,0.00007127653,0.00001962475,0.000002456596,0.000007867031,0.00001118666],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2500705,"threshold_uncertainty_score":0.4800299,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001903917,0.00006289827,0.00006542968,0.00008032697,0.0001221969,0.00009029947,0.0002293271,0.00002618308,0.0001521351],"category_scores_gemma":[0.00002046113,0.00005641355,0.00004556689,0.0003264527,0.00001935803,0.0003708254,0.00005277049,0.00005701757,0.0001320563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005483979,"about_ca_system_score_gemma":0.000001713364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002407478,"about_ca_topic_score_gemma":3.436418e-7,"domain_scores_codex":[0.9994501,0.00002526884,0.0001292602,0.0001440133,0.0001027744,0.0001486172],"domain_scores_gemma":[0.9996319,0.00005064332,0.00004144465,0.000202376,0.00003395072,0.00003963735],"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":[6.894826e-7,0.0003157504,0.00008164167,0.00005836348,0.00002894701,0.00004867623,0.002934355,0.00007311691,0.003718435,0.4441305,0.0006310091,0.5479785],"study_design_scores_gemma":[0.000116811,0.00001909858,0.00001089228,0.00003811806,0.000004103225,0.00007915133,0.0001338175,0.6509986,0.002762426,0.3456115,0.0000750089,0.0001504899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04381558,0.00003697784,0.9340862,0.00009755557,0.0001532236,0.00004847848,3.956873e-7,0.0002022696,0.02155932],"genre_scores_gemma":[0.2701893,0.00000893641,0.7293,0.0002241129,0.00004317567,0.000001951591,4.054408e-7,0.000005309087,0.0002268317],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6509255,"threshold_uncertainty_score":0.2300478,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001204402,0.0001616339,0.0001652865,0.0002854354,0.0006553417,0.0003562495,0.001208013,0.00003016519,0.000003529558],"category_scores_gemma":[0.0000347268,0.0001196108,0.00005751693,0.000325945,0.0001155543,0.000504097,0.0004439182,0.0003121477,0.00000397663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003107019,"about_ca_system_score_gemma":0.00003239798,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001432061,"about_ca_topic_score_gemma":0.000001983793,"domain_scores_codex":[0.9985406,0.00005165444,0.0004983817,0.0002362799,0.0004181704,0.0002548826],"domain_scores_gemma":[0.9984188,0.0004528151,0.000493651,0.0002348859,0.0003178765,0.00008196477],"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.00001672607,0.00007673151,0.002073643,0.00001153433,0.000111048,0.00000350654,0.001044175,0.007770769,0.0005376131,0.01852851,0.0001129202,0.9697128],"study_design_scores_gemma":[0.001569374,0.0002466298,0.03881506,0.0002778139,0.00004642579,0.001197564,0.0002257318,0.9331126,0.002461475,0.01879658,0.002840133,0.0004105808],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7909834,0.000229478,0.2037431,0.004327819,0.000251922,0.0001592409,0.000006339007,0.00006274497,0.000235971],"genre_scores_gemma":[0.9395378,0.00007410849,0.0591522,0.0006374752,0.0005580941,0.000008235816,0.000002530159,0.00001048987,0.00001911219],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9693022,"threshold_uncertainty_score":0.5040424,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003549621,0.00007598542,0.00008964341,0.0000462913,0.0002497,0.0001801782,0.0002405504,0.00001901221,0.000001441389],"category_scores_gemma":[0.000006791529,0.00005487064,0.00001211098,0.0003795421,0.00007058503,0.000219622,0.00008630757,0.00005835735,0.000003315686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005931422,"about_ca_system_score_gemma":0.00001083019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008073648,"about_ca_topic_score_gemma":0.000002000758,"domain_scores_codex":[0.9994006,0.00009117918,0.000105866,0.0001741287,0.0001075104,0.0001207528],"domain_scores_gemma":[0.9995301,0.00006061779,0.00006067497,0.0002307667,0.00007355287,0.00004425889],"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.00001284927,0.0001692653,0.0005942545,0.00008694109,0.00001662592,0.00000115168,0.001119918,0.02163222,0.0002841865,0.5132827,0.00005384928,0.462746],"study_design_scores_gemma":[0.0003456355,0.00007286819,0.002936137,0.00006772408,0.000005917024,0.00001764407,0.00005139242,0.9687752,0.0004964898,0.02681249,0.000284566,0.0001339686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03745119,0.0002222995,0.9609345,0.0003196688,0.00001604955,0.00008863433,5.827054e-7,0.0001313636,0.0008356803],"genre_scores_gemma":[0.9109656,0.000006567636,0.08889684,0.00009735276,0.000003499591,0.000005932197,0.00000990718,0.000003071155,0.00001129062],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.947143,"threshold_uncertainty_score":0.223756,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001120983,0.0001066676,0.0001110392,0.00004626441,0.00009740529,0.00009844319,0.0008695838,0.00003547202,0.0001808821],"category_scores_gemma":[0.00001838716,0.00008918188,0.00008633988,0.0005805761,0.00004979072,0.0003625443,0.000189516,0.0001088374,0.0004883184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003415321,"about_ca_system_score_gemma":0.00001948624,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005368875,"about_ca_topic_score_gemma":6.3429e-7,"domain_scores_codex":[0.9991034,0.00004210226,0.0001304957,0.000326277,0.000167472,0.0002302758],"domain_scores_gemma":[0.9993878,0.00003913165,0.00003060898,0.0003193522,0.00003151482,0.000191618],"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.00000308153,0.00002476301,0.0001629389,0.000004248783,0.00001030551,0.00003648837,0.0006540338,0.000007927365,0.0009862771,0.9797041,0.005558885,0.01284689],"study_design_scores_gemma":[0.002407548,0.001405055,0.003679695,0.00002569822,0.00002695937,0.0001143614,0.0004846363,0.1715128,0.05157064,0.4495174,0.3174333,0.001821931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006001202,0.00008569703,0.9661567,0.008848216,0.0002862626,0.00007577927,0.000001821425,0.0004912047,0.01805311],"genre_scores_gemma":[0.921052,0.000008191107,0.07137048,0.006970286,0.0001016701,0.000005660013,0.00000137527,0.000007589097,0.000482769],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9150507,"threshold_uncertainty_score":0.6276507,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021255,0.0001270238,0.0001113637,0.0001425219,0.00014094,0.0004085062,0.0004714638,0.00003707925,0.00006046929],"category_scores_gemma":[0.00003716108,0.00009818935,0.00002417874,0.0004988991,0.00002954584,0.0004669941,0.0001874112,0.00009949517,0.0001994541],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005059087,"about_ca_system_score_gemma":0.00001210743,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003162614,"about_ca_topic_score_gemma":0.000005640173,"domain_scores_codex":[0.9990361,0.00003366397,0.0001417024,0.0003773303,0.0001569228,0.0002543197],"domain_scores_gemma":[0.9993389,0.00009132335,0.00004111207,0.000326273,0.00005416474,0.0001482512],"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.000008870637,0.00007980053,0.000464275,0.00001903094,0.00001163238,0.000006324507,0.0009343326,0.00002414226,0.0006120722,0.8576325,0.001340459,0.1388666],"study_design_scores_gemma":[0.000921709,0.0004833294,0.005659916,0.0003401792,0.000006952456,0.0000381892,0.0002622274,0.01492543,0.006325213,0.9689008,0.001401609,0.0007344773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7699547,0.0001191085,0.2081306,0.002526418,0.0003015424,0.000624905,9.544018e-7,0.0003977424,0.01794397],"genre_scores_gemma":[0.9470363,0.000004228018,0.05027475,0.001827941,0.00002706138,0.00005116577,4.018669e-7,0.000007077779,0.0007710375],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1770816,"threshold_uncertainty_score":0.4004046,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003131605,0.0001052457,0.0001050893,0.0000912531,0.0001207401,0.0001232088,0.0004263217,0.00003487955,0.00005091199],"category_scores_gemma":[0.00001450292,0.00008694613,0.000103618,0.0003284371,0.00001092995,0.0003638193,0.00003779216,0.00006226175,0.00002865958],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006036872,"about_ca_system_score_gemma":0.00004623975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000158792,"about_ca_topic_score_gemma":0.000001656253,"domain_scores_codex":[0.9992222,0.00003716564,0.0001254279,0.0002564619,0.000106038,0.0002527738],"domain_scores_gemma":[0.9994254,0.00009588184,0.00003154181,0.000300241,0.00002802314,0.0001189684],"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":[4.342988e-7,0.00001431713,0.000004037485,0.000001798474,0.000008601927,0.000002059379,0.0001527865,0.00002194311,0.0000690483,0.7563819,0.000935506,0.2424075],"study_design_scores_gemma":[0.0004138894,0.00006140968,0.00002058882,0.000005405418,0.000003308768,0.00002418092,0.00003976617,0.01086336,0.003078446,0.975619,0.009698173,0.0001724741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001681529,0.00006214632,0.9921353,0.0001626512,0.0004239905,0.0001372378,0.000001082112,0.0001824093,0.006726988],"genre_scores_gemma":[0.009303198,0.000003098765,0.9873518,0.0005140032,0.00004886837,0.00001115133,7.780205e-7,0.000007476613,0.002759614],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2422351,"threshold_uncertainty_score":0.354556,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002458688,0.0001332855,0.0001145125,0.0001409429,0.0004152229,0.0000942527,0.0003863827,0.00003197252,0.0005136557],"category_scores_gemma":[0.000004581467,0.0001399514,0.00008000615,0.0003087015,0.00005446743,0.0001839757,0.0002402561,0.000318549,0.00006279814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003145378,"about_ca_system_score_gemma":0.00001413904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004656072,"about_ca_topic_score_gemma":0.00001040077,"domain_scores_codex":[0.9987285,0.0002413151,0.0001769637,0.0003535045,0.0002548172,0.0002448731],"domain_scores_gemma":[0.999475,0.00006985382,0.00009367038,0.0002489428,0.00004702798,0.00006547444],"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.00001418541,0.00008255024,0.0001880237,0.00002917626,0.00003171339,0.0001938426,0.001054944,0.001114937,0.005844785,0.0003661697,0.0003082753,0.9907714],"study_design_scores_gemma":[0.001285752,0.000277529,0.002301146,0.00004215829,0.00003610972,0.001279177,0.001011045,0.1011688,0.01352983,0.8779157,0.0002623122,0.0008904461],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2341455,0.00002100367,0.7644291,0.0002668032,0.0006187973,0.0001029441,0.00009574582,0.0001432698,0.0001768077],"genre_scores_gemma":[0.9859271,0.000001372795,0.01304087,0.0008272924,0.00006503977,0.00002382578,0.00008791647,0.00001258278,0.00001400514],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.989881,"threshold_uncertainty_score":0.5707051,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001935391,0.0001998138,0.000305398,0.0001776449,0.0004281171,0.000315103,0.001511285,0.00006530007,0.000001116662],"category_scores_gemma":[0.0000867319,0.0001454225,0.0001155191,0.001056835,0.00007794389,0.0002286076,0.0003336038,0.0001983419,0.00003732761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001957647,"about_ca_system_score_gemma":0.00003385402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006319295,"about_ca_topic_score_gemma":5.121917e-8,"domain_scores_codex":[0.9976982,0.0005671985,0.0005074422,0.0004745116,0.0003450045,0.000407569],"domain_scores_gemma":[0.998045,0.0005829796,0.0002911343,0.0007411349,0.0002308046,0.0001089245],"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.000006017205,0.0001205918,0.0002457589,0.00006070578,0.0000349291,9.500345e-7,0.00353415,0.8218281,0.001199832,0.142295,0.0004657363,0.03020821],"study_design_scores_gemma":[0.0002644209,0.00004325056,0.001362858,0.0000630684,0.000008013139,0.00001717388,0.0004185479,0.9944523,0.0001244752,0.003017396,0.00004901051,0.0001795048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01031798,0.0001438004,0.9871152,0.0002103527,0.0004958877,0.0009758514,6.234123e-7,0.0002327114,0.0005075664],"genre_scores_gemma":[0.7089822,7.184412e-7,0.290785,0.0001097403,0.00008097904,0.00001635207,0.000001620931,0.00001049548,0.00001285832],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6986642,"threshold_uncertainty_score":0.5930156,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000865591,0.0004702317,0.0006123971,0.0005054222,0.000131625,0.0004932148,0.002292351,0.0003748789,0.0004579664],"category_scores_gemma":[0.00002305444,0.0004210099,0.0004525149,0.0004721685,0.0003129815,0.0002684269,0.002052545,0.000904658,0.0004623921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002659742,"about_ca_system_score_gemma":0.0002249802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007613442,"about_ca_topic_score_gemma":0.000002895992,"domain_scores_codex":[0.9969478,0.0002591265,0.0004227024,0.001149731,0.0005554606,0.0006652392],"domain_scores_gemma":[0.9974799,0.0003042438,0.0001629536,0.001676667,0.0001750694,0.0002011607],"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.00003516594,0.0003404366,0.00347494,0.0003138943,0.0006751491,0.0003455649,0.001995016,0.001997123,0.00252435,0.9187258,0.002846491,0.06672609],"study_design_scores_gemma":[0.002959542,0.0004861446,0.008905669,0.0007159399,0.0001131939,0.0001927683,0.0003305183,0.479874,0.005473438,0.4957942,0.001370869,0.003783749],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.498108,0.0003442042,0.4212708,0.0004593703,0.002841915,0.001549371,0.0001260278,0.001563076,0.07373718],"genre_scores_gemma":[0.9737648,0.00003048156,0.01932349,0.0003333406,0.00007959367,0.00002249063,0.00004264705,0.0000332587,0.006369915],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4778768,"threshold_uncertainty_score":0.9998242,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002425966,0.0001336413,0.0001804056,0.0001129368,0.00008709114,0.0001125795,0.0007164023,0.00008504323,0.000009417386],"category_scores_gemma":[0.0001796788,0.0001179233,0.0001313944,0.001526518,0.00004014621,0.0001873377,0.0001266854,0.0001525484,0.000008172324],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006198564,"about_ca_system_score_gemma":0.00002610007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005747089,"about_ca_topic_score_gemma":0.000006045856,"domain_scores_codex":[0.9988769,0.00004981406,0.0002160862,0.0004038637,0.0001297335,0.0003236091],"domain_scores_gemma":[0.9991722,0.0003205841,0.0000500561,0.0002752849,0.00003485312,0.0001470971],"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.00002139643,0.00004762215,0.001909339,0.00001754087,0.00001544502,0.00001767549,0.00216228,0.00005612489,0.00009319638,0.9753626,0.0004040832,0.01989267],"study_design_scores_gemma":[0.0007619244,0.0002347649,0.001959804,0.00004713362,0.000006098968,0.000004469101,0.0003579418,0.07392627,0.001252635,0.9193808,0.001719928,0.0003482547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0250544,0.00007500825,0.9700289,0.003977194,0.0002296239,0.0002038917,0.00001453824,0.000249213,0.0001671691],"genre_scores_gemma":[0.7019798,0.000004846395,0.2957743,0.0021204,0.00005783316,0.00003905963,0.000007373274,0.000007098109,0.000009228662],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6769254,"threshold_uncertainty_score":0.4808773,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005411391,0.0002048414,0.0002284467,0.0001734339,0.0002193481,0.00009561174,0.001527669,0.00007951395,0.000005463524],"category_scores_gemma":[0.0002159838,0.0001112679,0.0002778349,0.0006635526,0.0001001111,0.0003233998,0.000433825,0.000106021,0.000006286471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005296414,"about_ca_system_score_gemma":0.00003205448,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007326044,"about_ca_topic_score_gemma":3.490609e-7,"domain_scores_codex":[0.9984252,0.00001293102,0.0003273372,0.0004308562,0.0003468754,0.000456807],"domain_scores_gemma":[0.9989212,0.0001822639,0.000293419,0.0002955759,0.000204504,0.0001030243],"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.00001830421,0.00008463498,0.0009963693,0.00004429554,0.00003607292,2.965988e-7,0.0003173446,0.000001472525,0.03443381,0.9042671,0.0003815838,0.05941873],"study_design_scores_gemma":[0.0005963579,0.0001081221,0.0003600972,0.0002310588,0.00002024544,0.00001037175,0.00003656864,0.0002885165,0.2323498,0.7627926,0.003009588,0.0001966679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3496321,0.0007957648,0.6331053,0.008730476,0.003175061,0.002304242,0.00002995457,0.0004067703,0.001820338],"genre_scores_gemma":[0.9076166,0.0001077491,0.09089976,0.0004450944,0.0001818642,0.0002155695,1.957585e-7,0.00002048926,0.0005127399],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5579844,"threshold_uncertainty_score":0.4537372,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004682527,0.0001844513,0.0002373567,0.000125734,0.000436451,0.0001932287,0.0003589008,0.00007945804,0.000002514961],"category_scores_gemma":[0.00001043661,0.0001677192,0.0001126587,0.0003106875,0.00004981708,0.0003860083,0.00001397203,0.000135291,0.00001204595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004901057,"about_ca_system_score_gemma":0.00006318537,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003869158,"about_ca_topic_score_gemma":0.00001138737,"domain_scores_codex":[0.9987304,0.00009545196,0.0002509933,0.0004216392,0.0001592217,0.0003422561],"domain_scores_gemma":[0.9989612,0.0001339035,0.00008691531,0.0004397774,0.0001481167,0.0002300516],"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.0001272505,0.001434316,0.0000663325,0.000086953,0.0005466339,0.00004345993,0.008109953,0.02511746,0.0001387293,0.3272494,0.0008876836,0.6361918],"study_design_scores_gemma":[0.002377602,0.001073851,0.0001208342,0.0001016023,0.00005224312,0.00009167944,0.003388238,0.9335384,0.0005836462,0.03739529,0.02071334,0.0005632432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005623373,0.0002428909,0.9970406,0.0002424286,0.0007326475,0.0004312434,0.000401444,0.0002270795,0.0001193028],"genre_scores_gemma":[0.8637525,0.00001468064,0.135111,0.0001061822,0.00009488642,0.0003976568,0.0000291975,0.00002093111,0.0004729675],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.908421,"threshold_uncertainty_score":0.6839392,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000650553,0.0001753846,0.0001851058,0.0002270741,0.0004349917,0.0001849247,0.0006196934,0.00006162553,0.000002327493],"category_scores_gemma":[0.00004415139,0.0001806799,0.0001553841,0.0004325988,0.00005233602,0.0004010158,0.0002060453,0.0001359369,0.00001940554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002295027,"about_ca_system_score_gemma":0.00002476476,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003970576,"about_ca_topic_score_gemma":0.000007163326,"domain_scores_codex":[0.99856,0.00006278978,0.00031389,0.0004276307,0.0001960552,0.0004395952],"domain_scores_gemma":[0.9990288,0.000363961,0.0001349229,0.0002567538,0.00009755576,0.0001180266],"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.000007174016,0.0000599361,0.0002157461,0.00004276549,0.00003320437,0.000004449957,0.002118816,0.07527062,0.0003406339,0.05889534,0.0002815327,0.8627298],"study_design_scores_gemma":[0.0004792069,0.00005495918,0.0004057394,0.00003919508,0.000005618825,0.00001933873,0.00003856757,0.8977866,0.0004261849,0.09997844,0.0005307085,0.000235492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02358709,0.00008092105,0.9737293,0.0008004574,0.0008039802,0.0002286338,0.000001982971,0.0004617373,0.0003059167],"genre_scores_gemma":[0.6726243,9.834582e-7,0.326609,0.0004178076,0.0003071013,0.00000523569,0.000005415242,0.0000115598,0.0000185854],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8624943,"threshold_uncertainty_score":0.7367913,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001884504,0.0000723699,0.000175334,0.0002585533,0.00005485543,0.00003834784,0.0002933521,0.00002387122,0.00009412324],"category_scores_gemma":[0.000004253593,0.00006377952,0.0002110011,0.0008203487,0.00002251522,0.0002765826,0.00005963877,0.00002529452,0.000006327476],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006606499,"about_ca_system_score_gemma":0.00000827566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000126028,"about_ca_topic_score_gemma":0.000001326524,"domain_scores_codex":[0.9993172,0.00002064178,0.0001645524,0.0002277322,0.0001181385,0.0001517838],"domain_scores_gemma":[0.9994782,0.00009098287,0.000065244,0.0002852888,0.00004255425,0.00003773309],"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.000009880833,0.0002314917,0.006283817,0.00001500741,0.0008495221,0.000001315399,0.001569554,0.003484526,0.03638877,0.9359015,0.00004388166,0.01522074],"study_design_scores_gemma":[0.0005693992,0.0002580867,0.004698192,0.00001257837,0.0001227783,0.000001279712,0.0008439464,0.7193719,0.260428,0.01333918,0.0001096284,0.0002450914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2920557,0.00004192733,0.7064891,0.00001839318,0.0001306345,0.0001002013,0.000004857761,0.00004709084,0.001112089],"genre_scores_gemma":[0.9210338,6.060592e-7,0.0786934,0.00004639594,0.000009476934,0.00001467155,0.000007350438,0.000002955465,0.0001913579],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9225623,"threshold_uncertainty_score":0.2600853,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004732419,0.0002602813,0.000370788,0.0002523635,0.0006795399,0.0004642126,0.0004497603,0.00008633082,0.00003807849],"category_scores_gemma":[0.00004116816,0.0002724144,0.0001200168,0.0007171771,0.0001235585,0.001039213,0.00006351592,0.0002886171,0.000024964],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003210181,"about_ca_system_score_gemma":0.00008976243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000240856,"about_ca_topic_score_gemma":0.00003325362,"domain_scores_codex":[0.9979767,0.000316329,0.000380164,0.0006708245,0.0002630822,0.0003929675],"domain_scores_gemma":[0.9978201,0.0002771641,0.0001061714,0.001468987,0.0001176569,0.0002099128],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005752323,0.005947342,0.0002917442,0.002166299,0.004043487,0.06125147,0.02337314,0.2723568,0.3333147,0.1556837,0.0005319668,0.1404641],"study_design_scores_gemma":[0.003964395,0.0005440626,0.00004352154,0.002016632,0.000514105,0.04488315,0.006862178,0.8578889,0.07536444,0.0008695278,0.004284169,0.002764938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1083148,0.0007696188,0.8892211,0.0001462504,0.0006534746,0.0002280399,0.0003627335,0.0002247377,0.00007923393],"genre_scores_gemma":[0.7129565,0.00009525957,0.2863628,0.00009397152,0.00007702625,0.00003515057,0.00004128905,0.00003188268,0.0003060794],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6046417,"threshold_uncertainty_score":0.9999728,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004947439,0.0001329193,0.0001405038,0.0004184382,0.0001203963,0.0003433852,0.0004403645,0.00005180871,0.00002737031],"category_scores_gemma":[0.00004309209,0.0001240495,0.0001092718,0.0002134299,0.00005825107,0.001026474,0.0001014275,0.0002347138,0.00002014996],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006327239,"about_ca_system_score_gemma":0.00005141207,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008013094,"about_ca_topic_score_gemma":0.00003452701,"domain_scores_codex":[0.9986835,0.00006802884,0.0005216658,0.000196567,0.000371549,0.0001587284],"domain_scores_gemma":[0.9989694,0.00005557601,0.0003821155,0.00008607734,0.0004176789,0.00008911121],"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.00005525958,0.0001748677,0.0001226399,0.00001290734,0.00009301177,0.0001709657,0.003078385,0.009287976,0.01287442,0.003742893,0.000001395703,0.9703853],"study_design_scores_gemma":[0.0002602863,0.0002722249,0.0002437129,0.0006362093,0.00002538335,0.002157284,0.001564764,0.03840021,0.08226121,0.8737547,0.00003372914,0.0003902338],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3061132,0.00003752833,0.6919987,0.0004446726,0.001289448,0.00004934931,0.000004177219,0.00002032811,0.00004256922],"genre_scores_gemma":[0.9781075,0.0000935957,0.02109786,0.0003010662,0.0003846202,0.000001507677,0.000002411398,0.000008354251,0.000003072656],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.969995,"threshold_uncertainty_score":0.505859,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001395139,0.00003576533,0.00004165744,0.00003474503,0.0001437294,0.00003688991,0.0001080902,0.00002100884,0.00002275372],"category_scores_gemma":[0.00001869023,0.00002988046,0.00003114983,0.00008586591,0.00004996448,0.000295295,0.0000514209,0.00003067602,0.000005854944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001056504,"about_ca_system_score_gemma":0.00001431189,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003572849,"about_ca_topic_score_gemma":0.000002292942,"domain_scores_codex":[0.9996359,0.00002453304,0.00005970669,0.0001408874,0.00004565963,0.00009328542],"domain_scores_gemma":[0.9997401,0.00008593303,0.00001819271,0.00009862547,0.00002890349,0.00002828138],"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.000002787384,0.00002174937,0.0001509223,0.000001541851,0.000005466642,0.000001641665,0.0006739862,9.141012e-9,0.00009327866,0.9951016,0.001324106,0.002622854],"study_design_scores_gemma":[0.0003138433,0.00006654711,0.006613153,8.168515e-7,0.000007617318,0.00002588581,0.0002267845,0.005908064,0.001101209,0.9839354,0.001700543,0.0001001462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01023733,0.000003868115,0.9712378,0.001846747,0.0001420945,0.0001178856,0.000002041764,0.0001004331,0.01631173],"genre_scores_gemma":[0.6811101,0.000001150365,0.3183081,0.0002667124,0.00001904012,0.00001817468,4.88911e-7,0.000002063383,0.0002741454],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6708728,"threshold_uncertainty_score":0.121849,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00385806,0.0001016887,0.0002251387,0.0001412565,0.00009355944,0.00003784659,0.0005124465,0.00006499998,0.00001659909],"category_scores_gemma":[0.0006444294,0.00006060656,0.0002815891,0.0003638732,0.00001253323,0.0001579596,0.00001088944,0.0001947899,0.000001512327],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001878675,"about_ca_system_score_gemma":0.0001242304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001625105,"about_ca_topic_score_gemma":5.484506e-7,"domain_scores_codex":[0.9983951,0.0006056111,0.0004063819,0.0001187242,0.0003130877,0.0001610927],"domain_scores_gemma":[0.997134,0.001986347,0.0003817056,0.0002471962,0.0001430334,0.0001076898],"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.0002170797,0.0001676631,2.945393e-7,0.00001325721,0.00005451791,0.000008215666,0.0001133206,0.001831934,0.09609296,0.844162,0.0004168985,0.05692178],"study_design_scores_gemma":[0.0005312648,0.001359709,0.000001936653,0.00003100929,0.00002210654,0.00003964858,0.00001869572,0.1711789,0.2742284,0.5524159,0.0001182727,0.00005418816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001956149,0.00003549001,0.9984095,0.0007016059,0.0004083147,0.0002122119,4.446131e-7,0.000009147716,0.00002765147],"genre_scores_gemma":[0.3301198,0.000002888036,0.6693944,0.0004199817,0.00003697014,0.000004853437,2.391757e-8,0.000005947144,0.00001522422],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3299241,"threshold_uncertainty_score":0.2471464,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001436939,0.0001642114,0.0001692265,0.0002682276,0.0004250909,0.0001593894,0.0012011,0.00002903884,0.0001040762],"category_scores_gemma":[0.00001280341,0.0001111688,0.0001130004,0.0005375416,0.00008510495,0.001007073,0.0002918619,0.0004665644,0.00002335858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001204916,"about_ca_system_score_gemma":0.00001883125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000054186,"about_ca_topic_score_gemma":0.00004458263,"domain_scores_codex":[0.9985435,0.0002206235,0.00030735,0.0002120952,0.0002394602,0.0004769692],"domain_scores_gemma":[0.9991695,0.0000723285,0.0001424231,0.0004729305,0.00003945603,0.0001033062],"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.0001888723,0.001328395,0.204641,0.0001246022,0.0004127872,0.003212361,0.1106246,0.0006128268,0.01079484,0.284209,0.001529235,0.3823215],"study_design_scores_gemma":[0.003124814,0.0004283667,0.1469487,0.0009111011,0.00005420244,0.006062472,0.005205266,0.02442066,0.02466277,0.7824022,0.003936718,0.001842686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2812704,0.0004303626,0.7172322,0.0001489879,0.0005865647,0.00005330385,0.000004529634,0.00005241523,0.0002212331],"genre_scores_gemma":[0.9883958,0.0002102645,0.01095205,0.0002978235,0.0001081808,0.000004636599,8.603423e-7,0.00001241388,0.0000180261],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7071253,"threshold_uncertainty_score":0.4533333,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002245826,0.00008032827,0.00006867557,0.00003878334,0.000469113,0.0005526244,0.0002467496,0.00001557536,0.000001198739],"category_scores_gemma":[0.00001047213,0.00004469853,0.00002892974,0.0001026746,0.000050829,0.0002775781,0.00005080941,0.00003328105,0.000003833705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003564769,"about_ca_system_score_gemma":0.0000102341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008714311,"about_ca_topic_score_gemma":0.000004607958,"domain_scores_codex":[0.999397,0.00003966831,0.0001045383,0.0001977436,0.00007594137,0.0001850816],"domain_scores_gemma":[0.9994286,0.0001902954,0.00003872311,0.0002222659,0.00005900807,0.0000610748],"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.00000285747,0.00001924101,0.000006388867,0.00002013558,0.000009093495,0.00003931447,0.000117466,0.0000279116,0.00009525177,0.6763351,0.001775275,0.321552],"study_design_scores_gemma":[0.0005396281,0.0003155978,0.00003974762,0.0000574349,0.000008159414,0.002355895,0.0005097525,0.7456927,0.006115581,0.2292855,0.01470323,0.0003768176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04539602,0.000617885,0.9511914,0.0007084865,0.0003676279,0.0002438895,0.000001337177,0.0001236983,0.001349713],"genre_scores_gemma":[0.9961814,0.00001015676,0.002461227,0.0002986222,0.00004649628,0.0001006766,2.982833e-7,0.000004757927,0.0008963419],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9507854,"threshold_uncertainty_score":0.532897,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008804123,0.0004171472,0.0003493831,0.001032737,0.0005846906,0.0004508878,0.002058034,0.000363613,0.00009528283],"category_scores_gemma":[0.00009931253,0.0003887469,0.0001560901,0.0008433376,0.0008411598,0.001018663,0.0005854625,0.001379472,0.0001290641],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001253012,"about_ca_system_score_gemma":0.0003832912,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001067998,"about_ca_topic_score_gemma":0.00001795741,"domain_scores_codex":[0.9967385,0.00005257316,0.0004602512,0.001341715,0.0009272313,0.000479719],"domain_scores_gemma":[0.9972471,0.0006437019,0.0002854158,0.001395182,0.0002505774,0.0001780096],"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.00002159067,0.0001501084,0.0006816902,0.00003697284,0.00004564994,0.0002168003,0.001860966,0.1496595,0.003930511,0.5517074,0.0001544985,0.2915343],"study_design_scores_gemma":[0.0002465389,0.0001093594,0.004400619,0.0001136748,0.000009235258,0.0001229358,1.808714e-7,0.2679859,0.001366891,0.7240794,0.001008864,0.0005564493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003853781,0.0001261656,0.9871604,0.001110593,0.003641487,0.0002743994,0.000006579433,0.0002167823,0.007078201],"genre_scores_gemma":[0.4423233,0.00003100762,0.5521997,0.001694801,0.001388697,0.00001273172,0.00005421153,0.00006088839,0.002234639],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4419379,"threshold_uncertainty_score":0.9998565,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004634253,0.0003915557,0.0004828181,0.001050437,0.0002309144,0.0001388249,0.002427129,0.0002366068,0.00001028536],"category_scores_gemma":[0.00003208923,0.0003623404,0.0001565734,0.0008443145,0.0009890264,0.0006435637,0.0007032793,0.0004216564,0.000006347931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007271041,"about_ca_system_score_gemma":0.0003175479,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009492126,"about_ca_topic_score_gemma":0.000005989728,"domain_scores_codex":[0.9973332,0.00003810411,0.0005051422,0.0009582878,0.0007363236,0.0004289929],"domain_scores_gemma":[0.998015,0.0001731495,0.00043472,0.001014959,0.0002535843,0.0001085398],"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.00001199447,0.00006750396,0.0002256358,0.00007671762,0.0000273154,0.0001569922,0.002046277,0.008670108,0.02677317,0.07967835,0.000002638756,0.8822633],"study_design_scores_gemma":[0.0003755105,0.000256316,0.001381523,0.0007294856,0.0000153431,0.000319509,1.318523e-7,0.6388068,0.03452257,0.3222483,0.0002860961,0.00105846],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007593811,0.0001680749,0.9900017,0.00005118683,0.001324097,0.0002275026,0.000008962743,0.00008285872,0.0005418563],"genre_scores_gemma":[0.5489249,0.0001893629,0.4497966,0.0006017069,0.0002968225,0.000003950593,0.00001405524,0.00004563939,0.0001269587],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8812048,"threshold_uncertainty_score":0.9998829,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007000198,0.00004945428,0.00004615377,0.00003043679,0.00007995684,0.00007156122,0.0003642824,0.000007326286,0.00002514895],"category_scores_gemma":[0.000005052174,0.00003924799,0.00002186812,0.0001075164,0.00002277506,0.0004110432,0.0001418875,0.0000402944,0.00009270671],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004602608,"about_ca_system_score_gemma":0.00001108727,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003704828,"about_ca_topic_score_gemma":0.000004271933,"domain_scores_codex":[0.9995763,0.00001394655,0.00006150296,0.0001484625,0.00008132798,0.0001184863],"domain_scores_gemma":[0.9996058,0.0000289844,0.00001480972,0.0002994154,0.00001095677,0.00004002666],"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":[4.978322e-7,0.00007163936,0.0004014789,0.00000474448,0.000006131241,0.00004222881,0.00028501,0.0005499296,0.001064356,0.8115147,0.0001067507,0.1859526],"study_design_scores_gemma":[0.003409955,0.0001990764,0.01290786,0.0002560061,0.00001458371,0.0002037063,0.0002524171,0.0848834,0.2177785,0.6576107,0.02098784,0.00149593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01199028,0.00003174579,0.9839091,0.000371769,0.0001627687,0.00002246942,0.000001147244,0.0001673007,0.003343471],"genre_scores_gemma":[0.9204235,0.000001317554,0.07870778,0.0007645128,0.00002630939,0.000001188547,0.000001514017,0.000002073495,0.00007182512],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9084332,"threshold_uncertainty_score":0.1600487,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003547495,0.0001962709,0.0001910605,0.0001087283,0.0002285328,0.0003095951,0.002121795,0.000072932,0.000005776965],"category_scores_gemma":[0.0001555149,0.0001514985,0.00005901985,0.0007739172,0.0001013265,0.000993666,0.0005628625,0.0001286003,0.000003074279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002314766,"about_ca_system_score_gemma":0.0001034953,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006151766,"about_ca_topic_score_gemma":0.00002492105,"domain_scores_codex":[0.9984505,0.00004986188,0.0002197827,0.0006574863,0.0002424691,0.0003799582],"domain_scores_gemma":[0.9983097,0.00007674181,0.000127178,0.001086352,0.0001996043,0.000200448],"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.0001590678,0.0004308446,0.002800523,0.0003524748,0.0002581496,0.00009607299,0.003295259,0.00135203,0.00155273,0.5380254,0.02398937,0.4276881],"study_design_scores_gemma":[0.0007465732,0.0000923681,0.0003885439,0.00002514025,0.00002290087,0.00002473878,0.0002842267,0.43951,0.0001975775,0.5567953,0.001558737,0.0003538841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005938067,0.0001786482,0.9915286,0.000670541,0.0003166575,0.0002811918,0.0005955448,0.000306578,0.0001841346],"genre_scores_gemma":[0.8442775,0.00000147703,0.1546427,0.0001637449,0.00005082732,0.00001637423,0.0007463522,0.00001320806,0.00008775909],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8383394,"threshold_uncertainty_score":0.6177928,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.0009669487,0.001686033,0.001343875,0.001909129,0.002420535,0.0007872377,0.01047212,0.001869818,0.001348933],"category_scores_gemma":[0.0001141039,0.001818239,0.0009329529,0.002317236,0.001019506,0.004347114,0.004601419,0.001897643,0.001760994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001540137,"about_ca_system_score_gemma":0.002495529,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008957871,"about_ca_topic_score_gemma":0.000286212,"domain_scores_codex":[0.9921722,0.0008730901,0.0008003739,0.002456957,0.001127759,0.002569561],"domain_scores_gemma":[0.992842,0.0005162317,0.0008991222,0.003853781,0.0002800534,0.001608787],"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.0005235334,0.0004042146,0.00005322896,0.0002642281,0.0004978674,0.005664314,0.001042814,0.000416506,0.0001541634,0.03530081,0.9487059,0.00697241],"study_design_scores_gemma":[0.005583192,0.0002355173,0.0003097217,0.0006562809,0.0004282624,0.001632912,0.001133394,0.002128867,0.0002411424,0.004582085,0.9808434,0.002225254],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"dataset","genre_gemma":"dataset","genre_scores_codex":[0.0007412927,0.00161195,0.1353652,0.002297122,0.00140027,0.0007487193,0.8551143,0.0008955069,0.001825563],"genre_scores_gemma":[0.001565775,0.006797216,0.01193449,0.003319038,0.0012944,0.00002750746,0.9691228,0.000178737,0.005760021],"genre_candidate":"dataset","genre_consensus":"dataset","teacher_disagreement_score":0.1234308,"threshold_uncertainty_score":0.9995886,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005409315,0.0001890696,0.0001932231,0.0002304943,0.0001785216,0.00007711589,0.003156426,0.00003537428,0.001778155],"category_scores_gemma":[0.00008141975,0.000209654,0.00006913339,0.0002657424,0.00003580577,0.000485193,0.001602925,0.0003597442,0.0001914642],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001078681,"about_ca_system_score_gemma":0.00006598127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007628232,"about_ca_topic_score_gemma":0.000002136436,"domain_scores_codex":[0.9981751,0.00004742083,0.0003335674,0.0005419877,0.0006435984,0.0002583703],"domain_scores_gemma":[0.9985715,0.0001125609,0.0001437984,0.0009900114,0.00009141266,0.00009078727],"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.0001035865,0.0004336413,0.0003332053,0.00005989651,0.0003529607,0.0001655738,0.001640561,0.1294367,0.05473378,0.7869282,0.01788873,0.00792318],"study_design_scores_gemma":[0.0002854067,0.0001120588,0.0001243516,0.00004051481,0.000007568735,0.00001938539,0.00002819245,0.9743794,0.00248418,0.001636189,0.02062382,0.0002589236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1519464,0.0002008289,0.7996479,0.003094847,0.02503459,0.0007613809,0.005634652,0.00115263,0.01252678],"genre_scores_gemma":[0.9810452,0.00002887122,0.01352745,0.0002584163,0.0003630902,0.00006050826,0.001388151,0.00003505043,0.003293188],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8449427,"threshold_uncertainty_score":0.9991344,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006804385,0.0001562437,0.0001414247,0.00006408842,0.0001449516,0.0001284848,0.002449949,0.00004305865,0.00006756734],"category_scores_gemma":[0.00007723738,0.00009975242,0.00005189986,0.0001683479,0.00009605333,0.0008730667,0.0006435478,0.00004561495,0.0000330152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003210538,"about_ca_system_score_gemma":0.00005046336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001010611,"about_ca_topic_score_gemma":0.000015162,"domain_scores_codex":[0.9985331,0.00007006732,0.0002044915,0.0006169628,0.0002047131,0.0003706645],"domain_scores_gemma":[0.997584,0.0002846238,0.00008390061,0.001861708,0.00005469844,0.0001310054],"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.0003482653,0.001108542,0.008701299,0.0001422865,0.0003660356,0.00006353517,0.000262145,0.000554518,0.004091932,0.3613741,0.4893729,0.1336145],"study_design_scores_gemma":[0.01239207,0.0009022079,0.007218389,0.0003312255,0.00009227858,0.00001040495,0.0002573128,0.5526252,0.03552865,0.02229183,0.3663491,0.002001369],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009046618,0.00001978515,0.986625,0.001926115,0.0006943857,0.0003125092,0.001061945,0.0002298494,0.00008375761],"genre_scores_gemma":[0.9142791,0.000008898603,0.08240747,0.0008577097,0.0002130181,0.00006695364,0.0009043414,0.00002272403,0.001239805],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9052325,"threshold_uncertainty_score":0.4552656,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003058593,0.0001040216,0.0001222967,0.00008008493,0.0005219014,0.0005464666,0.001833019,0.0000225735,0.0002529867],"category_scores_gemma":[0.00004819571,0.0000819151,0.00008226771,0.000107495,0.000101755,0.0009773186,0.0004937397,0.00007832795,0.0002360099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000378203,"about_ca_system_score_gemma":0.0000176759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003655117,"about_ca_topic_score_gemma":0.000009459306,"domain_scores_codex":[0.9991441,0.00004068526,0.0001176956,0.000304462,0.0001715782,0.0002215279],"domain_scores_gemma":[0.998009,0.00004271803,0.00008560799,0.001732913,0.00003142847,0.00009838336],"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.000003491721,0.00002622757,0.0002787426,0.000002208991,0.000008404935,0.00002064637,0.00008479175,6.474189e-7,0.000226298,0.9516867,0.002295919,0.04536593],"study_design_scores_gemma":[0.001472371,0.00006030679,0.006593189,0.00004785857,0.00001110514,0.00002895464,0.00009102744,0.003598787,0.00830243,0.8111504,0.1680919,0.0005516594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006484997,0.0001737131,0.8989964,0.004081578,0.001724591,0.0001401731,0.000008132302,0.0002839318,0.08810654],"genre_scores_gemma":[0.8092802,0.0002558094,0.1822557,0.0006796474,0.0005235923,0.00001403204,0.000004106812,0.00001592053,0.006971093],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8027951,"threshold_uncertainty_score":0.526959,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004217848,0.0002267755,0.0003208949,0.0001139703,0.001753194,0.0008751891,0.001175121,0.00009281411,0.000001527814],"category_scores_gemma":[0.000007651618,0.0001827983,0.00006440844,0.0002543957,0.00009599673,0.0009120394,0.00001416639,0.0001761352,0.000004595771],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001826607,"about_ca_system_score_gemma":0.00006302304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003144237,"about_ca_topic_score_gemma":0.00004586472,"domain_scores_codex":[0.9983976,0.00005551005,0.0002822457,0.0006025385,0.0002418598,0.0004202048],"domain_scores_gemma":[0.9980755,0.00009337427,0.0002230695,0.001306751,0.0001180316,0.0001833139],"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.001942624,0.006657136,0.004545533,0.002720733,0.002056369,0.0003057203,0.004222367,0.816183,0.0004163875,0.07407738,0.005466666,0.08140609],"study_design_scores_gemma":[0.002384642,0.0001827228,0.0004008893,0.0001901246,0.0001007224,0.00006004693,0.0003290993,0.9935406,0.00005096206,0.0009557193,0.001455672,0.0003488371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002454575,0.0001847022,0.9949893,0.0002230155,0.0005532744,0.0004021085,0.0009867029,0.0001257884,0.0000805136],"genre_scores_gemma":[0.9955786,0.00003748251,0.004011918,0.0000280844,0.00002727717,0.00005856665,0.00009277018,0.00001342521,0.0001518258],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9931241,"threshold_uncertainty_score":0.9995464,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005479847,0.0001465944,0.0001833592,0.00008525485,0.0002611169,0.0002699175,0.0006426634,0.00002874013,0.000001529993],"category_scores_gemma":[0.00002886217,0.0001138115,0.00008518967,0.0004629469,0.00007518876,0.0003287065,0.0004014474,0.00007400895,4.387875e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000292454,"about_ca_system_score_gemma":0.00003207608,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006303003,"about_ca_topic_score_gemma":8.755884e-7,"domain_scores_codex":[0.9987713,0.000012391,0.0002500336,0.0004086676,0.0003072982,0.0002502993],"domain_scores_gemma":[0.999244,0.00003944536,0.0001984399,0.0002208664,0.0002254436,0.00007174418],"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.00007730276,0.0006609979,0.00123961,0.006229311,0.0001969341,0.00001424497,0.001289707,0.0003310781,0.05124158,0.9146512,0.002631251,0.02143674],"study_design_scores_gemma":[0.008384937,0.0006426605,0.001968988,0.004374937,0.0004950598,0.0001743901,0.005358085,0.2981166,0.566676,0.08850939,0.02357415,0.001724774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3010794,0.008278761,0.6648469,0.005392474,0.00289085,0.006564533,0.000193229,0.0006107772,0.01014307],"genre_scores_gemma":[0.9573745,0.00003433738,0.04166439,0.0001886912,0.00004028696,0.0002328128,0.000003179023,0.0000132965,0.0004485041],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8261418,"threshold_uncertainty_score":0.4641098,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003575708,0.0003039211,0.0003423114,0.000186762,0.0001683645,0.0002706363,0.002262133,0.0002119337,0.0001267548],"category_scores_gemma":[0.00008414387,0.0002618282,0.0001723773,0.0008217539,0.0002127045,0.000858288,0.0004030126,0.0005041712,0.0003338624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000259781,"about_ca_system_score_gemma":0.000259475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001131819,"about_ca_topic_score_gemma":0.00001347231,"domain_scores_codex":[0.9975458,0.0001247622,0.0003743052,0.0008434984,0.000546271,0.0005653468],"domain_scores_gemma":[0.9981502,0.0001495306,0.0001542302,0.001016498,0.0002996898,0.0002298071],"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.0000729758,0.0007260328,0.008197725,0.000159516,0.0000314229,0.0001319912,0.0007852294,0.0003000133,0.01179055,0.8302382,0.0007722905,0.1467941],"study_design_scores_gemma":[0.005053605,0.003128593,0.04111306,0.001114713,0.0001004048,0.0002556264,0.0005338663,0.272971,0.02331124,0.6230125,0.0243937,0.00501176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06255776,0.0001080218,0.9249403,0.001208386,0.0004047535,0.0006023183,0.00004195212,0.001540723,0.008595736],"genre_scores_gemma":[0.9654599,0.000006200896,0.03353623,0.0005124712,0.00003499984,0.00003712385,0.000007172613,0.00001737452,0.0003885024],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9029022,"threshold_uncertainty_score":0.9999834,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000283925,0.0000894023,0.00009908899,0.00009814343,0.0001078458,0.00007149095,0.0005913317,0.00003364301,0.000008792636],"category_scores_gemma":[0.00002746167,0.00007188528,0.0001007485,0.0002621381,0.00002215002,0.0002137022,0.00007831783,0.00004344745,0.00004156635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005152861,"about_ca_system_score_gemma":0.00001489903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002445067,"about_ca_topic_score_gemma":0.000001756212,"domain_scores_codex":[0.9992436,0.00002664275,0.0001066346,0.0002577339,0.0001078013,0.000257631],"domain_scores_gemma":[0.9993679,0.00009748351,0.00002672447,0.000378476,0.00004272213,0.00008672268],"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.000002997654,0.00004177972,0.00001588988,0.000004923466,0.000005456962,3.489621e-7,0.0001076562,0.001161732,0.00007084763,0.9593344,0.001311,0.03794292],"study_design_scores_gemma":[0.0002358984,0.00003107978,0.00002476941,0.00000192633,0.00000212489,0.000002018566,0.000001892927,0.613866,0.0003384807,0.3847561,0.0006679472,0.00007181339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002717892,0.00001947383,0.9919749,0.0002795526,0.0002673875,0.0001228325,0.000001204104,0.0001856223,0.004431128],"genre_scores_gemma":[0.8468407,0.000004142206,0.1501754,0.0009811653,0.00002658537,0.00002531262,0.000001117494,0.000007074853,0.001938452],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8441228,"threshold_uncertainty_score":0.2931397,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}