Abstract: In one embodiment, a method includes receiving, from a client system of a first user of an online social network, an unique identifier associated with a second user of the online social network, the unique identifier being sent responsive to a communication between the second user and the first user, accessing a social graph including first and second nodes corresponding to the first and second users, respectively, identifying the second user based on the unique identifier, retrieving profile information associated with the second user and a privacy setting associated with the second user, determining whether the information is visible to the first user based on the privacy setting and a degree of separation in the social graph between the first node and the second node, and sending, to the client system, the profile information that is visible to the first user for display in association with the communication.

Abstract: Techniques for prompting communication among members of a social network are described. A social server may include an interaction detection component configured to detect a user interaction of a first user with an information unit. An information component of the social server may be configured to store an association between the first user and the information unit. A correlation component of the social server may be configured to correlate the first user with one or more other users based upon one or more stored associations. A messaging server may include a display component and a messaging component. The display component may be configured to provide a prompt to the first user suggesting that the first user initiate a communication with the one or more other users, the prompt based at least in part on the correlation. The messaging component may be configured to initiate a communication with the one or more other users in response to a selection of the prompt by the first user.

Abstract: When rich data is tunneled, its associated link identified by a primary data reference is changed by swapping primary references of original data with changed data. Thus, without duplicating the rich data, it is now associated with the changed data, preserving it in constant time. The primary references can include, but are not limited to, names and/or other item identifications. This technique allows preservation of rich data to occur without burdening processing and/or time constraints based on the size and/or number of rich data elements. The technique also allows disparate applications and/or systems to maintain data integrity even when rich data is not expected for a given application and/or system. Since the rich data follows a primary reference, awareness of the rich data is not required for it to be properly handled, ensuring its integrity.

Abstract: When rich data is tunneled, its associated link identified by a primary data reference is changed by swapping primary references of original data with changed data. Thus, without duplicating the rich data, it is now associated with the changed data, preserving it in constant time. The primary references can include, but are not limited to, names and/or other item identifications. This technique allows preservation of rich data to occur without burdening processing and/or time constraints based on the size and/or number of rich data elements. The technique also allows disparate applications and/or systems to maintain data integrity even when rich data is not expected for a given application and/or system. Since the rich data follows a primary reference, awareness of the rich data is not required for it to be properly handled, ensuring its integrity.