{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GSUZXET4NNDBF7JGYLXGY5C7XE","short_pith_number":"pith:GSUZXET4","canonical_record":{"source":{"id":"1203.5483","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-03-25T10:01:01Z","cross_cats_sorted":["math.NA","math.OC","stat.CO"],"title_canon_sha256":"897394fb40b926390dccf5d8aae6b234fc25c4d2c280948214d7f3b04f73c27b","abstract_canon_sha256":"792fd2203903e6c67cf35b1e997af12ca5b338cdce343c7d8fcfe8a68fdc4a80"},"schema_version":"1.0"},"canonical_sha256":"34a99b927c6b4612fd26c2ee6c745fb91e24fd6e8289dd9f2caa06b5783b3cc4","source":{"kind":"arxiv","id":"1203.5483","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.5483","created_at":"2026-05-18T03:18:26Z"},{"alias_kind":"arxiv_version","alias_value":"1203.5483v3","created_at":"2026-05-18T03:18:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5483","created_at":"2026-05-18T03:18:26Z"},{"alias_kind":"pith_short_12","alias_value":"GSUZXET4NNDB","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GSUZXET4NNDBF7JG","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GSUZXET4","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GSUZXET4NNDBF7JGYLXGY5C7XE","target":"record","payload":{"canonical_record":{"source":{"id":"1203.5483","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-03-25T10:01:01Z","cross_cats_sorted":["math.NA","math.OC","stat.CO"],"title_canon_sha256":"897394fb40b926390dccf5d8aae6b234fc25c4d2c280948214d7f3b04f73c27b","abstract_canon_sha256":"792fd2203903e6c67cf35b1e997af12ca5b338cdce343c7d8fcfe8a68fdc4a80"},"schema_version":"1.0"},"canonical_sha256":"34a99b927c6b4612fd26c2ee6c745fb91e24fd6e8289dd9f2caa06b5783b3cc4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:26.834206Z","signature_b64":"Zr+ZBEbN8VvaASKPirlIo7zVvNtEiBInQw+XM0V/nT43+LOUZFJt4XaN213qaEtQUValbEnU3DX95J1SXwheDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34a99b927c6b4612fd26c2ee6c745fb91e24fd6e8289dd9f2caa06b5783b3cc4","last_reissued_at":"2026-05-18T03:18:26.833558Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:26.833558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.5483","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-18T03:18:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k2Q63MQAbWJqLQ1ZSmI6eQCj50d/U1VoQeCcKrHtReaCm+MfS+QRTFQvDGlIHuBZGiC/JMJNot2BG8M8BYamCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:37:05.235510Z"},"content_sha256":"b0f646b922e957d6b393bade97ee1f3f3da4206636fd910ec54e8aa0ad4a83ba","schema_version":"1.0","event_id":"sha256:b0f646b922e957d6b393bade97ee1f3f3da4206636fd910ec54e8aa0ad4a83ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GSUZXET4NNDBF7JGYLXGY5C7XE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Greedy Sparsity-Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA","math.OC","stat.CO"],"primary_cat":"stat.ML","authors_text":"Bhiksha Raj, Petros Boufounos, Sohail Bahmani","submitted_at":"2012-03-25T10:01:01Z","abstract_excerpt":"Sparsity-constrained optimization has wide applicability in machine learning, statistics, and signal processing problems such as feature selection and compressive Sensing. A vast body of work has studied the sparsity-constrained optimization from theoretical, algorithmic, and application aspects in the context of sparse estimation in linear models where the fidelity of the estimate is measured by the squared error. In contrast, relatively less effort has been made in the study of sparsity-constrained optimization in cases where nonlinear models are involved or the cost function is not quadrati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.5483","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-18T03:18:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"brzklWb3V9gKxqmUnrTk+KlbYOj/4nVzt2JRD3pMJU0c1C9K8qUWt1LC+2rAZxgKgE0Gvl8/B5aevhuwXXTNCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:37:05.235892Z"},"content_sha256":"fee6e0933081688c429bab5429f01dbea31086a67717715b51c6fa67ecbcf0d8","schema_version":"1.0","event_id":"sha256:fee6e0933081688c429bab5429f01dbea31086a67717715b51c6fa67ecbcf0d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GSUZXET4NNDBF7JGYLXGY5C7XE/bundle.json","state_url":"https://pith.science/pith/GSUZXET4NNDBF7JGYLXGY5C7XE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GSUZXET4NNDBF7JGYLXGY5C7XE/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-31T00:37:05Z","links":{"resolver":"https://pith.science/pith/GSUZXET4NNDBF7JGYLXGY5C7XE","bundle":"https://pith.science/pith/GSUZXET4NNDBF7JGYLXGY5C7XE/bundle.json","state":"https://pith.science/pith/GSUZXET4NNDBF7JGYLXGY5C7XE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GSUZXET4NNDBF7JGYLXGY5C7XE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GSUZXET4NNDBF7JGYLXGY5C7XE","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":"792fd2203903e6c67cf35b1e997af12ca5b338cdce343c7d8fcfe8a68fdc4a80","cross_cats_sorted":["math.NA","math.OC","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-03-25T10:01:01Z","title_canon_sha256":"897394fb40b926390dccf5d8aae6b234fc25c4d2c280948214d7f3b04f73c27b"},"schema_version":"1.0","source":{"id":"1203.5483","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.5483","created_at":"2026-05-18T03:18:26Z"},{"alias_kind":"arxiv_version","alias_value":"1203.5483v3","created_at":"2026-05-18T03:18:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5483","created_at":"2026-05-18T03:18:26Z"},{"alias_kind":"pith_short_12","alias_value":"GSUZXET4NNDB","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GSUZXET4NNDBF7JG","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GSUZXET4","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:fee6e0933081688c429bab5429f01dbea31086a67717715b51c6fa67ecbcf0d8","target":"graph","created_at":"2026-05-18T03:18:26Z","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":"Sparsity-constrained optimization has wide applicability in machine learning, statistics, and signal processing problems such as feature selection and compressive Sensing. A vast body of work has studied the sparsity-constrained optimization from theoretical, algorithmic, and application aspects in the context of sparse estimation in linear models where the fidelity of the estimate is measured by the squared error. In contrast, relatively less effort has been made in the study of sparsity-constrained optimization in cases where nonlinear models are involved or the cost function is not quadrati","authors_text":"Bhiksha Raj, Petros Boufounos, Sohail Bahmani","cross_cats":["math.NA","math.OC","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-03-25T10:01:01Z","title":"Greedy Sparsity-Constrained Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.5483","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:b0f646b922e957d6b393bade97ee1f3f3da4206636fd910ec54e8aa0ad4a83ba","target":"record","created_at":"2026-05-18T03:18:26Z","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":"792fd2203903e6c67cf35b1e997af12ca5b338cdce343c7d8fcfe8a68fdc4a80","cross_cats_sorted":["math.NA","math.OC","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-03-25T10:01:01Z","title_canon_sha256":"897394fb40b926390dccf5d8aae6b234fc25c4d2c280948214d7f3b04f73c27b"},"schema_version":"1.0","source":{"id":"1203.5483","kind":"arxiv","version":3}},"canonical_sha256":"34a99b927c6b4612fd26c2ee6c745fb91e24fd6e8289dd9f2caa06b5783b3cc4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34a99b927c6b4612fd26c2ee6c745fb91e24fd6e8289dd9f2caa06b5783b3cc4","first_computed_at":"2026-05-18T03:18:26.833558Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:26.833558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zr+ZBEbN8VvaASKPirlIo7zVvNtEiBInQw+XM0V/nT43+LOUZFJt4XaN213qaEtQUValbEnU3DX95J1SXwheDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:26.834206Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.5483","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0f646b922e957d6b393bade97ee1f3f3da4206636fd910ec54e8aa0ad4a83ba","sha256:fee6e0933081688c429bab5429f01dbea31086a67717715b51c6fa67ecbcf0d8"],"state_sha256":"492927906d2a022212e4761d71ff1dfd889d8006055e1769f0b16342c977d5a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dwub+t05xmZFZtsXJ8PHf3sOLKPo4XYdoKtYyyKZxfw5TRirVv/pyO6l9wugtwmpFZpSWLKKuLsuS4OspobkDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:37:05.238111Z","bundle_sha256":"9e72e72e99c40fe418f9f9c7eb2bd69900f027a3946909d8fa437e1955bae07e"}}