{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:SZBR3ANUGDVF7LD2JVROI3Y3KE","short_pith_number":"pith:SZBR3ANU","schema_version":"1.0","canonical_sha256":"96431d81b430ea5fac7a4d62e46f1b5125bf61a08c2d202cb452e92d57fef43b","source":{"kind":"arxiv","id":"2505.01827","version":1},"attestation_state":"computed","paper":{"title":"Priorconditioned Sparsity-Promoting Projection Methods for Deterministic and Bayesian Linear Inverse Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Jan Glaubitz, Jonathan Lindbloom, Mirjeta Pasha, Youssef Marzouk","submitted_at":"2025-05-03T14:06:36Z","abstract_excerpt":"High-quality reconstructions of signals and images with sharp edges are needed in a wide range of applications. To overcome the large dimensionality of the parameter space and the complexity of the regularization functional, {sparisty-promoting} techniques for both deterministic and hierarchical Bayesian regularization rely on solving a sequence of high-dimensional iteratively reweighted least squares (IRLS) problems on a lower-dimensional subspace. Generalized Krylov subspace (GKS) methods are a particularly potent class of hybrid Krylov schemes that efficiently solve sequences of IRLS proble"},"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":"2505.01827","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2025-05-03T14:06:36Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"ce9d561e6920d9686edd16f2849ec885186075b71a17120c62e5c4588d18e45f","abstract_canon_sha256":"6041d393bff7d334dfef46f50277562b1a1956fd5c58df8ba708d29baa03abe6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:58:04.746704Z","signature_b64":"uuxzy3pErFQS8g1R5Bw3jtqcpeGnPMXHRYWYijItyB7SX40XQaQfs+pskS0D07d/El6tCzQb0UYVlMblDfDGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96431d81b430ea5fac7a4d62e46f1b5125bf61a08c2d202cb452e92d57fef43b","last_reissued_at":"2026-07-05T10:58:04.746181Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:58:04.746181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Priorconditioned Sparsity-Promoting Projection Methods for Deterministic and Bayesian Linear Inverse Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Jan Glaubitz, Jonathan Lindbloom, Mirjeta Pasha, Youssef Marzouk","submitted_at":"2025-05-03T14:06:36Z","abstract_excerpt":"High-quality reconstructions of signals and images with sharp edges are needed in a wide range of applications. To overcome the large dimensionality of the parameter space and the complexity of the regularization functional, {sparisty-promoting} techniques for both deterministic and hierarchical Bayesian regularization rely on solving a sequence of high-dimensional iteratively reweighted least squares (IRLS) problems on a lower-dimensional subspace. Generalized Krylov subspace (GKS) methods are a particularly potent class of hybrid Krylov schemes that efficiently solve sequences of IRLS proble"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.01827","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/2505.01827/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":"2505.01827","created_at":"2026-07-05T10:58:04.746236+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.01827v1","created_at":"2026-07-05T10:58:04.746236+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.01827","created_at":"2026-07-05T10:58:04.746236+00:00"},{"alias_kind":"pith_short_12","alias_value":"SZBR3ANUGDVF","created_at":"2026-07-05T10:58:04.746236+00:00"},{"alias_kind":"pith_short_16","alias_value":"SZBR3ANUGDVF7LD2","created_at":"2026-07-05T10:58:04.746236+00:00"},{"alias_kind":"pith_short_8","alias_value":"SZBR3ANU","created_at":"2026-07-05T10:58:04.746236+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.06336","citing_title":"Nonlinear RMM-GKS for Large-Scale Dynamic and Streaming Inverse Problems with Uncertain Forward Operators","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SZBR3ANUGDVF7LD2JVROI3Y3KE","json":"https://pith.science/pith/SZBR3ANUGDVF7LD2JVROI3Y3KE.json","graph_json":"https://pith.science/api/pith-number/SZBR3ANUGDVF7LD2JVROI3Y3KE/graph.json","events_json":"https://pith.science/api/pith-number/SZBR3ANUGDVF7LD2JVROI3Y3KE/events.json","paper":"https://pith.science/paper/SZBR3ANU"},"agent_actions":{"view_html":"https://pith.science/pith/SZBR3ANUGDVF7LD2JVROI3Y3KE","download_json":"https://pith.science/pith/SZBR3ANUGDVF7LD2JVROI3Y3KE.json","view_paper":"https://pith.science/paper/SZBR3ANU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.01827&json=true","fetch_graph":"https://pith.science/api/pith-number/SZBR3ANUGDVF7LD2JVROI3Y3KE/graph.json","fetch_events":"https://pith.science/api/pith-number/SZBR3ANUGDVF7LD2JVROI3Y3KE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SZBR3ANUGDVF7LD2JVROI3Y3KE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SZBR3ANUGDVF7LD2JVROI3Y3KE/action/storage_attestation","attest_author":"https://pith.science/pith/SZBR3ANUGDVF7LD2JVROI3Y3KE/action/author_attestation","sign_citation":"https://pith.science/pith/SZBR3ANUGDVF7LD2JVROI3Y3KE/action/citation_signature","submit_replication":"https://pith.science/pith/SZBR3ANUGDVF7LD2JVROI3Y3KE/action/replication_record"}},"created_at":"2026-07-05T10:58:04.746236+00:00","updated_at":"2026-07-05T10:58:04.746236+00:00"}