{"entities":{"Q7090160":{"pageid":21884172,"ns":120,"title":"Item:Q7090160","lastrevid":106569746,"modified":"2026-10-22T12:33:33Z","type":"item","id":"Q7090160","labels":{"en":{"language":"en","value":"A note on alternating minimization algorithms: Bregman frame"}},"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":"Q7090160$152056CB-5464-447E-B687-24F133E10C98","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"553c63141197e62317a089890d0e71764f08d967","datavalue":{"value":{"time":"+2016-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":"Q7090160$BA417E16-7F26-4E0C-8A12-DBAEB482399C","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"bf11ef741368e763e659c5c67930c19ca4a5ee74","datavalue":{"value":"1605.08290","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7090160$2AC0091E-04B4-466C-BA9E-662E1D0568A2","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"b508b4878d098e4ceaa54fa28790e5ebc2a8d6de","datavalue":{"value":{"entity-type":"item","numeric-id":6558457,"id":"Q6558457"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7090160$80501691-DC66-429E-AEE5-64D2C1611C87","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"eeee3688fe737f7a7d880f1e9ce2d25b98d25c01","datavalue":{"value":{"entity-type":"item","numeric-id":592418,"id":"Q592418"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7090160$224DC0B1-0649-4F91-A0BE-25CEE84BBC34","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":"Q7090160$C3003C51-4878-4D67-9177-480DA9C4E1D2","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":"Q7090160$55C7E47C-4B15-4B70-81EF-A1A6F882AE75","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A note on alternating minimization algorithms: Bregman frame","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_note_on_alternating_minimization_algorithms:_Bregman_frame"}}}}}