{"entities":{"Q7398124":{"pageid":31725227,"ns":120,"title":"Item:Q7398124","lastrevid":108067886,"modified":"2026-10-27T14:46:49Z","type":"item","id":"Q7398124","labels":{"en":{"language":"en","value":"Cost-Aware Iteration Allocation for Sequential Multi-Fidelity First-Order Optimization"}},"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":"Q7398124$B8F75183-4BAA-4BA2-8EAC-BB22E1EA1A0F","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":"Q7398124$AA3AA967-B308-49FB-81DB-B05D5D854219","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"6ea0830e786e2f5b8fcd0c51b6a328b28d0da14c","datavalue":{"value":"2610.14295","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7398124$68CB4BAE-6D52-4780-BF20-C7E7ECCA9EAC","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"663f6bcf8d6cd44e0571d322351c88d388124c54","datavalue":{"value":{"entity-type":"item","numeric-id":2023936,"id":"Q2023936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7398124$95446687-5C19-4940-8244-FDC5E2FE35E8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"f4fac768024acec818601b54ef52de0009680a9c","datavalue":{"value":{"entity-type":"item","numeric-id":421688,"id":"Q421688"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7398124$3B6BB9CB-672E-41E4-8A6D-C656635202C0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"81f20d223f5b2ab04caa1a3bd03f6295cac8e6c6","datavalue":{"value":{"entity-type":"item","numeric-id":7398123,"id":"Q7398123"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7398124$EF456048-E215-4818-B487-C30FAF0BC222","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":"Q7398124$552B7E02-98A4-4E2A-9AF1-51FF27FAD1DB","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":"Q7398124$DE96FDBC-5009-4156-AC50-BDE24B810397","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Cost-Aware Iteration Allocation for Sequential Multi-Fidelity First-Order Optimization","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Cost-Aware_Iteration_Allocation_for_Sequential_Multi-Fidelity_First-Order_Optimization"}}}}}