{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T02:49:47Z","timestamp":1781837387247,"version":"3.54.5"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030802226","type":"print"},{"value":"9783030802233","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-80223-3_29","type":"book-chapter","created":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T14:13:49Z","timestamp":1625148829000},"page":"417-435","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["XOR Local Search for Boolean Brent Equations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8839-0618","authenticated-orcid":false,"given":"Wojciech","family":"Nawrocki","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhenjun","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0698-3621","authenticated-orcid":false,"given":"Andreas","family":"Fr\u00f6hlich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5587-8801","authenticated-orcid":false,"given":"Marijn J. H.","family":"Heule","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7170-9242","authenticated-orcid":false,"given":"Armin","family":"Biere","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,7,2]]},"reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-319-09284-3_23","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2014","author":"A Balint","year":"2014","unstructured":"Balint, A., Biere, A., Fr\u00f6hlich, A., Sch\u00f6ning, U.: Improving implementation of SLS solvers for SAT and new heuristics for k-SAT with long clauses. In: Sinz, C., Egly, U. (eds.) SAT 2014. LNCS, vol. 8561, pp. 302\u2013316. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09284-3_23"},{"key":"29_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/978-3-642-14186-7_3","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2010","author":"A Balint","year":"2010","unstructured":"Balint, A., Fr\u00f6hlich, A.: Improving stochastic local search for SAT with a new probability distribution. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol. 6175, pp. 10\u201315. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14186-7_3"},{"key":"29_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-642-31612-8_3","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2012","author":"A Balint","year":"2012","unstructured":"Balint, A., Sch\u00f6ning, U.: Choosing probability distributions for stochastic local search and the role of make versus break. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 16\u201329. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31612-8_3"},{"key":"29_CR4","doi-asserted-by":"publisher","unstructured":"Bard, G.V.: Introduction: How to Use this Book, pp. 1\u20136. Springer, US, Boston, MA (2009). https:\/\/doi.org\/10.1007\/978-0-387-88757-9_1","DOI":"10.1007\/978-0-387-88757-9_1"},{"key":"29_CR5","unstructured":"Bard, G.V., Courtois, N.T., Jefferson., C.: Efficient methods for conversion and solution of sparse systems of low-degree multivariate polynomials over GF(2) via SAT-solvers. Cryptology ePrint Archive, Report 2007\/024 (2007), https:\/\/eprint.iacr.org\/2007\/024"},{"key":"29_CR6","unstructured":"Belov, A., J\u00e4rvisalo, M., Stachniak, Z.: Depth-driven circuit-level stochastic local search for SAT, pp. 504\u2013509 (2011)"},{"key":"29_CR7","unstructured":"Biere, A.: Lingeling and friends entering the SAT challenge 2012. In: Balint, A., Belov, A., Diepold, D., Gerber, S., J\u00e4rvisalo, M., Sinz, C. (eds.) Proceedings of SAT Challenge 2012: Solver and Benchmark Descriptions. Department of Computer Science Series of Publications B, vol. B-2012-2, pp. 33\u201334. University of Helsinki (2012)"},{"key":"29_CR8","unstructured":"Biere, A.: CaDiCaL, Lingeling, Plingeling, Treengeling, YalSAT entering the SAT competition 2017. In: Balyo, T., Heule, M., J\u00e4rvisalo, M. (eds.) Proceedings of SAT Competition 2017 - Solver and Benchmark Descriptions. Department of Computer Science Series of Publications B, vol. B-2017-1, pp. 14\u201315. University of Helsinki (2017)"},{"key":"29_CR9","unstructured":"Biere, A.: CaDiCaL at the SAT Race 2019. In: Heule, M., J\u00e4rvisalo, M., Suda, M. (eds.) Proceedings of SAT Race 2019 - Solver and Benchmark Descriptions. Department of Computer Science Series of Publications B, vol. B-2019-1, pp. 8\u20139. University of Helsinki (2019)"},{"key":"29_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-25513-7_6","volume-title":"Cryptology and Network Security","author":"S Bulygin","year":"2011","unstructured":"Bulygin, S., Buchmann, J.: Algebraic cryptanalysis of the round-reduced and side channel analysis of the Full PRINTCipher-48. In: Lin, D., Tsudik, G., Wang, X. (eds.) CANS 2011. LNCS, vol. 7092, pp. 54\u201375. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25513-7_6"},{"key":"29_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-24318-4_1","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2015","author":"S Cai","year":"2015","unstructured":"Cai, S., Luo, C., Su, K.: CCAnr: a configuration checking based local search solver for non-random satisfiability. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 1\u20138. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24318-4_1"},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.artint.2013.09.001","volume":"204","author":"S Cai","year":"2013","unstructured":"Cai, S., Su, K.: Local search for Boolean satisfiability with configuration checking and subscore. Artif. Intell. 204, 75\u201398 (2013)","journal-title":"Artif. Intell."},{"key":"29_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-642-40627-0_18","volume-title":"Principles and Practice of Constraint Programming","author":"S Chakraborty","year":"2013","unstructured":"Chakraborty, S., Meel, K.S., Vardi, M.Y.: A scalable approximate model counter. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 200\u2013216. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40627-0_18"},{"key":"29_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-642-02777-2_29","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"J Chen","year":"2009","unstructured":"Chen, J.: Building a Hybrid SAT solver via conflict-driven, look-ahead and XOR reasoning techniques. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 298\u2013311. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02777-2_29"},{"key":"29_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/11499107_5","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2005","unstructured":"E\u00e9n, N., Biere, A.: Effective preprocessing in SAT through variable and clause elimination. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 61\u201375. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11499107_5"},{"key":"29_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-030-24258-9_9","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2019","author":"K Fazekas","year":"2019","unstructured":"Fazekas, K., Biere, A., Scholl, C.: Incremental inprocessing in SAT solving. In: Janota, M., Lynce, I. (eds.) SAT 2019. LNCS, vol. 11628, pp. 136\u2013154. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24258-9_9"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Fr\u00f6hlich, A., Biere, A., Wintersteiger, C.M., Hamadi, Y.: Stochastic local search for satisfiability modulo theories. In: Proceedings of AAAI. AAAI, January 2015. https:\/\/www.microsoft.com\/en-us\/research\/publication\/stochastic-local-search-for-satisfiability-modulo-theories\/","DOI":"10.1609\/aaai.v29i1.9372"},{"key":"29_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-319-04921-2_33","volume-title":"Language and Automata Theory and Applications","author":"M Gwynne","year":"2014","unstructured":"Gwynne, M., Kullmann, O.: On SAT representations of XOR constraints. In: Dediu, A.-H., Mart\u00edn-Vide, C., Sierra-Rodr\u00edguez, J.-L., Truthe, B. (eds.) LATA 2014. LNCS, vol. 8370, pp. 409\u2013420. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-04921-2_33"},{"key":"29_CR19","unstructured":"Heule, M.J.H.: SmArT solving: tools and techniques for satisfiability solvers. Ph.D. thesis, Delft University of Technology, Netherlands (2008). http:\/\/resolver.tudelft.nl\/uuid:d41522e3-690a-4eb7-a352-652d39d7ac81"},{"key":"29_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/11527695_12","volume-title":"Theory and Applications of Satisfiability Testing","author":"M Heule","year":"2005","unstructured":"Heule, M., van Maaren, H.: Aligning CNF- and equivalence-reasoning. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 145\u2013156. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11527695_12"},{"key":"29_CR21","unstructured":"Heule, M.J.H., Kauers, M., Seidl, M.: Local search for fast matrix multiplication. CoRR abs\/1903.11391 (2019). http:\/\/arxiv.org\/abs\/1903.11391"},{"key":"29_CR22","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1016\/j.jsc.2020.10.003","volume":"104","author":"MJH Heule","year":"2021","unstructured":"Heule, M.J.H., Kauers, M., Seidl, M.: New ways to multiply 3 $$\\times $$ 3-matrices. J. Symb. Comput. 104, 899\u2013916 (2021). https:\/\/doi.org\/10.1016\/j.jsc.2020.10.003","journal-title":"J. Symb. Comput."},{"key":"29_CR23","unstructured":"Heule, M.J.H., Kullmann, O., Marek, V.W.: Solving and verifying the Boolean Pythagorean triples problem via cube-and-conquer. CoRR abs\/1605.00723 (2016). http:\/\/arxiv.org\/abs\/1605.00723"},{"key":"29_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1007\/11564751_62","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"A Ishtaiwi","year":"2005","unstructured":"Ishtaiwi, A., Thornton, J., Sattar, A., Pham, D.N.: Neighbourhood clause weight redistribution in local search for SAT. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 772\u2013776. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11564751_62"},{"key":"29_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-642-14186-7_30","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2010","author":"M J\u00e4rvisalo","year":"2010","unstructured":"J\u00e4rvisalo, M., Biere, A.: Reconstructing solutions after blocked clause elimination. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol. 6175, pp. 340\u2013345. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14186-7_30"},{"key":"29_CR26","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-642-31365-3_28","volume-title":"Automated Reasoning","author":"M J\u00e4rvisalo","year":"2012","unstructured":"J\u00e4rvisalo, M., Heule, M.J.H., Biere, A.: Inprocessing rules. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS (LNAI), vol. 7364, pp. 355\u2013370. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31365-3_28"},{"key":"29_CR27","unstructured":"Knuth, D.E.: The Art of Computer Programming, vol. 4, Fascicle 6: Satisfiability. Addison-Wesley Professional, 1st edn. (2015)"},{"key":"29_CR28","doi-asserted-by":"crossref","unstructured":"Kuehlmann, A., Paruthi, V., Krohm, F., Ganai, M.K.: Robust Boolean reasoning for equivalence checking and functional property verification. IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst. 21(12), 1377\u20131394 (2002)","DOI":"10.1109\/TCAD.2002.804386"},{"key":"29_CR29","doi-asserted-by":"crossref","unstructured":"Kyrillidis, A., Shrivastava, A., Vardi, M.Y., Zhang, Z.: FourierSAT: a Fourier expansion-based algebraic framework for solving hybrid Boolean constraints (2020)","DOI":"10.1609\/aaai.v34i02.5515"},{"key":"29_CR30","doi-asserted-by":"crossref","unstructured":"Kyrillidis, A., Vardi, M.Y., Zhang, Z.: On continuous local BDD-based search for hybrid SAT solving (2020)","DOI":"10.1609\/aaai.v35i5.16502"},{"key":"29_CR31","doi-asserted-by":"crossref","unstructured":"Leventi-Peetz, A., Zendel, O., Lennartz, W., Weber, K.: CryptoMiniSat switches-optimization for solving cryptographic instances. In: Berre, D.L., J\u00e4rvisalo, M. (eds.) Proceedings of Pragmatics of SAT 2015 and 2018. EPiC Series in Computing, vol. 59, pp. 79\u201393. EasyChair (2019). https:\/\/easychair.org\/publications\/paper\/5g6S","DOI":"10.29007\/4p7m"},{"key":"29_CR32","doi-asserted-by":"crossref","unstructured":"Luo, C., Cai, S., Wu, W., Su, K.: Double configuration checking in stochastic local search for satisfiability, pp. 2703\u20132709 (2014)","DOI":"10.1609\/aaai.v28i1.9110"},{"key":"29_CR33","unstructured":"Pham, D.N., Thornton, J., Sattar, A.: Building structure into local search for SAT. In: Veloso, M.M. (ed.) IJCAI 2007, Proceedings of the 20th International Joint Conference on Artificial Intelligence, 6\u201312 January 2007, Hyderabad, India, pp. 2359\u20132364 (2007). http:\/\/ijcai.org\/Proceedings\/07\/Papers\/380.pdf"},{"key":"29_CR34","doi-asserted-by":"publisher","unstructured":"Selman, B., Kautz, H., Cohen, B.: Local search strategies for satisfiability testing. Cliques, Coloring, and Satisfiability DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 521\u2013531 (1996). https:\/\/doi.org\/10.1090\/dimacs\/026\/25","DOI":"10.1090\/dimacs\/026\/25"},{"key":"29_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-030-53288-8_22","volume-title":"Computer Aided Verification","author":"M Soos","year":"2020","unstructured":"Soos, M., Gocht, S., Meel, K.S.: Tinted, detached, and lazy CNF-XOR solving and its applications to counting and sampling. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020. LNCS, vol. 12224, pp. 463\u2013484. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53288-8_22"},{"key":"29_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-030-24258-9_26","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2019","author":"Mate Soos","year":"2019","unstructured":"Soos, Mate, Kulkarni, Raghav, Meel, Kuldeep S..: $$\\sf CrystalBall$$: gazing in the black box of SAT solving. In: Janota, Mikol\u00e1\u0161, Lynce, In\u00eas. (eds.) SAT 2019. LNCS, vol. 11628, pp. 371\u2013387. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24258-9_26"},{"key":"29_CR37","doi-asserted-by":"crossref","unstructured":"Soos, M., Meel, K.S.: BIRD: engineering an efficient CNF-XOR SAT solver and its applications to approximate model counting. In: AAAI, pp. 1592\u20131599. AAAI Press (2019). http:\/\/dblp.uni-trier.de\/db\/conf\/aaai\/aaai2019.html#SoosM19","DOI":"10.1609\/aaai.v33i01.33011592"},{"key":"29_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-02777-2_24","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"M Soos","year":"2009","unstructured":"Soos, M., Nohl, K., Castelluccia, C.: Extending SAT solvers to cryptographic problems. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 244\u2013257. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02777-2_24"},{"key":"29_CR39","unstructured":"Thornton, J., Pham, D.N., Bain, S., Jr, V.F.: Additive versus multiplicative clause weighting for SAT. In: McGuinness, D.L., Ferguson, G. (eds.) Proceedings of the Nineteenth National Conference on Artificial Intelligence, Sixteenth Conference on Innovative Applications of Artificial Intelligence, 25\u201329 July 2004, San Jose, California, USA, pp. 191\u2013196. AAAI Press\/The MIT Press (2004). http:\/\/www.aaai.org\/Library\/AAAI\/2004\/aaai04-031.php"},{"key":"29_CR40","doi-asserted-by":"crossref","unstructured":"Tseitin, G.S.: On the complexity of derivation in propositional calculus. Automation of Reasoning, pp. 466\u2013483 (1983)","DOI":"10.1007\/978-3-642-81955-1_28"},{"key":"29_CR41","doi-asserted-by":"crossref","unstructured":"Zhang, W., Sun, Z., Zhu, Q., Li, G., Cai, S., Xiong, Y., Zhang, L.: NLocalSAT: boosting local search with solution prediction. In: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, July 2020","DOI":"10.24963\/ijcai.2020\/164"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-80223-3_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,5]],"date-time":"2023-11-05T14:34:12Z","timestamp":1699194852000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-80223-3_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030802226","9783030802233"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-80223-3_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"2 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Satisfiability Testing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Barcelona","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sat2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iiia.csic.es\/sat2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}