{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6IYJ7R5YB6SOAWXINVLWHOBBEM","short_pith_number":"pith:6IYJ7R5Y","canonical_record":{"source":{"id":"1702.05764","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-02-19T16:22:27Z","cross_cats_sorted":[],"title_canon_sha256":"a1de0890b00994e2c79f45a0a4c80b0122a572aa82ae514d2c896b2d34ec118e","abstract_canon_sha256":"fe674ddedf9c846a9728f53c1bd88b5edec24e5fabe21464c6903f7a27ac2d14"},"schema_version":"1.0"},"canonical_sha256":"f2309fc7b80fa4e05ae86d5763b82123143b0a92b62caa48d3c2562051c2f2f7","source":{"kind":"arxiv","id":"1702.05764","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05764","created_at":"2026-05-18T00:50:25Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05764v1","created_at":"2026-05-18T00:50:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05764","created_at":"2026-05-18T00:50:25Z"},{"alias_kind":"pith_short_12","alias_value":"6IYJ7R5YB6SO","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6IYJ7R5YB6SOAWXI","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6IYJ7R5Y","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6IYJ7R5YB6SOAWXINVLWHOBBEM","target":"record","payload":{"canonical_record":{"source":{"id":"1702.05764","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-02-19T16:22:27Z","cross_cats_sorted":[],"title_canon_sha256":"a1de0890b00994e2c79f45a0a4c80b0122a572aa82ae514d2c896b2d34ec118e","abstract_canon_sha256":"fe674ddedf9c846a9728f53c1bd88b5edec24e5fabe21464c6903f7a27ac2d14"},"schema_version":"1.0"},"canonical_sha256":"f2309fc7b80fa4e05ae86d5763b82123143b0a92b62caa48d3c2562051c2f2f7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:25.384852Z","signature_b64":"mdjs2+1xGfxR0I2+sAOSWUZQiU+9WpnxXVMXEdam+iY6SgE/+zgFqVzW7Cf8FjlUFrU9j+iFHZNatcykcKdwDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2309fc7b80fa4e05ae86d5763b82123143b0a92b62caa48d3c2562051c2f2f7","last_reissued_at":"2026-05-18T00:50:25.383993Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:25.383993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.05764","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:50:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MIAjuDVxV2LKKAXGoOXU3d3GYnX0NDmteQkhuQ0fT4fY2/2rlkSOgO41ATRFRO87HTsGW/aFhncTHfIesq9JCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:25:37.010739Z"},"content_sha256":"f8f8464a196ffe8070bde13a2e7c25f919aa8fb23ad5a630ef6251b0d475762b","schema_version":"1.0","event_id":"sha256:f8f8464a196ffe8070bde13a2e7c25f919aa8fb23ad5a630ef6251b0d475762b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6IYJ7R5YB6SOAWXINVLWHOBBEM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast, Warped Graph Embedding: Unifying Framework and One-Click Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Christos Faloutsos, Jelena Kova\\v{c}evi\\'c, Leman Akoglu, Siheng Chen, Sufeng Niu","submitted_at":"2017-02-19T16:22:27Z","abstract_excerpt":"What is the best way to describe a user in a social network with just a few numbers? Mathematically, this is equivalent to assigning a vector representation to each node in a graph, a process called graph embedding. We propose a novel framework, GEM-D that unifies most of the past algorithms such as LapEigs, DeepWalk and node2vec. GEM-D achieves its goal by decomposing any graph embedding algorithm into three building blocks: node proximity function, warping function and loss function. Based on thorough analysis of GEM-D, we propose a novel algorithm, called UltimateWalk, which outperforms the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05764","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:50:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9vAwUe4k/gTrwedj6Vzs//nqzyMhFu9kFXQLTkcwfMM3jdBgzJwUhN1NP6peU+fN+rybT98Gy2ZNukL9SBalBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:25:37.011081Z"},"content_sha256":"4f5455aa9d9b0d30e59970b5d15bebc0a48f5f2b9975db3a686737aabc64bfc7","schema_version":"1.0","event_id":"sha256:4f5455aa9d9b0d30e59970b5d15bebc0a48f5f2b9975db3a686737aabc64bfc7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6IYJ7R5YB6SOAWXINVLWHOBBEM/bundle.json","state_url":"https://pith.science/pith/6IYJ7R5YB6SOAWXINVLWHOBBEM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6IYJ7R5YB6SOAWXINVLWHOBBEM/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-02T17:25:37Z","links":{"resolver":"https://pith.science/pith/6IYJ7R5YB6SOAWXINVLWHOBBEM","bundle":"https://pith.science/pith/6IYJ7R5YB6SOAWXINVLWHOBBEM/bundle.json","state":"https://pith.science/pith/6IYJ7R5YB6SOAWXINVLWHOBBEM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6IYJ7R5YB6SOAWXINVLWHOBBEM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6IYJ7R5YB6SOAWXINVLWHOBBEM","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":"fe674ddedf9c846a9728f53c1bd88b5edec24e5fabe21464c6903f7a27ac2d14","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-02-19T16:22:27Z","title_canon_sha256":"a1de0890b00994e2c79f45a0a4c80b0122a572aa82ae514d2c896b2d34ec118e"},"schema_version":"1.0","source":{"id":"1702.05764","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05764","created_at":"2026-05-18T00:50:25Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05764v1","created_at":"2026-05-18T00:50:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05764","created_at":"2026-05-18T00:50:25Z"},{"alias_kind":"pith_short_12","alias_value":"6IYJ7R5YB6SO","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6IYJ7R5YB6SOAWXI","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6IYJ7R5Y","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:4f5455aa9d9b0d30e59970b5d15bebc0a48f5f2b9975db3a686737aabc64bfc7","target":"graph","created_at":"2026-05-18T00:50:25Z","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":"What is the best way to describe a user in a social network with just a few numbers? Mathematically, this is equivalent to assigning a vector representation to each node in a graph, a process called graph embedding. We propose a novel framework, GEM-D that unifies most of the past algorithms such as LapEigs, DeepWalk and node2vec. GEM-D achieves its goal by decomposing any graph embedding algorithm into three building blocks: node proximity function, warping function and loss function. Based on thorough analysis of GEM-D, we propose a novel algorithm, called UltimateWalk, which outperforms the","authors_text":"Christos Faloutsos, Jelena Kova\\v{c}evi\\'c, Leman Akoglu, Siheng Chen, Sufeng Niu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-02-19T16:22:27Z","title":"Fast, Warped Graph Embedding: Unifying Framework and One-Click Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05764","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:f8f8464a196ffe8070bde13a2e7c25f919aa8fb23ad5a630ef6251b0d475762b","target":"record","created_at":"2026-05-18T00:50:25Z","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":"fe674ddedf9c846a9728f53c1bd88b5edec24e5fabe21464c6903f7a27ac2d14","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-02-19T16:22:27Z","title_canon_sha256":"a1de0890b00994e2c79f45a0a4c80b0122a572aa82ae514d2c896b2d34ec118e"},"schema_version":"1.0","source":{"id":"1702.05764","kind":"arxiv","version":1}},"canonical_sha256":"f2309fc7b80fa4e05ae86d5763b82123143b0a92b62caa48d3c2562051c2f2f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2309fc7b80fa4e05ae86d5763b82123143b0a92b62caa48d3c2562051c2f2f7","first_computed_at":"2026-05-18T00:50:25.383993Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:25.383993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mdjs2+1xGfxR0I2+sAOSWUZQiU+9WpnxXVMXEdam+iY6SgE/+zgFqVzW7Cf8FjlUFrU9j+iFHZNatcykcKdwDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:25.384852Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.05764","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8f8464a196ffe8070bde13a2e7c25f919aa8fb23ad5a630ef6251b0d475762b","sha256:4f5455aa9d9b0d30e59970b5d15bebc0a48f5f2b9975db3a686737aabc64bfc7"],"state_sha256":"5c28f629e21ab877097e8a7aa3777b739ae2bfc90bc80055d1cc59d79fd5c4b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"riGOeFF7OTpkP171mByclQfxnFfnuugmlGaP1N1FlkZU5/vz54PB7tSYbK4AXP+JLbgXMwaTbZH9IUkNiIl6Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:25:37.013101Z","bundle_sha256":"b243f590ce26e19296106ab242b58bf7d7ae3440b4a2c3fd8f6ed437bccba313"}}