{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FCCGYQU2ZZ5FAKA3DWHNLMIU2S","short_pith_number":"pith:FCCGYQU2","schema_version":"1.0","canonical_sha256":"28846c429ace7a50281b1d8ed5b114d4a250b1d8735a8fad4c38d322ca319697","source":{"kind":"arxiv","id":"1509.06820","version":2},"attestation_state":"computed","paper":{"title":"Randomized QR with Column Pivoting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Jed A. Duersch, Ming Gu","submitted_at":"2015-09-23T01:30:28Z","abstract_excerpt":"The dominant contribution to communication complexity in factorizing a matrix using QR with column pivoting is due to column-norm updates that are required to process pivot decisions. We use randomized sampling to approximate this process which dramatically reduces communication in column selection. We also introduce a sample update formula to reduce the cost of sampling trailing matrices. Using our column selection mechanism we observe results that are comparable in quality to those obtained from the QRCP algorithm, but with performance near unpivoted QR. We also demonstrate strong parallel s"},"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":"1509.06820","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-09-23T01:30:28Z","cross_cats_sorted":[],"title_canon_sha256":"2f429d4eb231f3c9aeaac3a48d9cd0aa2c77adbaacfa55f4fe73bb50a955f6c0","abstract_canon_sha256":"962a24d28e243e1eeed6795917104465f96c5b2f94f966e565c2951c3a693cf8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:29.489544Z","signature_b64":"KXqg9qwVNoI/qwoRrN6xz9dBHZsEUi24RTtQgwwbqBxZZhn/j2doTZVDVvY9DzD/8659ZRCFLECnhp4y6JrFAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28846c429ace7a50281b1d8ed5b114d4a250b1d8735a8fad4c38d322ca319697","last_reissued_at":"2026-05-18T00:25:29.488966Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:29.488966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized QR with Column Pivoting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Jed A. Duersch, Ming Gu","submitted_at":"2015-09-23T01:30:28Z","abstract_excerpt":"The dominant contribution to communication complexity in factorizing a matrix using QR with column pivoting is due to column-norm updates that are required to process pivot decisions. We use randomized sampling to approximate this process which dramatically reduces communication in column selection. We also introduce a sample update formula to reduce the cost of sampling trailing matrices. Using our column selection mechanism we observe results that are comparable in quality to those obtained from the QRCP algorithm, but with performance near unpivoted QR. We also demonstrate strong parallel s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06820","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.06820","created_at":"2026-05-18T00:25:29.489065+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.06820v2","created_at":"2026-05-18T00:25:29.489065+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06820","created_at":"2026-05-18T00:25:29.489065+00:00"},{"alias_kind":"pith_short_12","alias_value":"FCCGYQU2ZZ5F","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"FCCGYQU2ZZ5FAKA3","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"FCCGYQU2","created_at":"2026-05-18T12:29:19.899920+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/FCCGYQU2ZZ5FAKA3DWHNLMIU2S","json":"https://pith.science/pith/FCCGYQU2ZZ5FAKA3DWHNLMIU2S.json","graph_json":"https://pith.science/api/pith-number/FCCGYQU2ZZ5FAKA3DWHNLMIU2S/graph.json","events_json":"https://pith.science/api/pith-number/FCCGYQU2ZZ5FAKA3DWHNLMIU2S/events.json","paper":"https://pith.science/paper/FCCGYQU2"},"agent_actions":{"view_html":"https://pith.science/pith/FCCGYQU2ZZ5FAKA3DWHNLMIU2S","download_json":"https://pith.science/pith/FCCGYQU2ZZ5FAKA3DWHNLMIU2S.json","view_paper":"https://pith.science/paper/FCCGYQU2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.06820&json=true","fetch_graph":"https://pith.science/api/pith-number/FCCGYQU2ZZ5FAKA3DWHNLMIU2S/graph.json","fetch_events":"https://pith.science/api/pith-number/FCCGYQU2ZZ5FAKA3DWHNLMIU2S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FCCGYQU2ZZ5FAKA3DWHNLMIU2S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FCCGYQU2ZZ5FAKA3DWHNLMIU2S/action/storage_attestation","attest_author":"https://pith.science/pith/FCCGYQU2ZZ5FAKA3DWHNLMIU2S/action/author_attestation","sign_citation":"https://pith.science/pith/FCCGYQU2ZZ5FAKA3DWHNLMIU2S/action/citation_signature","submit_replication":"https://pith.science/pith/FCCGYQU2ZZ5FAKA3DWHNLMIU2S/action/replication_record"}},"created_at":"2026-05-18T00:25:29.489065+00:00","updated_at":"2026-05-18T00:25:29.489065+00:00"}