{"id":"W2524854129","doi":"10.1109/iwcmc.2016.7577057","title":"Towards a smart universe: One droplet at a time","year":2016,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fountain code; Computer science; Code (set theory); Overhead (engineering); Network packet; Luby transform code; Theoretical computer science; Transmission (telecommunications); Unavailability; Degree distribution; Algorithm; Scalability; Set (abstract data type); Bit error rate; Computer engineering; Decoding methods; Block code; Computer network; Mathematics; Telecommunications; Concatenated error correction code","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.0009083447,0.0002902068,0.0004716296,0.0004974171,0.001392455,0.003117236,0.0008676192,0.002700269,0.003499587],"category_scores_gemma":[0.002269764,0.0002592816,0.0002941562,0.0005437993,0.003971032,0.01263632,0.004175927,0.003321225,0.001605969],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000898389,"about_ca_system_score_gemma":0.0009121617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005191752,"about_ca_topic_score_gemma":0.0005453712,"domain_scores_codex":[0.9994518,0.0001486856,0.00001730897,0.00009163282,0.000194137,0.00009645967],"domain_scores_gemma":[0.9993661,0.0001257337,0.00005169505,0.0001721403,0.0001234143,0.000160858],"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.00009481141,0.00005584902,0.0009343631,0.0001961165,0.00001752562,0.0002888174,0.001916135,0.00218492,0.01118792,0.8184067,0.02094588,0.143771],"study_design_scores_gemma":[0.00001829998,0.0001263789,0.0005186863,0.0002452192,0.0000183837,0.000648952,0.00189867,0.01061427,0.00881063,0.5158799,0.4611549,0.00006573833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1140881,0.06492662,0.4484575,0.1464391,0.006201542,0.0001312844,0.00024611,0.001937866,0.2175718],"genre_scores_gemma":[0.7139513,0.02673276,0.1696249,0.02123491,0.002073577,0.000124937,0.0001889151,0.0004716475,0.06559696],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003499587,"threshold_uncertainty_score":0.01170731,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01613831076678904,"score_gpt":0.2277708773785943,"score_spread":0.2116325666118053,"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."}}