{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PRQDPUOCLU5O2I2ZJ3JXIOOZ2K","short_pith_number":"pith:PRQDPUOC","schema_version":"1.0","canonical_sha256":"7c6037d1c25d3aed23594ed37439d9d2bfc62bdf6aa569c8ce45c47d042bedb1","source":{"kind":"arxiv","id":"1907.02811","version":2},"attestation_state":"computed","paper":{"title":"Network Embedding: on Compression and Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Esra Akbas, Mehmet Aktas","submitted_at":"2019-07-05T13:22:02Z","abstract_excerpt":"Recently, network embedding that encodes structural information of graphs into a vector space has become popular for network analysis. Although recent methods show promising performance for various applications, the huge sizes of graphs may hinder a direct application of existing network embedding method to them. This paper presents NECL, a novel efficient Network Embedding method with two goals. 1) Is there an ideal Compression of a network? 2) Will the compression of a network significantly boost the representation Learning of the network? For the first problem, we propose a neighborhood sim"},"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":"1907.02811","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2019-07-05T13:22:02Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8ec3e1b04bbcd99d8ef00add0fcc5a28549ba24c52f7bc4bd0460706ff2f1a5d","abstract_canon_sha256":"6717762d8821016178a9f440a9b115fd147c0a147fc2fc73a67097992650a5cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:23.053149Z","signature_b64":"snHw/fEIhTLgNOS+lR6PzGEXipnNcGOsXRNMVhNKFLsLIuhnaJTJLccSpOselaENNFjjPyIU1ecRn76fssNPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c6037d1c25d3aed23594ed37439d9d2bfc62bdf6aa569c8ce45c47d042bedb1","last_reissued_at":"2026-05-17T23:40:23.052407Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:23.052407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Network Embedding: on Compression and Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Esra Akbas, Mehmet Aktas","submitted_at":"2019-07-05T13:22:02Z","abstract_excerpt":"Recently, network embedding that encodes structural information of graphs into a vector space has become popular for network analysis. Although recent methods show promising performance for various applications, the huge sizes of graphs may hinder a direct application of existing network embedding method to them. This paper presents NECL, a novel efficient Network Embedding method with two goals. 1) Is there an ideal Compression of a network? 2) Will the compression of a network significantly boost the representation Learning of the network? For the first problem, we propose a neighborhood sim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02811","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":""},"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":"1907.02811","created_at":"2026-05-17T23:40:23.052539+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.02811v2","created_at":"2026-05-17T23:40:23.052539+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02811","created_at":"2026-05-17T23:40:23.052539+00:00"},{"alias_kind":"pith_short_12","alias_value":"PRQDPUOCLU5O","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"PRQDPUOCLU5O2I2Z","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"PRQDPUOC","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.08708","citing_title":"Persistence Homology of Networks: Methods and Applications","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PRQDPUOCLU5O2I2ZJ3JXIOOZ2K","json":"https://pith.science/pith/PRQDPUOCLU5O2I2ZJ3JXIOOZ2K.json","graph_json":"https://pith.science/api/pith-number/PRQDPUOCLU5O2I2ZJ3JXIOOZ2K/graph.json","events_json":"https://pith.science/api/pith-number/PRQDPUOCLU5O2I2ZJ3JXIOOZ2K/events.json","paper":"https://pith.science/paper/PRQDPUOC"},"agent_actions":{"view_html":"https://pith.science/pith/PRQDPUOCLU5O2I2ZJ3JXIOOZ2K","download_json":"https://pith.science/pith/PRQDPUOCLU5O2I2ZJ3JXIOOZ2K.json","view_paper":"https://pith.science/paper/PRQDPUOC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.02811&json=true","fetch_graph":"https://pith.science/api/pith-number/PRQDPUOCLU5O2I2ZJ3JXIOOZ2K/graph.json","fetch_events":"https://pith.science/api/pith-number/PRQDPUOCLU5O2I2ZJ3JXIOOZ2K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PRQDPUOCLU5O2I2ZJ3JXIOOZ2K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PRQDPUOCLU5O2I2ZJ3JXIOOZ2K/action/storage_attestation","attest_author":"https://pith.science/pith/PRQDPUOCLU5O2I2ZJ3JXIOOZ2K/action/author_attestation","sign_citation":"https://pith.science/pith/PRQDPUOCLU5O2I2ZJ3JXIOOZ2K/action/citation_signature","submit_replication":"https://pith.science/pith/PRQDPUOCLU5O2I2ZJ3JXIOOZ2K/action/replication_record"}},"created_at":"2026-05-17T23:40:23.052539+00:00","updated_at":"2026-05-17T23:40:23.052539+00:00"}