{"entities":{"Q6400602":{"pageid":13533850,"ns":120,"title":"Item:Q6400602","lastrevid":103189247,"modified":"2026-06-06T06:29:58Z","type":"item","id":"Q6400602","labels":{"en":{"language":"en","value":"How to Compose Shortest Paths"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900535812"}},"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":"Q6400602$A793BA20-DC4B-43B7-86A3-0D39AF88A9BE","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"faa774ed5a9126021ceedfd68a14edfb65151486","datavalue":{"value":{"time":"+2022-05-27T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6400602$B4647FD0-8C26-4D11-B8F5-837E4EB909C8","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"48be5a2d358f3cfaed0e8cbcc47d1e925c5ec507","datavalue":{"value":{"entity-type":"item","numeric-id":6332153,"id":"Q6332153"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6400602$CF240E95-0E19-4BEB-90E2-2D3461267904","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"bceb9446e78f02a083de2bd6b9a328ab6ac58995","datavalue":{"value":"900535812","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6400602$DDA59E1D-E6EE-41BB-92CE-A2BF240B60BD","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":"Q6400602$86FFF678-D2C9-4535-9E6A-FDEEF08839CA","rank":"normal"}],"P1687":[{"mainsnak":{"snaktype":"value","property":"P1687","hash":"f878f506e53beeba9bdcb777e645475ec25d156f","datavalue":{"value":"https://github.com/jademaster/pathcomposer","type":"string"},"datatype":"url"},"type":"statement","id":"Q6400602$25F9DDED-8B19-45DF-9C37-A26E66F66E9B","rank":"normal","references":[{"hash":"a8344b0b23b15cb79d24418e6123d7d23cb34993","snaks":{"P1688":[{"snaktype":"value","property":"P1688","hash":"2350d54f9c036fd48f6c4ac1ddd2fdb9937f442e","datavalue":{"value":"https://paperswithcode.com/paper/how-to-compose-shortest-paths","type":"string"},"datatype":"url"}],"P1689":[{"snaktype":"value","property":"P1689","hash":"24a5bedbb98b468462189ba0d6c16a88a2414cc1","datavalue":{"value":"publication","type":"string"},"datatype":"string"}]},"snaks-order":["P1688","P1689"]}]}]},"sitelinks":{"mardi":{"site":"mardi","title":"How to Compose Shortest Paths","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/How_to_Compose_Shortest_Paths"}}}}}