{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RLPLEAESVICZBRUH6ZFSYOG7AE","short_pith_number":"pith:RLPLEAES","schema_version":"1.0","canonical_sha256":"8adeb20092aa0590c687f64b2c38df012addbecd9dd56733e44b778b76179610","source":{"kind":"arxiv","id":"1501.00067","version":1},"attestation_state":"computed","paper":{"title":"A Feasible Graph Partition Framework for Random Walks Implemented by Parallel Computing in Big Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Xiaohong Guan, Xiaoming Liu, Yadong Zhou","submitted_at":"2014-12-31T03:02:56Z","abstract_excerpt":"Graph partition is a fundamental problem of parallel computing for big graph data. Many graph partition algorithms have been proposed to solve the problem in various applications, such as matrix computations and PageRank, etc., but none has pay attention to random walks. Random walks is a widely used method to explore graph structure in lots of fields. The challenges of graph partition for random walks include the large number of times of communication between partitions, lots of replications of the vertices, unbalanced partition, etc. In this paper, we propose a feasible graph partition frame"},"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":"1501.00067","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-12-31T03:02:56Z","cross_cats_sorted":["cs.DC","physics.soc-ph"],"title_canon_sha256":"5b40735db3f4b8410068090ecdc72ab8d403703044aa369ab9f10c4bcfe8a527","abstract_canon_sha256":"6e7388030550d2e98c77e4792b79c6888764cf6abf5a1abdc2291d7bd82bb858"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:10.245526Z","signature_b64":"QlcFo7kGQ6720wlUSlNyVs8ov+oWKmGABQlttTTk9O3HRuMt8/zlftke60r3JauLKL8XinLcktBLSLYy+3BqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8adeb20092aa0590c687f64b2c38df012addbecd9dd56733e44b778b76179610","last_reissued_at":"2026-05-18T02:30:10.245052Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:10.245052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Feasible Graph Partition Framework for Random Walks Implemented by Parallel Computing in Big Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Xiaohong Guan, Xiaoming Liu, Yadong Zhou","submitted_at":"2014-12-31T03:02:56Z","abstract_excerpt":"Graph partition is a fundamental problem of parallel computing for big graph data. Many graph partition algorithms have been proposed to solve the problem in various applications, such as matrix computations and PageRank, etc., but none has pay attention to random walks. Random walks is a widely used method to explore graph structure in lots of fields. The challenges of graph partition for random walks include the large number of times of communication between partitions, lots of replications of the vertices, unbalanced partition, etc. In this paper, we propose a feasible graph partition frame"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00067","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":"1501.00067","created_at":"2026-05-18T02:30:10.245116+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.00067v1","created_at":"2026-05-18T02:30:10.245116+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00067","created_at":"2026-05-18T02:30:10.245116+00:00"},{"alias_kind":"pith_short_12","alias_value":"RLPLEAESVICZ","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RLPLEAESVICZBRUH","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RLPLEAES","created_at":"2026-05-18T12:28:46.137349+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/RLPLEAESVICZBRUH6ZFSYOG7AE","json":"https://pith.science/pith/RLPLEAESVICZBRUH6ZFSYOG7AE.json","graph_json":"https://pith.science/api/pith-number/RLPLEAESVICZBRUH6ZFSYOG7AE/graph.json","events_json":"https://pith.science/api/pith-number/RLPLEAESVICZBRUH6ZFSYOG7AE/events.json","paper":"https://pith.science/paper/RLPLEAES"},"agent_actions":{"view_html":"https://pith.science/pith/RLPLEAESVICZBRUH6ZFSYOG7AE","download_json":"https://pith.science/pith/RLPLEAESVICZBRUH6ZFSYOG7AE.json","view_paper":"https://pith.science/paper/RLPLEAES","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.00067&json=true","fetch_graph":"https://pith.science/api/pith-number/RLPLEAESVICZBRUH6ZFSYOG7AE/graph.json","fetch_events":"https://pith.science/api/pith-number/RLPLEAESVICZBRUH6ZFSYOG7AE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RLPLEAESVICZBRUH6ZFSYOG7AE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RLPLEAESVICZBRUH6ZFSYOG7AE/action/storage_attestation","attest_author":"https://pith.science/pith/RLPLEAESVICZBRUH6ZFSYOG7AE/action/author_attestation","sign_citation":"https://pith.science/pith/RLPLEAESVICZBRUH6ZFSYOG7AE/action/citation_signature","submit_replication":"https://pith.science/pith/RLPLEAESVICZBRUH6ZFSYOG7AE/action/replication_record"}},"created_at":"2026-05-18T02:30:10.245116+00:00","updated_at":"2026-05-18T02:30:10.245116+00:00"}