{"entities":{"Q4401749":{"pageid":6431348,"ns":120,"title":"Item:Q4401749","lastrevid":89589191,"modified":"2026-06-04T17:45:31Z","type":"item","id":"Q4401749","labels":{"en":{"language":"en","value":"Finding All Shortest Distances in a Directed Network"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3435280"}},"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":"Q4401749$ED7681D8-2CA8-457F-86E4-A929F07913B2","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"4de1c68964590656600abb96e562cc8ee4c4f175","datavalue":{"value":{"text":"Finding All Shortest Distances in a Directed Network","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q4401749$BC0AB573-E4C5-41BA-B979-4C94053BF67F","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"40055766f36623696f1f59cb42e984acd162a7aa","datavalue":{"value":"0276.90059","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4401749$EA7E0ECB-EA1B-44FE-A356-BDCBB01172E1","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"ee4258796aef3438234ce9af2cb267f584374cd3","datavalue":{"value":{"entity-type":"item","numeric-id":172224,"id":"Q172224"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4401749$8C29FCFF-25D9-45C4-856C-C51F5AD3A52B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"369d0fc64902ba457c90a72163d431dd4d6b3cda","datavalue":{"value":{"entity-type":"item","numeric-id":915377,"id":"Q915377"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4401749$5A8710A0-1C86-4762-BA7E-88E0CCFF9BAC","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"ac97000bb9a6c8b51835fb6b9b95dbf469544801","datavalue":{"value":{"entity-type":"item","numeric-id":3208397,"id":"Q3208397"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4401749$98E22700-6FAC-4B75-9F46-85FBE7DA21D5","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"4bb0eaa1d64c683ee03edf396d2a33ea56290ca3","datavalue":{"value":{"time":"+1972-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":"Q4401749$CAE811F7-77FA-48F2-B833-5273FC01C6E3","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"d2d4f4e28fa9ca38421c473fcb6ba728a44de59a","datavalue":{"value":"90C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4401749$C6AB4A3F-D185-4C6E-9D2B-D4C53FFEAAB3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"5a3bb76dbd41580d9287ece5137de80ddf22202f","datavalue":{"value":"05C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4401749$B622A5FA-40DC-4EE0-8103-29F9A1A09D99","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"9cf44d503e7d4771a74e60c8b165d38259abcf57","datavalue":{"value":"90B10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4401749$C23B70E7-824A-4B12-B21D-4DA82A75C52C","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"47707619ecf66ec92cf5f9447e5cb5a34ae7788d","datavalue":{"value":"3435280","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4401749$EAF7B25F-A3B8-44E9-9F62-F8B00BB3DD9A","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":"Q4401749$51FCD3A8-53F4-48D6-8F89-C62BB7CBE3B9","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"c78447ca407bc6f3f7b1341c8c5717d43e8b1cb3","datavalue":{"value":"https://doi.org/10.1147/rd.164.0412","type":"string"},"datatype":"url"},"type":"statement","id":"Q4401749$40B7426E-359F-4704-A897-71495E7C49A4","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"da84772ac5aa14cd3bb00b9274594481336e9648","datavalue":{"value":"W2055906662","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4401749$041E90E5-7A44-463B-8CBA-7AB01A9371E6","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"60f4bd3825ad11368ff088d2d22b91ce2066ac25","datavalue":{"value":"10.1147/RD.164.0412","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4401749$93C34BE4-DE36-4CA4-9E42-F8A31DA6CADD","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Finding All Shortest Distances in a Directed Network","badges":[]}}}}}