{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HDDVL2G733ANXLCWVDZRVZOFLE","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":"0837d805212d4d3e323024fe3ef733ce5325ddfd3aa6a47140e9a4d567d64a46","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-14T16:45:16Z","title_canon_sha256":"f1df2c6bb8691a2e915ea40dcbe021a2d2c59cfa0d841a61afa7253a177cf7ea"},"schema_version":"1.0","source":{"id":"1805.05278","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05278","created_at":"2026-05-18T00:16:03Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05278v1","created_at":"2026-05-18T00:16:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05278","created_at":"2026-05-18T00:16:03Z"},{"alias_kind":"pith_short_12","alias_value":"HDDVL2G733AN","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HDDVL2G733ANXLCW","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HDDVL2G7","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:630fb2afdae63d69fc049ee07998bde7033715eae07089704c0ed05d84b89e2d","target":"graph","created_at":"2026-05-18T00:16:03Z","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":"Interprocessor communication often dominates the runtime of large matrix computations. We present a parallel algorithm for computing QR decompositions whose bandwidth cost (communication volume) can be decreased at the cost of increasing its latency cost (number of messages). By varying a parameter to navigate the bandwidth/latency tradeoff, we can tune this algorithm for machines with different communication costs.","authors_text":"Grey Ballard, James Demmel, Laura Grigori, Mathias Jacquelin, Nicholas Knight","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-14T16:45:16Z","title":"A 3D Parallel Algorithm for QR Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05278","kind":"arxiv","version":1},"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:ae133208f8513b15aa3a78567f0ecab10a6830f9beef2c25300ea27a917abccf","target":"record","created_at":"2026-05-18T00:16:03Z","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":"0837d805212d4d3e323024fe3ef733ce5325ddfd3aa6a47140e9a4d567d64a46","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-14T16:45:16Z","title_canon_sha256":"f1df2c6bb8691a2e915ea40dcbe021a2d2c59cfa0d841a61afa7253a177cf7ea"},"schema_version":"1.0","source":{"id":"1805.05278","kind":"arxiv","version":1}},"canonical_sha256":"38c755e8dfdec0dbac56a8f31ae5c55902dc7c2203ac595c58cc6f37a8d589bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38c755e8dfdec0dbac56a8f31ae5c55902dc7c2203ac595c58cc6f37a8d589bf","first_computed_at":"2026-05-18T00:16:03.542387Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:03.542387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"83aMGS8+S1djfF1PM2eRQuy42SZU5fEdXZjAwjLgRcOAvP3nA9XA5vER63fOC/aMrHMZfkv3fINVm37hdkIgDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:03.542791Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.05278","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae133208f8513b15aa3a78567f0ecab10a6830f9beef2c25300ea27a917abccf","sha256:630fb2afdae63d69fc049ee07998bde7033715eae07089704c0ed05d84b89e2d"],"state_sha256":"ff88e5d306206c71d74dba5d9ed3565f87c606743a48f715eb93d0697f6b353a"}