{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T08:25:31Z","timestamp":1759047931931},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,11,18]],"date-time":"2012-11-18T00:00:00Z","timestamp":1353196800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s00224-012-9437-9","type":"journal-article","created":{"date-parts":[[2012,11,17]],"date-time":"2012-11-17T00:13:35Z","timestamp":1353111215000},"page":"467-502","source":"Crossref","is-referenced-by-count":2,"title":["The Complexity of Computing Minimal Unidirectional Covering Sets"],"prefix":"10.1007","volume":"53","author":[{"given":"Dorothea","family":"Baumeister","sequence":"first","affiliation":[]},{"given":"Felix","family":"Brandt","sequence":"additional","affiliation":[]},{"given":"Felix","family":"Fischer","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Hoffmann","sequence":"additional","affiliation":[]},{"given":"J\u00f6rg","family":"Rothe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,11,18]]},"reference":[{"key":"9437_CR1","first-page":"75","volume-title":"Proceedings of the 19th IEEE Symposium on Foundations of Computer Science","author":"L. Adleman","year":"1978","unstructured":"Adleman, L.: Two theorems on random polynomial time. In: Proceedings of the 19th IEEE Symposium on Foundations of Computer Science, pp. 75\u201383 (1978)"},{"issue":"1","key":"9437_CR2","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1137\/050623905","volume":"20","author":"N. Alon","year":"2006","unstructured":"Alon, N.: Ranking tournaments. SIAM J. Discrete Math. 20(1), 137\u2013142 (2006)","journal-title":"SIAM J. Discrete Math."},{"key":"9437_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/978-3-642-13073-1_27","volume-title":"Proceedings of the 7th International Conference on Algorithms and Complexity","author":"D. Baumeister","year":"2010","unstructured":"Baumeister, D., Brandt, F., Fischer, F., Hoffmann, J., Rothe, J.: The complexity of computing minimal unidirectional covering sets. In: Proceedings of the 7th International Conference on Algorithms and Complexity. Lecture Notes in Computer Science, vol. 6078, pp. 299\u2013310. Springer, Berlin (2010)"},{"key":"9437_CR4","volume-title":"The Theory of Committees and Elections","author":"D. Black","year":"1958","unstructured":"Black, D.: The Theory of Committees and Elections. Cambridge University Press, Cambridge (1958)"},{"key":"9437_CR5","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/0022-0531(83)90024-8","volume":"31","author":"G. Bordes","year":"1983","unstructured":"Bordes, G.: On the possibility of reasonable consistent majoritarian choice: some positive results. J. Econ. Theory 31, 122\u2013132 (1983)","journal-title":"J. Econ. Theory"},{"key":"9437_CR6","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1613\/jair.2467","volume":"32","author":"S. Bouveret","year":"2008","unstructured":"Bouveret, S., Lang, J.: Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity. J. Artif. Intell. Res. 32, 525\u2013564 (2008)","journal-title":"J. Artif. Intell. Res."},{"issue":"2","key":"9437_CR7","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/j.mathsocsci.2008.04.001","volume":"56","author":"F. Brandt","year":"2008","unstructured":"Brandt, F., Fischer, F.: Computing the minimal covering set. Math. Soc. Sci. 56(2), 254\u2013268 (2008)","journal-title":"Math. Soc. Sci."},{"issue":"4","key":"9437_CR8","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1002\/malq.200810027","volume":"55","author":"F. Brandt","year":"2009","unstructured":"Brandt, F., Fischer, F., Harrenstein, P.: The computational complexity of choice sets. Math. Log. Q. 55(4), 444\u2013459 (2009)","journal-title":"Math. Log. Q."},{"issue":"4","key":"9437_CR9","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/s00355-009-0419-z","volume":"34","author":"F. Brandt","year":"2010","unstructured":"Brandt, F., Fischer, F., Harrenstein, P., Mair, M.: A computational analysis of the tournament equilibrium set. Soc. Choice Welf. 34(4), 597\u2013609 (2010)","journal-title":"Soc. Choice Welf."},{"issue":"6","key":"9437_CR10","doi-asserted-by":"crossref","first-page":"1232","DOI":"10.1137\/0217078","volume":"17","author":"J. Cai","year":"1988","unstructured":"Cai, J., Gundermann, T., Hartmanis, J., Hemachandra, L., Sewelson, V., Wagner, K., Wechsung, G.: The boolean hierarchy I: structural properties. SIAM J. Comput. 17(6), 1232\u20131252 (1988)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9437_CR11","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1137\/0218007","volume":"18","author":"J. Cai","year":"1989","unstructured":"Cai, J., Gundermann, T., Hartmanis, J., Hemachandra, L., Sewelson, V., Wagner, K., Wechsung, G.: The boolean hierarchy II: applications. SIAM J. Comput. 18(1), 95\u2013111 (1989)","journal-title":"SIAM J. Comput."},{"key":"9437_CR12","series-title":"Synthesis Lectures on Artificial Intelligence and Machine Learning","volume-title":"Computational Aspects of Cooperative Game Theory","author":"G. Chalkiadakis","year":"2011","unstructured":"Chalkiadakis, G., Elkind, E., Wooldridge, M.: Computational Aspects of Cooperative Game Theory. Synthesis Lectures on Artificial Intelligence and Machine Learning. (2011). Morgan & Claypool Publishers"},{"key":"9437_CR13","volume-title":"Essai sur L\u2019application de L\u2019analyse \u00e0 la Probabilit\u00e9 des D\u00e9cisions Rendues \u00e0 la Pluralit\u00e9 des Voix","author":"M. Condorcet de","year":"1785","unstructured":"de Condorcet, M.: Essai sur L\u2019application de L\u2019analyse \u00e0 la Probabilit\u00e9 des D\u00e9cisions Rendues \u00e0 la Pluralit\u00e9 des Voix. Imprimerie Royale, Paris (1785). Facsimile published in 1972 by Chelsea, New York"},{"key":"9437_CR14","first-page":"613","volume-title":"Proceedings of the 21st National Conference on Artificial Intelligence","author":"V. Conitzer","year":"2006","unstructured":"Conitzer, V.: Computing slater rankings using similarities among candidates. In: Proceedings of the 21st National Conference on Artificial Intelligence, pp. 613\u2013619. AAAI Press, Menlo Park (2006)"},{"key":"9437_CR15","unstructured":"Dodgson, C.: A method of taking votes on more than two issues (1876). Pamphlet printed by the Clarendon Press, Oxford, and headed \u201cnot yet published\u201d (see the discussions in [4, 37], both of which reprint this paper)"},{"key":"9437_CR16","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0022-0531(88)90096-8","volume":"44","author":"B. Dutta","year":"1988","unstructured":"Dutta, B.: Covering sets and a new Condorcet choice correspondence. J. Econ. Theory 44, 63\u201380 (1988)","journal-title":"J. Econ. Theory"},{"issue":"2","key":"9437_CR17","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0304-3975(93)90073-3","volume":"114","author":"T. Eiter","year":"1993","unstructured":"Eiter, T., Gottlob, G.: Propositional circumscription and extended closed-world reasoning are $\\varPi_{2}^{p}$ -complete. Theor. Comput. Sci. 114(2), 231\u2013245 (1993). Addendum appears in the same journal, 118(2):315, 1993","journal-title":"Theor. Comput. Sci."},{"issue":"3\u20134","key":"9437_CR18","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF01536399","volume":"15","author":"T. Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: On the computational cost of disjunctive logic programming: propositional case. Ann. Math. Artif. Intell. 15(3\u20134), 289\u2013323 (1995)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9437_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BFb0036168","volume-title":"Proceedings of the 11th Conference on Fundamentals of Computation Theory","author":"T. Eiter","year":"1997","unstructured":"Eiter, T., Gottlob, G.: The complexity class $\\varTheta^{p}_{2}$ : recent results and applications. In: Proceedings of the 11th Conference on Fundamentals of Computation Theory. Lecture Notes in Computer Science, vol. 1279, pp. 1\u201318. Springer, Berlin (1997)"},{"issue":"3","key":"9437_CR20","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1137\/0133030","volume":"33","author":"P. Fishburn","year":"1977","unstructured":"Fishburn, P.: Condorcet social choice functions. SIAM J. Appl. Math. 33(3), 469\u2013489 (1977)","journal-title":"SIAM J. Appl. Math."},{"key":"9437_CR21","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"9437_CR22","first-page":"110","volume-title":"Proceedings of the 19th ACM Symposium on Theory of Computing","author":"L. Hemachandra","year":"1987","unstructured":"Hemachandra, L.: The strong exponential hierarchy collapses. In: Proceedings of the 19th ACM Symposium on Theory of Computing, pp. 110\u2013122. ACM, New York (1987)"},{"issue":"6","key":"9437_CR23","doi-asserted-by":"crossref","first-page":"806","DOI":"10.1145\/268999.269002","volume":"44","author":"E. Hemaspaandra","year":"1997","unstructured":"Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: Exact analysis of Dodgson elections: Lewis Carroll\u2019s 1876 voting system is complete for parallel access to NP. J. ACM 44(6), 806\u2013825 (1997)","journal-title":"J. ACM"},{"issue":"2","key":"9437_CR24","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/261342.261344","volume":"28","author":"E. Hemaspaandra","year":"1997","unstructured":"Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: Raising NP lower bounds to parallel NP lower bounds. SIGACT News 28(2), 2\u201313 (1997)","journal-title":"SIGACT News"},{"key":"9437_CR25","unstructured":"Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: Hybrid elections broaden complexity-theoretic resistance to control. Tech. Rep. arXiv:cs\/0608057v2 \u00a0[cs.GT], ACM Computing Research Repository (CoRR) (2008). Conference version appeared in Proc. IJCAI\u201907. Journal version to appear in Math. Logic Q., 55(4):397\u2013424, (2009)"},{"issue":"3","key":"9437_CR26","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0020-0190(97)00219-6","volume":"65","author":"E. Hemaspaandra","year":"1998","unstructured":"Hemaspaandra, E., Rothe, J.: Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP. Inf. Process. Lett. 65(3), 151\u2013156 (1998)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"9437_CR27","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1051\/ita:2005041","volume":"40","author":"E. Hemaspaandra","year":"2006","unstructured":"Hemaspaandra, E., Rothe, J., Spakowski, H.: Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP. RAIRO Theor. Inform. Appl. 40(1), 75\u201391 (2006)","journal-title":"RAIRO Theor. Inform. Appl."},{"issue":"3","key":"9437_CR28","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/j.tcs.2005.08.031","volume":"349","author":"E. Hemaspaandra","year":"2005","unstructured":"Hemaspaandra, E., Spakowski, H., Vogel, J.: The complexity of Kemeny elections. Theor. Comput. Sci. 349(3), 382\u2013391 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"9437_CR29","doi-asserted-by":"crossref","first-page":"1948","DOI":"10.1137\/S0097539799362639","volume":"31","author":"E. Hemaspaandra","year":"2002","unstructured":"Hemaspaandra, E., Wechsung, G.: The minimization problem for boolean formulas. SIAM J. Comput. 31(6), 1948\u20131958 (2002)","journal-title":"SIAM J. Comput."},{"key":"9437_CR30","first-page":"571","volume":"88","author":"J. Kemeny","year":"1959","unstructured":"Kemeny, J.: Mathematics without numbers. D\u00e6dalus 88, 571\u2013591 (1959)","journal-title":"D\u00e6dalus"},{"key":"9437_CR31","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1051\/ita\/1987210404191","volume":"21","author":"J. K\u00f6bler","year":"1987","unstructured":"K\u00f6bler, J., Sch\u00f6ning, U., Wagner, K.: The difference and truth-table hierarchies for NP. RAIRO Theor. Inform. Appl. 21, 419\u2013435 (1987)","journal-title":"RAIRO Theor. Inform. Appl."},{"issue":"2","key":"9437_CR32","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0304-3975(75)90016-X","volume":"1","author":"R. Ladner","year":"1975","unstructured":"Ladner, R., Lynch, N., Selman, A.: A comparison of polynomial time reducibilities. Theor. Comput. Sci. 1(2), 103\u2013124 (1975)","journal-title":"Theor. Comput. Sci."},{"key":"9437_CR33","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-60805-6","volume-title":"Tournament Solutions and Majority Voting","author":"J. Laslier","year":"1997","unstructured":"Laslier, J.: Tournament Solutions and Majority Voting. Springer, Berlin (1997)"},{"key":"9437_CR34","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1090\/S0002-9947-1969-0237183-X","volume":"136","author":"W. Lucas","year":"1969","unstructured":"Lucas, W.: The proof that a game may not have a solution. Trans. Am. Math. Soc. 136, 219\u2013229 (1969)","journal-title":"Trans. Am. Math. Soc."},{"key":"9437_CR35","volume-title":"Handbook of Game Theory","author":"W. Lucas","year":"1992","unstructured":"Lucas, W.: Von Neumann\u2013Morgenstern stable sets. In: Handbook of Game Theory, vol. 1. Elsevier, Amsterdam (1992)"},{"issue":"4","key":"9437_CR36","doi-asserted-by":"crossref","first-page":"608","DOI":"10.2307\/1907926","volume":"21","author":"D. McGarvey","year":"1953","unstructured":"McGarvey, D.: A theorem on the construction of voting paradoxes. Econometrica 21(4), 608\u2013610 (1953)","journal-title":"Econometrica"},{"key":"9437_CR37","doi-asserted-by":"crossref","DOI":"10.3998\/mpub.12736","volume-title":"Classics of Social Choice","author":"I. McLean","year":"1995","unstructured":"McLean, I., Urken, A.: Classics of Social Choice. University of Michigan Press, Ann Arbor (1995)"},{"key":"9437_CR38","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1109\/SWAT.1972.29","volume-title":"Proceedings of the 13th IEEE Symposium on Switching and Automata Theory","author":"A. Meyer","year":"1972","unstructured":"Meyer, A., Stockmeyer, L.: The equivalence problem for regular expressions with squaring requires exponential space. In: Proceedings of the 13th IEEE Symposium on Switching and Automata Theory, pp. 125\u2013129 (1972)"},{"issue":"1","key":"9437_CR39","doi-asserted-by":"crossref","first-page":"68","DOI":"10.2307\/2110925","volume":"24","author":"N. Miller","year":"1980","unstructured":"Miller, N.: A new solution set for tournaments and majority voting: further graph-theoretical approaches to the theory of voting. Am. J. Polit. Sci. 24(1), 68\u201396 (1980)","journal-title":"Am. J. Polit. Sci."},{"key":"9437_CR40","volume-title":"Theory of Games and Economic Behavior","author":"J. Neumann von","year":"1944","unstructured":"von Neumann, J., Morgenstern, O.: Theory of Games and Economic Behavior. Princeton University Press, Princeton (1944)"},{"key":"9437_CR41","volume-title":"Computational Complexity","author":"C. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"issue":"2","key":"9437_CR42","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0022-0000(84)90068-0","volume":"28","author":"C. Papadimitriou","year":"1984","unstructured":"Papadimitriou, C., Yannakakis, M.: The complexity of facets (and some facets of complexity). J. Comput. Syst. Sci. 28(2), 244\u2013259 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"9437_CR43","series-title":"Lecture Notes in Computer Science","first-page":"269","volume-title":"Proceedings of the 6th GI Conference on Theoretical Computer Science","author":"C. Papadimitriou","year":"1983","unstructured":"Papadimitriou, C., Zachos, S.: Two remarks on the power of counting. In: Proceedings of the 6th GI Conference on Theoretical Computer Science. Lecture Notes in Computer Science, vol. 145, pp. 269\u2013276. Springer, Berlin (1983)"},{"key":"9437_CR44","series-title":"EATCS Texts in Theoretical Computer Science.","volume-title":"Complexity Theory and Cryptology. An Introduction to Cryptocomplexity","author":"J. Rothe","year":"2005","unstructured":"Rothe, J.: Complexity Theory and Cryptology. An Introduction to Cryptocomplexity. EATCS Texts in Theoretical Computer Science. Springer, Berlin (2005)"},{"issue":"4","key":"9437_CR45","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s00224-002-1093-z","volume":"36","author":"J. Rothe","year":"2003","unstructured":"Rothe, J., Spakowski, H., Vogel, J.: Exact complexity of the winner problem for Young elections. Theory Comput. Syst. 36(4), 375\u2013386 (2003)","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"9437_CR46","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1145\/582475.582484","volume":"33","author":"M. Schaefer","year":"2002","unstructured":"Schaefer, M., Umans, C.: Completeness in the polynomial-time hierarchy. Part I: A compendium. SIGACT News 33(3), 32\u201349 (2002)","journal-title":"SIGACT News"},{"issue":"4","key":"9437_CR47","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/601819.601829","volume":"33","author":"M. Schaefer","year":"2002","unstructured":"Schaefer, M., Umans, C.: Completeness in the polynomial-time hierarchy. Part II. SIGACT News 33(4), 22\u201336 (2002)","journal-title":"SIGACT News"},{"issue":"1","key":"9437_CR48","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"L. Stockmeyer","year":"1976","unstructured":"Stockmeyer, L.: The polynomial-time hierarchy. Theor. Comput. Sci. 3(1), 1\u201322 (1976)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"9437_CR49","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1006\/jcss.2001.1775","volume":"63","author":"C. Umans","year":"2001","unstructured":"Umans, C.: The minimum equivalent DNF problem and shortest implicants. J. Comput. Syst. Sci. 63(4), 597\u2013611 (2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"9437_CR50","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/0020-0190(76)90097-1","volume":"5","author":"L. Valiant","year":"1976","unstructured":"Valiant, L.: The relative complexity of checking and evaluating. Inf. Process. Lett. 5(1), 20\u201323 (1976)","journal-title":"Inf. Process. Lett."},{"key":"9437_CR51","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0304-3975(87)90049-1","volume":"51","author":"K. Wagner","year":"1987","unstructured":"Wagner, K.: More complicated questions about maxima and minima, and some closures of NP. Theor. Comput. Sci. 51, 53\u201380 (1987)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"9437_CR52","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1137\/0219058","volume":"19","author":"K. Wagner","year":"1990","unstructured":"Wagner, K.: Bounded query classes. SIAM J. Comput. 19(5), 833\u2013846 (1990)","journal-title":"SIAM J. Comput."},{"key":"9437_CR53","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s003550200197","volume":"20","author":"G. Woeginger","year":"2003","unstructured":"Woeginger, G.: Banks winners in tournaments are difficult to recognize. Soc. Choice Welf. 20, 523\u2013528 (2003)","journal-title":"Soc. Choice Welf."},{"issue":"2","key":"9437_CR54","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0022-0531(77)90012-6","volume":"16","author":"H. Young","year":"1977","unstructured":"Young, H.: Extending Condorcet\u2019s rule. J. Econ. Theory 16(2), 335\u2013353 (1977)","journal-title":"J. Econ. Theory"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-012-9437-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-012-9437-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-012-9437-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,5]],"date-time":"2019-07-05T18:34:58Z","timestamp":1562351698000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-012-9437-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,18]]},"references-count":54,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["9437"],"URL":"https:\/\/doi.org\/10.1007\/s00224-012-9437-9","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,18]]}}}