{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T23:16:46Z","timestamp":1781479006094,"version":"3.54.1"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319784540","type":"print"},{"value":"9783319784557","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-78455-7_15","type":"book-chapter","created":{"date-parts":[[2018,3,20]],"date-time":"2018-03-20T08:53:10Z","timestamp":1521535990000},"page":"197-211","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Low-Weight Superimposed Codes and\u00a0Their Applications"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3459-1075","authenticated-orcid":false,"given":"Luisa","family":"Gargano","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9124-610X","authenticated-orcid":false,"given":"Adele A.","family":"Rescigno","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4085-7300","authenticated-orcid":false,"given":"Ugo","family":"Vaccaro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,3,21]]},"reference":[{"issue":"4","key":"15_CR1","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1137\/S0895480103431071","volume":"18","author":"N Alon","year":"2005","unstructured":"Alon, N., Asodi, V.: Learning a hidden subgraph. SIAM J. Discr. Math. 18(4), 697\u2013712 (2005)","journal-title":"SIAM J. Discr. Math."},{"key":"15_CR2","series-title":"IMA Volumes in Mathematics and its Applications","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-1-4612-0751-1_8","volume-title":"Genetic Mapping and DNA Sequencing","author":"DJ Balding","year":"1996","unstructured":"Balding, D.J., Bruno, W.J., Torney, D.C., Knill, E.: A comparative survey of non-adaptive pooling design. In: Speed, T.P., Waterman, M.S. (eds.) Genetic Mapping and DNA Sequencing. IMA Volumes in Mathematics and its Applications, vol. 81, pp. 133\u2013154. Springer, New York (1996). https:\/\/doi.org\/10.1007\/978-1-4612-0751-1_8"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-319-21840-3_9","volume-title":"Algorithms and Data Structures","author":"A B\u00e4rtschi","year":"2015","unstructured":"B\u00e4rtschi, A., Grandoni, F.: On conflict-free multi-coloring. In: Dehne, F., Sack, J.-R., Stege, U. (eds.) WADS 2015. LNCS, vol. 9214, pp. 103\u2013114. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21840-3_9"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Kopelowitz, T., Pettie, S., Young, M.: Contention resolution with log-logstar channel accesses. In: Proceedings of STOC 2016, pp. 499\u2013508 (2016)","DOI":"10.1145\/2897518.2897655"},{"issue":"30","key":"15_CR5","doi-asserted-by":"publisher","first-page":"E2752","DOI":"10.1073\/pnas.1216318110","volume":"110","author":"E van den Berg","year":"2013","unstructured":"van den Berg, E., Cand\u00e9s, E., Chinn, G., Levin, C., Olcott, P.D., Sing-Long, C.: Single-photon sampling architecture for solid-state imaging sensors. Proc. Nat. Acad. Sci. U.S.A. 110(30), E2752\u2013E2761 (2013)","journal-title":"Proc. Nat. Acad. Sci. U.S.A."},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/3-540-48169-9_10","volume-title":"Distributed Computing","author":"C Blundo","year":"1999","unstructured":"Blundo, C., Galdi, C., Persiano, P.: Randomness recycling in constant-round private computations. In: Jayanti, P. (ed.) DISC 1999. LNCS, vol. 1693, pp. 140\u2013149. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48169-9_10"},{"key":"15_CR7","doi-asserted-by":"publisher","DOI":"10.5772\/65986","volume-title":"ICT - Energy Concepts for Energy Efficiency and Sustainability","author":"D Boyle","year":"2017","unstructured":"Boyle, D., Kolcun, R., Yeatman, E.: Energy-efficient communication in wireless networks. In: Fagas, G. (ed.) ICT - Energy Concepts for Energy Efficiency and Sustainability. InTech, London (2017). https:\/\/doi.org\/10.5772\/65986"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-319-18173-8_5","volume-title":"Algorithms and Complexity","author":"NH Bshouty","year":"2015","unstructured":"Bshouty, N.H.: Linear time constructions of some $$d$$-restriction problems. In: Paschos, V.T., Widmayer, P. (eds.) CIAC 2015. LNCS, vol. 9079, pp. 74\u201388. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18173-8_5"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Chang, Y.-J., Kopelowitz, T., Pettie, S., Wang, R., Zhan, W.: Exponential separations in the energy complexity of leader election. In: Proceedings of STOC 2017, pp. 771\u2013783 (2017)","DOI":"10.1145\/3055399.3055481"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Chang, Y.-J., Dani, V., Hayes, T.P., He, Q., Li, W., Pettie, S.: The energy complexity of broadcast. arXiv:1710.01800 [cs.DC] (2017)","DOI":"10.1145\/3212734.3212774"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Radhakrishnan, J.: Deterministic restrictions in circuit complexity. In: Proceedings of 28th STOC, pp. 30\u201336 (1996)","DOI":"10.1145\/237814.237824"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s11590-008-0109-2","volume":"3","author":"Y Cheng","year":"2009","unstructured":"Cheng, Y., Du, D.-Z., Lin, G.: On the upper bounds of the minimum number of rows of disjunct matrices. Optim. Lett. 3, 297\u2013302 (2009)","journal-title":"Optim. Lett."},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Proceedings of SODA 2001, pp. 709\u2013718 (2001)","DOI":"10.1145\/383962.384040"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/11537311_24","volume-title":"Fundamentals of Computation Theory","author":"BS Chlebus","year":"2005","unstructured":"Chlebus, B.S., Kowalski, D.R.: Almost optimal explicit selectors. In: Li\u015bkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol. 3623, pp. 270\u2013280. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11537311_24"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-540-75520-3_15","volume-title":"Algorithms \u2013 ESA 2007","author":"R Clifford","year":"2007","unstructured":"Clifford, R., Efremenko, K., Porat, E., Rothschild, A.: k-mismatch with don\u2019t cares. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 151\u2013162. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75520-3_15"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/11780823_22","volume-title":"Structural Information and Communication Complexity","author":"G Cormode","year":"2006","unstructured":"Cormode, G., Muthukrishnan, S.: Combinatorial algorithms for compressed sensing. In: Flocchini, P., Gxcasieniec, L. (eds.) SIROCCO 2006. LNCS, vol. 4056, pp. 280\u2013294. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11780823_22"},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0304-3975(03)00281-0","volume":"306","author":"A De Bonis","year":"2003","unstructured":"De Bonis, A., Vaccaro, U.: Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. Theoret. Comput. Sci. 306, 223\u2013243 (2003)","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"15_CR18","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0097539703428002","volume":"34","author":"A De Bonis","year":"2005","unstructured":"De Bonis, A., Ga\u0327sieniec, L., Vaccaro, U.: Optimal two-stage algorithms for group testing problems. SIAM J. Comput. 34(5), 1253\u20131270 (2005)","journal-title":"SIAM J. Comput."},{"key":"15_CR19","volume-title":"Combinatorial Group Testing and Its Applications","author":"DZ Du","year":"2000","unstructured":"Du, D.Z., Hwang, F.K.: Combinatorial Group Testing and Its Applications. World Scientific, River Edge (2000)"},{"key":"15_CR20","doi-asserted-by":"publisher","DOI":"10.1142\/6122","volume-title":"Pooling Design and Nonadaptive Group Testing","author":"DZ Du","year":"2006","unstructured":"Du, D.Z., Hwang, F.K.: Pooling Design and Nonadaptive Group Testing. World Scientific, Singapore (2006)"},{"key":"15_CR21","unstructured":"D\u2019yachkov, A.G.: Lectures on designing screening experiments, arXiv:1401.7505 (2014)"},{"issue":"3","key":"15_CR22","first-page":"7","volume":"18","author":"AG D\u2019yachkov","year":"1982","unstructured":"D\u2019yachkov, A.G., Rykov, V.V.: Bounds on the length of disjunct codes. Probl. Pereda. Inf. 18(3), 7\u201313 (1982)","journal-title":"Probl. Pereda. Inf."},{"key":"15_CR23","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF02772959","volume":"51","author":"P Erd\u00f6s","year":"1985","unstructured":"Erd\u00f6s, P., Frankl, P., F\u00fcredi, Z.: Families of finite sets in which no set is covered by the union of $$r$$ others. Israel J. of Math. 51, 75\u201389 (1985)","journal-title":"Israel J. of Math."},{"key":"15_CR24","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1136\/jcp.41.5.582","volume":"41","author":"JC Emmanuel","year":"1988","unstructured":"Emmanuel, J.C., Bassett, M.T., Smith, H.J., Jacobs, J.A.: Pooling of sera for human immunodeficiency virus (HIV) testing: an economical method for use in developing countries. J. Clin. Pathol. 41, 582\u2013585 (1988)","journal-title":"J. Clin. Pathol."},{"issue":"5","key":"15_CR25","doi-asserted-by":"publisher","first-page":"1360","DOI":"10.1137\/050631847","volume":"36","author":"D Eppstein","year":"2007","unstructured":"Eppstein, D., Goodrich, M.T., Hirschberg, D.S.: Improved combinatorial group testing algorithms for real-world problem sizes. SIAM J. Comput. 36(5), 1360\u20131375 (2007)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"15_CR26","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1177\/0962280212473514","volume":"25","author":"MM Finucane","year":"2016","unstructured":"Finucane, M.M., Rowley, C.F., Paciorek, C.J., Essex, M., Pagano, M.: Estimating the prevalence of transmitted HIV drug resistance using pooled samples. Stat. Methods Med. Res. 25(2), 917\u2013935 (2016)","journal-title":"Stat. Methods Med. Res."},{"key":"15_CR27","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1006\/jcta.1996.0012","volume":"73","author":"Z F\u00fcredi","year":"1996","unstructured":"F\u00fcredi, Z.: On $$r$$-cover-free families. J. Comb. Theory Ser. A 73, 172\u2013173 (1996)","journal-title":"J. Comb. Theory Ser. A"},{"key":"15_CR28","doi-asserted-by":"crossref","unstructured":"Gandikota, V., Grigorescu, E., Jaggi, S., Zhou, S.: Nearly optimal sparse group testing. In: 54th Annual Allerton Conference on Communication, Control, and Computing, pp. 401\u2013408 (2016)","DOI":"10.1109\/ALLERTON.2016.7852259"},{"key":"15_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-319-71147-8_19","volume-title":"Combinatorial Optimization and Applications","author":"L Gargano","year":"2017","unstructured":"Gargano, L., Rescigno, A.A., Vaccaro, U.: On k-strong conflict\u2013free multicoloring. In: Gao, X., Du, H., Han, M. (eds.) COCOA 2017. LNCS, vol. 10628, pp. 276\u2013290. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71147-8_19"},{"key":"15_CR30","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s00446-008-0058-0","volume":"21","author":"L Gasieniec","year":"2008","unstructured":"Gasieniec, L., Kantor, E., Kowalski, D.R., Peleg, D., Su, C.: Time efficient k-shot broadcasting in known topology radio networks. Distrib. Comput. 21, 117\u2013127 (2008)","journal-title":"Distrib. Comput."},{"issue":"3","key":"15_CR31","first-page":"154","volume":"28","author":"S Gopi","year":"2013","unstructured":"Gopi, S., Netrapalli, P., Jain, P., Nori, A.: One-bit compressed sensing: provable support and vector recovery. JMLR 28(3), 154\u2013162 (2013)","journal-title":"JMLR"},{"key":"15_CR32","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.dam.2015.08.021","volume":"202","author":"E Kantor","year":"2016","unstructured":"Kantor, E., Peleg, D.: Efficient $$k$$-shot broadcasting in radio networks. Discret. Appl. Math. 202, 79\u201394 (2016)","journal-title":"Discret. Appl. Math."},{"key":"15_CR33","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1109\/TIT.1964.1053689","volume":"10","author":"WH Kautz","year":"1964","unstructured":"Kautz, W.H., Singleton, R.C.: Nonrandom binary superimposed codes. IEEE Trans. Inf. Theory 10, 363\u2013377 (1964)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"15_CR34","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.jda.2016.11.004","volume":"42","author":"S Karmakar","year":"2017","unstructured":"Karmakar, S., Koutris, P., Pagourtzis, A., Sakavalas, D.: Energy-efficient broadcasting in ad hoc wireless networks. J. Discret. Algorithms 42, 2\u201313 (2017)","journal-title":"J. Discret. Algorithms"},{"key":"15_CR35","unstructured":"Knuth, D.E.: The Art of Computer Programming, vol. 4, Fascicle 6, Satisfiability (2015)"},{"key":"15_CR36","first-page":"303","volume":"31","author":"J Koml\u00f3s","year":"1985","unstructured":"Koml\u00f3s, J., Greenberg, A.G.: An asymptotically nonadaptive algorithm for conflict resolution in multiple-access channels. IEEE Trans. Inf. Theory 31, 303\u2013306 (1985)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"15_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/3-540-48405-1_38","volume-title":"Advances in Cryptology \u2014 CRYPTO 1999","author":"R Kumar","year":"1999","unstructured":"Kumar, R., Rajagopalan, S., Sahai, A.: Coding constructions for blacklisting problems without computational assumptions. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 609\u2013623. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_38"},{"key":"15_CR38","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graph algorithms. SICOMP 21, 193\u2013201 (1992)","journal-title":"SICOMP"},{"key":"15_CR39","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1109\/TIT.1985.1057010","volume":"31","author":"JL Massey","year":"1985","unstructured":"Massey, J.L., Mathys, P.: The collision channel without feedback. IEEE Trans. Inf. Theory 31, 192\u2013204 (1985)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"15_CR40","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/1667053.1667060","volume":"57","author":"RA Moser","year":"2010","unstructured":"Moser, R.A., Tardos, G.: A constructive proof of the general Lov\u00e1sz local lemma. J. ACM 57(2), 11 (2010)","journal-title":"J. ACM"},{"key":"15_CR41","doi-asserted-by":"crossref","unstructured":"Porat, B., Porat, E.: Exact and approximate pattern matching in the streaming model. In: Proceedings of 50th FOCS, pp. 315\u2013323 (2009)","DOI":"10.1109\/FOCS.2009.11"},{"key":"15_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1007\/978-3-540-70575-8_61","volume-title":"Automata, Languages and Programming","author":"E Porat","year":"2008","unstructured":"Porat, E., Rothschild, A.: Explicit non-adaptive combinatorial group testing schemes. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5125, pp. 748\u2013759. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70575-8_61"},{"key":"15_CR43","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/0097-3165(94)90067-1","volume":"66","author":"M Ruszink\u00f3","year":"1994","unstructured":"Ruszink\u00f3, M.: On the upper bound of the size of the $$r$$-cover-free families. J. Comb. Theory Ser. A 66, 302\u2013310 (1994)","journal-title":"J. Comb. Theory Ser. A"},{"key":"15_CR44","doi-asserted-by":"publisher","first-page":"7518","DOI":"10.1109\/TIT.2016.2614726","volume":"62","author":"C Shangguan","year":"2016","unstructured":"Shangguan, C., Ge, G.: New bounds on the number of tests for disjunct matrices. IEEE Trans. Inf. Theory 62, 7518\u20137521 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"15_CR45","doi-asserted-by":"publisher","first-page":"631","DOI":"10.2307\/1266636","volume":"8","author":"M Sobel","year":"1966","unstructured":"Sobel, M., Groll, P.A.: Binomial group-testing with an unknown proportion of defectives. Technometrics 8(4), 631\u2013656 (1966)","journal-title":"Technometrics"},{"key":"15_CR46","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1109\/TIT.1985.1057026","volume":"31","author":"J Wolf","year":"1985","unstructured":"Wolf, J.: Born again group testing: multiaccess communications. IEEE Trans. Inf. Theory 31, 185\u2013191 (1985)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"15_CR47","unstructured":"Zaverucha, G.: Hash families and cover-free families with cryptographic applications. Ph.D. Thesis, Waterloo, Ontario, Canada (2010)"},{"issue":"13","key":"15_CR48","doi-asserted-by":"publisher","first-page":"1447","DOI":"10.1002\/(SICI)1097-0258(19980715)17:13<1447::AID-SIM862>3.0.CO;2-K","volume":"17","author":"SA Zenios","year":"1998","unstructured":"Zenios, S.A., Wein, L.M.: Pooled testing for HIV prevalence estimation: exploiting the dilution effect. Stat. Med. 17(13), 1447\u20131467 (1998)","journal-title":"Stat. Med."}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-78455-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:30:01Z","timestamp":1709811001000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-78455-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319784540","9783319784557"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-78455-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"21 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/itcs.shufe.edu.cn\/faw2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}