{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7BWTQOHPCL5XSANDXCSK5WPR7Y","short_pith_number":"pith:7BWTQOHP","canonical_record":{"source":{"id":"1808.04657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-08-14T12:35:28Z","cross_cats_sorted":[],"title_canon_sha256":"39edbdadb5979c9701acad47ebefbfd7b11cb5437640983e42e3ad018c55befe","abstract_canon_sha256":"b60dc063caab7910f5be445da653047485e9c5f49b1a10815edb380fa6b694c1"},"schema_version":"1.0"},"canonical_sha256":"f86d3838ef12fb7901a3b8a4aed9f1fe3ab63ab6709b8066393005d36c63c925","source":{"kind":"arxiv","id":"1808.04657","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04657","created_at":"2026-05-18T00:07:56Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04657v1","created_at":"2026-05-18T00:07:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04657","created_at":"2026-05-18T00:07:56Z"},{"alias_kind":"pith_short_12","alias_value":"7BWTQOHPCL5X","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7BWTQOHPCL5XSAND","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7BWTQOHP","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7BWTQOHPCL5XSANDXCSK5WPR7Y","target":"record","payload":{"canonical_record":{"source":{"id":"1808.04657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-08-14T12:35:28Z","cross_cats_sorted":[],"title_canon_sha256":"39edbdadb5979c9701acad47ebefbfd7b11cb5437640983e42e3ad018c55befe","abstract_canon_sha256":"b60dc063caab7910f5be445da653047485e9c5f49b1a10815edb380fa6b694c1"},"schema_version":"1.0"},"canonical_sha256":"f86d3838ef12fb7901a3b8a4aed9f1fe3ab63ab6709b8066393005d36c63c925","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:56.337286Z","signature_b64":"pnn+U1tD5JwVMKya5uCHlgMv0D6z54tEEKoxdGDNiwp0IgoXsviPtfuSGhuDro2XD7XDMnQd68P7Hzbns/CbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f86d3838ef12fb7901a3b8a4aed9f1fe3ab63ab6709b8066393005d36c63c925","last_reissued_at":"2026-05-18T00:07:56.336652Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:56.336652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.04657","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:07:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GohdMg8mISGv3lShzK6oannj5mvyem8BelPvDfYY7nPjhFRGnvR62ef8OP9GWrqCg6gF7T2QdRfrqpbQApYtCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T12:28:55.696222Z"},"content_sha256":"251d8ee925d5e3635aec2870a29236d4112ef40a41348ea2428aa0894e370e18","schema_version":"1.0","event_id":"sha256:251d8ee925d5e3635aec2870a29236d4112ef40a41348ea2428aa0894e370e18"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7BWTQOHPCL5XSANDXCSK5WPR7Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network Sampling Using K-hop Random Walks for Heterogeneous Network Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Ajay Ladhar, Akash Anil, Sanasam Ranbir Singh, Sandeep Singh, Uppinder Chugh","submitted_at":"2018-08-14T12:35:28Z","abstract_excerpt":"Sampling a network is an important prerequisite for unsupervised network embedding. Further, random walk has widely been used for sampling in previous studies. Since random walk based sampling tends to traverse adjacent neighbors, it may not be suitable for heterogeneous network because in heterogeneous networks two adjacent nodes often belong to different types. Therefore, this paper proposes a K-hop random walk based sampling approach which includes a node in the sample list only if it is separated by K hops from the source node. We exploit the samples generated using K-hop random walker for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04657","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:07:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+xESQJHY8t8AfcsnKQMdYXtnQDPLVTq5VdX6ZjZWYGRH2O6xL2gkfmopXbULnxGqohfqnQtAlu5PD95FzIZEAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T12:28:55.696582Z"},"content_sha256":"8f27b065bc6a5e36d037c2eebda750b673ec16ddba59725dcfaaa4eb75dbee0b","schema_version":"1.0","event_id":"sha256:8f27b065bc6a5e36d037c2eebda750b673ec16ddba59725dcfaaa4eb75dbee0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7BWTQOHPCL5XSANDXCSK5WPR7Y/bundle.json","state_url":"https://pith.science/pith/7BWTQOHPCL5XSANDXCSK5WPR7Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7BWTQOHPCL5XSANDXCSK5WPR7Y/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-06-26T12:28:55Z","links":{"resolver":"https://pith.science/pith/7BWTQOHPCL5XSANDXCSK5WPR7Y","bundle":"https://pith.science/pith/7BWTQOHPCL5XSANDXCSK5WPR7Y/bundle.json","state":"https://pith.science/pith/7BWTQOHPCL5XSANDXCSK5WPR7Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7BWTQOHPCL5XSANDXCSK5WPR7Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7BWTQOHPCL5XSANDXCSK5WPR7Y","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":"b60dc063caab7910f5be445da653047485e9c5f49b1a10815edb380fa6b694c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-08-14T12:35:28Z","title_canon_sha256":"39edbdadb5979c9701acad47ebefbfd7b11cb5437640983e42e3ad018c55befe"},"schema_version":"1.0","source":{"id":"1808.04657","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04657","created_at":"2026-05-18T00:07:56Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04657v1","created_at":"2026-05-18T00:07:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04657","created_at":"2026-05-18T00:07:56Z"},{"alias_kind":"pith_short_12","alias_value":"7BWTQOHPCL5X","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7BWTQOHPCL5XSAND","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7BWTQOHP","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:8f27b065bc6a5e36d037c2eebda750b673ec16ddba59725dcfaaa4eb75dbee0b","target":"graph","created_at":"2026-05-18T00:07:56Z","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":"Sampling a network is an important prerequisite for unsupervised network embedding. Further, random walk has widely been used for sampling in previous studies. Since random walk based sampling tends to traverse adjacent neighbors, it may not be suitable for heterogeneous network because in heterogeneous networks two adjacent nodes often belong to different types. Therefore, this paper proposes a K-hop random walk based sampling approach which includes a node in the sample list only if it is separated by K hops from the source node. We exploit the samples generated using K-hop random walker for","authors_text":"Ajay Ladhar, Akash Anil, Sanasam Ranbir Singh, Sandeep Singh, Uppinder Chugh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-08-14T12:35:28Z","title":"Network Sampling Using K-hop Random Walks for Heterogeneous Network Embedding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04657","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:251d8ee925d5e3635aec2870a29236d4112ef40a41348ea2428aa0894e370e18","target":"record","created_at":"2026-05-18T00:07:56Z","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":"b60dc063caab7910f5be445da653047485e9c5f49b1a10815edb380fa6b694c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-08-14T12:35:28Z","title_canon_sha256":"39edbdadb5979c9701acad47ebefbfd7b11cb5437640983e42e3ad018c55befe"},"schema_version":"1.0","source":{"id":"1808.04657","kind":"arxiv","version":1}},"canonical_sha256":"f86d3838ef12fb7901a3b8a4aed9f1fe3ab63ab6709b8066393005d36c63c925","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f86d3838ef12fb7901a3b8a4aed9f1fe3ab63ab6709b8066393005d36c63c925","first_computed_at":"2026-05-18T00:07:56.336652Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:56.336652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pnn+U1tD5JwVMKya5uCHlgMv0D6z54tEEKoxdGDNiwp0IgoXsviPtfuSGhuDro2XD7XDMnQd68P7Hzbns/CbCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:56.337286Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.04657","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:251d8ee925d5e3635aec2870a29236d4112ef40a41348ea2428aa0894e370e18","sha256:8f27b065bc6a5e36d037c2eebda750b673ec16ddba59725dcfaaa4eb75dbee0b"],"state_sha256":"f39f04efa3ef1687ecf98839606c1b0b43caf27f827eaad4be978ac26d62531b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JOspnXEe9+lK1rvAbIhC7w8bTDaEI2Kbzk9lzw3XjzNBpKCF45nBKhQxC7F8nMBhhAB6QykcsPQ6Cl5U1ZqDDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T12:28:55.698543Z","bundle_sha256":"3f61897268e7e5b1f15aca1bc340d8a190d34dea88bd982b67700a35877ccf84"}}