{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ERMYHSVED5BNJCBNINHHD5DRCR","short_pith_number":"pith:ERMYHSVE","schema_version":"1.0","canonical_sha256":"245983caa41f42d4882d434e71f47114446e1ccff7b77b857f3b693e1a33ed54","source":{"kind":"arxiv","id":"1503.03578","version":1},"attestation_state":"computed","paper":{"title":"LINE: Large-scale Information Network Embedding","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jian Tang, Jun Yan, Meng Qu, Ming Zhang, Mingzhe Wang, Qiaozhu Mei","submitted_at":"2015-03-12T04:07:32Z","abstract_excerpt":"This paper studies the problem of embedding very large information networks into low-dimensional vector spaces, which is useful in many tasks such as visualization, node classification, and link prediction. Most existing graph embedding methods do not scale for real world information networks which usually contain millions of nodes. In this paper, we propose a novel network embedding method called the \"LINE,\" which is suitable for arbitrary types of information networks: undirected, directed, and/or weighted. The method optimizes a carefully designed objective function that preserves both 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":"1503.03578","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LG","submitted_at":"2015-03-12T04:07:32Z","cross_cats_sorted":[],"title_canon_sha256":"d2cd3d30adb8af9ebd28d46a11dc79a80e4158ee1b9e46dd69a9f43c8137c6b7","abstract_canon_sha256":"569931fecbde30cac2d53e719bfebad5c309619a179c7d8cd72d1e4b07329e16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:58.107456Z","signature_b64":"eKTevtLoxVTJNYzhgrXUn/eQl4AJGFUNlca5lMF4nm1pFM7K9mmZAY2Uo/SsOyRDLflqZ5KAnwWBI4YdjxM3DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"245983caa41f42d4882d434e71f47114446e1ccff7b77b857f3b693e1a33ed54","last_reissued_at":"2026-05-18T02:24:58.106756Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:58.106756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LINE: Large-scale Information Network Embedding","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jian Tang, Jun Yan, Meng Qu, Ming Zhang, Mingzhe Wang, Qiaozhu Mei","submitted_at":"2015-03-12T04:07:32Z","abstract_excerpt":"This paper studies the problem of embedding very large information networks into low-dimensional vector spaces, which is useful in many tasks such as visualization, node classification, and link prediction. Most existing graph embedding methods do not scale for real world information networks which usually contain millions of nodes. In this paper, we propose a novel network embedding method called the \"LINE,\" which is suitable for arbitrary types of information networks: undirected, directed, and/or weighted. The method optimizes a carefully designed objective function that preserves both the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03578","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":"1503.03578","created_at":"2026-05-18T02:24:58.106846+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.03578v1","created_at":"2026-05-18T02:24:58.106846+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03578","created_at":"2026-05-18T02:24:58.106846+00:00"},{"alias_kind":"pith_short_12","alias_value":"ERMYHSVED5BN","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"ERMYHSVED5BNJCBN","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"ERMYHSVE","created_at":"2026-05-18T12:29:19.899920+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/ERMYHSVED5BNJCBNINHHD5DRCR","json":"https://pith.science/pith/ERMYHSVED5BNJCBNINHHD5DRCR.json","graph_json":"https://pith.science/api/pith-number/ERMYHSVED5BNJCBNINHHD5DRCR/graph.json","events_json":"https://pith.science/api/pith-number/ERMYHSVED5BNJCBNINHHD5DRCR/events.json","paper":"https://pith.science/paper/ERMYHSVE"},"agent_actions":{"view_html":"https://pith.science/pith/ERMYHSVED5BNJCBNINHHD5DRCR","download_json":"https://pith.science/pith/ERMYHSVED5BNJCBNINHHD5DRCR.json","view_paper":"https://pith.science/paper/ERMYHSVE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.03578&json=true","fetch_graph":"https://pith.science/api/pith-number/ERMYHSVED5BNJCBNINHHD5DRCR/graph.json","fetch_events":"https://pith.science/api/pith-number/ERMYHSVED5BNJCBNINHHD5DRCR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ERMYHSVED5BNJCBNINHHD5DRCR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ERMYHSVED5BNJCBNINHHD5DRCR/action/storage_attestation","attest_author":"https://pith.science/pith/ERMYHSVED5BNJCBNINHHD5DRCR/action/author_attestation","sign_citation":"https://pith.science/pith/ERMYHSVED5BNJCBNINHHD5DRCR/action/citation_signature","submit_replication":"https://pith.science/pith/ERMYHSVED5BNJCBNINHHD5DRCR/action/replication_record"}},"created_at":"2026-05-18T02:24:58.106846+00:00","updated_at":"2026-05-18T02:24:58.106846+00:00"}