{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4NVESZVJOWK5MNEKKP43OL6AOW","short_pith_number":"pith:4NVESZVJ","schema_version":"1.0","canonical_sha256":"e36a4966a97595d6348a53f9b72fc0758a7d4f0a25ac4f29c86e38d30f18989d","source":{"kind":"arxiv","id":"1902.03124","version":1},"attestation_state":"computed","paper":{"title":"Heterogeneous Edge Embeddings for Friend Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SI","authors_text":"Debdoot Mukherjee, Janu Verma, Srishti Gupta, Tanmoy Chakraborty","submitted_at":"2019-02-07T10:42:08Z","abstract_excerpt":"We propose a friend recommendation system (an application of link prediction) using edge embeddings on social networks. Most real-world social networks are multi-graphs, where different kinds of relationships (e.g. chat, friendship) are possible between a pair of users. Existing network embedding techniques do not leverage signals from different edge types and thus perform inadequately on link prediction in such networks. We propose a method to mine network representation that effectively exploits heterogeneity in multi-graphs. We evaluate our model on a real-world, active social network where"},"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":"1902.03124","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-02-07T10:42:08Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"d3c68062dbb0ecca46df48ebfca9afb484abc18380ef21d15e52be566ed7e5e2","abstract_canon_sha256":"1e19b124700d9181da87fdfce1d1034af4c7e6d082f328ebb1cfaef2cb72cf4b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:27.902668Z","signature_b64":"Dp7D0F0Dio1rUuoIEIIaYtP1oEj6q2laNqLiaHRIo7sg2MydAkUpC9ezF9HyM/712/iatJCdXV8hF/OlqxOQAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e36a4966a97595d6348a53f9b72fc0758a7d4f0a25ac4f29c86e38d30f18989d","last_reissued_at":"2026-05-17T23:54:27.902151Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:27.902151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Heterogeneous Edge Embeddings for Friend Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SI","authors_text":"Debdoot Mukherjee, Janu Verma, Srishti Gupta, Tanmoy Chakraborty","submitted_at":"2019-02-07T10:42:08Z","abstract_excerpt":"We propose a friend recommendation system (an application of link prediction) using edge embeddings on social networks. Most real-world social networks are multi-graphs, where different kinds of relationships (e.g. chat, friendship) are possible between a pair of users. Existing network embedding techniques do not leverage signals from different edge types and thus perform inadequately on link prediction in such networks. We propose a method to mine network representation that effectively exploits heterogeneity in multi-graphs. We evaluate our model on a real-world, active social network where"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03124","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":"1902.03124","created_at":"2026-05-17T23:54:27.902229+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.03124v1","created_at":"2026-05-17T23:54:27.902229+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03124","created_at":"2026-05-17T23:54:27.902229+00:00"},{"alias_kind":"pith_short_12","alias_value":"4NVESZVJOWK5","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"4NVESZVJOWK5MNEK","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"4NVESZVJ","created_at":"2026-05-18T12:33:10.108867+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/4NVESZVJOWK5MNEKKP43OL6AOW","json":"https://pith.science/pith/4NVESZVJOWK5MNEKKP43OL6AOW.json","graph_json":"https://pith.science/api/pith-number/4NVESZVJOWK5MNEKKP43OL6AOW/graph.json","events_json":"https://pith.science/api/pith-number/4NVESZVJOWK5MNEKKP43OL6AOW/events.json","paper":"https://pith.science/paper/4NVESZVJ"},"agent_actions":{"view_html":"https://pith.science/pith/4NVESZVJOWK5MNEKKP43OL6AOW","download_json":"https://pith.science/pith/4NVESZVJOWK5MNEKKP43OL6AOW.json","view_paper":"https://pith.science/paper/4NVESZVJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.03124&json=true","fetch_graph":"https://pith.science/api/pith-number/4NVESZVJOWK5MNEKKP43OL6AOW/graph.json","fetch_events":"https://pith.science/api/pith-number/4NVESZVJOWK5MNEKKP43OL6AOW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4NVESZVJOWK5MNEKKP43OL6AOW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4NVESZVJOWK5MNEKKP43OL6AOW/action/storage_attestation","attest_author":"https://pith.science/pith/4NVESZVJOWK5MNEKKP43OL6AOW/action/author_attestation","sign_citation":"https://pith.science/pith/4NVESZVJOWK5MNEKKP43OL6AOW/action/citation_signature","submit_replication":"https://pith.science/pith/4NVESZVJOWK5MNEKKP43OL6AOW/action/replication_record"}},"created_at":"2026-05-17T23:54:27.902229+00:00","updated_at":"2026-05-17T23:54:27.902229+00:00"}