{"entities":{"Q6426672":{"pageid":13559700,"ns":120,"title":"Item:Q6426672","lastrevid":99327476,"modified":"2026-06-05T19:43:05Z","type":"item","id":"Q6426672","labels":{"en":{"language":"en","value":"Reducing Computational and Statistical Complexity in Machine Learning Through Cardinality Sparsity"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900580358"}},"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":"Q6426672$6F0EF083-DC3F-4766-A949-611841AB0372","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"396d6589ca4ee5b017db072a4b7a874460ed3465","datavalue":{"value":{"time":"+2023-02-16T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6426672$FFD2C08D-992E-4D31-9852-38B882BE4957","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"ec4a51926297dcd5ccb0c400c35a3229f7890cd8","datavalue":{"value":{"entity-type":"item","numeric-id":284590,"id":"Q284590"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6426672$585EB14C-2691-48F9-9D90-DE164CD1E6B5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"0512b61a4327b00e5b0427a243e44090caf522ac","datavalue":{"value":{"entity-type":"item","numeric-id":6221519,"id":"Q6221519"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6426672$B07C73E8-C0AB-4942-9FEC-AD63400E9448","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"ba885b17fd59e3c6b4b4af5e4f958f555402f4f0","datavalue":{"value":"900580358","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6426672$591AC468-29A1-4B81-8A79-CE8E5958447E","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":"Q6426672$5D894FC6-D3AD-4859-B6EF-BF72928497D6","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Reducing Computational and Statistical Complexity in Machine Learning Through Cardinality Sparsity","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Reducing_Computational_and_Statistical_Complexity_in_Machine_Learning_Through_Cardinality_Sparsity"}}}}}