{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:17:27Z","timestamp":1762323447505},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642245497"},{"type":"electronic","value":"9783642245503"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24550-3_36","type":"book-chapter","created":{"date-parts":[[2011,10,8]],"date-time":"2011-10-08T02:56:37Z","timestamp":1318042597000},"page":"439-440","source":"Crossref","is-referenced-by-count":1,"title":["Brief Announcement: A Note on Replication of Documents"],"prefix":"10.1007","author":[{"given":"Jacek","family":"Cicho\u0144","sequence":"first","affiliation":[]},{"given":"Rafa\u0142","family":"Kapelko","sequence":"additional","affiliation":[]},{"given":"Karol","family":"Marchwicki","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","series-title":"Sorting and Searching","volume-title":"The art of computer programming","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: The art of computer programming, 3rd edn. Sorting and Searching. Addison-Wesley, Reading (1997)","edition":"3"},{"key":"36_CR2","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0021-9800(67)80075-9","volume":"3","author":"M. Klamkin","year":"1967","unstructured":"Klamkin, M., Newman, D.: Extensions of the birthday surprise. J. Combin. Theory\u00a03, 279\u2013282 (1967)","journal-title":"J. Combin. Theory"},{"key":"36_CR3","unstructured":"Martins, V.: Data Replication in P2P Systems. PhD thesis, Universite De Nantes Faculte Des Sciences Et Des Techniques (2007)"},{"key":"36_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-642-15108-8_7","volume-title":"Data Management in Grid and Peer-to-Peer Systmes","author":"S. Caron","year":"2010","unstructured":"Caron, S., Giroire, F., Mazauric, D., Monteiro, J., P\u00e9rennes, S.: Data life time for different placement policies in p2p storage systems. In: Hameurlain, A., Morvan, F., Tjoa, A.M. (eds.) Globe 2010. LNCS, vol.\u00a06265, pp. 75\u201388. Springer, Heidelberg (2010)"},{"key":"36_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1007\/978-3-540-88875-8_116","volume-title":"On the Move to Meaningful Internet Systems: OTM 2008 Workshops","author":"J. Cicho\u0144","year":"2008","unstructured":"Cicho\u0144, J., Jasi\u0144ski, A., Kapelko, R., Zawada, M.: How to Improve the Reliability of Chord? In: Meersman, R., Tari, Z., Herrero, P. (eds.) OTM-WS 2008. LNCS, vol.\u00a05333, pp. 904\u2013913. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24550-3_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T06:00:35Z","timestamp":1554876035000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24550-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642245497","9783642245503"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24550-3_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}