{"entities":{"Q7095166":{"pageid":21899331,"ns":120,"title":"Item:Q7095166","lastrevid":106614353,"modified":"2026-10-22T12:53:20Z","type":"item","id":"Q7095166","labels":{"en":{"language":"en","value":"The Stochastic Shortest Path Problem : A polyhedral combinatorics perspective"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"aliases":{},"claims":{"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"d9c15d4dc922d1082ff725e5e40ff9c90d3b6ee4","datavalue":{"value":"cs.DM","type":"string"},"datatype":"string"},"type":"statement","id":"Q7095166$BF72B70C-4F22-47BD-9A54-0AB793768D3B","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"b7faee5a668f34283a86c67ea3a2dbec14373e78","datavalue":{"value":{"time":"+2017-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7095166$8A881F9E-9AB8-43C0-BEDF-7439BD606449","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"1e80dd14a1b594cbf6732aefa856b609fc6c5eae","datavalue":{"value":"1702.03186","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7095166$23E2CFCC-5B94-4220-9CC9-324E2FD4592E","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"de43a93e36181c6968d215b16da0464eb6735f82","datavalue":{"value":{"entity-type":"item","numeric-id":2183320,"id":"Q2183320"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7095166$5D3EE07F-86C5-4C06-A096-18F34D791D36","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"0db5dcce11394351f01952654884cddd607e4e50","datavalue":{"value":{"entity-type":"item","numeric-id":408179,"id":"Q408179"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7095166$E280EC65-3597-4D73-ABBF-2B2E9CFD9EAA","rank":"normal"}],"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":"Q7095166$E41BE74A-EC94-4C26-8556-BBFC59F0B9AF","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":"Q7095166$43660F41-3971-465F-AB80-14090F63B3E9","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"The Stochastic Shortest Path Problem : A polyhedral combinatorics perspective","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/The_Stochastic_Shortest_Path_Problem_:_A_polyhedral_combinatorics_perspective"}}}}}