{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UDACRVZETT2RHCACJNEINVYGMD","short_pith_number":"pith:UDACRVZE","schema_version":"1.0","canonical_sha256":"a0c028d7249cf51388024b4886d70660ce0bc701b57f803f53044ec4f15eed09","source":{"kind":"arxiv","id":"1609.01616","version":1},"attestation_state":"computed","paper":{"title":"Private Link Exchange over Social Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.SI","authors_text":"Abdessamad Imine, Hiep H. Nguyen, Michael Rusinowitch","submitted_at":"2016-09-06T15:45:18Z","abstract_excerpt":"Currently, most of the online social networks (OSN) keep their data secret and in centralized manner. Researchers are allowed to crawl the underlying social graphs (and data) but with limited rates, leading to only partial views of the true social graphs. To overcome this constraint, we may start from user perspective, the contributors of the OSNs. More precisely, if users cautiously collaborate with one another, they can use the very infrastructure of the OSNs to exchange noisy friend lists with their neighbors in several rounds. In the end, they can build local subgraphs, also called local v"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1609.01616","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-09-06T15:45:18Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"39cf2ba1bd3c64a951417a46cba80dd8ca05e8f0144f3202b51b896911ef2234","abstract_canon_sha256":"75c302b7e9c8ba7a2d96eb3607e60626744a5239991ccf9ccc21896eb6a77329"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:39.117276Z","signature_b64":"LsfUkBo3HWgOv4CIDIphnlEl5CYYhU+W7xHDGYgmI6lpTqU4kOubsT0HSk07kDv0VgNh/Rtl5iqLUGZMGT8jBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0c028d7249cf51388024b4886d70660ce0bc701b57f803f53044ec4f15eed09","last_reissued_at":"2026-05-18T01:05:39.116893Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:39.116893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Private Link Exchange over Social Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.SI","authors_text":"Abdessamad Imine, Hiep H. Nguyen, Michael Rusinowitch","submitted_at":"2016-09-06T15:45:18Z","abstract_excerpt":"Currently, most of the online social networks (OSN) keep their data secret and in centralized manner. Researchers are allowed to crawl the underlying social graphs (and data) but with limited rates, leading to only partial views of the true social graphs. To overcome this constraint, we may start from user perspective, the contributors of the OSNs. More precisely, if users cautiously collaborate with one another, they can use the very infrastructure of the OSNs to exchange noisy friend lists with their neighbors in several rounds. In the end, they can build local subgraphs, also called local v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.01616","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.01616","created_at":"2026-05-18T01:05:39.116951+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.01616v1","created_at":"2026-05-18T01:05:39.116951+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01616","created_at":"2026-05-18T01:05:39.116951+00:00"},{"alias_kind":"pith_short_12","alias_value":"UDACRVZETT2R","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UDACRVZETT2RHCAC","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UDACRVZE","created_at":"2026-05-18T12:30:46.583412+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UDACRVZETT2RHCACJNEINVYGMD","json":"https://pith.science/pith/UDACRVZETT2RHCACJNEINVYGMD.json","graph_json":"https://pith.science/api/pith-number/UDACRVZETT2RHCACJNEINVYGMD/graph.json","events_json":"https://pith.science/api/pith-number/UDACRVZETT2RHCACJNEINVYGMD/events.json","paper":"https://pith.science/paper/UDACRVZE"},"agent_actions":{"view_html":"https://pith.science/pith/UDACRVZETT2RHCACJNEINVYGMD","download_json":"https://pith.science/pith/UDACRVZETT2RHCACJNEINVYGMD.json","view_paper":"https://pith.science/paper/UDACRVZE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.01616&json=true","fetch_graph":"https://pith.science/api/pith-number/UDACRVZETT2RHCACJNEINVYGMD/graph.json","fetch_events":"https://pith.science/api/pith-number/UDACRVZETT2RHCACJNEINVYGMD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UDACRVZETT2RHCACJNEINVYGMD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UDACRVZETT2RHCACJNEINVYGMD/action/storage_attestation","attest_author":"https://pith.science/pith/UDACRVZETT2RHCACJNEINVYGMD/action/author_attestation","sign_citation":"https://pith.science/pith/UDACRVZETT2RHCACJNEINVYGMD/action/citation_signature","submit_replication":"https://pith.science/pith/UDACRVZETT2RHCACJNEINVYGMD/action/replication_record"}},"created_at":"2026-05-18T01:05:39.116951+00:00","updated_at":"2026-05-18T01:05:39.116951+00:00"}