{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:V4LOFRIEF35AKRHYVZ2M7WJPFQ","short_pith_number":"pith:V4LOFRIE","schema_version":"1.0","canonical_sha256":"af16e2c5042efa0544f8ae74cfd92f2c3bdbce9b8606c6080c258c3740fd69f0","source":{"kind":"arxiv","id":"1012.1919","version":3},"attestation_state":"computed","paper":{"title":"Low-Rank Structure Learning via Log-Sum Heuristic Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"cs.NA","authors_text":"Qionghai Dai, Risheng Liu, Sanqing Hu, Yue Deng, Zengke Zhang","submitted_at":"2010-12-09T03:54:44Z","abstract_excerpt":"Recovering intrinsic data structure from corrupted observations plays an important role in various tasks in the communities of machine learning and signal processing. In this paper, we propose a novel model, named log-sum heuristic recovery (LHR), to learn the essential low-rank structure from corrupted data. Different from traditional approaches, which directly utilize $\\ell_1$ norm to measure the sparseness, LHR introduces a more reasonable log-sum measurement to enhance the sparsity in both the intrinsic low-rank structure and in the sparse corruptions. Although the proposed LHR optimizatio"},"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":"1012.1919","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2010-12-09T03:54:44Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"afb639f27d302168c87be9271b563a3debbb0274df082c9cef8f4fd50e80f91b","abstract_canon_sha256":"c7a2b1fc4483bc8e82cdbba1f65ae2b8ecc616769301d9658486bb702eed7b60"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:29.143504Z","signature_b64":"MHY7BYRwublw3gSKlyi87hyFKF1IxhOyjWnqsbA4/2u8xuiItFLeMr/OUvOEE+XMOvXIPZngl1r8dymX4JHdAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af16e2c5042efa0544f8ae74cfd92f2c3bdbce9b8606c6080c258c3740fd69f0","last_reissued_at":"2026-05-18T02:45:29.142835Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:29.142835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-Rank Structure Learning via Log-Sum Heuristic Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"cs.NA","authors_text":"Qionghai Dai, Risheng Liu, Sanqing Hu, Yue Deng, Zengke Zhang","submitted_at":"2010-12-09T03:54:44Z","abstract_excerpt":"Recovering intrinsic data structure from corrupted observations plays an important role in various tasks in the communities of machine learning and signal processing. In this paper, we propose a novel model, named log-sum heuristic recovery (LHR), to learn the essential low-rank structure from corrupted data. Different from traditional approaches, which directly utilize $\\ell_1$ norm to measure the sparseness, LHR introduces a more reasonable log-sum measurement to enhance the sparsity in both the intrinsic low-rank structure and in the sparse corruptions. Although the proposed LHR optimizatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.1919","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1012.1919","created_at":"2026-05-18T02:45:29.142947+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.1919v3","created_at":"2026-05-18T02:45:29.142947+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.1919","created_at":"2026-05-18T02:45:29.142947+00:00"},{"alias_kind":"pith_short_12","alias_value":"V4LOFRIEF35A","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"V4LOFRIEF35AKRHY","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"V4LOFRIE","created_at":"2026-05-18T12:26:15.391820+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/V4LOFRIEF35AKRHYVZ2M7WJPFQ","json":"https://pith.science/pith/V4LOFRIEF35AKRHYVZ2M7WJPFQ.json","graph_json":"https://pith.science/api/pith-number/V4LOFRIEF35AKRHYVZ2M7WJPFQ/graph.json","events_json":"https://pith.science/api/pith-number/V4LOFRIEF35AKRHYVZ2M7WJPFQ/events.json","paper":"https://pith.science/paper/V4LOFRIE"},"agent_actions":{"view_html":"https://pith.science/pith/V4LOFRIEF35AKRHYVZ2M7WJPFQ","download_json":"https://pith.science/pith/V4LOFRIEF35AKRHYVZ2M7WJPFQ.json","view_paper":"https://pith.science/paper/V4LOFRIE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.1919&json=true","fetch_graph":"https://pith.science/api/pith-number/V4LOFRIEF35AKRHYVZ2M7WJPFQ/graph.json","fetch_events":"https://pith.science/api/pith-number/V4LOFRIEF35AKRHYVZ2M7WJPFQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V4LOFRIEF35AKRHYVZ2M7WJPFQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V4LOFRIEF35AKRHYVZ2M7WJPFQ/action/storage_attestation","attest_author":"https://pith.science/pith/V4LOFRIEF35AKRHYVZ2M7WJPFQ/action/author_attestation","sign_citation":"https://pith.science/pith/V4LOFRIEF35AKRHYVZ2M7WJPFQ/action/citation_signature","submit_replication":"https://pith.science/pith/V4LOFRIEF35AKRHYVZ2M7WJPFQ/action/replication_record"}},"created_at":"2026-05-18T02:45:29.142947+00:00","updated_at":"2026-05-18T02:45:29.142947+00:00"}