{"id":"W2130150993","doi":"10.1109/tpds.2006.34","title":"Efficient algorithms for minimum congestion hypergraph embedding in a cycle","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Hypergraph; Embedding; Computer science; Algorithm; Node (physics); Computational complexity theory; Approximation algorithm; Set (abstract data type); Enhanced Data Rates for GSM Evolution; Time complexity; Mathematics; Discrete mathematics","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":[],"consensus_categories":[],"category_scores_codex":[0.0003450236,0.0001971124,0.0002932481,0.0002004427,0.0002550586,0.0002121815,0.0001792661,0.0001395784,0.000001754378],"category_scores_gemma":[0.00000315757,0.0001809081,0.0001132706,0.0003847946,0.00003360511,0.0001126714,0.000001912388,0.0001323946,0.000007373816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008719607,"about_ca_system_score_gemma":0.00002420729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005744669,"about_ca_topic_score_gemma":0.0001034911,"domain_scores_codex":[0.9984213,0.0001010387,0.0004912895,0.0004486692,0.000189216,0.0003484673],"domain_scores_gemma":[0.9992852,0.0001755312,0.0001078985,0.0002523592,0.00009536703,0.00008367959],"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.00003302177,0.0001538196,0.00002840303,0.00003832064,0.00001499361,0.000005590189,0.00008049631,0.9949277,0.0001476544,0.003466479,0.0003250121,0.0007784932],"study_design_scores_gemma":[0.001178106,0.0001239699,0.0002075442,0.0001129529,0.00000959567,0.00005723161,0.0001675004,0.996945,0.00003725063,0.0001921939,0.0007513317,0.0002172812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04124326,0.0002458713,0.9556183,0.0001479912,0.001753025,0.0006021485,0.0001214686,0.0001376579,0.0001302797],"genre_scores_gemma":[0.9982496,0.000008574003,0.001045268,0.00001969802,0.000101802,0.0003468826,0.00001853973,0.00001103104,0.0001986123],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9570063,"threshold_uncertainty_score":0.7377219,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01537991793278134,"score_gpt":0.2475555644455234,"score_spread":0.232175646512742,"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."}}