{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WC4PQ2T4S4VWRIPPGP6QYA3MFZ","short_pith_number":"pith:WC4PQ2T4","schema_version":"1.0","canonical_sha256":"b0b8f86a7c972b68a1ef33fd0c036c2e668816515b379f6922100331582c026f","source":{"kind":"arxiv","id":"1312.3020","version":1},"attestation_state":"computed","paper":{"title":"Sparse Allreduce: Efficient Scalable Communication for Power-Law Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MS"],"primary_cat":"cs.DC","authors_text":"Huasha Zhao, John Canny","submitted_at":"2013-12-11T02:33:45Z","abstract_excerpt":"Many large datasets exhibit power-law statistics: The web graph, social networks, text data, click through data etc. Their adjacency graphs are termed natural graphs, and are known to be difficult to partition. As a consequence most distributed algorithms on these graphs are communication intensive. Many algorithms on natural graphs involve an Allreduce: a sum or average of partitioned data which is then shared back to the cluster nodes. Examples include PageRank, spectral partitioning, and many machine learning algorithms including regression, factor (topic) models, and clustering. In this pa"},"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":"1312.3020","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-11T02:33:45Z","cross_cats_sorted":["cs.AI","cs.MS"],"title_canon_sha256":"53f6d978a9b41afa17e13b2e728791b423119baaa240eecefa30cc5dec7ff430","abstract_canon_sha256":"d02a3f349480673691d0fb558393376b4a24995f28bc8ed018de484d49916a70"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:00.763250Z","signature_b64":"n6qnMbIKvdfDVa4/n9EokNHZ49YyUOXW6uzxKioa3GdSAUiLiAfMuNUFzxkW+xSukIme3UxXjDyiwaFwARR7Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0b8f86a7c972b68a1ef33fd0c036c2e668816515b379f6922100331582c026f","last_reissued_at":"2026-05-18T03:05:00.762817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:00.762817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Allreduce: Efficient Scalable Communication for Power-Law Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MS"],"primary_cat":"cs.DC","authors_text":"Huasha Zhao, John Canny","submitted_at":"2013-12-11T02:33:45Z","abstract_excerpt":"Many large datasets exhibit power-law statistics: The web graph, social networks, text data, click through data etc. Their adjacency graphs are termed natural graphs, and are known to be difficult to partition. As a consequence most distributed algorithms on these graphs are communication intensive. Many algorithms on natural graphs involve an Allreduce: a sum or average of partitioned data which is then shared back to the cluster nodes. Examples include PageRank, spectral partitioning, and many machine learning algorithms including regression, factor (topic) models, and clustering. In this pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3020","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":"1312.3020","created_at":"2026-05-18T03:05:00.762878+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.3020v1","created_at":"2026-05-18T03:05:00.762878+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3020","created_at":"2026-05-18T03:05:00.762878+00:00"},{"alias_kind":"pith_short_12","alias_value":"WC4PQ2T4S4VW","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"WC4PQ2T4S4VWRIPP","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"WC4PQ2T4","created_at":"2026-05-18T12:28:04.890932+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/WC4PQ2T4S4VWRIPPGP6QYA3MFZ","json":"https://pith.science/pith/WC4PQ2T4S4VWRIPPGP6QYA3MFZ.json","graph_json":"https://pith.science/api/pith-number/WC4PQ2T4S4VWRIPPGP6QYA3MFZ/graph.json","events_json":"https://pith.science/api/pith-number/WC4PQ2T4S4VWRIPPGP6QYA3MFZ/events.json","paper":"https://pith.science/paper/WC4PQ2T4"},"agent_actions":{"view_html":"https://pith.science/pith/WC4PQ2T4S4VWRIPPGP6QYA3MFZ","download_json":"https://pith.science/pith/WC4PQ2T4S4VWRIPPGP6QYA3MFZ.json","view_paper":"https://pith.science/paper/WC4PQ2T4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.3020&json=true","fetch_graph":"https://pith.science/api/pith-number/WC4PQ2T4S4VWRIPPGP6QYA3MFZ/graph.json","fetch_events":"https://pith.science/api/pith-number/WC4PQ2T4S4VWRIPPGP6QYA3MFZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WC4PQ2T4S4VWRIPPGP6QYA3MFZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WC4PQ2T4S4VWRIPPGP6QYA3MFZ/action/storage_attestation","attest_author":"https://pith.science/pith/WC4PQ2T4S4VWRIPPGP6QYA3MFZ/action/author_attestation","sign_citation":"https://pith.science/pith/WC4PQ2T4S4VWRIPPGP6QYA3MFZ/action/citation_signature","submit_replication":"https://pith.science/pith/WC4PQ2T4S4VWRIPPGP6QYA3MFZ/action/replication_record"}},"created_at":"2026-05-18T03:05:00.762878+00:00","updated_at":"2026-05-18T03:05:00.762878+00:00"}