{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:38:03Z","timestamp":1757453883477,"version":"3.40.3"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031780165"},{"type":"electronic","value":"9783031780172"}],"license":[{"start":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T00:00:00Z","timestamp":1732752000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T00:00:00Z","timestamp":1732752000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-78017-2_1","type":"book-chapter","created":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T23:48:45Z","timestamp":1732751325000},"page":"3-35","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Quantum Pseudorandom Scramblers"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-3359-320X","authenticated-orcid":false,"given":"Chuhan","family":"Lu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0004-8760-5498","authenticated-orcid":false,"given":"Minglong","family":"Qin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3098-6451","authenticated-orcid":false,"given":"Fang","family":"Song","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4104-2069","authenticated-orcid":false,"given":"Penghui","family":"Yao","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0006-9623-9703","authenticated-orcid":false,"given":"Mingnan","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,11,28]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","unstructured":"Aaronson, S., et al.: Quantum pseudoentanglement. In: 15th Innovations in Theoretical Computer Science Conference (ITCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0287, pp. 2:1\u20132:21. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2024). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2024.2","DOI":"10.4230\/LIPIcs.ITCS.2024.2"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/978-3-030-45727-3_26","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"G Alagic","year":"2020","unstructured":"Alagic, G., Majenz, C., Russell, A.: Efficient simulation of random states and random unitaries. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12107, pp. 759\u2013787. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_26"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Ananth, P., Gulati, A., Kaleoglu, F., Lin, Y.T.: Pseudorandom isometries. In: Advances in Cryptology \u2013 EUROCRYPT 2024, pp. 226\u2013254. Springer, Cham (2024)","DOI":"10.1007\/978-3-031-58737-5_9"},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Ananth, P., Gulati, A., Qian, L., Yuen, H.: Pseudorandom (function-like) quantum state generators: new definitions and\u00a0applications. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC 2022, Part I, pp. 237\u2013265. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_9","DOI":"10.1007\/978-3-031-22318-1_9"},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"Ananth, P., Qian, L., Yuen, H.: Cryptography from\u00a0pseudorandom quantum states. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part I, pp. 208\u2013236. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_8","DOI":"10.1007\/978-3-031-15802-5_8"},{"key":"1_CR6","unstructured":"Behera, A., Sattath, O.: Almost public quantum coins. arXiv preprint arXiv:2002.12438 (2020)"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Bouland, A., Fefferman, B., Vazirani, U.: Computational pseudorandomness, the wormhole growth paradox, and constraints on the AdS\/CFT duality. In: 11th Innovations in Theoretical Computer Science Conference (ITCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0151, pp. 63:1\u201363:2. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2020.63","DOI":"10.4230\/LIPIcs.ITCS.2020.63"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Magrafta, N.: Real-valued somewhat-pseudorandom unitaries (2024)","DOI":"10.1007\/978-3-031-78017-2_2"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-030-36030-6_10","volume-title":"Theory of Cryptography","author":"Z Brakerski","year":"2019","unstructured":"Brakerski, Z., Shmueli, O.: (Pseudo) Random quantum states with binary phase. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11891, pp. 229\u2013250. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_10"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-030-56880-1_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"Z Brakerski","year":"2020","unstructured":"Brakerski, Z., Shmueli, O.: Scalable pseudorandom quantum states. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 417\u2013440. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_15"},{"key":"1_CR11","doi-asserted-by":"publisher","unstructured":"Brand\u00e3o, F.G., Chemissany, W., Hunter-Jones, N., Kueng, R., Preskill, J.: Models of quantum complexity growth. PRX Quantum 2, 030316 (2021). https:\/\/doi.org\/10.1103\/PRXQuantum.2.030316","DOI":"10.1103\/PRXQuantum.2.030316"},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Brand\u00e3o, F.G., Harrow, A.W., Horodecki, M.: Local random quantum circuits are approximate polynomial-designs. Commun. Math. Phys. 346, 397\u2013434 (2016). https:\/\/doi.org\/10.1007\/s00220-016-2706-8","DOI":"10.1007\/s00220-016-2706-8"},{"key":"1_CR13","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.105.022606","volume":"105","author":"A Broadbent","year":"2022","unstructured":"Broadbent, A., Gonz\u00e1lez-Guill\u00e9n, C.E., Schuknecht, C.: Quantum private broadcasting. Phys. Rev. A 105, 022606 (2022). https:\/\/doi.org\/10.1103\/PhysRevA.105.022606","journal-title":"Phys. Rev. A"},{"issue":"4","key":"1_CR14","doi-asserted-by":"publisher","first-page":"1400","DOI":"10.1137\/21M140729X","volume":"51","author":"A Broadbent","year":"2022","unstructured":"Broadbent, A., Grilo, A.B.: QMA-hardness of consistency of local density matrices with applications to quantum zero-knowledge. SIAM J. Comput. 51(4), 1400\u20131450 (2022). https:\/\/doi.org\/10.1137\/21M140729X","journal-title":"SIAM J. Comput."},{"issue":"2","key":"1_CR15","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1137\/18M1193530","volume":"49","author":"A Broadbent","year":"2020","unstructured":"Broadbent, A., Ji, Z., Song, F., Watrous, J.: Zero-knowledge proof systems for QMA. SIAM J. Comput. 49(2), 245\u2013283 (2020). https:\/\/doi.org\/10.1137\/18M1193530","journal-title":"SIAM J. Comput."},{"issue":"1","key":"1_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1214\/21-AOP1526","volume":"50","author":"S Chatterjee","year":"2022","unstructured":"Chatterjee, S., Diaconis, P., Sly, A., Zhang, L.: A phase transition for repeated averages. Ann. Probab. 50(1), 1\u201317 (2022). https:\/\/doi.org\/10.1214\/21-AOP1526","journal-title":"Ann. Probab."},{"key":"1_CR17","unstructured":"Chen, C.F., Bouland, A., Brand\u00e3o, F.G.S.L., Docter, J., Hayden, P., Xu, M.: Efficient unitary designs and pseudorandom unitaries from permutations (2024)"},{"key":"1_CR18","unstructured":"Coladangelo, A.: Quantum trapdoor functions from classical one-way functions. arXiv preprint arXiv:2302.12821 (2023)"},{"issue":"1","key":"1_CR19","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.80.012304","volume":"80","author":"C Dankert","year":"2009","unstructured":"Dankert, C., Cleve, R., Emerson, J., Livine, E.: Exact and approximate unitary $$2$$-designs and their application to fidelity estimation. Phys. Rev. A 80(1), 012304 (2009). https:\/\/doi.org\/10.1103\/PhysRevA.80.012304","journal-title":"Phys. Rev. A"},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s002200050036","volume":"209","author":"P Diaconis","year":"2000","unstructured":"Diaconis, P., Saloff-Coste, L.: Bounds for Kac\u2019s master equation. Commun. Math. Phys. 209, 729\u2013755 (2000). https:\/\/doi.org\/10.1007\/s002200050036","journal-title":"Commun. Math. Phys."},{"key":"1_CR21","doi-asserted-by":"publisher","unstructured":"Gunn, S., Ju, N., Ma, F., Zhandry, M.: Commitments to quantum states. In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, pp. 1579\u20131588. Association for Computing Machinery (2023). https:\/\/doi.org\/10.1145\/3564246.3585198","DOI":"10.1145\/3564246.3585198"},{"key":"1_CR22","doi-asserted-by":"publisher","unstructured":"Haferkamp, J.: Random quantum circuits are approximate unitary $$t$$-designs in depth $$O\\left(nt^{5+o(1)}\\right)$$. Quantum 6, 795 (2022). https:\/\/doi.org\/10.22331\/q-2022-09-08-795","DOI":"10.22331\/q-2022-09-08-795"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/978-3-642-03685-9_41","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"AW Harrow","year":"2009","unstructured":"Harrow, A.W., Low, R.A.: Efficient quantum tensor product expanders and k-designs. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX\/RANDOM -2009. LNCS, vol. 5687, pp. 548\u2013561. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03685-9_41"},{"issue":"2","key":"1_CR24","doi-asserted-by":"publisher","first-page":"1531","DOI":"10.1007\/s00220-023-04675-z","volume":"401","author":"AW Harrow","year":"2023","unstructured":"Harrow, A.W., Mehraban, S.: Approximate unitary t-designs by short random quantum circuits using nearest-neighbor and long-range gates. Commun. Math. Phys. 401(2), 1531\u20131626 (2023). https:\/\/doi.org\/10.1007\/s00220-023-04675-z","journal-title":"Commun. Math. Phys."},{"issue":"1","key":"1_CR25","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1093\/biomet\/57.1.97","volume":"57","author":"WK Hastings","year":"1970","unstructured":"Hastings, W.K.: Monte Carlo sampling methods using Markov chains and their applications. Biometrika 57(1), 97\u2013109 (1970). https:\/\/doi.org\/10.1093\/biomet\/57.1.97","journal-title":"Biometrika"},{"key":"1_CR26","unstructured":"Haug, T., Bharti, K., Koh, D.E.: Pseudorandom unitaries are neither real nor sparse nor noise-robust. arXiv preprint arXiv:2306.11677 (2023)"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Hough, B., Jiang, Y.: Cut-off phenomenon in the uniform plane Kac walk. Annals Prob. 45(4), 2248\u20132308 (2017). http:\/\/www.jstor.org\/stable\/26362254","DOI":"10.1214\/16-AOP1111"},{"issue":"5","key":"1_CR28","doi-asserted-by":"publisher","first-page":"4038","DOI":"10.1214\/22-AAP1784","volume":"32","author":"V Jain","year":"2022","unstructured":"Jain, V., Pillai, N.S., Sah, A., Sawhney, M., Smith, A.: Fast and memory-optimal dimension reduction using Kac\u2019s walk. Ann. Appl. Probab. 32(5), 4038\u20134064 (2022). https:\/\/doi.org\/10.1214\/22-AAP1784","journal-title":"Ann. Appl. Probab."},{"issue":"3","key":"1_CR29","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1137\/S0040585X97979950","volume":"47","author":"\u00c9 Janvresse","year":"2003","unstructured":"Janvresse, \u00c9.: Bounds on semigroups of random rotations on $${\\rm SO}(n)$$. Theory Prob. Appl. 47(3), 526\u2013532 (2003). https:\/\/doi.org\/10.1137\/S0040585X97979950","journal-title":"Theory Prob. Appl."},{"key":"1_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-319-96878-0_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"Z Ji","year":"2018","unstructured":"Ji, Z., Liu, Y.-K., Song, F.: Pseudorandom Quantum States. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10993, pp. 126\u2013152. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_5"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Jiang, Y.: Total variation bound for Kac\u2019s random walk. In: The Annals of Applied Probability, pp. 1712\u20131727 (2012). https:\/\/www.jstor.org\/stable\/41713374","DOI":"10.1214\/11-AAP810"},{"key":"1_CR32","unstructured":"Kac, M.: Foundations of kinetic theory. In: Third Berkeley symposium on mathematical statistics and probability. vol.\u00a03, pp. 171\u2013197 (1956)"},{"issue":"6","key":"1_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/JHEP06(2020)031","volume":"2020","author":"I Kim","year":"2020","unstructured":"Kim, I., Tang, E., Preskill, J.: The ghost in the radiation: robust encodings of the black hole interior. J. High Energy Phys. 2020(6), 1\u201365 (2020). https:\/\/doi.org\/10.1007\/JHEP06(2020)031","journal-title":"J. High Energy Phys."},{"key":"1_CR34","doi-asserted-by":"publisher","unstructured":"Kretschmer, W.: Quantum pseudorandomness and classical complexity. In: 16th Conference on the Theory of Quantum Computation, Communication and Cryptography \u2013 TQC 2021, pp. 2:1\u20132:20. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.TQC.2021.2","DOI":"10.4230\/LIPIcs.TQC.2021.2"},{"key":"1_CR35","doi-asserted-by":"publisher","unstructured":"Kretschmer, W., Qian, L., Sinha, M., Tal, A.: Quantum cryptography in algorithmica. In: 55th Annual ACM Symposium on Theory of Computing (STOC 2023). pp. 1589\u20131602 (2023). https:\/\/doi.org\/10.1145\/3564246.3585225","DOI":"10.1145\/3564246.3585225"},{"key":"1_CR36","unstructured":"Lu, C., Qin, M., Song, F., Yao, P., Zhao, M.: Quantum pseudorandom scramblers. Cryptology ePrint Archive, Paper 2024\/1470 (2024). https:\/\/eprint.iacr.org\/2024\/1470"},{"key":"1_CR37","doi-asserted-by":"crossref","unstructured":"Metger, T., Poremba, A., Sinha, M., Yuen, H.: Simple constructions of linear-depth t-designs and pseudorandom unitaries (2024)","DOI":"10.1109\/FOCS61266.2024.00038"},{"key":"1_CR38","doi-asserted-by":"publisher","unstructured":"Morimae, T., Yamakawa, T.: Quantum commitments and signatures without one-way functions. In: Advances in Cryptology \u2013 CRYPTO 2022, pp. 269\u2013295. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_10","DOI":"10.1007\/978-3-031-15802-5_10"},{"key":"1_CR39","unstructured":"Movassagh, R., Szegedy, M., Wang, G.: Repeated averages on graphs. arXiv:2205.04535 (2022)"},{"key":"1_CR40","doi-asserted-by":"publisher","unstructured":"O\u2019Donnell, R., Servedio, R.A., Paredes, P.: Explicit orthogonal and unitary designs. In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), pp. 1240\u20131260. IEEE Computer Society (2023). https:\/\/doi.org\/10.1109\/FOCS57990.2023.00073","DOI":"10.1109\/FOCS57990.2023.00073"},{"key":"1_CR41","doi-asserted-by":"crossref","unstructured":"Oliveira, R.I.: On the convergence to equilibrium of Kac\u2019s random walk on matrices. Annals Appl. Probab. 19(3), 1200\u20131231 (2009). https:\/\/www.jstor.org\/stable\/30243617","DOI":"10.1214\/08-AAP550"},{"issue":"1","key":"1_CR42","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1214\/16-AAP1214","volume":"27","author":"NS Pillai","year":"2017","unstructured":"Pillai, N.S., Smith, A.: Kac\u2019s walk on $$ n $$-sphere mixes in $$ n\\log n $$ steps. Ann. Appl. Probab. 27(1), 631\u2013650 (2017). https:\/\/doi.org\/10.1214\/16-AAP1214","journal-title":"Ann. Appl. Probab."},{"key":"1_CR43","doi-asserted-by":"crossref","unstructured":"Pillai, N.S., Smith, A.: On the mixing time of Kac\u2019s walk and other high-dimensional Gibbs samplers with constraints. Annals Probab. 46(4), 2345\u20132399 (2018). https:\/\/www.jstor.org\/stable\/26506605","DOI":"10.1214\/17-AOP1230"},{"issue":"6","key":"1_CR44","doi-asserted-by":"publisher","first-page":"2171","DOI":"10.1063\/1.1737053","volume":"45","author":"JM Renes","year":"2004","unstructured":"Renes, J.M., Blume-Kohout, R., Scott, A.J., Caves, C.M.: Symmetric informationally complete quantum measurements. J. Math. Phys. 45(6), 2171\u20132180 (2004). https:\/\/doi.org\/10.1063\/1.1737053","journal-title":"J. Math. Phys."},{"key":"1_CR45","unstructured":"Yang, L., Engelhardt, N.: The complexity of learning (pseudo)random dynamics of black holes and other chaotic systems. arXiv preprint arXiv:2302.11013 (2023)"},{"key":"1_CR46","unstructured":"Zhandry, M.: A note on quantum-secure PRPs. Cryptology ePrint Archive, Paper 2016\/1076 (2016). https:\/\/eprint.iacr.org\/2016\/1076"},{"key":"1_CR47","doi-asserted-by":"publisher","unstructured":"Zhandry, M.: How to construct quantum random functions. J. ACM 68(5), 1\u201343 (2021). https:\/\/doi.org\/10.1145\/3450745","DOI":"10.1145\/3450745"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-78017-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T04:48:46Z","timestamp":1733114926000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78017-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,28]]},"ISBN":["9783031780165","9783031780172"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78017-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,11,28]]},"assertion":[{"value":"28 November 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}