{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7DP6K5BED5G3UXQWUGTGKXBQ26","short_pith_number":"pith:7DP6K5BE","canonical_record":{"source":{"id":"1705.05615","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-16T09:44:28Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"88f027bb4dd6bcd214d8d4af55b6091773a4041f972de963c4a9761fa23a5e01","abstract_canon_sha256":"c9db5a191a68551b29e72eb24a9981ca146f8cbb655184e05c5c819c55479b5d"},"schema_version":"1.0"},"canonical_sha256":"f8dfe574241f4dba5e16a1a6655c30d7b1d63f63e289ea63cfc63c0cd7cf7f9d","source":{"kind":"arxiv","id":"1705.05615","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05615","created_at":"2026-05-18T00:35:13Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05615v4","created_at":"2026-05-18T00:35:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05615","created_at":"2026-05-18T00:35:13Z"},{"alias_kind":"pith_short_12","alias_value":"7DP6K5BED5G3","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"7DP6K5BED5G3UXQW","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"7DP6K5BE","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7DP6K5BED5G3UXQWUGTGKXBQ26","target":"record","payload":{"canonical_record":{"source":{"id":"1705.05615","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-16T09:44:28Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"88f027bb4dd6bcd214d8d4af55b6091773a4041f972de963c4a9761fa23a5e01","abstract_canon_sha256":"c9db5a191a68551b29e72eb24a9981ca146f8cbb655184e05c5c819c55479b5d"},"schema_version":"1.0"},"canonical_sha256":"f8dfe574241f4dba5e16a1a6655c30d7b1d63f63e289ea63cfc63c0cd7cf7f9d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:13.714851Z","signature_b64":"Q5HPutE6+YYnxR44g0qngYnp7Ks2i4Zh0qCjGG23647Z6E4BJFoNRuQQ2wcmfNpt1xFl6nQZpsV4b6bPa8ByDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8dfe574241f4dba5e16a1a6655c30d7b1d63f63e289ea63cfc63c0cd7cf7f9d","last_reissued_at":"2026-05-18T00:35:13.714438Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:13.714438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.05615","source_version":4,"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:35:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YXCPuMBQh2eGslRBRSrSwbbJ7mxt56LOG3mi3tpV7D9uN3pCROi9RPmMouYT7IPYwk3HQs0Clx3vqfK+J9WiAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:49:19.128792Z"},"content_sha256":"8906403c78b78b4addf4ecd0a438b942857660d94e4a9c51e3e47d1ca9ace50d","schema_version":"1.0","event_id":"sha256:8906403c78b78b4addf4ecd0a438b942857660d94e4a9c51e3e47d1ca9ace50d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7DP6K5BED5G3UXQWUGTGKXBQ26","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Edge Representations via Low-Rank Asymmetric Projections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bryan Perozzi, Rami Al-Rfou, Sami Abu-el-haija","submitted_at":"2017-05-16T09:44:28Z","abstract_excerpt":"We propose a new method for embedding graphs while preserving directed edge information. Learning such continuous-space vector representations (or embeddings) of nodes in a graph is an important first step for using network information (from social networks, user-item graphs, knowledge bases, etc.) in many machine learning tasks.\n  Unlike previous work, we (1) explicitly model an edge as a function of node embeddings, and we (2) propose a novel objective, the \"graph likelihood\", which contrasts information from sampled random walks with non-existent edges. Individually, both of these contribut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05615","kind":"arxiv","version":4},"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:35:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MA6f4YYKiBGjceVdqxVzAoSkHy3BbMerSZ8pxuDTY3XbRb6DHQ9GVqgwych67gyVzseExIndASohu2NHcFazCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:49:19.129493Z"},"content_sha256":"fc60ae07db749c021401b1bcdc43e37823990c2b22d2c173eff9cc929d89d15b","schema_version":"1.0","event_id":"sha256:fc60ae07db749c021401b1bcdc43e37823990c2b22d2c173eff9cc929d89d15b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7DP6K5BED5G3UXQWUGTGKXBQ26/bundle.json","state_url":"https://pith.science/pith/7DP6K5BED5G3UXQWUGTGKXBQ26/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7DP6K5BED5G3UXQWUGTGKXBQ26/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-25T15:49:19Z","links":{"resolver":"https://pith.science/pith/7DP6K5BED5G3UXQWUGTGKXBQ26","bundle":"https://pith.science/pith/7DP6K5BED5G3UXQWUGTGKXBQ26/bundle.json","state":"https://pith.science/pith/7DP6K5BED5G3UXQWUGTGKXBQ26/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7DP6K5BED5G3UXQWUGTGKXBQ26/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7DP6K5BED5G3UXQWUGTGKXBQ26","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":"c9db5a191a68551b29e72eb24a9981ca146f8cbb655184e05c5c819c55479b5d","cross_cats_sorted":["cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-16T09:44:28Z","title_canon_sha256":"88f027bb4dd6bcd214d8d4af55b6091773a4041f972de963c4a9761fa23a5e01"},"schema_version":"1.0","source":{"id":"1705.05615","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05615","created_at":"2026-05-18T00:35:13Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05615v4","created_at":"2026-05-18T00:35:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05615","created_at":"2026-05-18T00:35:13Z"},{"alias_kind":"pith_short_12","alias_value":"7DP6K5BED5G3","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"7DP6K5BED5G3UXQW","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"7DP6K5BE","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:fc60ae07db749c021401b1bcdc43e37823990c2b22d2c173eff9cc929d89d15b","target":"graph","created_at":"2026-05-18T00:35: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":"We propose a new method for embedding graphs while preserving directed edge information. Learning such continuous-space vector representations (or embeddings) of nodes in a graph is an important first step for using network information (from social networks, user-item graphs, knowledge bases, etc.) in many machine learning tasks.\n  Unlike previous work, we (1) explicitly model an edge as a function of node embeddings, and we (2) propose a novel objective, the \"graph likelihood\", which contrasts information from sampled random walks with non-existent edges. Individually, both of these contribut","authors_text":"Bryan Perozzi, Rami Al-Rfou, Sami Abu-el-haija","cross_cats":["cs.SI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-16T09:44:28Z","title":"Learning Edge Representations via Low-Rank Asymmetric Projections"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05615","kind":"arxiv","version":4},"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:8906403c78b78b4addf4ecd0a438b942857660d94e4a9c51e3e47d1ca9ace50d","target":"record","created_at":"2026-05-18T00:35: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":"c9db5a191a68551b29e72eb24a9981ca146f8cbb655184e05c5c819c55479b5d","cross_cats_sorted":["cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-16T09:44:28Z","title_canon_sha256":"88f027bb4dd6bcd214d8d4af55b6091773a4041f972de963c4a9761fa23a5e01"},"schema_version":"1.0","source":{"id":"1705.05615","kind":"arxiv","version":4}},"canonical_sha256":"f8dfe574241f4dba5e16a1a6655c30d7b1d63f63e289ea63cfc63c0cd7cf7f9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8dfe574241f4dba5e16a1a6655c30d7b1d63f63e289ea63cfc63c0cd7cf7f9d","first_computed_at":"2026-05-18T00:35:13.714438Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:13.714438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q5HPutE6+YYnxR44g0qngYnp7Ks2i4Zh0qCjGG23647Z6E4BJFoNRuQQ2wcmfNpt1xFl6nQZpsV4b6bPa8ByDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:13.714851Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.05615","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8906403c78b78b4addf4ecd0a438b942857660d94e4a9c51e3e47d1ca9ace50d","sha256:fc60ae07db749c021401b1bcdc43e37823990c2b22d2c173eff9cc929d89d15b"],"state_sha256":"96d3061d0f0796f8c2c3b7d0c86741c33b29183dcd757896e0cf5ff12f8bfaf3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NwA9FlB7c4+zFTu93+N9CUhgn+prSVSRsy2dBhJ8/bp27meQrZTBWCtMlEXjhkGlZJdQ+ikkLbGm+y6EfJ00Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:49:19.133164Z","bundle_sha256":"d183e95c07bb4004cdd8b4281e4e27c47c2a0043c2f40025674e26cfd98ab36c"}}