{"entities":{"Q7264809":{"pageid":31038764,"ns":120,"title":"Item:Q7264809","lastrevid":107812208,"modified":"2026-10-27T12:35:25Z","type":"item","id":"Q7264809","labels":{"en":{"language":"en","value":"A unified complexity bound for logconcave sampling"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"aliases":{},"claims":{"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"87bfee88203cfe559185aa1c4a52192771738a74","datavalue":{"value":"cs.DS","type":"string"},"datatype":"string"},"type":"statement","id":"Q7264809$43A40581-0072-432E-8951-458B8507C073","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"fea8258efc0c807aa3a84f12ebcd68838427a662","datavalue":{"value":{"time":"+2026-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":"Q7264809$4AC15B39-17A3-4E40-95C6-52534C61D0E6","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"f35de96571f2345ade0a82830c358d218bc97d81","datavalue":{"value":"2606.12694","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7264809$167F30D3-C60D-450B-98B4-C65C13296437","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"fcd9e51658835950e1f7cf491f49c666b6f71d51","datavalue":{"value":{"entity-type":"item","numeric-id":7176099,"id":"Q7176099"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7264809$0A628A39-E9C6-4DA9-BC9D-051B6C3B9C8C","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":"Q7264809$44E2AAEC-DA67-4C87-8D2F-BFFBAAFB7E65","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":"Q7264809$A3805D68-3C54-4D8A-9B7D-43FDF2118FBF","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":"Q7264809$6933E355-D69E-45EF-9F5E-CDD11604BD15","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A unified complexity bound for logconcave sampling","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_unified_complexity_bound_for_logconcave_sampling"}}}}}