{"id":"W2957673928","doi":"10.1109/icc.2019.8762080","title":"A Distributed Graph-Based Dense RFID Readers Arrangement Algorithm","year":2019,"lang":"en","type":"article","venue":"","topic":"RFID technology advancements","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Radio-frequency identification; Internet of Things; Algorithm; Key (lock); Graph; Distributed algorithm; Set (abstract data type); Distributed computing; Theoretical computer science; World Wide Web; Computer security","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.0004986607,0.0009993397,0.001352659,0.001010051,0.0009913212,0.0009236179,0.002987738,0.00109044,0.004370106],"category_scores_gemma":[0.001540321,0.0005286182,0.0006865312,0.001725104,0.0006038886,0.001637146,0.001822688,0.0008641153,0.001248322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001143592,"about_ca_system_score_gemma":0.002187496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005286742,"about_ca_topic_score_gemma":0.005913605,"domain_scores_codex":[0.9991844,0.0001215892,0.00003993618,0.0002642259,0.000273513,0.0001163898],"domain_scores_gemma":[0.9991928,0.000224796,0.00008875789,0.0001601842,0.0002455253,0.000088001],"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.000246107,0.0002338208,0.001097383,0.0001633391,0.00007209193,0.0001659094,0.0001266424,0.6887332,0.006738889,0.01690131,0.008363145,0.2771581],"study_design_scores_gemma":[0.00007843029,0.00006298926,0.000161377,0.000005267311,0.00001572692,0.00007966441,0.00002518061,0.9887977,0.001291574,0.006689404,0.002779974,0.00001268854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01345708,0.0001838249,0.9816301,0.0002034749,0.00007646633,0.0001514299,0.0001135838,0.001116855,0.003067098],"genre_scores_gemma":[0.2642356,0.0002331479,0.7263425,0.0002182695,0.00006502681,0.0003197684,0.0007604257,0.0001507398,0.007674548],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005286742,"threshold_uncertainty_score":0.01461941,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005760154200683616,"score_gpt":0.1988488213695538,"score_spread":0.1930886671688702,"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."}}