{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:27:59Z","timestamp":1742912879787,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031442735"},{"type":"electronic","value":"9783031442742"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-44274-2_7","type":"book-chapter","created":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T01:02:06Z","timestamp":1696035726000},"page":"75-89","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Adding Pull to\u00a0Push Sum for\u00a0Approximate Data Aggregation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6364-7133","authenticated-orcid":false,"given":"Saptadi","family":"Nugroho","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0004-3769-2386","authenticated-orcid":false,"given":"Alexander","family":"Weinmann","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8320-8581","authenticated-orcid":false,"given":"Christian","family":"Schindelhauer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,30]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Nugroho, S., Weinmann, A., Schindelhauer, C.: Trade off between accuracy and message complexity for approximate data aggregation. In: 18th International Conference on Distributed Computing in Sensor Systems, DCOSS 2022, pp. 61\u201364, Marina del Rey, Los Angeles, CA, USA, 30 May 2022\u201301 June (2022). https:\/\/doi.org\/10.1109\/DCOSS54816.2022.00021","key":"7_CR1","DOI":"10.1109\/DCOSS54816.2022.00021"},{"doi-asserted-by":"publisher","unstructured":"Kuhn, F., Locher, T., Wattenhofer, R.: Tight bounds for distributed selection. In: Proceedings of the Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2007, pp. 145\u2013153. Association for Computing Machinery, New York, NY, USA (2007). https:\/\/doi.org\/10.1145\/1248377.1248401","key":"7_CR2","DOI":"10.1145\/1248377.1248401"},{"doi-asserted-by":"publisher","unstructured":"Karp, R., Schindelhauer, C., Shenker, S., Vocking, B.: Randomized rumor spreading. In: Proceedings 41st Annual Symposium on Foundations of Computer Science, pp. 565\u2013574, Redondo Beach, CA, USA (2000). https:\/\/doi.org\/10.1109\/SFCS.2000.892324","key":"7_CR3","DOI":"10.1109\/SFCS.2000.892324"},{"doi-asserted-by":"publisher","unstructured":"Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: Proceedings 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 482\u2013491, Cambridge, MA, USA (2003). https:\/\/doi.org\/10.1109\/SFCS.2003.1238221","key":"7_CR4","DOI":"10.1109\/SFCS.2003.1238221"},{"issue":"1","key":"7_CR5","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1109\/COMST.2014.2354398","volume":"17","author":"P Jesus","year":"2015","unstructured":"Jesus, P., Baquero, C., Almeida, P.S.: A survey of distributed data aggregation algorithms. IEEE Commun. Surv. Tutorials J. 17(1), 381\u2013404 (2015). https:\/\/doi.org\/10.1109\/COMST.2014.2354398","journal-title":"IEEE Commun. Surv. Tutorials J."},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.tcs.2018.05.041","volume":"810","author":"S Daum","year":"2020","unstructured":"Daum, S., Kuhn, F., Maus, Y.: Rumor spreading with bounded in-degree. Theor. Comput. Sci. J. 810, 43\u201357 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2018.05.041","journal-title":"Theor. Comput. Sci. J."},{"doi-asserted-by":"publisher","unstructured":"Montresor, A., Jelasity, M.: PeerSim: a scalable P2P simulator. In: Proceedings of the IEEE Ninth International Conference on Peer-to-Peer Computing, pp. 99\u2013100. Seattle, WA, USA (2009). https:\/\/doi.org\/10.1109\/P2P.2009.5284506","key":"7_CR7","DOI":"10.1109\/P2P.2009.5284506"},{"key":"7_CR8","volume-title":"Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables","author":"M Abramowitz","year":"1964","unstructured":"Abramowitz, M., Stegun, I.A.: Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. Dover, New York (1964)"},{"unstructured":"Kempe, D.: Structure and dynamics of information in networks (2021). http:\/\/david-kempe.com\/teaching\/structure-dynamics.pdf. Accessed 17 Oct 2022","key":"7_CR9"},{"doi-asserted-by":"crossref","unstructured":"Pittel, B.: On spreading a rumor. SIAM J. Appl. Math. 47(1), 213\u2013223 (1987). https:\/\/www.jstor.org\/stable\/2101696","key":"7_CR10","DOI":"10.1137\/0147013"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-642-02930-1_31","volume-title":"Automata, Languages and Programming","author":"F Chierichetti","year":"2009","unstructured":"Chierichetti, F., Lattanzi, S., Panconesi, A.: Rumor spreading in social networks. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 375\u2013386. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02930-1_31"},{"unstructured":"Weinmann, A.: Simulation, evaluation, and analysis of data aggregation methods under different random call models suitable for time series data. Master thesis. University of Freiburg Faculty of Engineering Department of Computer Science Chair of Computer Networks and Telematics, Freiburg, Germany (2022)","key":"7_CR12"},{"issue":"1","key":"7_CR13","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0166-218X(85)90059-9","volume":"10","author":"AM Frieze","year":"1985","unstructured":"Frieze, A.M., Grimmett, G.R.: The shortest-path problem for graphs with random arc-lengths. Discr. Appl. Math. 10(1), 57\u201377 (1985). https:\/\/doi.org\/10.1016\/0166-218X(85)90059-9","journal-title":"Discr. Appl. Math."},{"doi-asserted-by":"publisher","unstructured":"Chierichetti, F., Giakkoupis, G., Lattanzi, S., Panconesi, A.: Rumor spreading and conductance. J. Assoc. Comput. Mach. 65(4), 1\u201321 (2018). Article No.: 17. https:\/\/doi.org\/10.1145\/3173043","key":"7_CR14","DOI":"10.1145\/3173043"},{"issue":"1","key":"7_CR15","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1017\/S0963548320000310","volume":"30","author":"R Daknama","year":"2021","unstructured":"Daknama, R., Panagiotou, K., Reisser, S.: Robustness of randomized rumour spreading. Comb. Probab. Comput. 30(1), 37\u201378 (2021). https:\/\/doi.org\/10.1017\/S0963548320000310","journal-title":"Comb. Probab. Comput."},{"issue":"2","key":"7_CR16","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1177\/1094342018762531","volume":"33","author":"M Casas","year":"2019","unstructured":"Casas, M., Gansterer, W.N., Wimmer, E.: Resilient gossip-inspired all-reduce algorithms for high-performance computing: potential, limitations, and open questions. Int. J. High Perform. Comput. Appl. 33(2), 366\u2013383 (2019). https:\/\/doi.org\/10.1177\/1094342018762531","journal-title":"Int. J. High Perform. Comput. Appl."},{"unstructured":"Mahlmann, P.: Peer-to-peer networks based on random graphs. Dissertation (PhD). Fakult\u00e4t f\u00fcr Elektrotechnik, Informatik und Mathematik, Universit\u00e4t Paderborn, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, Band 283, Paderborn (2010)","key":"7_CR17"},{"unstructured":"Schindelhauer, C.: Communication network problems (2002). http:\/\/archive.cone.informatik.uni-freiburg.de\/pubs\/Habil.pdf. Accessed 17 Oct 2022","key":"7_CR18"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-44274-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,8]],"date-time":"2024-03-08T01:02:45Z","timestamp":1709859765000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-44274-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031442735","9783031442742"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-44274-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"30 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jersey City, NJ","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"2 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.bgu.ac.il\/~SSS2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4 invited papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}