{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SQAOE2TZ4K57PDEOBI5EY7BHLU","short_pith_number":"pith:SQAOE2TZ","canonical_record":{"source":{"id":"1307.1805","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-06T18:40:47Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"0d27bde011b0cc2ad2ccf7e8a71ec7ac190470a253e58ffe4dc16b075b61944f","abstract_canon_sha256":"0cc1be25f51ebdae4abd70ec43e48138ada0c4be1dbb09e25f552be17febad60"},"schema_version":"1.0"},"canonical_sha256":"9400e26a79e2bbf78c8e0a3a4c7c275d3773e10d2dd304eeb47ddd15ef9f6afe","source":{"kind":"arxiv","id":"1307.1805","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.1805","created_at":"2026-05-18T03:12:46Z"},{"alias_kind":"arxiv_version","alias_value":"1307.1805v2","created_at":"2026-05-18T03:12:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1805","created_at":"2026-05-18T03:12:46Z"},{"alias_kind":"pith_short_12","alias_value":"SQAOE2TZ4K57","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SQAOE2TZ4K57PDEO","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SQAOE2TZ","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SQAOE2TZ4K57PDEOBI5EY7BHLU","target":"record","payload":{"canonical_record":{"source":{"id":"1307.1805","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-06T18:40:47Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"0d27bde011b0cc2ad2ccf7e8a71ec7ac190470a253e58ffe4dc16b075b61944f","abstract_canon_sha256":"0cc1be25f51ebdae4abd70ec43e48138ada0c4be1dbb09e25f552be17febad60"},"schema_version":"1.0"},"canonical_sha256":"9400e26a79e2bbf78c8e0a3a4c7c275d3773e10d2dd304eeb47ddd15ef9f6afe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:46.097795Z","signature_b64":"onqrqpJpipiR0NIBJQIJo3/Vnt4W9vKSLofbkT8qy53piXuQuby4A0Rur5UjSfuUo+VBi9U7IANa5MTQFtGGBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9400e26a79e2bbf78c8e0a3a4c7c275d3773e10d2dd304eeb47ddd15ef9f6afe","last_reissued_at":"2026-05-18T03:12:46.097288Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:46.097288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.1805","source_version":2,"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:12:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P2duX6cO5wp+b8Yb6vHmkryV6mji4hv4Ekm5NnyFtdKo07xfTohfDutFSbfqiHEHJ6G8Zk6VAcIxU/l4O8fICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:44:06.973717Z"},"content_sha256":"cd30d15000114ae90da6788366bf7c6152d5ac797600e43a8000eb91d9598cdb","schema_version":"1.0","event_id":"sha256:cd30d15000114ae90da6788366bf7c6152d5ac797600e43a8000eb91d9598cdb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SQAOE2TZ4K57PDEOBI5EY7BHLU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Communication Lower Bounds for Distributed-Memory Computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Francesco Silvestri, Michele Scquizzato","submitted_at":"2013-07-06T18:40:47Z","abstract_excerpt":"We give lower bounds on the communication complexity required to solve several computational problems in a distributed-memory parallel machine, namely standard matrix multiplication, stencil computations, comparison sorting, and the Fast Fourier Transform. We revisit the assumptions under which preceding results were derived and provide new lower bounds which use much weaker and appropriate hypotheses. Our bounds rely on a mild assumption on work distribution, and strengthen previous results which require either the computation to be balanced among the processors, or specific initial distribut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1805","kind":"arxiv","version":2},"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:12:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WTtKZyKbuLwd2WInyN2S1/G90DanJGbkeQdg2yOSHsaVINWBJK28FbYbF+QDEzfx5ARbXMsC9jf4pwK6Fo3cDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:44:06.974062Z"},"content_sha256":"38f86a72b013fa5a969b5a8bebd45c687c50c0a5443b7ddaebc9a010985edd1e","schema_version":"1.0","event_id":"sha256:38f86a72b013fa5a969b5a8bebd45c687c50c0a5443b7ddaebc9a010985edd1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SQAOE2TZ4K57PDEOBI5EY7BHLU/bundle.json","state_url":"https://pith.science/pith/SQAOE2TZ4K57PDEOBI5EY7BHLU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SQAOE2TZ4K57PDEOBI5EY7BHLU/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-03T18:44:06Z","links":{"resolver":"https://pith.science/pith/SQAOE2TZ4K57PDEOBI5EY7BHLU","bundle":"https://pith.science/pith/SQAOE2TZ4K57PDEOBI5EY7BHLU/bundle.json","state":"https://pith.science/pith/SQAOE2TZ4K57PDEOBI5EY7BHLU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SQAOE2TZ4K57PDEOBI5EY7BHLU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SQAOE2TZ4K57PDEOBI5EY7BHLU","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":"0cc1be25f51ebdae4abd70ec43e48138ada0c4be1dbb09e25f552be17febad60","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-06T18:40:47Z","title_canon_sha256":"0d27bde011b0cc2ad2ccf7e8a71ec7ac190470a253e58ffe4dc16b075b61944f"},"schema_version":"1.0","source":{"id":"1307.1805","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.1805","created_at":"2026-05-18T03:12:46Z"},{"alias_kind":"arxiv_version","alias_value":"1307.1805v2","created_at":"2026-05-18T03:12:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1805","created_at":"2026-05-18T03:12:46Z"},{"alias_kind":"pith_short_12","alias_value":"SQAOE2TZ4K57","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SQAOE2TZ4K57PDEO","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SQAOE2TZ","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:38f86a72b013fa5a969b5a8bebd45c687c50c0a5443b7ddaebc9a010985edd1e","target":"graph","created_at":"2026-05-18T03:12:46Z","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 give lower bounds on the communication complexity required to solve several computational problems in a distributed-memory parallel machine, namely standard matrix multiplication, stencil computations, comparison sorting, and the Fast Fourier Transform. We revisit the assumptions under which preceding results were derived and provide new lower bounds which use much weaker and appropriate hypotheses. Our bounds rely on a mild assumption on work distribution, and strengthen previous results which require either the computation to be balanced among the processors, or specific initial distribut","authors_text":"Francesco Silvestri, Michele Scquizzato","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-06T18:40:47Z","title":"Communication Lower Bounds for Distributed-Memory Computations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1805","kind":"arxiv","version":2},"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:cd30d15000114ae90da6788366bf7c6152d5ac797600e43a8000eb91d9598cdb","target":"record","created_at":"2026-05-18T03:12:46Z","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":"0cc1be25f51ebdae4abd70ec43e48138ada0c4be1dbb09e25f552be17febad60","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-06T18:40:47Z","title_canon_sha256":"0d27bde011b0cc2ad2ccf7e8a71ec7ac190470a253e58ffe4dc16b075b61944f"},"schema_version":"1.0","source":{"id":"1307.1805","kind":"arxiv","version":2}},"canonical_sha256":"9400e26a79e2bbf78c8e0a3a4c7c275d3773e10d2dd304eeb47ddd15ef9f6afe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9400e26a79e2bbf78c8e0a3a4c7c275d3773e10d2dd304eeb47ddd15ef9f6afe","first_computed_at":"2026-05-18T03:12:46.097288Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:46.097288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"onqrqpJpipiR0NIBJQIJo3/Vnt4W9vKSLofbkT8qy53piXuQuby4A0Rur5UjSfuUo+VBi9U7IANa5MTQFtGGBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:46.097795Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.1805","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd30d15000114ae90da6788366bf7c6152d5ac797600e43a8000eb91d9598cdb","sha256:38f86a72b013fa5a969b5a8bebd45c687c50c0a5443b7ddaebc9a010985edd1e"],"state_sha256":"ef10826c32b21dfbdbdae15ec569bda8a4a1c31a02539858b0af8d0bc61396d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k+pEhD4WASJH+fXJ3XGCgwYOek+aiWJiCiGYpjSQq/x0oIi/imr/2+56rRX8+z/iTQBeB9GFIRKtTtVQRhSUCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T18:44:06.975994Z","bundle_sha256":"39481ed2804a8931e3bca866c34f3385dd8612c2d82fd47b63e5f4e0df9d2660"}}