{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5A3OT3CWO2YVGWDF5KIUOPIWZW","short_pith_number":"pith:5A3OT3CW","schema_version":"1.0","canonical_sha256":"e836e9ec5676b1535865ea91473d16cd9a9408e188f5ac0edf310676a5ec962d","source":{"kind":"arxiv","id":"2607.13532","version":1},"attestation_state":"computed","paper":{"title":"Computing Strong Rank-Revealing Factorizations for Matrices with Orthonormal Rows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Anil Damle","submitted_at":"2026-07-15T07:32:43Z","abstract_excerpt":"We show that a pivoting strategy due to Stewart (based on work by Bischof) computes a strong rank-revealing factorization when applied to a matrix with orthonormal rows. When paired with the classical column selection algorithm of Golub, Klema, and Stewart (GKS) it helps achieve rank-$k$ approximation accuracy bounds and basis conditioning as good as those from applying a strong rank-revealing factorization directly to A. We then extend this framework in two directions: (1) providing analysis of GKS when only approximations of right singular vectors are available and (2) providing a randomized"},"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":"2607.13532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-07-15T07:32:43Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"c077a3fd0364a3561a4473382d95c08ad29255148e97f166380a68a3c16c343d","abstract_canon_sha256":"3d1c153a365de33923b89caccabe17ec47241f93217ae5f25fb7e96d7142316d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-16T01:22:52.042002Z","signature_b64":"+4vq1LNEo4ZiPmcRiJZa/tEFNpcoCS3xGQzaWx+Y3zJq6Ou34EubgpcXHmMXTZYbpGPDQwNW2DaE33vlSyzmBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e836e9ec5676b1535865ea91473d16cd9a9408e188f5ac0edf310676a5ec962d","last_reissued_at":"2026-07-16T01:22:52.040966Z","signature_status":"signed_v1","first_computed_at":"2026-07-16T01:22:52.040966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Strong Rank-Revealing Factorizations for Matrices with Orthonormal Rows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Anil Damle","submitted_at":"2026-07-15T07:32:43Z","abstract_excerpt":"We show that a pivoting strategy due to Stewart (based on work by Bischof) computes a strong rank-revealing factorization when applied to a matrix with orthonormal rows. When paired with the classical column selection algorithm of Golub, Klema, and Stewart (GKS) it helps achieve rank-$k$ approximation accuracy bounds and basis conditioning as good as those from applying a strong rank-revealing factorization directly to A. We then extend this framework in two directions: (1) providing analysis of GKS when only approximations of right singular vectors are available and (2) providing a randomized"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.13532","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.13532/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.13532","created_at":"2026-07-16T01:22:52.041460+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.13532v1","created_at":"2026-07-16T01:22:52.041460+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.13532","created_at":"2026-07-16T01:22:52.041460+00:00"},{"alias_kind":"pith_short_12","alias_value":"5A3OT3CWO2YV","created_at":"2026-07-16T01:22:52.041460+00:00"},{"alias_kind":"pith_short_16","alias_value":"5A3OT3CWO2YVGWDF","created_at":"2026-07-16T01:22:52.041460+00:00"},{"alias_kind":"pith_short_8","alias_value":"5A3OT3CW","created_at":"2026-07-16T01:22:52.041460+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/5A3OT3CWO2YVGWDF5KIUOPIWZW","json":"https://pith.science/pith/5A3OT3CWO2YVGWDF5KIUOPIWZW.json","graph_json":"https://pith.science/api/pith-number/5A3OT3CWO2YVGWDF5KIUOPIWZW/graph.json","events_json":"https://pith.science/api/pith-number/5A3OT3CWO2YVGWDF5KIUOPIWZW/events.json","paper":"https://pith.science/paper/5A3OT3CW"},"agent_actions":{"view_html":"https://pith.science/pith/5A3OT3CWO2YVGWDF5KIUOPIWZW","download_json":"https://pith.science/pith/5A3OT3CWO2YVGWDF5KIUOPIWZW.json","view_paper":"https://pith.science/paper/5A3OT3CW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.13532&json=true","fetch_graph":"https://pith.science/api/pith-number/5A3OT3CWO2YVGWDF5KIUOPIWZW/graph.json","fetch_events":"https://pith.science/api/pith-number/5A3OT3CWO2YVGWDF5KIUOPIWZW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5A3OT3CWO2YVGWDF5KIUOPIWZW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5A3OT3CWO2YVGWDF5KIUOPIWZW/action/storage_attestation","attest_author":"https://pith.science/pith/5A3OT3CWO2YVGWDF5KIUOPIWZW/action/author_attestation","sign_citation":"https://pith.science/pith/5A3OT3CWO2YVGWDF5KIUOPIWZW/action/citation_signature","submit_replication":"https://pith.science/pith/5A3OT3CWO2YVGWDF5KIUOPIWZW/action/replication_record"}},"created_at":"2026-07-16T01:22:52.041460+00:00","updated_at":"2026-07-16T01:22:52.041460+00:00"}