{"entities":{"Q5729615":{"pageid":7759169,"ns":120,"title":"Item:Q5729615","lastrevid":92845544,"modified":"2026-06-05T02:54:03Z","type":"item","id":"Q5729615","labels":{"en":{"language":"en","value":"AN ALGORITHM FOR CONVEX PROGRAMMING"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3193276"}},"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":"Q5729615$FA08AC0B-DCF1-41E1-AC43-6A1011F271E0","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"d96302d0373468b04efd73a6210628e6ff449558","datavalue":{"value":{"text":"AN ALGORITHM FOR CONVEX PROGRAMMING","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5729615$C85CE110-411A-4B78-A8E9-F2F7DA0551C2","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"003a811692a35f4e99bb40ae98b9915b4708676a","datavalue":{"value":"0118.35204","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5729615$751C1CE6-E5E0-4C70-B668-DD8A5B2A3755","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"985708fbe84339ad82c764b79624b364b77d08de","datavalue":{"value":{"entity-type":"item","numeric-id":216353,"id":"Q216353"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5729615$14DFAFF1-E26A-415B-A026-3B9FE4517C31","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"a8dc6a9c9da912b42a435ca00aa6837819eacb75","datavalue":{"value":{"entity-type":"item","numeric-id":139911,"id":"Q139911"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5729615$6845B124-A931-457D-A5B0-93704806EF1C","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"eb2ff0c8850243f6c91f9deeec455d393bf560c2","datavalue":{"value":{"time":"+1963-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":"Q5729615$9EFE5351-4A1C-4F8E-B69A-19069B96D1FE","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"ba24f154aac11ed150699dcc126ad454af544bd9","datavalue":{"value":"3193276","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5729615$96053566-0EFF-41DC-9263-635A7D48A3FD","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"013a573a10a65db40cc78020f718d30d0fd6eed2","datavalue":{"value":"applications of probability theory and statistics","type":"string"},"datatype":"string"},"type":"statement","id":"Q5729615$E02DC874-3A12-48C0-85D6-CCE2E6827B9D","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":"Q5729615$4D16324F-75F2-48EB-B2F5-088C1E4FB53C","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"7a4c68810883c29842721c133646ba3029fe6051","datavalue":{"value":"10.1111/J.1467-842X.1963.TB00133.X","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5729615$499782E8-50CB-401F-B763-99A4EC575A87","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"AN ALGORITHM FOR CONVEX PROGRAMMING","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/AN_ALGORITHM_FOR_CONVEX_PROGRAMMING"}}}}}