{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:38:12Z","timestamp":1742913492953,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030656201"},{"type":"electronic","value":"9783030656218"}],"license":[{"start":{"date-parts":[[2020,12,12]],"date-time":"2020-12-12T00:00:00Z","timestamp":1607731200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,12,12]],"date-time":"2020-12-12T00:00:00Z","timestamp":1607731200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-65621-8_1","type":"book-chapter","created":{"date-parts":[[2020,12,11]],"date-time":"2020-12-11T12:32:07Z","timestamp":1607689927000},"page":"3-23","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The Bloom Clock for Causality Testing"],"prefix":"10.1007","author":[{"given":"Anshuman","family":"Misra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2451-7306","authenticated-orcid":false,"given":"Ajay D.","family":"Kshemkalyani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,12]]},"reference":[{"issue":"7","key":"1_CR1","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B Bloom","year":"1970","unstructured":"Bloom, B.: Space\/time tradeoffs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"issue":"4","key":"1_CR2","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1080\/15427951.2004.10129096","volume":"1","author":"AZ Broder","year":"2003","unstructured":"Broder, A.Z., Mitzenmacher, M.: Survey: network applications of bloom filters: a survey. Internet Math. 1(4), 485\u2013509 (2003). https:\/\/doi.org\/10.1080\/15427951.2004.10129096","journal-title":"Internet Math."},{"issue":"1","key":"1_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0020-0190(91)90055-M","volume":"39","author":"B Charron-Bost","year":"1991","unstructured":"Charron-Bost, B.: Concerning the size of logical clocks in distributed systems. Inf. Process. Lett. 39(1), 11\u201316 (1991). https:\/\/doi.org\/10.1016\/0020-0190(91)90055-M","journal-title":"Inf. Process. Lett."},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Couvreur, J., Francez, N., Gouda, M.G.: Asynchronous unison (extended abstract). In: Proceedings of the 12th International Conference on Distributed Computing Systems, Yokohama, Japan, 9\u201312 June 1992, pp. 486\u2013493 (1992). https:\/\/doi.org\/10.1109\/ICDCS.1992.235005","DOI":"10.1109\/ICDCS.1992.235005"},{"issue":"8","key":"1_CR5","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/2.84874","volume":"24","author":"CJ Fidge","year":"1991","unstructured":"Fidge, C.J.: Logical time in distributed computing systems. IEEE Comput. 24(8), 28\u201333 (1991). https:\/\/doi.org\/10.1109\/2.84874","journal-title":"IEEE Comput."},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Kshemkalyani, A.D., Khokhar, A.A., Shen, M.: Encoded vector clock: using primes to characterize causality in distributed systems. In: Proceedings of the 19th International Conference on Distributed Computing and Networking, ICDCN 2018, Varanasi, India, 4\u20137 January 2018, pp. 12:1\u201312:8 (2018). https:\/\/doi.org\/10.1145\/3154273.3154305","DOI":"10.1145\/3154273.3154305"},{"key":"1_CR7","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-030-57811-4_25","volume-title":"Advances in Networked-Based Information Systems","author":"AD Kshemkalyani","year":"2021","unstructured":"Kshemkalyani, A.D., Misra, A.: The bloom clock to characterize causality in distributed systems. In: Barolli, L., Li, K.F., Enokido, T., Takizawa, M. (eds.) NBiS 2020. AISC, vol. 1264, pp. 269\u2013279. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-57811-4_25"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.jpdc.2020.02.008","volume":"140","author":"AD Kshemkalyani","year":"2020","unstructured":"Kshemkalyani, A.D., Shen, M., Voleti, B.: Prime clock: encoded vector clock to characterize causality in distributed systems. J. Parallel Distrib. Comput. 140, 37\u201351 (2020). https:\/\/doi.org\/10.1016\/j.jpdc.2020.02.008","journal-title":"J. Parallel Distrib. Comput."},{"key":"1_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511805318","volume-title":"Distributed Computing: Principles, Algorithms, and Systems","author":"AD Kshemkalyani","year":"2011","unstructured":"Kshemkalyani, A.D., Singhal, M.: Distributed Computing: Principles, Algorithms, and Systems. Cambridge University Press, Cambridge (2011). https:\/\/doi.org\/10.1017\/CBO9780511805318"},{"issue":"7","key":"1_CR10","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L Lamport","year":"1978","unstructured":"Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558\u2013565 (1978)","journal-title":"Commun. ACM"},{"key":"1_CR11","unstructured":"Mattern, F.: Virtual time and global states of distributed systems. In: Proceedings of the Parallel and Distributed Algorithms Conference, pp. 215\u2013226 (1988)"},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Meldal, S., Sankar, S., Vera, J.: Exploiting locality in maintaining potential causality. In: Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, PODC 1991, pp. 231\u2013239. ACM, New York (1991). https:\/\/doi.org\/10.1145\/112600.112620","DOI":"10.1145\/112600.112620"},{"issue":"2","key":"1_CR13","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0020-0190(91)90229-B","volume":"38","author":"J Misra","year":"1991","unstructured":"Misra, J.: Phase synchronization. Inf. Process. Lett. 38(2), 101\u2013105 (1991). https:\/\/doi.org\/10.1016\/0020-0190(91)90229-B","journal-title":"Inf. Process. Lett."},{"key":"1_CR14","unstructured":"Pozzetti, T.: Resettable Encoded Vector Clock for Causality Analysis with an Application to Dynamic Race Detection. M.S. Thesis, University of Illinois at Chicago (2019)"},{"issue":"4","key":"1_CR15","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1109\/TPDS.2020.3032293","volume":"32","author":"T Pozzetti","year":"2021","unstructured":"Pozzetti, T., Kshemkalyani, A.D.: Resettable encoded vector clock for causality analysis with an application to dynamic race detection. IEEE Trans. Parallel Distrib. Syst. 32(4), 772\u2013785 (2021). https:\/\/doi.org\/10.1109\/TPDS.2020.3032293","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"1_CR16","unstructured":"Ramabaja, L.: The bloom clock. CoRR (2019). http:\/\/arxiv.org\/abs\/1905.13064"},{"issue":"3","key":"1_CR17","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF02277859","volume":"7","author":"R Schwarz","year":"1994","unstructured":"Schwarz, R., Mattern, F.: Detecting causal relationships in distributed computations: in search of the holy grail. Distrib. Comput. 7(3), 149\u2013174 (1994). https:\/\/doi.org\/10.1007\/BF02277859","journal-title":"Distrib. Comput."},{"issue":"1","key":"1_CR18","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0020-0190(92)90028-T","volume":"43","author":"M Singhal","year":"1992","unstructured":"Singhal, M., Kshemkalyani, A.D.: An efficient implementation of vector clocks. Inf. Process. Lett. 43(1), 47\u201352 (1992). https:\/\/doi.org\/10.1016\/0020-0190(92)90028-T","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"1_CR19","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1109\/SURV.2011.031611.00024","volume":"14","author":"S Tarkoma","year":"2012","unstructured":"Tarkoma, S., Rothenberg, C.E., Lagerspetz, E.: Theory and practice of bloom filters for distributed systems. IEEE Commun. Surv. Tutor. 14(1), 131\u2013155 (2012). https:\/\/doi.org\/10.1109\/SURV.2011.031611.00024","journal-title":"IEEE Commun. Surv. Tutor."},{"issue":"4","key":"1_CR20","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s004460050065","volume":"12","author":"FJ Torres-Rojas","year":"1999","unstructured":"Torres-Rojas, F.J., Ahamad, M.: Plausible clocks: constant size logical clocks for distributed systems. Distrib. Comput. 12(4), 179\u2013195 (1999). https:\/\/doi.org\/10.1007\/s004460050065","journal-title":"Distrib. Comput."}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-65621-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,15]],"date-time":"2020-12-15T00:21:57Z","timestamp":1607991717000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-65621-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,12]]},"ISBN":["9783030656201","9783030656218"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-65621-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020,12,12]]},"assertion":[{"value":"12 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICDCIT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Distributed Computing and Internet Technology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bhubaneswar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 January 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 January 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icdcit2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icdcit.ac.in\/17th-icdcit-2021\/","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":"99","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":"13","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":"4","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":"13% - 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":"2.5","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":"6","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)"}}]}}