{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VHWYNFEBUM5MZFK25CMROVPPE4","short_pith_number":"pith:VHWYNFEB","canonical_record":{"source":{"id":"1507.01562","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-06T18:51:52Z","cross_cats_sorted":[],"title_canon_sha256":"6e7e50ce13a82d39398582e5fcf9913500eb811acba3b9d7ce1d8f397b54a08a","abstract_canon_sha256":"c8c94fd7832102a26cca2241e3695a924923f81911255758ec7b870bd5059725"},"schema_version":"1.0"},"canonical_sha256":"a9ed869481a33acc955ae8991755ef2724b0d8c8d46a813c15ebd593b6e32a74","source":{"kind":"arxiv","id":"1507.01562","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01562","created_at":"2026-05-18T01:37:16Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01562v1","created_at":"2026-05-18T01:37:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01562","created_at":"2026-05-18T01:37:16Z"},{"alias_kind":"pith_short_12","alias_value":"VHWYNFEBUM5M","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VHWYNFEBUM5MZFK2","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VHWYNFEB","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VHWYNFEBUM5MZFK25CMROVPPE4","target":"record","payload":{"canonical_record":{"source":{"id":"1507.01562","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-06T18:51:52Z","cross_cats_sorted":[],"title_canon_sha256":"6e7e50ce13a82d39398582e5fcf9913500eb811acba3b9d7ce1d8f397b54a08a","abstract_canon_sha256":"c8c94fd7832102a26cca2241e3695a924923f81911255758ec7b870bd5059725"},"schema_version":"1.0"},"canonical_sha256":"a9ed869481a33acc955ae8991755ef2724b0d8c8d46a813c15ebd593b6e32a74","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:16.576542Z","signature_b64":"H/YI8qlkDA8K9K2ti7bCLnimnf9yV6rBb0mEyT+/TgO5JmbN42q4q7aoUrGjzGXCy+6YBi4qtzklAQFt1jzfDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9ed869481a33acc955ae8991755ef2724b0d8c8d46a813c15ebd593b6e32a74","last_reissued_at":"2026-05-18T01:37:16.575818Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:16.575818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.01562","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-18T01:37:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n5UYAJo0cavaTLlC5rAdIKi6PTylr48BnS++1FHHAs0ZD6o3Yl+VqarFd5YZmNru72KJDGdrN1FvrpVoXQlsCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:55:54.301611Z"},"content_sha256":"5d8818f0c844377815940fd51d45f3dc90f396116ebaf54d71de0154aa97ac3e","schema_version":"1.0","event_id":"sha256:5d8818f0c844377815940fd51d45f3dc90f396116ebaf54d71de0154aa97ac3e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VHWYNFEBUM5MZFK25CMROVPPE4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Alternating Descent Conditional Gradient Method for Sparse Inverse Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Benjamin Recht, Geoffrey Schiebinger, Nicholas Boyd","submitted_at":"2015-07-06T18:51:52Z","abstract_excerpt":"We propose a variant of the classical conditional gradient method for sparse inverse problems with differentiable measurement models. Such models arise in many practical problems including superresolution, time-series modeling, and matrix completion. Our algorithm combines nonconvex and convex optimization techniques: we propose global conditional gradient steps alternating with nonconvex local search exploiting the differentiable measurement model. This hybridization gives the theoretical global optimality guarantees and stopping conditions of convex optimization along with the performance an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01562","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-18T01:37:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9fLJANhM9nYK+RYbzD+T5oHljTYyINKNcKE9OESxHnM4jo29sSIloLuK5rAa7IYvlgdYRTk1GWDwX0YQBeRTBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:55:54.302005Z"},"content_sha256":"f8b7e6ba9b1b48c2543ebf0b7a426662663cf72004a9fbf8ddd735f5079a3195","schema_version":"1.0","event_id":"sha256:f8b7e6ba9b1b48c2543ebf0b7a426662663cf72004a9fbf8ddd735f5079a3195"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VHWYNFEBUM5MZFK25CMROVPPE4/bundle.json","state_url":"https://pith.science/pith/VHWYNFEBUM5MZFK25CMROVPPE4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VHWYNFEBUM5MZFK25CMROVPPE4/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-27T09:55:54Z","links":{"resolver":"https://pith.science/pith/VHWYNFEBUM5MZFK25CMROVPPE4","bundle":"https://pith.science/pith/VHWYNFEBUM5MZFK25CMROVPPE4/bundle.json","state":"https://pith.science/pith/VHWYNFEBUM5MZFK25CMROVPPE4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VHWYNFEBUM5MZFK25CMROVPPE4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VHWYNFEBUM5MZFK25CMROVPPE4","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":"c8c94fd7832102a26cca2241e3695a924923f81911255758ec7b870bd5059725","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-06T18:51:52Z","title_canon_sha256":"6e7e50ce13a82d39398582e5fcf9913500eb811acba3b9d7ce1d8f397b54a08a"},"schema_version":"1.0","source":{"id":"1507.01562","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01562","created_at":"2026-05-18T01:37:16Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01562v1","created_at":"2026-05-18T01:37:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01562","created_at":"2026-05-18T01:37:16Z"},{"alias_kind":"pith_short_12","alias_value":"VHWYNFEBUM5M","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VHWYNFEBUM5MZFK2","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VHWYNFEB","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:f8b7e6ba9b1b48c2543ebf0b7a426662663cf72004a9fbf8ddd735f5079a3195","target":"graph","created_at":"2026-05-18T01:37:16Z","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":"We propose a variant of the classical conditional gradient method for sparse inverse problems with differentiable measurement models. Such models arise in many practical problems including superresolution, time-series modeling, and matrix completion. Our algorithm combines nonconvex and convex optimization techniques: we propose global conditional gradient steps alternating with nonconvex local search exploiting the differentiable measurement model. This hybridization gives the theoretical global optimality guarantees and stopping conditions of convex optimization along with the performance an","authors_text":"Benjamin Recht, Geoffrey Schiebinger, Nicholas Boyd","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-06T18:51:52Z","title":"The Alternating Descent Conditional Gradient Method for Sparse Inverse Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01562","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:5d8818f0c844377815940fd51d45f3dc90f396116ebaf54d71de0154aa97ac3e","target":"record","created_at":"2026-05-18T01:37:16Z","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":"c8c94fd7832102a26cca2241e3695a924923f81911255758ec7b870bd5059725","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-06T18:51:52Z","title_canon_sha256":"6e7e50ce13a82d39398582e5fcf9913500eb811acba3b9d7ce1d8f397b54a08a"},"schema_version":"1.0","source":{"id":"1507.01562","kind":"arxiv","version":1}},"canonical_sha256":"a9ed869481a33acc955ae8991755ef2724b0d8c8d46a813c15ebd593b6e32a74","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9ed869481a33acc955ae8991755ef2724b0d8c8d46a813c15ebd593b6e32a74","first_computed_at":"2026-05-18T01:37:16.575818Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:16.575818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H/YI8qlkDA8K9K2ti7bCLnimnf9yV6rBb0mEyT+/TgO5JmbN42q4q7aoUrGjzGXCy+6YBi4qtzklAQFt1jzfDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:16.576542Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.01562","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d8818f0c844377815940fd51d45f3dc90f396116ebaf54d71de0154aa97ac3e","sha256:f8b7e6ba9b1b48c2543ebf0b7a426662663cf72004a9fbf8ddd735f5079a3195"],"state_sha256":"abcc79d2ec568c8b2e71427394edb0f286540d75c3cf18c46b777f6d10c0d2c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+DbnquFMfhDT4E/tgbE8jazV1glNhpwHhEEZF0Brpn/3E8tYmwFHyHQ4RqYlp68N7QU8zpaKz9UZA9TRVgxoBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:55:54.304338Z","bundle_sha256":"3c89a8803d080a8bdcab7cc0d88f2cfa77b6f96cfd2f8208ba3c2a71628fb3ec"}}