{"entities":{"Q7109539":{"pageid":21942828,"ns":120,"title":"Item:Q7109539","lastrevid":106743215,"modified":"2026-10-22T13:51:56Z","type":"item","id":"Q7109539","labels":{"en":{"language":"en","value":"A Parallel Hierarchical Blocked Adaptive Cross Approximation Algorithm"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"aliases":{},"claims":{"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"ebcab1bde8ac3b28efaefc12ea8cc1068c9a8b14","datavalue":{"value":"math.NA","type":"string"},"datatype":"string"},"type":"statement","id":"Q7109539$99FFA716-3D64-4616-8287-3B114A394325","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"68f8a51ee03d75aa5b0c3a59079e8df6cac50318","datavalue":{"value":{"time":"+2019-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7109539$BCC01733-FB13-4FD7-BD20-50C797E3135F","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"00ae2864c1b79fd55cf1238a1956441732a4e0b2","datavalue":{"value":"1901.06101","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7109539$FEF7CCC9-65C0-4610-A9FA-FC00B86CC590","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"a5fe2bb2c2d65055ad73676344fe5a04726ad440","datavalue":{"value":{"entity-type":"item","numeric-id":2222697,"id":"Q2222697"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7109539$EA4FC9BB-C6D6-42A4-A534-B912A3D1BCF8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"58551d9063c6f29a1aace0de2b9dd03770bfbf53","datavalue":{"value":{"entity-type":"item","numeric-id":4581375,"id":"Q4581375"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7109539$B3ABB1A4-2F1D-4C1A-959A-36FF757F1B46","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"56dd824accf4de7937cf004f1306efbca2360fad","datavalue":{"value":{"entity-type":"item","numeric-id":785423,"id":"Q785423"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7109539$447BE3AA-A251-400B-9E08-1676A7539767","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a43a0549a79d826859b79395ae0f3a6261184629","datavalue":{"value":{"entity-type":"item","numeric-id":2018481,"id":"Q2018481"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7109539$FDD012E4-8460-4B86-A733-FFC08A9EB94B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"59789b3a2bd3e121109bf6bc16381fe65407b6db","datavalue":{"value":{"entity-type":"item","numeric-id":2830619,"id":"Q2830619"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7109539$95231308-E96D-49F2-9817-240E86E791AB","rank":"normal"}],"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":"Q7109539$D6487052-AFC4-4406-A42F-0A947CCE583D","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":"Q7109539$49A4A209-CA38-4860-91E9-6C6F9987E84F","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A Parallel Hierarchical Blocked Adaptive Cross Approximation Algorithm (scientific article from arXiv)","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_Parallel_Hierarchical_Blocked_Adaptive_Cross_Approximation_Algorithm_(scientific_article_from_arXiv)"}}}}}