{"entities":{"Q4573551":{"pageid":6603140,"ns":120,"title":"Item:Q4573551","lastrevid":82090448,"modified":"2026-05-06T20:04:43Z","type":"item","id":"Q4573551","labels":{"en":{"language":"en","value":"Achieving the Maximum Sum Rate Using D.C. Programming in Cellular Networks"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6906221"}},"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":"Q4573551$721B996F-D738-475C-9AD3-8F1614547AD9","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"34249ece34199e454b288a4c11ed67badab49717","datavalue":{"value":{"text":"Achieving the Maximum Sum Rate Using D.C. Programming in Cellular Networks","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q4573551$A0A07491-E8AF-4661-A487-8B5DF8981CE0","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"fdf380389447e2c7121847cd47cc32601553b690","datavalue":{"value":"1393.94004","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4573551$8D009AF9-AEF4-4100-9F80-27BECEBD900F","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"7593b16bbd6706c611fed6b4be44d920b867bc72","datavalue":{"value":"10.1109/TSP.2011.2177824","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4573551$7EE3070B-AD30-421E-ABB1-2A89FD8A9DEB","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"c4b67b1d1217daac08b8b554f138d93e19667597","datavalue":{"value":{"entity-type":"item","numeric-id":4573550,"id":"Q4573550"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4573551$348283A6-3BEF-4271-A75C-70E1063A4A01","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"c0237a693de27a991437eda5f290b62a24c95c62","datavalue":{"value":{"entity-type":"item","numeric-id":2106490,"id":"Q2106490"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4573551$AB323BA6-B785-4048-9F2B-4F369DB9ED80","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"39346dfbe0bcea35dbae204dc5864c494831351b","datavalue":{"value":{"entity-type":"item","numeric-id":63219,"id":"Q63219"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4573551$30B63295-6497-4790-A365-3AD70AB35FA6","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"595170a4b875a61e7a2746d3d821c86b24ad02ad","datavalue":{"value":{"time":"+2018-07-18T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q4573551$7DAFBA96-A93E-4A7D-AA2D-BA5849D9077D","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"99e75c38935b147cca2a0eac1e86993c645e76a5","datavalue":{"value":"94A05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4573551$129C7D2C-5B3D-498C-8839-50278F3DA86B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed10a41ec587cb61dc683f25ef4b3e827c7fee2f","datavalue":{"value":"90C26","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4573551$276BED72-BA5B-4195-918F-291BEFF58603","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"ee5fb1fff44c9994ec62aeed83d33121f0e87773","datavalue":{"value":"6906221","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4573551$B59786F1-6768-4E42-A152-67BCC2C9F863","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":"Q4573551$53C8FE2B-43B8-4270-B1DA-099D6C9137B5","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"058dc34976ed5b3c584a012967fa259df693e334","datavalue":{"value":"https://doi.org/10.1109/tsp.2011.2177824","type":"string"},"datatype":"url"},"type":"statement","id":"Q4573551$F19ED12B-43E5-488D-A2E7-D56A0F87233C","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"31abb4fab410828fb2cc9f76f2cabf8cc2820c1e","datavalue":{"value":"W2069136968","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4573551$6ABBD33C-6644-4DA9-BA5C-F7EDC083624D","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Achieving the Maximum Sum Rate Using D.C. Programming in Cellular Networks","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Achieving_the_Maximum_Sum_Rate_Using_D.C._Programming_in_Cellular_Networks"}}}}}