{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:LZYS6AYJSIVHQXPIQOUGIENHGE","short_pith_number":"pith:LZYS6AYJ","schema_version":"1.0","canonical_sha256":"5e712f0309922a785de883a86411a7312f52a9b664df54b9cd75d46e6b929dd2","source":{"kind":"arxiv","id":"1205.2656","version":1},"attestation_state":"computed","paper":{"title":"Convex Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"David M. Bradley, J Andrew Bagnell","submitted_at":"2012-05-09T14:54:51Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1205.2656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-09T14:54:51Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"a2a58869b966ad9f0e3256dc27795d0eb8f81868a46ab9f74a982bc219188785","abstract_canon_sha256":"f6b7b33a0a5a955f7e25413d189087cc18d80e6c5040a0a8c65ffeb4b5b14715"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:47.600753Z","signature_b64":"1pNgVaIMiHXObGKVu85Aegourd8Lu38vBJiIPTDyzrtvgjB/oeCXufzCdAvpL9XjmahhWcfZ37FcOvrWFlGdBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e712f0309922a785de883a86411a7312f52a9b664df54b9cd75d46e6b929dd2","last_reissued_at":"2026-05-18T03:55:47.600160Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:47.600160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convex Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"David M. Bradley, J Andrew Bagnell","submitted_at":"2012-05-09T14:54:51Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2656","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1205.2656","created_at":"2026-05-18T03:55:47.600232+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.2656v1","created_at":"2026-05-18T03:55:47.600232+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2656","created_at":"2026-05-18T03:55:47.600232+00:00"},{"alias_kind":"pith_short_12","alias_value":"LZYS6AYJSIVH","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"LZYS6AYJSIVHQXPI","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"LZYS6AYJ","created_at":"2026-05-18T12:27:14.488303+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LZYS6AYJSIVHQXPIQOUGIENHGE","json":"https://pith.science/pith/LZYS6AYJSIVHQXPIQOUGIENHGE.json","graph_json":"https://pith.science/api/pith-number/LZYS6AYJSIVHQXPIQOUGIENHGE/graph.json","events_json":"https://pith.science/api/pith-number/LZYS6AYJSIVHQXPIQOUGIENHGE/events.json","paper":"https://pith.science/paper/LZYS6AYJ"},"agent_actions":{"view_html":"https://pith.science/pith/LZYS6AYJSIVHQXPIQOUGIENHGE","download_json":"https://pith.science/pith/LZYS6AYJSIVHQXPIQOUGIENHGE.json","view_paper":"https://pith.science/paper/LZYS6AYJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.2656&json=true","fetch_graph":"https://pith.science/api/pith-number/LZYS6AYJSIVHQXPIQOUGIENHGE/graph.json","fetch_events":"https://pith.science/api/pith-number/LZYS6AYJSIVHQXPIQOUGIENHGE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LZYS6AYJSIVHQXPIQOUGIENHGE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LZYS6AYJSIVHQXPIQOUGIENHGE/action/storage_attestation","attest_author":"https://pith.science/pith/LZYS6AYJSIVHQXPIQOUGIENHGE/action/author_attestation","sign_citation":"https://pith.science/pith/LZYS6AYJSIVHQXPIQOUGIENHGE/action/citation_signature","submit_replication":"https://pith.science/pith/LZYS6AYJSIVHQXPIQOUGIENHGE/action/replication_record"}},"created_at":"2026-05-18T03:55:47.600232+00:00","updated_at":"2026-05-18T03:55:47.600232+00:00"}