One way to solve a problem like this is to use discrete mathematics, such as finite differencing methods.
In this case the best we can do with 6 data points is a 5th-order equation for the derivative. The form of the equation is
df(i) = A*f(i-4) + B*f(i-3) + C*f(i-2) + L*f(i-1) + M*f(i) + N*f(i+1),
where df(i) is the 1st derivative of the function at point i, f(i) is the value of the function at point i and {A,B,...,N} are weighting coefficients to give the desired degree of accuracy (these are found through matching Taylor expansions to find a system of constraint equations, and then solving that system).
Many people here have been using a 2nd-order centered differencing scheme (whether they knew it or not

), where A=B=C=M=0, N=-L=1/(2*h) and h is the point spacing (in this problem, h=3 days). Then,
df(12) = (f(15) - f(9))/(2*3) + O(h^2) = -1/2 + O(h^2)
A higher-order scheme has A = 1/(20*h), B = -1/(3*h), C = 1/h, L = -2/h, M = 13/(12*h) and N = 1/(5*h).
This scheme gives df(12) = -13/30 + O(h^5), and is 5th-order accurate.
An nth-order accurate scheme just means that the derivative of a function of degree n or less will be solved exactly.