{"entities":{"Q5725184":{"pageid":7754738,"ns":120,"title":"Item:Q5725184","lastrevid":92993978,"modified":"2026-06-05T03:20:41Z","type":"item","id":"Q5725184","labels":{"en":{"language":"en","value":"On finding minimum routes in a network with turn penalties"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3188911"}},"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":"Q5725184$D9C60028-6A13-4DD6-A7F7-FD1E9E75DEF7","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"beab0106cacfed6ea5533d510f210ed7ddb8e274","datavalue":{"value":{"text":"On finding minimum routes in a network with turn penalties","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5725184$7D5C88D0-8E8D-42FA-A3EA-5E9F46316415","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"93f151ffd55f13353b39907ba6cb653ff7a8b151","datavalue":{"value":"0116.12302","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5725184$7C8E3654-36C7-42E7-B456-203696F8041E","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"8e1ca2df670e5a80a96e9bb9348e3de63a93d805","datavalue":{"value":"10.1145/366105.366184","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5725184$ECE93210-FC5E-4F17-BFD9-A588FC62811F","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"84cf589a3bbf594ca3b79571b4068567164eb289","datavalue":{"value":{"entity-type":"item","numeric-id":5725183,"id":"Q5725183"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5725184$09E6A3E8-9485-4A71-97FC-D263E3FE0614","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"b733604afa3a648384279f872bdd54e6b747380d","datavalue":{"value":{"time":"+1961-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":"Q5725184$44BE3782-3F55-4CE4-98BD-C015BC6A7919","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"05c07d91598ed32b86668afecc5b81b28989734c","datavalue":{"value":"3188911","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5725184$E4FCA155-5BFA-42C3-B7E8-9035F18DEE67","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"013a573a10a65db40cc78020f718d30d0fd6eed2","datavalue":{"value":"applications of probability theory and statistics","type":"string"},"datatype":"string"},"type":"statement","id":"Q5725184$2E95F9E8-60B5-4776-81A9-A9207A344FE6","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":"Q5725184$C5AD9BAE-DBBA-4331-9EE6-776E1A0C9B98","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"43c7f8899f7ee0c02596dcdeb4638dc3ab9632e6","datavalue":{"value":"https://doi.org/10.1145/366105.366184","type":"string"},"datatype":"url"},"type":"statement","id":"Q5725184$80AF563B-0E4D-4587-B2F7-A219C630BE8B","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"bd8f3c0a11a01e8dce469fb77bd11da2ea9d3f8c","datavalue":{"value":"W2060484689","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5725184$B8D007CC-816E-4BAF-9BA0-FD5DB3A7EA31","rank":"normal"}],"P12":[{"mainsnak":{"snaktype":"value","property":"P12","hash":"2995187ff7befe4d31cd7f64fd603e3c7598c474","datavalue":{"value":"Q128379032","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5725184$629B318E-ECAE-42CD-82C8-781C0823526F","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"087426e75e65ba42be09a15851f31de13b7aa5f3","datavalue":{"value":{"entity-type":"item","numeric-id":56730,"id":"Q56730"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5725184$56F509CF-9EE0-4089-A79E-BAE15A29A2F1","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On finding minimum routes in a network with turn penalties","badges":[]}}}}}