{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5HSDARFIWFSTSTHWEPWTAY4IGA","short_pith_number":"pith:5HSDARFI","canonical_record":{"source":{"id":"1806.06502","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-06-18T05:43:09Z","cross_cats_sorted":[],"title_canon_sha256":"4c3f9899476512091ecabeae4817c080850989d133cbd2022034a0289f3cedec","abstract_canon_sha256":"0c8e8f064daeb3a54920be16cd0ca407b7b69c0b0fb0d5bc21e7988bdabbc35d"},"schema_version":"1.0"},"canonical_sha256":"e9e43044a8b165394cf623ed30638830300f19bdcc848009bf3498a234ffb05f","source":{"kind":"arxiv","id":"1806.06502","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.06502","created_at":"2026-05-18T00:13:02Z"},{"alias_kind":"arxiv_version","alias_value":"1806.06502v1","created_at":"2026-05-18T00:13:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06502","created_at":"2026-05-18T00:13:02Z"},{"alias_kind":"pith_short_12","alias_value":"5HSDARFIWFST","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5HSDARFIWFSTSTHW","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5HSDARFI","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5HSDARFIWFSTSTHWEPWTAY4IGA","target":"record","payload":{"canonical_record":{"source":{"id":"1806.06502","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-06-18T05:43:09Z","cross_cats_sorted":[],"title_canon_sha256":"4c3f9899476512091ecabeae4817c080850989d133cbd2022034a0289f3cedec","abstract_canon_sha256":"0c8e8f064daeb3a54920be16cd0ca407b7b69c0b0fb0d5bc21e7988bdabbc35d"},"schema_version":"1.0"},"canonical_sha256":"e9e43044a8b165394cf623ed30638830300f19bdcc848009bf3498a234ffb05f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:02.181960Z","signature_b64":"hYTYnJVNByXeaR2t7IzMJ+yUyR5qGxwuaVlUSTJvamEAHWhuK14ZRDE8KKrM9PKjBgiVTepnc2YXbG5YO4nWCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9e43044a8b165394cf623ed30638830300f19bdcc848009bf3498a234ffb05f","last_reissued_at":"2026-05-18T00:13:02.181206Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:02.181206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.06502","source_version":1,"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-18T00:13:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hnfVeNpSsf+OPRTZix8uuX0q/hoGonFaEPqP7wbRmFYZGYu0D+BEBA44eL4tU2SgVnlLLu9peTjhCZVO77kFCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:39:56.903401Z"},"content_sha256":"e76319ef6e334fada33817f04cb05f53a79bf1b7da01b62a4bb9a016acf68b44","schema_version":"1.0","event_id":"sha256:e76319ef6e334fada33817f04cb05f53a79bf1b7da01b62a4bb9a016acf68b44"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5HSDARFIWFSTSTHWEPWTAY4IGA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Flexible Krylov methods for $\\ell_p$ regularization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Julianne Chung, Silvia Gazzola","submitted_at":"2018-06-18T05:43:09Z","abstract_excerpt":"In this paper we develop flexible Krylov methods for efficiently computing regularized solutions to large-scale linear inverse problems with an $\\ell_2$ fit-to-data term and an $\\ell_p$ penalization term, for $p\\geq 1$. First we approximate the $p$-norm penalization term as a sequence of $2$-norm penalization terms using adaptive regularization matrices in an iterative reweighted norm fashion, and then we exploit flexible preconditioning techniques to efficiently incorporate the weight updates. To handle general (non-square) $\\ell_p$-regularized least-squares problems, we introduce a flexible "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06502","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":""},"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-18T00:13:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f4ntM/UYe+Id3LHcZsbdhdEWYFc93peDL2z0HBQkPnezvwgkNomYzGLmPvdOEqx1KX2by7eZTYsVYPsXw6bkCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:39:56.903755Z"},"content_sha256":"a46973c53c065edcb43168d4ee4177309561c5d4b5877034d1597cabb4675602","schema_version":"1.0","event_id":"sha256:a46973c53c065edcb43168d4ee4177309561c5d4b5877034d1597cabb4675602"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5HSDARFIWFSTSTHWEPWTAY4IGA/bundle.json","state_url":"https://pith.science/pith/5HSDARFIWFSTSTHWEPWTAY4IGA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5HSDARFIWFSTSTHWEPWTAY4IGA/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-20T09:39:56Z","links":{"resolver":"https://pith.science/pith/5HSDARFIWFSTSTHWEPWTAY4IGA","bundle":"https://pith.science/pith/5HSDARFIWFSTSTHWEPWTAY4IGA/bundle.json","state":"https://pith.science/pith/5HSDARFIWFSTSTHWEPWTAY4IGA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5HSDARFIWFSTSTHWEPWTAY4IGA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5HSDARFIWFSTSTHWEPWTAY4IGA","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":"0c8e8f064daeb3a54920be16cd0ca407b7b69c0b0fb0d5bc21e7988bdabbc35d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-06-18T05:43:09Z","title_canon_sha256":"4c3f9899476512091ecabeae4817c080850989d133cbd2022034a0289f3cedec"},"schema_version":"1.0","source":{"id":"1806.06502","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.06502","created_at":"2026-05-18T00:13:02Z"},{"alias_kind":"arxiv_version","alias_value":"1806.06502v1","created_at":"2026-05-18T00:13:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06502","created_at":"2026-05-18T00:13:02Z"},{"alias_kind":"pith_short_12","alias_value":"5HSDARFIWFST","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5HSDARFIWFSTSTHW","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5HSDARFI","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:a46973c53c065edcb43168d4ee4177309561c5d4b5877034d1597cabb4675602","target":"graph","created_at":"2026-05-18T00:13:02Z","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":"In this paper we develop flexible Krylov methods for efficiently computing regularized solutions to large-scale linear inverse problems with an $\\ell_2$ fit-to-data term and an $\\ell_p$ penalization term, for $p\\geq 1$. First we approximate the $p$-norm penalization term as a sequence of $2$-norm penalization terms using adaptive regularization matrices in an iterative reweighted norm fashion, and then we exploit flexible preconditioning techniques to efficiently incorporate the weight updates. To handle general (non-square) $\\ell_p$-regularized least-squares problems, we introduce a flexible ","authors_text":"Julianne Chung, Silvia Gazzola","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-06-18T05:43:09Z","title":"Flexible Krylov methods for $\\ell_p$ regularization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06502","kind":"arxiv","version":1},"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:e76319ef6e334fada33817f04cb05f53a79bf1b7da01b62a4bb9a016acf68b44","target":"record","created_at":"2026-05-18T00:13:02Z","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":"0c8e8f064daeb3a54920be16cd0ca407b7b69c0b0fb0d5bc21e7988bdabbc35d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-06-18T05:43:09Z","title_canon_sha256":"4c3f9899476512091ecabeae4817c080850989d133cbd2022034a0289f3cedec"},"schema_version":"1.0","source":{"id":"1806.06502","kind":"arxiv","version":1}},"canonical_sha256":"e9e43044a8b165394cf623ed30638830300f19bdcc848009bf3498a234ffb05f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9e43044a8b165394cf623ed30638830300f19bdcc848009bf3498a234ffb05f","first_computed_at":"2026-05-18T00:13:02.181206Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:02.181206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hYTYnJVNByXeaR2t7IzMJ+yUyR5qGxwuaVlUSTJvamEAHWhuK14ZRDE8KKrM9PKjBgiVTepnc2YXbG5YO4nWCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:02.181960Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.06502","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e76319ef6e334fada33817f04cb05f53a79bf1b7da01b62a4bb9a016acf68b44","sha256:a46973c53c065edcb43168d4ee4177309561c5d4b5877034d1597cabb4675602"],"state_sha256":"3f12f22cf862b0c4e75ebb859967b74eafe68b216968c03a346ade4c0e319a41"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lUkn03eDWIdLoZUtHCKBv3MTk/DPodvG3H5o4bVkGsI80f2D4WIsgydc3SfG69ZLZApZ/Y5mD/8LHyPD6aJNBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T09:39:56.905699Z","bundle_sha256":"f7dc7125a84a0da29d18372cce5278274e607ab15d9fd3d55ce648529bf04c3e"}}