{"entities":{"Q699346":{"pageid":701195,"ns":120,"title":"Item:Q699346","lastrevid":63611388,"modified":"2026-04-11T14:20:21Z","type":"item","id":"Q699346","labels":{"en":{"language":"en","value":"Development of the tree-based link labeling algorithm for optimal path-finding in urban transportation networks"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1804140"}},"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":"Q699346$651F5F26-40C3-4861-81CB-15581E07A32B","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"f557f9c4afeed0ccba0320885e53633609f78bc7","datavalue":{"value":{"text":"Development of the tree-based link labeling algorithm for optimal path-finding in urban transportation networks","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q699346$446DE275-F1C6-4E1D-99D0-8E1033602848","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"8897f5f293ac9b4b860632b7e214dd80ae972e32","datavalue":{"value":"1001.90502","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q699346$2ACAFB3C-9619-48BE-9A1D-127E17C26D1A","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"1a057c6e0f7310dda6e82b72b2e94f7548b86781","datavalue":{"value":"10.1016/S0895-7177(98)00051-X","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q699346$DFD27FFC-D85F-4D35-9F1F-097424BC02C4","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"839c6776f9ca1c037a942681a7f0bc568bcffaa2","datavalue":{"value":{"entity-type":"item","numeric-id":699343,"id":"Q699343"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q699346$54E6FB6D-D19A-488C-9BD0-A8A0ACFF54AF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"e266d96de6d63ed725bec7c3215565b1b884adfc","datavalue":{"value":{"entity-type":"item","numeric-id":699344,"id":"Q699344"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q699346$D8F94DCF-8A9A-4E56-9CF2-BC0D52C428E1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"af88717424081e1e2696d1434e2b46d1d46dfcd8","datavalue":{"value":{"entity-type":"item","numeric-id":699345,"id":"Q699345"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q699346$3B26A1C3-A53E-4C12-A5EB-E78D506B5496","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"b010567da0e068295e34b824b5eafea5ffd18ef1","datavalue":{"value":{"entity-type":"item","numeric-id":166953,"id":"Q166953"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q699346$7F1FDF78-AA9F-4197-A310-8FB02F8D64CD","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"9b2b71dcf56ff78f0a9a41f5c0a05dd1e4f3da6b","datavalue":{"value":{"time":"+2002-09-24T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q699346$5BC58F1F-1BDB-4BE4-9CFC-5A460DFAB407","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"810d660658648f9bc3138c1cd0aba8029bb9050c","datavalue":{"value":"90B06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q699346$90DE1F94-A7C5-4D90-8A36-79FD1A8C1037","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"30ccbcad441ad14b72f566581bffffb4d4a01d55","datavalue":{"value":"1804140","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q699346$FDEBDFAC-BD93-4C9B-BF6D-F159719436C3","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":"Q699346$53B025C4-D6FD-45E7-9076-F2292CB67AAA","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"2b989f45b85fa44137ad22092706b6102fd241bf","datavalue":{"value":{"entity-type":"item","numeric-id":78129,"id":"Q78129"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q699346$11448B64-1091-4A0A-BFE8-820F77A737E6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"061885fa573451da1302a78a271f913f69225f7d","datavalue":{"value":{"entity-type":"item","numeric-id":3249327,"id":"Q3249327"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q699346$A88A939D-CB6A-4867-8E4B-438FE011F2B4","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"70a910edc1e042e4c3ab8ba94034c7c41644ac26","datavalue":{"value":"https://doi.org/10.1016/s0895-7177(98)00051-x","type":"string"},"datatype":"url"},"type":"statement","id":"Q699346$A4743B85-C601-4E76-9272-8C159C3F4364","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"496705106909aceaaa8221256627ccee4e87402c","datavalue":{"value":"W1993157704","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q699346$C790470E-7708-4200-9B53-8E5BF2502DEB","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Development of the tree-based link labeling algorithm for optimal path-finding in urban transportation networks","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Development_of_the_tree-based_link_labeling_algorithm_for_optimal_path-finding_in_urban_transportation_networks"}}}}}