{"entities":{"Q6311428":{"pageid":13447381,"ns":120,"title":"Item:Q6311428","lastrevid":99197687,"modified":"2026-06-05T19:26:08Z","type":"item","id":"Q6311428","labels":{"en":{"language":"en","value":"First-order algorithms converge faster than $O(1/k)$ on convex problems"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900367388"}},"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":"Q6311428$BD20E226-7A5F-471A-A27A-F2B30F6CFE60","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"6dcfa2f686a29b91337cf0e5bf2d36b7222040b6","datavalue":{"value":{"time":"+2018-12-20T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6311428$1C79920C-F322-46AC-986C-BE93AF7D6DD6","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"9238d283bec9361caf1e1ff1cfb8e23fc8648246","datavalue":{"value":{"entity-type":"item","numeric-id":782441,"id":"Q782441"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6311428$9DFAEBCB-83CC-4E15-BBBF-42D4DF1E3D4D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"11de2785e25d6fa695190755661e9827ec764169","datavalue":{"value":{"entity-type":"item","numeric-id":173847,"id":"Q173847"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6311428$64891A1E-762A-437B-9351-2CD22588ADAC","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"ff4f582588010544411ce5394a043272e9a1d2f7","datavalue":{"value":"900367388","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6311428$3F074DD0-DE26-440D-A065-578CFA70644A","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":"Q6311428$6C91ED92-5469-4E12-99DB-D16ADBABAC4E","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"First-order algorithms converge faster than $O(1/k)$ on convex problems","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/First-order_algorithms_converge_faster_than_$O(1/k)$_on_convex_problems"}}}}}