{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KQ5S47KDU5352DOL5L2RVN33YR","short_pith_number":"pith:KQ5S47KD","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"},"canonical_sha256":"543b2e7d43a777dd0dcbeaf51ab77bc457efb1de296db4ac1bcf761a89a85cbe","source":{"kind":"arxiv","id":"1509.04063","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.04063","created_at":"2026-05-18T01:20:11Z"},{"alias_kind":"arxiv_version","alias_value":"1509.04063v2","created_at":"2026-05-18T01:20:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04063","created_at":"2026-05-18T01:20:11Z"},{"alias_kind":"pith_short_12","alias_value":"KQ5S47KDU535","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KQ5S47KDU5352DOL","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KQ5S47KD","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KQ5S47KDU5352DOL5L2RVN33YR","target":"record","payload":{"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"},"canonical_sha256":"543b2e7d43a777dd0dcbeaf51ab77bc457efb1de296db4ac1bcf761a89a85cbe","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"},"source_kind":"arxiv","source_id":"1509.04063","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:20:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aWXyn1qWxHmk9lkpA+9EloIpdrOya2oil0zYifFv88vz9yqMzoGKTmMQaOZcLJC9965hl5r6FSLFTvV4JS17Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:21:37.437723Z"},"content_sha256":"c61bbfc6e8442a7b5ae3f7f449bdf149607057e517b96cbc928fb48176a5d428","schema_version":"1.0","event_id":"sha256:c61bbfc6e8442a7b5ae3f7f449bdf149607057e517b96cbc928fb48176a5d428"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KQ5S47KDU5352DOL5L2RVN33YR","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:20:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JwmksTkzsKU/rPNMOnEyhP8JlZxLytKkAaDyt/9AN9Zf0aA7Pqp+6tfQxTL3e2n8+nCxlsqRaQnde1Q1dAvYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:21:37.438064Z"},"content_sha256":"5684522701fadda68b3f348c32f1bb0fa94e00f24c36266e1289d84c1b40b74a","schema_version":"1.0","event_id":"sha256:5684522701fadda68b3f348c32f1bb0fa94e00f24c36266e1289d84c1b40b74a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KQ5S47KDU5352DOL5L2RVN33YR/bundle.json","state_url":"https://pith.science/pith/KQ5S47KDU5352DOL5L2RVN33YR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KQ5S47KDU5352DOL5L2RVN33YR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-22T22:21:37Z","links":{"resolver":"https://pith.science/pith/KQ5S47KDU5352DOL5L2RVN33YR","bundle":"https://pith.science/pith/KQ5S47KDU5352DOL5L2RVN33YR/bundle.json","state":"https://pith.science/pith/KQ5S47KDU5352DOL5L2RVN33YR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KQ5S47KDU5352DOL5L2RVN33YR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KQ5S47KDU5352DOL5L2RVN33YR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"be6fc362e757babded4fb49767e8d2dbf66be1f68c3980b0ef5a64fbf9bee1e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-09-14T12:42:42Z","title_canon_sha256":"0cda798ddccdd76ab8624634345b8c0880a750698213306fadcf0a767283c9c3"},"schema_version":"1.0","source":{"id":"1509.04063","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.04063","created_at":"2026-05-18T01:20:11Z"},{"alias_kind":"arxiv_version","alias_value":"1509.04063v2","created_at":"2026-05-18T01:20:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04063","created_at":"2026-05-18T01:20:11Z"},{"alias_kind":"pith_short_12","alias_value":"KQ5S47KDU535","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KQ5S47KDU5352DOL","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KQ5S47KD","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:5684522701fadda68b3f348c32f1bb0fa94e00f24c36266e1289d84c1b40b74a","target":"graph","created_at":"2026-05-18T01:20:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Holger Rauhut, Massimo Fornasier, Steffen Peter, Stephan Worm","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-09-14T12:42:42Z","title":"Conjugate gradient acceleration of iteratively re-weighted least squares methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04063","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c61bbfc6e8442a7b5ae3f7f449bdf149607057e517b96cbc928fb48176a5d428","target":"record","created_at":"2026-05-18T01:20:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"be6fc362e757babded4fb49767e8d2dbf66be1f68c3980b0ef5a64fbf9bee1e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-09-14T12:42:42Z","title_canon_sha256":"0cda798ddccdd76ab8624634345b8c0880a750698213306fadcf0a767283c9c3"},"schema_version":"1.0","source":{"id":"1509.04063","kind":"arxiv","version":2}},"canonical_sha256":"543b2e7d43a777dd0dcbeaf51ab77bc457efb1de296db4ac1bcf761a89a85cbe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"543b2e7d43a777dd0dcbeaf51ab77bc457efb1de296db4ac1bcf761a89a85cbe","first_computed_at":"2026-05-18T01:20:11.246937Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:11.246937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CtlRIYfNfGL5+yN96YSNmxTbGRhp0MhR3mmrFuMpSgmuOI8aV6usybehAbAikplUUolHSE6VGWF9DZNlY9W9BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:11.247645Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.04063","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c61bbfc6e8442a7b5ae3f7f449bdf149607057e517b96cbc928fb48176a5d428","sha256:5684522701fadda68b3f348c32f1bb0fa94e00f24c36266e1289d84c1b40b74a"],"state_sha256":"1ba02aa2b7488be4a191dd0e0b97aa7bf7be5c35ca0a1a88ae8f0723600ce26d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cdaaIaFrj+VOMi0vCRAEQaF4uEn4XcvZQ8VIcvciW//Xdqt7UxjrkFzgcLMEh2S5blSKcUbGWgJ2Wni9qYHmAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T22:21:37.440364Z","bundle_sha256":"42ee9118a4ddd04a1e51a45bbff08567b62f2fb02a6b790fe1f2f9b5b1150b50"}}