{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:NLIIFPO7CG4Q4JOYPAYYWL5VLJ","short_pith_number":"pith:NLIIFPO7","schema_version":"1.0","canonical_sha256":"6ad082bddf11b90e25d878318b2fb55a75ff4525954cbf588b7b03ab176edcd7","source":{"kind":"arxiv","id":"2307.01637","version":1},"attestation_state":"computed","paper":{"title":"Random Walk on Multiple Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.IR"],"primary_cat":"cs.SI","authors_text":"Dongsheng Luo, Jun Huan, Xiang Zhang, Xiao Liu, Xiong Yu, Yaowei Yan, Yuchen Bian","submitted_at":"2023-07-04T10:45:11Z","abstract_excerpt":"Random Walk is a basic algorithm to explore the structure of networks, which can be used in many tasks, such as local community detection and network embedding. Existing random walk methods are based on single networks that contain limited information. In contrast, real data often contain entities with different types or/and from different sources, which are comprehensive and can be better modeled by multiple networks. To take advantage of rich information in multiple networks and make better inferences on entities, in this study, we propose random walk on multiple networks, RWM. RWM is flexib"},"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":"2307.01637","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2023-07-04T10:45:11Z","cross_cats_sorted":["cs.AI","cs.IR"],"title_canon_sha256":"f33319e453c28a8d624775672ba28661cbee0edf5fc92784c0fce9658a34f8cb","abstract_canon_sha256":"0a992dc37b5a093ec8bdb39803ae72b976ca4fd5b8512c06cb43b7fd97d6e3c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:27:59.054629Z","signature_b64":"9hl1iYjlU0aWcoDaWlaSiiowp5knhEfZwjoYypZ9muyBwgdcmkp2KWhoFG7X+yVILmFrBUiI+beNMyjUt485Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ad082bddf11b90e25d878318b2fb55a75ff4525954cbf588b7b03ab176edcd7","last_reissued_at":"2026-07-05T06:27:59.054075Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:27:59.054075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random Walk on Multiple Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.IR"],"primary_cat":"cs.SI","authors_text":"Dongsheng Luo, Jun Huan, Xiang Zhang, Xiao Liu, Xiong Yu, Yaowei Yan, Yuchen Bian","submitted_at":"2023-07-04T10:45:11Z","abstract_excerpt":"Random Walk is a basic algorithm to explore the structure of networks, which can be used in many tasks, such as local community detection and network embedding. Existing random walk methods are based on single networks that contain limited information. In contrast, real data often contain entities with different types or/and from different sources, which are comprehensive and can be better modeled by multiple networks. To take advantage of rich information in multiple networks and make better inferences on entities, in this study, we propose random walk on multiple networks, RWM. RWM is flexib"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.01637","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.01637/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2307.01637","created_at":"2026-07-05T06:27:59.054133+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.01637v1","created_at":"2026-07-05T06:27:59.054133+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.01637","created_at":"2026-07-05T06:27:59.054133+00:00"},{"alias_kind":"pith_short_12","alias_value":"NLIIFPO7CG4Q","created_at":"2026-07-05T06:27:59.054133+00:00"},{"alias_kind":"pith_short_16","alias_value":"NLIIFPO7CG4Q4JOY","created_at":"2026-07-05T06:27:59.054133+00:00"},{"alias_kind":"pith_short_8","alias_value":"NLIIFPO7","created_at":"2026-07-05T06:27:59.054133+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/NLIIFPO7CG4Q4JOYPAYYWL5VLJ","json":"https://pith.science/pith/NLIIFPO7CG4Q4JOYPAYYWL5VLJ.json","graph_json":"https://pith.science/api/pith-number/NLIIFPO7CG4Q4JOYPAYYWL5VLJ/graph.json","events_json":"https://pith.science/api/pith-number/NLIIFPO7CG4Q4JOYPAYYWL5VLJ/events.json","paper":"https://pith.science/paper/NLIIFPO7"},"agent_actions":{"view_html":"https://pith.science/pith/NLIIFPO7CG4Q4JOYPAYYWL5VLJ","download_json":"https://pith.science/pith/NLIIFPO7CG4Q4JOYPAYYWL5VLJ.json","view_paper":"https://pith.science/paper/NLIIFPO7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.01637&json=true","fetch_graph":"https://pith.science/api/pith-number/NLIIFPO7CG4Q4JOYPAYYWL5VLJ/graph.json","fetch_events":"https://pith.science/api/pith-number/NLIIFPO7CG4Q4JOYPAYYWL5VLJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NLIIFPO7CG4Q4JOYPAYYWL5VLJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NLIIFPO7CG4Q4JOYPAYYWL5VLJ/action/storage_attestation","attest_author":"https://pith.science/pith/NLIIFPO7CG4Q4JOYPAYYWL5VLJ/action/author_attestation","sign_citation":"https://pith.science/pith/NLIIFPO7CG4Q4JOYPAYYWL5VLJ/action/citation_signature","submit_replication":"https://pith.science/pith/NLIIFPO7CG4Q4JOYPAYYWL5VLJ/action/replication_record"}},"created_at":"2026-07-05T06:27:59.054133+00:00","updated_at":"2026-07-05T06:27:59.054133+00:00"}