{"entities":{"Q6449841":{"pageid":13582846,"ns":120,"title":"Item:Q6449841","lastrevid":95447564,"modified":"2026-06-05T09:04:12Z","type":"item","id":"Q6449841","labels":{"en":{"language":"en","value":"Maximum Load Assortment Optimization: Approximation Algorithms and Adaptivity Gaps"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 902320695"}},"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":"Q6449841$965E7F9F-27C0-42DE-BE9F-BD592A673B03","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"f664a85fd4296021d6538ba55770110075648ec1","datavalue":{"value":{"time":"+2023-09-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":"Q6449841$1346DE18-C0E6-4A5B-A7FE-162558D0C178","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"2a5281e39412067fb80f49e60f439dc2214cd3bd","datavalue":{"value":{"entity-type":"item","numeric-id":1646579,"id":"Q1646579"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6449841$C2C97D12-551B-4893-8AB4-3E6603107FBE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a2cdef6d7cf1d962f38f9aac9da242afa9bdd28f","datavalue":{"value":{"entity-type":"item","numeric-id":6185937,"id":"Q6185937"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6449841$6F6E5870-5618-46EC-AB72-03EBE9733DBA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"fab283caddeb3a68cfa74df85404f28069476ffd","datavalue":{"value":{"entity-type":"item","numeric-id":243584,"id":"Q243584"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6449841$13EAAEAC-8C89-4FA2-876F-A4C4DF24820D","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"58e1f809ec528fe98f80723a3326fb9d40290773","datavalue":{"value":"902320695","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6449841$ADEDFA01-2232-49FB-B857-F68B3C891CEB","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":"Q6449841$9D855DA1-A59A-4D63-B652-F2BC4287D987","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Maximum Load Assortment Optimization: Approximation Algorithms and Adaptivity Gaps","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Maximum_Load_Assortment_Optimization:_Approximation_Algorithms_and_Adaptivity_Gaps"}}}}}