{"entities":{"Q6443972":{"pageid":13576981,"ns":120,"title":"Item:Q6443972","lastrevid":103525883,"modified":"2026-06-06T07:33:01Z","type":"item","id":"Q6443972","labels":{"en":{"language":"en","value":"A new lower bound for deterministic pop-stack-sorting"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900600192"}},"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":"Q6443972$9C968E3E-F206-4AB7-92FB-3EDCFF8A0CAB","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"703c136f3bd3ecff0b02117822010b4458f51e5a","datavalue":{"value":{"time":"+2023-07-16T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6443972$A90AC170-D843-48F8-9AB9-EBF635A56EB3","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"e4af9e094f9fd64eec2f61bd0b5bcb9a897fd8bf","datavalue":{"value":{"entity-type":"item","numeric-id":6443971,"id":"Q6443971"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6443972$64924BD3-81F9-484A-B216-DC0CC2D3DCDC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"98c6bc2e9ee492e3047e2cc2fc14c488b0707f80","datavalue":{"value":{"entity-type":"item","numeric-id":2014217,"id":"Q2014217"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6443972$E339EBDF-0C85-49DD-A204-8F80291D47D5","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"2de7bafb213ab064fc3cfaef671508f8a9d08292","datavalue":{"value":"900600192","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6443972$BF1B291F-DD00-4BCD-89AB-AA6387438097","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":"Q6443972$95D1584A-6E86-49F1-B4DD-C457E26FE28A","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A new lower bound for deterministic pop-stack-sorting","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_new_lower_bound_for_deterministic_pop-stack-sorting"}}}}}