{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:39:54Z","timestamp":1742989194570,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031812408"},{"type":"electronic","value":"9783031812415"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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-81241-5_31","type":"book-chapter","created":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T13:45:21Z","timestamp":1735652721000},"page":"368-375","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A DCA-Like Based Algorithm for\u00a0the\u00a0Merkle Tree Construction Problem in\u00a0Ethereum Cryptocurrency System"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-9821-2791","authenticated-orcid":false,"given":"Thi Tuyet Trinh","family":"Nguyen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2239-2100","authenticated-orcid":false,"given":"Hoai An","family":"Le Thi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,1]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Gregoriadis, M., Muth, R., Florian, M.: Analysis of arbitrary content on blockchain-based systems using bigquery. In: Companion Proceedings of the Web Conference 2022, pp. 478\u2013487 (2022)","DOI":"10.1145\/3487553.3524628"},{"key":"31_CR2","unstructured":"Le, H.M.: Contribution au d\u00e9veloppement des m\u00e9thodes avanc\u00e9es de la programmation DC et DCA pour certaines classes de probl\u00e8mes d\u2019optimisation non-convexes. Applications en apprentissage automatique. Habilitation \u00e0 diriger des recherches, Universit\u00e9 de Lorraine (2022). https:\/\/hal.science\/tel-03604317"},{"key":"31_CR3","volume":"409","author":"HA Le Thi","year":"2021","unstructured":"Le Thi, H.A., Le, H.M., Phan, D.N., Tran, B.: Novel DCA based algorithms for a special class of nonconvex problems with application in machine learning. Appl. Math. Comput. 409, 125904 (2021)","journal-title":"Appl. Math. Comput."},{"key":"31_CR4","unstructured":"Levitin, A.: Introduction To the Design And Analysis Of Algorithms, 3rd edition. Pearson Education, Inc. (2012)"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Merkle, R.C.: A digital signature based on a conventional encryption function. In: Conference on the Theory and Application of Cryptographic Techniques, pp. 369\u2013378. Springer, Heidelberg (1987)","DOI":"10.1007\/3-540-48184-2_32"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Mizrahi, A., Koren, N., Rottenstreich, O.: Optimizing Merkle proof size for blockchain transactions. In: 2021 International Conference on COMmunication Systems & NETworkS (COMSNETS), pp. 299\u2013307 (2021)","DOI":"10.1109\/COMSNETS51098.2021.9352820"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Mu\u00f1oz, J.L., Forn\u00e9, J., Esparza, O., Rey, M.: Efficient certificate revocation system implementation: Huffman Merkle Hash Tree (HuffMHT). In: International Conference on Trust. Privacy and Security in Digital Business, pp. 119\u2013127. Springer, Heidelberg (2005)","DOI":"10.1007\/11537878_13"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Nguyen, T.T.T., Le\u00a0Thi, H.A., Doan, X.V.: Optimizing Merkle tree structure for Blockchain transactions by a DC Programming approach. In: Proceedings of the 15th International Conference on Computational Collective Intelligence ICCCI 2023. Springer, (forthcoming)","DOI":"10.1007\/978-3-031-41456-5_31"},{"issue":"4","key":"31_CR9","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s10898-009-9507-y","volume":"48","author":"T Pham Dinh","year":"2010","unstructured":"Pham Dinh, T., Nguyen, C.N., Le Thi, H.A.: An efficient combined DCA and B &B using DC\/SDP relaxation for globally solving binary quadratic programs. J. Glob. Optim. 48(4), 595\u2013632 (2010)","journal-title":"J. Glob. Optim."},{"key":"31_CR10","first-page":"1","volume":"151","author":"G Wood","year":"2014","unstructured":"Wood, G., et al.: Ethereum: a secure decentralised generalised transaction ledger. Ethereum Proj. Yellow Pap. 151, 1\u201332 (2014)","journal-title":"Ethereum Proj. Yellow Pap."}],"container-title":["Lecture Notes in Computer Science","Numerical Computations: Theory and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-81241-5_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T14:05:07Z","timestamp":1735653907000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-81241-5_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031812408","9783031812415"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-81241-5_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NUMTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Numerical Computations: Theory and Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pizzo Calabro","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"numta2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.numta.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}