{"id":"W2790384754","doi":"10.1109/infocom.2018.8485912","title":"Fast and Reliable Tag Search in Large-Scale RFID Systems: A Probabilistic Tree-based Approach","year":2018,"lang":"en","type":"article","venue":"","topic":"RFID technology advancements","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scalability; Hash function; Bottleneck; Probabilistic logic; Node (physics); Reliability (semiconductor); Consistent hashing; Tree (set theory); Search tree; Hash tree; Hash table; Theoretical computer science; Search algorithm; Algorithm; Double hashing; Database; Embedded system; Computer security; Mathematics; Artificial intelligence","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.001664435,0.0005104299,0.001133423,0.001107306,0.0009331845,0.001035995,0.002261905,0.00129244,0.00169889],"category_scores_gemma":[0.006423168,0.0007136345,0.0008353159,0.001897554,0.001119677,0.003195542,0.00153214,0.0009158633,0.0005380779],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001023459,"about_ca_system_score_gemma":0.001825671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003186651,"about_ca_topic_score_gemma":0.003414348,"domain_scores_codex":[0.9989496,0.0002858859,0.00005399,0.0001625318,0.0003938738,0.0001540965],"domain_scores_gemma":[0.9944089,0.003689545,0.0004837119,0.0005940375,0.0006475114,0.0001763382],"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.0001204629,0.00003411756,0.001138883,0.0001271756,0.00003707005,0.0001030118,0.0001258228,0.9210715,0.005669495,0.02825589,0.001071194,0.04224546],"study_design_scores_gemma":[0.000005279365,0.00002621384,0.00007437615,0.000003439784,0.000005978934,0.00004356577,0.00001107233,0.9910464,0.0005505977,0.007914168,0.0003119597,0.000006993335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0119302,0.0003197306,0.986569,0.0001168426,0.00001192232,0.00003008584,0.0000411712,0.0002836817,0.0006973124],"genre_scores_gemma":[0.6702353,0.0006413223,0.3266641,0.0001385372,0.0000525511,0.000120733,0.0001778011,0.0001135492,0.001856063],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003186651,"threshold_uncertainty_score":0.008802474,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009918121163839156,"score_gpt":0.2201675843852608,"score_spread":0.2102494632214216,"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."}}