{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KQ5S47KDU5352DOL5L2RVN33YR","short_pith_number":"pith:KQ5S47KD","schema_version":"1.0","canonical_sha256":"543b2e7d43a777dd0dcbeaf51ab77bc457efb1de296db4ac1bcf761a89a85cbe","source":{"kind":"arxiv","id":"1509.04063","version":2},"attestation_state":"computed","paper":{"title":"Conjugate gradient acceleration of iteratively re-weighted least squares methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Holger Rauhut, Massimo Fornasier, Steffen Peter, Stephan Worm","submitted_at":"2015-09-14T12:42:42Z","abstract_excerpt":"Iteratively Re-weighted Least Squares (IRLS) is a method for solving minimization problems involving non-quadratic cost functions, perhaps non-convex and non-smooth, which however can be described as the infimum over a family of quadratic functions. This transformation suggests an algorithmic scheme that solves a sequence of quadratic problems to be tackled efficiently by tools of numerical linear algebra. Its general scope and its usually simple implementation, transforming the initial non-convex and non-smooth minimization problem into a more familiar and easily solvable quadratic optimizati"},"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":"1509.04063","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-09-14T12:42:42Z","cross_cats_sorted":[],"title_canon_sha256":"0cda798ddccdd76ab8624634345b8c0880a750698213306fadcf0a767283c9c3","abstract_canon_sha256":"be6fc362e757babded4fb49767e8d2dbf66be1f68c3980b0ef5a64fbf9bee1e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:11.247645Z","signature_b64":"CtlRIYfNfGL5+yN96YSNmxTbGRhp0MhR3mmrFuMpSgmuOI8aV6usybehAbAikplUUolHSE6VGWF9DZNlY9W9BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"543b2e7d43a777dd0dcbeaf51ab77bc457efb1de296db4ac1bcf761a89a85cbe","last_reissued_at":"2026-05-18T01:20:11.246937Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:11.246937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Conjugate gradient acceleration of iteratively re-weighted least squares methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Holger Rauhut, Massimo Fornasier, Steffen Peter, Stephan Worm","submitted_at":"2015-09-14T12:42:42Z","abstract_excerpt":"Iteratively Re-weighted Least Squares (IRLS) is a method for solving minimization problems involving non-quadratic cost functions, perhaps non-convex and non-smooth, which however can be described as the infimum over a family of quadratic functions. This transformation suggests an algorithmic scheme that solves a sequence of quadratic problems to be tackled efficiently by tools of numerical linear algebra. Its general scope and its usually simple implementation, transforming the initial non-convex and non-smooth minimization problem into a more familiar and easily solvable quadratic optimizati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04063","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":""},"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":"1509.04063","created_at":"2026-05-18T01:20:11.247056+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.04063v2","created_at":"2026-05-18T01:20:11.247056+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04063","created_at":"2026-05-18T01:20:11.247056+00:00"},{"alias_kind":"pith_short_12","alias_value":"KQ5S47KDU535","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"KQ5S47KDU5352DOL","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"KQ5S47KD","created_at":"2026-05-18T12:29:29.992203+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/KQ5S47KDU5352DOL5L2RVN33YR","json":"https://pith.science/pith/KQ5S47KDU5352DOL5L2RVN33YR.json","graph_json":"https://pith.science/api/pith-number/KQ5S47KDU5352DOL5L2RVN33YR/graph.json","events_json":"https://pith.science/api/pith-number/KQ5S47KDU5352DOL5L2RVN33YR/events.json","paper":"https://pith.science/paper/KQ5S47KD"},"agent_actions":{"view_html":"https://pith.science/pith/KQ5S47KDU5352DOL5L2RVN33YR","download_json":"https://pith.science/pith/KQ5S47KDU5352DOL5L2RVN33YR.json","view_paper":"https://pith.science/paper/KQ5S47KD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.04063&json=true","fetch_graph":"https://pith.science/api/pith-number/KQ5S47KDU5352DOL5L2RVN33YR/graph.json","fetch_events":"https://pith.science/api/pith-number/KQ5S47KDU5352DOL5L2RVN33YR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KQ5S47KDU5352DOL5L2RVN33YR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KQ5S47KDU5352DOL5L2RVN33YR/action/storage_attestation","attest_author":"https://pith.science/pith/KQ5S47KDU5352DOL5L2RVN33YR/action/author_attestation","sign_citation":"https://pith.science/pith/KQ5S47KDU5352DOL5L2RVN33YR/action/citation_signature","submit_replication":"https://pith.science/pith/KQ5S47KDU5352DOL5L2RVN33YR/action/replication_record"}},"created_at":"2026-05-18T01:20:11.247056+00:00","updated_at":"2026-05-18T01:20:11.247056+00:00"}