{"entities":{"Q7204705":{"pageid":22252247,"ns":120,"title":"Item:Q7204705","lastrevid":107557649,"modified":"2026-10-27T10:42:41Z","type":"item","id":"Q7204705","labels":{"en":{"language":"en","value":"Time-uniform concentration bounds for iterative algorithms"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"aliases":{},"claims":{"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"2425efcc9b3f19f1145afc4b21ab66cac71c91ae","datavalue":{"value":"math.ST","type":"string"},"datatype":"string"},"type":"statement","id":"Q7204705$512EE623-AF2D-40F5-A81E-B0198AFB263B","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"1533ef58fe3b6ac0b6e76c86b8ed9a818696c893","datavalue":{"value":{"time":"+2025-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":"Q7204705$06EDE67E-B8E9-4C7F-99A1-6E75782DCB26","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"5d614055a6ad30ace5a0b947449b3fe9c237bf71","datavalue":{"value":"2511.18273","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7204705$FD418B68-13A4-4B81-B832-AFAD01FD8875","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"bf74b5a9a895ac472c1685c4238b7af5733fe448","datavalue":{"value":{"entity-type":"item","numeric-id":355085,"id":"Q355085"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7204705$D2F47799-72E7-4BCC-BE03-E2C612C9CA20","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d8f6127f14b0c728fc63d5da5355ffcfefa4270a","datavalue":{"value":{"entity-type":"item","numeric-id":470491,"id":"Q470491"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7204705$C8D11EB9-5B8D-4B91-B747-1CD93A6A7F2A","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":"Q7204705$690BE052-0611-47BC-951B-24AC37A986FF","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":"Q7204705$E461E0BE-E903-40A9-97AC-3248912A0DEE","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Time-uniform concentration bounds for iterative algorithms","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Time-uniform_concentration_bounds_for_iterative_algorithms"}}}}}