{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:F2VR5DYNVT5WKDID3D7AWRALA3","short_pith_number":"pith:F2VR5DYN","schema_version":"1.0","canonical_sha256":"2eab1e8f0dacfb650d03d8fe0b440b06da39ae66d5fad0b25b90b52e0e316c8e","source":{"kind":"arxiv","id":"1903.11543","version":1},"attestation_state":"computed","paper":{"title":"Efficient nuclear norm approximation via the randomized UTV algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Nathan Heavner, Per-Gunnar Martinsson","submitted_at":"2019-03-27T16:53:43Z","abstract_excerpt":"The recently introduced algorithm randUTV provides a highly efficient technique for computing accurate approximations to all the singular values of a given matrix $A$. The original version of randUTV was designed to compute a full factorization of the matrix in the form $A = UTV^*$ where $U$ and $V$ are orthogonal matrices, and $T$ is upper triangular. The estimates to the singular values of $A$ appear along the diagonal of $T$. This manuscript describes how the randUTV algorithm can be modified when the only quantity of interest being sought is the vector of approximate singular values. The r"},"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":"1903.11543","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2019-03-27T16:53:43Z","cross_cats_sorted":[],"title_canon_sha256":"77e298d8fccb80687fa7752d202efb07683859a3cdbfc4ff57c70b68857074c9","abstract_canon_sha256":"0aaa27113a38e678a5c22e38df03056e76e91f12da1fb9a39c3719cd36ffaf63"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:03.012843Z","signature_b64":"KLZHs9qH6fogX1nn+wtnu0rIFFuad8WuI+w07OLkJTk7Bn4Z2VpARt8GEUnGj79s3LbncjW6e2Ltpww7nD7dDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2eab1e8f0dacfb650d03d8fe0b440b06da39ae66d5fad0b25b90b52e0e316c8e","last_reissued_at":"2026-05-17T23:50:03.012225Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:03.012225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient nuclear norm approximation via the randomized UTV algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Nathan Heavner, Per-Gunnar Martinsson","submitted_at":"2019-03-27T16:53:43Z","abstract_excerpt":"The recently introduced algorithm randUTV provides a highly efficient technique for computing accurate approximations to all the singular values of a given matrix $A$. The original version of randUTV was designed to compute a full factorization of the matrix in the form $A = UTV^*$ where $U$ and $V$ are orthogonal matrices, and $T$ is upper triangular. The estimates to the singular values of $A$ appear along the diagonal of $T$. This manuscript describes how the randUTV algorithm can be modified when the only quantity of interest being sought is the vector of approximate singular values. The r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11543","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":""},"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":"1903.11543","created_at":"2026-05-17T23:50:03.012324+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.11543v1","created_at":"2026-05-17T23:50:03.012324+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11543","created_at":"2026-05-17T23:50:03.012324+00:00"},{"alias_kind":"pith_short_12","alias_value":"F2VR5DYNVT5W","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"F2VR5DYNVT5WKDID","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"F2VR5DYN","created_at":"2026-05-18T12:33:15.570797+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/F2VR5DYNVT5WKDID3D7AWRALA3","json":"https://pith.science/pith/F2VR5DYNVT5WKDID3D7AWRALA3.json","graph_json":"https://pith.science/api/pith-number/F2VR5DYNVT5WKDID3D7AWRALA3/graph.json","events_json":"https://pith.science/api/pith-number/F2VR5DYNVT5WKDID3D7AWRALA3/events.json","paper":"https://pith.science/paper/F2VR5DYN"},"agent_actions":{"view_html":"https://pith.science/pith/F2VR5DYNVT5WKDID3D7AWRALA3","download_json":"https://pith.science/pith/F2VR5DYNVT5WKDID3D7AWRALA3.json","view_paper":"https://pith.science/paper/F2VR5DYN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.11543&json=true","fetch_graph":"https://pith.science/api/pith-number/F2VR5DYNVT5WKDID3D7AWRALA3/graph.json","fetch_events":"https://pith.science/api/pith-number/F2VR5DYNVT5WKDID3D7AWRALA3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F2VR5DYNVT5WKDID3D7AWRALA3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F2VR5DYNVT5WKDID3D7AWRALA3/action/storage_attestation","attest_author":"https://pith.science/pith/F2VR5DYNVT5WKDID3D7AWRALA3/action/author_attestation","sign_citation":"https://pith.science/pith/F2VR5DYNVT5WKDID3D7AWRALA3/action/citation_signature","submit_replication":"https://pith.science/pith/F2VR5DYNVT5WKDID3D7AWRALA3/action/replication_record"}},"created_at":"2026-05-17T23:50:03.012324+00:00","updated_at":"2026-05-17T23:50:03.012324+00:00"}