{"id":"W2090919369","doi":"10.1142/s0129054103002229","title":"EFFICIENT ALGORITHMS FOR SELECTION AND SORTING OF LARGE DISTRIBUTED FILES ON DE BRUIJN AND HYPERCUBE STRUCTURES","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quicksort; De Bruijn sequence; Computer science; Sorting; Hypercube; Cardinality (data modeling); Algorithm; Set (abstract data type); Sorting algorithm; Communication complexity; Selection (genetic algorithm); Selection algorithm; Node (physics); Theoretical computer science; Parallel computing; Mathematics; Discrete mathematics; Data mining","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009477245,0.00007859015,0.0001567134,0.0002486274,0.0001381527,0.0001745643,0.0005384872,0.00002522435,0.000001761246],"category_scores_gemma":[0.0002511953,0.00006783749,0.00004851238,0.0003015578,0.000133718,0.0003161155,0.00007093487,0.00007105155,1.070107e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005952153,"about_ca_system_score_gemma":0.0002228695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006940774,"about_ca_topic_score_gemma":0.00000189224,"domain_scores_codex":[0.9987321,0.00003553426,0.0004444279,0.0001706755,0.0004715997,0.0001455906],"domain_scores_gemma":[0.9980038,0.0001764165,0.0005013127,0.0001002933,0.001149541,0.00006865508],"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.00005160047,0.0004403312,0.00537686,0.00005654854,0.0001374841,0.000006349561,0.001587877,0.1257404,0.0138487,0.7549595,0.000278015,0.09751634],"study_design_scores_gemma":[0.000882181,0.0003069264,0.02498774,0.0001333268,0.0000090012,0.0003146515,0.0000494005,0.9564446,0.008720854,0.007043812,0.0009952028,0.0001123464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3006561,0.00004060356,0.698584,0.0001932898,0.0004199136,0.00005630673,0.00002817962,0.00000447166,0.00001716312],"genre_scores_gemma":[0.8639729,0.000004725014,0.1359307,0.00003264289,0.0000519361,0.000001308787,0.000001737797,0.000002046356,0.000001989576],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8307042,"threshold_uncertainty_score":0.2766333,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01552179256509548,"score_gpt":0.3087336153858631,"score_spread":0.2932118228207676,"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."}}