{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:P7KLV7GWEAB3IXHGABS2SNRON4","short_pith_number":"pith:P7KLV7GW","schema_version":"1.0","canonical_sha256":"7fd4bafcd62003b45ce60065a9362e6f048875a1a8274bcc9d54ca425195fcd0","source":{"kind":"arxiv","id":"1606.08928","version":1},"attestation_state":"computed","paper":{"title":"subgraph2vec: Learning Distributed Representations of Rooted Sub-graphs from Large Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CR","cs.SE"],"primary_cat":"cs.LG","authors_text":"Annamalai Narayanan, Lihui Chen, Mahinthan Chandramohan, Santhoshkumar Saminathan, Yang Liu","submitted_at":"2016-06-29T01:05:36Z","abstract_excerpt":"In this paper, we present subgraph2vec, a novel approach for learning latent representations of rooted subgraphs from large graphs inspired by recent advancements in Deep Learning and Graph Kernels. These latent representations encode semantic substructure dependencies in a continuous vector space, which is easily exploited by statistical models for tasks such as graph classification, clustering, link prediction and community detection. subgraph2vec leverages on local information obtained from neighbourhoods of nodes to learn their latent representations in an unsupervised fashion. We demonstr"},"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":"1606.08928","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-29T01:05:36Z","cross_cats_sorted":["cs.AI","cs.CR","cs.SE"],"title_canon_sha256":"d370100dbb6d3d8a4a265ea5c35c701a067dc31de1e218c6e8d161618dc1d12b","abstract_canon_sha256":"a7bcc1965de6c94f35336392f04e495dcc053ef647d1c13f29d7f638e57f3c8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:42.051229Z","signature_b64":"3T/pYX86Rkq8B5yXzTxyPEyq4h/gzJMJlGmiXTCLH04vDZz60pAlM0h3LUZmwFafkpH9b8sKpUJpYoBJH2yDDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fd4bafcd62003b45ce60065a9362e6f048875a1a8274bcc9d54ca425195fcd0","last_reissued_at":"2026-05-18T01:11:42.050889Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:42.050889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"subgraph2vec: Learning Distributed Representations of Rooted Sub-graphs from Large Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CR","cs.SE"],"primary_cat":"cs.LG","authors_text":"Annamalai Narayanan, Lihui Chen, Mahinthan Chandramohan, Santhoshkumar Saminathan, Yang Liu","submitted_at":"2016-06-29T01:05:36Z","abstract_excerpt":"In this paper, we present subgraph2vec, a novel approach for learning latent representations of rooted subgraphs from large graphs inspired by recent advancements in Deep Learning and Graph Kernels. These latent representations encode semantic substructure dependencies in a continuous vector space, which is easily exploited by statistical models for tasks such as graph classification, clustering, link prediction and community detection. subgraph2vec leverages on local information obtained from neighbourhoods of nodes to learn their latent representations in an unsupervised fashion. We demonstr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08928","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":"1606.08928","created_at":"2026-05-18T01:11:42.050945+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.08928v1","created_at":"2026-05-18T01:11:42.050945+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08928","created_at":"2026-05-18T01:11:42.050945+00:00"},{"alias_kind":"pith_short_12","alias_value":"P7KLV7GWEAB3","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"P7KLV7GWEAB3IXHG","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"P7KLV7GW","created_at":"2026-05-18T12:30:39.010887+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/P7KLV7GWEAB3IXHGABS2SNRON4","json":"https://pith.science/pith/P7KLV7GWEAB3IXHGABS2SNRON4.json","graph_json":"https://pith.science/api/pith-number/P7KLV7GWEAB3IXHGABS2SNRON4/graph.json","events_json":"https://pith.science/api/pith-number/P7KLV7GWEAB3IXHGABS2SNRON4/events.json","paper":"https://pith.science/paper/P7KLV7GW"},"agent_actions":{"view_html":"https://pith.science/pith/P7KLV7GWEAB3IXHGABS2SNRON4","download_json":"https://pith.science/pith/P7KLV7GWEAB3IXHGABS2SNRON4.json","view_paper":"https://pith.science/paper/P7KLV7GW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.08928&json=true","fetch_graph":"https://pith.science/api/pith-number/P7KLV7GWEAB3IXHGABS2SNRON4/graph.json","fetch_events":"https://pith.science/api/pith-number/P7KLV7GWEAB3IXHGABS2SNRON4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P7KLV7GWEAB3IXHGABS2SNRON4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P7KLV7GWEAB3IXHGABS2SNRON4/action/storage_attestation","attest_author":"https://pith.science/pith/P7KLV7GWEAB3IXHGABS2SNRON4/action/author_attestation","sign_citation":"https://pith.science/pith/P7KLV7GWEAB3IXHGABS2SNRON4/action/citation_signature","submit_replication":"https://pith.science/pith/P7KLV7GWEAB3IXHGABS2SNRON4/action/replication_record"}},"created_at":"2026-05-18T01:11:42.050945+00:00","updated_at":"2026-05-18T01:11:42.050945+00:00"}