{"id":"W2960183494","doi":"10.1007/978-3-030-25005-8_31","title":"Maximum Clique Exhaustive Search in Circulant k-Hypergraphs","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Clique; Circulant matrix; Computer science; Enhanced Data Rates for GSM Evolution; Pruning; Clique problem; Necklace; Combinatorics; Hypergraph; Algorithm; Binary number; Discrete mathematics; Mathematics; Theoretical computer science; Artificial intelligence; Arithmetic","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008700117,0.0009065125,0.001863729,0.001721579,0.001547441,0.003145909,0.002783976,0.002755068,0.01179968],"category_scores_gemma":[0.008592079,0.001116531,0.0008605853,0.004926415,0.001014641,0.003922231,0.002081152,0.001767318,0.001877951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002144177,"about_ca_system_score_gemma":0.002603606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005080441,"about_ca_topic_score_gemma":0.01235445,"domain_scores_codex":[0.9988368,0.0004379664,0.00004465234,0.000257328,0.0002224061,0.0002008806],"domain_scores_gemma":[0.9940818,0.004628434,0.0002445425,0.0005160654,0.0002905649,0.0002385287],"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.001232162,0.000658502,0.001505174,0.001977321,0.0002698238,0.00056199,0.0005240332,0.3867048,0.009139303,0.2734467,0.06026839,0.2637118],"study_design_scores_gemma":[0.0001645322,0.00006110912,0.0004134895,0.00009585497,0.00005550831,0.00019877,0.0001009677,0.7636187,0.002049832,0.2277718,0.005440305,0.00002922221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2307871,0.004626067,0.6379402,0.003738578,0.0003416637,0.0007287892,0.003471381,0.003034815,0.1153314],"genre_scores_gemma":[0.5874254,0.001882244,0.3650733,0.0007484488,0.0002941423,0.0004334698,0.002957763,0.0007691899,0.04041615],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01179968,"threshold_uncertainty_score":0.03947389,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02460252876132622,"score_gpt":0.2577061898107292,"score_spread":0.233103661049403,"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."}}