{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NI4ZKA2GS4A4DDVGWLBDUNHCTG","short_pith_number":"pith:NI4ZKA2G","canonical_record":{"source":{"id":"1411.5057","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-11-18T22:53:09Z","cross_cats_sorted":[],"title_canon_sha256":"118daaf5be3619b446bd40b467addfa9f2fefa990a8f780cb2f2a4bb9939747c","abstract_canon_sha256":"a129477c04bc051efc84c824d7f784305a73453d064074f76572b19e0a70bbae"},"schema_version":"1.0"},"canonical_sha256":"6a399503469701c18ea6b2c23a34e29996cad2dbc9940f8046ebcc0f7af165b2","source":{"kind":"arxiv","id":"1411.5057","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.5057","created_at":"2026-05-18T02:17:42Z"},{"alias_kind":"arxiv_version","alias_value":"1411.5057v3","created_at":"2026-05-18T02:17:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.5057","created_at":"2026-05-18T02:17:42Z"},{"alias_kind":"pith_short_12","alias_value":"NI4ZKA2GS4A4","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NI4ZKA2GS4A4DDVG","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NI4ZKA2G","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NI4ZKA2GS4A4DDVGWLBDUNHCTG","target":"record","payload":{"canonical_record":{"source":{"id":"1411.5057","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-11-18T22:53:09Z","cross_cats_sorted":[],"title_canon_sha256":"118daaf5be3619b446bd40b467addfa9f2fefa990a8f780cb2f2a4bb9939747c","abstract_canon_sha256":"a129477c04bc051efc84c824d7f784305a73453d064074f76572b19e0a70bbae"},"schema_version":"1.0"},"canonical_sha256":"6a399503469701c18ea6b2c23a34e29996cad2dbc9940f8046ebcc0f7af165b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:42.780032Z","signature_b64":"H8SM2ewgTPCDI5GB6eVLzTKWaiTfvJXRcGKWiRYMkjUSlHJW82MuNrAr+sess8HECkhUCxswXDHSwI3wTy6TAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a399503469701c18ea6b2c23a34e29996cad2dbc9940f8046ebcc0f7af165b2","last_reissued_at":"2026-05-18T02:17:42.779650Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:42.779650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.5057","source_version":3,"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-18T02:17:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lrOG68owyWIGoifqz3ppoW59mKeEoMzU8diSa6PcipZWSPwOiwQ6KZUtOb8DOiiysZyLb5v+WZW7bnAkVHqRBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:16:53.805745Z"},"content_sha256":"d7e7d7ec59f9e64cc0fd4ac4808f670a8d137cbdd3cf6f4e76fa1de14201fe1d","schema_version":"1.0","event_id":"sha256:d7e7d7ec59f9e64cc0fd4ac4808f670a8d137cbdd3cf6f4e76fa1de14201fe1d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NI4ZKA2GS4A4DDVGWLBDUNHCTG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Iteratively Reweighted Least Squares Algorithms for Analysis-Based Sparsity Reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Chen Chen, Hongsheng Li, Junzhou Huang, Lei He","submitted_at":"2014-11-18T22:53:09Z","abstract_excerpt":"In this paper, we propose a novel algorithm for analysis-based sparsity reconstruction. It can solve the generalized problem by structured sparsity regularization with an orthogonal basis and total variation regularization. The proposed algorithm is based on the iterative reweighted least squares (IRLS) model, which is further accelerated by the preconditioned conjugate gradient method. The convergence rate of the proposed algorithm is almost the same as that of the traditional IRLS algorithms, that is, exponentially fast. Moreover, with the specifically devised preconditioner, the computation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.5057","kind":"arxiv","version":3},"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-18T02:17:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CBBm1APh/sIYGbMJL/7KtuEirmEzlZTPthJolbbTlMcNhkVHaqpD1snWwSJDOFdtcb53RqZezMLrPXBUdY90Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:16:53.806384Z"},"content_sha256":"e74ff15ba79d88d44b6057f9d075299ac1cbf97c2ceae2d2be54ebf071adc678","schema_version":"1.0","event_id":"sha256:e74ff15ba79d88d44b6057f9d075299ac1cbf97c2ceae2d2be54ebf071adc678"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NI4ZKA2GS4A4DDVGWLBDUNHCTG/bundle.json","state_url":"https://pith.science/pith/NI4ZKA2GS4A4DDVGWLBDUNHCTG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NI4ZKA2GS4A4DDVGWLBDUNHCTG/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-05-31T03:16:53Z","links":{"resolver":"https://pith.science/pith/NI4ZKA2GS4A4DDVGWLBDUNHCTG","bundle":"https://pith.science/pith/NI4ZKA2GS4A4DDVGWLBDUNHCTG/bundle.json","state":"https://pith.science/pith/NI4ZKA2GS4A4DDVGWLBDUNHCTG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NI4ZKA2GS4A4DDVGWLBDUNHCTG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NI4ZKA2GS4A4DDVGWLBDUNHCTG","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":"a129477c04bc051efc84c824d7f784305a73453d064074f76572b19e0a70bbae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-11-18T22:53:09Z","title_canon_sha256":"118daaf5be3619b446bd40b467addfa9f2fefa990a8f780cb2f2a4bb9939747c"},"schema_version":"1.0","source":{"id":"1411.5057","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.5057","created_at":"2026-05-18T02:17:42Z"},{"alias_kind":"arxiv_version","alias_value":"1411.5057v3","created_at":"2026-05-18T02:17:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.5057","created_at":"2026-05-18T02:17:42Z"},{"alias_kind":"pith_short_12","alias_value":"NI4ZKA2GS4A4","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NI4ZKA2GS4A4DDVG","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NI4ZKA2G","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:e74ff15ba79d88d44b6057f9d075299ac1cbf97c2ceae2d2be54ebf071adc678","target":"graph","created_at":"2026-05-18T02:17:42Z","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 propose a novel algorithm for analysis-based sparsity reconstruction. It can solve the generalized problem by structured sparsity regularization with an orthogonal basis and total variation regularization. The proposed algorithm is based on the iterative reweighted least squares (IRLS) model, which is further accelerated by the preconditioned conjugate gradient method. The convergence rate of the proposed algorithm is almost the same as that of the traditional IRLS algorithms, that is, exponentially fast. Moreover, with the specifically devised preconditioner, the computation","authors_text":"Chen Chen, Hongsheng Li, Junzhou Huang, Lei He","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-11-18T22:53:09Z","title":"Fast Iteratively Reweighted Least Squares Algorithms for Analysis-Based Sparsity Reconstruction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.5057","kind":"arxiv","version":3},"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:d7e7d7ec59f9e64cc0fd4ac4808f670a8d137cbdd3cf6f4e76fa1de14201fe1d","target":"record","created_at":"2026-05-18T02:17:42Z","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":"a129477c04bc051efc84c824d7f784305a73453d064074f76572b19e0a70bbae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-11-18T22:53:09Z","title_canon_sha256":"118daaf5be3619b446bd40b467addfa9f2fefa990a8f780cb2f2a4bb9939747c"},"schema_version":"1.0","source":{"id":"1411.5057","kind":"arxiv","version":3}},"canonical_sha256":"6a399503469701c18ea6b2c23a34e29996cad2dbc9940f8046ebcc0f7af165b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a399503469701c18ea6b2c23a34e29996cad2dbc9940f8046ebcc0f7af165b2","first_computed_at":"2026-05-18T02:17:42.779650Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:42.779650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H8SM2ewgTPCDI5GB6eVLzTKWaiTfvJXRcGKWiRYMkjUSlHJW82MuNrAr+sess8HECkhUCxswXDHSwI3wTy6TAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:42.780032Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.5057","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7e7d7ec59f9e64cc0fd4ac4808f670a8d137cbdd3cf6f4e76fa1de14201fe1d","sha256:e74ff15ba79d88d44b6057f9d075299ac1cbf97c2ceae2d2be54ebf071adc678"],"state_sha256":"dab638792a221a9f866706a874c276e4d2f4f8e3c6243d7720d7d47c26267f3d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xiRf+3uQcRxu9J/+n2dNv52GjKndZ3TS7eFKvdHqjUNhhuBdQRkmM+/uZo6tNdw2nqH6mRI6Z4qqAMdWJ4cdCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:16:53.809467Z","bundle_sha256":"2dae91993d1ca71f88029029732964299af9e82135d294abe4cd0284529ae0b5"}}