{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:KFN325BTNA44F6DZZKG7XHQ5ZD","short_pith_number":"pith:KFN325BT","schema_version":"1.0","canonical_sha256":"515bbd74336839c2f879ca8dfb9e1dc8ca4d73bb90c2d837bb18339ac9ffe54b","source":{"kind":"arxiv","id":"1307.1690","version":2},"attestation_state":"computed","paper":{"title":"An efficient reconciliation algorithm for social networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Nitish Korula, Silvio Lattanzi","submitted_at":"2013-07-05T18:57:59Z","abstract_excerpt":"People today typically use multiple online social networks (Facebook, Twitter, Google+, LinkedIn, etc.). Each online network represents a subset of their \"real\" ego-networks. An interesting and challenging problem is to reconcile these online networks, that is, to identify all the accounts belonging to the same individual. Besides providing a richer understanding of social dynamics, the problem has a number of practical applications. At first sight, this problem appears algorithmically challenging. Fortunately, a small fraction of individuals explicitly link their accounts across multiple netw"},"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":"1307.1690","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-05T18:57:59Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"e6206873d6f0000bcaca2065fb41a6b1325f0a6ddbdf43373374d68ab7fd3329","abstract_canon_sha256":"9d1a1d2d347ec04a4f7ab6b6ea40545cd93247d07b582193317e23f51041e3f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:42.775100Z","signature_b64":"9jaPyjW6lrnjIwQjLaUIc8/C6FNnz8H+S/fUCodiHG2m/QyPoxIhRNz21w9s6oUNcF5kxmokGSYshe16iKRmCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"515bbd74336839c2f879ca8dfb9e1dc8ca4d73bb90c2d837bb18339ac9ffe54b","last_reissued_at":"2026-05-18T03:06:42.774515Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:42.774515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An efficient reconciliation algorithm for social networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Nitish Korula, Silvio Lattanzi","submitted_at":"2013-07-05T18:57:59Z","abstract_excerpt":"People today typically use multiple online social networks (Facebook, Twitter, Google+, LinkedIn, etc.). Each online network represents a subset of their \"real\" ego-networks. An interesting and challenging problem is to reconcile these online networks, that is, to identify all the accounts belonging to the same individual. Besides providing a richer understanding of social dynamics, the problem has a number of practical applications. At first sight, this problem appears algorithmically challenging. Fortunately, a small fraction of individuals explicitly link their accounts across multiple netw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1690","kind":"arxiv","version":2},"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":"1307.1690","created_at":"2026-05-18T03:06:42.774617+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.1690v2","created_at":"2026-05-18T03:06:42.774617+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1690","created_at":"2026-05-18T03:06:42.774617+00:00"},{"alias_kind":"pith_short_12","alias_value":"KFN325BTNA44","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"KFN325BTNA44F6DZ","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"KFN325BT","created_at":"2026-05-18T12:27:49.015174+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/KFN325BTNA44F6DZZKG7XHQ5ZD","json":"https://pith.science/pith/KFN325BTNA44F6DZZKG7XHQ5ZD.json","graph_json":"https://pith.science/api/pith-number/KFN325BTNA44F6DZZKG7XHQ5ZD/graph.json","events_json":"https://pith.science/api/pith-number/KFN325BTNA44F6DZZKG7XHQ5ZD/events.json","paper":"https://pith.science/paper/KFN325BT"},"agent_actions":{"view_html":"https://pith.science/pith/KFN325BTNA44F6DZZKG7XHQ5ZD","download_json":"https://pith.science/pith/KFN325BTNA44F6DZZKG7XHQ5ZD.json","view_paper":"https://pith.science/paper/KFN325BT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.1690&json=true","fetch_graph":"https://pith.science/api/pith-number/KFN325BTNA44F6DZZKG7XHQ5ZD/graph.json","fetch_events":"https://pith.science/api/pith-number/KFN325BTNA44F6DZZKG7XHQ5ZD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KFN325BTNA44F6DZZKG7XHQ5ZD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KFN325BTNA44F6DZZKG7XHQ5ZD/action/storage_attestation","attest_author":"https://pith.science/pith/KFN325BTNA44F6DZZKG7XHQ5ZD/action/author_attestation","sign_citation":"https://pith.science/pith/KFN325BTNA44F6DZZKG7XHQ5ZD/action/citation_signature","submit_replication":"https://pith.science/pith/KFN325BTNA44F6DZZKG7XHQ5ZD/action/replication_record"}},"created_at":"2026-05-18T03:06:42.774617+00:00","updated_at":"2026-05-18T03:06:42.774617+00:00"}