{"entities":{"Q2982413":{"pageid":2993138,"ns":120,"title":"Item:Q2982413","lastrevid":79654925,"modified":"2026-05-06T14:25:02Z","type":"item","id":"Q2982413","labels":{"en":{"language":"en","value":"The Quadratic Utilization Upper Bound for Arbitrary Deadline Real-Time Tasks"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6716496"}},"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":"Q2982413$F4EB42F9-26C6-4BF8-80E7-4F6CD27D878A","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"bd0628ab52b6aa6b6a30e3595e234f0e1c1185cd","datavalue":{"value":{"text":"The Quadratic Utilization Upper Bound for Arbitrary Deadline Real-Time Tasks","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2982413$C826546B-9685-49E2-983A-989D19834016","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"8befcc390494987c0cc728d56f822e8cd3a0be0c","datavalue":{"value":"1360.90120","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2982413$A4436306-C55C-49BF-9710-611384BD1BDA","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"6d04081588340b495234441a3efa00e50af652b4","datavalue":{"value":"10.1109/TC.2013.209","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2982413$C9022492-A07C-4F53-85B2-774AF5F4E721","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"fb076879f4ffd0df60f60b0928108ba3a708c7ae","datavalue":{"value":{"entity-type":"item","numeric-id":813144,"id":"Q813144"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2982413$D36219B5-26E8-45FE-8D71-10420A108B79","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"cb95ba1181f89055fe808aa2c36bea9d3930d0fc","datavalue":{"value":{"entity-type":"item","numeric-id":80442,"id":"Q80442"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2982413$CA71BB58-5A59-43CB-BCCE-FBCCBC378AFA","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"daa85c3fca52a36a5bd491b86ad0a10dbad35089","datavalue":{"value":{"time":"+2017-05-16T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2982413$32CD0D37-A09A-47E7-B975-F85B99602E9E","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"b7ffcab9ce53e90c8627cb2c3bb400b94a5f354a","datavalue":{"value":"90B35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2982413$16C1C55A-427D-404F-8ADD-42EB16446B38","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"794cdfaf6fab05e0dc02da39783f390df6f96ebc","datavalue":{"value":"6716496","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2982413$BC1E1C0E-C724-49B2-89CC-3133450DDA75","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":"Q2982413$A8147556-38BB-44E6-AA00-374D03E45ED2","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"The Quadratic Utilization Upper Bound for Arbitrary Deadline Real-Time Tasks","badges":[]}}}}}