{"id":"W1993479987","doi":"10.1109/lcomm.2013.100713.131727","title":"Blind Synchronization in Diffusion-Based Molecular Communication Channels","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Molecular Communication and Nanonetworks","field":"Engineering","cited_by":105,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University; University of Calgary","funders":"","keywords":"Molecular communication; Synchronization (alternating current); Computer science; Channel (broadcasting); Overhead (engineering); Algorithm; Upper and lower bounds; Communications system; Throughput; Diffusion; Computer network; Telecommunications; Transmitter; Mathematics; Wireless","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002254225,0.000208622,0.0001938021,0.0003340202,0.0001798646,0.0001206278,0.001712637,0.0001289754,0.0001048325],"category_scores_gemma":[0.00003030149,0.0002459156,0.00007528017,0.0007549032,0.0001564714,0.0002389255,0.0001567115,0.000470105,0.0002149302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001760142,"about_ca_system_score_gemma":0.00002280585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001416345,"about_ca_topic_score_gemma":0.00008017485,"domain_scores_codex":[0.998575,0.0003418669,0.000458624,0.0001641945,0.000176175,0.0002840818],"domain_scores_gemma":[0.9959204,0.0002119441,0.00007925653,0.003610886,0.00009041653,0.00008709617],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001170087,0.0004211908,0.001943205,0.00007876881,0.00008539735,0.000003756469,0.0009076527,0.7413969,0.2130929,0.001832051,0.01375263,0.02647383],"study_design_scores_gemma":[0.0009767667,0.00000910086,0.0012051,0.0001306151,0.0000141412,0.000002305977,0.00004488154,0.9886706,0.003226174,0.0002073332,0.005136492,0.0003764763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5896913,0.005744058,0.3700041,0.02423128,0.0003935709,0.002045362,0.000007421395,0.0009778419,0.006904997],"genre_scores_gemma":[0.9844438,0.0007920333,0.01194826,0.001954994,0.00001474604,0.0005369713,0.0002329956,0.0000601165,0.00001608391],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3947525,"threshold_uncertainty_score":0.9999993,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01226211930837026,"score_gpt":0.222581318205993,"score_spread":0.2103191988976228,"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."}}