{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BHW2GV4JAZ3H4HOOJX7REGO7TS","short_pith_number":"pith:BHW2GV4J","canonical_record":{"source":{"id":"1802.06875","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-13T00:10:00Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"78ea5c44325fca7e019dfb86fc3592fcbb7c7a198ce059eea06e66d6ef1515af","abstract_canon_sha256":"74cb767747e797ef3ea62e9b9be1c848136f258656f2f598d61ddb0e063f2fb9"},"schema_version":"1.0"},"canonical_sha256":"09eda3578906767e1dce4dff1219df9cb0d5a48571ce4384118e37f97001ffe5","source":{"kind":"arxiv","id":"1802.06875","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06875","created_at":"2026-05-17T23:43:56Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06875v2","created_at":"2026-05-17T23:43:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06875","created_at":"2026-05-17T23:43:56Z"},{"alias_kind":"pith_short_12","alias_value":"BHW2GV4JAZ3H","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BHW2GV4JAZ3H4HOO","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BHW2GV4J","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BHW2GV4JAZ3H4HOOJX7REGO7TS","target":"record","payload":{"canonical_record":{"source":{"id":"1802.06875","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-13T00:10:00Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"78ea5c44325fca7e019dfb86fc3592fcbb7c7a198ce059eea06e66d6ef1515af","abstract_canon_sha256":"74cb767747e797ef3ea62e9b9be1c848136f258656f2f598d61ddb0e063f2fb9"},"schema_version":"1.0"},"canonical_sha256":"09eda3578906767e1dce4dff1219df9cb0d5a48571ce4384118e37f97001ffe5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:56.774216Z","signature_b64":"eLwgabTBXEEuK4S9GmlkQgIEYGjCkHphD1R406bywcG0cQBWYGZgqZjyxpBRXQUNrLwSJgWVH+oZQYF8fw/QBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09eda3578906767e1dce4dff1219df9cb0d5a48571ce4384118e37f97001ffe5","last_reissued_at":"2026-05-17T23:43:56.773410Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:56.773410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.06875","source_version":2,"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-17T23:43:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3d95MMC68SRQBfnPry9np+hu25x+BWxfyD3vfa4nfXnHML03z69OqwxL+DzMLuCBYrriZtwBN+RohbAfsNMWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:36:03.887241Z"},"content_sha256":"e6cf0f04d12cbd97c62a43e72169b5fe5b9a268b047292464752e821d49cb1fa","schema_version":"1.0","event_id":"sha256:e6cf0f04d12cbd97c62a43e72169b5fe5b9a268b047292464752e821d49cb1fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BHW2GV4JAZ3H4HOOJX7REGO7TS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"LSALSA: Accelerated Source Separation via Learned Sparse Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Anna Choromanska, Apoorva Nandini Saridena, Benjamin Cowen","submitted_at":"2018-02-13T00:10:00Z","abstract_excerpt":"We propose an efficient algorithm for the generalized sparse coding (SC) inference problem. The proposed framework applies to both the single dictionary setting, where each data point is represented as a sparse combination of the columns of one dictionary matrix, as well as the multiple dictionary setting as given in morphological component analysis (MCA), where the goal is to separate a signal into additive parts such that each part has distinct sparse representation within a corresponding dictionary. Both the SC task and its generalization via MCA have been cast as $\\ell_1$-regularized least"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06875","kind":"arxiv","version":2},"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-17T23:43:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NVrmcW4yuVedz4ZI0poCadzErIjXiKkWaosyAXaC7id9hiLqmB65ySbGKtKr4NLjaLuITafmdhTLNhl+0MQjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:36:03.887966Z"},"content_sha256":"c2488ef9199138b91a7bd0e131eabe9fbaf988e8fd1532f67216f4a2a9a4e644","schema_version":"1.0","event_id":"sha256:c2488ef9199138b91a7bd0e131eabe9fbaf988e8fd1532f67216f4a2a9a4e644"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BHW2GV4JAZ3H4HOOJX7REGO7TS/bundle.json","state_url":"https://pith.science/pith/BHW2GV4JAZ3H4HOOJX7REGO7TS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BHW2GV4JAZ3H4HOOJX7REGO7TS/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-26T06:36:03Z","links":{"resolver":"https://pith.science/pith/BHW2GV4JAZ3H4HOOJX7REGO7TS","bundle":"https://pith.science/pith/BHW2GV4JAZ3H4HOOJX7REGO7TS/bundle.json","state":"https://pith.science/pith/BHW2GV4JAZ3H4HOOJX7REGO7TS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BHW2GV4JAZ3H4HOOJX7REGO7TS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BHW2GV4JAZ3H4HOOJX7REGO7TS","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":"74cb767747e797ef3ea62e9b9be1c848136f258656f2f598d61ddb0e063f2fb9","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-13T00:10:00Z","title_canon_sha256":"78ea5c44325fca7e019dfb86fc3592fcbb7c7a198ce059eea06e66d6ef1515af"},"schema_version":"1.0","source":{"id":"1802.06875","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06875","created_at":"2026-05-17T23:43:56Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06875v2","created_at":"2026-05-17T23:43:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06875","created_at":"2026-05-17T23:43:56Z"},{"alias_kind":"pith_short_12","alias_value":"BHW2GV4JAZ3H","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BHW2GV4JAZ3H4HOO","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BHW2GV4J","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:c2488ef9199138b91a7bd0e131eabe9fbaf988e8fd1532f67216f4a2a9a4e644","target":"graph","created_at":"2026-05-17T23:43:56Z","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 an efficient algorithm for the generalized sparse coding (SC) inference problem. The proposed framework applies to both the single dictionary setting, where each data point is represented as a sparse combination of the columns of one dictionary matrix, as well as the multiple dictionary setting as given in morphological component analysis (MCA), where the goal is to separate a signal into additive parts such that each part has distinct sparse representation within a corresponding dictionary. Both the SC task and its generalization via MCA have been cast as $\\ell_1$-regularized least","authors_text":"Anna Choromanska, Apoorva Nandini Saridena, Benjamin Cowen","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-13T00:10:00Z","title":"LSALSA: Accelerated Source Separation via Learned Sparse Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06875","kind":"arxiv","version":2},"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:e6cf0f04d12cbd97c62a43e72169b5fe5b9a268b047292464752e821d49cb1fa","target":"record","created_at":"2026-05-17T23:43:56Z","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":"74cb767747e797ef3ea62e9b9be1c848136f258656f2f598d61ddb0e063f2fb9","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-13T00:10:00Z","title_canon_sha256":"78ea5c44325fca7e019dfb86fc3592fcbb7c7a198ce059eea06e66d6ef1515af"},"schema_version":"1.0","source":{"id":"1802.06875","kind":"arxiv","version":2}},"canonical_sha256":"09eda3578906767e1dce4dff1219df9cb0d5a48571ce4384118e37f97001ffe5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09eda3578906767e1dce4dff1219df9cb0d5a48571ce4384118e37f97001ffe5","first_computed_at":"2026-05-17T23:43:56.773410Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:56.773410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eLwgabTBXEEuK4S9GmlkQgIEYGjCkHphD1R406bywcG0cQBWYGZgqZjyxpBRXQUNrLwSJgWVH+oZQYF8fw/QBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:56.774216Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06875","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6cf0f04d12cbd97c62a43e72169b5fe5b9a268b047292464752e821d49cb1fa","sha256:c2488ef9199138b91a7bd0e131eabe9fbaf988e8fd1532f67216f4a2a9a4e644"],"state_sha256":"5e872856392e55f1b979afc1a2b8783365d0f067d5a6cbc719175d2b96384544"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P3xfnSVvlvfgZMOESjcVqVjWUVWFtvoGKrG4mYLgf2A97waL8iCqjYLeaIVbnPPjn2klcCW040grrwtAOr92AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:36:03.891800Z","bundle_sha256":"4a2912df7887a3cdbb2b2f5997eb699821530fa6049a161ff2788de7b4c6f8db"}}