{"entities":{"Q6899196":{"pageid":20893480,"ns":120,"title":"Item:Q6899196","lastrevid":75506533,"modified":"2026-04-19T07:29:20Z","type":"item","id":"Q6899196","labels":{"en":{"language":"en","value":"Achieving long-term fairness in submodular maximization through randomization"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8122512"}},"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":"Q6899196$B3FE60BA-FA82-4078-AC22-25D4D455F743","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"c4fbca543e2b333435c276610e6838314693fb3f","datavalue":{"value":{"text":"Achieving long-term fairness in submodular maximization through randomization","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6899196$AB6E396E-05A9-4E15-80FE-070576151D94","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"88cbadf6c2a58ac32a7a532409b83fb7c4569f71","datavalue":{"value":"10.1007/978-3-031-46826-1_13","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6899196$5C7675D1-69C8-4EBD-98AA-8DD1D670432A","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"01c18c29c116a24ab667e3e6af69448a3361413e","datavalue":{"value":{"entity-type":"item","numeric-id":1041235,"id":"Q1041235"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6899196$04F46528-0F71-4B59-9C48-148C2DF2E614","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"7a9e07df2a79ca3038692d5d6a05b934849e8a92","datavalue":{"value":{"entity-type":"item","numeric-id":6537996,"id":"Q6537996"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6899196$DD19784F-D396-4B2E-AE8B-DD74B372FE10","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"5af4488f5e34213ec39c736aff2b454dde8ad0ff","datavalue":{"value":{"entity-type":"item","numeric-id":6899195,"id":"Q6899195"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6899196$6440CC74-B4F2-496E-802C-5CA9C929577D","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"f652ec88ec3e1fe6ec4cd63a853e8f8dcb5fd2bd","datavalue":{"value":{"time":"+2025-11-17T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6899196$B30680D1-6A5C-4542-A854-762B7E8E6572","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"3783afd39b9a4c0ecdd0e6ac842f765284c23884","datavalue":{"value":"91B32","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6899196$00942198-508B-4A14-8883-CD1C54DFBCA4","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"c6f2413d2790ddfa2923e72b64503b1f32dc3f1d","datavalue":{"value":"8122512","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6899196$D9A9EED1-FFE2-441D-A888-04958E0A20DF","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":"Q6899196$C89BE1B0-ECB8-4EF3-AC6F-023E597FC8FF","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Achieving long-term fairness in submodular maximization through randomization","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Achieving_long-term_fairness_in_submodular_maximization_through_randomization"}}}}}