{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:5AES7VRJVJUAGZ2EUNIT63ARHH","short_pith_number":"pith:5AES7VRJ","schema_version":"1.0","canonical_sha256":"e8092fd629aa68036744a3513f6c1139d58bc314c4fb6f94805891ced5f828cc","source":{"kind":"arxiv","id":"2304.04860","version":2},"attestation_state":"computed","paper":{"title":"Iterative Singular Tube Hard Thresholding Algorithms for Tensor Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anna Ma, Deanna Needell, Jing Qin, Rachel Grotheer, Shuang Li","submitted_at":"2023-04-10T20:46:32Z","abstract_excerpt":"Due to the explosive growth of large-scale data sets, tensors have been a vital tool to analyze and process high-dimensional data. Different from the matrix case, tensor decomposition has been defined in various formats, which can be further used to define the best low-rank approximation of a tensor to significantly reduce the dimensionality for signal compression and recovery. In this paper, we consider the low-rank tensor recovery problem when the tubal rank of the underlying tensor is given or estimated a priori. We propose a novel class of iterative singular tube hard thresholding algorith"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2304.04860","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-04-10T20:46:32Z","cross_cats_sorted":[],"title_canon_sha256":"d24a8c38f6099287cb488fb1b37bfacf2ecc7e3598ceec6edfdebeeb482f260c","abstract_canon_sha256":"fd7f27ad2772b78dc4e068593ef1c5e80791f1a7f032d68ee5cdd7c7a012e850"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:27:44.406726Z","signature_b64":"jWBofrI8kjU+LCHYciuvRs328gW/uqQryK9TwTeqeOmX3Z7xI+LWKgVaTifWgU7kJH5i/lPuhwVlaH54iiXGCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8092fd629aa68036744a3513f6c1139d58bc314c4fb6f94805891ced5f828cc","last_reissued_at":"2026-07-05T07:27:44.406296Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:27:44.406296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iterative Singular Tube Hard Thresholding Algorithms for Tensor Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anna Ma, Deanna Needell, Jing Qin, Rachel Grotheer, Shuang Li","submitted_at":"2023-04-10T20:46:32Z","abstract_excerpt":"Due to the explosive growth of large-scale data sets, tensors have been a vital tool to analyze and process high-dimensional data. Different from the matrix case, tensor decomposition has been defined in various formats, which can be further used to define the best low-rank approximation of a tensor to significantly reduce the dimensionality for signal compression and recovery. In this paper, we consider the low-rank tensor recovery problem when the tubal rank of the underlying tensor is given or estimated a priori. We propose a novel class of iterative singular tube hard thresholding algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.04860","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/2304.04860/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2304.04860","created_at":"2026-07-05T07:27:44.406357+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.04860v2","created_at":"2026-07-05T07:27:44.406357+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.04860","created_at":"2026-07-05T07:27:44.406357+00:00"},{"alias_kind":"pith_short_12","alias_value":"5AES7VRJVJUA","created_at":"2026-07-05T07:27:44.406357+00:00"},{"alias_kind":"pith_short_16","alias_value":"5AES7VRJVJUAGZ2E","created_at":"2026-07-05T07:27:44.406357+00:00"},{"alias_kind":"pith_short_8","alias_value":"5AES7VRJ","created_at":"2026-07-05T07:27:44.406357+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.04228","citing_title":"Normalized Iterative Hard Thresholding for Tensor Recovery","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5AES7VRJVJUAGZ2EUNIT63ARHH","json":"https://pith.science/pith/5AES7VRJVJUAGZ2EUNIT63ARHH.json","graph_json":"https://pith.science/api/pith-number/5AES7VRJVJUAGZ2EUNIT63ARHH/graph.json","events_json":"https://pith.science/api/pith-number/5AES7VRJVJUAGZ2EUNIT63ARHH/events.json","paper":"https://pith.science/paper/5AES7VRJ"},"agent_actions":{"view_html":"https://pith.science/pith/5AES7VRJVJUAGZ2EUNIT63ARHH","download_json":"https://pith.science/pith/5AES7VRJVJUAGZ2EUNIT63ARHH.json","view_paper":"https://pith.science/paper/5AES7VRJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.04860&json=true","fetch_graph":"https://pith.science/api/pith-number/5AES7VRJVJUAGZ2EUNIT63ARHH/graph.json","fetch_events":"https://pith.science/api/pith-number/5AES7VRJVJUAGZ2EUNIT63ARHH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5AES7VRJVJUAGZ2EUNIT63ARHH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5AES7VRJVJUAGZ2EUNIT63ARHH/action/storage_attestation","attest_author":"https://pith.science/pith/5AES7VRJVJUAGZ2EUNIT63ARHH/action/author_attestation","sign_citation":"https://pith.science/pith/5AES7VRJVJUAGZ2EUNIT63ARHH/action/citation_signature","submit_replication":"https://pith.science/pith/5AES7VRJVJUAGZ2EUNIT63ARHH/action/replication_record"}},"created_at":"2026-07-05T07:27:44.406357+00:00","updated_at":"2026-07-05T07:27:44.406357+00:00"}