{"entities":{"Q6538702":{"pageid":14149845,"ns":120,"title":"Item:Q6538702","lastrevid":103511429,"modified":"2026-06-06T07:31:20Z","type":"item","id":"Q6538702","labels":{"en":{"language":"en","value":"Faster algorithm for turn-based stochastic games with bounded treewidth"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7848133"}},"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":"Q6538702$32F61490-CF33-4428-9BF8-E9AF8C3AB6CB","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"3929e7ca109c875eedb7f331c210d33a2875f224","datavalue":{"value":{"text":"Faster algorithm for turn-based stochastic games with bounded treewidth","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6538702$D938A3DA-DADA-4EFC-B35D-009E5BB2C74D","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"2cff81c72b46c2d37ebe9a5f2cbcfbb6825cbcc7","datavalue":{"value":{"entity-type":"item","numeric-id":253965,"id":"Q253965"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6538702$E80DB9DB-FAB9-4039-9428-65E79E4B808D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"5292d458af310b000030cf51a9a263a1b17344bd","datavalue":{"value":{"entity-type":"item","numeric-id":2151246,"id":"Q2151246"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6538702$FB053506-8CEC-4D7E-AA27-531E4405F125","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"79ce7b46ad023054f4ca126a79939a802549c9f9","datavalue":{"value":{"entity-type":"item","numeric-id":2155687,"id":"Q2155687"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6538702$C82EFFF6-D92C-4AD8-973E-F358F8B9ABD0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"55a24ac4b655f628807bb8f044f7d3ff7563f806","datavalue":{"value":{"entity-type":"item","numeric-id":5089183,"id":"Q5089183"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6538702$7726AB79-8258-4E7C-9522-4AE802728014","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"e8e66a32d534df6de0df71c4be5910df36dd6c70","datavalue":{"value":{"time":"+2024-05-14T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6538702$3D60231A-231D-4045-A787-8FAB8F2796CB","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6538702$96C5E117-FF59-4DAA-A436-620A55F162C0","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"312012604c528641489e5ebc61b4a53e21199f5a","datavalue":{"value":"7848133","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6538702$6B2C95E8-B789-4B3E-9709-C782CDB8313F","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":"Q6538702$A42240FF-5CDE-44C7-8A6B-242509730115","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"cf6974409d1f4086d741a06f7b032ce159aada21","datavalue":{"value":"10.1137/1.9781611977554.CH173","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6538702$FD25C201-0EE7-455B-9C58-B0AF9BF8593E","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Faster algorithm for turn-based stochastic games with bounded treewidth","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Faster_algorithm_for_turn-based_stochastic_games_with_bounded_treewidth"}}}}}