{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001230487,0.0008953328,0.001074393,0.001872494,0.001708642,0.003159387,0.001602222,0.0009852026,0.009592341],"category_scores_gemma":[0.005458089,0.0007010183,0.00112711,0.00271469,0.002221571,0.007568812,0.005477573,0.002871934,0.001435683],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001850567,"about_ca_system_score_gemma":0.001254716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009189261,"about_ca_topic_score_gemma":0.001794707,"domain_scores_codex":[0.9986405,0.0002723462,0.00009809588,0.0001984579,0.0004828384,0.0003077642],"domain_scores_gemma":[0.9968356,0.001335439,0.0001312631,0.001089747,0.0003944832,0.0002133491],"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.000136242,0.00005141893,0.0003142997,0.0001312908,0.00001193674,0.00004133046,0.0002859015,0.004140942,0.002465962,0.9422963,0.003554339,0.04656997],"study_design_scores_gemma":[0.00002239198,0.0000310651,0.00009276246,0.00005115243,0.00002033679,0.00003876622,0.0001109777,0.01612475,0.004887113,0.9678456,0.01075568,0.00001940592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1593246,0.001366219,0.7821463,0.001688164,0.0002724782,0.0002855071,0.0009613514,0.002106845,0.05184841],"genre_scores_gemma":[0.7620946,0.001264649,0.2092257,0.0005696059,0.000178266,0.0004386061,0.001491794,0.001200102,0.02353661],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009592341,"threshold_uncertainty_score":0.03208965,"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."}}