{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T15:49:28Z","timestamp":1740152968977,"version":"3.37.3"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,8,3]],"date-time":"2019-08-03T00:00:00Z","timestamp":1564790400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,3]],"date-time":"2019-08-03T00:00:00Z","timestamp":1564790400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003382","name":"Core Research for Evolutional Science and Technology","doi-asserted-by":"publisher","award":["JPMJCR1402"],"award-info":[{"award-number":["JPMJCR1402"]}],"id":[{"id":"10.13039\/501100003382","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Rev Socionetwork Strat"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s12626-019-00044-2","type":"journal-article","created":{"date-parts":[[2019,8,3]],"date-time":"2019-08-03T07:02:36Z","timestamp":1564815756000},"page":"237-252","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Storing Partitions of Integers in Sublinear Space"],"prefix":"10.1007","volume":"13","author":[{"given":"Kentaro","family":"Sumigawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8212-3682","authenticated-orcid":false,"given":"Kunihiko","family":"Sadakane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,3]]},"reference":[{"issue":"2","key":"44_CR1","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1145\/321812.321820","volume":"21","author":"P Elias","year":"1974","unstructured":"Elias, P. (1974). Efficient storage and retrieval by content and address of static files. Journal of ACM, 21(2), 246\u2013260.","journal-title":"Journal of ACM"},{"issue":"3","key":"44_CR2","doi-asserted-by":"publisher","first-page":"1020","DOI":"10.1007\/s00453-016-0192-1","volume":"78","author":"H El-Zein","year":"2017","unstructured":"El-Zein, H., Lewenstein, M., Munro, J. I., Raman, V., & Chan, T. M. (2017). On the succinct representation of equivalence classes. Algorithmica, 78(3), 1020\u20131040.","journal-title":"Algorithmica"},{"key":"44_CR3","unstructured":"Fano, R. M. (1971). On the number of bits required to implement an associative memory. Massachusetts Institute of Technology, Project MAC."},{"key":"44_CR4","volume-title":"Young Tableaux","author":"W Fulton","year":"2012","unstructured":"Fulton, W. (2012). Young Tableaux. Cambridge: Cambridge University Press."},{"issue":"4","key":"44_CR5","doi-asserted-by":"publisher","first-page":"906","DOI":"10.1007\/s00453-013-9767-2","volume":"69","author":"A Golynski","year":"2014","unstructured":"Golynski, A., Orlandi, A., Raman, R., & Rao, S. S. (2014). Optimal Indexes for Sparse Bit Vectors. Algorithmica, 69(4), 906\u2013924.","journal-title":"Algorithmica"},{"issue":"1","key":"44_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1112\/plms\/s2-17.1.75","volume":"2","author":"GH Hardy","year":"1918","unstructured":"Hardy, G. H., & Ramanujan, S. (1918). Asymptotic formulae in combinatory analysis. Proceedings of the London Mathematical Society, 2(1), 75\u2013115.","journal-title":"Proceedings of the London Mathematical Society"},{"issue":"22","key":"44_CR7","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.tcs.2012.03.005","volume":"438","author":"JI Munro","year":"2012","unstructured":"Munro, J. I., Raman, R., Raman, V., & Rao, S. S. (2012). Succinct representation of permutation ans functions. Theoretical Computer Science, 438(22), 74\u201388.","journal-title":"Theoretical Computer Science"},{"key":"44_CR8","unstructured":"Pibiri, G. E., & Venturini, R. (2017). Dynamic Elias-Fano representation. In: 28th Annual symposium on combinatorial pattern matching (CPM 2017), 78(30), 1\u201314."},{"issue":"4","key":"44_CR9","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/1290672.1290680","volume":"3","author":"R Raman","year":"2007","unstructured":"Raman, R., Raman, V., & Rao, S. S. (2007). Succinct indexable dictionaries with applications to encoding $$k$$-ary trees and multisets. ACM Transactions on Algorithms, 3(4), 43.","journal-title":"ACM Transactions on Algorithms"}],"container-title":["The Review of Socionetwork Strategies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12626-019-00044-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12626-019-00044-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12626-019-00044-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T23:19:41Z","timestamp":1596323981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12626-019-00044-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,3]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["44"],"URL":"https:\/\/doi.org\/10.1007\/s12626-019-00044-2","relation":{},"ISSN":["2523-3173","1867-3236"],"issn-type":[{"type":"print","value":"2523-3173"},{"type":"electronic","value":"1867-3236"}],"subject":[],"published":{"date-parts":[[2019,8,3]]},"assertion":[{"value":"21 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}