{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T04:04:10Z","timestamp":1747541050294,"version":"3.40.5"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031929311","type":"print"},{"value":"9783031929328","type":"electronic"}],"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-92932-8_12","type":"book-chapter","created":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T07:47:19Z","timestamp":1747468039000},"page":"170-186","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Sublinear-Time Moment Estimation Using Weighted Sampling"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-6468-8120","authenticated-orcid":false,"given":"Anup","family":"Bhattacharya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-7132-0435","authenticated-orcid":false,"given":"Pinki","family":"Pradhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,18]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Acharya, J., Canonne, C.L., Kamath, G.: Adaptive estimation in weighted group testing. In: 2015 IEEE International Symposium on Information Theory (ISIT), pp. 2116\u20132120. IEEE (2015)","DOI":"10.1109\/ISIT.2015.7282829"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1007\/s00453-017-0287-3","volume":"80","author":"M Aliakbarpour","year":"2018","unstructured":"Aliakbarpour, M., Biswas, A.S., Gouleakis, T., Peebles, J., Rubinfeld, R., Yodpinyanee, A.: Sublinear-time algorithms for counting star subgraphs via edge sampling. Algorithmica 80, 668\u2013697 (2018)","journal-title":"Algorithmica"},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1006\/jcss.1997.1545","volume":"58","author":"N Alon","year":"1999","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58(1), 137\u2013147 (1999)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR4","unstructured":"Assadi, S., Nguyen, H.A.: Asymptotically optimal bounds for estimating h-index in sublinear time with applications to subgraph counting. arXiv preprint arXiv:2209.08114 (2022)"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Beretta, L., T\u011btek, J.: Better sum estimation via weighted sampling. In: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2303\u20132338. SIAM (2022)","DOI":"10.1137\/1.9781611977073.93"},{"key":"12_CR6","unstructured":"Eden, T., Ron, D., Seshadhri, C.: Sublinear time estimation of degree distribution moments: The degeneracy connection. In: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)"},{"issue":"4","key":"12_CR7","doi-asserted-by":"publisher","first-page":"2267","DOI":"10.1137\/17M1159014","volume":"33","author":"T Eden","year":"2019","unstructured":"Eden, T., Ron, D., Seshadhri, C.: Sublinear time estimation of degree distribution moments: the arboricity connection. SIAM J. Discret. Math. 33(4), 2267\u20132285 (2019)","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"12_CR8","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1137\/S0097539704447304","volume":"35","author":"U Feige","year":"2006","unstructured":"Feige, U.: On sums of independent random variables with unbounded variance and estimating the average degree in a graph. SIAM J. Comput. 35(4), 964\u2013984 (2006)","journal-title":"SIAM J. Comput."},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Introduction to Property Testing. Cambridge University Press, Cambridge (2017)","DOI":"10.1017\/9781108135252"},{"issue":"4","key":"12_CR10","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1002\/rsa.20203","volume":"32","author":"O Goldreich","year":"2008","unstructured":"Goldreich, O., Ron, D.: Approximating average parameters of graphs. Random Struct. Algorithms 32(4), 473\u2013493 (2008)","journal-title":"Random Struct. Algorithms"},{"issue":"3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"1365","DOI":"10.1137\/100783066","volume":"25","author":"M Gonen","year":"2011","unstructured":"Gonen, M., Ron, D., Shavitt, Y.: Counting stars and other small subgraphs in sublinear-time. SIAM J. Discret. Math. 25(3), 1365\u20131411 (2011)","journal-title":"SIAM J. Discret. Math."},{"key":"12_CR12","doi-asserted-by":"publisher","unstructured":"Jayaram, R., Woodruff, D.: Towards optimal moment estimation in streaming and distributed models. ACM Trans. Algorithms 19 (2023). https:\/\/doi.org\/10.1145\/3596494","DOI":"10.1145\/3596494"},{"key":"12_CR13","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis. Cambridge University Press, Cambridge (2017)"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Motwani, R., Panigrahy, R., Xu, Y.: Estimating sum by weighted sampling. In: International Colloquium on Automata, Languages, and Programming, pp. 53\u201364. Springer (2007)","DOI":"10.1007\/978-3-540-73420-8_7"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"T\u011btek, J., Thorup, M.: Edge sampling and graph parameter estimation via vertex neighborhood accesses. In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pp. 1116\u20131129 (2022)","DOI":"10.1145\/3519935.3520059"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-92932-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T07:47:23Z","timestamp":1747468043000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-92932-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031929311","9783031929328"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-92932-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/easyconferences.eu\/ciac2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}