{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4NVESZVJOWK5MNEKKP43OL6AOW","short_pith_number":"pith:4NVESZVJ","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"},"canonical_sha256":"e36a4966a97595d6348a53f9b72fc0758a7d4f0a25ac4f29c86e38d30f18989d","source":{"kind":"arxiv","id":"1902.03124","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03124","created_at":"2026-05-17T23:54:27Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03124v1","created_at":"2026-05-17T23:54:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03124","created_at":"2026-05-17T23:54:27Z"},{"alias_kind":"pith_short_12","alias_value":"4NVESZVJOWK5","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4NVESZVJOWK5MNEK","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4NVESZVJ","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4NVESZVJOWK5MNEKKP43OL6AOW","target":"record","payload":{"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"},"canonical_sha256":"e36a4966a97595d6348a53f9b72fc0758a7d4f0a25ac4f29c86e38d30f18989d","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"},"source_kind":"arxiv","source_id":"1902.03124","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:54:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rYcGyiqF6eWq61VBWk9mdQgUYyNE7dyl+BkLE3xXMXKSEvOPnbBIDdhMatqp2w+rHSqDurFFssh85jYYt4GMAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T12:43:47.865855Z"},"content_sha256":"8d440dab1570956629448ef871145504baefbad966d87e7644f49545618ca821","schema_version":"1.0","event_id":"sha256:8d440dab1570956629448ef871145504baefbad966d87e7644f49545618ca821"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4NVESZVJOWK5MNEKKP43OL6AOW","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:54:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"917H271nK2gCM5DdwEy7IKez/ndyNh8AMc2Z1VcvfLAxw5nAGfsbx8jgpppuy8Ay4xEgnboyi+A43Aa6eb/lCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T12:43:47.866209Z"},"content_sha256":"948c96f32a167d08d17b5622bc27e135f1f582331b7030dbb200fb00c384ec20","schema_version":"1.0","event_id":"sha256:948c96f32a167d08d17b5622bc27e135f1f582331b7030dbb200fb00c384ec20"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4NVESZVJOWK5MNEKKP43OL6AOW/bundle.json","state_url":"https://pith.science/pith/4NVESZVJOWK5MNEKKP43OL6AOW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4NVESZVJOWK5MNEKKP43OL6AOW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T12:43:47Z","links":{"resolver":"https://pith.science/pith/4NVESZVJOWK5MNEKKP43OL6AOW","bundle":"https://pith.science/pith/4NVESZVJOWK5MNEKKP43OL6AOW/bundle.json","state":"https://pith.science/pith/4NVESZVJOWK5MNEKKP43OL6AOW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4NVESZVJOWK5MNEKKP43OL6AOW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4NVESZVJOWK5MNEKKP43OL6AOW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1e19b124700d9181da87fdfce1d1034af4c7e6d082f328ebb1cfaef2cb72cf4b","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-02-07T10:42:08Z","title_canon_sha256":"d3c68062dbb0ecca46df48ebfca9afb484abc18380ef21d15e52be566ed7e5e2"},"schema_version":"1.0","source":{"id":"1902.03124","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03124","created_at":"2026-05-17T23:54:27Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03124v1","created_at":"2026-05-17T23:54:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03124","created_at":"2026-05-17T23:54:27Z"},{"alias_kind":"pith_short_12","alias_value":"4NVESZVJOWK5","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4NVESZVJOWK5MNEK","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4NVESZVJ","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:948c96f32a167d08d17b5622bc27e135f1f582331b7030dbb200fb00c384ec20","target":"graph","created_at":"2026-05-17T23:54:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Debdoot Mukherjee, Janu Verma, Srishti Gupta, Tanmoy Chakraborty","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-02-07T10:42:08Z","title":"Heterogeneous Edge Embeddings for Friend Recommendation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03124","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8d440dab1570956629448ef871145504baefbad966d87e7644f49545618ca821","target":"record","created_at":"2026-05-17T23:54:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1e19b124700d9181da87fdfce1d1034af4c7e6d082f328ebb1cfaef2cb72cf4b","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-02-07T10:42:08Z","title_canon_sha256":"d3c68062dbb0ecca46df48ebfca9afb484abc18380ef21d15e52be566ed7e5e2"},"schema_version":"1.0","source":{"id":"1902.03124","kind":"arxiv","version":1}},"canonical_sha256":"e36a4966a97595d6348a53f9b72fc0758a7d4f0a25ac4f29c86e38d30f18989d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e36a4966a97595d6348a53f9b72fc0758a7d4f0a25ac4f29c86e38d30f18989d","first_computed_at":"2026-05-17T23:54:27.902151Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:27.902151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dp7D0F0Dio1rUuoIEIIaYtP1oEj6q2laNqLiaHRIo7sg2MydAkUpC9ezF9HyM/712/iatJCdXV8hF/OlqxOQAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:27.902668Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.03124","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d440dab1570956629448ef871145504baefbad966d87e7644f49545618ca821","sha256:948c96f32a167d08d17b5622bc27e135f1f582331b7030dbb200fb00c384ec20"],"state_sha256":"b8088ff2b3d0ae58c7a280f3a64673df457d825e0be0c3f4411882a91c1a4b44"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UW77fC9PVKhl3i+KeM3ME2UYfFbiIFBr124ym3tOMGo3DorMtJBxuk9VH5yms4+n9RS9tIf7wImQvL8i0p/dAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T12:43:47.868222Z","bundle_sha256":"8714f079e2e64b36c222db370c43fb75d9fab5fb965427cce8d39f7aaa11915b"}}