{"entities":{"Q6942840":{"pageid":21160647,"ns":120,"title":"Item:Q6942840","lastrevid":75937431,"modified":"2026-04-21T14:49:47Z","type":"item","id":"Q6942840","labels":{"en":{"language":"en","value":"The bit complexity of efficient continuous optimization"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8080141"}},"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":"Q6942840$2A407A8F-1695-4855-91FD-A5E9B89EB8E6","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"8e4eddd351a5384601c9bce21577534e0d1f33f4","datavalue":{"value":{"text":"The bit complexity of efficient continuous optimization","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6942840$E58F5BDB-6204-4065-9904-D7B3F217A9DA","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"9f76db5b9e4387958b1b30b2e8a8a81161bbb995","datavalue":{"value":"10.1109/FOCS57990.2023.00125","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6942840$377C902B-DE30-4C40-97D0-1A4EA832E1F0","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"987647ad38021ec2853d230b3ade89cd05c7a9f5","datavalue":{"value":{"entity-type":"item","numeric-id":6147313,"id":"Q6147313"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6942840$A0383AA0-A204-43BA-BCD2-26B6FFF220B5","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":"Q6942840$3DFB6DE0-BFBD-4115-A094-7CC92C5C21B3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a92bd40586de3b5bc8b8ddc9c7f47d01fe3261e5","datavalue":{"value":{"entity-type":"item","numeric-id":487265,"id":"Q487265"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6942840$E005D374-F35E-45A3-A9C8-C0479D23A95E","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"c353c511b4dc13ecee102b336a2664d881fe8b6f","datavalue":{"value":{"time":"+2025-08-15T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6942840$62ADAF61-AF52-4C08-A252-FB11539662E9","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6942840$AA7A0D05-2E7A-484D-B1E8-88BE479E5EA3","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"33cee1d5b67f307804803c5db068f6018b7ad1d4","datavalue":{"value":"8080141","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6942840$BC283A6B-32BF-4C7C-BA67-8A45F03EC561","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":"Q6942840$8C043ECC-704A-4E7D-B165-376AA3D794C3","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"The bit complexity of efficient continuous optimization","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/The_bit_complexity_of_efficient_continuous_optimization"}}}}}