{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7S5MUMG6KH7OZVOQF73JUU4CWG","short_pith_number":"pith:7S5MUMG6","canonical_record":{"source":{"id":"1605.08134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-05-26T03:17:33Z","cross_cats_sorted":[],"title_canon_sha256":"1f6e8ea0cdc2c9cdb7df076faa7052e30aa26e778697ee009ab98e359a7ce893","abstract_canon_sha256":"3317784e78415161dbbc24b085c79d23359b81b4b8dbe076fe2e8602558c9552"},"schema_version":"1.0"},"canonical_sha256":"fcbaca30de51feecd5d02ff69a5382b19b43d4d2c5cf842136f6846ed5703600","source":{"kind":"arxiv","id":"1605.08134","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08134","created_at":"2026-05-18T01:13:37Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08134v1","created_at":"2026-05-18T01:13:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08134","created_at":"2026-05-18T01:13:37Z"},{"alias_kind":"pith_short_12","alias_value":"7S5MUMG6KH7O","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7S5MUMG6KH7OZVOQ","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7S5MUMG6","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7S5MUMG6KH7OZVOQF73JUU4CWG","target":"record","payload":{"canonical_record":{"source":{"id":"1605.08134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-05-26T03:17:33Z","cross_cats_sorted":[],"title_canon_sha256":"1f6e8ea0cdc2c9cdb7df076faa7052e30aa26e778697ee009ab98e359a7ce893","abstract_canon_sha256":"3317784e78415161dbbc24b085c79d23359b81b4b8dbe076fe2e8602558c9552"},"schema_version":"1.0"},"canonical_sha256":"fcbaca30de51feecd5d02ff69a5382b19b43d4d2c5cf842136f6846ed5703600","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:37.006949Z","signature_b64":"IW+75DXQaw/3fJwOFB9I4dk5ViRfOC4AeiIg/OIGMuIgKPCzxfTRa6m1SeO0/Seyiqvcq2lXzyKqsCmE3IpEDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcbaca30de51feecd5d02ff69a5382b19b43d4d2c5cf842136f6846ed5703600","last_reissued_at":"2026-05-18T01:13:37.006242Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:37.006242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.08134","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-18T01:13:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yeKciucD7LSoVGxMo2kORrgWcIPCBjxycKNFyPV521LB1D6SvZDR2xmmUb/LqgkL4RHVEUz87PslZSQW434VDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:53:39.355863Z"},"content_sha256":"46db7d122e15b0cb5908febe7e3bc5a091cc4c47fb7db357e02fa29cd84f1c97","schema_version":"1.0","event_id":"sha256:46db7d122e15b0cb5908febe7e3bc5a091cc4c47fb7db357e02fa29cd84f1c97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7S5MUMG6KH7OZVOQF73JUU4CWG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Rank Revealing Randomized Singular Value Decomposition (R3SVD) Algorithm for Low-rank Matrix Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"Hao Ji, Wenjian Yu, Yaohang Li","submitted_at":"2016-05-26T03:17:33Z","abstract_excerpt":"In this paper, we present a Rank Revealing Randomized Singular Value Decomposition (R3SVD) algorithm to incrementally construct a low-rank approximation of a potentially large matrix while adaptively estimating the appropriate rank that can capture most of the actions of the matrix. Starting from a low-rank approximation with an initial guessed rank, R3SVD adopts an orthogonal Gaussian sampling approach to obtain the dominant subspace within the leftover space, which is used to add up to the existing low-rank approximation. Orthogonal Gaussian sampling is repeated until an appropriate low-rank"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08134","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-18T01:13:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/fF7aFZekIYWmz5ZFrIQvTjN2Q9HVD4lbrgJq25++Y4fJrXHiVyB1YIqDntqZrxJYcx3OzcFnJ+nyAoKUkc4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:53:39.356217Z"},"content_sha256":"b32ef6a182e6d677af124afd0143a528da3085d2e2a6add9f415a56505140e2d","schema_version":"1.0","event_id":"sha256:b32ef6a182e6d677af124afd0143a528da3085d2e2a6add9f415a56505140e2d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7S5MUMG6KH7OZVOQF73JUU4CWG/bundle.json","state_url":"https://pith.science/pith/7S5MUMG6KH7OZVOQF73JUU4CWG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7S5MUMG6KH7OZVOQF73JUU4CWG/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-01T21:53:39Z","links":{"resolver":"https://pith.science/pith/7S5MUMG6KH7OZVOQF73JUU4CWG","bundle":"https://pith.science/pith/7S5MUMG6KH7OZVOQF73JUU4CWG/bundle.json","state":"https://pith.science/pith/7S5MUMG6KH7OZVOQF73JUU4CWG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7S5MUMG6KH7OZVOQF73JUU4CWG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7S5MUMG6KH7OZVOQF73JUU4CWG","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":"3317784e78415161dbbc24b085c79d23359b81b4b8dbe076fe2e8602558c9552","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-05-26T03:17:33Z","title_canon_sha256":"1f6e8ea0cdc2c9cdb7df076faa7052e30aa26e778697ee009ab98e359a7ce893"},"schema_version":"1.0","source":{"id":"1605.08134","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08134","created_at":"2026-05-18T01:13:37Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08134v1","created_at":"2026-05-18T01:13:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08134","created_at":"2026-05-18T01:13:37Z"},{"alias_kind":"pith_short_12","alias_value":"7S5MUMG6KH7O","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7S5MUMG6KH7OZVOQ","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7S5MUMG6","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:b32ef6a182e6d677af124afd0143a528da3085d2e2a6add9f415a56505140e2d","target":"graph","created_at":"2026-05-18T01:13:37Z","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":"In this paper, we present a Rank Revealing Randomized Singular Value Decomposition (R3SVD) algorithm to incrementally construct a low-rank approximation of a potentially large matrix while adaptively estimating the appropriate rank that can capture most of the actions of the matrix. Starting from a low-rank approximation with an initial guessed rank, R3SVD adopts an orthogonal Gaussian sampling approach to obtain the dominant subspace within the leftover space, which is used to add up to the existing low-rank approximation. Orthogonal Gaussian sampling is repeated until an appropriate low-rank","authors_text":"Hao Ji, Wenjian Yu, Yaohang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-05-26T03:17:33Z","title":"A Rank Revealing Randomized Singular Value Decomposition (R3SVD) Algorithm for Low-rank Matrix Approximations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08134","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:46db7d122e15b0cb5908febe7e3bc5a091cc4c47fb7db357e02fa29cd84f1c97","target":"record","created_at":"2026-05-18T01:13:37Z","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":"3317784e78415161dbbc24b085c79d23359b81b4b8dbe076fe2e8602558c9552","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-05-26T03:17:33Z","title_canon_sha256":"1f6e8ea0cdc2c9cdb7df076faa7052e30aa26e778697ee009ab98e359a7ce893"},"schema_version":"1.0","source":{"id":"1605.08134","kind":"arxiv","version":1}},"canonical_sha256":"fcbaca30de51feecd5d02ff69a5382b19b43d4d2c5cf842136f6846ed5703600","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fcbaca30de51feecd5d02ff69a5382b19b43d4d2c5cf842136f6846ed5703600","first_computed_at":"2026-05-18T01:13:37.006242Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:37.006242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IW+75DXQaw/3fJwOFB9I4dk5ViRfOC4AeiIg/OIGMuIgKPCzxfTRa6m1SeO0/Seyiqvcq2lXzyKqsCmE3IpEDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:37.006949Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.08134","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46db7d122e15b0cb5908febe7e3bc5a091cc4c47fb7db357e02fa29cd84f1c97","sha256:b32ef6a182e6d677af124afd0143a528da3085d2e2a6add9f415a56505140e2d"],"state_sha256":"858de12b7b048de033692333fb18c779fc9ce4496e4430723235ebc78540409a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ThG3G6XAqWuYU33PAcGJIwhCwKpD142flAy4Mc+uWu3dmuyqQQVeHtg0iO/kk1RkZJidVlSj5uTpZAryM8qmCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:53:39.358621Z","bundle_sha256":"4d03641506c8e76d4af646705b08ff83ea86b59f49acf88f44e8e9171d12174b"}}