{"id":"W1545073706","doi":"10.1007/978-3-540-24596-4_10","title":"Efficient Algorithm for Embedding Hypergraphs in a Cycle","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Hypergraph; Embedding; Computer science; Computation; Algorithm; Approximation algorithm; Theoretical computer science; Discrete mathematics; Mathematics; Artificial intelligence","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.0004645036,0.001418114,0.001168723,0.001631874,0.001014381,0.002084162,0.002196552,0.0013569,0.01672853],"category_scores_gemma":[0.002039936,0.000842109,0.0009423107,0.002500808,0.0006114245,0.003558314,0.002775377,0.001361036,0.004046008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001264074,"about_ca_system_score_gemma":0.001901922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003330327,"about_ca_topic_score_gemma":0.006599346,"domain_scores_codex":[0.9994005,0.0001183375,0.00004114137,0.00018116,0.0001537657,0.0001050909],"domain_scores_gemma":[0.9990262,0.0003531069,0.00005663634,0.0002973146,0.0001965216,0.00007015967],"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.0004538666,0.0002860645,0.0008107687,0.0005971092,0.0001004485,0.0001736226,0.0003063829,0.05138889,0.01672209,0.0444354,0.02659309,0.8581322],"study_design_scores_gemma":[0.0004859328,0.0003699331,0.0008721511,0.0001290459,0.0001933429,0.0004958715,0.0005231417,0.720403,0.02875951,0.2094049,0.03827772,0.00008561312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03412895,0.0004511275,0.9465568,0.0004373341,0.000119298,0.0004027985,0.0007883572,0.005721949,0.01139326],"genre_scores_gemma":[0.1005786,0.0002903099,0.8861507,0.00009962497,0.00003872604,0.0003416437,0.002038909,0.0004872173,0.00997428],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01672853,"threshold_uncertainty_score":0.0559625,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01249321993447994,"score_gpt":0.2465190325103691,"score_spread":0.2340258125758891,"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."}}