{"id":"W4364374056","doi":"10.48550/arxiv.2101.11168","title":"Using edge cuts to find Euler tours and Euler families in hypergraphs","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Traverse; Hypergraph; Euler's formula; Enhanced Data Rates for GSM Evolution; Mathematics; Combinatorics; Discrete mathematics; Computer science; Mathematical analysis; Artificial intelligence; Geography","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006979227,0.0007589311,0.0006750134,0.002167708,0.001145165,0.001523329,0.0008608284,0.00096778,0.004126927],"category_scores_gemma":[0.006071396,0.0008381918,0.0007674003,0.002352511,0.001232221,0.004634713,0.001828052,0.001448677,0.0006044463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001139513,"about_ca_system_score_gemma":0.001005265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002646415,"about_ca_topic_score_gemma":0.003974881,"domain_scores_codex":[0.9994117,0.0001717382,0.00004181292,0.0001747023,0.0001083596,0.00009157962],"domain_scores_gemma":[0.9971238,0.001614332,0.0003727932,0.000381362,0.0002586238,0.0002490933],"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.0005386887,0.0003393256,0.01331733,0.0006028883,0.0001469856,0.0005922118,0.001622177,0.3001695,0.01608256,0.3030877,0.01029411,0.3532066],"study_design_scores_gemma":[0.00005132317,0.0001465857,0.002410248,0.0001694748,0.00006090036,0.0004541323,0.0008810195,0.5574028,0.01092603,0.4144532,0.01297532,0.00006901145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1972219,0.0005648758,0.7940742,0.0003622959,0.00004226375,0.0002379583,0.0007969201,0.0007930421,0.005906595],"genre_scores_gemma":[0.3289179,0.0005586511,0.6642554,0.0000997833,0.00002970662,0.0001734494,0.001873933,0.0002623919,0.003828879],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004126927,"threshold_uncertainty_score":0.01380599,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.109366819504735,"score_gpt":0.2425757243081295,"score_spread":0.1332089048033945,"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."}}