{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T13:53:12Z","timestamp":1752673992790,"version":"3.37.3"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,3,7]],"date-time":"2022-03-07T00:00:00Z","timestamp":1646611200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,7]],"date-time":"2022-03-07T00:00:00Z","timestamp":1646611200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1855464"],"award-info":[{"award-number":["1855464"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"crossref","award":["281\/17"],"award-info":[{"award-number":["281\/17"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001736","name":"German-Israeli Foundation for Scientific Research and Development","doi-asserted-by":"publisher","award":["G-1347-304.6\/2016"],"award-info":[{"award-number":["G-1347-304.6\/2016"]}],"id":[{"id":"10.13039\/501100001736","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["678765"],"award-info":[{"award-number":["678765"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"crossref","award":["635\/16","1065\/20"],"award-info":[{"award-number":["635\/16","1065\/20"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s00454-022-00376-x","type":"journal-article","created":{"date-parts":[[2022,3,7]],"date-time":"2022-03-07T16:06:47Z","timestamp":1646669207000},"page":"618-644","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The $$\\varepsilon $$-t-Net Problem"],"prefix":"10.1007","volume":"68","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5341-1968","authenticated-orcid":false,"given":"Bruno","family":"Jartoux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chaya","family":"Keller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shakhar","family":"Smorodinsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yelena","family":"Yuditsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,7]]},"reference":[{"key":"376_CR1","doi-asserted-by":"crossref","unstructured":"Ackerman, E., Keszegh, B., P\u00e1lv\u00f6lgyi, D.: Coloring Delaunay-edges and their generalizations. Comput. Geom. 96, #\u00a0101745 (2021)","DOI":"10.1016\/j.comgeo.2021.101745"},{"issue":"4","key":"376_CR2","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1016\/j.jcta.2013.01.005","volume":"120","author":"E Ackerman","year":"2013","unstructured":"Ackerman, E., Pinchasi, R.: On coloring points with respect to rectangles. J. Combin. Theory Ser. A 120(4), 811\u2013815 (2013)","journal-title":"J. Combin. Theory Ser. A"},{"key":"376_CR3","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Pach, J., Sharir, M.: State of the union (of geometric objects). In: Surveys on Discrete and Computational Geometry (Snowbird 2006). Contemp. Math., vol. 453, pp. 9\u201348. American Mathematical Society, Providence (2008)","DOI":"10.1090\/conm\/453\/08794"},{"issue":"3","key":"376_CR4","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/j.jctb.2005.09.003","volume":"96","author":"N Alon","year":"2006","unstructured":"Alon, N., Brightwell, G., Kierstead, H.A., Kostochka, A.V., Winkler, P.: Dominating sets in $$k$$-majority tournaments. J. Combin. Theory Ser. B 96(3), 374\u2013387 (2006)","journal-title":"J. Combin. Theory Ser. B"},{"key":"376_CR5","doi-asserted-by":"crossref","unstructured":"Aronov, B., Donakonda, A., Ezra, E., Pinchasi, R.: On pseudo-disk hypergraphs. Comput. Geom. 92, #\u00a0101687 (2021)","DOI":"10.1016\/j.comgeo.2020.101687"},{"issue":"7","key":"376_CR6","doi-asserted-by":"publisher","first-page":"3248","DOI":"10.1137\/090762968","volume":"39","author":"B Aronov","year":"2010","unstructured":"Aronov, B., Ezra, E., Sharir, M.: Small-size $$\\varepsilon $$-nets for axis-parallel rectangles and boxes. SIAM J. Comput. 39(7), 3248\u20133282 (2010)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"376_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/16M1061096","volume":"47","author":"S Arya","year":"2018","unstructured":"Arya, S., da Fonseca, G.D., Mount, D.M.: Approximate polytope membership queries. SIAM J. Comput. 47(1), 1\u201351 (2018)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"376_CR8","doi-asserted-by":"publisher","first-page":"233","DOI":"10.5802\/aif.938","volume":"33","author":"P Assouad","year":"1983","unstructured":"Assouad, P.: Densit\u00e9 et dimension. Ann. Inst. Fourier (Grenoble) 33(3), 233\u2013282 (1983)","journal-title":"Ann. Inst. Fourier (Grenoble)"},{"key":"376_CR9","doi-asserted-by":"crossref","unstructured":"Beimel, A.: Secret-sharing schemes: a survey. In: Coding and Cryptology (Qingdao 2011). Lecture Notes in Comput. Sci., vol. 6639, pp. 11\u201346. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-20901-7_2"},{"issue":"4","key":"376_CR10","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"A Blumer","year":"1989","unstructured":"Blumer, A., Ehrenfeucht, A., Haussler, D., Warmuth, M.K.: Learnability and the Vapnik\u2013Chervonenkis dimension. J. Assoc. Comput. Mach. 36(4), 929\u2013965 (1989)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"5","key":"376_CR11","doi-asserted-by":"publisher","first-page":"1552","DOI":"10.1137\/S0097539796260321","volume":"28","author":"H Br\u00f6nnimann","year":"1999","unstructured":"Br\u00f6nnimann, H., Chazelle, B., Matou\u0161ek, J.: Product range spaces, sensitive sampling, and derandomization. SIAM J. Comput. 28(5), 1552\u20131575 (1999)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"376_CR12","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/BF02570718","volume":"14","author":"H Br\u00f6nnimann","year":"1995","unstructured":"Br\u00f6nnimann, H., Goodrich, M.T.: Almost optimal set covers in finite VC-dimension. Discrete Comput. Geom. 14(4), 463\u2013479 (1995)","journal-title":"Discrete Comput. Geom."},{"key":"376_CR13","unstructured":"Calabro, Ch.: The Exponential Complexity of Satisfiability Problems. PhD thesis, University of California, San Diego (2009). https:\/\/escholarship.org\/uc\/item\/0pk5w64k"},{"key":"376_CR14","doi-asserted-by":"crossref","unstructured":"Chan, T.M.: Improved deterministic algorithms for linear programming in low dimensions. ACM Trans. Algorithms 14(3), #\u00a030 (2018)","DOI":"10.1145\/3155312"},{"issue":"3","key":"376_CR15","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1006\/jagm.1996.0060","volume":"21","author":"B Chazelle","year":"1996","unstructured":"Chazelle, B., Matou\u0161ek, J.: On linear-time deterministic algorithms for optimization problems in fixed dimension. J. Algorithms 21(3), 579\u2013597 (1996)","journal-title":"J. Algorithms"},{"issue":"5","key":"376_CR16","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/BF02187740","volume":"4","author":"KL Clarkson","year":"1989","unstructured":"Clarkson, K.L., Shor, P.W.: Applications of random sampling in computational geometry. II. Discrete Comput. Geom. 4(5), 387\u2013421 (1989)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"376_CR17","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s00454-006-1273-8","volume":"37","author":"KL Clarkson","year":"2007","unstructured":"Clarkson, K.L., Varadarajan, K.: Improved approximation algorithms for geometric set cover. Discrete Comput. Geom. 37(1), 43\u201358 (2007)","journal-title":"Discrete Comput. Geom."},{"key":"376_CR18","unstructured":"Dudley, R.M.: Notes on empirical processes. Lecture notes, Aarhus Universitet (2000)"},{"issue":"4","key":"376_CR19","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1007\/s00454-019-00075-0","volume":"61","author":"K Dutta","year":"2019","unstructured":"Dutta, K., Ghosh, A., Jartoux, B., Mustafa, N.H.: Shallow packings, semialgebraic set systems, Macbeath regions, and polynomial partitioning. Discrete Comput. Geom. 61(4), 756\u2013777 (2019)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"376_CR20","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1016\/j.ipl.2005.03.010","volume":"95","author":"G Even","year":"2005","unstructured":"Even, G., Rawitz, D., Shahar, Sh.: Hitting sets when the VC-dimension is small. Inf. Process. Lett. 95(2), 358\u2013362 (2005)","journal-title":"Inf. Process. Lett."},{"key":"376_CR21","doi-asserted-by":"crossref","unstructured":"Grelier, N., Ilchi, S.Gh., Miltzow, T., Smorodinsky, Sh.: On the VC-dimension of half-spaces with respect to convex sets. Discrete Math. Theor. Comput. Sci. 23(3), #\u00a02 (2021)","DOI":"10.46298\/dmtcs.6631"},{"issue":"2","key":"376_CR22","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF02187876","volume":"2","author":"D Haussler","year":"1987","unstructured":"Haussler, D., Welzl, E.: $$\\varepsilon $$-nets and simplex range queries. Discrete Comput. Geom. 2(2), 127\u2013151 (1987)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"376_CR23","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF02187683","volume":"1","author":"K Kedem","year":"1986","unstructured":"Kedem, K., Livn\u00e9, R., Pach, J., Sharir, M.: On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discrete Comput. Geom. 1(1), 59\u201371 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"376_CR24","doi-asserted-by":"crossref","unstructured":"Keevash, P.: Hypergraph Tur\u00e1n problems. In: Surveys in Combinatorics 2011 (Exeter 2011). London Math. Soc. Lecture Note Ser., vol. 392, pp. 83\u2013139. Cambridge University Press, Cambridge (2011)","DOI":"10.1017\/CBO9781139004114.004"},{"issue":"3","key":"376_CR25","doi-asserted-by":"publisher","first-page":"916","DOI":"10.1007\/s00454-019-00097-8","volume":"64","author":"Ch Keller","year":"2020","unstructured":"Keller, Ch., Smorodinsky, Sh.: Conflict-free coloring of intersection graphs of geometric objects. Discrete Comput. Geom. 64(3), 916\u2013941 (2020)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"376_CR26","doi-asserted-by":"publisher","first-page":"942","DOI":"10.1007\/s00454-019-00142-6","volume":"64","author":"B Keszegh","year":"2020","unstructured":"Keszegh, B.: Coloring intersection hypergraphs of pseudo-disks. Discrete Comput. Geom. 64(3), 942\u2013964 (2020)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"376_CR27","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF02187833","volume":"7","author":"J Koml\u00f3s","year":"1992","unstructured":"Koml\u00f3s, J., Pach, J., Woeginger, G.: Almost tight bounds for $$\\varepsilon $$-nets. Discrete Comput. Geom. 7(2), 163\u2013173 (1992)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"376_CR28","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1006\/jcss.2000.1741","volume":"62","author":"Y Li","year":"2001","unstructured":"Li, Y., Long, P.M., Srinivasan, A.: Improved bounds on the sample complexity of learning. J. Comput. System Sci. 62(3), 516\u2013527 (2001)","journal-title":"J. Comput. System Sci."},{"key":"376_CR29","unstructured":"Liu, C.L.: Introduction to Combinatorial Mathematics. McGraw-Hill, New York\u2013Toronto\u2013London (1968)"},{"issue":"2","key":"376_CR30","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1006\/jcss.1995.1018","volume":"50","author":"J Matou\u0161ek","year":"1995","unstructured":"Matou\u0161ek, J.: Approximations and optimal geometric divide-and-conquer. J. Comput. System Sci. 50(2), 203\u2013208 (1995)","journal-title":"J. Comput. System Sci."},{"key":"376_CR31","doi-asserted-by":"crossref","unstructured":"Matou\u0161ek, J.: Geometric Discrepancy. Algorithms and Combinatorics, vol. 18. Springer, Berlin (1999)","DOI":"10.1007\/978-3-642-03942-3"},{"key":"376_CR32","doi-asserted-by":"crossref","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry. Graduate Texts in Mathematics, vol. 212. Springer, New York (2002)","DOI":"10.1007\/978-1-4613-0039-7"},{"key":"376_CR33","doi-asserted-by":"crossref","unstructured":"Matou\u0161ek, J., Welzl, E., Wernisch, L.: Discrepancy and $$\\varepsilon $$-approximations for bounded VC-dimension. In: 32nd Annual Symposium on Foundations of Computer Science (San Juan 1991), pp. 424\u2013430. IEEE, Los Alamitos (1991)","DOI":"10.1109\/SFCS.1991.185401"},{"issue":"3","key":"376_CR34","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/s00454-016-9845-8","volume":"57","author":"NH Mustafa","year":"2017","unstructured":"Mustafa, N.H., Ray, S.: $$\\varepsilon $$-Mnets: hitting geometric set systems with subsets. Discrete Comput. Geom. 57(3), 625\u2013640 (2017)","journal-title":"Discrete Comput. Geom."},{"key":"376_CR35","unstructured":"Mustafa, N.H., Varadarajan, K.: Epsilon-approximations & epsilon-nets. In: Handbook of Discrete and Computational Geometry, 3rd ed., pp. 1241\u20131267. CRC Press, Boca Raton (2018)"},{"issue":"3","key":"376_CR36","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1090\/S0894-0347-2012-00759-0","volume":"26","author":"J Pach","year":"2013","unstructured":"Pach, J., Tardos, G.: Tight lower bounds for the size of epsilon-nets. J. Am. Math. Soc. 26(3), 645\u2013658 (2013)","journal-title":"J. Am. Math. Soc."},{"key":"376_CR37","doi-asserted-by":"crossref","unstructured":"Pyrga, E., Ray, S.: New existence proofs for $$\\epsilon $$-nets. In: 24th Annual Symposium on Computational Geometry (College Park 2008), pp. 199\u2013207. ACM, New York (2008)","DOI":"10.1145\/1377676.1377708"},{"issue":"8","key":"376_CR38","doi-asserted-by":"publisher","first-page":"3501","DOI":"10.1137\/090764190","volume":"39","author":"Y Rabani","year":"2010","unstructured":"Rabani, Y., Shpilka, A.: Explicit construction of a small $$\\epsilon $$-net for linear threshold functions. SIAM J. Comput. 39(8), 3501\u20133520 (2010)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"376_CR39","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1007\/s00454-020-00216-w","volume":"64","author":"R Raman","year":"2020","unstructured":"Raman, R., Ray, S.: Constructing planar support for non-piercing regions. Discrete Comput. Geom. 64(3), 1098\u20131122 (2020)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"376_CR40","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0097-3165(72)90019-2","volume":"13","author":"N Sauer","year":"1972","unstructured":"Sauer, N.: On the density of families of sets. J. Combin. Theory Ser. A 13(1), 145\u2013147 (1972)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"3","key":"376_CR41","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1002\/jgt.22601","volume":"95","author":"A Scott","year":"2020","unstructured":"Scott, A., Seymour, P.: A survey of $$\\chi $$-boundedness. J. Graph Theory 95(3), 473\u2013504 (2020)","journal-title":"J. Graph Theory"},{"issue":"11","key":"376_CR42","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"376_CR43","doi-asserted-by":"publisher","first-page":"247","DOI":"10.2140\/pjm.1972.41.247","volume":"41","author":"S Shelah","year":"1972","unstructured":"Shelah, S.: A combinatorial problem; stability and order for models and theories in infinitary languages. Pacific J. Math. 41, 247\u2013261 (1972)","journal-title":"Pacific J. Math."},{"key":"376_CR44","doi-asserted-by":"crossref","unstructured":"Simmons, G.J.: How to (really) share a secret. In: Advances in Cryptology (Santa Barbara 1988). Lecture Notes in Comput. Sci., vol. 403, pp. 390\u2013448. Springer, Berlin (1990)","DOI":"10.1007\/0-387-34799-2_30"},{"issue":"1","key":"376_CR45","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1214\/aop\/1176988847","volume":"22","author":"M Talagrand","year":"1994","unstructured":"Talagrand, M.: Sharper bounds for Gaussian and empirical processes. Ann. Probab. 22(1), 28\u201376 (1994)","journal-title":"Ann. Probab."},{"issue":"2","key":"376_CR46","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s00145-006-0334-8","volume":"20","author":"T Tassa","year":"2007","unstructured":"Tassa, T.: Hierarchical threshold secret sharing. J. Cryptol. 20(2), 237\u2013264 (2007)","journal-title":"J. Cryptol."},{"key":"376_CR47","doi-asserted-by":"crossref","unstructured":"Vapnik, V.N., Chervonenkis, A.Ya.: On the uniform convergence of relative frequencies of events to their probabilities. Theor. Prob. Appl. 16(2), 264\u2013280 (1971)","DOI":"10.1137\/1116025"},{"issue":"3","key":"376_CR48","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0095-8956(80)90093-3","volume":"29","author":"S Wagon","year":"1980","unstructured":"Wagon, S.: A bound on the chromatic number of graphs without certain induced subgraphs. J. Combin. Theory Ser. B 29(3), 345\u2013346 (1980)","journal-title":"J. Combin. Theory Ser. B"},{"key":"376_CR49","doi-asserted-by":"crossref","unstructured":"Welzl, E.: Partition trees for triangle counting and other range searching problems. In: 4th Annual Symposium on Computational Geometry (Urbana 1988), pp. 23\u201333. ACM, New York (1988)","DOI":"10.1145\/73393.73397"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-022-00376-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00454-022-00376-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-022-00376-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T21:48:51Z","timestamp":1726782531000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00454-022-00376-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,7]]},"references-count":49,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["376"],"URL":"https:\/\/doi.org\/10.1007\/s00454-022-00376-x","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2022,3,7]]},"assertion":[{"value":"14 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 October 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}