{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WRUQWZXPSZDZ6TF6VXCRAUH4YH","short_pith_number":"pith:WRUQWZXP","schema_version":"1.0","canonical_sha256":"b4690b66ef96479f4cbeadc51050fcc1f3eea494ca11242368dc1d999e71c907","source":{"kind":"arxiv","id":"1304.4636","version":3},"attestation_state":"computed","paper":{"title":"When Distributed Computation is Communication Expensive","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Qin Zhang","submitted_at":"2013-04-16T22:14:12Z","abstract_excerpt":"We consider a number of fundamental statistical and graph problems in the message-passing model, where we have $k$ machines (sites), each holding a piece of data, and the machines want to jointly solve a problem defined on the union of the $k$ data sets. The communication is point-to-point, and the goal is to minimize the total communication among the $k$ machines. This model captures all point-to-point distributed computational models with respect to minimizing communication costs. Our analysis shows that exact computation of many statistical and graph problems in this distributed setting req"},"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":"1304.4636","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-16T22:14:12Z","cross_cats_sorted":[],"title_canon_sha256":"ef0220456618da8cc0e311d59d0c18b99ae6876ca7cb7b26b240541c266ce442","abstract_canon_sha256":"231b6132fb97491dc6d762ac0ad6f4e4b63647bb167d3477bd2cb3ed4fc6846f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:33.875185Z","signature_b64":"m30ZJF2Fsv3CH22+VNjZxFkaPufqCk5Mv20SotcX8FAv8ty9OoDQvr2JYFCibhfEvi5yiJFsz6N8g53AC5rGAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4690b66ef96479f4cbeadc51050fcc1f3eea494ca11242368dc1d999e71c907","last_reissued_at":"2026-05-18T03:17:33.874542Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:33.874542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"When Distributed Computation is Communication Expensive","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Qin Zhang","submitted_at":"2013-04-16T22:14:12Z","abstract_excerpt":"We consider a number of fundamental statistical and graph problems in the message-passing model, where we have $k$ machines (sites), each holding a piece of data, and the machines want to jointly solve a problem defined on the union of the $k$ data sets. The communication is point-to-point, and the goal is to minimize the total communication among the $k$ machines. This model captures all point-to-point distributed computational models with respect to minimizing communication costs. Our analysis shows that exact computation of many statistical and graph problems in this distributed setting req"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4636","kind":"arxiv","version":3},"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":"1304.4636","created_at":"2026-05-18T03:17:33.874639+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.4636v3","created_at":"2026-05-18T03:17:33.874639+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4636","created_at":"2026-05-18T03:17:33.874639+00:00"},{"alias_kind":"pith_short_12","alias_value":"WRUQWZXPSZDZ","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"WRUQWZXPSZDZ6TF6","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"WRUQWZXP","created_at":"2026-05-18T12:28:04.890932+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.14250","citing_title":"Simple and Optimal Algorithms for Heavy Hitters and Frequency Moments in Distributed Models","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WRUQWZXPSZDZ6TF6VXCRAUH4YH","json":"https://pith.science/pith/WRUQWZXPSZDZ6TF6VXCRAUH4YH.json","graph_json":"https://pith.science/api/pith-number/WRUQWZXPSZDZ6TF6VXCRAUH4YH/graph.json","events_json":"https://pith.science/api/pith-number/WRUQWZXPSZDZ6TF6VXCRAUH4YH/events.json","paper":"https://pith.science/paper/WRUQWZXP"},"agent_actions":{"view_html":"https://pith.science/pith/WRUQWZXPSZDZ6TF6VXCRAUH4YH","download_json":"https://pith.science/pith/WRUQWZXPSZDZ6TF6VXCRAUH4YH.json","view_paper":"https://pith.science/paper/WRUQWZXP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.4636&json=true","fetch_graph":"https://pith.science/api/pith-number/WRUQWZXPSZDZ6TF6VXCRAUH4YH/graph.json","fetch_events":"https://pith.science/api/pith-number/WRUQWZXPSZDZ6TF6VXCRAUH4YH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WRUQWZXPSZDZ6TF6VXCRAUH4YH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WRUQWZXPSZDZ6TF6VXCRAUH4YH/action/storage_attestation","attest_author":"https://pith.science/pith/WRUQWZXPSZDZ6TF6VXCRAUH4YH/action/author_attestation","sign_citation":"https://pith.science/pith/WRUQWZXPSZDZ6TF6VXCRAUH4YH/action/citation_signature","submit_replication":"https://pith.science/pith/WRUQWZXPSZDZ6TF6VXCRAUH4YH/action/replication_record"}},"created_at":"2026-05-18T03:17:33.874639+00:00","updated_at":"2026-05-18T03:17:33.874639+00:00"}