{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WRUQWZXPSZDZ6TF6VXCRAUH4YH","short_pith_number":"pith:WRUQWZXP","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"},"canonical_sha256":"b4690b66ef96479f4cbeadc51050fcc1f3eea494ca11242368dc1d999e71c907","source":{"kind":"arxiv","id":"1304.4636","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.4636","created_at":"2026-05-18T03:17:33Z"},{"alias_kind":"arxiv_version","alias_value":"1304.4636v3","created_at":"2026-05-18T03:17:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4636","created_at":"2026-05-18T03:17:33Z"},{"alias_kind":"pith_short_12","alias_value":"WRUQWZXPSZDZ","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WRUQWZXPSZDZ6TF6","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WRUQWZXP","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WRUQWZXPSZDZ6TF6VXCRAUH4YH","target":"record","payload":{"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"},"canonical_sha256":"b4690b66ef96479f4cbeadc51050fcc1f3eea494ca11242368dc1d999e71c907","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"},"source_kind":"arxiv","source_id":"1304.4636","source_version":3,"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-18T03:17:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UgzyoqN5d0Mf+Gfw/leoCLSNjkAulK+I/ffTRbLxwAXRUEzJo2hr7LXaxvCQQQQv8evQ4Zek+nSl55c4H61qAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T19:14:04.691878Z"},"content_sha256":"24dfc989702d4fe50259cc382199efff8c35ba73a471e50da760f9efb87422fc","schema_version":"1.0","event_id":"sha256:24dfc989702d4fe50259cc382199efff8c35ba73a471e50da760f9efb87422fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WRUQWZXPSZDZ6TF6VXCRAUH4YH","target":"graph","payload":{"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"},"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-18T03:17:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g8zhAXtF83zXOz7Dtfa4dlXdkJfdrPzxVGmGNDhR6EUYBlZTS3AlaeF/+O/HPvr60LM0vnMOsy6MfNCJv6VeAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T19:14:04.692401Z"},"content_sha256":"ac9b55b6761b0b60a1d34fe226e992b99292c2299f8e11980f7a3f28a6508dcc","schema_version":"1.0","event_id":"sha256:ac9b55b6761b0b60a1d34fe226e992b99292c2299f8e11980f7a3f28a6508dcc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WRUQWZXPSZDZ6TF6VXCRAUH4YH/bundle.json","state_url":"https://pith.science/pith/WRUQWZXPSZDZ6TF6VXCRAUH4YH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WRUQWZXPSZDZ6TF6VXCRAUH4YH/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-08-16T19:14:04Z","links":{"resolver":"https://pith.science/pith/WRUQWZXPSZDZ6TF6VXCRAUH4YH","bundle":"https://pith.science/pith/WRUQWZXPSZDZ6TF6VXCRAUH4YH/bundle.json","state":"https://pith.science/pith/WRUQWZXPSZDZ6TF6VXCRAUH4YH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WRUQWZXPSZDZ6TF6VXCRAUH4YH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WRUQWZXPSZDZ6TF6VXCRAUH4YH","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":"231b6132fb97491dc6d762ac0ad6f4e4b63647bb167d3477bd2cb3ed4fc6846f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-16T22:14:12Z","title_canon_sha256":"ef0220456618da8cc0e311d59d0c18b99ae6876ca7cb7b26b240541c266ce442"},"schema_version":"1.0","source":{"id":"1304.4636","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.4636","created_at":"2026-05-18T03:17:33Z"},{"alias_kind":"arxiv_version","alias_value":"1304.4636v3","created_at":"2026-05-18T03:17:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4636","created_at":"2026-05-18T03:17:33Z"},{"alias_kind":"pith_short_12","alias_value":"WRUQWZXPSZDZ","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WRUQWZXPSZDZ6TF6","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WRUQWZXP","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:ac9b55b6761b0b60a1d34fe226e992b99292c2299f8e11980f7a3f28a6508dcc","target":"graph","created_at":"2026-05-18T03:17:33Z","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":"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","authors_text":"David P. Woodruff, Qin Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-16T22:14:12Z","title":"When Distributed Computation is Communication Expensive"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4636","kind":"arxiv","version":3},"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:24dfc989702d4fe50259cc382199efff8c35ba73a471e50da760f9efb87422fc","target":"record","created_at":"2026-05-18T03:17:33Z","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":"231b6132fb97491dc6d762ac0ad6f4e4b63647bb167d3477bd2cb3ed4fc6846f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-16T22:14:12Z","title_canon_sha256":"ef0220456618da8cc0e311d59d0c18b99ae6876ca7cb7b26b240541c266ce442"},"schema_version":"1.0","source":{"id":"1304.4636","kind":"arxiv","version":3}},"canonical_sha256":"b4690b66ef96479f4cbeadc51050fcc1f3eea494ca11242368dc1d999e71c907","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4690b66ef96479f4cbeadc51050fcc1f3eea494ca11242368dc1d999e71c907","first_computed_at":"2026-05-18T03:17:33.874542Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:33.874542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m30ZJF2Fsv3CH22+VNjZxFkaPufqCk5Mv20SotcX8FAv8ty9OoDQvr2JYFCibhfEvi5yiJFsz6N8g53AC5rGAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:33.875185Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.4636","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24dfc989702d4fe50259cc382199efff8c35ba73a471e50da760f9efb87422fc","sha256:ac9b55b6761b0b60a1d34fe226e992b99292c2299f8e11980f7a3f28a6508dcc"],"state_sha256":"6f114e3718e8acc4c49bea8adc339a3f7d99fd1195028b854b33d64bdf25cb4e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dv/DS0vmOTdWiiU/rwXQ2hgQ6vxTUwhkyuJ05ZYwUDQ2lIlQ6xC/NsLqGklaSxkgOhREyp8lztLebie64y5sCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T19:14:04.697514Z","bundle_sha256":"86090c49241dc02df95b958d71f0d1361b0211cce05d1bb860433b80af54f4a2"}}