{"entities":{"Q5255817":{"pageid":7285385,"ns":120,"title":"Item:Q5255817","lastrevid":100530461,"modified":"2026-06-05T22:22:15Z","type":"item","id":"Q5255817","labels":{"en":{"language":"en","value":"Greedy packet scheduling on shortest paths (preliminary version)"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6447812"}},"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":"Q5255817$79949823-506C-41C0-A2F6-DB4921AAAA64","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"8a3aae963e04a6e5596d9fd1dd8eb04ee17086d1","datavalue":{"value":{"text":"Greedy packet scheduling on shortest paths (preliminary version)","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5255817$39A0C0BF-1574-44B6-8302-61A5CB3B3B13","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"8ea29c668c38243b354fa1b702d8f315aa1fc04c","datavalue":{"value":"1314.68092","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5255817$F1AFB123-A7B0-4625-982F-BCF6CA78FAF9","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"0cf0532e50e9660c543921c5150769f6aa328c9c","datavalue":{"value":"10.1145/112600.112615","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5255817$9F32F049-AF2F-43BF-8CA1-675CF2153F96","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"0fa357464d74acb9975fa4cd05187c5de744d8ff","datavalue":{"value":{"entity-type":"item","numeric-id":222241,"id":"Q222241"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5255817$0FF73777-6A08-409A-8481-B99B75A2A732","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"8bf2643e163a7eb6682ba5f68c16a63a32c06afd","datavalue":{"value":{"entity-type":"item","numeric-id":266267,"id":"Q266267"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5255817$83CE943F-F355-45AE-9743-8B4B2EAE9274","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"525b6e0743049615b23af128fa4ee26298db1118","datavalue":{"value":{"entity-type":"item","numeric-id":5255800,"id":"Q5255800"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5255817$8999B673-7A56-4821-B7F2-C071135829E9","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"3d5cd06f458db584fbf91afba7a3985037fff4b1","datavalue":{"value":{"time":"+2015-06-19T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q5255817$9E222BEF-12E3-42EF-864D-B503505F7D3A","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"1908801a2431998085c7d582418a428f7e7f6658","datavalue":{"value":"68M20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5255817$DBCA74F8-C335-4CD7-AEE7-A4C441CD8E83","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"b7ffcab9ce53e90c8627cb2c3bb400b94a5f354a","datavalue":{"value":"90B35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5255817$DAFB0380-07D4-4159-BAD9-A25A9E1D938D","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"ed8ee1cead3471554fac9be195a98f17e079cd76","datavalue":{"value":"6447812","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5255817$6AA0618D-98C3-4BFE-875F-5D2D9E5F9448","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":"Q5255817$D1A1E575-49A7-4B23-A605-12325D3C6522","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"8f8beb2153df23df51a3ff7aa3c209a305a26894","datavalue":{"value":"https://doi.org/10.1145/112600.112615","type":"string"},"datatype":"url"},"type":"statement","id":"Q5255817$CBA82A79-8C71-4CEF-9A79-42C39D902293","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"bd4d77cfd2994ffb436130de1bacfbedf3be68b0","datavalue":{"value":"W2148659537","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5255817$3FAC81B9-6CCC-49B9-A8F3-7807670A19EE","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Greedy packet scheduling on shortest paths (preliminary version)","badges":[]}}}}}