{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:42Z","timestamp":1750306962170,"version":"3.41.0"},"reference-count":75,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2013,6,1]],"date-time":"2013-06-01T00:00:00Z","timestamp":1370044800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100006751","name":"U.S. Army","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006751","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA95500610405"],"award-info":[{"award-number":["FA95500610405"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF0910206"],"award-info":[{"award-number":["W911NF0910206"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N000140910685"],"award-info":[{"award-number":["N000140910685"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Logic"],"published-print":{"date-parts":[[2013,6]]},"abstract":"<jats:p>\n            There has been extensive work in many different fields on how phenomena of interest (e.g., diseases, innovation, product adoption) \u201cdiffuse\u201d through a social network. As social networks increasingly become a fabric of society, there is a need to make \u201coptimal\u201d decisions with respect to an observed model of diffusion. For example, in epidemiology, officials want to find a set of\n            <jats:italic>k<\/jats:italic>\n            individuals in a social network which, if treated, would minimize spread of a disease. In marketing, campaign managers try to identify a set of\n            <jats:italic>k<\/jats:italic>\n            customers that, if given a free sample, would generate maximal \u201cbuzz\u201d about the product. In this article, we first show that the well-known Generalized Annotated Program (GAP) paradigm can be used to express many existing diffusion models. We then define a class of problems called\n            <jats:italic>Social Network Diffusion Optimization Problems<\/jats:italic>\n            (SNDOPs). SNDOPs have four parts: (i) a diffusion model expressed as a GAP, (ii) an objective function we want to optimize with respect to a given diffusion model, (iii) an integer\n            <jats:italic>k<\/jats:italic>\n            \u2009&gt;\u20090 describing resources (e.g., medication) that can be placed at nodes, (iv) a logical condition\n            <jats:italic>VC<\/jats:italic>\n            that governs which nodes can have a resource (e.g., only children above the age of 5 can be treated with a given medication). We study the computational complexity of SNDOPs and show both NP-completeness results as well as results on complexity of approximation. We then develop an exact and a heuristic algorithm to solve a large class of SNDOPproblems and show that our GREEDY-SNDOPs algorithm achieves the best possible approximation ratio that a polynomial algorithm can achieve (unless\n            <jats:bold>P<\/jats:bold>\n            \u2009=\u2009\n            <jats:bold>NP<\/jats:bold>\n            ). We conclude with a prototype experimental implementation to solve SNDOPs that looks at a real-world Wikipedia dataset consisting of over 103,000 edges.\n          <\/jats:p>","DOI":"10.1145\/2480759.2480762","type":"journal-article","created":{"date-parts":[[2013,6,18]],"date-time":"2013-06-18T12:36:08Z","timestamp":1371558968000},"page":"1-40","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Using Generalized Annotated Programs to Solve Social Network Diffusion Optimization Problems"],"prefix":"10.1145","volume":"14","author":[{"given":"Paulo","family":"Shakarian","sequence":"first","affiliation":[{"name":"United States Military Academy West Point"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Broecheler","sequence":"additional","affiliation":[{"name":"University of Maryland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. S.","family":"Subrahmanian","sequence":"additional","affiliation":[{"name":"University of Maryland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cristian","family":"Molinaro","sequence":"additional","affiliation":[{"name":"Universit\u00e0 della Calabria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1038\/280361a0"},{"volume-title":"Principles of Constraint Programming","author":"Apt K.","key":"e_1_2_2_2_1","unstructured":"Apt , K. 2003. Principles of Constraint Programming . Cambridge University Press . Apt, K. 2003. Principles of Constraint Programming. Cambridge University Press."},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0908800106"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150412"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0888-613X(87)90005-3"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2005.11.005"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/SocialCom.2010.49"},{"key":"e_1_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Centola D. 2010. The spread ofbehavior in an online social network experiment.. Science 329 5996 1194--1197.  Centola D. 2010. The spread ofbehavior in an online social network experiment.. Science 329 5996 1194--1197.","DOI":"10.1126\/science.1185231"},{"key":"e_1_2_2_9_1","doi-asserted-by":"crossref","unstructured":"Centola D. 2011. An experimental study of homophily in the adoption of health behavior. Science 334 6060 1269--72.  Centola D. 2011. An experimental study of homophily in the adoption of health behavior. Science 334 6060 1269--72.","DOI":"10.1126\/science.1207055"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1397735.1397739"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526806"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/08073617X"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835934"},{"key":"e_1_2_2_14_1","volume-title":"-G","author":"Chiang C.-Y.","year":"2011","unstructured":"Chiang , C.-Y. , Huang , L.-H. , Li , B.-J. , Wu , J. , and Yeh , H . -G . 2011 . Some results on the target set selection problem. CoRR abs\/1111.6685. Chiang, C.-Y., Huang, L.-H., Li, B.-J., Wu, J., and Yeh, H.-G. 2011. Some results on the target set selection problem. CoRR abs\/1111.6685."},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1186\/1751-0473-3-3"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jedc.2003.04.002"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/646399.691325"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(99)00059-X"},{"volume-title":"Proceedings of the Conference on Uncertainty in Artificial Intelligence. 160--169","author":"Dekhtyar M. I.","key":"e_1_2_2_19_1","unstructured":"Dekhtyar , M. I. , Dekhtyar , A. , and Subrahmanian , V. S . 1999. Hybrid probabilistic programs: Algorithms and complexity . In Proceedings of the Conference on Uncertainty in Artificial Intelligence. 160--169 . Dekhtyar, M. I., Dekhtyar, A., and Subrahmanian, V. S. 1999. Hybrid probabilistic programs: Algorithms and complexity. In Proceedings of the Conference on Uncertainty in Artificial Intelligence. 160--169."},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.09.012"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0888-613X(90)90006-N"},{"volume-title":"Proceedings of the European Conference on Symbolic and Quantifative Approaches to Reasoning with Uncertainty. 53--57","author":"Dubois D.","key":"e_1_2_2_22_1","unstructured":"Dubois , D. , Lang , J. , and Prade , H . 1991. A brief overview of possibilistic logic . In Proceedings of the European Conference on Symbolic and Quantifative Approaches to Reasoning with Uncertainty. 53--57 . Dubois, D., Lang, J., and Prade, H. 1991. A brief overview of possibilistic logic. In Proceedings of the European Conference on Symbolic and Quantifative Approaches to Reasoning with Uncertainty. 53--57."},{"volume-title":"Proceedings of the International Conference on Social and Behavioral Computing. Springer Verlag, 79--88","author":"Eagle N.","key":"e_1_2_2_23_1","unstructured":"Eagle , N. , Pentland , A. , and Lazer , D . 2008. Mobile phone data for inferring social network structure . In Proceedings of the International Conference on Social and Behavioral Computing. Springer Verlag, 79--88 . Eagle, N., Pentland, A., and Lazer, D. 2008. Mobile phone data for inferring social network structure. In Proceedings of the International Conference on Social and Behavioral Computing. Springer Verlag, 79--88."},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/200836.200838"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/646398.691170"},{"volume-title":"Proceedings of the 5th Internationa1 Conference and Symposium on Logic Programming. 993--1005","author":"Falaschi M.","key":"e_1_2_2_26_1","unstructured":"Falaschi , M. , Levi , G. , Martelli , M. , and Palamidessi , C . 1988. A new declarative semantics for logic languages . In Proceedings of the 5th Internationa1 Conference and Symposium on Logic Programming. 993--1005 . Falaschi, M., Levi, G., Martelli, M., and Palamidessi, C. 1988. A new declarative semantics for logic languages. In Proceedings of the 5th Internationa1 Conference and Symposium on Logic Programming. 993--1005."},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/646450.692774"},{"key":"e_1_2_2_29_1","unstructured":"Garey M. R. and Johnson D. S. 1979. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co. New York NY USA.   Garey M. R. and Johnson D. S. 1979. Computers and Intractability; A Guide to the Theory of NP-Completeness . W. H. Freeman & Co. New York NY USA."},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00207-3"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1086\/226707"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/0025-5564(76)90132-2"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/2283516.2283551"},{"key":"e_1_2_2_34_1","first-page":"69","article-title":"Diffusion on social networks","volume":"16","author":"Jackson M.","year":"2005","unstructured":"Jackson , M. and Yariv , L. 2005 . Diffusion on social networks . In Economie Publique , vol. 16. 69 -- 82 . Jackson, M. and Yariv, L. 2005. Diffusion on social networks. In Economie Publique, vol. 16. 69--82.","journal-title":"Economie Publique"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2004.04.003"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-008-9089-2"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00245460"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(92)90007-P"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400214.1400232"},{"volume-title":"The Design and Analysis of Algorithms","author":"Kozen D.","key":"e_1_2_2_41_1","unstructured":"Kozen , D. 1991. The Design and Analysis of Algorithms . Springer . Kozen, D. 1991. The Design and Analysis of Algorithms. Springer."},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.fss.2003.10.019"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.1269672"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1232722.1232727"},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772756"},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"volume-title":"Foundations of logic Programming","author":"Lloyd J. W.","key":"e_1_2_2_47_1","unstructured":"Lloyd , J. W. 1987. Foundations of logic Programming . Springer . Lloyd, J. W. 1987. Foundations of logic Programming. Springer."},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/6.6.755"},{"volume-title":"Proceedings of the 23rd International Symposium on Multiple-Valued Logic. 48--53","author":"Lu J.","key":"e_1_2_2_49_1","unstructured":"Lu , J. , Murray , N. , and Rosenthal , E . 1993. Signed formulas and annotated logics . In Proceedings of the 23rd International Symposium on Multiple-Valued Logic. 48--53 . Lu, J., Murray, N., and Rosenthal, E. 1993. Signed formulas and annotated logics. In Proceedings of the 23rd International Symposium on Multiple-Valued Logic. 48--53."},{"key":"e_1_2_2_50_1","volume-title":"Proceedings of the European Conference on Artificial Intelligence (ECAI\u201998)","author":"Lukasiewicz T.","year":"1998","unstructured":"Lukasiewicz , T. 1998 . Probabilistic logic programming . In Proceedings of the European Conference on Artificial Intelligence (ECAI\u201998) . 388--392. Lukasiewicz, T. 1998. Probabilistic logic programming. In Proceedings of the European Conference on Artificial Intelligence (ECAI\u201998). 388--392."},{"volume-title":"Proceedings of the 10th International Workshop on Database and Expert Systems Applications (DEXA\u201999)","author":"Mancarella P.","key":"e_1_2_2_51_1","unstructured":"Mancarella , P. , Raffaet\u00e0 , A. , and Turini , F . 1999. Temporal annotated constraint logic programming with multiple theories . In Proceedings of the 10th International Workshop on Database and Expert Systems Applications (DEXA\u201999) . Mancarella, P., Raffaet\u00e0, A., and Turini, F. 1999. Temporal annotated constraint logic programming with multiple theories. In Proceedings of the 10th International Workshop on Database and Expert Systems Applications (DEXA\u201999)."},{"key":"e_1_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250811"},{"key":"e_1_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"e_1_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90061-J"},{"key":"e_1_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00881836"},{"key":"e_1_2_2_56_1","doi-asserted-by":"crossref","unstructured":"Poole D. 2008. The independent choice logic and beyond. In Probabilistic Inductive Logic Programming. 222--243.   Poole D. 2008. The independent choice logic and beyond. In Probabilistic Inductive Logic Programming . 222--243.","DOI":"10.1007\/978-3-540-78652-8_8"},{"volume-title":"Proceedings of the International Joint Coriference on Artificial Intelligence. 2462--2467","author":"Raedt L. D.","key":"e_1_2_2_57_1","unstructured":"Raedt , L. D. , Kimmig , A. , and Toivonen , H . 2007. Problog: A probabilistic prolog and its application in link discovery . In Proceedings of the International Joint Coriference on Artificial Intelligence. 2462--2467 . Raedt, L. D., Kimmig, A., and Toivonen, H. 2007. Problog: A probabilistic prolog and its application in link discovery. In Proceedings of the International Joint Coriference on Artificial Intelligence. 2462--2467."},{"key":"e_1_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00092-1"},{"key":"e_1_2_2_59_1","first-page":"1","article-title":"Evolutionary dynamics on small-world networks","volume":"2","author":"Rycht\u00e1\u0159 J.","year":"2008","unstructured":"Rycht\u00e1\u0159 , J. and Stadler , B. 2008 . Evolutionary dynamics on small-world networks . Int. J. Comput. Math. Sci. 2 , 1 . Rycht\u00e1\u0159, J. and Stadler, B. 2008. Evolutionary dynamics on small-world networks. Int. J. Comput. Math. Sci. 2, 1.","journal-title":"Int. J. Comput. Math. Sci."},{"key":"e_1_2_2_60_1","volume-title":"Proceedings of the International Coriference on Logic Programming. 715--729","author":"Sato T.","year":"1995","unstructured":"Sato , T. 1995 . A statistical learning method for logic programs with distribution semantics . In Proceedings of the International Coriference on Logic Programming. 715--729 . Sato, T. 1995. A statistical learning method for logic programs with distribution semantics. In Proceedings of the International Coriference on Logic Programming. 715--729."},{"key":"e_1_2_2_61_1","unstructured":"Schelling T. C. 1978. Micromotives and Macrobehavior. W.W. Norton and Co.  Schelling T. C. 1978. Micromotives and Macrobehavior . W.W. Norton and Co."},{"key":"e_1_2_2_62_1","volume-title":"Technical Communications of the 26th International Conference on Logic Programming. M. Hermenegildo and T. Schaub Eds., Leibniz International Proceedings in Informatics (LIPIcs) Series","volume":"7","author":"Shakarian P.","unstructured":"Shakarian , P. , Subrahmanian , V. , and Sapino , M. L . 2010. Using generalized annotated programs to solve social network optimization problems . In Technical Communications of the 26th International Conference on Logic Programming. M. Hermenegildo and T. Schaub Eds., Leibniz International Proceedings in Informatics (LIPIcs) Series , vol. 7 . Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 182--191. Shakarian, P., Subrahmanian, V., and Sapino, M. L. 2010. Using generalized annotated programs to solve social network optimization problems. In Technical Communications of the 26th International Conference on Logic Programming. M. Hermenegildo and T. Schaub Eds., Leibniz International Proceedings in Informatics (LIPIcs) Series, vol. 7. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 182--191."},{"key":"e_1_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068410000207"},{"key":"e_1_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/860575.860610"},{"volume-title":"Generalized triangular norm and co-norm based semantics for quantitate rule set logic programming","author":"Subrahmanian V.","key":"e_1_2_2_65_1","unstructured":"Subrahmanian , V. 1988. Generalized triangular norm and co-norm based semantics for quantitate rule set logic programming . Logic Programming Resbarch Group Tech. rep. LPRG-TR- 88-22, Syracuse University . Subrahmanian, V. 1988. Generalized triangular norm and co-norm based semantics for quantitate rule set logic programming. Logic Programming Resbarch Group Tech. rep. LPRG-TR- 88-22, Syracuse University."},{"key":"e_1_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2008.57"},{"volume-title":"Proceedings of the 3rd International Conference on Weblogs and Social Media. AAAI Press","author":"Sun E.","key":"e_1_2_2_67_1","unstructured":"Sun , E. , Rosenn , I. , Marlow , C. , and Lento , T . 2009. Gesundheit! Modeling contagion through facebook news feed . In Proceedings of the 3rd International Conference on Weblogs and Social Media. AAAI Press , San Jose, CA. Sun, E., Rosenn, I., Marlow, C., and Lento, T. 2009. Gesundheit! Modeling contagion through facebook news feed. In Proceedings of the 3rd International Conference on Weblogs and Social Media. AAAI Press, San Jose, CA."},{"key":"e_1_2_2_68_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018990308362"},{"volume-title":"Proceedings of the European Conference on Logics in Artificial Intelligence. 300--312","author":"Swift T.","key":"e_1_2_2_69_1","unstructured":"Swift , T. and Warren , D. S . 2010. Tabling with answer subsumption: Implementation, applications and performance . In Proceedings of the European Conference on Logics in Artificial Intelligence. 300--312 . Swift, T. and Warren, D. S. 2010. Tabling with answer subsumption: Implementation, applications and performance. In Proceedings of the European Conference on Logics in Artificial Intelligence. 300--312."},{"key":"e_1_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(93)90033-8"},{"key":"e_1_2_2_71_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0269888900005798"},{"key":"e_1_2_2_72_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27775-0_30"},{"key":"e_1_2_2_73_1","article-title":"Viral marketing for the real world. Harvard","author":"Watts D.","year":"2007","unstructured":"Watts , D. and Peretti , J. 2007 . Viral marketing for the real world. Harvard Bus. Rev.. Watts, D. and Peretti, J. 2007. Viral marketing for the real world. Harvard Bus. Rev..","journal-title":"Bus. Rev.."},{"key":"e_1_2_2_74_1","doi-asserted-by":"publisher","DOI":"10.1086\/210318"},{"key":"e_1_2_2_75_1","volume-title":"Proceedings of International Conference on Game Theory for Networks.","author":"Zhang L., M. P.","year":"2011","unstructured":"Zhang , L., M. P. 2011 . Two is a crowd: Optimal trend adoption in social networks . In Proceedings of International Conference on Game Theory for Networks. Zhang, L., M. P. 2011. Two is a crowd: Optimal trend adoption in social networks. In Proceedings of International Conference on Game Theory for Networks."}],"container-title":["ACM Transactions on Computational Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2480759.2480762","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2480759.2480762","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:14Z","timestamp":1750235954000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2480759.2480762"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":75,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["10.1145\/2480759.2480762"],"URL":"https:\/\/doi.org\/10.1145\/2480759.2480762","relation":{},"ISSN":["1529-3785","1557-945X"],"issn-type":[{"type":"print","value":"1529-3785"},{"type":"electronic","value":"1557-945X"}],"subject":[],"published":{"date-parts":[[2013,6]]},"assertion":[{"value":"2011-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}