{"entities":{"Q6909484":{"pageid":20958766,"ns":120,"title":"Item:Q6909484","lastrevid":75610027,"modified":"2026-04-20T08:56:26Z","type":"item","id":"Q6909484","labels":{"en":{"language":"en","value":"Fast Monte-Carlo algorithms for finding low-rank approximations"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8112191"}},"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":"Q6909484$6EC7E1ED-2F87-4272-B34B-A9953842DBBE","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"66abaa3e1b097e6094c2607afd99c8600e841ca0","datavalue":{"value":{"text":"Fast Monte-Carlo algorithms for finding low-rank approximations","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6909484$EE3B1105-D2F3-444D-B975-593407334A78","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"25dcd91e741db1b83f692e28b446e39c04d16618","datavalue":{"value":"10.1109/SFCS.1998.743487","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6909484$E914AB2D-18FD-4701-838E-F47FFE731458","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"17fd1dfe1d91df455619b1246ffef8f41c1d7bde","datavalue":{"value":{"entity-type":"item","numeric-id":1356891,"id":"Q1356891"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6909484$83A05836-F603-4707-840C-F495F608733E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"4ee31696a3be6df3bdd79f474603a4526c11abc4","datavalue":{"value":{"entity-type":"item","numeric-id":1577015,"id":"Q1577015"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6909484$06031FF2-08F0-4683-A034-4BF4B4682E10","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d0b69652026ab5cd3403f51ea14f724a8b3ebf94","datavalue":{"value":{"entity-type":"item","numeric-id":298157,"id":"Q298157"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6909484$5B7FD9B5-5571-4D2C-BA87-4BEA5405E1EB","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"b77d6a4382bc7a32fc14d82772e7dcb343e03ac6","datavalue":{"value":{"time":"+2025-10-29T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6909484$54A9926D-106E-4DED-80B3-E608FE6334EC","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6909484$CBAEF952-2452-4768-8818-2CF6AAD78E5F","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"15113adeda4deae824d23bb72ee5dfa278db50b6","datavalue":{"value":"8112191","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6909484$45C1A65A-15C9-4918-A718-CCE76CBADB34","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":"Q6909484$5BBD786C-976D-4C9C-BDC2-D7F00C058F36","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Fast Monte-Carlo algorithms for finding low-rank approximations","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Fast_Monte-Carlo_algorithms_for_finding_low-rank_approximations"}}}}}