{"id":"W2965297251","doi":"10.1007/s11036-019-01325-4","title":"Secure Data Sharing Framework via Hierarchical Greedy Embedding in Darknets","year":2019,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Embedding; Scalability; Greedy algorithm; Node (physics); Computer network; Routing (electronic design automation); Distributed computing; Tree (set theory); Topology (electrical circuits); Routing table; Theoretical computer science; Routing protocol; Algorithm; Database; Mathematics","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.0003976621,0.0001413594,0.0002106976,0.00007645824,0.0001348876,0.0002291508,0.001498266,0.0001239076,0.00003750424],"category_scores_gemma":[0.000006193902,0.0001321167,0.00003966442,0.0005049092,0.00003377491,0.0002688813,0.001061205,0.0004676219,0.00002884578],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000196259,"about_ca_system_score_gemma":0.00001347267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001409725,"about_ca_topic_score_gemma":0.00004514755,"domain_scores_codex":[0.9983893,0.00002838908,0.0003028068,0.0008141933,0.0001491825,0.0003161519],"domain_scores_gemma":[0.998736,0.000154977,0.00008215765,0.0009097146,0.00002618903,0.0000909229],"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.00000238572,0.00008108136,0.003385978,0.00001545246,0.00002491967,0.000003264541,0.0002503099,0.5060426,0.000009311651,0.4313625,0.0003110004,0.05851125],"study_design_scores_gemma":[0.00009446235,0.00001685476,0.0004973616,0.00005048235,0.000006798411,0.000006909699,0.00003521091,0.9893222,8.224689e-7,0.0008215639,0.008994381,0.0001529123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02098338,0.0005384928,0.9773458,0.0001370615,0.00008460405,0.0003931061,0.000002972857,0.00007724779,0.0004373289],"genre_scores_gemma":[0.9920529,0.00007095797,0.007137873,0.0002124444,0.000255566,0.0001366497,0.00005123456,0.00001190389,0.0000704817],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9710695,"threshold_uncertainty_score":0.5387563,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0135218576971147,"score_gpt":0.2778223182463977,"score_spread":0.264300460549283,"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."}}