{"id":"W3122005880","doi":"10.1016/j.disc.2023.113537","title":"Using edge cuts to find Euler tours and Euler families in hypergraphs","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Mathematics; Euler's formula; Traverse; Enhanced Data Rates for GSM Evolution; Combinatorics; Euler characteristic; Discrete mathematics; Computer science; Mathematical analysis; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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.0001729068,0.0001073837,0.000139152,0.0002948712,0.0000692226,0.0001199652,0.0001619252,0.00004198793,0.00001672598],"category_scores_gemma":[0.0001021855,0.0000994627,0.0000287812,0.0007634459,0.00003196588,0.0002147968,0.0001539501,0.00006398607,0.00004687261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001900909,"about_ca_system_score_gemma":0.00002358284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001255738,"about_ca_topic_score_gemma":0.00002693611,"domain_scores_codex":[0.9992224,0.00002093716,0.0002006301,0.000204274,0.0001586557,0.0001931001],"domain_scores_gemma":[0.9995043,0.0001182077,0.00004374379,0.0002327322,0.00002908679,0.00007195281],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002422141,0.0002829984,0.05064571,0.0008571834,0.0001530612,0.0001695436,0.1338011,0.0695492,0.02090649,0.5256294,0.008167203,0.1898138],"study_design_scores_gemma":[0.0003531392,0.00002776765,0.0311558,0.0001491639,0.000009718317,0.00002285968,0.001767798,0.9565844,0.0004207079,0.008614814,0.0005419033,0.0003519133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5523633,0.00001732552,0.4434845,0.000774,0.0002760476,0.0002056188,0.000005528245,0.0001647996,0.002708893],"genre_scores_gemma":[0.7387111,0.00005917685,0.260453,0.0002119603,0.00003092936,0.00001539195,0.000005564102,0.00002163616,0.000491286],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8870352,"threshold_uncertainty_score":0.4055971,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03766042132327078,"score_gpt":0.2887181465537514,"score_spread":0.2510577252304806,"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."}}