{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VD5ARNOVXL2S2ERZRCIJKCY24O","short_pith_number":"pith:VD5ARNOV","schema_version":"1.0","canonical_sha256":"a8fa08b5d5baf52d12398890950b1ae3b632e9150e98ae761a29697e9a68cd50","source":{"kind":"arxiv","id":"1710.08471","version":6},"attestation_state":"computed","paper":{"title":"Communication-avoiding Cholesky-QR2 for rectangular matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.DC","authors_text":"Edgar Solomonik, Edward Hutter","submitted_at":"2017-10-23T19:35:07Z","abstract_excerpt":"Scalable QR factorization algorithms for solving least squares and eigenvalue problems are critical given the increasing parallelism within modern machines. We introduce a more general parallelization of the CholeskyQR2 algorithm and show its effectiveness for a wide range of matrix sizes. Our algorithm executes over a 3D processor grid, the dimensions of which can be tuned to trade-off costs in synchronization, interprocessor communication, computational work, and memory footprint. We implement this algorithm, yielding a code that can achieve a factor of $\\Theta(P^{1/6})$ less interprocessor "},"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":"1710.08471","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-10-23T19:35:07Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"058d2ce32fdb85905a64193d2c8450800e0622d4efc8bfe3e63e5790483fbfa1","abstract_canon_sha256":"fedfde8c872b18fd340757e6d1a357f13af37890311b7e3c7e141151a98563d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:18.392097Z","signature_b64":"wvVtMQ7jouksyJdGPpjynyKKU3D9bnaoXD63Ltl/U0vNxPp0YAFDZHj+8MsTF+/xGKXWaXY8T7WtU47GUzKjAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8fa08b5d5baf52d12398890950b1ae3b632e9150e98ae761a29697e9a68cd50","last_reissued_at":"2026-05-17T23:43:18.391457Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:18.391457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication-avoiding Cholesky-QR2 for rectangular matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.DC","authors_text":"Edgar Solomonik, Edward Hutter","submitted_at":"2017-10-23T19:35:07Z","abstract_excerpt":"Scalable QR factorization algorithms for solving least squares and eigenvalue problems are critical given the increasing parallelism within modern machines. We introduce a more general parallelization of the CholeskyQR2 algorithm and show its effectiveness for a wide range of matrix sizes. Our algorithm executes over a 3D processor grid, the dimensions of which can be tuned to trade-off costs in synchronization, interprocessor communication, computational work, and memory footprint. We implement this algorithm, yielding a code that can achieve a factor of $\\Theta(P^{1/6})$ less interprocessor "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08471","kind":"arxiv","version":6},"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":"1710.08471","created_at":"2026-05-17T23:43:18.391548+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.08471v6","created_at":"2026-05-17T23:43:18.391548+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08471","created_at":"2026-05-17T23:43:18.391548+00:00"},{"alias_kind":"pith_short_12","alias_value":"VD5ARNOVXL2S","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VD5ARNOVXL2S2ERZ","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VD5ARNOV","created_at":"2026-05-18T12:31:49.984773+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VD5ARNOVXL2S2ERZRCIJKCY24O","json":"https://pith.science/pith/VD5ARNOVXL2S2ERZRCIJKCY24O.json","graph_json":"https://pith.science/api/pith-number/VD5ARNOVXL2S2ERZRCIJKCY24O/graph.json","events_json":"https://pith.science/api/pith-number/VD5ARNOVXL2S2ERZRCIJKCY24O/events.json","paper":"https://pith.science/paper/VD5ARNOV"},"agent_actions":{"view_html":"https://pith.science/pith/VD5ARNOVXL2S2ERZRCIJKCY24O","download_json":"https://pith.science/pith/VD5ARNOVXL2S2ERZRCIJKCY24O.json","view_paper":"https://pith.science/paper/VD5ARNOV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.08471&json=true","fetch_graph":"https://pith.science/api/pith-number/VD5ARNOVXL2S2ERZRCIJKCY24O/graph.json","fetch_events":"https://pith.science/api/pith-number/VD5ARNOVXL2S2ERZRCIJKCY24O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VD5ARNOVXL2S2ERZRCIJKCY24O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VD5ARNOVXL2S2ERZRCIJKCY24O/action/storage_attestation","attest_author":"https://pith.science/pith/VD5ARNOVXL2S2ERZRCIJKCY24O/action/author_attestation","sign_citation":"https://pith.science/pith/VD5ARNOVXL2S2ERZRCIJKCY24O/action/citation_signature","submit_replication":"https://pith.science/pith/VD5ARNOVXL2S2ERZRCIJKCY24O/action/replication_record"}},"created_at":"2026-05-17T23:43:18.391548+00:00","updated_at":"2026-05-17T23:43:18.391548+00:00"}