{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EBPXE6D7AW6LTVVNC7CF7OMNJ4","short_pith_number":"pith:EBPXE6D7","canonical_record":{"source":{"id":"1503.00778","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-02T23:02:56Z","cross_cats_sorted":["cs.DS","cs.NE","stat.ML"],"title_canon_sha256":"564b7867f897bb4f23d5ae1f9ab7df819c04e1ff5cacb3e8d36f603128f7fb99","abstract_canon_sha256":"7f0628e3ad7c7b224df0ac508d3ac5ef959c27b8e543ac7dd0b2363d92494c3f"},"schema_version":"1.0"},"canonical_sha256":"205f72787f05bcb9d6ad17c45fb98d4f0225ed3acf1c0d7a71fd1a8655ff9190","source":{"kind":"arxiv","id":"1503.00778","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00778","created_at":"2026-05-18T02:25:48Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00778v1","created_at":"2026-05-18T02:25:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00778","created_at":"2026-05-18T02:25:48Z"},{"alias_kind":"pith_short_12","alias_value":"EBPXE6D7AW6L","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EBPXE6D7AW6LTVVN","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EBPXE6D7","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EBPXE6D7AW6LTVVNC7CF7OMNJ4","target":"record","payload":{"canonical_record":{"source":{"id":"1503.00778","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-02T23:02:56Z","cross_cats_sorted":["cs.DS","cs.NE","stat.ML"],"title_canon_sha256":"564b7867f897bb4f23d5ae1f9ab7df819c04e1ff5cacb3e8d36f603128f7fb99","abstract_canon_sha256":"7f0628e3ad7c7b224df0ac508d3ac5ef959c27b8e543ac7dd0b2363d92494c3f"},"schema_version":"1.0"},"canonical_sha256":"205f72787f05bcb9d6ad17c45fb98d4f0225ed3acf1c0d7a71fd1a8655ff9190","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:48.444985Z","signature_b64":"HkznPWuF5IPCsocgMmlx+a0pMUyk0AoJeq7DCSgfGtw9/YFPvy7b60BNjpC8Wz5NTJg7XPCKM9xw2pB2kqaiDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"205f72787f05bcb9d6ad17c45fb98d4f0225ed3acf1c0d7a71fd1a8655ff9190","last_reissued_at":"2026-05-18T02:25:48.444405Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:48.444405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.00778","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-18T02:25:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fXIZL19yE10qCxjy3dRoWMuAm9ygnIqZXq0GbHS+jgzHSqrMA82TXgRde6m2wTtAQIgpVAkRKp/Ot9xl8SsDDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:14:13.883913Z"},"content_sha256":"374ce816cfd23b0addc332cce2b2e7096987fe037429cdc9d15a97daf39ca3c3","schema_version":"1.0","event_id":"sha256:374ce816cfd23b0addc332cce2b2e7096987fe037429cdc9d15a97daf39ca3c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EBPXE6D7AW6LTVVNC7CF7OMNJ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simple, Efficient, and Neural Algorithms for Sparse Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ankur Moitra, Rong Ge, Sanjeev Arora, Tengyu Ma","submitted_at":"2015-03-02T23:02:56Z","abstract_excerpt":"Sparse coding is a basic task in many fields including signal processing, neuroscience and machine learning where the goal is to learn a basis that enables a sparse representation of a given set of data, if one exists. Its standard formulation is as a non-convex optimization problem which is solved in practice by heuristics based on alternating minimization. Re- cent work has resulted in several algorithms for sparse coding with provable guarantees, but somewhat surprisingly these are outperformed by the simple alternating minimization heuristics. Here we give a general framework for understan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00778","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-18T02:25:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2xTIL6MSTk4UTedoHuq3gVp7Ob8+Rvp9x4t1UBj2u5zJA/Z6fvsQcnff1qEB1Tk7N46sSXmXWw2bjhOrRx0xDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:14:13.885178Z"},"content_sha256":"09e382fff9eaf81909d10a11b75ff88e6964db7f495de5afb7c51a29677e16d8","schema_version":"1.0","event_id":"sha256:09e382fff9eaf81909d10a11b75ff88e6964db7f495de5afb7c51a29677e16d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EBPXE6D7AW6LTVVNC7CF7OMNJ4/bundle.json","state_url":"https://pith.science/pith/EBPXE6D7AW6LTVVNC7CF7OMNJ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EBPXE6D7AW6LTVVNC7CF7OMNJ4/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-28T22:14:13Z","links":{"resolver":"https://pith.science/pith/EBPXE6D7AW6LTVVNC7CF7OMNJ4","bundle":"https://pith.science/pith/EBPXE6D7AW6LTVVNC7CF7OMNJ4/bundle.json","state":"https://pith.science/pith/EBPXE6D7AW6LTVVNC7CF7OMNJ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EBPXE6D7AW6LTVVNC7CF7OMNJ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EBPXE6D7AW6LTVVNC7CF7OMNJ4","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":"7f0628e3ad7c7b224df0ac508d3ac5ef959c27b8e543ac7dd0b2363d92494c3f","cross_cats_sorted":["cs.DS","cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-02T23:02:56Z","title_canon_sha256":"564b7867f897bb4f23d5ae1f9ab7df819c04e1ff5cacb3e8d36f603128f7fb99"},"schema_version":"1.0","source":{"id":"1503.00778","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00778","created_at":"2026-05-18T02:25:48Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00778v1","created_at":"2026-05-18T02:25:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00778","created_at":"2026-05-18T02:25:48Z"},{"alias_kind":"pith_short_12","alias_value":"EBPXE6D7AW6L","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EBPXE6D7AW6LTVVN","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EBPXE6D7","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:09e382fff9eaf81909d10a11b75ff88e6964db7f495de5afb7c51a29677e16d8","target":"graph","created_at":"2026-05-18T02:25:48Z","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":"Sparse coding is a basic task in many fields including signal processing, neuroscience and machine learning where the goal is to learn a basis that enables a sparse representation of a given set of data, if one exists. Its standard formulation is as a non-convex optimization problem which is solved in practice by heuristics based on alternating minimization. Re- cent work has resulted in several algorithms for sparse coding with provable guarantees, but somewhat surprisingly these are outperformed by the simple alternating minimization heuristics. Here we give a general framework for understan","authors_text":"Ankur Moitra, Rong Ge, Sanjeev Arora, Tengyu Ma","cross_cats":["cs.DS","cs.NE","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-02T23:02:56Z","title":"Simple, Efficient, and Neural Algorithms for Sparse Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00778","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:374ce816cfd23b0addc332cce2b2e7096987fe037429cdc9d15a97daf39ca3c3","target":"record","created_at":"2026-05-18T02:25:48Z","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":"7f0628e3ad7c7b224df0ac508d3ac5ef959c27b8e543ac7dd0b2363d92494c3f","cross_cats_sorted":["cs.DS","cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-02T23:02:56Z","title_canon_sha256":"564b7867f897bb4f23d5ae1f9ab7df819c04e1ff5cacb3e8d36f603128f7fb99"},"schema_version":"1.0","source":{"id":"1503.00778","kind":"arxiv","version":1}},"canonical_sha256":"205f72787f05bcb9d6ad17c45fb98d4f0225ed3acf1c0d7a71fd1a8655ff9190","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"205f72787f05bcb9d6ad17c45fb98d4f0225ed3acf1c0d7a71fd1a8655ff9190","first_computed_at":"2026-05-18T02:25:48.444405Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:48.444405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HkznPWuF5IPCsocgMmlx+a0pMUyk0AoJeq7DCSgfGtw9/YFPvy7b60BNjpC8Wz5NTJg7XPCKM9xw2pB2kqaiDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:48.444985Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.00778","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:374ce816cfd23b0addc332cce2b2e7096987fe037429cdc9d15a97daf39ca3c3","sha256:09e382fff9eaf81909d10a11b75ff88e6964db7f495de5afb7c51a29677e16d8"],"state_sha256":"550e6e5a80979e5d22ad1d051525ac14020c3f6fd5a19f1f8bd44cdf3cf197a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TIY9lmfAUmoaUusLbHsM70RPjOTfwcpi634FN3zyxXGVYPcEw700mn7iczHctrmyL41gJeYzU0LA5MbcL9jVAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:14:13.888981Z","bundle_sha256":"95c7dacb3c491ce11cf7bd1c2dcdaf44dda03cb7b60929ecc1a00da51bf7805e"}}