{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6IYJ7R5YB6SOAWXINVLWHOBBEM","short_pith_number":"pith:6IYJ7R5Y","schema_version":"1.0","canonical_sha256":"f2309fc7b80fa4e05ae86d5763b82123143b0a92b62caa48d3c2562051c2f2f7","source":{"kind":"arxiv","id":"1702.05764","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.05764","created_at":"2026-05-18T00:50:25.384167+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.05764v1","created_at":"2026-05-18T00:50:25.384167+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05764","created_at":"2026-05-18T00:50:25.384167+00:00"},{"alias_kind":"pith_short_12","alias_value":"6IYJ7R5YB6SO","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6IYJ7R5YB6SOAWXI","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6IYJ7R5Y","created_at":"2026-05-18T12:31:03.183658+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6IYJ7R5YB6SOAWXINVLWHOBBEM","json":"https://pith.science/pith/6IYJ7R5YB6SOAWXINVLWHOBBEM.json","graph_json":"https://pith.science/api/pith-number/6IYJ7R5YB6SOAWXINVLWHOBBEM/graph.json","events_json":"https://pith.science/api/pith-number/6IYJ7R5YB6SOAWXINVLWHOBBEM/events.json","paper":"https://pith.science/paper/6IYJ7R5Y"},"agent_actions":{"view_html":"https://pith.science/pith/6IYJ7R5YB6SOAWXINVLWHOBBEM","download_json":"https://pith.science/pith/6IYJ7R5YB6SOAWXINVLWHOBBEM.json","view_paper":"https://pith.science/paper/6IYJ7R5Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.05764&json=true","fetch_graph":"https://pith.science/api/pith-number/6IYJ7R5YB6SOAWXINVLWHOBBEM/graph.json","fetch_events":"https://pith.science/api/pith-number/6IYJ7R5YB6SOAWXINVLWHOBBEM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6IYJ7R5YB6SOAWXINVLWHOBBEM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6IYJ7R5YB6SOAWXINVLWHOBBEM/action/storage_attestation","attest_author":"https://pith.science/pith/6IYJ7R5YB6SOAWXINVLWHOBBEM/action/author_attestation","sign_citation":"https://pith.science/pith/6IYJ7R5YB6SOAWXINVLWHOBBEM/action/citation_signature","submit_replication":"https://pith.science/pith/6IYJ7R5YB6SOAWXINVLWHOBBEM/action/replication_record"}},"created_at":"2026-05-18T00:50:25.384167+00:00","updated_at":"2026-05-18T00:50:25.384167+00:00"}