{"entities":{"Q6401442":{"pageid":13534670,"ns":120,"title":"Item:Q6401442","lastrevid":103218299,"modified":"2026-06-06T06:33:51Z","type":"item","id":"Q6401442","labels":{"en":{"language":"en","value":"On the quick search for the shortest paths in an unweighted dynamic graph by its projections in brief"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900536704"}},"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":"Q6401442$9EB1D0FF-75DF-4DB4-A329-F09D9C50F06C","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"b3cf5dcd0a1b4e1ab96661cdd555a0d486e901de","datavalue":{"value":{"time":"+2022-06-08T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6401442$34686BDA-F78A-4EA8-ABC2-B6E14A3FD5EF","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"e6a26020b588f90e566a5d956b80771a82b0f26d","datavalue":{"value":{"entity-type":"item","numeric-id":1778876,"id":"Q1778876"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6401442$4A3CE532-9722-44F9-AC27-D50759891556","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"acbadb9730643b31a13627776e89090bb16cd19e","datavalue":{"value":"900536704","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6401442$3E21150F-5463-4531-AA96-093E29D796EA","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":"Q6401442$145721EE-EE4F-41F4-AF14-FA7D4464A828","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On the quick search for the shortest paths in an unweighted dynamic graph by its projections in brief","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/On_the_quick_search_for_the_shortest_paths_in_an_unweighted_dynamic_graph_by_its_projections_in_brief"}}}}}