remove note

www/programming.html

@@ -77,8 +77,6 @@ <h3>Linked Documents</h3>
 For example, the path <code>/jiak/B1/K1/_,T2,0/B3,_,1</code> would start at the document found at <code>B1/K1</code>, find the set (which I will call <code>S2</code>) of documents which are linked from that starting document, in any bucket, and with link tags matching <code>T2</code>.  All documents linked from any document in <code>S2</code> and matching the bucket filter <code>B3</code> will be found, and this final set will be produced as the return body for the request.
 </p><p>
 As all of the link-walking is done server-side and via a mapreduce computation with locality to the relevant objects, this operation is much more efficient than fetching all of the intermediate documents and finding/following the links on the client.
-</p><p>
-(more documentation on link-walking shall be forthcoming soon)
 </p><p>
 		</div>
 		<div id="right">