{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:F2VR5DYNVT5WKDID3D7AWRALA3","short_pith_number":"pith:F2VR5DYN","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"},"canonical_sha256":"2eab1e8f0dacfb650d03d8fe0b440b06da39ae66d5fad0b25b90b52e0e316c8e","source":{"kind":"arxiv","id":"1903.11543","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.11543","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"arxiv_version","alias_value":"1903.11543v1","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11543","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"pith_short_12","alias_value":"F2VR5DYNVT5W","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"F2VR5DYNVT5WKDID","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"F2VR5DYN","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:F2VR5DYNVT5WKDID3D7AWRALA3","target":"record","payload":{"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"},"canonical_sha256":"2eab1e8f0dacfb650d03d8fe0b440b06da39ae66d5fad0b25b90b52e0e316c8e","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"},"source_kind":"arxiv","source_id":"1903.11543","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:50:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F5CuT0sS/tFGPJaa4xAI/cyuU/XYh78W2/GlQY1gEPHHrSbAKJeH31dGW3QEPhzkO7AZLTHNP8KnOvuTJIEbDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:08:18.762792Z"},"content_sha256":"c748f22c397486fcc4e29ef5199f5fb1228e79bfd7cc5027da92b512099e5d0e","schema_version":"1.0","event_id":"sha256:c748f22c397486fcc4e29ef5199f5fb1228e79bfd7cc5027da92b512099e5d0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:F2VR5DYNVT5WKDID3D7AWRALA3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:50:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1gRvrSdigjpnExl0rIYcX0qq6K4quJlg1JM/x8R8JxGuL3BgABN5kz6Ewawnv7MnFCnhTViWNVBLPgah+6fRBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:08:18.763135Z"},"content_sha256":"692cb15690f59aef6b8147c258ceaaef64618bae6ac56bb63eb3d51e20685093","schema_version":"1.0","event_id":"sha256:692cb15690f59aef6b8147c258ceaaef64618bae6ac56bb63eb3d51e20685093"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F2VR5DYNVT5WKDID3D7AWRALA3/bundle.json","state_url":"https://pith.science/pith/F2VR5DYNVT5WKDID3D7AWRALA3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F2VR5DYNVT5WKDID3D7AWRALA3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T12:08:18Z","links":{"resolver":"https://pith.science/pith/F2VR5DYNVT5WKDID3D7AWRALA3","bundle":"https://pith.science/pith/F2VR5DYNVT5WKDID3D7AWRALA3/bundle.json","state":"https://pith.science/pith/F2VR5DYNVT5WKDID3D7AWRALA3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F2VR5DYNVT5WKDID3D7AWRALA3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:F2VR5DYNVT5WKDID3D7AWRALA3","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":"0aaa27113a38e678a5c22e38df03056e76e91f12da1fb9a39c3719cd36ffaf63","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2019-03-27T16:53:43Z","title_canon_sha256":"77e298d8fccb80687fa7752d202efb07683859a3cdbfc4ff57c70b68857074c9"},"schema_version":"1.0","source":{"id":"1903.11543","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.11543","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"arxiv_version","alias_value":"1903.11543v1","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11543","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"pith_short_12","alias_value":"F2VR5DYNVT5W","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"F2VR5DYNVT5WKDID","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"F2VR5DYN","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:692cb15690f59aef6b8147c258ceaaef64618bae6ac56bb63eb3d51e20685093","target":"graph","created_at":"2026-05-17T23:50: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":"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","authors_text":"Nathan Heavner, Per-Gunnar Martinsson","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2019-03-27T16:53:43Z","title":"Efficient nuclear norm approximation via the randomized UTV algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11543","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:c748f22c397486fcc4e29ef5199f5fb1228e79bfd7cc5027da92b512099e5d0e","target":"record","created_at":"2026-05-17T23:50: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":"0aaa27113a38e678a5c22e38df03056e76e91f12da1fb9a39c3719cd36ffaf63","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2019-03-27T16:53:43Z","title_canon_sha256":"77e298d8fccb80687fa7752d202efb07683859a3cdbfc4ff57c70b68857074c9"},"schema_version":"1.0","source":{"id":"1903.11543","kind":"arxiv","version":1}},"canonical_sha256":"2eab1e8f0dacfb650d03d8fe0b440b06da39ae66d5fad0b25b90b52e0e316c8e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2eab1e8f0dacfb650d03d8fe0b440b06da39ae66d5fad0b25b90b52e0e316c8e","first_computed_at":"2026-05-17T23:50:03.012225Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:03.012225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KLZHs9qH6fogX1nn+wtnu0rIFFuad8WuI+w07OLkJTk7Bn4Z2VpARt8GEUnGj79s3LbncjW6e2Ltpww7nD7dDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:03.012843Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.11543","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c748f22c397486fcc4e29ef5199f5fb1228e79bfd7cc5027da92b512099e5d0e","sha256:692cb15690f59aef6b8147c258ceaaef64618bae6ac56bb63eb3d51e20685093"],"state_sha256":"ad08e265d625635a7e0c493f8c1b13360652d8a8798c8ac0fdbabb0113a54d61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nI0UhPz/XeoofZv8JC+PUQULqPyMhuA6fR7Albam2lNDFV1ceHz6oN95GN4n6F/Kq28jqhCS4FRKSxKsChcBBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:08:18.765372Z","bundle_sha256":"12145fda32ffdcc3c32fa4f9cd4a0d426e63437cc8fac60dbb29cf659dc41402"}}