{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,11]],"date-time":"2024-02-11T00:03:25Z","timestamp":1707609805817},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,2,13]],"date-time":"2007-02-13T00:00:00Z","timestamp":1171324800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2007,2,13]],"date-time":"2007-02-13T00:00:00Z","timestamp":1171324800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computational Statistics"],"published-print":{"date-parts":[[2007,4]]},"DOI":"10.1007\/s00180-007-0024-5","type":"journal-article","created":{"date-parts":[[2007,2,12]],"date-time":"2007-02-12T14:21:02Z","timestamp":1171290062000},"page":"173-185","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Conditions for swappability of records in a microdata set when some marginals are fixed"],"prefix":"10.1007","volume":"22","author":[{"given":"Akimichi","family":"Takemura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hisayuki","family":"Hara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,2,13]]},"reference":[{"issue":"2","key":"24_CR1","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1111\/1467-842X.00278","volume":"45","author":"S Aoki","year":"2003","unstructured":"Aoki S, Takemura A (2003) Minimal basis for a connected Markov chain over 3\u00a0\u00d7 3\u00a0\u00d7 K contingency tables with fixed two-dimensional marginals. Aust N Z J Stat 45(2):229\u2013249. ISSN 1369\u20131473","journal-title":"Aust N Z J Stat"},{"issue":"3","key":"24_CR2","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1142\/S0129054100000211","volume":"11","author":"A Berry","year":"2000","unstructured":"Berry A, Bordat JP, Cogis O (2000) Generating all the minimal separators of a graph. Int J Found Comput Sci 11(3):397\u2013403","journal-title":"Int J Found Comput Sci"},{"issue":"1","key":"24_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0378-3758(82)90058-1","volume":"6","author":"T Dalenius","year":"1982","unstructured":"Dalenius T, Reiss SP (1982) Data-swapping: a technique for disclosure control. J Stat Plan Inference 6(1):73\u201385 ISSN 0378-3758","journal-title":"J Stat Plan Inference"},{"issue":"1","key":"24_CR4","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1214\/aos\/1030563990","volume":"26","author":"P Diaconis","year":"1998","unstructured":"Diaconis P, Sturmfels B (1998) Algebraic algorithms for sampling from conditional distributions. Ann Stat 26(1):363\u2013397 ISSN 0090-5364","journal-title":"Ann Stat"},{"issue":"6","key":"24_CR5","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.3150\/bj\/1072215202","volume":"9","author":"A Dobra","year":"2003","unstructured":"Dobra A (2003) Markov bases for decomposable graphical models. Bernoulli 9(6):1093\u20131108 ISSN 1350-7265","journal-title":"Bernoulli"},{"issue":"3","key":"24_CR6","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF03372101","volume":"19","author":"A Dobra","year":"2004","unstructured":"Dobra A, Sullivant S (2004) A divide-and-conquer algorithm for generating Markov bases of multi-way tables. Comput Stat 19(3):347\u2013366 ISSN 0943-4062","journal-title":"Comput Stat"},{"issue":"3","key":"24_CR7","doi-asserted-by":"publisher","first-page":"1463","DOI":"10.1214\/009053606000000263","volume":"34","author":"D Geiger","year":"2006","unstructured":"Geiger D, Meek C, Sturmfels B (2006) On the toric algebra of graphical models. Ann Stat 34(3):1463\u20131492","journal-title":"Ann Stat"},{"key":"24_CR8","unstructured":"Klain DA, Rota G-C (1997) Introduction to geometric probability. Lezioni Lincee. [Lincei Lectures]. Cambridge University Press, Cambridge, ISBN 0-521-59362-X; 0-521-59654-8"},{"issue":"3","key":"24_CR9","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/S009753979427087X","volume":"27","author":"D Kloks","year":"1998","unstructured":"Kloks D, Kratsch D (1998) Listing all minimal separators of a graph. SIAM J Comput 27(3):605\u2013613","journal-title":"SIAM J Comput"},{"key":"24_CR10","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198522195.001.0001","volume-title":"Graphical models","author":"SL Lauritzen","year":"1996","unstructured":"Lauritzen SL (1996) Graphical models. Oxford University Press, Oxford"},{"issue":"1","key":"24_CR11","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1145\/319540.319555","volume":"6","author":"J Schl\u00f6rer","year":"1981","unstructured":"Schl\u00f6rer J (1981) Security of statistical databases: multidimensional transformation. ACM Trans Database Syst 6(1):95\u2013112 ISSN 0362-5915","journal-title":"ACM Trans Database Syst"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","volume":"3","author":"Y Shiloach","year":"1982","unstructured":"Shiloach Y, Vishkin U (1982) An O(log n) parallel connectivity algorithm. J Algorithms 3:57\u201367","journal-title":"J Algorithms"},{"issue":"2","key":"24_CR13","first-page":"275","volume":"18","author":"A Takemura","year":"2002","unstructured":"Takemura A (2002) Local recording and record swapping by maximum weight matching for disclosure control of microdata sets. J Off Stat 18(2):275\u2013289","journal-title":"J Off Stat"},{"key":"24_CR14","unstructured":"Takemura A, Endo Y (2006) Evaluation of per-record identification risk and swappability of records in a microdata set via decomposable models. arXiv:math.ST\/0603609"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Willenborg L, de Waal T (2001) Elements of statistical disclosure control. Lecture Notes in Statistics, vol 155. Springer, New York, ISBN 0-387-95121-0","DOI":"10.1007\/978-1-4613-0121-9"}],"container-title":["Computational Statistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00180-007-0024-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00180-007-0024-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00180-007-0024-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00180-007-0024-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T22:36:34Z","timestamp":1707604594000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00180-007-0024-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,2,13]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,4]]}},"alternative-id":["24"],"URL":"https:\/\/doi.org\/10.1007\/s00180-007-0024-5","relation":{},"ISSN":["0943-4062","1613-9658"],"issn-type":[{"value":"0943-4062","type":"print"},{"value":"1613-9658","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,2,13]]},"assertion":[{"value":"10 January 2007","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2007","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}