{"entities":{"Q4177361":{"pageid":6206962,"ns":120,"title":"Item:Q4177361","lastrevid":81504686,"modified":"2026-05-06T18:40:32Z","type":"item","id":"Q4177361","labels":{"en":{"language":"en","value":"A note on the stochastic shortest-route problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3612804"}},"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":"Q4177361$62698209-1BC5-4AD4-9406-F14EA49CFC65","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"761f568e2c312deb75f8aa16a7a51ffd039f28e9","datavalue":{"value":{"text":"A note on the stochastic shortest-route problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q4177361$4BEC87B8-2A89-4817-9A73-1F547BDBD9AA","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"eefc876ce6f30372b8e09ca2c4df552d035ec450","datavalue":{"value":"0394.90098","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4177361$515588C2-2D18-4E1B-8CD2-F8020B5A4141","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"8667017be3d0e146b98161f280857ff662c263c1","datavalue":{"value":{"entity-type":"item","numeric-id":797484,"id":"Q797484"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4177361$02296FD3-8898-4D9F-9A9E-B501BD2E724E","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"6e5a9693e01203495e7e56b6c17db61c956b208f","datavalue":{"value":{"entity-type":"item","numeric-id":103580,"id":"Q103580"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4177361$8257C220-BA1A-4618-B7B5-56A9C544A6A0","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"23512e79b17ec0dbe00d89a570006ab4e1ecd403","datavalue":{"value":{"time":"+1978-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":"Q4177361$E53D300A-1499-4211-A76B-E2FF42B16FCC","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"d2d4f4e28fa9ca38421c473fcb6ba728a44de59a","datavalue":{"value":"90C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4177361$FB28B029-1939-4572-97B0-312BF48AA1C4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"5a3bb76dbd41580d9287ece5137de80ddf22202f","datavalue":{"value":"05C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4177361$1216BDD6-1AD3-4043-AA75-94660C40333A","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"99a9d1dcedba65500d8f4942965524179ae8c925","datavalue":{"value":"3612804","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4177361$C6C396D3-97E0-43DC-83B4-7E1426656AA7","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"483a997df81f060037d157dca1a1f201fed9db9b","datavalue":{"value":"90099","type":"string"},"datatype":"string"},"type":"statement","id":"Q4177361$486654E0-7FF3-4B98-A656-A27C512B7112","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0a96462659185cf09505ad16eb9013dd88b85327","datavalue":{"value":"Network Programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q4177361$566CBBE3-4E23-4B09-A8F5-891D466C1437","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9f87fc7ad6ac265c993026357c55e36ec6a4b81a","datavalue":{"value":"Stochastic Shortest-Route Problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q4177361$B875862A-3DDC-4B6E-9803-A52713D4ED2B","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":"Q4177361$DB485096-9156-4570-8DF4-0FE99ED6711A","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"f22223a3b170efc1929fc0c8f20158532acb865a","datavalue":{"value":"https://doi.org/10.1002/nav.3800250415","type":"string"},"datatype":"url"},"type":"statement","id":"Q4177361$C2205D6B-7A05-4151-A11C-6B462C98D50F","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"dd6a702de34fc4d19361573e9e75307dba91a4fe","datavalue":{"value":"W1986564315","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4177361$E0ED4482-15D5-4024-AC7C-FE8ED8088B85","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"c0018ad711a9aa4062e7fe1843d768ba9f313cc5","datavalue":{"value":"10.1002/NAV.3800250415","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4177361$9C78C1D2-1D45-4251-9603-FAA5E1B8BFA1","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A note on the stochastic shortest-route problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_note_on_the_stochastic_shortest-route_problem"}}}}}