{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001162599,0.0005548251,0.000697783,0.001203327,0.001144762,0.001140342,0.001272921,0.0006479878,0.002286694],"category_scores_gemma":[0.003162327,0.0003683557,0.0004513606,0.001941934,0.0007548209,0.00211543,0.001021355,0.0005475247,0.0006991069],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009154977,"about_ca_system_score_gemma":0.0009636134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001187817,"about_ca_topic_score_gemma":0.001989861,"domain_scores_codex":[0.9990972,0.0002423153,0.00006576403,0.0001550898,0.0003311767,0.000108376],"domain_scores_gemma":[0.9974295,0.001414372,0.0002819929,0.0004588728,0.0003148752,0.0001003613],"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.001070609,0.0003145959,0.0032646,0.0004640137,0.0001006506,0.000283409,0.0005748688,0.2344908,0.03999321,0.06695608,0.006957502,0.6455296],"study_design_scores_gemma":[0.0003344918,0.0003631814,0.001308348,0.00004479065,0.00003902602,0.0003964969,0.0003479566,0.8602238,0.04450066,0.08092143,0.0114704,0.00004929764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0446519,0.000168221,0.9518465,0.0001191897,0.00002589301,0.0002105264,0.00009643163,0.001478831,0.001402465],"genre_scores_gemma":[0.2759635,0.0002955977,0.7193686,0.00008193881,0.00004200828,0.00043477,0.0004278454,0.0001166549,0.003269051],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002286694,"threshold_uncertainty_score":0.007649779,"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."}}