{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IIGPO64ANGX5TG435QSTKYIK42","short_pith_number":"pith:IIGPO64A","canonical_record":{"source":{"id":"1905.07311","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-05-17T15:05:52Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"1fe5fad0beffcb59dd09657b4d8015c7dc66451676461884a27a6b19654cf018","abstract_canon_sha256":"ed8733b3c1d5a8570657b0c5759135094ffac73f9e4e84f419a7094e7d56ea06"},"schema_version":"1.0"},"canonical_sha256":"420cf77b8069afd99b9bec2535610ae69c607e2b6ecce5f21eb4262682ae7a91","source":{"kind":"arxiv","id":"1905.07311","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07311","created_at":"2026-05-17T23:45:55Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07311v1","created_at":"2026-05-17T23:45:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07311","created_at":"2026-05-17T23:45:55Z"},{"alias_kind":"pith_short_12","alias_value":"IIGPO64ANGX5","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IIGPO64ANGX5TG43","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IIGPO64A","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IIGPO64ANGX5TG435QSTKYIK42","target":"record","payload":{"canonical_record":{"source":{"id":"1905.07311","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-05-17T15:05:52Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"1fe5fad0beffcb59dd09657b4d8015c7dc66451676461884a27a6b19654cf018","abstract_canon_sha256":"ed8733b3c1d5a8570657b0c5759135094ffac73f9e4e84f419a7094e7d56ea06"},"schema_version":"1.0"},"canonical_sha256":"420cf77b8069afd99b9bec2535610ae69c607e2b6ecce5f21eb4262682ae7a91","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:55.904510Z","signature_b64":"CrnUsG3puJgSmGdWX67ICdSoPVrjh3CcMM4HOOF7r6ArcSqnXE7sKonrkZV3dUl0ZXzhPwc7UeKV7Ncj8pMEAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"420cf77b8069afd99b9bec2535610ae69c607e2b6ecce5f21eb4262682ae7a91","last_reissued_at":"2026-05-17T23:45:55.903999Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:55.903999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.07311","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:45:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W/UXQD/0Yqo6DTDdxuMylQd8gxAEP//W+vRF+A2I9K+T7o/sqzy++LlbZyNCJ8634zcMdI5BWlDg7nDik0qiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:33:03.253135Z"},"content_sha256":"e053bad2d14aeff5e5a094b3a30219375d4283e16b6cc39c4daedb3d6066923c","schema_version":"1.0","event_id":"sha256:e053bad2d14aeff5e5a094b3a30219375d4283e16b6cc39c4daedb3d6066923c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IIGPO64ANGX5TG435QSTKYIK42","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Randomized algorithms for low-rank tensor decompositions in the Tucker format","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Arvind K. Saibaba, Misha E. Kilmer, Rachel Minster","submitted_at":"2019-05-17T15:05:52Z","abstract_excerpt":"Many applications in data science and scientific computing involve large-scale datasets that are expensive to store and compute with, but can be efficiently compressed and stored in an appropriate tensor format. In recent years, randomized matrix methods have been used to efficiently and accurately compute low-rank matrix decompositions. Motivated by this success, we focus on developing randomized algorithms for tensor decompositions in the Tucker representation. Specifically, we present randomized versions of two well-known compression algorithms, namely, HOSVD and STHOSVD. We present a detai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07311","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:45:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jtg5U6g9aeZ7Sldd9kPVeK///P92XobG5IN2uIZ29Mykir/TzGZceRa9SolefPZp7dHgnE4a4rA6rqgytMmpBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:33:03.253503Z"},"content_sha256":"06b8b35125beedb989b723d33de2a60ea6b2560d4df77eaf1d0454267c7cadd8","schema_version":"1.0","event_id":"sha256:06b8b35125beedb989b723d33de2a60ea6b2560d4df77eaf1d0454267c7cadd8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IIGPO64ANGX5TG435QSTKYIK42/bundle.json","state_url":"https://pith.science/pith/IIGPO64ANGX5TG435QSTKYIK42/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IIGPO64ANGX5TG435QSTKYIK42/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-23T00:33:03Z","links":{"resolver":"https://pith.science/pith/IIGPO64ANGX5TG435QSTKYIK42","bundle":"https://pith.science/pith/IIGPO64ANGX5TG435QSTKYIK42/bundle.json","state":"https://pith.science/pith/IIGPO64ANGX5TG435QSTKYIK42/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IIGPO64ANGX5TG435QSTKYIK42/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IIGPO64ANGX5TG435QSTKYIK42","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":"ed8733b3c1d5a8570657b0c5759135094ffac73f9e4e84f419a7094e7d56ea06","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-05-17T15:05:52Z","title_canon_sha256":"1fe5fad0beffcb59dd09657b4d8015c7dc66451676461884a27a6b19654cf018"},"schema_version":"1.0","source":{"id":"1905.07311","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07311","created_at":"2026-05-17T23:45:55Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07311v1","created_at":"2026-05-17T23:45:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07311","created_at":"2026-05-17T23:45:55Z"},{"alias_kind":"pith_short_12","alias_value":"IIGPO64ANGX5","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IIGPO64ANGX5TG43","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IIGPO64A","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:06b8b35125beedb989b723d33de2a60ea6b2560d4df77eaf1d0454267c7cadd8","target":"graph","created_at":"2026-05-17T23:45:55Z","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":"Many applications in data science and scientific computing involve large-scale datasets that are expensive to store and compute with, but can be efficiently compressed and stored in an appropriate tensor format. In recent years, randomized matrix methods have been used to efficiently and accurately compute low-rank matrix decompositions. Motivated by this success, we focus on developing randomized algorithms for tensor decompositions in the Tucker representation. Specifically, we present randomized versions of two well-known compression algorithms, namely, HOSVD and STHOSVD. We present a detai","authors_text":"Arvind K. Saibaba, Misha E. Kilmer, Rachel Minster","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-05-17T15:05:52Z","title":"Randomized algorithms for low-rank tensor decompositions in the Tucker format"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07311","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:e053bad2d14aeff5e5a094b3a30219375d4283e16b6cc39c4daedb3d6066923c","target":"record","created_at":"2026-05-17T23:45:55Z","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":"ed8733b3c1d5a8570657b0c5759135094ffac73f9e4e84f419a7094e7d56ea06","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-05-17T15:05:52Z","title_canon_sha256":"1fe5fad0beffcb59dd09657b4d8015c7dc66451676461884a27a6b19654cf018"},"schema_version":"1.0","source":{"id":"1905.07311","kind":"arxiv","version":1}},"canonical_sha256":"420cf77b8069afd99b9bec2535610ae69c607e2b6ecce5f21eb4262682ae7a91","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"420cf77b8069afd99b9bec2535610ae69c607e2b6ecce5f21eb4262682ae7a91","first_computed_at":"2026-05-17T23:45:55.903999Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:55.903999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CrnUsG3puJgSmGdWX67ICdSoPVrjh3CcMM4HOOF7r6ArcSqnXE7sKonrkZV3dUl0ZXzhPwc7UeKV7Ncj8pMEAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:55.904510Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.07311","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e053bad2d14aeff5e5a094b3a30219375d4283e16b6cc39c4daedb3d6066923c","sha256:06b8b35125beedb989b723d33de2a60ea6b2560d4df77eaf1d0454267c7cadd8"],"state_sha256":"64e6e192b3219960a4d8ad8cc4ac743e13a221252d62015bf1612dbe5a87377b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u2D7kYfrtJx89EofUizTQzmdOIE8e+kLKRWAoN6kQoSGH199zRQgx8a7QH2rASJpiAhioogTVi2auL7ceACMBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T00:33:03.255555Z","bundle_sha256":"bc97f46d2c469f42ced2b80d1e2ad27b2541b5323d93cfdd753bc82795c918f9"}}