{"id":"W2157085031","doi":"10.1007/11809678_39","title":"An Edge Ordering Problem of Regular Hypergraphs","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Permutation (music); Conjecture; Hypergraph; Mathematics; Integer (computer science); K-edge; Discrete mathematics; Constant (computer programming); Enhanced Data Rates for GSM Evolution; Physics; Computer science; Quantum mechanics","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.001168191,0.0008639466,0.001360379,0.001371139,0.001771192,0.004184425,0.002010532,0.002654695,0.01140475],"category_scores_gemma":[0.008381175,0.001195745,0.001014326,0.004019406,0.0015488,0.008625655,0.001578459,0.003471398,0.0009726398],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00142606,"about_ca_system_score_gemma":0.001295242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002472716,"about_ca_topic_score_gemma":0.002535934,"domain_scores_codex":[0.9989294,0.0003594625,0.0000662836,0.0002412408,0.0002203007,0.0001832012],"domain_scores_gemma":[0.9936231,0.004554926,0.0003659487,0.000532406,0.0003659436,0.0005577279],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005801302,0.0004781724,0.001465921,0.0008345736,0.00009217028,0.0005775869,0.0008112869,0.05551493,0.004707261,0.8011072,0.02549723,0.1083336],"study_design_scores_gemma":[0.00007999443,0.00004740833,0.0004343947,0.00007213612,0.00003362857,0.0001955889,0.0003440961,0.05927176,0.001517575,0.9285998,0.009381817,0.00002170669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.4291933,0.00329934,0.4322082,0.00781767,0.0005239938,0.000428386,0.002792826,0.000618792,0.1231175],"genre_scores_gemma":[0.6638268,0.005137635,0.2637505,0.0009175397,0.001015553,0.0002884428,0.004667038,0.0006314878,0.05976498],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.01140475,"threshold_uncertainty_score":0.03815269,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006256702997084994,"score_gpt":0.1888251021929687,"score_spread":0.1825683991958837,"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."}}