{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:KLZSVHIVFV5Q3VAT7FMZKE5FHZ","short_pith_number":"pith:KLZSVHIV","schema_version":"1.0","canonical_sha256":"52f32a9d152d7b0dd413f9599513a53e45f2c8270662ed40b293bcf60a04c4dc","source":{"kind":"arxiv","id":"2507.04228","version":1},"attestation_state":"computed","paper":{"title":"Normalized Iterative Hard Thresholding for Tensor Recovery","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["eess.SP"],"primary_cat":"cs.LG","authors_text":"Jian Lu, Kaijie Zheng, Li Li, Yuneng Liang","submitted_at":"2025-07-06T03:36:50Z","abstract_excerpt":"Low-rank recovery builds upon ideas from the theory of compressive sensing, which predicts that sparse signals can be accurately reconstructed from incomplete measurements. Iterative thresholding-type algorithms-particularly the normalized iterative hard thresholding (NIHT) method-have been widely used in compressed sensing (CS) and applied to matrix recovery tasks. In this paper, we propose a tensor extension of NIHT, referred to as TNIHT, for the recovery of low-rank tensors under two widely used tensor decomposition models. This extension enables the effective reconstruction of high-order l"},"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":"2507.04228","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2025-07-06T03:36:50Z","cross_cats_sorted":["eess.SP"],"title_canon_sha256":"c2730e174925abd9152fdde7335a4237ec67698c40e04710b49e90241622afc8","abstract_canon_sha256":"2f12c951dac47f92784c9004001f2dfefb92d1a1130079bb6345fb777f3a11bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:32:43.886111Z","signature_b64":"NFNSAsaITiNTGS7oIpi9bZWelKhbhWeWIo3LJCcK7mJ0XyhdCIg1RZoZJabtyXScsU39VPuPwqfm0LNw7E3NBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52f32a9d152d7b0dd413f9599513a53e45f2c8270662ed40b293bcf60a04c4dc","last_reissued_at":"2026-07-05T11:32:43.885632Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:32:43.885632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Normalized Iterative Hard Thresholding for Tensor Recovery","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["eess.SP"],"primary_cat":"cs.LG","authors_text":"Jian Lu, Kaijie Zheng, Li Li, Yuneng Liang","submitted_at":"2025-07-06T03:36:50Z","abstract_excerpt":"Low-rank recovery builds upon ideas from the theory of compressive sensing, which predicts that sparse signals can be accurately reconstructed from incomplete measurements. Iterative thresholding-type algorithms-particularly the normalized iterative hard thresholding (NIHT) method-have been widely used in compressed sensing (CS) and applied to matrix recovery tasks. In this paper, we propose a tensor extension of NIHT, referred to as TNIHT, for the recovery of low-rank tensors under two widely used tensor decomposition models. This extension enables the effective reconstruction of high-order l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.04228","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.04228/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":"2507.04228","created_at":"2026-07-05T11:32:43.885687+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.04228v1","created_at":"2026-07-05T11:32:43.885687+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.04228","created_at":"2026-07-05T11:32:43.885687+00:00"},{"alias_kind":"pith_short_12","alias_value":"KLZSVHIVFV5Q","created_at":"2026-07-05T11:32:43.885687+00:00"},{"alias_kind":"pith_short_16","alias_value":"KLZSVHIVFV5Q3VAT","created_at":"2026-07-05T11:32:43.885687+00:00"},{"alias_kind":"pith_short_8","alias_value":"KLZSVHIV","created_at":"2026-07-05T11:32:43.885687+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KLZSVHIVFV5Q3VAT7FMZKE5FHZ","json":"https://pith.science/pith/KLZSVHIVFV5Q3VAT7FMZKE5FHZ.json","graph_json":"https://pith.science/api/pith-number/KLZSVHIVFV5Q3VAT7FMZKE5FHZ/graph.json","events_json":"https://pith.science/api/pith-number/KLZSVHIVFV5Q3VAT7FMZKE5FHZ/events.json","paper":"https://pith.science/paper/KLZSVHIV"},"agent_actions":{"view_html":"https://pith.science/pith/KLZSVHIVFV5Q3VAT7FMZKE5FHZ","download_json":"https://pith.science/pith/KLZSVHIVFV5Q3VAT7FMZKE5FHZ.json","view_paper":"https://pith.science/paper/KLZSVHIV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.04228&json=true","fetch_graph":"https://pith.science/api/pith-number/KLZSVHIVFV5Q3VAT7FMZKE5FHZ/graph.json","fetch_events":"https://pith.science/api/pith-number/KLZSVHIVFV5Q3VAT7FMZKE5FHZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KLZSVHIVFV5Q3VAT7FMZKE5FHZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KLZSVHIVFV5Q3VAT7FMZKE5FHZ/action/storage_attestation","attest_author":"https://pith.science/pith/KLZSVHIVFV5Q3VAT7FMZKE5FHZ/action/author_attestation","sign_citation":"https://pith.science/pith/KLZSVHIVFV5Q3VAT7FMZKE5FHZ/action/citation_signature","submit_replication":"https://pith.science/pith/KLZSVHIVFV5Q3VAT7FMZKE5FHZ/action/replication_record"}},"created_at":"2026-07-05T11:32:43.885687+00:00","updated_at":"2026-07-05T11:32:43.885687+00:00"}