{"entities":{"Q6906367":{"pageid":20937808,"ns":120,"title":"Item:Q6906367","lastrevid":75575029,"modified":"2026-04-19T12:39:08Z","type":"item","id":"Q6906367","labels":{"en":{"language":"en","value":"On the complexity of algorithms with predictions for dynamic graph problems"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8115387"}},"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":"Q6906367$4532F8F7-D49F-4AF6-BE9F-CBC2249627CD","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"a2513878e81667a6ddd679719c60a3cbaf9edc4f","datavalue":{"value":{"text":"On the complexity of algorithms with predictions for dynamic graph problems","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6906367$5126A7C2-642D-4F29-8631-9F0A3337A1A4","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"0525dd3cfbd92d18d249bb50e40b8b63555a1bf3","datavalue":{"value":"10.4230/LIPICS.ITCS.2024.62","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6906367$943886C4-D79B-44A3-B799-0FC4B4288EA6","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"b5206d388e7179cac1a1f282e72074e651e25ba7","datavalue":{"value":{"entity-type":"item","numeric-id":1370851,"id":"Q1370851"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6906367$F51E776C-99FF-47D6-BB90-B9DF1768962D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"8a73f9441e0412c5681f6f84243e5d6f3a321000","datavalue":{"value":{"entity-type":"item","numeric-id":269999,"id":"Q269999"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6906367$24DD4EE5-4162-48E3-8B2D-425946346A50","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"aee3293b8e154e4835c49ce413d4a2f84caa7167","datavalue":{"value":{"entity-type":"item","numeric-id":4328688,"id":"Q4328688"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6906367$221D9DAE-2883-4A7F-A152-AF4AA387063B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"34dc2b58036010e30c1f8aa76f2263ff5928d982","datavalue":{"value":{"entity-type":"item","numeric-id":6645540,"id":"Q6645540"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6906367$66F15868-C78C-4613-BDE2-2C4CD8E5AC4B","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"57d1246c8339bcdec3a59483c632c6d106ca03b0","datavalue":{"value":{"time":"+2025-11-04T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6906367$82A253B8-EBD7-4913-8D89-4A98DFC16810","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"f969879f531643f058f8dd4c87a7dd4eb7b8c4c8","datavalue":{"value":"68Qxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6906367$0E3F6640-F203-45EF-A4E8-B8D440195EFE","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"eed9f8fd8392d6d1c8003fef9dccfa2dec97757e","datavalue":{"value":"8115387","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6906367$9671EEBC-1003-4F0B-88EB-468330E091EE","rank":"normal"}],"P163":[{"mainsnak":{"snaktype":"value","property":"P163","hash":"45fcd4163b5f33e6e8c784f5522d7246c0a1a61e","datavalue":{"value":{"entity-type":"item","numeric-id":57056,"id":"Q57056"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6906367$C9A365D1-6649-47C5-826B-D88D818ACD4D","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8b94880bfc501961b7f0bc4c7ca63c5c81f601c7","datavalue":{"value":"dynamic graph algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q6906367$7B15DE54-A4FA-48C2-85E0-DA48EA74ECA5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"56b31693e386e79775fa12697f0daad69c6ec740","datavalue":{"value":"algorithms with predictions","type":"string"},"datatype":"string"},"type":"statement","id":"Q6906367$E8132D92-4B08-4DBB-BB8C-BCA96A9DA53D","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":"Q6906367$32128505-8EEC-4009-9819-6E1F6C97CA7B","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On the complexity of algorithms with predictions for dynamic graph problems","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/On_the_complexity_of_algorithms_with_predictions_for_dynamic_graph_problems"}}}}}