{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001534937,0.0007304975,0.0008660584,0.002345552,0.000226146,0.000582476,0.005411704,0.0005053627,0.00004507925],"category_scores_gemma":[0.00005177656,0.0007042629,0.0002582458,0.001702123,0.001042591,0.00070502,0.002567983,0.002000456,0.0001385573],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004495918,"about_ca_system_score_gemma":0.001205215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001408706,"about_ca_topic_score_gemma":0.0002498008,"domain_scores_codex":[0.9941009,0.00007300393,0.0007294884,0.002420967,0.001469822,0.001205839],"domain_scores_gemma":[0.9965665,0.0005906224,0.0002145464,0.002114345,0.0002812194,0.0002327899],"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.0000188463,0.0001284642,0.001216648,0.0001407624,0.0000297058,0.0007361816,0.001998931,0.042789,0.0001670309,0.1993967,0.0000286904,0.7533491],"study_design_scores_gemma":[0.0005888621,0.0002954823,0.002015852,0.0008298939,0.000006175169,0.0001829707,8.433832e-7,0.4856455,0.000623194,0.5072906,0.001269271,0.001251366],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004881233,0.0005548349,0.9881023,0.0007728047,0.002364427,0.0007139048,0.00001091273,0.0001637813,0.006828974],"genre_scores_gemma":[0.4668774,0.0003646152,0.5271795,0.003620579,0.0008288205,0.00003173122,0.00002186465,0.0001220822,0.0009534011],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7520977,"threshold_uncertainty_score":0.9999695,"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."}}