{"entities":{"Q5215713":{"pageid":7245283,"ns":120,"title":"Item:Q5215713","lastrevid":94463303,"modified":"2026-06-05T06:53:01Z","type":"item","id":"Q5215713","labels":{"en":{"language":"en","value":"On Greedy Algorithms with bounded cumulative coherence"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7166897"}},"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":"Q5215713$D5A5E54B-A2AC-44D4-B928-8422273F678F","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"6684454fd7b920d45b91679fea8fe32296aaa0b2","datavalue":{"value":"1430.41027","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5215713$35A36B04-D4A2-45EE-9F8A-4ECB2B3AB5AD","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"4675396321abd00b5f4f4eb56e2257ea540d4b5b","datavalue":{"value":{"entity-type":"item","numeric-id":420767,"id":"Q420767"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5215713$403849C1-1124-41C4-917C-CD1CAF6E07D4","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"abfd8c068e34548cdf05c7584997a586e2790d23","datavalue":{"value":{"time":"+2020-02-13T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q5215713$11E37CC7-E491-4E41-9C39-8531F6FD163A","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"91cb0d64c53ac149248024c93ed46eb374928288","datavalue":{"value":"https://arxiv.org/abs/0911.1500","type":"string"},"datatype":"url"},"type":"statement","id":"Q5215713$04427F72-C88B-4756-B24A-6A2DA9290576","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"89346f20a6c5c6b864a211d37f17719b2851c4ad","datavalue":{"value":"41A65","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5215713$4326B2DF-6816-46CF-AE14-22D486DB6E53","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ff63876d0fe0409f4af99d031e09af02cd43908c","datavalue":{"value":"41A30","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5215713$978F9B16-90CF-4748-BAB2-3553C3BF6A08","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"1f55084b180690916728a90c77ce859e87397787","datavalue":{"value":"7166897","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5215713$DC7481E6-1A38-46D0-925F-29F8C197CAF2","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":"Q5215713$8367B998-DF19-4969-817E-D962F84A6F8E","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On Greedy Algorithms with bounded cumulative coherence","badges":[]}}}}}