{"entities":{"Q6744372":{"pageid":14463149,"ns":120,"title":"Item:Q6744372","lastrevid":105940046,"modified":"2026-10-21T13:15:04Z","type":"item","id":"Q6744372","labels":{"en":{"language":"en","value":"A Near-Optimal Algorithm for Convex Simple Bilevel Optimization under Weak Assumptions"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"aliases":{},"claims":{"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"5a067f3cc35200b51bab0398d603e2eb9779a610","datavalue":{"value":"math.OC","type":"string"},"datatype":"string"},"type":"statement","id":"Q6744372$A9FB80D2-1E20-4A08-B074-18FCFB31E6EC","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"fecb2f2a7c1f813db3a025a7dd8b5d82439618b9","datavalue":{"value":{"time":"+2024-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":"Q6744372$9FD855BA-25E9-4B0A-9F1A-06E9AEC80A1F","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"05679b8aba53c788c2c6e911a379e4cc63ee8f16","datavalue":{"value":"2409.08948","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6744372$F56248A4-46B4-43C3-ADBC-E97D71AD678F","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"eccfef2ee2843a65714ed3f2045b68e75968de81","datavalue":{"value":{"entity-type":"item","numeric-id":1646572,"id":"Q1646572"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6744372$95E98C3B-FB48-4B4D-8E8E-8506EEDFC5BD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"0b053bffbee51010a631e73ee36ec1653bba9aec","datavalue":{"value":{"entity-type":"item","numeric-id":1684218,"id":"Q1684218"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6744372$59BE4962-148B-4DB1-B3C7-19FC1F47FDAC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"0cc514f61a148cd41d4c64d32d0d38a88e38a2dc","datavalue":{"value":{"entity-type":"item","numeric-id":1639722,"id":"Q1639722"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6744372$B30C64A0-35A7-4C91-8905-CB18B3A64130","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":"Q6744372$0D80BE2A-C7C2-49F2-A08B-E5B215334D06","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":"Q6744372$C237B9A1-6D5E-4B96-B8EC-FFF1BA8AEE75","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A Near-Optimal Algorithm for Convex Simple Bilevel Optimization under Weak Assumptions","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_Near-Optimal_Algorithm_for_Convex_Simple_Bilevel_Optimization_under_Weak_Assumptions"}}}}}