{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T05:17:12Z","timestamp":1672723032174},"reference-count":0,"publisher":"Association for Computing Machinery (ACM)","issue":"4","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGSAM Bull."],"published-print":{"date-parts":[[2000,12]]},"DOI":"10.1145\/377626.377629","type":"journal-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T18:32:02Z","timestamp":1169058722000},"page":"1-2","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A note on the number of division steps in the Euclidean algorithm"],"prefix":"10.1145","volume":"34","author":[{"given":"S. A.","family":"Abramov","sequence":"first","affiliation":[{"name":"Computer Centre of the Russian Academy of Science, Vavitova 40, Moscow 117967, Russia"}]}],"member":"320","published-online":{"date-parts":[[2000,12]]},"container-title":["ACM SIGSAM Bulletin"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/377626.377629","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T20:07:26Z","timestamp":1672690046000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/377626.377629"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,12]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2000,12]]}},"alternative-id":["10.1145\/377626.377629"],"URL":"https:\/\/doi.org\/10.1145\/377626.377629","relation":{},"ISSN":["0163-5824"],"issn-type":[{"value":"0163-5824","type":"print"}],"subject":[],"published":{"date-parts":[[2000,12]]},"assertion":[{"value":"2000-12-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}