{"entities":{"Q6934116":{"pageid":21108259,"ns":120,"title":"Item:Q6934116","lastrevid":84115028,"modified":"2026-05-10T10:48:53Z","type":"item","id":"Q6934116","labels":{"en":{"language":"en","value":"Optimal generation of strictly increasing binary trees and beyond"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8089344"}},"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":"Q6934116$36EF6C7D-C677-49A1-9E07-3D8169F6C1BE","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"209c1af2ae9ecae95bfbb57a86d1e2b03756bdeb","datavalue":{"value":{"text":"Optimal generation of strictly increasing binary trees and beyond","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6934116$A35E1D22-B9B7-4F25-BEFE-6D8DDDF2663C","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"8d2721a77f249678128be111bd02de87e91cc095","datavalue":{"value":"1571.05251","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6934116$B23ACE01-F935-4111-A75D-5C743D20F562","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"801b53025d215e2da18fcb0a5bbe703b1bc78a30","datavalue":{"value":"10.4204/EPTCS.403.15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6934116$499F6B07-4B17-4CE6-A79B-E9BF59DF2B91","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"ef3fdaaac0e110cbc4c911ad49e4f3b8502cfbd1","datavalue":{"value":{"entity-type":"item","numeric-id":391392,"id":"Q391392"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6934116$1D4F02C6-7C74-4395-B8AF-044727365524","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"3fa46e7ae0ac19ca849d79801969e5ea7327f2d0","datavalue":{"value":{"entity-type":"item","numeric-id":6876374,"id":"Q6876374"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6934116$2FF16113-4B8C-4831-883D-925874AE8FEF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"ca53ed573941792a771bcc4806266ba23b714829","datavalue":{"value":{"entity-type":"item","numeric-id":782408,"id":"Q782408"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6934116$AF2080EF-C2F9-41DF-9BEE-36C1BFB15618","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"50e7e1513349015c9ad9d54964e1d81738fe0b09","datavalue":{"value":{"time":"+2025-09-03T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6934116$2264A561-ED8B-482A-BEB4-7C3A89678CC2","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"749b7137f279a66a306e75e15f613231b281c1c5","datavalue":{"value":"05C85","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6934116$9F31074B-B753-4FC3-BC93-F347B136627E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"4dd6b8847e09c706889ad9ef05dc0040f1c9f982","datavalue":{"value":"05C80","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6934116$EF288CD3-D07B-4BFA-835D-DF3FB460B80A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"d5da87a72c21717089feda882f568938059a9d84","datavalue":{"value":"05C05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6934116$FC77556D-7CC3-41B5-9EF0-69D107E39ACF","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"b492c3cd54896ecfa4cbfb098302946f88f6b654","datavalue":{"value":"8089344","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6934116$82A12EA5-61F8-471D-9898-EFF4824DEAB1","rank":"normal"}],"P163":[{"mainsnak":{"snaktype":"value","property":"P163","hash":"45fcd4163b5f33e6e8c784f5522d7246c0a1a61e","datavalue":{"value":{"entity-type":"item","numeric-id":57056,"id":"Q57056"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6934116$8B9B8051-DE4C-40BD-80B2-B859604A5FDD","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4b88aafe63fa03cf177e80d4ed6fdd448e5f4d4f","datavalue":{"value":"random increasing trees","type":"string"},"datatype":"string"},"type":"statement","id":"Q6934116$1279AD45-8E59-46D5-989F-CBDA8FA7A797","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"b906bbc9d50c95247f59a0f3185945b7bf26a24d","datavalue":{"value":"weighted strictly increasing unary-binary increasing trees","type":"string"},"datatype":"string"},"type":"statement","id":"Q6934116$B81CBE3B-F9DE-45F6-AE94-52678AC102D0","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":"Q6934116$3037FA88-2D2B-4191-A2DA-B6408AC899CC","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"5b1a03df1860a812021f45c5042be0f3cb3bd624","datavalue":{"value":{"entity-type":"item","numeric-id":2402673,"id":"Q2402673"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6934116$8E7C522C-4F82-4E3A-8819-63C56DE32D71","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"5e992fdac545c09ed0723ce6c4b81879caf7dd9f","datavalue":{"value":{"entity-type":"item","numeric-id":4670356,"id":"Q4670356"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6934116$003DBDE9-8E6B-425D-A2A7-341DAC0F2937","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Optimal generation of strictly increasing binary trees and beyond","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Optimal_generation_of_strictly_increasing_binary_trees_and_beyond"}}}}}