{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RJBNIJRK4CB6ZFM4JBK34DZWPB","short_pith_number":"pith:RJBNIJRK","canonical_record":{"source":{"id":"1702.06921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-02-22T18:06:13Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"3761317b236a778eed1bb830c623de20241a626a58ee9616b1e51b33fe25575e","abstract_canon_sha256":"736f3131e673df2370d0f9629b13d54101f00e10f014accb1970ed1bc0359a76"},"schema_version":"1.0"},"canonical_sha256":"8a42d4262ae083ec959c4855be0f367869164dfb0d97c2e79513753e2960376b","source":{"kind":"arxiv","id":"1702.06921","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06921","created_at":"2026-05-18T00:50:10Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06921v1","created_at":"2026-05-18T00:50:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06921","created_at":"2026-05-18T00:50:10Z"},{"alias_kind":"pith_short_12","alias_value":"RJBNIJRK4CB6","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RJBNIJRK4CB6ZFM4","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RJBNIJRK","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RJBNIJRK4CB6ZFM4JBK34DZWPB","target":"record","payload":{"canonical_record":{"source":{"id":"1702.06921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-02-22T18:06:13Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"3761317b236a778eed1bb830c623de20241a626a58ee9616b1e51b33fe25575e","abstract_canon_sha256":"736f3131e673df2370d0f9629b13d54101f00e10f014accb1970ed1bc0359a76"},"schema_version":"1.0"},"canonical_sha256":"8a42d4262ae083ec959c4855be0f367869164dfb0d97c2e79513753e2960376b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:10.127951Z","signature_b64":"ssLtgZ23jvsbQSRmOGpRliBdWfplCHzs7dUIyYMoKtVm2qaMAO+SVuZ8ZiWgNlyVRPZ/0veYafdxJ7I9UDdTCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a42d4262ae083ec959c4855be0f367869164dfb0d97c2e79513753e2960376b","last_reissued_at":"2026-05-18T00:50:10.127203Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:10.127203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.06921","source_version":1,"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-18T00:50:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Sz8jPFMz4lZCN0lYw3F4UPt0kYXKoOPWfIcqwm0qPUQLOsgN+1wC+El+oMTAOGpmzZsj7tuyV7AzoDr+hksDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:03:47.477434Z"},"content_sha256":"c46d73cfd09d0eee6331aded6ef04eeb7e2fa5b5fe6fac0a48351005d571a838","schema_version":"1.0","event_id":"sha256:c46d73cfd09d0eee6331aded6ef04eeb7e2fa5b5fe6fac0a48351005d571a838"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RJBNIJRK4CB6ZFM4JBK34DZWPB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Representation of Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SI","authors_text":"B. Aditya Prakash, Bijaya Adhikari, Naren Ramakrishnan, Yao Zhang","submitted_at":"2017-02-22T18:06:13Z","abstract_excerpt":"Network embeddings have become very popular in learning effective feature representations of networks. Motivated by the recent successes of embeddings in natural language processing, researchers have tried to find network embeddings in order to exploit machine learning algorithms for mining tasks like node classification and edge prediction. However, most of the work focuses on finding distributed representations of nodes, which are inherently ill-suited to tasks such as community detection which are intuitively dependent on subgraphs.\n  Here, we propose sub2vec, an unsupervised scalable algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06921","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"},"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-18T00:50:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mcqkd6JTJ7nldl9wRKds+1B7ZirTgFFWEh+fkKOhUR9uHnpArktlzE9qO90pOeHWxQ8LORrVcnlH9dyG2ZAFAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:03:47.478033Z"},"content_sha256":"e6129887bfb8defd100ab1bf9b6a27c805c2957d2615bc37706cc5828316df14","schema_version":"1.0","event_id":"sha256:e6129887bfb8defd100ab1bf9b6a27c805c2957d2615bc37706cc5828316df14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RJBNIJRK4CB6ZFM4JBK34DZWPB/bundle.json","state_url":"https://pith.science/pith/RJBNIJRK4CB6ZFM4JBK34DZWPB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RJBNIJRK4CB6ZFM4JBK34DZWPB/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-28T05:03:47Z","links":{"resolver":"https://pith.science/pith/RJBNIJRK4CB6ZFM4JBK34DZWPB","bundle":"https://pith.science/pith/RJBNIJRK4CB6ZFM4JBK34DZWPB/bundle.json","state":"https://pith.science/pith/RJBNIJRK4CB6ZFM4JBK34DZWPB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RJBNIJRK4CB6ZFM4JBK34DZWPB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RJBNIJRK4CB6ZFM4JBK34DZWPB","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":"736f3131e673df2370d0f9629b13d54101f00e10f014accb1970ed1bc0359a76","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-02-22T18:06:13Z","title_canon_sha256":"3761317b236a778eed1bb830c623de20241a626a58ee9616b1e51b33fe25575e"},"schema_version":"1.0","source":{"id":"1702.06921","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06921","created_at":"2026-05-18T00:50:10Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06921v1","created_at":"2026-05-18T00:50:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06921","created_at":"2026-05-18T00:50:10Z"},{"alias_kind":"pith_short_12","alias_value":"RJBNIJRK4CB6","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RJBNIJRK4CB6ZFM4","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RJBNIJRK","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:e6129887bfb8defd100ab1bf9b6a27c805c2957d2615bc37706cc5828316df14","target":"graph","created_at":"2026-05-18T00:50:10Z","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":"Network embeddings have become very popular in learning effective feature representations of networks. Motivated by the recent successes of embeddings in natural language processing, researchers have tried to find network embeddings in order to exploit machine learning algorithms for mining tasks like node classification and edge prediction. However, most of the work focuses on finding distributed representations of nodes, which are inherently ill-suited to tasks such as community detection which are intuitively dependent on subgraphs.\n  Here, we propose sub2vec, an unsupervised scalable algor","authors_text":"B. Aditya Prakash, Bijaya Adhikari, Naren Ramakrishnan, Yao Zhang","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-02-22T18:06:13Z","title":"Distributed Representation of Subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06921","kind":"arxiv","version":1},"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:c46d73cfd09d0eee6331aded6ef04eeb7e2fa5b5fe6fac0a48351005d571a838","target":"record","created_at":"2026-05-18T00:50:10Z","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":"736f3131e673df2370d0f9629b13d54101f00e10f014accb1970ed1bc0359a76","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-02-22T18:06:13Z","title_canon_sha256":"3761317b236a778eed1bb830c623de20241a626a58ee9616b1e51b33fe25575e"},"schema_version":"1.0","source":{"id":"1702.06921","kind":"arxiv","version":1}},"canonical_sha256":"8a42d4262ae083ec959c4855be0f367869164dfb0d97c2e79513753e2960376b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a42d4262ae083ec959c4855be0f367869164dfb0d97c2e79513753e2960376b","first_computed_at":"2026-05-18T00:50:10.127203Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:10.127203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ssLtgZ23jvsbQSRmOGpRliBdWfplCHzs7dUIyYMoKtVm2qaMAO+SVuZ8ZiWgNlyVRPZ/0veYafdxJ7I9UDdTCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:10.127951Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.06921","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c46d73cfd09d0eee6331aded6ef04eeb7e2fa5b5fe6fac0a48351005d571a838","sha256:e6129887bfb8defd100ab1bf9b6a27c805c2957d2615bc37706cc5828316df14"],"state_sha256":"8d3cd2168fddd0b4b4923abf0a59ef0e8177c5c09e37bc08cf8d200dad367ea3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Doq4c5auc1pzCh2UCh2iNPpPHlDeLW6NmkwOQZTnxBEtgQ1CbCu5T0gbrDxtJm7Bv9rb/2evujU/3UDgHFmCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T05:03:47.482365Z","bundle_sha256":"e71b9284529fa290edd89584674850636ba7b74d37cfeadbded2f36b4bde8384"}}