{"id":"W3037080634","doi":"10.1016/j.disc.2020.112022","title":"Efficient universal cycle constructions for weak orders","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Science and ICT, South Korea","keywords":"Mathematics; Transitive relation; Combinatorics; Rank (graph theory); Order (exchange); Construct (python library); Discrete mathematics; Event (particle physics); Computer science","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.00005972762,0.00009638882,0.0001277378,0.0000261612,0.0001540942,0.00008933029,0.000460792,0.00003132592,0.00001807302],"category_scores_gemma":[0.00005491961,0.00008073853,0.00006365667,0.0001795033,0.00004789216,0.00009832898,0.0002295208,0.00005900248,0.00003481506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001338024,"about_ca_system_score_gemma":0.0000364362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003750818,"about_ca_topic_score_gemma":4.518857e-7,"domain_scores_codex":[0.9993002,0.00001016857,0.0001550469,0.0002146142,0.0001541332,0.0001658543],"domain_scores_gemma":[0.9993891,0.00008407771,0.00007286527,0.0002944725,0.00004749087,0.0001120307],"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.000005751155,0.00006623773,0.000008595303,0.0001086799,0.00002793608,0.000003353097,0.003515878,0.007158964,0.0004230052,0.9791291,0.004448854,0.005103696],"study_design_scores_gemma":[0.0002952471,0.00004407544,0.000005376278,0.00001836882,0.0000097071,0.000005155384,0.0008000508,0.9857349,0.0001901632,0.005541553,0.007238384,0.0001169947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004143951,0.00001485862,0.9915493,0.001541377,0.0001453003,0.0002128326,0.0000434342,0.0001497843,0.002199185],"genre_scores_gemma":[0.1534907,0.000002557471,0.8461171,0.0002064662,0.00007700506,0.00001342302,0.0000155837,0.00001404771,0.00006314054],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9785759,"threshold_uncertainty_score":0.3292422,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01755885139374569,"score_gpt":0.245885462813229,"score_spread":0.2283266114194833,"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."}}