{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4RSXYYUCSI6AP6D32BWDJKWBBH","short_pith_number":"pith:4RSXYYUC","canonical_record":{"source":{"id":"1304.3162","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-10T23:05:01Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"91fe9893d1bdf615f5b12b6da0663171adf61609ee423c02645d81906edce82d","abstract_canon_sha256":"fc9e6b878e44704abb7d61de9356694c1ade594da1008c378b479dc3f90fcc8a"},"schema_version":"1.0"},"canonical_sha256":"e4657c6282923c07f87bd06c34aac109f59f6fd5a28b10e14d1024a7282ac612","source":{"kind":"arxiv","id":"1304.3162","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.3162","created_at":"2026-05-18T02:48:47Z"},{"alias_kind":"arxiv_version","alias_value":"1304.3162v4","created_at":"2026-05-18T02:48:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3162","created_at":"2026-05-18T02:48:47Z"},{"alias_kind":"pith_short_12","alias_value":"4RSXYYUCSI6A","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4RSXYYUCSI6AP6D3","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4RSXYYUC","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4RSXYYUCSI6AP6D32BWDJKWBBH","target":"record","payload":{"canonical_record":{"source":{"id":"1304.3162","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-10T23:05:01Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"91fe9893d1bdf615f5b12b6da0663171adf61609ee423c02645d81906edce82d","abstract_canon_sha256":"fc9e6b878e44704abb7d61de9356694c1ade594da1008c378b479dc3f90fcc8a"},"schema_version":"1.0"},"canonical_sha256":"e4657c6282923c07f87bd06c34aac109f59f6fd5a28b10e14d1024a7282ac612","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:47.065649Z","signature_b64":"m99U4EsLSN0eWoSvSu0nMh4IglJ5+6fff9aodUyARtbN547tEQE6btWB6kU/wHTGJVmuzF3oZ+DmxSBy+I1HBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4657c6282923c07f87bd06c34aac109f59f6fd5a28b10e14d1024a7282ac612","last_reissued_at":"2026-05-18T02:48:47.065087Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:47.065087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.3162","source_version":4,"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-18T02:48:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j/MCfX6aaFdS54sNUnN6V5+gAojVK+33oDVd6pKV//M2ol4gwtHcvG5HHWNhnfFsTWiWkJv5zUFem/m/uFSXDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:15:06.554538Z"},"content_sha256":"365a481d6b3b32f1bdd758dc45a14bd1240fe6d7e7f4ea6eb2409d762dcebd4e","schema_version":"1.0","event_id":"sha256:365a481d6b3b32f1bdd758dc45a14bd1240fe6d7e7f4ea6eb2409d762dcebd4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4RSXYYUCSI6AP6D32BWDJKWBBH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Principal Component Analysis and Higher Correlations for Distributed Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"David Woodruff, Ravindran Kannan, Santosh Vempala","submitted_at":"2013-04-10T23:05:01Z","abstract_excerpt":"We consider algorithmic problems in the setting in which the input data has been partitioned arbitrarily on many servers. The goal is to compute a function of all the data, and the bottleneck is the communication used by the algorithm. We present algorithms for two illustrative problems on massive data sets: (1) computing a low-rank approximation of a matrix $A=A^1 + A^2 + \\ldots + A^s$, with matrix $A^t$ stored on server $t$ and (2) computing a function of a vector $a_1 + a_2 + \\ldots + a_s$, where server $t$ has the vector $a_t$; this includes the well-studied special case of computing frequ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.3162","kind":"arxiv","version":4},"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-18T02:48:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OviAfjfWqsjA4A/94qqgNpNUN+Nw8NPVnw0gRYzDoeFIA0o7ojZeLJZPcPcCvJk7oxqPFEBgE7hxBZyarAjsAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:15:06.554932Z"},"content_sha256":"66686c0bae19378bb4edc97db8462717f25a6311ec027ec694d55be72388a868","schema_version":"1.0","event_id":"sha256:66686c0bae19378bb4edc97db8462717f25a6311ec027ec694d55be72388a868"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4RSXYYUCSI6AP6D32BWDJKWBBH/bundle.json","state_url":"https://pith.science/pith/4RSXYYUCSI6AP6D32BWDJKWBBH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4RSXYYUCSI6AP6D32BWDJKWBBH/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-06-01T00:15:06Z","links":{"resolver":"https://pith.science/pith/4RSXYYUCSI6AP6D32BWDJKWBBH","bundle":"https://pith.science/pith/4RSXYYUCSI6AP6D32BWDJKWBBH/bundle.json","state":"https://pith.science/pith/4RSXYYUCSI6AP6D32BWDJKWBBH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4RSXYYUCSI6AP6D32BWDJKWBBH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4RSXYYUCSI6AP6D32BWDJKWBBH","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":"fc9e6b878e44704abb7d61de9356694c1ade594da1008c378b479dc3f90fcc8a","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-10T23:05:01Z","title_canon_sha256":"91fe9893d1bdf615f5b12b6da0663171adf61609ee423c02645d81906edce82d"},"schema_version":"1.0","source":{"id":"1304.3162","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.3162","created_at":"2026-05-18T02:48:47Z"},{"alias_kind":"arxiv_version","alias_value":"1304.3162v4","created_at":"2026-05-18T02:48:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3162","created_at":"2026-05-18T02:48:47Z"},{"alias_kind":"pith_short_12","alias_value":"4RSXYYUCSI6A","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4RSXYYUCSI6AP6D3","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4RSXYYUC","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:66686c0bae19378bb4edc97db8462717f25a6311ec027ec694d55be72388a868","target":"graph","created_at":"2026-05-18T02:48:47Z","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 algorithmic problems in the setting in which the input data has been partitioned arbitrarily on many servers. The goal is to compute a function of all the data, and the bottleneck is the communication used by the algorithm. We present algorithms for two illustrative problems on massive data sets: (1) computing a low-rank approximation of a matrix $A=A^1 + A^2 + \\ldots + A^s$, with matrix $A^t$ stored on server $t$ and (2) computing a function of a vector $a_1 + a_2 + \\ldots + a_s$, where server $t$ has the vector $a_t$; this includes the well-studied special case of computing frequ","authors_text":"David Woodruff, Ravindran Kannan, Santosh Vempala","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-10T23:05:01Z","title":"Principal Component Analysis and Higher Correlations for Distributed Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.3162","kind":"arxiv","version":4},"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:365a481d6b3b32f1bdd758dc45a14bd1240fe6d7e7f4ea6eb2409d762dcebd4e","target":"record","created_at":"2026-05-18T02:48:47Z","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":"fc9e6b878e44704abb7d61de9356694c1ade594da1008c378b479dc3f90fcc8a","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-10T23:05:01Z","title_canon_sha256":"91fe9893d1bdf615f5b12b6da0663171adf61609ee423c02645d81906edce82d"},"schema_version":"1.0","source":{"id":"1304.3162","kind":"arxiv","version":4}},"canonical_sha256":"e4657c6282923c07f87bd06c34aac109f59f6fd5a28b10e14d1024a7282ac612","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4657c6282923c07f87bd06c34aac109f59f6fd5a28b10e14d1024a7282ac612","first_computed_at":"2026-05-18T02:48:47.065087Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:47.065087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m99U4EsLSN0eWoSvSu0nMh4IglJ5+6fff9aodUyARtbN547tEQE6btWB6kU/wHTGJVmuzF3oZ+DmxSBy+I1HBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:47.065649Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.3162","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:365a481d6b3b32f1bdd758dc45a14bd1240fe6d7e7f4ea6eb2409d762dcebd4e","sha256:66686c0bae19378bb4edc97db8462717f25a6311ec027ec694d55be72388a868"],"state_sha256":"29f285a904bf63822f00a19d669676e29b5b11f36f5e3c2947294d2ec31c168d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dIJpH+OyxB5X/njqddTrk1P5aBPA+LrxeLMYZWz+3/HazqYV5iC3iebPFQStrCiW4A0x4wFcAd5ILrLYuaqIAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T00:15:06.557569Z","bundle_sha256":"85e27f4cfaa394c4b4a00af5e4b75a3f9bbac4e37f715a7a8ae59ddbca9a1b03"}}