{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3SB47HWIJJA7C3RIJRIX4J726A","short_pith_number":"pith:3SB47HWI","canonical_record":{"source":{"id":"1602.03360","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-02-10T13:13:17Z","cross_cats_sorted":[],"title_canon_sha256":"20c461d13560eb01495bf69b3f9a4d96906c0fd409c87d90bcc5fa2a5c2827e2","abstract_canon_sha256":"3ba4d351f7adb5747a36ae15aa71c5733c7ccabe4d4664d4b431d368caf204b1"},"schema_version":"1.0"},"canonical_sha256":"dc83cf9ec84a41f16e284c517e27faf03d4cf3e65a97f1db22995a5976fc0029","source":{"kind":"arxiv","id":"1602.03360","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.03360","created_at":"2026-05-18T01:21:00Z"},{"alias_kind":"arxiv_version","alias_value":"1602.03360v1","created_at":"2026-05-18T01:21:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03360","created_at":"2026-05-18T01:21:00Z"},{"alias_kind":"pith_short_12","alias_value":"3SB47HWIJJA7","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3SB47HWIJJA7C3RI","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3SB47HWI","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3SB47HWIJJA7C3RIJRIX4J726A","target":"record","payload":{"canonical_record":{"source":{"id":"1602.03360","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-02-10T13:13:17Z","cross_cats_sorted":[],"title_canon_sha256":"20c461d13560eb01495bf69b3f9a4d96906c0fd409c87d90bcc5fa2a5c2827e2","abstract_canon_sha256":"3ba4d351f7adb5747a36ae15aa71c5733c7ccabe4d4664d4b431d368caf204b1"},"schema_version":"1.0"},"canonical_sha256":"dc83cf9ec84a41f16e284c517e27faf03d4cf3e65a97f1db22995a5976fc0029","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:00.201827Z","signature_b64":"zxpsSbRP0E9y+7q8bTPx+wh9I+VcQDaMxvfddCHS8NaHPyGhrNskLJpU/TUIEKHJKlIIr1oPdkdsBnnTcDuVDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc83cf9ec84a41f16e284c517e27faf03d4cf3e65a97f1db22995a5976fc0029","last_reissued_at":"2026-05-18T01:21:00.201300Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:00.201300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.03360","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:21:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mEfp8FRFaB3FY+0UXk3KDgH6q6BDs31qINaDQYNvjXlF2afOJ+5JGXNj1aq512uqIcFeNeB7CJBnD8/aQU1GDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T21:06:15.719073Z"},"content_sha256":"b7820d57fa77be2a2ec85edb40b52dde2d8358c97e39bf0fd2dc882d404d5cac","schema_version":"1.0","event_id":"sha256:b7820d57fa77be2a2ec85edb40b52dde2d8358c97e39bf0fd2dc882d404d5cac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3SB47HWIJJA7C3RIJRIX4J726A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matrix Decompositions using sub-Gaussian Random Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Amir Averbuch, Yariv Aizenbud","submitted_at":"2016-02-10T13:13:17Z","abstract_excerpt":"In recent years, several algorithms, which approximate matrix decomposition, have been developed. These algorithms are based on metric conservation features for linear spaces of random projection types. We show that an i.i.d sub-Gaussian matrix with large probability to have zero entries is metric conserving. We also present a new algorithm, which achieves with high probability, a rank $r$ decomposition approximation for an $m \\times n$ matrix that has an asymptotic complexity like state-of-the-art algorithms. We derive an error bound that does not depend on the first $r$ singular values. Alth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03360","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:21:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U85jX2Y1m4gcGPHFhYDW5KFsFfsXaf7NdGI08Q0zhQV8SpmZVUVS4IWH5clX03pG6Mc73tA9a+fEehK3nwaICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T21:06:15.719436Z"},"content_sha256":"6b76b019dc8b80b49f4df48d5a65b3f79f3ae42ce3b185733d4430e20dec3b39","schema_version":"1.0","event_id":"sha256:6b76b019dc8b80b49f4df48d5a65b3f79f3ae42ce3b185733d4430e20dec3b39"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3SB47HWIJJA7C3RIJRIX4J726A/bundle.json","state_url":"https://pith.science/pith/3SB47HWIJJA7C3RIJRIX4J726A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3SB47HWIJJA7C3RIJRIX4J726A/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-23T21:06:15Z","links":{"resolver":"https://pith.science/pith/3SB47HWIJJA7C3RIJRIX4J726A","bundle":"https://pith.science/pith/3SB47HWIJJA7C3RIJRIX4J726A/bundle.json","state":"https://pith.science/pith/3SB47HWIJJA7C3RIJRIX4J726A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3SB47HWIJJA7C3RIJRIX4J726A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3SB47HWIJJA7C3RIJRIX4J726A","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":"3ba4d351f7adb5747a36ae15aa71c5733c7ccabe4d4664d4b431d368caf204b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-02-10T13:13:17Z","title_canon_sha256":"20c461d13560eb01495bf69b3f9a4d96906c0fd409c87d90bcc5fa2a5c2827e2"},"schema_version":"1.0","source":{"id":"1602.03360","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.03360","created_at":"2026-05-18T01:21:00Z"},{"alias_kind":"arxiv_version","alias_value":"1602.03360v1","created_at":"2026-05-18T01:21:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03360","created_at":"2026-05-18T01:21:00Z"},{"alias_kind":"pith_short_12","alias_value":"3SB47HWIJJA7","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3SB47HWIJJA7C3RI","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3SB47HWI","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:6b76b019dc8b80b49f4df48d5a65b3f79f3ae42ce3b185733d4430e20dec3b39","target":"graph","created_at":"2026-05-18T01:21:00Z","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 recent years, several algorithms, which approximate matrix decomposition, have been developed. These algorithms are based on metric conservation features for linear spaces of random projection types. We show that an i.i.d sub-Gaussian matrix with large probability to have zero entries is metric conserving. We also present a new algorithm, which achieves with high probability, a rank $r$ decomposition approximation for an $m \\times n$ matrix that has an asymptotic complexity like state-of-the-art algorithms. We derive an error bound that does not depend on the first $r$ singular values. Alth","authors_text":"Amir Averbuch, Yariv Aizenbud","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-02-10T13:13:17Z","title":"Matrix Decompositions using sub-Gaussian Random Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03360","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:b7820d57fa77be2a2ec85edb40b52dde2d8358c97e39bf0fd2dc882d404d5cac","target":"record","created_at":"2026-05-18T01:21:00Z","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":"3ba4d351f7adb5747a36ae15aa71c5733c7ccabe4d4664d4b431d368caf204b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-02-10T13:13:17Z","title_canon_sha256":"20c461d13560eb01495bf69b3f9a4d96906c0fd409c87d90bcc5fa2a5c2827e2"},"schema_version":"1.0","source":{"id":"1602.03360","kind":"arxiv","version":1}},"canonical_sha256":"dc83cf9ec84a41f16e284c517e27faf03d4cf3e65a97f1db22995a5976fc0029","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc83cf9ec84a41f16e284c517e27faf03d4cf3e65a97f1db22995a5976fc0029","first_computed_at":"2026-05-18T01:21:00.201300Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:00.201300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zxpsSbRP0E9y+7q8bTPx+wh9I+VcQDaMxvfddCHS8NaHPyGhrNskLJpU/TUIEKHJKlIIr1oPdkdsBnnTcDuVDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:00.201827Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.03360","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7820d57fa77be2a2ec85edb40b52dde2d8358c97e39bf0fd2dc882d404d5cac","sha256:6b76b019dc8b80b49f4df48d5a65b3f79f3ae42ce3b185733d4430e20dec3b39"],"state_sha256":"d398dfd8315246cedbaab76aedaaa6496f829f13cb0fee1cd1be2b89bf126403"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F+2rZ6Ips5FaMTOGgWNTC0KlW64OLF0zR8ifukv9A9zStoe0OKFYNZRW4/n+vHQ6Kwyc2TMfTKnKh4/zvNzzCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T21:06:15.721269Z","bundle_sha256":"3175f5e20ce2718b1576d2720afbdbed41364d39dd08ba50b91c38535055bc48"}}