{"entities":{"Q7206449":{"pageid":22258532,"ns":120,"title":"Item:Q7206449","lastrevid":107569520,"modified":"2026-10-27T10:48:10Z","type":"item","id":"Q7206449","labels":{"en":{"language":"en","value":"Parameter Optimization in Trajectory Planning via Differentiable Convex Programming"}},"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":"Q7206449$F4E479EB-757D-4FAA-9604-EDDE5BBE6B75","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":"Q7206449$761BCF6D-2B4F-4B6B-A4FE-82EE4129AF2C","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"2aeeeac46b0d05d3cdfa7ae52f9be3dcaa74610e","datavalue":{"value":"2512.03557","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7206449$BA38C93E-D8B7-479C-89DB-CE744D4902BF","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"7f3627eaf5d12b26ae1e0c0d52e28074990ce175","datavalue":{"value":{"entity-type":"item","numeric-id":6639907,"id":"Q6639907"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7206449$ED58BBFD-B56E-45E6-9BE5-36E5DA15589A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"db44837d85a465941e9779c6f0c432f58d768f7a","datavalue":{"value":{"entity-type":"item","numeric-id":698708,"id":"Q698708"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7206449$B450F86F-17A6-462E-AF70-F2F90C99DD88","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"98cffa3a5ab0559330c6970b04043b66ea8903b8","datavalue":{"value":{"entity-type":"item","numeric-id":318414,"id":"Q318414"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7206449$9343198A-5B93-492E-A09B-A0EFF90CD19F","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":"Q7206449$E4B4E394-36A0-4011-B912-4AF1DC751D15","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":"Q7206449$CEE89D10-EE7A-4642-B5E7-B10D810E5A70","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Parameter Optimization in Trajectory Planning via Differentiable Convex Programming","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Parameter_Optimization_in_Trajectory_Planning_via_Differentiable_Convex_Programming"}}}}}