{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ULREYWOKCPQLRQG67HCQV5DIDJ","short_pith_number":"pith:ULREYWOK","canonical_record":{"source":{"id":"1909.10132","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-09-23T02:50:58Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"49349804fc5553957f40b3db9d2fe08bc9f1b615d13bb8d806c6fb8acaea9fd1","abstract_canon_sha256":"e61902c230d6c7941434da9f368924288e6125ebf617e2e84bbacb49b3c62e8b"},"schema_version":"1.0"},"canonical_sha256":"a2e24c59ca13e0b8c0def9c50af4681a60aaf446040da0023c0048effbea06f6","source":{"kind":"arxiv","id":"1909.10132","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.10132","created_at":"2026-07-05T01:19:36Z"},{"alias_kind":"arxiv_version","alias_value":"1909.10132v2","created_at":"2026-07-05T01:19:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.10132","created_at":"2026-07-05T01:19:36Z"},{"alias_kind":"pith_short_12","alias_value":"ULREYWOKCPQL","created_at":"2026-07-05T01:19:36Z"},{"alias_kind":"pith_short_16","alias_value":"ULREYWOKCPQLRQG6","created_at":"2026-07-05T01:19:36Z"},{"alias_kind":"pith_short_8","alias_value":"ULREYWOK","created_at":"2026-07-05T01:19:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ULREYWOKCPQLRQG67HCQV5DIDJ","target":"record","payload":{"canonical_record":{"source":{"id":"1909.10132","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-09-23T02:50:58Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"49349804fc5553957f40b3db9d2fe08bc9f1b615d13bb8d806c6fb8acaea9fd1","abstract_canon_sha256":"e61902c230d6c7941434da9f368924288e6125ebf617e2e84bbacb49b3c62e8b"},"schema_version":"1.0"},"canonical_sha256":"a2e24c59ca13e0b8c0def9c50af4681a60aaf446040da0023c0048effbea06f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:19:36.421054Z","signature_b64":"9P4i6BgtSiiM13eBkOKQhsqLQScTxZK4X6GxGiGuxuO4sR57QfMN2PWDhsGZhFYEHBR6Q2/ZmGAcxR5Nc9PBCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2e24c59ca13e0b8c0def9c50af4681a60aaf446040da0023c0048effbea06f6","last_reissued_at":"2026-07-05T01:19:36.420509Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:19:36.420509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1909.10132","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-07-05T01:19:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hgrNhie5uKZpFDWxBq3Aww5JmH1+0KFSC3aqQg6dE/u0MlXbHZDfVO0NgiHpWpEVVCob2BnIaVYRxcrAAtf4Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-25T03:07:39.915979Z"},"content_sha256":"198935a2cfdbc06f00bdf982de3fdef7082ba55fc233aa53b6f4236eb3a9aa8d","schema_version":"1.0","event_id":"sha256:198935a2cfdbc06f00bdf982de3fdef7082ba55fc233aa53b6f4236eb3a9aa8d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ULREYWOKCPQLRQG67HCQV5DIDJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Iterative Hard Thresholding for Low-Tucker-Rank Tensor Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Anna Ma, Deanna Needell, Jing Qin, Rachel Grotheer, Shuang Li","submitted_at":"2019-09-23T02:50:58Z","abstract_excerpt":"Low-rank tensor recovery problems have been widely studied in many applications of signal processing and machine learning. Tucker decomposition is known as one of the most popular decompositions in the tensor framework. In recent years, researchers have developed many state-of-the-art algorithms to address the problem of low-Tucker-rank tensor recovery. Motivated by the favorable properties of the stochastic algorithms, such as stochastic gradient descent and stochastic iterative hard thresholding, we aim to extend the well-known stochastic iterative hard thresholding algorithm to the tensor f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.10132","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.10132/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:19:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TDxv8/AG9zSiOjh6kvUAkLxyw4VQT83k2iG2M3B8cnUhVxy1bG+0yz6zMsTAt8ZpCkVxRi6iBqqoHB1MEXjtDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-25T03:07:39.916364Z"},"content_sha256":"942b653e46462f548e6f445a3d884f6691468cb2fd21bd0c3ea21a1a0f0eb86e","schema_version":"1.0","event_id":"sha256:942b653e46462f548e6f445a3d884f6691468cb2fd21bd0c3ea21a1a0f0eb86e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ULREYWOKCPQLRQG67HCQV5DIDJ/bundle.json","state_url":"https://pith.science/pith/ULREYWOKCPQLRQG67HCQV5DIDJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ULREYWOKCPQLRQG67HCQV5DIDJ/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-07-25T03:07:39Z","links":{"resolver":"https://pith.science/pith/ULREYWOKCPQLRQG67HCQV5DIDJ","bundle":"https://pith.science/pith/ULREYWOKCPQLRQG67HCQV5DIDJ/bundle.json","state":"https://pith.science/pith/ULREYWOKCPQLRQG67HCQV5DIDJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ULREYWOKCPQLRQG67HCQV5DIDJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ULREYWOKCPQLRQG67HCQV5DIDJ","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":"e61902c230d6c7941434da9f368924288e6125ebf617e2e84bbacb49b3c62e8b","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-09-23T02:50:58Z","title_canon_sha256":"49349804fc5553957f40b3db9d2fe08bc9f1b615d13bb8d806c6fb8acaea9fd1"},"schema_version":"1.0","source":{"id":"1909.10132","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.10132","created_at":"2026-07-05T01:19:36Z"},{"alias_kind":"arxiv_version","alias_value":"1909.10132v2","created_at":"2026-07-05T01:19:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.10132","created_at":"2026-07-05T01:19:36Z"},{"alias_kind":"pith_short_12","alias_value":"ULREYWOKCPQL","created_at":"2026-07-05T01:19:36Z"},{"alias_kind":"pith_short_16","alias_value":"ULREYWOKCPQLRQG6","created_at":"2026-07-05T01:19:36Z"},{"alias_kind":"pith_short_8","alias_value":"ULREYWOK","created_at":"2026-07-05T01:19:36Z"}],"graph_snapshots":[{"event_id":"sha256:942b653e46462f548e6f445a3d884f6691468cb2fd21bd0c3ea21a1a0f0eb86e","target":"graph","created_at":"2026-07-05T01:19:36Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1909.10132/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Low-rank tensor recovery problems have been widely studied in many applications of signal processing and machine learning. Tucker decomposition is known as one of the most popular decompositions in the tensor framework. In recent years, researchers have developed many state-of-the-art algorithms to address the problem of low-Tucker-rank tensor recovery. Motivated by the favorable properties of the stochastic algorithms, such as stochastic gradient descent and stochastic iterative hard thresholding, we aim to extend the well-known stochastic iterative hard thresholding algorithm to the tensor f","authors_text":"Anna Ma, Deanna Needell, Jing Qin, Rachel Grotheer, Shuang Li","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-09-23T02:50:58Z","title":"Stochastic Iterative Hard Thresholding for Low-Tucker-Rank Tensor Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.10132","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:198935a2cfdbc06f00bdf982de3fdef7082ba55fc233aa53b6f4236eb3a9aa8d","target":"record","created_at":"2026-07-05T01:19:36Z","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":"e61902c230d6c7941434da9f368924288e6125ebf617e2e84bbacb49b3c62e8b","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-09-23T02:50:58Z","title_canon_sha256":"49349804fc5553957f40b3db9d2fe08bc9f1b615d13bb8d806c6fb8acaea9fd1"},"schema_version":"1.0","source":{"id":"1909.10132","kind":"arxiv","version":2}},"canonical_sha256":"a2e24c59ca13e0b8c0def9c50af4681a60aaf446040da0023c0048effbea06f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2e24c59ca13e0b8c0def9c50af4681a60aaf446040da0023c0048effbea06f6","first_computed_at":"2026-07-05T01:19:36.420509Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:19:36.420509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9P4i6BgtSiiM13eBkOKQhsqLQScTxZK4X6GxGiGuxuO4sR57QfMN2PWDhsGZhFYEHBR6Q2/ZmGAcxR5Nc9PBCg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:19:36.421054Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.10132","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:198935a2cfdbc06f00bdf982de3fdef7082ba55fc233aa53b6f4236eb3a9aa8d","sha256:942b653e46462f548e6f445a3d884f6691468cb2fd21bd0c3ea21a1a0f0eb86e"],"state_sha256":"8d56a5fdd396e3b05d42dcd7d0269174c401b0bebc78703a2701b30e612272b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"155EHIsJD0CglYlxXJgKeqUgPCs+e3+qbQ4D2VfNMlix57EciBJM7eaUqAqtAMfhIpvuZJZ+nVMDNmG6MguLCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-25T03:07:39.918873Z","bundle_sha256":"17f21db844142d3eaf316b2c84e07d24580084ef9eed8ca81b214ab7598eb290"}}