{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GNASZI55LOLZO76BJ3XKOLRDFC","short_pith_number":"pith:GNASZI55","canonical_record":{"source":{"id":"1808.08627","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-08-26T21:34:36Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"71ad42356e15041cff401dba1cb7c61a41b34765e96166298bf4c95dc6537598","abstract_canon_sha256":"0cc5e1e153b1749a6dba4292105f43478782b41d7f1b238b3854ae982a69e035"},"schema_version":"1.0"},"canonical_sha256":"33412ca3bd5b97977fc14eeea72e2328894ff519672c8b5768c3463402e46cf0","source":{"kind":"arxiv","id":"1808.08627","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.08627","created_at":"2026-05-18T00:07:13Z"},{"alias_kind":"arxiv_version","alias_value":"1808.08627v1","created_at":"2026-05-18T00:07:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08627","created_at":"2026-05-18T00:07:13Z"},{"alias_kind":"pith_short_12","alias_value":"GNASZI55LOLZ","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GNASZI55LOLZO76B","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GNASZI55","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GNASZI55LOLZO76BJ3XKOLRDFC","target":"record","payload":{"canonical_record":{"source":{"id":"1808.08627","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-08-26T21:34:36Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"71ad42356e15041cff401dba1cb7c61a41b34765e96166298bf4c95dc6537598","abstract_canon_sha256":"0cc5e1e153b1749a6dba4292105f43478782b41d7f1b238b3854ae982a69e035"},"schema_version":"1.0"},"canonical_sha256":"33412ca3bd5b97977fc14eeea72e2328894ff519672c8b5768c3463402e46cf0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:13.822800Z","signature_b64":"ZFikq/69DQjEPZi9bKrQGNh64sLmdurQTKFqLsYmNyd7KdzUV3QplmRtWWk0nV6Zi4WYA9Bu/qEA+Q+Upn26BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33412ca3bd5b97977fc14eeea72e2328894ff519672c8b5768c3463402e46cf0","last_reissued_at":"2026-05-18T00:07:13.822139Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:13.822139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.08627","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-18T00:07:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"brP6q912Eeu8OTxIxamJDV2F/6VV6WenhZlcHPqP/em5Dzm6ZFJ+L1OxKSgCN0UP5kSo1A1909yGNfpqGV/cDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:27:09.030624Z"},"content_sha256":"034206dde375630077f963f48a3c009c42d3c6d54d6f46ed6218f5cabded6a28","schema_version":"1.0","event_id":"sha256:034206dde375630077f963f48a3c009c42d3c6d54d6f46ed6218f5cabded6a28"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GNASZI55LOLZO76BJ3XKOLRDFC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Level Network Embedding with Boosted Low-Rank Matrix Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SI","authors_text":"Huan Liu, Jundong Li, Liang Wu","submitted_at":"2018-08-26T21:34:36Z","abstract_excerpt":"As opposed to manual feature engineering which is tedious and difficult to scale, network representation learning has attracted a surge of research interests as it automates the process of feature learning on graphs. The learned low-dimensional node vector representation is generalizable and eases the knowledge discovery process on graphs by enabling various off-the-shelf machine learning tools to be directly applied. Recent research has shown that the past decade of network embedding approaches either explicitly factorize a carefully designed matrix to obtain the low-dimensional node vector r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08627","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-18T00:07:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QA5Xqyq1ornDkDAH/5+UiTLyvZT/ipyuICY9qZs8CsyYo69jKprxukC6Eqx10txe2ytT1X6hGN89wihksfWuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:27:09.031202Z"},"content_sha256":"437ee5a06a5d77f11b6421004f447f83030d558deac8f484da97084a5dbd9b33","schema_version":"1.0","event_id":"sha256:437ee5a06a5d77f11b6421004f447f83030d558deac8f484da97084a5dbd9b33"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GNASZI55LOLZO76BJ3XKOLRDFC/bundle.json","state_url":"https://pith.science/pith/GNASZI55LOLZO76BJ3XKOLRDFC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GNASZI55LOLZO76BJ3XKOLRDFC/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-05-27T18:27:09Z","links":{"resolver":"https://pith.science/pith/GNASZI55LOLZO76BJ3XKOLRDFC","bundle":"https://pith.science/pith/GNASZI55LOLZO76BJ3XKOLRDFC/bundle.json","state":"https://pith.science/pith/GNASZI55LOLZO76BJ3XKOLRDFC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GNASZI55LOLZO76BJ3XKOLRDFC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GNASZI55LOLZO76BJ3XKOLRDFC","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":"0cc5e1e153b1749a6dba4292105f43478782b41d7f1b238b3854ae982a69e035","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-08-26T21:34:36Z","title_canon_sha256":"71ad42356e15041cff401dba1cb7c61a41b34765e96166298bf4c95dc6537598"},"schema_version":"1.0","source":{"id":"1808.08627","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.08627","created_at":"2026-05-18T00:07:13Z"},{"alias_kind":"arxiv_version","alias_value":"1808.08627v1","created_at":"2026-05-18T00:07:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08627","created_at":"2026-05-18T00:07:13Z"},{"alias_kind":"pith_short_12","alias_value":"GNASZI55LOLZ","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GNASZI55LOLZO76B","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GNASZI55","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:437ee5a06a5d77f11b6421004f447f83030d558deac8f484da97084a5dbd9b33","target":"graph","created_at":"2026-05-18T00:07:13Z","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":"As opposed to manual feature engineering which is tedious and difficult to scale, network representation learning has attracted a surge of research interests as it automates the process of feature learning on graphs. The learned low-dimensional node vector representation is generalizable and eases the knowledge discovery process on graphs by enabling various off-the-shelf machine learning tools to be directly applied. Recent research has shown that the past decade of network embedding approaches either explicitly factorize a carefully designed matrix to obtain the low-dimensional node vector r","authors_text":"Huan Liu, Jundong Li, Liang Wu","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-08-26T21:34:36Z","title":"Multi-Level Network Embedding with Boosted Low-Rank Matrix Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08627","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:034206dde375630077f963f48a3c009c42d3c6d54d6f46ed6218f5cabded6a28","target":"record","created_at":"2026-05-18T00:07:13Z","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":"0cc5e1e153b1749a6dba4292105f43478782b41d7f1b238b3854ae982a69e035","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-08-26T21:34:36Z","title_canon_sha256":"71ad42356e15041cff401dba1cb7c61a41b34765e96166298bf4c95dc6537598"},"schema_version":"1.0","source":{"id":"1808.08627","kind":"arxiv","version":1}},"canonical_sha256":"33412ca3bd5b97977fc14eeea72e2328894ff519672c8b5768c3463402e46cf0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33412ca3bd5b97977fc14eeea72e2328894ff519672c8b5768c3463402e46cf0","first_computed_at":"2026-05-18T00:07:13.822139Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:13.822139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZFikq/69DQjEPZi9bKrQGNh64sLmdurQTKFqLsYmNyd7KdzUV3QplmRtWWk0nV6Zi4WYA9Bu/qEA+Q+Upn26BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:13.822800Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.08627","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:034206dde375630077f963f48a3c009c42d3c6d54d6f46ed6218f5cabded6a28","sha256:437ee5a06a5d77f11b6421004f447f83030d558deac8f484da97084a5dbd9b33"],"state_sha256":"a45cf2ee529ba8f7ac9881030cc92722dcb93fb57f29375c7d0dfd21b6c1600a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0UCSFs6q7mcqol5wsFRcMBeaAs6OfOfKdPxVGO9YWF/OXBGclrU3pD0sFBq19wQ/Pih96NOxUfZFiLmunnKuCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:27:09.034091Z","bundle_sha256":"926cc6a18ac675db3ff9d4686be02f11dfd2dfd4e2bfc6d2108b6c368cbf3dbb"}}