{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MOJ5KNCVKSQELVLLQW4KWGQIOP","short_pith_number":"pith:MOJ5KNCV","canonical_record":{"source":{"id":"1711.04094","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-11-11T08:07:23Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"5b564ffa71b7c1885041b312f8abcc36f262aa6b0175efd1f052924fd7d9c089","abstract_canon_sha256":"ff8a04014245adf6e1f4f7c848ba8869fbe89db121d29e310ae05b77d8228f38"},"schema_version":"1.0"},"canonical_sha256":"6393d5345554a045d56b85b8ab1a0873d26e8f6c2b3e0fb22e75c967c3a9a5d4","source":{"kind":"arxiv","id":"1711.04094","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04094","created_at":"2026-05-18T00:22:02Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04094v2","created_at":"2026-05-18T00:22:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04094","created_at":"2026-05-18T00:22:02Z"},{"alias_kind":"pith_short_12","alias_value":"MOJ5KNCVKSQE","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MOJ5KNCVKSQELVLL","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MOJ5KNCV","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MOJ5KNCVKSQELVLLQW4KWGQIOP","target":"record","payload":{"canonical_record":{"source":{"id":"1711.04094","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-11-11T08:07:23Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"5b564ffa71b7c1885041b312f8abcc36f262aa6b0175efd1f052924fd7d9c089","abstract_canon_sha256":"ff8a04014245adf6e1f4f7c848ba8869fbe89db121d29e310ae05b77d8228f38"},"schema_version":"1.0"},"canonical_sha256":"6393d5345554a045d56b85b8ab1a0873d26e8f6c2b3e0fb22e75c967c3a9a5d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:02.669820Z","signature_b64":"Uz+DNwqqco9kmRzNOu7JZtbaADebmtIjP17+UalotAX58B+rCX/UK9nE8ZSTzl2UWyPieDaFyG1vNtPQVTz7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6393d5345554a045d56b85b8ab1a0873d26e8f6c2b3e0fb22e75c967c3a9a5d4","last_reissued_at":"2026-05-18T00:22:02.669174Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:02.669174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.04094","source_version":2,"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-18T00:22:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8rBvMYSGJwKBk+SAFoDGHray5kVxMbBu0Jvuv4shppA+qhf6+4V/eJ8blv3wlJxNVHhn/VwmwX9hY//m1nUwCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:45:01.747371Z"},"content_sha256":"415229899d07c54391f4b6d2eb844ada77fdb6d49b0e114eec8927f371bf961f","schema_version":"1.0","event_id":"sha256:415229899d07c54391f4b6d2eb844ada77fdb6d49b0e114eec8927f371bf961f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MOJ5KNCVKSQELVLLQW4KWGQIOP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enhancing Network Embedding with Auxiliary Information: An Explicit Matrix Factorization Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SI","authors_text":"Enhong Chen, Junliang Guo, Linli Xu, Xunpeng Huang","submitted_at":"2017-11-11T08:07:23Z","abstract_excerpt":"Recent advances in the field of network embedding have shown the low-dimensional network representation is playing a critical role in network analysis. However, most of the existing principles of network embedding do not incorporate auxiliary information such as content and labels of nodes flexibly. In this paper, we take a matrix factorization perspective of network embedding, and incorporate structure, content and label information of the network simultaneously. For structure, we validate that the matrix we construct preserves high-order proximities of the network. Label information can be f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04094","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"},"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-18T00:22:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uBY9y+qTQxaYqH83rM5jgYbFeTBTSgjiKx5sjay8r+IAPLBMwgBBD32Rpv8tP0wynrayeHC1npf3RezUuGVABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:45:01.747916Z"},"content_sha256":"157d497cc8c2a160571d265193f27120b5fc804d228080753851a14ae5953336","schema_version":"1.0","event_id":"sha256:157d497cc8c2a160571d265193f27120b5fc804d228080753851a14ae5953336"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MOJ5KNCVKSQELVLLQW4KWGQIOP/bundle.json","state_url":"https://pith.science/pith/MOJ5KNCVKSQELVLLQW4KWGQIOP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MOJ5KNCVKSQELVLLQW4KWGQIOP/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-02T14:45:01Z","links":{"resolver":"https://pith.science/pith/MOJ5KNCVKSQELVLLQW4KWGQIOP","bundle":"https://pith.science/pith/MOJ5KNCVKSQELVLLQW4KWGQIOP/bundle.json","state":"https://pith.science/pith/MOJ5KNCVKSQELVLLQW4KWGQIOP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MOJ5KNCVKSQELVLLQW4KWGQIOP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MOJ5KNCVKSQELVLLQW4KWGQIOP","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":"ff8a04014245adf6e1f4f7c848ba8869fbe89db121d29e310ae05b77d8228f38","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-11-11T08:07:23Z","title_canon_sha256":"5b564ffa71b7c1885041b312f8abcc36f262aa6b0175efd1f052924fd7d9c089"},"schema_version":"1.0","source":{"id":"1711.04094","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04094","created_at":"2026-05-18T00:22:02Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04094v2","created_at":"2026-05-18T00:22:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04094","created_at":"2026-05-18T00:22:02Z"},{"alias_kind":"pith_short_12","alias_value":"MOJ5KNCVKSQE","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MOJ5KNCVKSQELVLL","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MOJ5KNCV","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:157d497cc8c2a160571d265193f27120b5fc804d228080753851a14ae5953336","target":"graph","created_at":"2026-05-18T00:22:02Z","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":"Recent advances in the field of network embedding have shown the low-dimensional network representation is playing a critical role in network analysis. However, most of the existing principles of network embedding do not incorporate auxiliary information such as content and labels of nodes flexibly. In this paper, we take a matrix factorization perspective of network embedding, and incorporate structure, content and label information of the network simultaneously. For structure, we validate that the matrix we construct preserves high-order proximities of the network. Label information can be f","authors_text":"Enhong Chen, Junliang Guo, Linli Xu, Xunpeng Huang","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-11-11T08:07:23Z","title":"Enhancing Network Embedding with Auxiliary Information: An Explicit Matrix Factorization Perspective"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04094","kind":"arxiv","version":2},"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:415229899d07c54391f4b6d2eb844ada77fdb6d49b0e114eec8927f371bf961f","target":"record","created_at":"2026-05-18T00:22:02Z","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":"ff8a04014245adf6e1f4f7c848ba8869fbe89db121d29e310ae05b77d8228f38","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-11-11T08:07:23Z","title_canon_sha256":"5b564ffa71b7c1885041b312f8abcc36f262aa6b0175efd1f052924fd7d9c089"},"schema_version":"1.0","source":{"id":"1711.04094","kind":"arxiv","version":2}},"canonical_sha256":"6393d5345554a045d56b85b8ab1a0873d26e8f6c2b3e0fb22e75c967c3a9a5d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6393d5345554a045d56b85b8ab1a0873d26e8f6c2b3e0fb22e75c967c3a9a5d4","first_computed_at":"2026-05-18T00:22:02.669174Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:02.669174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Uz+DNwqqco9kmRzNOu7JZtbaADebmtIjP17+UalotAX58B+rCX/UK9nE8ZSTzl2UWyPieDaFyG1vNtPQVTz7BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:02.669820Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.04094","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:415229899d07c54391f4b6d2eb844ada77fdb6d49b0e114eec8927f371bf961f","sha256:157d497cc8c2a160571d265193f27120b5fc804d228080753851a14ae5953336"],"state_sha256":"f7e19163351d22f3babf7c8d7d62cc827aed66703c44f5e0dd4ab10208a64aee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pH7Z+BMvLxNzI4KJP/lY3cm9OvJN1DTtE7HvJUXd9k12UcvvXiz4Ufwh11yzzZUKXvcS8OmlX2yUOVPKt6m5Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:45:01.750713Z","bundle_sha256":"ce06674b8f9baa21ba8054ba2b19008334ac595060a490d95ff044589a381cfe"}}