{"entities":{"Q6842427":{"pageid":20551276,"ns":120,"title":"Item:Q6842427","lastrevid":74990170,"modified":"2026-04-17T09:37:09Z","type":"item","id":"Q6842427","labels":{"en":{"language":"en","value":"NP-hardness and approximation algorithms for constrained entropy maximization"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8174050"}},"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":"Q6842427$39A25AE1-DD50-4B9F-AB4A-6A1C55F9848A","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"22798819244c796c3638c6d53a0cd6bb060491e0","datavalue":{"value":{"text":"NP-hardness and approximation algorithms for constrained entropy maximization","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6842427$F1C30700-F011-49FE-873D-757B91BD1E09","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"c0864be308c4e4540d512907726b7704ed9d4be6","datavalue":{"value":"10.1109/TIT.2025.3644150","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6842427$F71F4282-A31F-465C-8FD0-2CF86B4585DC","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"9e5608ba2a6c2bb861993b05621908092636df5c","datavalue":{"value":{"entity-type":"item","numeric-id":1789096,"id":"Q1789096"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6842427$BEF8B207-64DF-4C31-AFC6-1C4861CAF47E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"69617d6f99dd3e27fa44520f80c02a82e00d4ada","datavalue":{"value":{"entity-type":"item","numeric-id":235729,"id":"Q235729"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6842427$D370D872-E825-43A4-A480-70EA3CC11712","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"90c5240c9cd9e181a1b77d3501d191b6631d1861","datavalue":{"value":{"entity-type":"item","numeric-id":97723,"id":"Q97723"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6842427$09636D2F-0A88-4F29-9800-DD7B6D252F44","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"08788b2cbf350ad4bc12c8b64351e1e6eefe3b67","datavalue":{"value":{"time":"+2026-03-18T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6842427$1518F89E-3A8C-45FB-A52E-4B3F4266C9DD","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"53aeb1fcbd2f0d31715f68f8c0d9430ea394bc21","datavalue":{"value":"94-XX","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6842427$B62D1A9F-A86A-4B60-8E73-68D4796A3FC1","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"54263fff96914ef19785cd8f556200cdba58a5b0","datavalue":{"value":"8174050","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6842427$324A2386-3A16-4542-88A5-37A55FC2CAFD","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":"Q6842427$2DC711A3-B298-4CE4-BC6A-4CBA96B87678","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"NP-hardness and approximation algorithms for constrained entropy maximization","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/NP-hardness_and_approximation_algorithms_for_constrained_entropy_maximization"}}}}}