{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3NQEWESCCL6527GNV6HAR5NXSC","short_pith_number":"pith:3NQEWESC","schema_version":"1.0","canonical_sha256":"db604b124212fddd7ccdaf8e08f5b790bb74a0dfa518d85b304aa0af4704915a","source":{"kind":"arxiv","id":"1709.07604","version":3},"attestation_state":"computed","paper":{"title":"A Comprehensive Survey of Graph Embedding: Problems, Techniques and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Hongyun Cai, Kevin Chen-Chuan Chang, Vincent W. Zheng","submitted_at":"2017-09-22T05:54:16Z","abstract_excerpt":"Graph is an important data representation which appears in a wide diversity of real-world scenarios. Effective graph analytics provides users a deeper understanding of what is behind the data, and thus can benefit a lot of useful applications such as node classification, node recommendation, link prediction, etc. However, most graph analytics methods suffer the high computation and space cost. Graph embedding is an effective yet efficient way to solve the graph analytics problem. It converts the graph data into a low dimensional space in which the graph structural information and graph propert"},"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":"1709.07604","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-22T05:54:16Z","cross_cats_sorted":[],"title_canon_sha256":"700b7d5033fbd352eba63d3ec416ea4cc2804c64544e8426b7638ea87148737a","abstract_canon_sha256":"36c74a79dda67a4419d3c44feb44fa2aaab3f03f6f2e511d5dc6e277bac7dbf9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:35.172250Z","signature_b64":"8qrLsV23AX0wRVQYmj1NQM4YkRH+hsRG8k/sNMOxeWC28RUNL2ZxNHT0Wt5EMhfypEKP+M1YyfgbhTdJkwMPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db604b124212fddd7ccdaf8e08f5b790bb74a0dfa518d85b304aa0af4704915a","last_reissued_at":"2026-05-18T00:24:35.171876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:35.171876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Comprehensive Survey of Graph Embedding: Problems, Techniques and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Hongyun Cai, Kevin Chen-Chuan Chang, Vincent W. Zheng","submitted_at":"2017-09-22T05:54:16Z","abstract_excerpt":"Graph is an important data representation which appears in a wide diversity of real-world scenarios. Effective graph analytics provides users a deeper understanding of what is behind the data, and thus can benefit a lot of useful applications such as node classification, node recommendation, link prediction, etc. However, most graph analytics methods suffer the high computation and space cost. Graph embedding is an effective yet efficient way to solve the graph analytics problem. It converts the graph data into a low dimensional space in which the graph structural information and graph propert"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07604","kind":"arxiv","version":3},"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":"1709.07604","created_at":"2026-05-18T00:24:35.171934+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.07604v3","created_at":"2026-05-18T00:24:35.171934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07604","created_at":"2026-05-18T00:24:35.171934+00:00"},{"alias_kind":"pith_short_12","alias_value":"3NQEWESCCL65","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3NQEWESCCL6527GN","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3NQEWESC","created_at":"2026-05-18T12:30:58.224056+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.05690","citing_title":"Mercem: Method Name Recommendation Based on Call Graph Embedding","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3NQEWESCCL6527GNV6HAR5NXSC","json":"https://pith.science/pith/3NQEWESCCL6527GNV6HAR5NXSC.json","graph_json":"https://pith.science/api/pith-number/3NQEWESCCL6527GNV6HAR5NXSC/graph.json","events_json":"https://pith.science/api/pith-number/3NQEWESCCL6527GNV6HAR5NXSC/events.json","paper":"https://pith.science/paper/3NQEWESC"},"agent_actions":{"view_html":"https://pith.science/pith/3NQEWESCCL6527GNV6HAR5NXSC","download_json":"https://pith.science/pith/3NQEWESCCL6527GNV6HAR5NXSC.json","view_paper":"https://pith.science/paper/3NQEWESC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.07604&json=true","fetch_graph":"https://pith.science/api/pith-number/3NQEWESCCL6527GNV6HAR5NXSC/graph.json","fetch_events":"https://pith.science/api/pith-number/3NQEWESCCL6527GNV6HAR5NXSC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3NQEWESCCL6527GNV6HAR5NXSC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3NQEWESCCL6527GNV6HAR5NXSC/action/storage_attestation","attest_author":"https://pith.science/pith/3NQEWESCCL6527GNV6HAR5NXSC/action/author_attestation","sign_citation":"https://pith.science/pith/3NQEWESCCL6527GNV6HAR5NXSC/action/citation_signature","submit_replication":"https://pith.science/pith/3NQEWESCCL6527GNV6HAR5NXSC/action/replication_record"}},"created_at":"2026-05-18T00:24:35.171934+00:00","updated_at":"2026-05-18T00:24:35.171934+00:00"}