{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:PRQDPUOCLU5O2I2ZJ3JXIOOZ2K","short_pith_number":"pith:PRQDPUOC","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"},"canonical_sha256":"7c6037d1c25d3aed23594ed37439d9d2bfc62bdf6aa569c8ce45c47d042bedb1","source":{"kind":"arxiv","id":"1907.02811","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02811","created_at":"2026-05-17T23:40:23Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02811v2","created_at":"2026-05-17T23:40:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02811","created_at":"2026-05-17T23:40:23Z"},{"alias_kind":"pith_short_12","alias_value":"PRQDPUOCLU5O","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PRQDPUOCLU5O2I2Z","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PRQDPUOC","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:PRQDPUOCLU5O2I2ZJ3JXIOOZ2K","target":"record","payload":{"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"},"canonical_sha256":"7c6037d1c25d3aed23594ed37439d9d2bfc62bdf6aa569c8ce45c47d042bedb1","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"},"source_kind":"arxiv","source_id":"1907.02811","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:40:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ajaREVzMldfQnAMsNTZIxUvVsqAoJU9xLKTn7RvOuiUYNdlVDka2DSlHHj2PhssSt1+7bz6+rv4EZPrvYBzhDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:27:28.799037Z"},"content_sha256":"65aad1b28bd8b4b35ac2ddc44d3e7db2f85dde45247365fdbf4c07c5f72d9b52","schema_version":"1.0","event_id":"sha256:65aad1b28bd8b4b35ac2ddc44d3e7db2f85dde45247365fdbf4c07c5f72d9b52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:PRQDPUOCLU5O2I2ZJ3JXIOOZ2K","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:40:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iI4ni71VVNUroLDMTCVC3FoBLbtmzy0SS6YchUdadg77tTz/vVvYZ1+xwFcIL3ihU09L37BOdwIlWchBARGyDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:27:28.799701Z"},"content_sha256":"96c337ca8eedffacaf0d06bc82ea072f718efa40cc7aa5a600c913413479e6f0","schema_version":"1.0","event_id":"sha256:96c337ca8eedffacaf0d06bc82ea072f718efa40cc7aa5a600c913413479e6f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PRQDPUOCLU5O2I2ZJ3JXIOOZ2K/bundle.json","state_url":"https://pith.science/pith/PRQDPUOCLU5O2I2ZJ3JXIOOZ2K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PRQDPUOCLU5O2I2ZJ3JXIOOZ2K/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T17:27:28Z","links":{"resolver":"https://pith.science/pith/PRQDPUOCLU5O2I2ZJ3JXIOOZ2K","bundle":"https://pith.science/pith/PRQDPUOCLU5O2I2ZJ3JXIOOZ2K/bundle.json","state":"https://pith.science/pith/PRQDPUOCLU5O2I2ZJ3JXIOOZ2K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PRQDPUOCLU5O2I2ZJ3JXIOOZ2K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PRQDPUOCLU5O2I2ZJ3JXIOOZ2K","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6717762d8821016178a9f440a9b115fd147c0a147fc2fc73a67097992650a5cf","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2019-07-05T13:22:02Z","title_canon_sha256":"8ec3e1b04bbcd99d8ef00add0fcc5a28549ba24c52f7bc4bd0460706ff2f1a5d"},"schema_version":"1.0","source":{"id":"1907.02811","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02811","created_at":"2026-05-17T23:40:23Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02811v2","created_at":"2026-05-17T23:40:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02811","created_at":"2026-05-17T23:40:23Z"},{"alias_kind":"pith_short_12","alias_value":"PRQDPUOCLU5O","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PRQDPUOCLU5O2I2Z","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PRQDPUOC","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:96c337ca8eedffacaf0d06bc82ea072f718efa40cc7aa5a600c913413479e6f0","target":"graph","created_at":"2026-05-17T23:40:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Esra Akbas, Mehmet Aktas","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2019-07-05T13:22:02Z","title":"Network Embedding: on Compression and Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02811","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:65aad1b28bd8b4b35ac2ddc44d3e7db2f85dde45247365fdbf4c07c5f72d9b52","target":"record","created_at":"2026-05-17T23:40:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6717762d8821016178a9f440a9b115fd147c0a147fc2fc73a67097992650a5cf","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2019-07-05T13:22:02Z","title_canon_sha256":"8ec3e1b04bbcd99d8ef00add0fcc5a28549ba24c52f7bc4bd0460706ff2f1a5d"},"schema_version":"1.0","source":{"id":"1907.02811","kind":"arxiv","version":2}},"canonical_sha256":"7c6037d1c25d3aed23594ed37439d9d2bfc62bdf6aa569c8ce45c47d042bedb1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c6037d1c25d3aed23594ed37439d9d2bfc62bdf6aa569c8ce45c47d042bedb1","first_computed_at":"2026-05-17T23:40:23.052407Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:23.052407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"snHw/fEIhTLgNOS+lR6PzGEXipnNcGOsXRNMVhNKFLsLIuhnaJTJLccSpOselaENNFjjPyIU1ecRn76fssNPAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:23.053149Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.02811","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65aad1b28bd8b4b35ac2ddc44d3e7db2f85dde45247365fdbf4c07c5f72d9b52","sha256:96c337ca8eedffacaf0d06bc82ea072f718efa40cc7aa5a600c913413479e6f0"],"state_sha256":"7e9e16b29eaa3f4f945a8f5e9620afda829f83a63c5bc7edf1264d209bd17cda"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wqLxbzzto57VJGF2A07gHHF4mhENILQLyvl0chtfqrOFllHz42bhnnnrc0+hAEQZc1pxWe3xLqV8Wh9+fXPaCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:27:28.802973Z","bundle_sha256":"eb9bc659926144120001a50b618bcc9877ff4fda0c0f352a13c1bc4dc43622ad"}}