{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:6SVLT4CQYZ3LHSAZEFNUQ3O2UP","short_pith_number":"pith:6SVLT4CQ","schema_version":"1.0","canonical_sha256":"f4aab9f050c676b3c819215b486ddaa3eb39764e10a0bb405b1a5ab441f76133","source":{"kind":"arxiv","id":"2311.00783","version":2},"attestation_state":"computed","paper":{"title":"Log-Sum Regularized Kaczmarz Algorithms for High-Order Tensor Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jing Qin, Katherine Henneberger","submitted_at":"2023-11-01T19:02:15Z","abstract_excerpt":"Sparse and low rank tensor recovery has emerged as a significant area of research with applications in many fields such as computer vision. However, minimizing the $\\ell_0$-norm of a vector or the rank of a matrix is NP-hard. Instead, their convex relaxed versions are typically adopted in practice due to the computational efficiency, e.g., log-sum penalty. In this work, we propose novel log-sum regularized Kaczmarz algorithms for recovering high-order tensors with either sparse or low-rank structures. We present block variants along with convergence analysis of the proposed algorithms. Numeric"},"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":"2311.00783","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-11-01T19:02:15Z","cross_cats_sorted":[],"title_canon_sha256":"fc6a3f399c5dd0b33dc3c50e160281b724192401756d5dafb57a8a95cd4d1429","abstract_canon_sha256":"43fec3470e4042ef39e8f1efbe9a962355449d8c3bb7f924125c6ba830da532e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:10:19.315683Z","signature_b64":"Ak4s1HOvG2phCU3unj0d3H3VLjx3ngi5I8jppRkGqkcY+kYMQkSZ9k9hU87k/15mqmokaxVpdJxrmIUVUbVBBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4aab9f050c676b3c819215b486ddaa3eb39764e10a0bb405b1a5ab441f76133","last_reissued_at":"2026-07-05T08:10:19.315284Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:10:19.315284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Log-Sum Regularized Kaczmarz Algorithms for High-Order Tensor Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jing Qin, Katherine Henneberger","submitted_at":"2023-11-01T19:02:15Z","abstract_excerpt":"Sparse and low rank tensor recovery has emerged as a significant area of research with applications in many fields such as computer vision. However, minimizing the $\\ell_0$-norm of a vector or the rank of a matrix is NP-hard. Instead, their convex relaxed versions are typically adopted in practice due to the computational efficiency, e.g., log-sum penalty. In this work, we propose novel log-sum regularized Kaczmarz algorithms for recovering high-order tensors with either sparse or low-rank structures. We present block variants along with convergence analysis of the proposed algorithms. Numeric"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.00783","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/2311.00783/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":"2311.00783","created_at":"2026-07-05T08:10:19.315338+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.00783v2","created_at":"2026-07-05T08:10:19.315338+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.00783","created_at":"2026-07-05T08:10:19.315338+00:00"},{"alias_kind":"pith_short_12","alias_value":"6SVLT4CQYZ3L","created_at":"2026-07-05T08:10:19.315338+00:00"},{"alias_kind":"pith_short_16","alias_value":"6SVLT4CQYZ3LHSAZ","created_at":"2026-07-05T08:10:19.315338+00:00"},{"alias_kind":"pith_short_8","alias_value":"6SVLT4CQ","created_at":"2026-07-05T08:10:19.315338+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/6SVLT4CQYZ3LHSAZEFNUQ3O2UP","json":"https://pith.science/pith/6SVLT4CQYZ3LHSAZEFNUQ3O2UP.json","graph_json":"https://pith.science/api/pith-number/6SVLT4CQYZ3LHSAZEFNUQ3O2UP/graph.json","events_json":"https://pith.science/api/pith-number/6SVLT4CQYZ3LHSAZEFNUQ3O2UP/events.json","paper":"https://pith.science/paper/6SVLT4CQ"},"agent_actions":{"view_html":"https://pith.science/pith/6SVLT4CQYZ3LHSAZEFNUQ3O2UP","download_json":"https://pith.science/pith/6SVLT4CQYZ3LHSAZEFNUQ3O2UP.json","view_paper":"https://pith.science/paper/6SVLT4CQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.00783&json=true","fetch_graph":"https://pith.science/api/pith-number/6SVLT4CQYZ3LHSAZEFNUQ3O2UP/graph.json","fetch_events":"https://pith.science/api/pith-number/6SVLT4CQYZ3LHSAZEFNUQ3O2UP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6SVLT4CQYZ3LHSAZEFNUQ3O2UP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6SVLT4CQYZ3LHSAZEFNUQ3O2UP/action/storage_attestation","attest_author":"https://pith.science/pith/6SVLT4CQYZ3LHSAZEFNUQ3O2UP/action/author_attestation","sign_citation":"https://pith.science/pith/6SVLT4CQYZ3LHSAZEFNUQ3O2UP/action/citation_signature","submit_replication":"https://pith.science/pith/6SVLT4CQYZ3LHSAZEFNUQ3O2UP/action/replication_record"}},"created_at":"2026-07-05T08:10:19.315338+00:00","updated_at":"2026-07-05T08:10:19.315338+00:00"}