{"entities":{"Q6965799":{"pageid":21297861,"ns":120,"title":"Item:Q6965799","lastrevid":76143462,"modified":"2026-04-23T00:12:52Z","type":"item","id":"Q6965799","labels":{"en":{"language":"en","value":"Efficient methods of constructing universal cycles for \\(k\\)-permutations"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8058070"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6965799$83189020-A0D8-4B21-B1F4-AC2FE282F5D1","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"3e4c6214b72ca723f79bbc515886ab5355a8df6c","datavalue":{"value":{"text":"Efficient methods of constructing universal cycles for \\(k\\)-permutations","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6965799$3EFAB1BD-3096-4500-893F-09E05B61B29C","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"a42217e37938267b6c8277b9585c3c05a2ac25f6","datavalue":{"value":"1569.05005","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6965799$FED55D9D-03F3-4267-8571-E6386D8E6FB7","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"c4bb8d92001cdc1b1aa01256b6ab8bd6f3b95a9a","datavalue":{"value":"10.1016/J.DAM.2025.05.020","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6965799$28C84303-383D-4EA0-9D2E-3390089A3734","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"457469d78fd42f83a6df33111fce126b7df2cfa7","datavalue":{"value":{"entity-type":"item","numeric-id":1667456,"id":"Q1667456"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6965799$176181B9-499D-40C3-AF3B-070BA9754114","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"7d6a883e81946ed31fdc441f287a998b3487338e","datavalue":{"value":{"entity-type":"item","numeric-id":1993384,"id":"Q1993384"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6965799$93C99197-7D8B-43EE-A83D-1B062BC379B7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"09ae6034280400e41ecfac0a94ee671b371dc5e8","datavalue":{"value":{"entity-type":"item","numeric-id":6965798,"id":"Q6965798"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6965799$F95ED70E-493E-4315-81FB-BB51D4E046A2","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"087f55844cc920aae060b09644168bf17b022e1a","datavalue":{"value":{"entity-type":"item","numeric-id":96294,"id":"Q96294"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6965799$B208F732-E5F2-44C6-9740-4B7FD600A707","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"1a3fe69c512d2c684eb6751e4b01bd7e1534f608","datavalue":{"value":{"time":"+2025-06-30T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6965799$E7939C4C-0557-4523-B0EB-3B6F3DCB460C","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6247f04fad65d359a20e559b3e9499d6219d492e","datavalue":{"value":"05A05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6965799$C4573F44-345C-4B7F-85CF-57F0B344906E","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"6bcc565ecd31264b05a28faea9b0c8c8d59222b2","datavalue":{"value":"8058070","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6965799$FF4F001C-75BA-4C6C-A759-7EF67D2B6A9C","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"3ff3d42bb7f371e187bf598f4d36af949d04b299","datavalue":{"value":"universal cycle","type":"string"},"datatype":"string"},"type":"statement","id":"Q6965799$77C2B993-9599-4456-8D98-958A470697EA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4cdcc858e642c37f46f6fa377f2e2634fe466a35","datavalue":{"value":"permutation","type":"string"},"datatype":"string"},"type":"statement","id":"Q6965799$2B1A5CFA-5A54-4695-BAA6-0AA2712ADDE2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5914c77bac523b1de134acb26954b08207c3e5b7","datavalue":{"value":"successor rule","type":"string"},"datatype":"string"},"type":"statement","id":"Q6965799$A106E443-CD04-4DBA-97E2-86D9D24EAA48","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8ce47e68f5456e7d2d6c668f901a27abbbfc239f","datavalue":{"value":"cycle joining method","type":"string"},"datatype":"string"},"type":"statement","id":"Q6965799$6F8A10FC-A09C-4895-AC76-20B42A3552A9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"22683c06fedcaa7012c349358a0eb5ee9c463256","datavalue":{"value":"lexicographic order","type":"string"},"datatype":"string"},"type":"statement","id":"Q6965799$F670AC90-CC8D-4263-94CC-A6488D79BE2D","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6965799$C032A57C-200A-46F5-8D5A-E5DD162565A8","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Efficient methods of constructing universal cycles for \\(k\\)-permutations","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Efficient_methods_of_constructing_universal_cycles_for_%5C(k%5C)-permutations"}}}}}