{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:SIBMEWO54CJFUKZKETAPGYJGIS","short_pith_number":"pith:SIBMEWO5","canonical_record":{"source":{"id":"2110.10347","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2021-10-20T02:44:58Z","cross_cats_sorted":[],"title_canon_sha256":"febde0f97d0366bc85ba6b2e54f7ca11353a24ad0f4d01af2d66bdd7a92dbe09","abstract_canon_sha256":"4ec2d4acdec70da8b887d213cb0847191d5f4e70cae6f1eb9a5098083577d911"},"schema_version":"1.0"},"canonical_sha256":"9202c259dde0925a2b2a24c0f3612644b8166e9e9a170dfa3b38e66d4fcd6685","source":{"kind":"arxiv","id":"2110.10347","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.10347","created_at":"2026-07-05T03:24:16Z"},{"alias_kind":"arxiv_version","alias_value":"2110.10347v1","created_at":"2026-07-05T03:24:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.10347","created_at":"2026-07-05T03:24:16Z"},{"alias_kind":"pith_short_12","alias_value":"SIBMEWO54CJF","created_at":"2026-07-05T03:24:16Z"},{"alias_kind":"pith_short_16","alias_value":"SIBMEWO54CJFUKZK","created_at":"2026-07-05T03:24:16Z"},{"alias_kind":"pith_short_8","alias_value":"SIBMEWO5","created_at":"2026-07-05T03:24:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:SIBMEWO54CJFUKZKETAPGYJGIS","target":"record","payload":{"canonical_record":{"source":{"id":"2110.10347","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2021-10-20T02:44:58Z","cross_cats_sorted":[],"title_canon_sha256":"febde0f97d0366bc85ba6b2e54f7ca11353a24ad0f4d01af2d66bdd7a92dbe09","abstract_canon_sha256":"4ec2d4acdec70da8b887d213cb0847191d5f4e70cae6f1eb9a5098083577d911"},"schema_version":"1.0"},"canonical_sha256":"9202c259dde0925a2b2a24c0f3612644b8166e9e9a170dfa3b38e66d4fcd6685","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:24:16.200524Z","signature_b64":"A4IQT2/2WJe8FaDBg/w7APB5oubB7Dd5xF2pAC+Dyr03mixnJy3NNiQHcs/w+5TXFHNFpT3kdCSI1nCQF9jjCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9202c259dde0925a2b2a24c0f3612644b8166e9e9a170dfa3b38e66d4fcd6685","last_reissued_at":"2026-07-05T03:24:16.200181Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:24:16.200181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2110.10347","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-07-05T03:24:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kxOKr0+iwz8EPW5Q3g0aHZtXcswv+tEUtueUT3CoMqjn1kRhcLWwamZBPzqMT1iqC1VOGv+AYvMguqze3ES1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-25T17:01:07.095333Z"},"content_sha256":"1a3e9c7883f0c79fcb2db69e31a3277def6939e81aeb809ca033ab3b3a948bc7","schema_version":"1.0","event_id":"sha256:1a3e9c7883f0c79fcb2db69e31a3277def6939e81aeb809ca033ab3b3a948bc7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:SIBMEWO54CJFUKZKETAPGYJGIS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Stage Network Embedding for Exploring Heterogeneous Edges","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Fanghua Ye, Hai Jin, Hong Huang, Xing Xie, Xuanhua Shi, Yu Song","submitted_at":"2021-10-20T02:44:58Z","abstract_excerpt":"The relationships between objects in a network are typically diverse and complex, leading to the heterogeneous edges with different semantic information. In this paper, we focus on exploring the heterogeneous edges for network representation learning. By considering each relationship as a view that depicts a specific type of proximity between nodes, we propose a multi-stage non-negative matrix factorization (MNMF) model, committed to utilizing abundant information in multiple views to learn robust network representations. In fact, most existing network embedding methods are closely related to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.10347","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2110.10347/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:24:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aCyj+uJqZdnqM8w7cFfz5LTmK1/LSLhXzGOXoynEwDYCSRKhsvJAtQG9epY6d4JNLe/kV2Fp0aoLQlGE8tokCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-25T17:01:07.095722Z"},"content_sha256":"7ad2adff38c8444516121b2dc42dcdd742a0ec8121d2451a68f0074fa0bc7bfb","schema_version":"1.0","event_id":"sha256:7ad2adff38c8444516121b2dc42dcdd742a0ec8121d2451a68f0074fa0bc7bfb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SIBMEWO54CJFUKZKETAPGYJGIS/bundle.json","state_url":"https://pith.science/pith/SIBMEWO54CJFUKZKETAPGYJGIS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SIBMEWO54CJFUKZKETAPGYJGIS/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-07-25T17:01:07Z","links":{"resolver":"https://pith.science/pith/SIBMEWO54CJFUKZKETAPGYJGIS","bundle":"https://pith.science/pith/SIBMEWO54CJFUKZKETAPGYJGIS/bundle.json","state":"https://pith.science/pith/SIBMEWO54CJFUKZKETAPGYJGIS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SIBMEWO54CJFUKZKETAPGYJGIS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:SIBMEWO54CJFUKZKETAPGYJGIS","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":"4ec2d4acdec70da8b887d213cb0847191d5f4e70cae6f1eb9a5098083577d911","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2021-10-20T02:44:58Z","title_canon_sha256":"febde0f97d0366bc85ba6b2e54f7ca11353a24ad0f4d01af2d66bdd7a92dbe09"},"schema_version":"1.0","source":{"id":"2110.10347","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.10347","created_at":"2026-07-05T03:24:16Z"},{"alias_kind":"arxiv_version","alias_value":"2110.10347v1","created_at":"2026-07-05T03:24:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.10347","created_at":"2026-07-05T03:24:16Z"},{"alias_kind":"pith_short_12","alias_value":"SIBMEWO54CJF","created_at":"2026-07-05T03:24:16Z"},{"alias_kind":"pith_short_16","alias_value":"SIBMEWO54CJFUKZK","created_at":"2026-07-05T03:24:16Z"},{"alias_kind":"pith_short_8","alias_value":"SIBMEWO5","created_at":"2026-07-05T03:24:16Z"}],"graph_snapshots":[{"event_id":"sha256:7ad2adff38c8444516121b2dc42dcdd742a0ec8121d2451a68f0074fa0bc7bfb","target":"graph","created_at":"2026-07-05T03:24:16Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2110.10347/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The relationships between objects in a network are typically diverse and complex, leading to the heterogeneous edges with different semantic information. In this paper, we focus on exploring the heterogeneous edges for network representation learning. By considering each relationship as a view that depicts a specific type of proximity between nodes, we propose a multi-stage non-negative matrix factorization (MNMF) model, committed to utilizing abundant information in multiple views to learn robust network representations. In fact, most existing network embedding methods are closely related to ","authors_text":"Fanghua Ye, Hai Jin, Hong Huang, Xing Xie, Xuanhua Shi, Yu Song","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2021-10-20T02:44:58Z","title":"Multi-Stage Network Embedding for Exploring Heterogeneous Edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.10347","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:1a3e9c7883f0c79fcb2db69e31a3277def6939e81aeb809ca033ab3b3a948bc7","target":"record","created_at":"2026-07-05T03:24:16Z","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":"4ec2d4acdec70da8b887d213cb0847191d5f4e70cae6f1eb9a5098083577d911","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2021-10-20T02:44:58Z","title_canon_sha256":"febde0f97d0366bc85ba6b2e54f7ca11353a24ad0f4d01af2d66bdd7a92dbe09"},"schema_version":"1.0","source":{"id":"2110.10347","kind":"arxiv","version":1}},"canonical_sha256":"9202c259dde0925a2b2a24c0f3612644b8166e9e9a170dfa3b38e66d4fcd6685","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9202c259dde0925a2b2a24c0f3612644b8166e9e9a170dfa3b38e66d4fcd6685","first_computed_at":"2026-07-05T03:24:16.200181Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:24:16.200181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A4IQT2/2WJe8FaDBg/w7APB5oubB7Dd5xF2pAC+Dyr03mixnJy3NNiQHcs/w+5TXFHNFpT3kdCSI1nCQF9jjCw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:24:16.200524Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.10347","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a3e9c7883f0c79fcb2db69e31a3277def6939e81aeb809ca033ab3b3a948bc7","sha256:7ad2adff38c8444516121b2dc42dcdd742a0ec8121d2451a68f0074fa0bc7bfb"],"state_sha256":"cea94bf4d05b25c3df75a72d9efa63067f9e5bf889e6dc0b916b48f78c95c1d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3KYwOD7sB6+R/3kACHCuGadh82W3QC74+72mZLwm/yMgxFBkvTNC4yt07yH0HZ4DlO7/TwHR2s/XrYge2BgQBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-25T17:01:07.098642Z","bundle_sha256":"f745d06bd6517cf0c34a66f9fce21a5761d0c4354831bfb63cb5c84135b1adfa"}}