{"entities":{"Q6657034":{"pageid":14268191,"ns":120,"title":"Item:Q6657034","lastrevid":103682348,"modified":"2026-06-06T07:54:19Z","type":"item","id":"Q6657034","labels":{"en":{"language":"en","value":"Bellman-Ford is optimal for shortest Hop-bounded paths"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7961917"}},"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":"Q6657034$6E22B9DB-061D-4D3F-8791-C33DF2D65873","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"0ccd51f5085396b9a966068774a6857ee3570fb9","datavalue":{"value":{"text":"Bellman-Ford is optimal for shortest Hop-bounded paths","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6657034$7BE41D76-D23B-4542-ACFD-24A9B073846A","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"d2f0d46d96166900d38ce02a3e241a6b0f47884c","datavalue":{"value":{"entity-type":"item","numeric-id":255283,"id":"Q255283"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6657034$9DDC4F48-FA2D-40FA-A690-C3E4FDDB43B6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"fbcee831cdb35785f83c6c87fbb16e292974804f","datavalue":{"value":{"entity-type":"item","numeric-id":4227049,"id":"Q4227049"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6657034$9EEA8784-3D0F-42A5-8BBF-EC5724E8BC91","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"61d4fcd001548dfc6222d0098d472cd2a6031b71","datavalue":{"value":{"time":"+2025-01-06T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6657034$D4A2A436-0F7F-4CDD-9D32-E71AA4E596D6","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6657034$1572EFDC-86E3-4B04-9B5C-67D0C908C325","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"257262949da964830ae1a796fbfee3a68f40f609","datavalue":{"value":"7961917","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6657034$A74709E7-BD60-4318-9A35-255C38F7001C","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"aa6662364db17862eb88962f414bb00491088635","datavalue":{"value":"fine-grained complexity","type":"string"},"datatype":"string"},"type":"statement","id":"Q6657034$DCADE2A1-4009-43A2-A94A-8B6553FAA80F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"ed3b495ba8c3c3bf5babb1d3213a6c0bf58078e5","datavalue":{"value":"graph algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q6657034$55A24EEF-92D0-4FA8-8CD9-7F4A2995E7B9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0e0192fb524376f45dfdd3eb1a809bf3cd5a9489","datavalue":{"value":"lower bounds","type":"string"},"datatype":"string"},"type":"statement","id":"Q6657034$D81661C9-352C-4740-AE5E-332E4554C1AF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"69d0c99f1e5283b31715a9c7d799852fe62c506e","datavalue":{"value":"shortest paths","type":"string"},"datatype":"string"},"type":"statement","id":"Q6657034$FF2E417A-D06B-465E-9FE6-76833332C9AA","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":"Q6657034$AC4EE6E0-F98D-4619-9610-51966C818470","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"b72ff77905861cadde0056acbb14dc962921bdc5","datavalue":{"value":"10.4230/LIPICS.ESA.2023.72","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6657034$DDD566F7-047F-4F05-8D7E-FB89DCC90DDD","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Bellman-Ford is optimal for shortest Hop-bounded paths","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Bellman-Ford_is_optimal_for_shortest_Hop-bounded_paths"}}}}}