{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:K4S4DTCXGDTQZF3WSEULP5QJMC","short_pith_number":"pith:K4S4DTCX","schema_version":"1.0","canonical_sha256":"5725c1cc5730e70c97769128b7f60960955cf989ea56745484d8c75378abbd1e","source":{"kind":"arxiv","id":"1910.02370","version":2},"attestation_state":"computed","paper":{"title":"GraphZoom: A multi-level spectral approach for accurate and scalable graph embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chenhui Deng, Yongyu Wang, Zhiqiang Zhao, Zhiru Zhang, Zhuo Feng","submitted_at":"2019-10-06T04:43:46Z","abstract_excerpt":"Graph embedding techniques have been increasingly deployed in a multitude of different applications that involve learning on non-Euclidean data. However, existing graph embedding models either fail to incorporate node attribute information during training or suffer from node attribute noise, which compromises the accuracy. Moreover, very few of them scale to large graphs due to their high computational complexity and memory usage. In this paper we propose GraphZoom, a multi-level framework for improving both accuracy and scalability of unsupervised graph embedding algorithms. GraphZoom first p"},"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":"1910.02370","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-10-06T04:43:46Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7551b7b0bd4dfd52d28cc66ae7a66a9a764b53630f06ec266b48905d8ab5f1b6","abstract_canon_sha256":"6c2a0f71e5db91424b7646830de2dff3e0d8e7cf67d33b98d0397b9621241817"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:50:37.415577Z","signature_b64":"8TmFxu9qkmBQ4sT2sIyQl8veJWobAWK1i0WGimCEP7W9A6JDHHuvsdkesdHMgkkBg9ROrC4OU23+O7nVhG7FDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5725c1cc5730e70c97769128b7f60960955cf989ea56745484d8c75378abbd1e","last_reissued_at":"2026-07-05T02:50:37.415160Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:50:37.415160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GraphZoom: A multi-level spectral approach for accurate and scalable graph embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chenhui Deng, Yongyu Wang, Zhiqiang Zhao, Zhiru Zhang, Zhuo Feng","submitted_at":"2019-10-06T04:43:46Z","abstract_excerpt":"Graph embedding techniques have been increasingly deployed in a multitude of different applications that involve learning on non-Euclidean data. However, existing graph embedding models either fail to incorporate node attribute information during training or suffer from node attribute noise, which compromises the accuracy. Moreover, very few of them scale to large graphs due to their high computational complexity and memory usage. In this paper we propose GraphZoom, a multi-level framework for improving both accuracy and scalability of unsupervised graph embedding algorithms. GraphZoom first p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.02370","kind":"arxiv","version":2},"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/1910.02370/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":"1910.02370","created_at":"2026-07-05T02:50:37.415217+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.02370v2","created_at":"2026-07-05T02:50:37.415217+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.02370","created_at":"2026-07-05T02:50:37.415217+00:00"},{"alias_kind":"pith_short_12","alias_value":"K4S4DTCXGDTQ","created_at":"2026-07-05T02:50:37.415217+00:00"},{"alias_kind":"pith_short_16","alias_value":"K4S4DTCXGDTQZF3W","created_at":"2026-07-05T02:50:37.415217+00:00"},{"alias_kind":"pith_short_8","alias_value":"K4S4DTCX","created_at":"2026-07-05T02:50:37.415217+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2508.02383","citing_title":"Graph Embedding in the Graph Fractional Fourier Transform Domain","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K4S4DTCXGDTQZF3WSEULP5QJMC","json":"https://pith.science/pith/K4S4DTCXGDTQZF3WSEULP5QJMC.json","graph_json":"https://pith.science/api/pith-number/K4S4DTCXGDTQZF3WSEULP5QJMC/graph.json","events_json":"https://pith.science/api/pith-number/K4S4DTCXGDTQZF3WSEULP5QJMC/events.json","paper":"https://pith.science/paper/K4S4DTCX"},"agent_actions":{"view_html":"https://pith.science/pith/K4S4DTCXGDTQZF3WSEULP5QJMC","download_json":"https://pith.science/pith/K4S4DTCXGDTQZF3WSEULP5QJMC.json","view_paper":"https://pith.science/paper/K4S4DTCX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.02370&json=true","fetch_graph":"https://pith.science/api/pith-number/K4S4DTCXGDTQZF3WSEULP5QJMC/graph.json","fetch_events":"https://pith.science/api/pith-number/K4S4DTCXGDTQZF3WSEULP5QJMC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K4S4DTCXGDTQZF3WSEULP5QJMC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K4S4DTCXGDTQZF3WSEULP5QJMC/action/storage_attestation","attest_author":"https://pith.science/pith/K4S4DTCXGDTQZF3WSEULP5QJMC/action/author_attestation","sign_citation":"https://pith.science/pith/K4S4DTCXGDTQZF3WSEULP5QJMC/action/citation_signature","submit_replication":"https://pith.science/pith/K4S4DTCXGDTQZF3WSEULP5QJMC/action/replication_record"}},"created_at":"2026-07-05T02:50:37.415217+00:00","updated_at":"2026-07-05T02:50:37.415217+00:00"}