When is insertion into a singly linked list truly O(1)?

When is insertion into a singly linked list truly O(1)?

1. Whenever the list is unsorted
2. When the insertion index is near the middle
3. When the required predecessor node is already known
4. When the inserted value is small