{"id":"W4285290135","doi":"10.1007/978-3-031-08757-8_43","title":"A Sparse Matrix Approach for Covering Large Complex Networks by Cliques","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Heuristics; Clique; Pairwise comparison; Computer science; Benchmark (surveying); Theoretical computer science; Graph; Algorithm; Scalability; Computation; Heuristic; Mathematics; Mathematical optimization; Artificial intelligence; Combinatorics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000773477,0.0005326021,0.0007366883,0.0003308977,0.0004718003,0.0002781843,0.001383725,0.0001323591,0.0005293004],"category_scores_gemma":[0.000005791499,0.0005464158,0.0003370969,0.0003735021,0.000264776,0.0001745274,0.001109184,0.0007985045,0.000002036745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002186065,"about_ca_system_score_gemma":0.0001286733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007919971,"about_ca_topic_score_gemma":0.0000137225,"domain_scores_codex":[0.996978,0.00003850915,0.0005260005,0.001193845,0.0004995112,0.0007640859],"domain_scores_gemma":[0.9983088,0.0003081157,0.0003550145,0.0007992967,0.0001124428,0.0001163814],"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.00005264264,0.0002674611,0.001463008,0.00007810709,0.0001989318,0.000007419697,0.0003090386,0.576355,0.0001031827,0.1296949,0.006840289,0.28463],"study_design_scores_gemma":[0.0002450783,0.00009348235,0.00001037145,0.00004690365,0.00003915546,0.00000229927,4.846364e-7,0.8906439,0.00006293927,0.04415065,0.06411054,0.0005941826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00003014888,0.0003778844,0.9919919,0.00006346872,0.000204847,0.000764581,0.000144023,0.0001454178,0.006277748],"genre_scores_gemma":[0.5342181,0.0000336362,0.4608623,0.000659015,0.001879329,0.0002057625,0.001166693,0.0001388412,0.0008362884],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.534188,"threshold_uncertainty_score":0.9996988,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01887177657334158,"score_gpt":0.2737245092685753,"score_spread":0.2548527326952337,"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."}}