{"id":"W2156206152","doi":"10.1109/icde.2013.6544815","title":"Scalable maximum clique computation using MapReduce","year":2013,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Amazon Web Services","keywords":"Scalability; Computer science; Clique; Computation; Parallel computing; Graph partition; Key (lock); Fault tolerance; Graph; Theoretical computer science; Algorithm; Distributed computing; Mathematics; Combinatorics","routes":{"ca_aff":true,"ca_fund":true,"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.0001192714,0.00009486467,0.00009838025,0.00009044196,0.0001488175,0.0003042718,0.0004547235,0.00004042946,0.0001713735],"category_scores_gemma":[0.000008383498,0.00008748268,0.00004724216,0.0003718578,0.00004166695,0.000819208,0.0002283767,0.00008813038,0.000286351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000265501,"about_ca_system_score_gemma":0.00003597257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000432753,"about_ca_topic_score_gemma":0.000003351153,"domain_scores_codex":[0.9991297,0.00004120788,0.0001641571,0.0002648737,0.0001650549,0.000235025],"domain_scores_gemma":[0.9994524,0.00004989919,0.00004311845,0.0002718365,0.0001023802,0.00008032719],"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.000002592509,0.0002838784,0.001093331,0.00005048397,0.00004117311,0.00001286065,0.0006850219,0.007750695,0.00690362,0.3898509,0.01450489,0.5788205],"study_design_scores_gemma":[0.0001045507,0.00002089448,0.001221126,0.000009716412,0.000001264924,0.00001540332,0.00001985692,0.815767,0.001359567,0.1807242,0.000628032,0.0001284294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03908844,0.00002027384,0.9482925,0.0007617023,0.0003578532,0.0001551386,3.678471e-7,0.0002392903,0.01108445],"genre_scores_gemma":[0.3913371,0.000002096737,0.6077281,0.0004918493,0.00005020784,0.000007106538,0.00000121984,0.000005219144,0.00037712],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8080163,"threshold_uncertainty_score":0.3680558,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03448348328105771,"score_gpt":0.268198908797724,"score_spread":0.2337154255166662,"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."}}