{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:4KT5ARRG5TVVTJIMOEZUR66XFC","short_pith_number":"pith:4KT5ARRG","canonical_record":{"source":{"id":"0909.3947","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-09-22T10:03:01Z","cross_cats_sorted":[],"title_canon_sha256":"fbe184a108bcd24633dac10b2145e97fe2ec0c5654e9462036971d1204937451","abstract_canon_sha256":"7cceef4ffdf3a48f1b7c469e8e074468c0919c564b91829f14f68f98a5e00e5a"},"schema_version":"1.0"},"canonical_sha256":"e2a7d04626eceb59a50c713348fbd728a606220c271eddde863bb62e374145e5","source":{"kind":"arxiv","id":"0909.3947","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.3947","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"arxiv_version","alias_value":"0909.3947v1","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.3947","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"pith_short_12","alias_value":"4KT5ARRG5TVV","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"4KT5ARRG5TVVTJIM","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"4KT5ARRG","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:4KT5ARRG5TVVTJIMOEZUR66XFC","target":"record","payload":{"canonical_record":{"source":{"id":"0909.3947","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-09-22T10:03:01Z","cross_cats_sorted":[],"title_canon_sha256":"fbe184a108bcd24633dac10b2145e97fe2ec0c5654e9462036971d1204937451","abstract_canon_sha256":"7cceef4ffdf3a48f1b7c469e8e074468c0919c564b91829f14f68f98a5e00e5a"},"schema_version":"1.0"},"canonical_sha256":"e2a7d04626eceb59a50c713348fbd728a606220c271eddde863bb62e374145e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:11.239186Z","signature_b64":"Mul33eCpQNBNd4rfQbsM7A5EWlzMCPXvxW7AkJw3FbGAsKW1OwF7l38Gog5vhjAgXRD539dEK99pVKyQKAhNAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2a7d04626eceb59a50c713348fbd728a606220c271eddde863bb62e374145e5","last_reissued_at":"2026-05-18T00:59:11.238458Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:11.238458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0909.3947","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:59:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aKpfR1pONBAGoA7u4TRH84ewFh171eSK0sm9HeSkO5xpeoXT/o+tOut/bJ2qyj35D1xAoLCKFOUQe3cU8OISCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:40:03.781476Z"},"content_sha256":"da4be1af393d080344635a9b97dc45b4db369592fbb688ec3a2257320c019170","schema_version":"1.0","event_id":"sha256:da4be1af393d080344635a9b97dc45b4db369592fbb688ec3a2257320c019170"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:4KT5ARRG5TVVTJIMOEZUR66XFC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Fast Algorithm for the Constrained Formulation of Compressive Image Reconstruction and Other Linear Inverse Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jose M. Bioucas-Dias, Manya V. Afonso, Mario A. T. Figueiredo","submitted_at":"2009-09-22T10:03:01Z","abstract_excerpt":"Ill-posed linear inverse problems (ILIP), such as restoration and reconstruction, are a core topic of signal/image processing. A standard approach to deal with ILIP uses a constrained optimization problem, where a regularization function is minimized under the constraint that the solution explains the observations sufficiently well. The regularizer and constraint are usually convex; however, several particular features of these problems (huge dimensionality, non-smoothness) preclude the use of off-the-shelf optimization tools and have stimulated much research. In this paper, we propose a new e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.3947","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:59:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V3x8/YZgrS+6vA2dBylCCf6PdQc9ow59RaRVDsZcdTD/KA20n7GyUlKDJZjITIcvIGAzHiywBUopA2JkDEyWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:40:03.782210Z"},"content_sha256":"f3e4d57c08566d6db33f168dfb6b623f8b107b9bcfe52c93c48cfdbb4996bb89","schema_version":"1.0","event_id":"sha256:f3e4d57c08566d6db33f168dfb6b623f8b107b9bcfe52c93c48cfdbb4996bb89"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4KT5ARRG5TVVTJIMOEZUR66XFC/bundle.json","state_url":"https://pith.science/pith/4KT5ARRG5TVVTJIMOEZUR66XFC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4KT5ARRG5TVVTJIMOEZUR66XFC/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-07T16:40:03Z","links":{"resolver":"https://pith.science/pith/4KT5ARRG5TVVTJIMOEZUR66XFC","bundle":"https://pith.science/pith/4KT5ARRG5TVVTJIMOEZUR66XFC/bundle.json","state":"https://pith.science/pith/4KT5ARRG5TVVTJIMOEZUR66XFC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4KT5ARRG5TVVTJIMOEZUR66XFC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:4KT5ARRG5TVVTJIMOEZUR66XFC","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":"7cceef4ffdf3a48f1b7c469e8e074468c0919c564b91829f14f68f98a5e00e5a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-09-22T10:03:01Z","title_canon_sha256":"fbe184a108bcd24633dac10b2145e97fe2ec0c5654e9462036971d1204937451"},"schema_version":"1.0","source":{"id":"0909.3947","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.3947","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"arxiv_version","alias_value":"0909.3947v1","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.3947","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"pith_short_12","alias_value":"4KT5ARRG5TVV","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"4KT5ARRG5TVVTJIM","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"4KT5ARRG","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:f3e4d57c08566d6db33f168dfb6b623f8b107b9bcfe52c93c48cfdbb4996bb89","target":"graph","created_at":"2026-05-18T00:59: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":"Ill-posed linear inverse problems (ILIP), such as restoration and reconstruction, are a core topic of signal/image processing. A standard approach to deal with ILIP uses a constrained optimization problem, where a regularization function is minimized under the constraint that the solution explains the observations sufficiently well. The regularizer and constraint are usually convex; however, several particular features of these problems (huge dimensionality, non-smoothness) preclude the use of off-the-shelf optimization tools and have stimulated much research. In this paper, we propose a new e","authors_text":"Jose M. Bioucas-Dias, Manya V. Afonso, Mario A. T. Figueiredo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-09-22T10:03:01Z","title":"A Fast Algorithm for the Constrained Formulation of Compressive Image Reconstruction and Other Linear Inverse Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.3947","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:da4be1af393d080344635a9b97dc45b4db369592fbb688ec3a2257320c019170","target":"record","created_at":"2026-05-18T00:59: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":"7cceef4ffdf3a48f1b7c469e8e074468c0919c564b91829f14f68f98a5e00e5a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-09-22T10:03:01Z","title_canon_sha256":"fbe184a108bcd24633dac10b2145e97fe2ec0c5654e9462036971d1204937451"},"schema_version":"1.0","source":{"id":"0909.3947","kind":"arxiv","version":1}},"canonical_sha256":"e2a7d04626eceb59a50c713348fbd728a606220c271eddde863bb62e374145e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2a7d04626eceb59a50c713348fbd728a606220c271eddde863bb62e374145e5","first_computed_at":"2026-05-18T00:59:11.238458Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:11.238458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mul33eCpQNBNd4rfQbsM7A5EWlzMCPXvxW7AkJw3FbGAsKW1OwF7l38Gog5vhjAgXRD539dEK99pVKyQKAhNAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:11.239186Z","signed_message":"canonical_sha256_bytes"},"source_id":"0909.3947","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da4be1af393d080344635a9b97dc45b4db369592fbb688ec3a2257320c019170","sha256:f3e4d57c08566d6db33f168dfb6b623f8b107b9bcfe52c93c48cfdbb4996bb89"],"state_sha256":"90cea4af09574d3bc27fc3e4e1446011f156d51ec3217b954d9992c88ed817bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fZh//JIIlV6YQTAtNlLTrHi+R77TqNU1WTnj0+j1MDrEK2QoMUuR7Hr/VYmIlHa3ap13eZAOQprbi7D9XPWjCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T16:40:03.785893Z","bundle_sha256":"086bf362fa2bf181812d8380b51e4443c5d49a6714e3a6636d329c4eb96b2cda"}}