{"entities":{"Q131473":{"pageid":133001,"ns":120,"title":"Item:Q131473","lastrevid":59789235,"modified":"2026-04-10T13:57:57Z","type":"item","id":"Q131473","labels":{"en":{"language":"en","value":"topFiberM: Scalable and Efficient Boolean Matrix Factorization"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"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":"Q131473$16FEF2B1-A117-4CE0-BDF5-BE2040F62998","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"21d06c5f76fb66348577023713dc543c2934e806","datavalue":{"value":{"time":"+2019-03-06T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q131473$38CA212B-7E1E-45FE-A66D-22E876C026C0","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"771383ab37a6c103ae8d09ac7764d1c10d65f7e6","datavalue":{"value":"1903.10326","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q131473$77659FE8-250E-494D-B836-6EC6FFD4F21E","rank":"normal"}],"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"87bfee88203cfe559185aa1c4a52192771738a74","datavalue":{"value":"cs.DS","type":"string"},"datatype":"string"},"type":"statement","id":"Q131473$7F5A756A-C8E3-42C2-B196-3C2006A7D0B8","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"9627bdd0335c47fb3bfa024226f69cc6ff8ca574","datavalue":{"value":{"entity-type":"item","numeric-id":131461,"id":"Q131461"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q131473$5F47F6CF-A4F5-4488-B94D-B399A3436A3E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"20d4eb7c5c6d82008a5e356374f7202d905f3410","datavalue":{"value":{"entity-type":"item","numeric-id":131471,"id":"Q131471"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q131473$6CA2987F-12EE-415B-8516-F91D037B5425","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"1eff56f0cdaa20cf65d7e0ee772e22b226204c8a","datavalue":{"value":{"entity-type":"item","numeric-id":131472,"id":"Q131472"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q131473$02F4220F-635F-4691-B859-03C5AD556294","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":"Q131473$DE70F7C9-82AC-4047-92F2-936F55563269","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"7d069e4036a527d573fb14136f79e444fa3b0c94","datavalue":{"value":"10.48550/ARXIV.1903.10326","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q131473$E508E58C-48B9-44C2-AF88-7424B1B1AD74","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"cfd18ebd948a45f01916a9cc903beb31246ff3ca","datavalue":{"value":{"entity-type":"item","numeric-id":6036979,"id":"Q6036979"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q131473$a60c51c6-408f-355b-02f9-4b2ba1c420f7","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"TopFiberM: Scalable and Efficient Boolean Matrix Factorization","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/TopFiberM:_Scalable_and_Efficient_Boolean_Matrix_Factorization"}}}}}