{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:R2R7MYLD2L6AUT352B4EFASKX4","short_pith_number":"pith:R2R7MYLD","schema_version":"1.0","canonical_sha256":"8ea3f66163d2fc0a4f7dd07842824abf2738cff556a6a9b455f44e050414407d","source":{"kind":"arxiv","id":"1908.11512","version":1},"attestation_state":"computed","paper":{"title":"Fast and Accurate Network Embeddings via Very Sparse Random Projection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Haochen Chen, Muhao Chen, Steven Skiena, Syed Fahad Sultan, Yingtao Tian","submitted_at":"2019-08-30T02:31:15Z","abstract_excerpt":"We present FastRP, a scalable and performant algorithm for learning distributed node representations in a graph. FastRP is over 4,000 times faster than state-of-the-art methods such as DeepWalk and node2vec, while achieving comparable or even better performance as evaluated on several real-world networks on various downstream tasks. We observe that most network embedding methods consist of two components: construct a node similarity matrix and then apply dimension reduction techniques to this matrix. We show that the success of these methods should be attributed to the proper construction of t"},"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":"1908.11512","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-08-30T02:31:15Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9372ac0f6567725437441c68ab666aa85695e25d1280be1ec668f88bfec34016","abstract_canon_sha256":"d2a42ce5fe63621fe786e5ff1218f3f314bfcc790e007dd8dd5ecd6112f837f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:00:37.255476Z","signature_b64":"07mIyOa7gRtaYgZy4rYmOySbvk2jVsyUX4iQTkG+polcCl8RZ6QCdnKr01v8mPzkEsg3dPL3RW7OPRwaJEEADg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ea3f66163d2fc0a4f7dd07842824abf2738cff556a6a9b455f44e050414407d","last_reissued_at":"2026-07-05T00:00:37.255133Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:00:37.255133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and Accurate Network Embeddings via Very Sparse Random Projection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Haochen Chen, Muhao Chen, Steven Skiena, Syed Fahad Sultan, Yingtao Tian","submitted_at":"2019-08-30T02:31:15Z","abstract_excerpt":"We present FastRP, a scalable and performant algorithm for learning distributed node representations in a graph. FastRP is over 4,000 times faster than state-of-the-art methods such as DeepWalk and node2vec, while achieving comparable or even better performance as evaluated on several real-world networks on various downstream tasks. We observe that most network embedding methods consist of two components: construct a node similarity matrix and then apply dimension reduction techniques to this matrix. We show that the success of these methods should be attributed to the proper construction of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.11512","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.11512/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":"1908.11512","created_at":"2026-07-05T00:00:37.255188+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.11512v1","created_at":"2026-07-05T00:00:37.255188+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.11512","created_at":"2026-07-05T00:00:37.255188+00:00"},{"alias_kind":"pith_short_12","alias_value":"R2R7MYLD2L6A","created_at":"2026-07-05T00:00:37.255188+00:00"},{"alias_kind":"pith_short_16","alias_value":"R2R7MYLD2L6AUT35","created_at":"2026-07-05T00:00:37.255188+00:00"},{"alias_kind":"pith_short_8","alias_value":"R2R7MYLD","created_at":"2026-07-05T00:00:37.255188+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.09940","citing_title":"Predictive Query-based Pipeline for Graph Data","ref_index":2003,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R2R7MYLD2L6AUT352B4EFASKX4","json":"https://pith.science/pith/R2R7MYLD2L6AUT352B4EFASKX4.json","graph_json":"https://pith.science/api/pith-number/R2R7MYLD2L6AUT352B4EFASKX4/graph.json","events_json":"https://pith.science/api/pith-number/R2R7MYLD2L6AUT352B4EFASKX4/events.json","paper":"https://pith.science/paper/R2R7MYLD"},"agent_actions":{"view_html":"https://pith.science/pith/R2R7MYLD2L6AUT352B4EFASKX4","download_json":"https://pith.science/pith/R2R7MYLD2L6AUT352B4EFASKX4.json","view_paper":"https://pith.science/paper/R2R7MYLD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.11512&json=true","fetch_graph":"https://pith.science/api/pith-number/R2R7MYLD2L6AUT352B4EFASKX4/graph.json","fetch_events":"https://pith.science/api/pith-number/R2R7MYLD2L6AUT352B4EFASKX4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R2R7MYLD2L6AUT352B4EFASKX4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R2R7MYLD2L6AUT352B4EFASKX4/action/storage_attestation","attest_author":"https://pith.science/pith/R2R7MYLD2L6AUT352B4EFASKX4/action/author_attestation","sign_citation":"https://pith.science/pith/R2R7MYLD2L6AUT352B4EFASKX4/action/citation_signature","submit_replication":"https://pith.science/pith/R2R7MYLD2L6AUT352B4EFASKX4/action/replication_record"}},"created_at":"2026-07-05T00:00:37.255188+00:00","updated_at":"2026-07-05T00:00:37.255188+00:00"}