{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:OEPLGH2UL53RAYEZC3EJUMJ6C7","short_pith_number":"pith:OEPLGH2U","schema_version":"1.0","canonical_sha256":"711eb31f545f7710609916c89a313e17f52ae8ae055f401cfb29c6116728b973","source":{"kind":"arxiv","id":"0807.0575","version":1},"attestation_state":"computed","paper":{"title":"Iteratively re-weighted least squares minimization for sparse recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"C. Sinan Gunturk, Ingrid Daubechies, Massimo Fornasier, Ronald DeVore","submitted_at":"2008-07-03T14:40:23Z","abstract_excerpt":"We analyze an Iteratively Re-weighted Least Squares (IRLS) algorithm for promoting l1-minimization in sparse and compressible vector recovery. We prove its convergence and we estimate its local rate. We show how the algorithm can be modified in order to promote lt-minimization for t<1, and how this modification produces superlinear rates of convergence."},"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":"0807.0575","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2008-07-03T14:40:23Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"6bb0465f52afa124f157b28cb15c7ecffdc061ce6a67c6d5b10d43bcf5b32588","abstract_canon_sha256":"494163f9fb6f5d088356c7decd227e11b1e4def978ad2c77dc9234a2c8f0f489"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T22:06:07.757109Z","signature_b64":"vbpqgtaDJiTpxIrajDmnMN/jfWh8/nZ7G+UboEVlXZe/7SPcelp1U0szdWSe/tjCTkMXu0oSLxaffI5INufHBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"711eb31f545f7710609916c89a313e17f52ae8ae055f401cfb29c6116728b973","last_reissued_at":"2026-06-03T22:06:07.756709Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T22:06:07.756709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iteratively re-weighted least squares minimization for sparse recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"C. Sinan Gunturk, Ingrid Daubechies, Massimo Fornasier, Ronald DeVore","submitted_at":"2008-07-03T14:40:23Z","abstract_excerpt":"We analyze an Iteratively Re-weighted Least Squares (IRLS) algorithm for promoting l1-minimization in sparse and compressible vector recovery. We prove its convergence and we estimate its local rate. We show how the algorithm can be modified in order to promote lt-minimization for t<1, and how this modification produces superlinear rates of convergence."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0807.0575","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/0807.0575/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":"0807.0575","created_at":"2026-06-03T22:06:07.756765+00:00"},{"alias_kind":"arxiv_version","alias_value":"0807.0575v1","created_at":"2026-06-03T22:06:07.756765+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0807.0575","created_at":"2026-06-03T22:06:07.756765+00:00"},{"alias_kind":"pith_short_12","alias_value":"OEPLGH2UL53R","created_at":"2026-06-03T22:06:07.756765+00:00"},{"alias_kind":"pith_short_16","alias_value":"OEPLGH2UL53RAYEZ","created_at":"2026-06-03T22:06:07.756765+00:00"},{"alias_kind":"pith_short_8","alias_value":"OEPLGH2U","created_at":"2026-06-03T22:06:07.756765+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/OEPLGH2UL53RAYEZC3EJUMJ6C7","json":"https://pith.science/pith/OEPLGH2UL53RAYEZC3EJUMJ6C7.json","graph_json":"https://pith.science/api/pith-number/OEPLGH2UL53RAYEZC3EJUMJ6C7/graph.json","events_json":"https://pith.science/api/pith-number/OEPLGH2UL53RAYEZC3EJUMJ6C7/events.json","paper":"https://pith.science/paper/OEPLGH2U"},"agent_actions":{"view_html":"https://pith.science/pith/OEPLGH2UL53RAYEZC3EJUMJ6C7","download_json":"https://pith.science/pith/OEPLGH2UL53RAYEZC3EJUMJ6C7.json","view_paper":"https://pith.science/paper/OEPLGH2U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0807.0575&json=true","fetch_graph":"https://pith.science/api/pith-number/OEPLGH2UL53RAYEZC3EJUMJ6C7/graph.json","fetch_events":"https://pith.science/api/pith-number/OEPLGH2UL53RAYEZC3EJUMJ6C7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OEPLGH2UL53RAYEZC3EJUMJ6C7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OEPLGH2UL53RAYEZC3EJUMJ6C7/action/storage_attestation","attest_author":"https://pith.science/pith/OEPLGH2UL53RAYEZC3EJUMJ6C7/action/author_attestation","sign_citation":"https://pith.science/pith/OEPLGH2UL53RAYEZC3EJUMJ6C7/action/citation_signature","submit_replication":"https://pith.science/pith/OEPLGH2UL53RAYEZC3EJUMJ6C7/action/replication_record"}},"created_at":"2026-06-03T22:06:07.756765+00:00","updated_at":"2026-06-03T22:06:07.756765+00:00"}