{"id":"W2513211841","doi":"10.1109/tnet.2015.2462772","title":"A Recursive Method for Clock Synchronization in Asymmetric Packet-Based Networks","year":2015,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Time Synchronization Technologies","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Technische Universität Darmstadt","keywords":"Computer science; Network packet; Clock synchronization; Synchronization (alternating current); Offset (computer science); Real-time computing; Protocol (science); Transmission delay; Clock drift; Computer network; Algorithm; Channel (broadcasting)","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.001197938,0.00037624,0.0004218412,0.0009892586,0.0002908896,0.000223595,0.001402518,0.0003781796,0.000006601358],"category_scores_gemma":[0.0001601521,0.0004081376,0.0001608183,0.005372175,0.00006708752,0.0004722303,0.00002569504,0.0005349183,0.00002003131],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007123797,"about_ca_system_score_gemma":0.0002889963,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003257427,"about_ca_topic_score_gemma":0.0001066335,"domain_scores_codex":[0.9969805,0.0003069129,0.0006099224,0.0008645185,0.0004337028,0.0008044785],"domain_scores_gemma":[0.9968086,0.001172742,0.0002824308,0.001236694,0.0003226597,0.0001768531],"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.00002836775,0.00008210997,0.00007785803,0.000008523274,0.00001903181,0.00000469439,0.00007080078,0.6143071,0.000001599601,0.00101379,0.0009302919,0.3834558],"study_design_scores_gemma":[0.001493654,0.0003297135,0.00002915828,0.0001559656,0.00002742036,0.000009786128,0.00004697234,0.9825215,0.0006631979,0.009000588,0.005285934,0.0004360997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00005651025,0.0007911291,0.9931868,0.001218779,0.002647713,0.0009572164,0.000004649878,0.000904982,0.0002321769],"genre_scores_gemma":[0.5013732,0.00008411236,0.4972561,0.0004537371,0.0003594534,0.0003145648,0.00001543068,0.00005811323,0.00008523991],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5013167,"threshold_uncertainty_score":0.999837,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0366477630222541,"score_gpt":0.293136963532105,"score_spread":0.2564892005098509,"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."}}