{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:LZYS6AYJSIVHQXPIQOUGIENHGE","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":"f6b7b33a0a5a955f7e25413d189087cc18d80e6c5040a0a8c65ffeb4b5b14715","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-09T14:54:51Z","title_canon_sha256":"a2a58869b966ad9f0e3256dc27795d0eb8f81868a46ab9f74a982bc219188785"},"schema_version":"1.0","source":{"id":"1205.2656","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2656","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2656v1","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2656","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"pith_short_12","alias_value":"LZYS6AYJSIVH","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LZYS6AYJSIVHQXPI","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LZYS6AYJ","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:2e6154a63ff0f7f4e2aa6c0611261276a39b8b068ae3e8749bf80128a6e18439","target":"graph","created_at":"2026-05-18T03:55:47Z","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":"Inspired by recent work on convex formulations of clustering (Lashkari & Golland, 2008; Nowozin & Bakir, 2008) we investigate a new formulation of the Sparse Coding Problem (Olshausen & Field, 1997). In sparse coding we attempt to simultaneously represent a sequence of data-vectors sparsely (i.e. sparse approximation (Tropp et al., 2006)) in terms of a 'code' defined by a set of basis elements, while also finding a code that enables such an approximation. As existing alternating optimization procedures for sparse coding are theoretically prone to severe local minima problems, we propose a conv","authors_text":"David M. Bradley, J Andrew Bagnell","cross_cats":["cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-09T14:54:51Z","title":"Convex Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2656","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:f629c292aaa718ce4ebb88b60b86b5a71b6b2b12b7aebf0e7577ae185ecdd9cf","target":"record","created_at":"2026-05-18T03:55:47Z","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":"f6b7b33a0a5a955f7e25413d189087cc18d80e6c5040a0a8c65ffeb4b5b14715","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-09T14:54:51Z","title_canon_sha256":"a2a58869b966ad9f0e3256dc27795d0eb8f81868a46ab9f74a982bc219188785"},"schema_version":"1.0","source":{"id":"1205.2656","kind":"arxiv","version":1}},"canonical_sha256":"5e712f0309922a785de883a86411a7312f52a9b664df54b9cd75d46e6b929dd2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e712f0309922a785de883a86411a7312f52a9b664df54b9cd75d46e6b929dd2","first_computed_at":"2026-05-18T03:55:47.600160Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:47.600160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1pNgVaIMiHXObGKVu85Aegourd8Lu38vBJiIPTDyzrtvgjB/oeCXufzCdAvpL9XjmahhWcfZ37FcOvrWFlGdBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:47.600753Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.2656","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f629c292aaa718ce4ebb88b60b86b5a71b6b2b12b7aebf0e7577ae185ecdd9cf","sha256:2e6154a63ff0f7f4e2aa6c0611261276a39b8b068ae3e8749bf80128a6e18439"],"state_sha256":"269367812602137b9ec7c92d71681731f56fd2b6dcdb77f0a47a5cb15e5f6f5f"}