{"entities":{"Q6937137":{"pageid":21126453,"ns":120,"title":"Item:Q6937137","lastrevid":75870987,"modified":"2026-04-21T10:08:02Z","type":"item","id":"Q6937137","labels":{"en":{"language":"en","value":"Computational complexity in algebraic combinatorics"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8086053"}},"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":"Q6937137$F185183C-40E7-4A39-B26D-E06908DD2FDF","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"57fcc0736063bf3ceff6c97f62cbf77c8e9b560b","datavalue":{"value":{"text":"Computational complexity in algebraic combinatorics","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6937137$BF010CEC-EC52-4552-803D-74F415BCBC1C","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"e79aba49ec5f2d0f025ca79e224a3c7b5fb2a3b6","datavalue":{"value":"1571.0528","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6937137$F61801CA-E5A6-421F-9D3E-52898FA16A96","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"b1322b510a808a4cf7542e2e5a11e82401712322","datavalue":{"value":{"entity-type":"item","numeric-id":244984,"id":"Q244984"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6937137$6B69BA66-13EB-47E5-9050-88A1E7E8D1A6","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"5072aa33820849ae9675bc05a0a8f2c58984d12f","datavalue":{"value":{"time":"+2025-08-28T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6937137$537954BB-8832-40F0-8BBD-07BE2DE0E606","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"8cf2f692eb0d5c2fc2ce5b2154318999029c1c1b","datavalue":{"value":"05E10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6937137$3F3E45F0-7135-4280-9229-42E751F04321","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"b6a686fef1013593a32f9e8e67eecdd50e96866a","datavalue":{"value":"05A15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6937137$59F95BED-ED69-4EF3-800D-7DB481A0097F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"8195a9e26c453276e1d31339bf2413392412013d","datavalue":{"value":"68Q17","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6937137$B700E0C6-6873-4969-A390-5FC011871807","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6937137$8F4CD254-638D-4E38-A2C7-41BEDDA4EBAB","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"8b07b39d4d434221aed94379e852723d84e60643","datavalue":{"value":"8086053","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6937137$E1664443-B8B8-4328-A935-035E28C178CA","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":"Q6937137$64E10EF2-D450-45A1-8E24-FB40A799D3A6","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Computational complexity in algebraic combinatorics","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Computational_complexity_in_algebraic_combinatorics"}}}}}