{"entities":{"Q7289767":{"pageid":31152343,"ns":120,"title":"Item:Q7289767","lastrevid":104619967,"modified":"2026-09-11T10:14:36Z","type":"item","id":"Q7289767","labels":{"en":{"language":"en","value":"Faster single-source shortest paths with negative real weights via proper hop distance"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8217669"}},"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":"Q7289767$5FE23203-44C6-49B7-8372-D412D66D8EB0","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"18487203206e4f7ee882fa0feac77f2e256721fe","datavalue":{"value":{"text":"Faster single-source shortest paths with negative real weights via proper hop distance","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q7289767$0BA3F74F-3899-42CB-B4DF-AE34E44F4867","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"ed1d9a4b89750cc7cc9b1d69b2338f19da090485","datavalue":{"value":"10.1137/1.9781611978322.178","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7289767$AC854B77-6198-4049-9826-9002CEDF9FD4","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"60c4ecb79d96eb0b0fb4aadbf78e795a096e43bf","datavalue":{"value":{"entity-type":"item","numeric-id":6179414,"id":"Q6179414"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7289767$D2A777F9-2767-4442-ACB6-C680A3FA45C1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d422907ef6c4667e7f1a1a0bb1871511fb98a747","datavalue":{"value":{"entity-type":"item","numeric-id":7289766,"id":"Q7289766"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7289767$1EAB7822-ECFF-4C16-A78D-B579735987EA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"5e183e67e8b03555925fdbd3694c416773cf5935","datavalue":{"value":{"entity-type":"item","numeric-id":2165260,"id":"Q2165260"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7289767$38FDF33D-3FC3-4227-8D90-7D7DD11AEF3F","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"d0e7b09539a160a9fd6354f44ec86b05fdd8b9c8","datavalue":{"value":{"time":"+2026-07-03T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7289767$C4C91064-34FA-42C7-AEBC-8EF193061D93","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7289767$D3EED53D-BB8D-43DF-9EDA-7C4502B02C4F","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"ab6a6fc7d30ea58208648152246055d55c873d1d","datavalue":{"value":"8217669","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7289767$9C160605-232A-47A7-A57D-525BE14BB16F","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":"Q7289767$BE2F17AB-F9FC-45B1-84A5-6E102BAFA889","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Faster single-source shortest paths with negative real weights via proper hop distance","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Faster_single-source_shortest_paths_with_negative_real_weights_via_proper_hop_distance"}}}}}