{"entities":{"Q6944201":{"pageid":21168792,"ns":120,"title":"Item:Q6944201","lastrevid":75949716,"modified":"2026-04-21T16:00:37Z","type":"item","id":"Q6944201","labels":{"en":{"language":"en","value":"Dynamic matrix inverse: improved algorithms and matching conditional lower bounds"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8078790"}},"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":"Q6944201$7452E344-F6AA-4660-945D-244E0438ECC7","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"48df9d7a5830911ae2001cd1f13f26a78d9db117","datavalue":{"value":{"text":"Dynamic matrix inverse: improved algorithms and matching conditional lower bounds","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6944201$B8BAFF65-2027-4D8E-A800-62BCC4C11057","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"82a2a7fcf4bd4aad2203e2ef52832ba8d8aba88b","datavalue":{"value":"10.1109/FOCS.2019.00036","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944201$D35A29D3-7FEC-4AB9-B538-D228B996EF10","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"cde424bf7143ba4327b6e23c0ce9dde9a5a785c4","datavalue":{"value":{"entity-type":"item","numeric-id":5144962,"id":"Q5144962"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6944201$B3DC7F54-1741-4121-9926-6EBA9E8D8E17","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"1a3b8b3ae49f4a83653d67f230de7a96f1760a4b","datavalue":{"value":{"entity-type":"item","numeric-id":487010,"id":"Q487010"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6944201$F499FA31-7DE4-469F-836A-103B1AD6929D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"42215a02b7437d12513effcdd927e00cb3730bf4","datavalue":{"value":{"entity-type":"item","numeric-id":2941484,"id":"Q2941484"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6944201$DD8941F7-20A2-4950-8BA3-13A194905EB3","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"3c757b9b7db25e8670dea572b24907796ea9667b","datavalue":{"value":{"time":"+2025-08-12T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6944201$0026BBE8-53A5-4662-9729-3EA0EF973718","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944201$75AFBEC7-81FC-4FDF-895F-BFC2E4325815","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"ad1c9358c1ae6284f5ae37f6646296c362d4ee93","datavalue":{"value":"8078790","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944201$6DE60D4B-9062-47AF-A01E-5F80AC543090","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":"Q6944201$7E7E684D-F68E-4A7F-9105-85C97F3811BB","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Dynamic matrix inverse: improved algorithms and matching conditional lower bounds","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Dynamic_matrix_inverse:_improved_algorithms_and_matching_conditional_lower_bounds"}}}}}