{"id":"W3009196551","doi":"10.4018/ijssci.2020010104","title":"An Incentive Compatible Mechanism for Replica Placement in Peer-Assisted Content Distribution","year":2020,"lang":"en","type":"article","venue":"International Journal of Software Science and Computational Intelligence","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Replica; Computer science; Content delivery; Incentive; Distributed computing; Content distribution; Latency (audio); Key (lock); Incentive compatibility; The Internet; Peer-to-peer; Content delivery network; Computer network; World Wide Web; Computer security; Telecommunications; Server","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.005167576,0.0007116029,0.001468051,0.0008969764,0.001380339,0.001295474,0.003412893,0.001788288,0.002185209],"category_scores_gemma":[0.01294358,0.0005572421,0.000752623,0.001327935,0.00126501,0.002590953,0.001869523,0.001626914,0.0004717714],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001052637,"about_ca_system_score_gemma":0.00201744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00061634,"about_ca_topic_score_gemma":0.0006308468,"domain_scores_codex":[0.9967512,0.001558933,0.0001939462,0.0005030048,0.0008198695,0.0001730886],"domain_scores_gemma":[0.9936572,0.003441621,0.0007392952,0.0009503272,0.0008953379,0.0003162389],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006013995,0.0004635273,0.001264762,0.0004516508,0.0001718775,0.0005051601,0.0004899236,0.3580573,0.02286705,0.3796789,0.005248723,0.2301997],"study_design_scores_gemma":[0.0001785115,0.0004565956,0.0002148374,0.00002678113,0.00004574718,0.0003628317,0.00004090771,0.9285819,0.00413713,0.05810277,0.007795868,0.00005628664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007891212,0.0001768876,0.99015,0.000158899,0.0000996318,0.0001521808,0.00002099816,0.0001699659,0.001180234],"genre_scores_gemma":[0.4988279,0.0004080016,0.4962735,0.0001470399,0.0002134324,0.0004873155,0.00006436254,0.00006187089,0.00351658],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005167576,"threshold_uncertainty_score":0.02732909,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06765365080020397,"score_gpt":0.3309161150700873,"score_spread":0.2632624642698833,"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."}}