{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:J2NMFDMDCHL5PD2PMX46ZWOPFV","short_pith_number":"pith:J2NMFDMD","schema_version":"1.0","canonical_sha256":"4e9ac28d8311d7d78f4f65f9ecd9cf2d48e3b4f956881ab770a649610cb1e09f","source":{"kind":"arxiv","id":"1809.00152","version":1},"attestation_state":"computed","paper":{"title":"Attack Tolerance of Link Prediction Algorithms: How to Hide Your Relations in a Social Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.SI","authors_text":"Esteban Moro, Kai Zhou, Marcin Waniek, Talal Rahwan, Tomasz P. Michalak, Yevgeniy Vorobeychik","submitted_at":"2018-09-01T11:01:24Z","abstract_excerpt":"Link prediction is one of the fundamental research problems in network analysis. Intuitively, it involves identifying the edges that are most likely to be added to a given network, or the edges that appear to be missing from the network when in fact they are present. Various algorithms have been proposed to solve this problem over the past decades. For all their benefits, such algorithms raise serious privacy concerns, as they could be used to expose a connection between two individuals who wish to keep their relationship private. With this in mind, we investigate the ability of such individua"},"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":"1809.00152","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-09-01T11:01:24Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"27cf28c4156c286f0bda48b7237c2c90de9c2f0a8d9b11fd527a224c37d64bd6","abstract_canon_sha256":"6e930d8fe89b50c296f5e2fd76a739be501a55db79b14012ab7ecfffaa2fc4ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:19.934021Z","signature_b64":"ici+wQAh+EIJ4eiUY/cZxh6gFrA8VEkwkp3kjf4o+gQYg3Zuzoa+IfoQR0hUWdIeGxeR6Rx9lyUs7sYzM7wjAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e9ac28d8311d7d78f4f65f9ecd9cf2d48e3b4f956881ab770a649610cb1e09f","last_reissued_at":"2026-05-18T00:06:19.933566Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:19.933566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Attack Tolerance of Link Prediction Algorithms: How to Hide Your Relations in a Social Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.SI","authors_text":"Esteban Moro, Kai Zhou, Marcin Waniek, Talal Rahwan, Tomasz P. Michalak, Yevgeniy Vorobeychik","submitted_at":"2018-09-01T11:01:24Z","abstract_excerpt":"Link prediction is one of the fundamental research problems in network analysis. Intuitively, it involves identifying the edges that are most likely to be added to a given network, or the edges that appear to be missing from the network when in fact they are present. Various algorithms have been proposed to solve this problem over the past decades. For all their benefits, such algorithms raise serious privacy concerns, as they could be used to expose a connection between two individuals who wish to keep their relationship private. With this in mind, we investigate the ability of such individua"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00152","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":"1809.00152","created_at":"2026-05-18T00:06:19.933635+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.00152v1","created_at":"2026-05-18T00:06:19.933635+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00152","created_at":"2026-05-18T00:06:19.933635+00:00"},{"alias_kind":"pith_short_12","alias_value":"J2NMFDMDCHL5","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"J2NMFDMDCHL5PD2P","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"J2NMFDMD","created_at":"2026-05-18T12:32:31.084164+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/J2NMFDMDCHL5PD2PMX46ZWOPFV","json":"https://pith.science/pith/J2NMFDMDCHL5PD2PMX46ZWOPFV.json","graph_json":"https://pith.science/api/pith-number/J2NMFDMDCHL5PD2PMX46ZWOPFV/graph.json","events_json":"https://pith.science/api/pith-number/J2NMFDMDCHL5PD2PMX46ZWOPFV/events.json","paper":"https://pith.science/paper/J2NMFDMD"},"agent_actions":{"view_html":"https://pith.science/pith/J2NMFDMDCHL5PD2PMX46ZWOPFV","download_json":"https://pith.science/pith/J2NMFDMDCHL5PD2PMX46ZWOPFV.json","view_paper":"https://pith.science/paper/J2NMFDMD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.00152&json=true","fetch_graph":"https://pith.science/api/pith-number/J2NMFDMDCHL5PD2PMX46ZWOPFV/graph.json","fetch_events":"https://pith.science/api/pith-number/J2NMFDMDCHL5PD2PMX46ZWOPFV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J2NMFDMDCHL5PD2PMX46ZWOPFV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J2NMFDMDCHL5PD2PMX46ZWOPFV/action/storage_attestation","attest_author":"https://pith.science/pith/J2NMFDMDCHL5PD2PMX46ZWOPFV/action/author_attestation","sign_citation":"https://pith.science/pith/J2NMFDMDCHL5PD2PMX46ZWOPFV/action/citation_signature","submit_replication":"https://pith.science/pith/J2NMFDMDCHL5PD2PMX46ZWOPFV/action/replication_record"}},"created_at":"2026-05-18T00:06:19.933635+00:00","updated_at":"2026-05-18T00:06:19.933635+00:00"}