{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XM4S2VXOJG4OGFHACTEIBCMOJ7","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":"53405c413b6a39a3418fdf3a9921024fbe1abe33889d967ee3c143877c0f530c","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-10-14T15:37:07Z","title_canon_sha256":"d3ab263d7c688305f0e9f92f82ff363dc9d29fdd59e53029c01c2b7b5b135730"},"schema_version":"1.0","source":{"id":"1710.05199","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.05199","created_at":"2026-05-18T00:09:42Z"},{"alias_kind":"arxiv_version","alias_value":"1710.05199v2","created_at":"2026-05-18T00:09:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05199","created_at":"2026-05-18T00:09:42Z"},{"alias_kind":"pith_short_12","alias_value":"XM4S2VXOJG4O","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XM4S2VXOJG4OGFHA","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XM4S2VXO","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:4afd386306d5b5c33545e770c261e50924dd5fbfa006abca3bcfae5d7572c1e0","target":"graph","created_at":"2026-05-18T00:09:42Z","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":"Social network analysis provides meaningful information about behavior of network members that can be used for diverse applications such as classification, link prediction. However, network analysis is computationally expensive because of feature learning for different applications. In recent years, many researches have focused on feature learning methods in social networks. Network embedding represents the network in a lower dimensional representation space with the same properties which presents a compressed representation of the network. In this paper, we introduce a novel algorithm named \"","authors_text":"Maseud Rahgozar, Masoud Asadpour, Mohammad Mehdi Keikha","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-10-14T15:37:07Z","title":"Community Aware Random Walk for Network Embedding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05199","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:31977e5b0a920754265657b62f38b1cb27cf53eda24bad11df43af2364b24e50","target":"record","created_at":"2026-05-18T00:09:42Z","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":"53405c413b6a39a3418fdf3a9921024fbe1abe33889d967ee3c143877c0f530c","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-10-14T15:37:07Z","title_canon_sha256":"d3ab263d7c688305f0e9f92f82ff363dc9d29fdd59e53029c01c2b7b5b135730"},"schema_version":"1.0","source":{"id":"1710.05199","kind":"arxiv","version":2}},"canonical_sha256":"bb392d56ee49b8e314e014c880898e4ff8f484710f9d1b6904819568a9e87864","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb392d56ee49b8e314e014c880898e4ff8f484710f9d1b6904819568a9e87864","first_computed_at":"2026-05-18T00:09:42.051667Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:42.051667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WXa7XbCD2DzNiyjoIiBTl1gZYXrDGtd+EPUpJUIsWXXdo44tBdS/pMBMJNUirRO7siPUMLUYKQfLcOZTl6jZAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:42.052264Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.05199","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31977e5b0a920754265657b62f38b1cb27cf53eda24bad11df43af2364b24e50","sha256:4afd386306d5b5c33545e770c261e50924dd5fbfa006abca3bcfae5d7572c1e0"],"state_sha256":"72929b52e1fc4f967d479c1d47fc7db8151be40f90d323a8c7dcc7b3bbd0efb3"}