{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZNJAL4IMXA5DFP6UQLVBMMOS7P","short_pith_number":"pith:ZNJAL4IM","schema_version":"1.0","canonical_sha256":"cb5205f10cb83a32bfd482ea1631d2fbc3bab255af002795d7c0a862be77cb26","source":{"kind":"arxiv","id":"1710.06520","version":1},"attestation_state":"computed","paper":{"title":"LASAGNE: Locality And Structure Aware Graph Node Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Evgeniy Faerman, Felix Borutta, Kimon Fountoulakis, Michael W. Mahoney","submitted_at":"2017-10-17T22:44:18Z","abstract_excerpt":"In this work we propose Lasagne, a methodology to learn locality and structure aware graph node embeddings in an unsupervised way. In particular, we show that the performance of existing random-walk based approaches depends strongly on the structural properties of the graph, e.g., the size of the graph, whether the graph has a flat or upward-sloping Network Community Profile (NCP), whether the graph is expander-like, whether the classes of interest are more k-core-like or more peripheral, etc. For larger graphs with flat NCPs that are strongly expander-like, existing methods lead to random wal"},"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":"1710.06520","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-10-17T22:44:18Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9d6f3535d956b9dd777a2a246434bac233b9095b7a59679fc5216de76cc3b3ec","abstract_canon_sha256":"d4df01250529b2392567076acfa0c9aa0455c8b28ce4b461d66b3428d2da8509"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:33.483173Z","signature_b64":"SFdFpTVrP4JHJW4Rmh4ogCqGDccq2i5aGk8efn9MNMAUjiyQDn4LnNZaIs0ngTgXg0OaR559DeKdj68IoLLaCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb5205f10cb83a32bfd482ea1631d2fbc3bab255af002795d7c0a862be77cb26","last_reissued_at":"2026-05-18T00:32:33.482552Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:33.482552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LASAGNE: Locality And Structure Aware Graph Node Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Evgeniy Faerman, Felix Borutta, Kimon Fountoulakis, Michael W. Mahoney","submitted_at":"2017-10-17T22:44:18Z","abstract_excerpt":"In this work we propose Lasagne, a methodology to learn locality and structure aware graph node embeddings in an unsupervised way. In particular, we show that the performance of existing random-walk based approaches depends strongly on the structural properties of the graph, e.g., the size of the graph, whether the graph has a flat or upward-sloping Network Community Profile (NCP), whether the graph is expander-like, whether the classes of interest are more k-core-like or more peripheral, etc. For larger graphs with flat NCPs that are strongly expander-like, existing methods lead to random wal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06520","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":"1710.06520","created_at":"2026-05-18T00:32:33.482663+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.06520v1","created_at":"2026-05-18T00:32:33.482663+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06520","created_at":"2026-05-18T00:32:33.482663+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZNJAL4IMXA5D","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZNJAL4IMXA5DFP6U","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZNJAL4IM","created_at":"2026-05-18T12:31:59.375834+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/ZNJAL4IMXA5DFP6UQLVBMMOS7P","json":"https://pith.science/pith/ZNJAL4IMXA5DFP6UQLVBMMOS7P.json","graph_json":"https://pith.science/api/pith-number/ZNJAL4IMXA5DFP6UQLVBMMOS7P/graph.json","events_json":"https://pith.science/api/pith-number/ZNJAL4IMXA5DFP6UQLVBMMOS7P/events.json","paper":"https://pith.science/paper/ZNJAL4IM"},"agent_actions":{"view_html":"https://pith.science/pith/ZNJAL4IMXA5DFP6UQLVBMMOS7P","download_json":"https://pith.science/pith/ZNJAL4IMXA5DFP6UQLVBMMOS7P.json","view_paper":"https://pith.science/paper/ZNJAL4IM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.06520&json=true","fetch_graph":"https://pith.science/api/pith-number/ZNJAL4IMXA5DFP6UQLVBMMOS7P/graph.json","fetch_events":"https://pith.science/api/pith-number/ZNJAL4IMXA5DFP6UQLVBMMOS7P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZNJAL4IMXA5DFP6UQLVBMMOS7P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZNJAL4IMXA5DFP6UQLVBMMOS7P/action/storage_attestation","attest_author":"https://pith.science/pith/ZNJAL4IMXA5DFP6UQLVBMMOS7P/action/author_attestation","sign_citation":"https://pith.science/pith/ZNJAL4IMXA5DFP6UQLVBMMOS7P/action/citation_signature","submit_replication":"https://pith.science/pith/ZNJAL4IMXA5DFP6UQLVBMMOS7P/action/replication_record"}},"created_at":"2026-05-18T00:32:33.482663+00:00","updated_at":"2026-05-18T00:32:33.482663+00:00"}