{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:PJEEJICWFXU3ID3SAKTDS2ED3V","short_pith_number":"pith:PJEEJICW","schema_version":"1.0","canonical_sha256":"7a4844a0562de9b40f7202a6396883dd771323dd5a9d7b64a26fd632f857e7d9","source":{"kind":"arxiv","id":"2304.05055","version":3},"attestation_state":"computed","paper":{"title":"A Comprehensive Survey on Deep Graph Representation Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IR"],"primary_cat":"cs.LG","authors_text":"Fang Sun, Jianhao Shen, Jingyang Yuan, Junwei Yang, Ming Zhang, Qingqing Long, Wei Ju, Xiao Luo, Yifang Qin, Yifan Wang, Yiyang Gu, Yusheng Zhao, Zequn Liu, Zheng Fang, Zhiping Xiao, Ziyue Qiao","submitted_at":"2023-04-11T08:23:52Z","abstract_excerpt":"Graph representation learning aims to effectively encode high-dimensional sparse graph-structured data into low-dimensional dense vectors, which is a fundamental task that has been widely studied in a range of fields, including machine learning and data mining. Classic graph embedding methods follow the basic idea that the embedding vectors of interconnected nodes in the graph can still maintain a relatively close distance, thereby preserving the structural information between the nodes in the graph. However, this is sub-optimal due to: (i) traditional methods have limited model capacity which"},"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":"2304.05055","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-04-11T08:23:52Z","cross_cats_sorted":["cs.AI","cs.IR"],"title_canon_sha256":"79b78c86663fa721afa26f8a63ccd7291d47c9f1bb2e6513315232a57a564691","abstract_canon_sha256":"2b814e37e4cc8a042a1d06c0364046ba81cdeec30b39d36524a6f07f45f75a8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:50:00.695914Z","signature_b64":"EBy6BJnAI4mwK45CwVOx4jWuVWm23NPqvsCoMQCe5nKsttPmwoziY3h7JtlZww8qvKqMAyqjpL6Q3vUDkkoHCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a4844a0562de9b40f7202a6396883dd771323dd5a9d7b64a26fd632f857e7d9","last_reissued_at":"2026-07-05T07:50:00.695506Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:50:00.695506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Comprehensive Survey on Deep Graph Representation Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IR"],"primary_cat":"cs.LG","authors_text":"Fang Sun, Jianhao Shen, Jingyang Yuan, Junwei Yang, Ming Zhang, Qingqing Long, Wei Ju, Xiao Luo, Yifang Qin, Yifan Wang, Yiyang Gu, Yusheng Zhao, Zequn Liu, Zheng Fang, Zhiping Xiao, Ziyue Qiao","submitted_at":"2023-04-11T08:23:52Z","abstract_excerpt":"Graph representation learning aims to effectively encode high-dimensional sparse graph-structured data into low-dimensional dense vectors, which is a fundamental task that has been widely studied in a range of fields, including machine learning and data mining. Classic graph embedding methods follow the basic idea that the embedding vectors of interconnected nodes in the graph can still maintain a relatively close distance, thereby preserving the structural information between the nodes in the graph. However, this is sub-optimal due to: (i) traditional methods have limited model capacity which"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.05055","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2304.05055/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2304.05055","created_at":"2026-07-05T07:50:00.695564+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.05055v3","created_at":"2026-07-05T07:50:00.695564+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.05055","created_at":"2026-07-05T07:50:00.695564+00:00"},{"alias_kind":"pith_short_12","alias_value":"PJEEJICWFXU3","created_at":"2026-07-05T07:50:00.695564+00:00"},{"alias_kind":"pith_short_16","alias_value":"PJEEJICWFXU3ID3S","created_at":"2026-07-05T07:50:00.695564+00:00"},{"alias_kind":"pith_short_8","alias_value":"PJEEJICW","created_at":"2026-07-05T07:50:00.695564+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2407.07639","citing_title":"Explaining Graph Neural Networks for Node Similarity on Graphs","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PJEEJICWFXU3ID3SAKTDS2ED3V","json":"https://pith.science/pith/PJEEJICWFXU3ID3SAKTDS2ED3V.json","graph_json":"https://pith.science/api/pith-number/PJEEJICWFXU3ID3SAKTDS2ED3V/graph.json","events_json":"https://pith.science/api/pith-number/PJEEJICWFXU3ID3SAKTDS2ED3V/events.json","paper":"https://pith.science/paper/PJEEJICW"},"agent_actions":{"view_html":"https://pith.science/pith/PJEEJICWFXU3ID3SAKTDS2ED3V","download_json":"https://pith.science/pith/PJEEJICWFXU3ID3SAKTDS2ED3V.json","view_paper":"https://pith.science/paper/PJEEJICW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.05055&json=true","fetch_graph":"https://pith.science/api/pith-number/PJEEJICWFXU3ID3SAKTDS2ED3V/graph.json","fetch_events":"https://pith.science/api/pith-number/PJEEJICWFXU3ID3SAKTDS2ED3V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PJEEJICWFXU3ID3SAKTDS2ED3V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PJEEJICWFXU3ID3SAKTDS2ED3V/action/storage_attestation","attest_author":"https://pith.science/pith/PJEEJICWFXU3ID3SAKTDS2ED3V/action/author_attestation","sign_citation":"https://pith.science/pith/PJEEJICWFXU3ID3SAKTDS2ED3V/action/citation_signature","submit_replication":"https://pith.science/pith/PJEEJICWFXU3ID3SAKTDS2ED3V/action/replication_record"}},"created_at":"2026-07-05T07:50:00.695564+00:00","updated_at":"2026-07-05T07:50:00.695564+00:00"}