{"generator":"GNU social 1.2.0-beta4","title":"Conversation","totalItems":1,"items":[{"actor":{"id":"https:\/\/mamot.fr\/users\/rfortunes","displayName":"RFortunes","status_net":{"avatarLinks":[{"url":"https:\/\/social.giorgiocomai.eu\/avatar\/1973-original-20181005080006.png","rel":"avatar","type":"image\/png","width":120,"height":120},{"url":"https:\/\/social.giorgiocomai.eu\/avatar\/1973-96-20181005084658.png","rel":"avatar","type":"image\/png","width":96,"height":96},{"url":"https:\/\/social.giorgiocomai.eu\/avatar\/1973-48-20181005084658.png","rel":"avatar","type":"image\/png","width":48,"height":48},{"url":"https:\/\/social.giorgiocomai.eu\/avatar\/1973-24-20181005084658.png","rel":"avatar","type":"image\/png","width":24,"height":24}],"profile_info":{"local_id":"1973"}},"image":{"url":"https:\/\/social.giorgiocomai.eu\/avatar\/1973-96-20181005084658.png","rel":"avatar","type":"image\/png","width":96,"height":96},"objectType":"person","summary":"A collection of fortunes from the R community. Bot built by @koantig@mamot.fr, from Achim Zeileis'  R package \"fortunes\". Nothing official. Updated twice a day.","url":"https:\/\/mamot.fr\/@rfortunes","portablecontacts_net":{"preferredUsername":"rfortunes","displayName":"RFortunes","note":"A collection of fortunes from the R community. Bot built by @koantig@mamot.fr, from Achim Zeileis'  R package \"fortunes\". Nothing official. Updated twice a day."}},"content":"<p>Your example requires all choices of 1541 out of 3000, which I would expect to take somewhere near age-of-the-universe seconds to compute. The code uses a clever nested computation due to Gail et al which will cut that time down to infinity\/10.<br \/>  -- Terry Therneau (on an example with exact computations in coxph)<br \/>     R-help (June 2016) <a href=\"https:\/\/mamot.fr\/tags\/rstats\" class=\"mention hashtag\" rel=\"tag\">#<span>Rstats<\/span><\/a><\/p>","generator":{"id":"tag:status.net,2009:notice-source:ostatus","objectType":"application","status_net":{"source_code":"ostatus"}},"id":"https:\/\/mamot.fr\/users\/rfortunes\/statuses\/100904258950702302","object":{"id":"https:\/\/mamot.fr\/users\/rfortunes\/statuses\/100904258950702302","objectType":"note","content":"<p>Your example requires all choices of 1541 out of 3000, which I would expect to take somewhere near age-of-the-universe seconds to compute. The code uses a clever nested computation due to Gail et al which will cut that time down to infinity\/10.<br \/>  -- Terry Therneau (on an example with exact computations in coxph)<br \/>     R-help (June 2016) <a href=\"https:\/\/mamot.fr\/tags\/rstats\" class=\"mention hashtag\" rel=\"tag\">#<span>Rstats<\/span><\/a><\/p>","url":"https:\/\/mamot.fr\/@rfortunes\/100904258950702302","status_net":{"notice_id":100286},"tags":[{"objectType":"http:\/\/activityschema.org\/object\/hashtag","displayName":"rstats"}]},"to":[{"objectType":"http:\/\/activitystrea.ms\/schema\/1.0\/collection","id":"http:\/\/activityschema.org\/collection\/public"}],"status_net":{"conversation":"tag:social.giorgiocomai.eu,2018-10-16:objectType=thread:nonce=3fc3c1737eb149ff","notice_info":{"local_id":"100286","source":"ostatus"}},"published":"2018-10-16T08:00:03+00:00","provider":{"objectType":"service","displayName":"social.giorgiocomai.eu","url":"http:\/\/social.giorgiocomai.eu\/"},"verb":"post","url":"https:\/\/mamot.fr\/@rfortunes\/100904258950702302"}],"links":[{"url":"https:\/\/social.giorgiocomai.eu\/conversation\/81152","rel":"alternate","type":"text\/html"}]}