{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001438361,0.0004701783,0.0005910873,0.001133343,0.00023853,0.0004700548,0.001893567,0.0003324124,0.000008515979],"category_scores_gemma":[0.0000403752,0.0004352216,0.000212672,0.0007838155,0.0002385052,0.0001865528,0.0004105377,0.0005759661,0.00001353513],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003752666,"about_ca_system_score_gemma":0.0002186297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002742425,"about_ca_topic_score_gemma":0.00007303246,"domain_scores_codex":[0.9963205,0.00004774826,0.0006688149,0.001518602,0.0006393808,0.0008049172],"domain_scores_gemma":[0.9979829,0.0004732933,0.0002493262,0.0009364046,0.0002210927,0.0001369862],"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.00000224627,0.00003140735,0.000008562747,0.00002274831,0.000007017886,0.00003635751,0.0005346205,0.4528931,0.0000168788,0.0224781,0.00004015477,0.5239288],"study_design_scores_gemma":[0.0003526671,0.0001217204,0.000007046536,0.0003902664,0.000002844471,0.00008040649,4.061895e-7,0.9569358,0.0001080196,0.03810355,0.003409745,0.0004875717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009218363,0.0004277829,0.991613,0.0002561889,0.004778439,0.0006858378,0.000004689387,0.00009468898,0.002047215],"genre_scores_gemma":[0.07650525,0.00001915536,0.9201465,0.002011021,0.000694423,0.00007320526,0.000003394072,0.00005840795,0.0004886526],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5234413,"threshold_uncertainty_score":0.99981,"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."}}