{"entities":{"Q7181055":{"pageid":22168340,"ns":120,"title":"Item:Q7181055","lastrevid":107377616,"modified":"2026-10-23T14:03:32Z","type":"item","id":"Q7181055","labels":{"en":{"language":"en","value":"Worst-Case Complexity of High-Order Algorithms for Pareto-Front Reconstruction"}},"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":"Q7181055$0F7D1017-429D-41B4-BED1-7AA09A77FE5F","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":"Q7181055$F327146D-B335-4C8A-B552-7FE9E7AFBEA8","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"97ff88e4b7990069f9b31d47f0232eb1f7f3b966","datavalue":{"value":"2506.11929","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7181055$9FD0C47C-72D7-4B1F-8E3E-CD0FD61E3043","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"b07bc8bd5ae5bfca80cbec7e9b548aeb0b72b2e3","datavalue":{"value":{"entity-type":"item","numeric-id":782909,"id":"Q782909"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7181055$01397595-75E4-4ED4-854C-84C82675A354","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"0fdf8983a506b38d5c52a5bce13d1c2af056d174","datavalue":{"value":{"entity-type":"item","numeric-id":510936,"id":"Q510936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7181055$3A183C6F-FCA9-4B89-8FB1-C65CC002FC11","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"5a5ade0cfc1f07a7649ebb3360601f422305a6b2","datavalue":{"value":{"entity-type":"item","numeric-id":240150,"id":"Q240150"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7181055$A37488B4-615F-4DE5-9403-B94962407149","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"829ff773f3aef966f176686538c8e034a5f2e5d4","datavalue":{"value":{"entity-type":"item","numeric-id":428493,"id":"Q428493"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7181055$D0849E9E-CCA1-4EE1-BB77-F37B8DDC7AE7","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":"Q7181055$5641CEF1-D157-46E9-9B24-C4AAD3AD0130","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":"Q7181055$770B9D23-FC96-4CF8-8A2E-C11BB3032B4F","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Worst-Case Complexity of High-Order Algorithms for Pareto-Front Reconstruction","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Worst-Case_Complexity_of_High-Order_Algorithms_for_Pareto-Front_Reconstruction"}}}}}