{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:BRZDH4FP4V7GOYVVYCYS6UQZXX","short_pith_number":"pith:BRZDH4FP","schema_version":"1.0","canonical_sha256":"0c7233f0afe57e6762b5c0b12f5219bdd21e268f9e33dfd191a5cf987b4ddae2","source":{"kind":"arxiv","id":"1111.6237","version":3},"attestation_state":"computed","paper":{"title":"Fast Algorithms for Sparse Recovery with Perturbed Dictionary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gang Li, Hao Zhang, Xuebing Han","submitted_at":"2011-11-27T08:45:45Z","abstract_excerpt":"In this paper, we account for approaches of sparse recovery from large underdetermined linear models with perturbation present in both the measurements and the dictionary matrix. Existing methods have high computation and low efficiency. The total least-squares (TLS) criterion has well-documented merits in solving linear regression problems while FOCal Underdetermined System Solver (FOCUSS) has low-computation complexity in sparse recovery. Based on TLS and FOCUSS methods, the present paper develops more fast and robust algorithms, TLS-FOCUSS and SD-FOCUSS. TLS-FOCUSS algorithm is not only nea"},"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":"1111.6237","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-27T08:45:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4aeec38d11cbf540d034556a741590a51e8f8720ae6a6afad5d17d09b5bc68fd","abstract_canon_sha256":"5379c6036dc7edac5a78bcfaf7eb106eaf19a74534a13d13042bd826831d9831"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:36.208733Z","signature_b64":"INpK7RLBlSNcNFLU6EH3GzZ1wQbQKBG5NDNQOwWUZiaLty69Wh6zeE9y00Hog3RvG6Q3e9UQGmgOTHiRDQlhDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c7233f0afe57e6762b5c0b12f5219bdd21e268f9e33dfd191a5cf987b4ddae2","last_reissued_at":"2026-05-18T03:56:36.208281Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:36.208281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Algorithms for Sparse Recovery with Perturbed Dictionary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gang Li, Hao Zhang, Xuebing Han","submitted_at":"2011-11-27T08:45:45Z","abstract_excerpt":"In this paper, we account for approaches of sparse recovery from large underdetermined linear models with perturbation present in both the measurements and the dictionary matrix. Existing methods have high computation and low efficiency. The total least-squares (TLS) criterion has well-documented merits in solving linear regression problems while FOCal Underdetermined System Solver (FOCUSS) has low-computation complexity in sparse recovery. Based on TLS and FOCUSS methods, the present paper develops more fast and robust algorithms, TLS-FOCUSS and SD-FOCUSS. TLS-FOCUSS algorithm is not only nea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.6237","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":"1111.6237","created_at":"2026-05-18T03:56:36.208346+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.6237v3","created_at":"2026-05-18T03:56:36.208346+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.6237","created_at":"2026-05-18T03:56:36.208346+00:00"},{"alias_kind":"pith_short_12","alias_value":"BRZDH4FP4V7G","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BRZDH4FP4V7GOYVV","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BRZDH4FP","created_at":"2026-05-18T12:26:24.575870+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/BRZDH4FP4V7GOYVVYCYS6UQZXX","json":"https://pith.science/pith/BRZDH4FP4V7GOYVVYCYS6UQZXX.json","graph_json":"https://pith.science/api/pith-number/BRZDH4FP4V7GOYVVYCYS6UQZXX/graph.json","events_json":"https://pith.science/api/pith-number/BRZDH4FP4V7GOYVVYCYS6UQZXX/events.json","paper":"https://pith.science/paper/BRZDH4FP"},"agent_actions":{"view_html":"https://pith.science/pith/BRZDH4FP4V7GOYVVYCYS6UQZXX","download_json":"https://pith.science/pith/BRZDH4FP4V7GOYVVYCYS6UQZXX.json","view_paper":"https://pith.science/paper/BRZDH4FP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.6237&json=true","fetch_graph":"https://pith.science/api/pith-number/BRZDH4FP4V7GOYVVYCYS6UQZXX/graph.json","fetch_events":"https://pith.science/api/pith-number/BRZDH4FP4V7GOYVVYCYS6UQZXX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BRZDH4FP4V7GOYVVYCYS6UQZXX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BRZDH4FP4V7GOYVVYCYS6UQZXX/action/storage_attestation","attest_author":"https://pith.science/pith/BRZDH4FP4V7GOYVVYCYS6UQZXX/action/author_attestation","sign_citation":"https://pith.science/pith/BRZDH4FP4V7GOYVVYCYS6UQZXX/action/citation_signature","submit_replication":"https://pith.science/pith/BRZDH4FP4V7GOYVVYCYS6UQZXX/action/replication_record"}},"created_at":"2026-05-18T03:56:36.208346+00:00","updated_at":"2026-05-18T03:56:36.208346+00:00"}