{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZBEIU33RZA6AWETL4NQUMRTAGI","short_pith_number":"pith:ZBEIU33R","schema_version":"1.0","canonical_sha256":"c8488a6f71c83c0b126be361464660320cbe9c6477c0ee815e9d8f8de4a60280","source":{"kind":"arxiv","id":"1503.07157","version":2},"attestation_state":"computed","paper":{"title":"A randomized blocked algorithm for efficiently computing rank-revealing factorizations of matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Per-Gunnar Martinsson, Sergey Voronin","submitted_at":"2015-03-24T19:56:08Z","abstract_excerpt":"This manuscript describes a technique for computing partial rank-revealing factorizations, such as, e.g, a partial QR factorization or a partial singular value decomposition. The method takes as input a tolerance $\\varepsilon$ and an $m\\times n$ matrix $A$, and returns an approximate low rank factorization of $A$ that is accurate to within precision $\\varepsilon$ in the Frobenius norm (or some other easily computed norm). The rank $k$ of the computed factorization (which is an output of the algorithm) is in all examples we examined very close to the theoretically optimal $\\varepsilon$-rank. Th"},"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":"1503.07157","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-03-24T19:56:08Z","cross_cats_sorted":[],"title_canon_sha256":"0cdfe5ab29889ca22c28d5cf61b821dce242c844717bc920425afaf4075db60f","abstract_canon_sha256":"257691938e1929b05a1fd295f79074faa75f532b4c7501e5f1dd9eb63b48673d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:44:11.168079Z","signature_b64":"VoZdNaTlrIZ6RruKWVG+nvDXDWx09z5/9I+LN1M8FB9dYgnR9DZ+IvN6V3omSRz1p4Vbe77oT9Ne6NyjVY7cAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8488a6f71c83c0b126be361464660320cbe9c6477c0ee815e9d8f8de4a60280","last_reissued_at":"2026-05-18T01:44:11.167455Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:44:11.167455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A randomized blocked algorithm for efficiently computing rank-revealing factorizations of matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Per-Gunnar Martinsson, Sergey Voronin","submitted_at":"2015-03-24T19:56:08Z","abstract_excerpt":"This manuscript describes a technique for computing partial rank-revealing factorizations, such as, e.g, a partial QR factorization or a partial singular value decomposition. The method takes as input a tolerance $\\varepsilon$ and an $m\\times n$ matrix $A$, and returns an approximate low rank factorization of $A$ that is accurate to within precision $\\varepsilon$ in the Frobenius norm (or some other easily computed norm). The rank $k$ of the computed factorization (which is an output of the algorithm) is in all examples we examined very close to the theoretically optimal $\\varepsilon$-rank. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07157","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":"1503.07157","created_at":"2026-05-18T01:44:11.167540+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.07157v2","created_at":"2026-05-18T01:44:11.167540+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07157","created_at":"2026-05-18T01:44:11.167540+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZBEIU33RZA6A","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZBEIU33RZA6AWETL","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZBEIU33R","created_at":"2026-05-18T12:29:52.810259+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/ZBEIU33RZA6AWETL4NQUMRTAGI","json":"https://pith.science/pith/ZBEIU33RZA6AWETL4NQUMRTAGI.json","graph_json":"https://pith.science/api/pith-number/ZBEIU33RZA6AWETL4NQUMRTAGI/graph.json","events_json":"https://pith.science/api/pith-number/ZBEIU33RZA6AWETL4NQUMRTAGI/events.json","paper":"https://pith.science/paper/ZBEIU33R"},"agent_actions":{"view_html":"https://pith.science/pith/ZBEIU33RZA6AWETL4NQUMRTAGI","download_json":"https://pith.science/pith/ZBEIU33RZA6AWETL4NQUMRTAGI.json","view_paper":"https://pith.science/paper/ZBEIU33R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.07157&json=true","fetch_graph":"https://pith.science/api/pith-number/ZBEIU33RZA6AWETL4NQUMRTAGI/graph.json","fetch_events":"https://pith.science/api/pith-number/ZBEIU33RZA6AWETL4NQUMRTAGI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZBEIU33RZA6AWETL4NQUMRTAGI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZBEIU33RZA6AWETL4NQUMRTAGI/action/storage_attestation","attest_author":"https://pith.science/pith/ZBEIU33RZA6AWETL4NQUMRTAGI/action/author_attestation","sign_citation":"https://pith.science/pith/ZBEIU33RZA6AWETL4NQUMRTAGI/action/citation_signature","submit_replication":"https://pith.science/pith/ZBEIU33RZA6AWETL4NQUMRTAGI/action/replication_record"}},"created_at":"2026-05-18T01:44:11.167540+00:00","updated_at":"2026-05-18T01:44:11.167540+00:00"}