{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VLNK26ER7GLC56ZXYGM3IP7GI3","short_pith_number":"pith:VLNK26ER","schema_version":"1.0","canonical_sha256":"aadaad7891f9962efb37c199b43fe646f6573c9b7c4b1334c2002dbbf8dde1f7","source":{"kind":"arxiv","id":"1907.07167","version":2},"attestation_state":"computed","paper":{"title":"Fast, Provably convergent IRLS Algorithm for p-norm Linear Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA","math.OC"],"primary_cat":"cs.DS","authors_text":"Deeksha Adil, Richard Peng, Sushant Sachdeva","submitted_at":"2019-07-16T17:50:45Z","abstract_excerpt":"Linear regression in $\\ell_p$-norm is a canonical optimization problem that arises in several applications, including sparse recovery, semi-supervised learning, and signal processing. Generic convex optimization algorithms for solving $\\ell_p$-regression are slow in practice. Iteratively Reweighted Least Squares (IRLS) is an easy to implement family of algorithms for solving these problems that has been studied for over 50 years. However, these algorithms often diverge for p > 3, and since the work of Osborne (1985), it has been an open problem whether there is an IRLS algorithm that is guaran"},"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":"1907.07167","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-16T17:50:45Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA","math.OC"],"title_canon_sha256":"f7bacc276f41696b59b0099d692768823d9ac181a0b29e699ef662fdcb963837","abstract_canon_sha256":"537ecac7e61a9293ee32e4dd0e1d33c4ca5c9489c6b94bd60de75a6d054412b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:32:38.845769Z","signature_b64":"Hb+268OpyJK4cn9Hq8AQDzTQ6BWe4ohB+qvtwg1oyiNC0ZLhsjZcE5vs2D+xNfMF8sojVOT0UrSD4c/QRrxHCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aadaad7891f9962efb37c199b43fe646f6573c9b7c4b1334c2002dbbf8dde1f7","last_reissued_at":"2026-07-05T00:32:38.845284Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:32:38.845284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast, Provably convergent IRLS Algorithm for p-norm Linear Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA","math.OC"],"primary_cat":"cs.DS","authors_text":"Deeksha Adil, Richard Peng, Sushant Sachdeva","submitted_at":"2019-07-16T17:50:45Z","abstract_excerpt":"Linear regression in $\\ell_p$-norm is a canonical optimization problem that arises in several applications, including sparse recovery, semi-supervised learning, and signal processing. Generic convex optimization algorithms for solving $\\ell_p$-regression are slow in practice. Iteratively Reweighted Least Squares (IRLS) is an easy to implement family of algorithms for solving these problems that has been studied for over 50 years. However, these algorithms often diverge for p > 3, and since the work of Osborne (1985), it has been an open problem whether there is an IRLS algorithm that is guaran"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07167","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/1907.07167/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":"1907.07167","created_at":"2026-07-05T00:32:38.845343+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.07167v2","created_at":"2026-07-05T00:32:38.845343+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07167","created_at":"2026-07-05T00:32:38.845343+00:00"},{"alias_kind":"pith_short_12","alias_value":"VLNK26ER7GLC","created_at":"2026-07-05T00:32:38.845343+00:00"},{"alias_kind":"pith_short_16","alias_value":"VLNK26ER7GLC56ZX","created_at":"2026-07-05T00:32:38.845343+00:00"},{"alias_kind":"pith_short_8","alias_value":"VLNK26ER","created_at":"2026-07-05T00:32:38.845343+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/VLNK26ER7GLC56ZXYGM3IP7GI3","json":"https://pith.science/pith/VLNK26ER7GLC56ZXYGM3IP7GI3.json","graph_json":"https://pith.science/api/pith-number/VLNK26ER7GLC56ZXYGM3IP7GI3/graph.json","events_json":"https://pith.science/api/pith-number/VLNK26ER7GLC56ZXYGM3IP7GI3/events.json","paper":"https://pith.science/paper/VLNK26ER"},"agent_actions":{"view_html":"https://pith.science/pith/VLNK26ER7GLC56ZXYGM3IP7GI3","download_json":"https://pith.science/pith/VLNK26ER7GLC56ZXYGM3IP7GI3.json","view_paper":"https://pith.science/paper/VLNK26ER","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.07167&json=true","fetch_graph":"https://pith.science/api/pith-number/VLNK26ER7GLC56ZXYGM3IP7GI3/graph.json","fetch_events":"https://pith.science/api/pith-number/VLNK26ER7GLC56ZXYGM3IP7GI3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VLNK26ER7GLC56ZXYGM3IP7GI3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VLNK26ER7GLC56ZXYGM3IP7GI3/action/storage_attestation","attest_author":"https://pith.science/pith/VLNK26ER7GLC56ZXYGM3IP7GI3/action/author_attestation","sign_citation":"https://pith.science/pith/VLNK26ER7GLC56ZXYGM3IP7GI3/action/citation_signature","submit_replication":"https://pith.science/pith/VLNK26ER7GLC56ZXYGM3IP7GI3/action/replication_record"}},"created_at":"2026-07-05T00:32:38.845343+00:00","updated_at":"2026-07-05T00:32:38.845343+00:00"}