{"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,"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","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"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"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03263031059648514,"score_gpt":0.2517556690995332,"score_spread":0.219125358503048,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}