{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RO5BA4DRRXVENML4JIAABXP75A","short_pith_number":"pith:RO5BA4DR","canonical_record":{"source":{"id":"1907.01705","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-03T02:02:39Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"47cbcc5f591dfc39fd8be5584f4e4368b076bfedf5d3be3d94ef6e43d19fc321","abstract_canon_sha256":"860f7998e8105681eebaf40c1f9cf8bec847f3073a8978644820f76ce8b5c222"},"schema_version":"1.0"},"canonical_sha256":"8bba1070718dea46b17c4a0000ddffe80987b5b3fc20716f241ea56dd0c99cc2","source":{"kind":"arxiv","id":"1907.01705","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.01705","created_at":"2026-05-17T23:41:35Z"},{"alias_kind":"arxiv_version","alias_value":"1907.01705v1","created_at":"2026-05-17T23:41:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01705","created_at":"2026-05-17T23:41:35Z"},{"alias_kind":"pith_short_12","alias_value":"RO5BA4DRRXVE","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RO5BA4DRRXVENML4","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RO5BA4DR","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RO5BA4DRRXVENML4JIAABXP75A","target":"record","payload":{"canonical_record":{"source":{"id":"1907.01705","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-03T02:02:39Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"47cbcc5f591dfc39fd8be5584f4e4368b076bfedf5d3be3d94ef6e43d19fc321","abstract_canon_sha256":"860f7998e8105681eebaf40c1f9cf8bec847f3073a8978644820f76ce8b5c222"},"schema_version":"1.0"},"canonical_sha256":"8bba1070718dea46b17c4a0000ddffe80987b5b3fc20716f241ea56dd0c99cc2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:35.423224Z","signature_b64":"wmiTumZeOPK9nwWhsdN5j4OAkHf8fvobYG29HuGw117TJkNyf8EmUdSRRIIXx3z10dw/1BDQVhcMNNaUTIO+Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bba1070718dea46b17c4a0000ddffe80987b5b3fc20716f241ea56dd0c99cc2","last_reissued_at":"2026-05-17T23:41:35.422560Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:35.422560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.01705","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:41:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LvUUPBOSMOqnCBFcrHIYp5P2IWxyOXwn7ls0E6H1yxU23XttfNAXnJrVYoY9yDkyyO6zUQbcPQyzmkOjbX0QBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:46:01.358045Z"},"content_sha256":"c37c51bad1fedd7919749c0ae31338ce0e9cc4e581f68a2d763ce68fe0a06b91","schema_version":"1.0","event_id":"sha256:c37c51bad1fedd7919749c0ae31338ce0e9cc4e581f68a2d763ce68fe0a06b91"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RO5BA4DRRXVENML4JIAABXP75A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Embeddings at Scale","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Anish Khazane, C. Bayan Bruss, Jonathan Rider, Keegan E. Hines, Richard Serpe, Saurabh Nagrecha","submitted_at":"2019-07-03T02:02:39Z","abstract_excerpt":"Graph embedding is a popular algorithmic approach for creating vector representations for individual vertices in networks. Training these algorithms at scale is important for creating embeddings that can be used for classification, ranking, recommendation and other common applications in industry. While industrial systems exist for training graph embeddings on large datasets, many of these distributed architectures are forced to partition copious amounts of data and model logic across many worker nodes. In this paper, we propose a distributed infrastructure that completely avoids graph partiti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01705","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:41:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dc1jhKUbSf/kyj10YKYcJrEpNhp0ml+vH1qO10fAALSV6H7fS4rESurgu1rSduQxe6HHJT/R9movatB/vLGODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:46:01.358604Z"},"content_sha256":"8d0cbd63704c1fc0a87f246391a250e5c450a2aed3b2148353dc8c9ee2fcb795","schema_version":"1.0","event_id":"sha256:8d0cbd63704c1fc0a87f246391a250e5c450a2aed3b2148353dc8c9ee2fcb795"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RO5BA4DRRXVENML4JIAABXP75A/bundle.json","state_url":"https://pith.science/pith/RO5BA4DRRXVENML4JIAABXP75A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RO5BA4DRRXVENML4JIAABXP75A/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-26T06:46:01Z","links":{"resolver":"https://pith.science/pith/RO5BA4DRRXVENML4JIAABXP75A","bundle":"https://pith.science/pith/RO5BA4DRRXVENML4JIAABXP75A/bundle.json","state":"https://pith.science/pith/RO5BA4DRRXVENML4JIAABXP75A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RO5BA4DRRXVENML4JIAABXP75A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RO5BA4DRRXVENML4JIAABXP75A","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":"860f7998e8105681eebaf40c1f9cf8bec847f3073a8978644820f76ce8b5c222","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-03T02:02:39Z","title_canon_sha256":"47cbcc5f591dfc39fd8be5584f4e4368b076bfedf5d3be3d94ef6e43d19fc321"},"schema_version":"1.0","source":{"id":"1907.01705","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.01705","created_at":"2026-05-17T23:41:35Z"},{"alias_kind":"arxiv_version","alias_value":"1907.01705v1","created_at":"2026-05-17T23:41:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01705","created_at":"2026-05-17T23:41:35Z"},{"alias_kind":"pith_short_12","alias_value":"RO5BA4DRRXVE","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RO5BA4DRRXVENML4","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RO5BA4DR","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:8d0cbd63704c1fc0a87f246391a250e5c450a2aed3b2148353dc8c9ee2fcb795","target":"graph","created_at":"2026-05-17T23:41:35Z","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 is a popular algorithmic approach for creating vector representations for individual vertices in networks. Training these algorithms at scale is important for creating embeddings that can be used for classification, ranking, recommendation and other common applications in industry. While industrial systems exist for training graph embeddings on large datasets, many of these distributed architectures are forced to partition copious amounts of data and model logic across many worker nodes. In this paper, we propose a distributed infrastructure that completely avoids graph partiti","authors_text":"Anish Khazane, C. Bayan Bruss, Jonathan Rider, Keegan E. Hines, Richard Serpe, Saurabh Nagrecha","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-03T02:02:39Z","title":"Graph Embeddings at Scale"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01705","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:c37c51bad1fedd7919749c0ae31338ce0e9cc4e581f68a2d763ce68fe0a06b91","target":"record","created_at":"2026-05-17T23:41:35Z","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":"860f7998e8105681eebaf40c1f9cf8bec847f3073a8978644820f76ce8b5c222","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-03T02:02:39Z","title_canon_sha256":"47cbcc5f591dfc39fd8be5584f4e4368b076bfedf5d3be3d94ef6e43d19fc321"},"schema_version":"1.0","source":{"id":"1907.01705","kind":"arxiv","version":1}},"canonical_sha256":"8bba1070718dea46b17c4a0000ddffe80987b5b3fc20716f241ea56dd0c99cc2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8bba1070718dea46b17c4a0000ddffe80987b5b3fc20716f241ea56dd0c99cc2","first_computed_at":"2026-05-17T23:41:35.422560Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:35.422560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wmiTumZeOPK9nwWhsdN5j4OAkHf8fvobYG29HuGw117TJkNyf8EmUdSRRIIXx3z10dw/1BDQVhcMNNaUTIO+Dg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:35.423224Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.01705","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c37c51bad1fedd7919749c0ae31338ce0e9cc4e581f68a2d763ce68fe0a06b91","sha256:8d0cbd63704c1fc0a87f246391a250e5c450a2aed3b2148353dc8c9ee2fcb795"],"state_sha256":"0f5b8c9956843c84a4ba9ed3103da8681818e29d92909e38532fa4067a0b30ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7yyoxR22dMu/5Q/K2DYsP8zisWg0bqYR5n5WZ+zAE0bJztO02Cgdl3yolu9Hr4nEa1Cax7mfkv1XiAQtOqkpDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:46:01.361991Z","bundle_sha256":"be1a6548ad50f874a809e5530f457a2669fca331590a39bc35cab65e4650b461"}}