| Literature DB >> 26984123 |
Edward W Legg1, Ljerka Ostojić2, Nicola S Clayton2.
Abstract
A fundamental question about the complexity of corvid social cognition is whether behaviours exhibited when caching in front of potential pilferers represent specific attempts to prevent cache loss (cache protection hypothesis) or whether they are by-products of other behaviours (by-product hypothesis). Here, we demonstrate that Eurasian jays preferentially cache at a distance when observed by conspecifics. This preference for a 'far' location could be either a by-product of a general preference for caching at that specific location regardless of the risk of cache loss or a by-product of a general preference to be far away from conspecifics due to low intra-species tolerance. Critically, we found that neither by-product account explains the jays' behaviour: the preference for the 'far' location was not shown when caching in private or when eating in front of a conspecific. In line with the cache protection hypothesis we found that jays preferred the distant location only when caching in front of a conspecific. Thus, it seems likely that for Eurasian jays, caching at a distance from an observer is a specific cache protection strategy.Entities:
Keywords: Cache protection; Caching; Corvids; Eurasian jays; Social cognition
Mesh:
Year: 2016 PMID: 26984123 PMCID: PMC4891366 DOI: 10.1007/s10071-016-0972-7
Source DB: PubMed Journal: Anim Cogn ISSN: 1435-9448 Impact factor: 3.084
Fig. 1The four testing compartments. ‘X’ denotes the location of the caching trays in the Caching Experiment and of the bowls of powdered peanuts in the Eating-Only Experiment. The circle marks the location of the bowl of peanuts during caching sessions and of the novel caching tray during retrieval sessions
Fig. 2The proportion of i caches/food eaten and ii time spent in the ‘far’ compartment. White bars denote the private condition and grey bars the observed condition. The boxes show the median and interquartile range, and the whiskers represent the maximum and minimum values