{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MH35UUXK5RSC3QK45WQYNKAYRP","short_pith_number":"pith:MH35UUXK","canonical_record":{"source":{"id":"1905.07245","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-16T05:20:09Z","cross_cats_sorted":["cs.AI","cs.DS","stat.ML"],"title_canon_sha256":"c5825026fb47916cbd49329745c3371b6c5519697083c3f0190ca3d1faef787c","abstract_canon_sha256":"011c78c1a41f7f320bcf2cef0d8e85525513901cba66208df185c0a74f3412e7"},"schema_version":"1.0"},"canonical_sha256":"61f7da52eaec642dc15ceda186a8188be87653a9219e89fc4ed9f17292bed8c6","source":{"kind":"arxiv","id":"1905.07245","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07245","created_at":"2026-05-17T23:45:56Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07245v1","created_at":"2026-05-17T23:45:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07245","created_at":"2026-05-17T23:45:56Z"},{"alias_kind":"pith_short_12","alias_value":"MH35UUXK5RSC","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MH35UUXK5RSC3QK4","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MH35UUXK","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MH35UUXK5RSC3QK45WQYNKAYRP","target":"record","payload":{"canonical_record":{"source":{"id":"1905.07245","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-16T05:20:09Z","cross_cats_sorted":["cs.AI","cs.DS","stat.ML"],"title_canon_sha256":"c5825026fb47916cbd49329745c3371b6c5519697083c3f0190ca3d1faef787c","abstract_canon_sha256":"011c78c1a41f7f320bcf2cef0d8e85525513901cba66208df185c0a74f3412e7"},"schema_version":"1.0"},"canonical_sha256":"61f7da52eaec642dc15ceda186a8188be87653a9219e89fc4ed9f17292bed8c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:56.067792Z","signature_b64":"zH1H/L4luAKdrt21zkPFlpLa+125U5JVDQv4Pjqddv+uiDfd04hP/71CPJabtOoCGKRqe9oftnXx2Rs+zDdkAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61f7da52eaec642dc15ceda186a8188be87653a9219e89fc4ed9f17292bed8c6","last_reissued_at":"2026-05-17T23:45:56.067386Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:56.067386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.07245","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:45:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cMtvbp8f7qhKeiz1ulUbGEwkaOiEAeoGYMlII3caKpYTb4IJcGwXrAHuuM3uHxdUGSkqgHqHyYxEJctZCFsPAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T10:59:03.700214Z"},"content_sha256":"e028eec68c2b7372905574c6251325aa78fbe82b02281c7363aed6c62e854f22","schema_version":"1.0","event_id":"sha256:e028eec68c2b7372905574c6251325aa78fbe82b02281c7363aed6c62e854f22"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MH35UUXK5RSC3QK45WQYNKAYRP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Graph Embeddings via Sparse Transpose Proximities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Yuan Yin, Zhewei Wei","submitted_at":"2019-05-16T05:20:09Z","abstract_excerpt":"Graph embedding learns low-dimensional representations for nodes in a graph and effectively preserves the graph structure. Recently, a significant amount of progress has been made toward this emerging research area. However, there are several fundamental problems that remain open. First, existing methods fail to preserve the out-degree distributions on directed graphs. Second, many existing methods employ random walk based proximities and thus suffer from conflicting optimization goals on undirected graphs. Finally, existing factorization methods are unable to achieve scalability and non-linea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07245","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:45:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AJ94UJ3rei4Hs8zQwR5CRuiWIPhgGpcIA6s9Dwil3lHVcHnY0jdKL5yXinZelxTwLVGUdLVxjGFkQeXtnfM7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T10:59:03.700567Z"},"content_sha256":"43bd71875ca1e1a7171c67607d49e61c830bfc883f7c28ca0a363e1c779789e5","schema_version":"1.0","event_id":"sha256:43bd71875ca1e1a7171c67607d49e61c830bfc883f7c28ca0a363e1c779789e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MH35UUXK5RSC3QK45WQYNKAYRP/bundle.json","state_url":"https://pith.science/pith/MH35UUXK5RSC3QK45WQYNKAYRP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MH35UUXK5RSC3QK45WQYNKAYRP/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-20T10:59:03Z","links":{"resolver":"https://pith.science/pith/MH35UUXK5RSC3QK45WQYNKAYRP","bundle":"https://pith.science/pith/MH35UUXK5RSC3QK45WQYNKAYRP/bundle.json","state":"https://pith.science/pith/MH35UUXK5RSC3QK45WQYNKAYRP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MH35UUXK5RSC3QK45WQYNKAYRP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MH35UUXK5RSC3QK45WQYNKAYRP","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":"011c78c1a41f7f320bcf2cef0d8e85525513901cba66208df185c0a74f3412e7","cross_cats_sorted":["cs.AI","cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-16T05:20:09Z","title_canon_sha256":"c5825026fb47916cbd49329745c3371b6c5519697083c3f0190ca3d1faef787c"},"schema_version":"1.0","source":{"id":"1905.07245","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07245","created_at":"2026-05-17T23:45:56Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07245v1","created_at":"2026-05-17T23:45:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07245","created_at":"2026-05-17T23:45:56Z"},{"alias_kind":"pith_short_12","alias_value":"MH35UUXK5RSC","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MH35UUXK5RSC3QK4","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MH35UUXK","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:43bd71875ca1e1a7171c67607d49e61c830bfc883f7c28ca0a363e1c779789e5","target":"graph","created_at":"2026-05-17T23:45:56Z","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":"Graph embedding learns low-dimensional representations for nodes in a graph and effectively preserves the graph structure. Recently, a significant amount of progress has been made toward this emerging research area. However, there are several fundamental problems that remain open. First, existing methods fail to preserve the out-degree distributions on directed graphs. Second, many existing methods employ random walk based proximities and thus suffer from conflicting optimization goals on undirected graphs. Finally, existing factorization methods are unable to achieve scalability and non-linea","authors_text":"Yuan Yin, Zhewei Wei","cross_cats":["cs.AI","cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-16T05:20:09Z","title":"Scalable Graph Embeddings via Sparse Transpose Proximities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07245","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:e028eec68c2b7372905574c6251325aa78fbe82b02281c7363aed6c62e854f22","target":"record","created_at":"2026-05-17T23:45:56Z","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":"011c78c1a41f7f320bcf2cef0d8e85525513901cba66208df185c0a74f3412e7","cross_cats_sorted":["cs.AI","cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-16T05:20:09Z","title_canon_sha256":"c5825026fb47916cbd49329745c3371b6c5519697083c3f0190ca3d1faef787c"},"schema_version":"1.0","source":{"id":"1905.07245","kind":"arxiv","version":1}},"canonical_sha256":"61f7da52eaec642dc15ceda186a8188be87653a9219e89fc4ed9f17292bed8c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61f7da52eaec642dc15ceda186a8188be87653a9219e89fc4ed9f17292bed8c6","first_computed_at":"2026-05-17T23:45:56.067386Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:56.067386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zH1H/L4luAKdrt21zkPFlpLa+125U5JVDQv4Pjqddv+uiDfd04hP/71CPJabtOoCGKRqe9oftnXx2Rs+zDdkAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:56.067792Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.07245","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e028eec68c2b7372905574c6251325aa78fbe82b02281c7363aed6c62e854f22","sha256:43bd71875ca1e1a7171c67607d49e61c830bfc883f7c28ca0a363e1c779789e5"],"state_sha256":"ff30338c51be2c84ebf0495444fbb8a6fe31856421d4fa4317b39edbebea4756"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l7qaZ19zqUT7m8UuYiuFHzotUmQf3MfHbmjH7FQjPruFZ2O1+VxM2WJiBm/jxigiuavSMCynoQkFu3FodQ8DAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T10:59:03.702491Z","bundle_sha256":"ebeed68aeee90e2487e2dc4bbe4474820e047bb91dda49943230cae079913ae4"}}