{"entities":{"Q6843748":{"pageid":20559187,"ns":120,"title":"Item:Q6843748","lastrevid":75002047,"modified":"2026-04-17T12:00:13Z","type":"item","id":"Q6843748","labels":{"en":{"language":"en","value":"An inner approximation algorithm for dynamic optimization with strict satisfaction of path constraints"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8172962"}},"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":"Q6843748$9DF8AC52-A3AF-42DA-BFA0-135CC0A22186","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"5ba81c5b968ae4656ae6f9d2f4ee984838c19524","datavalue":{"value":{"text":"An inner approximation algorithm for dynamic optimization with strict satisfaction of path constraints","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6843748$3750CF3A-F967-44C3-8888-B2317A1D01BF","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"664e3177193c33af99589b3dffdbe03c492e1808","datavalue":{"value":"10.1109/TAC.2025.3568559","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6843748$A05F9A07-7DE7-46FD-8B9F-D7E4BF82977B","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"e2be91b025d2483e954f217332e8545918363881","datavalue":{"value":{"entity-type":"item","numeric-id":297211,"id":"Q297211"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6843748$AA03FB85-D56F-4502-BE54-807528F601B8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"03ab2524b4495f61dd7102f5570e42bf0c64abce","datavalue":{"value":{"entity-type":"item","numeric-id":2972551,"id":"Q2972551"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6843748$F6A13952-35CF-43DE-A7FE-63F6A76A5261","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"231075b9dab1b13e4c64992ef81666085035687e","datavalue":{"value":{"entity-type":"item","numeric-id":123639,"id":"Q123639"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6843748$8C04CA7D-4DA3-41D6-AB38-72D0BB58CCF4","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"b3644e4b5eed83f67d938a41e6474e77bfabf9aa","datavalue":{"value":{"time":"+2026-03-17T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6843748$B25D8EC9-6D9F-4998-8117-A16E2DE5D5E8","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"0d5eef6e848157326ce3189563feefa6213bff81","datavalue":{"value":"93-XX","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6843748$6CBB3CFA-7373-430A-A7D8-A0CD83D2588B","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"f47d7516e3f713fa7b1ec0232b4994f80494dae3","datavalue":{"value":"8172962","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6843748$97F9A315-F853-46C7-9D59-DDFEFC39D00D","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":"Q6843748$2C9D7FCB-25EC-44C3-8D92-0EC7C220C72B","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An inner approximation algorithm for dynamic optimization with strict satisfaction of path constraints","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_inner_approximation_algorithm_for_dynamic_optimization_with_strict_satisfaction_of_path_constraints"}}}}}