{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZBEIU33RZA6AWETL4NQUMRTAGI","short_pith_number":"pith:ZBEIU33R","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"},"canonical_sha256":"c8488a6f71c83c0b126be361464660320cbe9c6477c0ee815e9d8f8de4a60280","source":{"kind":"arxiv","id":"1503.07157","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07157","created_at":"2026-05-18T01:44:11Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07157v2","created_at":"2026-05-18T01:44:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07157","created_at":"2026-05-18T01:44:11Z"},{"alias_kind":"pith_short_12","alias_value":"ZBEIU33RZA6A","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZBEIU33RZA6AWETL","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZBEIU33R","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZBEIU33RZA6AWETL4NQUMRTAGI","target":"record","payload":{"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"},"canonical_sha256":"c8488a6f71c83c0b126be361464660320cbe9c6477c0ee815e9d8f8de4a60280","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"},"source_kind":"arxiv","source_id":"1503.07157","source_version":2,"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-18T01:44:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xTgEdKmH0+hVSwAPBhW0b7fEHtRU7E+YJSxFSapOGpLrqXeV71JBUCgoxXj70ZV6LKDQHRulvuyJ0qSwpzm2BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:08:14.060589Z"},"content_sha256":"7739f9c843c169afa8c57b48eec05515ceb21929f47d3d2378a3f312af004262","schema_version":"1.0","event_id":"sha256:7739f9c843c169afa8c57b48eec05515ceb21929f47d3d2378a3f312af004262"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZBEIU33RZA6AWETL4NQUMRTAGI","target":"graph","payload":{"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"},"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-18T01:44:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YFGvcP1sk/MALY1e+ZrILsvnT7B520FQY6IGL5sCR3jbHtBme1gUoqx16hFfV09NBamXHPGEoITlXyMh2fONAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:08:14.060958Z"},"content_sha256":"3991c4ae9690a7e330b1ee25857ba35421ceee17ead8003461864aae662638d3","schema_version":"1.0","event_id":"sha256:3991c4ae9690a7e330b1ee25857ba35421ceee17ead8003461864aae662638d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZBEIU33RZA6AWETL4NQUMRTAGI/bundle.json","state_url":"https://pith.science/pith/ZBEIU33RZA6AWETL4NQUMRTAGI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZBEIU33RZA6AWETL4NQUMRTAGI/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-01T19:08:14Z","links":{"resolver":"https://pith.science/pith/ZBEIU33RZA6AWETL4NQUMRTAGI","bundle":"https://pith.science/pith/ZBEIU33RZA6AWETL4NQUMRTAGI/bundle.json","state":"https://pith.science/pith/ZBEIU33RZA6AWETL4NQUMRTAGI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZBEIU33RZA6AWETL4NQUMRTAGI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZBEIU33RZA6AWETL4NQUMRTAGI","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":"257691938e1929b05a1fd295f79074faa75f532b4c7501e5f1dd9eb63b48673d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-03-24T19:56:08Z","title_canon_sha256":"0cdfe5ab29889ca22c28d5cf61b821dce242c844717bc920425afaf4075db60f"},"schema_version":"1.0","source":{"id":"1503.07157","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07157","created_at":"2026-05-18T01:44:11Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07157v2","created_at":"2026-05-18T01:44:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07157","created_at":"2026-05-18T01:44:11Z"},{"alias_kind":"pith_short_12","alias_value":"ZBEIU33RZA6A","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZBEIU33RZA6AWETL","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZBEIU33R","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:3991c4ae9690a7e330b1ee25857ba35421ceee17ead8003461864aae662638d3","target":"graph","created_at":"2026-05-18T01:44:11Z","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":"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","authors_text":"Per-Gunnar Martinsson, Sergey Voronin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-03-24T19:56:08Z","title":"A randomized blocked algorithm for efficiently computing rank-revealing factorizations of matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07157","kind":"arxiv","version":2},"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:7739f9c843c169afa8c57b48eec05515ceb21929f47d3d2378a3f312af004262","target":"record","created_at":"2026-05-18T01:44:11Z","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":"257691938e1929b05a1fd295f79074faa75f532b4c7501e5f1dd9eb63b48673d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-03-24T19:56:08Z","title_canon_sha256":"0cdfe5ab29889ca22c28d5cf61b821dce242c844717bc920425afaf4075db60f"},"schema_version":"1.0","source":{"id":"1503.07157","kind":"arxiv","version":2}},"canonical_sha256":"c8488a6f71c83c0b126be361464660320cbe9c6477c0ee815e9d8f8de4a60280","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8488a6f71c83c0b126be361464660320cbe9c6477c0ee815e9d8f8de4a60280","first_computed_at":"2026-05-18T01:44:11.167455Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:44:11.167455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VoZdNaTlrIZ6RruKWVG+nvDXDWx09z5/9I+LN1M8FB9dYgnR9DZ+IvN6V3omSRz1p4Vbe77oT9Ne6NyjVY7cAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:44:11.168079Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.07157","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7739f9c843c169afa8c57b48eec05515ceb21929f47d3d2378a3f312af004262","sha256:3991c4ae9690a7e330b1ee25857ba35421ceee17ead8003461864aae662638d3"],"state_sha256":"7260a65cbf0d7d7cb842c9e55fb692549a7a8a7116fae2b26ad4e50532311ec9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+oa7Y3nn796jM1h4MKo04lD5xcKeie6g8rjPz8ZznNiWy1FYRMquMdM7a3NJNnt2SwrtAC5jwptPXOLGdgRXCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:08:14.062982Z","bundle_sha256":"c040e9d894387c6c45da21a0a6f2e6692275e9cf45955d94fbd80511165a3aa5"}}