{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T14:14:24Z","timestamp":1764080064977,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031630200"},{"type":"electronic","value":"9783031630217"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-63021-7_1","type":"book-chapter","created":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:02:29Z","timestamp":1718974949000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Computing Sets of\u00a0Integers with\u00a0Maximum Number of\u00a0Pairs Summing to\u00a0Powers of\u00a02"],"prefix":"10.1007","author":[{"given":"Max A.","family":"Alekseyev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,22]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-57265-8","volume-title":"Proofs from THE BOOK","author":"M Aigner","year":"2018","unstructured":"Aigner, M., Ziegler, G.M.: Proofs from THE BOOK, 6th edn. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-662-57265-8","edition":"6"},{"unstructured":"Bolan, M.: Stan Wagon 1321 Solution. Memo (2022). https:\/\/oeis.org\/A352178\/a352178.pdf","key":"1_CR2"},{"key":"1_CR3","doi-asserted-by":"publisher","DOI":"10.1201\/b11066","volume-title":"Lattice Basis Reduction: An Introduction to the LLL Algorithm and Its Applications","author":"MR Bremner","year":"2011","unstructured":"Bremner, M.R.: Lattice Basis Reduction: An Introduction to the LLL Algorithm and Its Applications. CRC Press, Boca Raton (2011)"},{"issue":"1","key":"1_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1002\/jgt.3190130107","volume":"13","author":"CRJ Clapham","year":"1989","unstructured":"Clapham, C.R.J., Flockhart, A., Sheehan, J.: Graphs without four-cycles. J. Graph Theory 13(1), 29\u201347 (1989). https:\/\/doi.org\/10.1002\/jgt.3190130107","journal-title":"J. Graph Theory"},{"unstructured":"Haran, B., Sloane, N.J.A.: Problems with Powers of Two. Numberphile Youtube Channel (2022). https:\/\/youtu.be\/IPoh5C9CcI8","key":"1_CR5"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","volume":"60","author":"BD McKay","year":"2014","unstructured":"McKay, B.D., Piperno, A.: Practical graph isomorphism, II. J. Symb. Comput. 60, 94\u2013112 (2014). https:\/\/doi.org\/10.1016\/j.jsc.2013.09.003","journal-title":"J. Symb. Comput."},{"unstructured":"Melaih, F.: On The OEIS Sequence A352178. Memo (2022). https:\/\/oeis.org\/A352178\/a352178_3.pdf","key":"1_CR7"},{"issue":"3","key":"1_CR8","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF02020254","volume":"9","author":"I Reiman","year":"1958","unstructured":"Reiman, I.: \u00dcber ein Problem von K. Zarankiewicz. Acta Mathematica Academiae Scientiarum Hungarica 9(3), 269\u2013273 (1958). https:\/\/doi.org\/10.1007\/BF02020254","journal-title":"Acta Mathematica Academiae Scientiarum Hungarica"},{"unstructured":"SageMath: version 10.0 (2023). https:\/\/www.sagemath.org\/","key":"1_CR9"},{"issue":"8","key":"1_CR10","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1080\/00029890.2021.1953285","volume":"128","author":"HA ShahAli","year":"2021","unstructured":"ShahAli, H.A., Wagon, S.: Problem 12272. Am. Math. Mon. 128(8), 755\u2013763 (2021). https:\/\/doi.org\/10.1080\/00029890.2021.1953285","journal-title":"Am. Math. Mon."},{"unstructured":"The OEIS Foundation: The On-Line Encyclopedia of Integer Sequences (2023). http:\/\/oeis.org","key":"1_CR11"},{"unstructured":"Ullman, D., Wagon, S.: Problem 1321: Powers of Two. Macalester College Problem of the Week (2021). https:\/\/oeis.org\/A347301\/a347301_1.pdf","key":"1_CR12"},{"issue":"9","key":"1_CR13","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1109\/TCS.1976.1084251","volume":"23","author":"C Van Nuffelen","year":"1976","unstructured":"Van Nuffelen, C.: On the incidence matrix of a graph. IEEE Trans. Circ. Syst. 23(9), 572\u2013572 (1976). https:\/\/doi.org\/10.1109\/TCS.1976.1084251","journal-title":"IEEE Trans. Circ. Syst."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-63021-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:02:46Z","timestamp":1718974966000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63021-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031630200","9783031630217"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63021-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ischia","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":"1 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwoca2024.di.unisa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}