{"id":"W2743010497","doi":"10.1007/s11277-017-4587-3","title":"On Erasure Coding in Intermittently Connected Networks","year":2017,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Computer network; Linear network coding; Erasure code; Erasure; Coding (social sciences); Routing (electronic design automation); Geographic routing; Overhead (engineering); Path (computing); Routing protocol; Decoding methods; Distributed computing; Dynamic Source Routing; Network packet; Telecommunications","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.000373989,0.0001663533,0.0002297824,0.00009400963,0.001095924,0.0004431039,0.003972546,0.0001156088,0.00001893633],"category_scores_gemma":[0.0000286874,0.0001670776,0.00008047356,0.0001417954,0.000256622,0.0003666005,0.0009782753,0.0006238205,0.00003174362],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006696101,"about_ca_system_score_gemma":0.00008111554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001087499,"about_ca_topic_score_gemma":0.0003066343,"domain_scores_codex":[0.9987311,0.000154736,0.0002790785,0.0003108403,0.0002077075,0.0003165106],"domain_scores_gemma":[0.9962354,0.0004817042,0.0002143266,0.002852203,0.00009752132,0.0001188777],"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.00004794481,0.0004640473,0.01097222,0.00001321416,0.00006138394,0.00007755327,0.002443979,0.0002145086,0.0000697514,0.6815016,0.003704337,0.3004295],"study_design_scores_gemma":[0.00044354,0.00003791797,0.01148285,0.0001680727,0.00000523231,0.00001368894,0.00008324427,0.9854372,0.000002731392,0.001326908,0.0007975278,0.0002011466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1260343,0.0005640005,0.7961545,0.01622076,0.0008661477,0.0004817758,0.00001944708,0.0003298152,0.05932925],"genre_scores_gemma":[0.9966156,0.0002411801,0.002075572,0.0006787682,0.0000538105,0.00003676859,0.00002329063,0.00001294486,0.0002620764],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9852226,"threshold_uncertainty_score":0.842907,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05292643002263218,"score_gpt":0.3009416010826056,"score_spread":0.2480151710599734,"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."}}