{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SLFMMT6Q2CGURDXW2K35P45M26","short_pith_number":"pith:SLFMMT6Q","canonical_record":{"source":{"id":"1403.4781","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-03-19T12:16:17Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6f6d85591e3122c49ee2cbbf401bb93e7ce34684f25fc8d43ac529532a5acc85","abstract_canon_sha256":"a31ef26d68fb8431b523042328f3fed40601cd56f2c916abc0abd7c0b468146a"},"schema_version":"1.0"},"canonical_sha256":"92cac64fd0d08d488ef6d2b7d7f3acd788b69afd0cc3dba210fcfdd48dbef05e","source":{"kind":"arxiv","id":"1403.4781","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.4781","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"arxiv_version","alias_value":"1403.4781v1","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4781","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"pith_short_12","alias_value":"SLFMMT6Q2CGU","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SLFMMT6Q2CGURDXW","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SLFMMT6Q","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SLFMMT6Q2CGURDXW2K35P45M26","target":"record","payload":{"canonical_record":{"source":{"id":"1403.4781","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-03-19T12:16:17Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6f6d85591e3122c49ee2cbbf401bb93e7ce34684f25fc8d43ac529532a5acc85","abstract_canon_sha256":"a31ef26d68fb8431b523042328f3fed40601cd56f2c916abc0abd7c0b468146a"},"schema_version":"1.0"},"canonical_sha256":"92cac64fd0d08d488ef6d2b7d7f3acd788b69afd0cc3dba210fcfdd48dbef05e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:04.477720Z","signature_b64":"127Ikm/HOpxE8mi72Ycbwv1KAX490Zz4VhjYTNIcxXNjHaeS6w7DlEdaNrdQuZP/vVqMSp0CX+jYeSh4WDqDBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92cac64fd0d08d488ef6d2b7d7f3acd788b69afd0cc3dba210fcfdd48dbef05e","last_reissued_at":"2026-05-18T02:56:04.477152Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:04.477152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.4781","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:56:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4pcIWOkcHBTLRo84Rewg5/fjPuR0JcCjmkTcCvzCKon52bY+dwhLbR2OPFJ09P9uMW17IgXvvxlHFz/n0H7SDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:24:07.023716Z"},"content_sha256":"736a4a556ce5284d1b51dfed52e1e87baf10ea2aa5e2c9a4585af376feb51932","schema_version":"1.0","event_id":"sha256:736a4a556ce5284d1b51dfed52e1e87baf10ea2aa5e2c9a4585af376feb51932"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SLFMMT6Q2CGURDXW2K35P45M26","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Split-and-Merge Dictionary Learning Algorithm for Sparse Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chandra Sekhar Seelamantula, Subhadip Mukherjee","submitted_at":"2014-03-19T12:16:17Z","abstract_excerpt":"In big data image/video analytics, we encounter the problem of learning an overcomplete dictionary for sparse representation from a large training dataset, which can not be processed at once because of storage and computational constraints. To tackle the problem of dictionary learning in such scenarios, we propose an algorithm for parallel dictionary learning. The fundamental idea behind the algorithm is to learn a sparse representation in two phases. In the first phase, the whole training dataset is partitioned into small non-overlapping subsets, and a dictionary is trained independently on e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4781","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:56:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h0lQYCZEbpdXxxYazkVCCZ1mwUO+DeLy1g4ABDsrxaAlEpSAlot52qb5gKd5dTpKz4uy1PrL+BHoR8ODp/Q8Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:24:07.024064Z"},"content_sha256":"15590f5d672c2bc664b3878f414f8cef7584c321bae9f2d7b109d4bf66272f62","schema_version":"1.0","event_id":"sha256:15590f5d672c2bc664b3878f414f8cef7584c321bae9f2d7b109d4bf66272f62"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SLFMMT6Q2CGURDXW2K35P45M26/bundle.json","state_url":"https://pith.science/pith/SLFMMT6Q2CGURDXW2K35P45M26/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SLFMMT6Q2CGURDXW2K35P45M26/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-28T07:24:07Z","links":{"resolver":"https://pith.science/pith/SLFMMT6Q2CGURDXW2K35P45M26","bundle":"https://pith.science/pith/SLFMMT6Q2CGURDXW2K35P45M26/bundle.json","state":"https://pith.science/pith/SLFMMT6Q2CGURDXW2K35P45M26/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SLFMMT6Q2CGURDXW2K35P45M26/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SLFMMT6Q2CGURDXW2K35P45M26","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":"a31ef26d68fb8431b523042328f3fed40601cd56f2c916abc0abd7c0b468146a","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-03-19T12:16:17Z","title_canon_sha256":"6f6d85591e3122c49ee2cbbf401bb93e7ce34684f25fc8d43ac529532a5acc85"},"schema_version":"1.0","source":{"id":"1403.4781","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.4781","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"arxiv_version","alias_value":"1403.4781v1","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4781","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"pith_short_12","alias_value":"SLFMMT6Q2CGU","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SLFMMT6Q2CGURDXW","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SLFMMT6Q","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:15590f5d672c2bc664b3878f414f8cef7584c321bae9f2d7b109d4bf66272f62","target":"graph","created_at":"2026-05-18T02:56:04Z","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":"In big data image/video analytics, we encounter the problem of learning an overcomplete dictionary for sparse representation from a large training dataset, which can not be processed at once because of storage and computational constraints. To tackle the problem of dictionary learning in such scenarios, we propose an algorithm for parallel dictionary learning. The fundamental idea behind the algorithm is to learn a sparse representation in two phases. In the first phase, the whole training dataset is partitioned into small non-overlapping subsets, and a dictionary is trained independently on e","authors_text":"Chandra Sekhar Seelamantula, Subhadip Mukherjee","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-03-19T12:16:17Z","title":"A Split-and-Merge Dictionary Learning Algorithm for Sparse Representation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4781","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:736a4a556ce5284d1b51dfed52e1e87baf10ea2aa5e2c9a4585af376feb51932","target":"record","created_at":"2026-05-18T02:56:04Z","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":"a31ef26d68fb8431b523042328f3fed40601cd56f2c916abc0abd7c0b468146a","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-03-19T12:16:17Z","title_canon_sha256":"6f6d85591e3122c49ee2cbbf401bb93e7ce34684f25fc8d43ac529532a5acc85"},"schema_version":"1.0","source":{"id":"1403.4781","kind":"arxiv","version":1}},"canonical_sha256":"92cac64fd0d08d488ef6d2b7d7f3acd788b69afd0cc3dba210fcfdd48dbef05e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92cac64fd0d08d488ef6d2b7d7f3acd788b69afd0cc3dba210fcfdd48dbef05e","first_computed_at":"2026-05-18T02:56:04.477152Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:04.477152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"127Ikm/HOpxE8mi72Ycbwv1KAX490Zz4VhjYTNIcxXNjHaeS6w7DlEdaNrdQuZP/vVqMSp0CX+jYeSh4WDqDBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:04.477720Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.4781","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:736a4a556ce5284d1b51dfed52e1e87baf10ea2aa5e2c9a4585af376feb51932","sha256:15590f5d672c2bc664b3878f414f8cef7584c321bae9f2d7b109d4bf66272f62"],"state_sha256":"c7e21fa0dcd12cffdcb97adefbda5b34ba3dbebd0f66f5817c5942832d28b094"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"47DS3F0ZXKoOu24fjVkYVK7FytgVnrRWKU2SYM5IiJ/48gflU4jlubcqpStcFYbS25fAfamn282+o6Uk7ANFBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:24:07.026050Z","bundle_sha256":"e1c72f52d0dd3ab2817aa6217c052ce203f7f11adacc1829abab815373d4ceb6"}}