{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:OEPLGH2UL53RAYEZC3EJUMJ6C7","short_pith_number":"pith:OEPLGH2U","canonical_record":{"source":{"id":"0807.0575","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2008-07-03T14:40:23Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"6bb0465f52afa124f157b28cb15c7ecffdc061ce6a67c6d5b10d43bcf5b32588","abstract_canon_sha256":"494163f9fb6f5d088356c7decd227e11b1e4def978ad2c77dc9234a2c8f0f489"},"schema_version":"1.0"},"canonical_sha256":"711eb31f545f7710609916c89a313e17f52ae8ae055f401cfb29c6116728b973","source":{"kind":"arxiv","id":"0807.0575","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0807.0575","created_at":"2026-06-03T22:06:07Z"},{"alias_kind":"arxiv_version","alias_value":"0807.0575v1","created_at":"2026-06-03T22:06:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0807.0575","created_at":"2026-06-03T22:06:07Z"},{"alias_kind":"pith_short_12","alias_value":"OEPLGH2UL53R","created_at":"2026-06-03T22:06:07Z"},{"alias_kind":"pith_short_16","alias_value":"OEPLGH2UL53RAYEZ","created_at":"2026-06-03T22:06:07Z"},{"alias_kind":"pith_short_8","alias_value":"OEPLGH2U","created_at":"2026-06-03T22:06:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:OEPLGH2UL53RAYEZC3EJUMJ6C7","target":"record","payload":{"canonical_record":{"source":{"id":"0807.0575","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2008-07-03T14:40:23Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"6bb0465f52afa124f157b28cb15c7ecffdc061ce6a67c6d5b10d43bcf5b32588","abstract_canon_sha256":"494163f9fb6f5d088356c7decd227e11b1e4def978ad2c77dc9234a2c8f0f489"},"schema_version":"1.0"},"canonical_sha256":"711eb31f545f7710609916c89a313e17f52ae8ae055f401cfb29c6116728b973","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T22:06:07.757109Z","signature_b64":"vbpqgtaDJiTpxIrajDmnMN/jfWh8/nZ7G+UboEVlXZe/7SPcelp1U0szdWSe/tjCTkMXu0oSLxaffI5INufHBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"711eb31f545f7710609916c89a313e17f52ae8ae055f401cfb29c6116728b973","last_reissued_at":"2026-06-03T22:06:07.756709Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T22:06:07.756709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0807.0575","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-06-03T22:06:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rFo4ksjyFDQLQffsp7/rITdaGk3SFavci1q9bLLnu8WYJWSgFViVevGT4uFIDbaNr+LD5Jh1jA7ufmoUCBQ+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T07:09:27.783018Z"},"content_sha256":"13bc331f9dabfde6568d6154d577900b7585a63e10fe9e7e5218852915d97559","schema_version":"1.0","event_id":"sha256:13bc331f9dabfde6568d6154d577900b7585a63e10fe9e7e5218852915d97559"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:OEPLGH2UL53RAYEZC3EJUMJ6C7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iteratively re-weighted least squares minimization for sparse recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"C. Sinan Gunturk, Ingrid Daubechies, Massimo Fornasier, Ronald DeVore","submitted_at":"2008-07-03T14:40:23Z","abstract_excerpt":"We analyze an Iteratively Re-weighted Least Squares (IRLS) algorithm for promoting l1-minimization in sparse and compressible vector recovery. We prove its convergence and we estimate its local rate. We show how the algorithm can be modified in order to promote lt-minimization for t<1, and how this modification produces superlinear rates of convergence."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0807.0575","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/0807.0575/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"},"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-06-03T22:06:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xt/BAYkfa0gO0//g0Ys91RiEUUOwmK2AxTeG4rh8Xxbqy2zIhMRsC2hcFh+xirpe7VxZFPXHeIGJWRsUBfG2BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T07:09:27.783759Z"},"content_sha256":"bd027acbcf41cb96c04eb96da858ddda97c373bb9bea804150e8e0966d929862","schema_version":"1.0","event_id":"sha256:bd027acbcf41cb96c04eb96da858ddda97c373bb9bea804150e8e0966d929862"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OEPLGH2UL53RAYEZC3EJUMJ6C7/bundle.json","state_url":"https://pith.science/pith/OEPLGH2UL53RAYEZC3EJUMJ6C7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OEPLGH2UL53RAYEZC3EJUMJ6C7/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-04T07:09:27Z","links":{"resolver":"https://pith.science/pith/OEPLGH2UL53RAYEZC3EJUMJ6C7","bundle":"https://pith.science/pith/OEPLGH2UL53RAYEZC3EJUMJ6C7/bundle.json","state":"https://pith.science/pith/OEPLGH2UL53RAYEZC3EJUMJ6C7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OEPLGH2UL53RAYEZC3EJUMJ6C7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:OEPLGH2UL53RAYEZC3EJUMJ6C7","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":"494163f9fb6f5d088356c7decd227e11b1e4def978ad2c77dc9234a2c8f0f489","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2008-07-03T14:40:23Z","title_canon_sha256":"6bb0465f52afa124f157b28cb15c7ecffdc061ce6a67c6d5b10d43bcf5b32588"},"schema_version":"1.0","source":{"id":"0807.0575","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0807.0575","created_at":"2026-06-03T22:06:07Z"},{"alias_kind":"arxiv_version","alias_value":"0807.0575v1","created_at":"2026-06-03T22:06:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0807.0575","created_at":"2026-06-03T22:06:07Z"},{"alias_kind":"pith_short_12","alias_value":"OEPLGH2UL53R","created_at":"2026-06-03T22:06:07Z"},{"alias_kind":"pith_short_16","alias_value":"OEPLGH2UL53RAYEZ","created_at":"2026-06-03T22:06:07Z"},{"alias_kind":"pith_short_8","alias_value":"OEPLGH2U","created_at":"2026-06-03T22:06:07Z"}],"graph_snapshots":[{"event_id":"sha256:bd027acbcf41cb96c04eb96da858ddda97c373bb9bea804150e8e0966d929862","target":"graph","created_at":"2026-06-03T22:06:07Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0807.0575/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We analyze an Iteratively Re-weighted Least Squares (IRLS) algorithm for promoting l1-minimization in sparse and compressible vector recovery. We prove its convergence and we estimate its local rate. We show how the algorithm can be modified in order to promote lt-minimization for t<1, and how this modification produces superlinear rates of convergence.","authors_text":"C. Sinan Gunturk, Ingrid Daubechies, Massimo Fornasier, Ronald DeVore","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2008-07-03T14:40:23Z","title":"Iteratively re-weighted least squares minimization for sparse recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0807.0575","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:13bc331f9dabfde6568d6154d577900b7585a63e10fe9e7e5218852915d97559","target":"record","created_at":"2026-06-03T22:06:07Z","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":"494163f9fb6f5d088356c7decd227e11b1e4def978ad2c77dc9234a2c8f0f489","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2008-07-03T14:40:23Z","title_canon_sha256":"6bb0465f52afa124f157b28cb15c7ecffdc061ce6a67c6d5b10d43bcf5b32588"},"schema_version":"1.0","source":{"id":"0807.0575","kind":"arxiv","version":1}},"canonical_sha256":"711eb31f545f7710609916c89a313e17f52ae8ae055f401cfb29c6116728b973","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"711eb31f545f7710609916c89a313e17f52ae8ae055f401cfb29c6116728b973","first_computed_at":"2026-06-03T22:06:07.756709Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T22:06:07.756709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vbpqgtaDJiTpxIrajDmnMN/jfWh8/nZ7G+UboEVlXZe/7SPcelp1U0szdWSe/tjCTkMXu0oSLxaffI5INufHBg==","signature_status":"signed_v1","signed_at":"2026-06-03T22:06:07.757109Z","signed_message":"canonical_sha256_bytes"},"source_id":"0807.0575","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13bc331f9dabfde6568d6154d577900b7585a63e10fe9e7e5218852915d97559","sha256:bd027acbcf41cb96c04eb96da858ddda97c373bb9bea804150e8e0966d929862"],"state_sha256":"41d71ad4fd35006ef9badc9c3e8e3d422985e304f2e89fe0d2e9b129ff683464"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0WTceYXYax7DxhIyiVeEPaC4bkc8M+7sMGRqmsYLVk5dA1R5qFbBvNnl3pEbSv6APEBdxUYKXSO8M5p8pzXPAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T07:09:27.789191Z","bundle_sha256":"9d91995222df1057fb55d633dc6ad6c4841d38bfe858090cae1180d13d720d30"}}