{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:13:35Z","timestamp":1763468015242,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":56,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642163661"},{"type":"electronic","value":"9783642163678"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16367-8_12","type":"book-chapter","created":{"date-parts":[[2010,10,7]],"date-time":"2010-10-07T15:25:55Z","timestamp":1286465155000},"page":"211-227","source":"Crossref","is-referenced-by-count":15,"title":["Invariance in Property Testing"],"prefix":"10.1007","author":[{"given":"Madhu","family":"Sudan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1145\/1250790.1250863","volume-title":"STOC","author":"N. Alon","year":"2007","unstructured":"Alon, N., Andoni, A., Kaufman, T., Matulef, K., Rubinfeld, R., Xie, N.: Testing k-wise and almost k-wise independence. In: Johnson, D.S., Feige, U. (eds.) STOC, pp. 496\u2013505. ACM, New York (2007)"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"N. Alon, E. Fischer, I. Newman, A. Shapira. A combinatorial characterization of the testable graph properties: it\u2019s all about regularity. In: Kleinberg [42], pp. 251\u2013260","DOI":"10.1145\/1132516.1132555"},{"issue":"11","key":"12_CR3","doi-asserted-by":"publisher","first-page":"4032","DOI":"10.1109\/TIT.2005.856958","volume":"51","author":"N. Alon","year":"2005","unstructured":"Alon, N., Kaufman, T., Krivelevich, M., Litsyn, S., Ron, D.: Testing reed-muller codes. IEEE Transactions on Information Theory\u00a051(11), 4032\u20134039 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"12_CR4","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. Journal of the ACM\u00a045(3), 501\u2013555 (1998)","journal-title":"Journal of the ACM"},{"key":"12_CR5","first-page":"21","volume-title":"Proceedings of the 23rd ACM Symposium on the Theory of Computing","author":"L. Babai","year":"1991","unstructured":"Babai, L., Fortnow, L., Levin, L.A., Szegedy, M.: Checking computations in polylogarithmic time. In: Proceedings of the 23rd ACM Symposium on the Theory of Computing, pp. 21\u201332. ACM Press, New York (1991)"},{"issue":"1","key":"12_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF01200056","volume":"1","author":"L. Babai","year":"1991","unstructured":"Babai, L., Fortnow, L., Lund, C.: Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity\u00a01(1), 3\u201340 (1991)","journal-title":"Computational Complexity"},{"issue":"8","key":"12_CR7","doi-asserted-by":"publisher","first-page":"2849","DOI":"10.1109\/TIT.2005.851735","volume":"51","author":"L. Babai","year":"2005","unstructured":"Babai, L., Shpilka, A., Stefankovic, D.: Locally testable cyclic codes. IEEE Transactions on Information Theory\u00a051(8), 2849\u20132858 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"12_CR8","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1137\/S0097539702403645","volume":"35","author":"T. Batu","year":"2005","unstructured":"Batu, T., Dasgupta, S., Kumar, R., Rubinfeld, R.: The complexity of approximating the entropy. SIAM J. Comput.\u00a035(1), 132\u2013150 (2005)","journal-title":"SIAM J. Comput."},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Batu, T., Fortnow, L., Fischer, E., Kumar, R., Rubinfeld, R., White, P.: Testing random variables for independence and identity. In: FOCS, pp. 442\u2013451 (2001)","DOI":"10.1109\/SFCS.2001.959920"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Batu, T., Fortnow, L., Rubinfeld, R., Smith, W.D., White, P.: Testing that distributions are close. In: FOCS, pp. 259\u2013269 (2000)","DOI":"10.1109\/SFCS.2000.892113"},{"key":"12_CR11","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1145\/1007352.1007414","volume-title":"STOC","author":"T. Batu","year":"2004","unstructured":"Batu, T., Kumar, R., Rubinfeld, R.: Sublinear algorithms for testing monotone and unimodal distributions. In: Babai, L. (ed.) STOC, pp. 381\u2013390. ACM, New York (2004)"},{"issue":"3","key":"12_CR12","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1137\/S0097539796302531","volume":"27","author":"M. Bellare","year":"1998","unstructured":"Bellare, M., Goldreich, O., Sudan, M.: Free bits, PCP\u2019s and non-approximability \u2014 towards tight results. SIAM Journal on Computing\u00a027(3), 804\u2013915 (1998)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"12_CR13","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1137\/S0097539705446810","volume":"36","author":"E. Ben-Sasson","year":"2006","unstructured":"Ben-Sasson, E., Goldreich, O., Harsha, P., Sudan, M., Vadhan, S.P.: Robust pcps of proximity, shorter pcps, and applications to coding. SIAM Journal on Computing\u00a036(4), 889\u2013974 (2006)","journal-title":"SIAM Journal on Computing"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539704445445","volume":"35","author":"E. Ben-Sasson","year":"2005","unstructured":"Ben-Sasson, E., Harsha, P., Raskhodnikova, S.: Some 3CNF properties are hard to test. SIAM Journal on Computing\u00a035, 1\u201321 (2005); Preliminary version in Proc. STOC 2003 (2003)","journal-title":"SIAM Journal on Computing"},{"key":"12_CR15","unstructured":"Ben-Sasson, E., Sudan, M.: Limits on the rate of locally testable affine-invariant codes (November 2009) (manuscript)"},{"key":"12_CR16","series-title":"LIPIcs","first-page":"135","volume-title":"STACS","author":"A. Bhattacharyya","year":"2009","unstructured":"Bhattacharyya, A., Chen, V., Sudan, M., Xie, N.: Testing linear-invariant non-linear properties. In: Albers, S., Marion, J.-Y. (eds.) STACS. LIPIcs, vol.\u00a03, pp. 135\u2013146. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2009)"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1137\/1.9781611973075.9","volume-title":"SODA 2010: Proceedings of the twenty-first Annual ACM-SIAM Symposium on Discrete Algorithms","author":"A. Bhattacharyya","year":"2010","unstructured":"Bhattacharyya, A., Xie, N.: Lower bounds for testing triangle-freeness in boolean functions. In: SODA 2010: Proceedings of the twenty-first Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 87\u201398. Society for Industrial and Applied Mathematics, Philadelphia (2010)"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Blais, E.: Testing juntas nearly optimally. In: Mitzenmacher [47], pp. 151\u2013158","DOI":"10.1145\/1536414.1536437"},{"issue":"3","key":"12_CR19","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/0022-0000(93)90044-W","volume":"47","author":"M. Blum","year":"1993","unstructured":"Blum, M., Luby, M., Rubinfeld, R.: Self-testing\/correcting with applications to numerical problems. Journal of Computer and System Sciences\u00a047(3), 549\u2013595 (1993)","journal-title":"Journal of Computer and System Sciences"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Borgs, C., Chayes, J.T., Lov\u00e1sz, L., S\u00f3s, V.T., Szegedy, B., Vesztergombi, K.: Graph limits and parameter testing. In: Kleinberg [42], pp. 261\u2013270","DOI":"10.1145\/1132516.1132556"},{"key":"12_CR21","first-page":"549","volume-title":"FOCS","author":"I. Diakonikolas","year":"2007","unstructured":"Diakonikolas, I., Lee, H.K., Matulef, K., Onak, K., Rubinfeld, R., Servedio, R.A., Wan, A.: Testing for concise representations. In: FOCS, pp. 549\u2013558. IEEE Computer Society, Los Alamitos (2007)"},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1109\/FOCS.2004.16","volume-title":"Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science","author":"I. Dinur","year":"2004","unstructured":"Dinur, I., Reingold, O.: Assignment testers: Towards a combinatorial proof of the PCP-theorem. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 155\u2013164. IEEE Press, Los Alamitos (2004)"},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/978-3-540-48413-4_10","volume-title":"Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques","author":"Y. Dodis","year":"1999","unstructured":"Dodis, Y., Goldreich, O., Lehman, E., Raskhodnikova, S., Ron, D., Samorodnitsky, A.: Improved testing algorithms for monotonicity. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) RANDOM 1999 and APPROX 1999. LNCS, vol.\u00a01671, pp. 97\u2013108. Springer, Heidelberg (1999)"},{"issue":"3","key":"12_CR24","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1006\/jcss.1999.1692","volume":"60","author":"F. Erg\u00fcn","year":"2000","unstructured":"Erg\u00fcn, F., Kannan, S., Kumar, R., Rubinfeld, R., Viswanathan, M.: Spot-checkers. J. Comput. Syst. Sci.\u00a060(3), 717\u2013751 (2000)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"12_CR25","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1016\/j.jcss.2003.11.004","volume":"68","author":"E. Fischer","year":"2004","unstructured":"Fischer, E., Kindler, G., Ron, D., Safra, S., Samorodnitsky, A.: Testing juntas. J. Comput. Syst. Sci.\u00a068(4), 753\u2013787 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR26","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1109\/ISTCS.1995.377032","volume-title":"Proceedings of the 3rd Annual Israel Symposium on Theory of Computing and Systems","author":"K. Friedl","year":"1995","unstructured":"Friedl, K., Sudan, M.: Some improvements to total degree tests. In: Proceedings of the 3rd Annual Israel Symposium on Theory of Computing and Systems, Washington, DC, USA, January 4-6, pp. 190\u2013198. IEEE Computer Society, Los Alamitos (1995), http:\/\/people.csail.mit.edu\/madhu\/papers\/friedl.ps"},{"issue":"3","key":"12_CR27","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s004930070011","volume":"20","author":"O. Goldreich","year":"2000","unstructured":"Goldreich, O., Goldwasser, S., Lehman, E., Ron, D., Samorodnitsky, A.: Testing monotonicity. Combinatorica\u00a020(3), 301\u2013337 (2000)","journal-title":"Combinatorica"},{"issue":"4","key":"12_CR28","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1145\/285055.285060","volume":"45","author":"O. Goldreich","year":"1998","unstructured":"Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. JACM\u00a045(4), 653\u2013750 (1998)","journal-title":"JACM"},{"key":"12_CR29","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Kaufman, T.: Proximity oblivious testing and the role of invariances (March 2010) (manuscript)","DOI":"10.1007\/978-3-642-22670-0_19"},{"key":"12_CR30","unstructured":"Goldreich, O., Ron, D.: On testing expansion in bounded-degree graphs. Electronic Colloquium on Computational Complexity (ECCC)\u00a07(20) (2000)"},{"issue":"2","key":"12_CR31","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/s00453-001-0078-7","volume":"32","author":"O. Goldreich","year":"2002","unstructured":"Goldreich, O., Ron, D.: Property testing in bounded degree graphs. Algorithmica\u00a032(2), 302\u2013343 (2002)","journal-title":"Algorithmica"},{"key":"12_CR32","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Ron, D.: On proximity oblivious testing. In: Mitzenmacher [47], pp. 141\u2013150","DOI":"10.1145\/1536414.1536436"},{"key":"12_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/978-3-540-74208-1_37","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"O. Goldreich","year":"2007","unstructured":"Goldreich, O., Sheffet, O.: On the randomness complexity of property testing. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) RANDOM 2007 and APPROX 2007. LNCS, vol.\u00a04627, pp. 509\u2013524. Springer, Heidelberg (2007)"},{"key":"12_CR34","doi-asserted-by":"crossref","unstructured":"Gopalan, P., O\u2019Donnell, R., Servedio, R.A., Shpilka, A., Wimmer, K.: Testing fourier dimensionality and sparsity. In: Albers, S.E., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol.\u00a05555, pp. 500\u2013512. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-02927-1_42"},{"issue":"2","key":"12_CR35","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/s00039-005-0509-8","volume":"15","author":"B. Green","year":"2005","unstructured":"Green, B.: A Szemer\u00e9di-type regularity lemma in abelian groups, with applications. Geometric and Functional Analysis\u00a015(2), 340\u2013376 (2005)","journal-title":"Geometric and Functional Analysis"},{"key":"12_CR36","volume-title":"CCC 2008: Proceedings of the 23rd IEEE Conference on Computational Complexity","author":"E. Grigorescu","year":"2008","unstructured":"Grigorescu, E., Kaufman, T., Sudan, M.: 2-transitivity is insufficient for local testability. In: CCC 2008: Proceedings of the 23rd IEEE Conference on Computational Complexity, June 23-26. IEEE Computer Society, Los Alamitos (2008) (to appear)"},{"key":"12_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1007\/978-3-642-03685-9_40","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"E. Grigorescu","year":"2009","unstructured":"Grigorescu, E., Kaufman, T., Sudan, M.: Succinct representation of codes with applications to testing. In: Dinur, I., Jansen, K., Naor, J., Rolim, J.D.P. (eds.) APPROX-RANDOM 2009. LNCS, vol.\u00a05687, pp. 534\u2013547. Springer, Heidelberg (2009)"},{"key":"12_CR38","first-page":"423","volume-title":"FOCS 2004: Proceedings of the Forty-Fifth Annual IEEE Symposium on Foundations of Computer Science","author":"C.S. Jutla","year":"2004","unstructured":"Jutla, C.S., Patthak, A.C., Rudra, A., Zuckerman, D.: Testing low-degree polynomials over prime fields. In: FOCS 2004: Proceedings of the Forty-Fifth Annual IEEE Symposium on Foundations of Computer Science, pp. 423\u2013432. IEEE Computer Society, Los Alamitos (2004)"},{"issue":"3","key":"12_CR39","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1137\/S0097539704445615","volume":"36","author":"T. Kaufman","year":"2006","unstructured":"Kaufman, T., Ron, D.: Testing polynomials over general fields. SIAM J. Comput.\u00a036(3), 779\u2013802 (2006)","journal-title":"SIAM J. Comput."},{"key":"#cr-split#-12_CR40.1","doi-asserted-by":"crossref","unstructured":"Kaufman, T., Sudan, M.: Algebraic property testing: The role of invariance. Technical Report TR07-111, Electronic Colloquium on Computational Complexity, November 2 (2007);","DOI":"10.1145\/1374376.1374434"},{"key":"#cr-split#-12_CR40.2","unstructured":"Extended abstract in Proc. 40th STOC (2008)"},{"key":"12_CR41","doi-asserted-by":"crossref","unstructured":"Kaufman, T., Wigderson, A.: Symmetric LDPC codes and local testing. In: Proceedings of ICS 2010 (January 2010)","DOI":"10.1007\/978-3-642-16367-8_25"},{"volume-title":"Proceedings of the 38th Annual ACM Symposium on Theory of Computing","year":"2006","key":"12_CR42","unstructured":"Kleinberg, J.M. (ed.): Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23. ACM, New York (2006)"},{"key":"12_CR43","unstructured":"Kr\u00e1l\u2019, D., Serra, O., Vena, L.: A removal lemma for systems of linear equations over finite fields. arxiv.org:0809.1846v1 [math.CO]"},{"issue":"4","key":"12_CR44","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1016\/j.jcta.2008.12.003","volume":"116","author":"D. Kr\u00e1l","year":"2009","unstructured":"Kr\u00e1l\u2019, D., Serra, O., Vena, L.: A combinatorial proof of the removal lemma for groups. Journal of Combinatorial Theory, Series A\u00a0116(4), 971\u2013978 (2009)","journal-title":"Journal of Combinatorial Theory, Series A"},{"volume-title":"Proceedings of the 40th Annual ACM Symposium on Theory of Computing","year":"2008","key":"12_CR45","unstructured":"Ladner, R.E., Dwork, C. (eds.): Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20. ACM, New York (2008)"},{"key":"12_CR46","first-page":"256","volume-title":"SODA","author":"K. Matulef","year":"2009","unstructured":"Matulef, K., O\u2019Donnell, R., Rubinfeld, R., Servedio, R.A.: Testing halfspaces. In: Mathieu, C. (ed.) SODA, pp. 256\u2013264. SIAM, Philadelphia (2009)"},{"volume-title":"Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009","year":"2009","key":"12_CR47","unstructured":"Mitzenmacher, M. (ed.): Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31-June 2. ACM, New York (2009)"},{"key":"12_CR48","unstructured":"Onak, K., Sudan, M.: Learnability of general discrete distributions (March 2010) (manuscript)"},{"issue":"1","key":"12_CR49","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1137\/S0895480101407444","volume":"16","author":"M. Parnas","year":"2002","unstructured":"Parnas, M., Ron, D., Samorodnitsky, A.: Testing basic boolean formulae. SIAM J. Discrete Math.\u00a016(1), 20\u201346 (2002)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"12_CR50","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1137\/070701649","volume":"39","author":"S. Raskhodnikova","year":"2009","unstructured":"Raskhodnikova, S., Ron, D., Shpilka, A., Smith, A.: Strong lower bounds for approximating distribution support size and the distinct elements problem. SIAM J. Comput.\u00a039(3), 813\u2013842 (2009)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"12_CR51","doi-asserted-by":"publisher","first-page":"1972","DOI":"10.1137\/S0097539796298625","volume":"28","author":"R. Rubinfeld","year":"1999","unstructured":"Rubinfeld, R.: Robust functional equations and their applications to program testing. SIAM Journal on Computing\u00a028(6), 1972\u20131997 (1999)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"12_CR52","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1002\/rsa.20247","volume":"34","author":"R. Rubinfeld","year":"2009","unstructured":"Rubinfeld, R., Servedio, R.A.: Testing monotone high-dimensional distributions. Random Struct. Algorithms\u00a034(1), 24\u201344 (2009)","journal-title":"Random Struct. Algorithms"},{"issue":"2","key":"12_CR53","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1137\/S0097539793255151","volume":"25","author":"R. Rubinfeld","year":"1996","unstructured":"Rubinfeld, R., Sudan, M.: Robust characterizations of polynomials with applications to program testing. SIAM Journal on Computing\u00a025(2), 252\u2013271 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"12_CR54","doi-asserted-by":"crossref","unstructured":"Shapira, A.: Green\u2019s conjecture and testing linear-invariant properties. In: Mitzenmacher [47], pp. 159\u2013166","DOI":"10.1145\/1536414.1536438"},{"key":"12_CR55","doi-asserted-by":"crossref","unstructured":"Valiant, P.: Testing symmetric properties of distributions. In: Ladner and Dwork [45], pp. 383\u2013392","DOI":"10.1145\/1374376.1374432"}],"container-title":["Lecture Notes in Computer Science","Property Testing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16367-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T13:18:14Z","timestamp":1740575894000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16367-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642163661","9783642163678"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16367-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}