{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:T24EWS4WR2LYC6PXCHVEEN7K4C","short_pith_number":"pith:T24EWS4W","canonical_record":{"source":{"id":"1502.01094","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-04T05:17:50Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"bf12f39966650b8ea733637a59cd539d39391d8f85107fb6cff03ab8dc556ef0","abstract_canon_sha256":"c4cf139b85d0aed7a3f5b6bafb1c2cb2fb25f347b0c34a3d8ac788157b810548"},"schema_version":"1.0"},"canonical_sha256":"9eb84b4b968e978179f711ea4237eae0933cfd6ed3ea2f5a35dceaf2d57bc70a","source":{"kind":"arxiv","id":"1502.01094","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.01094","created_at":"2026-05-18T01:22:41Z"},{"alias_kind":"arxiv_version","alias_value":"1502.01094v2","created_at":"2026-05-18T01:22:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.01094","created_at":"2026-05-18T01:22:41Z"},{"alias_kind":"pith_short_12","alias_value":"T24EWS4WR2LY","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"T24EWS4WR2LYC6PX","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"T24EWS4W","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:T24EWS4WR2LYC6PXCHVEEN7K4C","target":"record","payload":{"canonical_record":{"source":{"id":"1502.01094","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-04T05:17:50Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"bf12f39966650b8ea733637a59cd539d39391d8f85107fb6cff03ab8dc556ef0","abstract_canon_sha256":"c4cf139b85d0aed7a3f5b6bafb1c2cb2fb25f347b0c34a3d8ac788157b810548"},"schema_version":"1.0"},"canonical_sha256":"9eb84b4b968e978179f711ea4237eae0933cfd6ed3ea2f5a35dceaf2d57bc70a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:41.284725Z","signature_b64":"h6ShNLHmHiEHMCAcxBu7RUVBVEjujDcR2D3FhdwsQHZO5bH947ijVMGl6+4fkNbBoa/333GFH8hDjBCMXO6NBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9eb84b4b968e978179f711ea4237eae0933cfd6ed3ea2f5a35dceaf2d57bc70a","last_reissued_at":"2026-05-18T01:22:41.284082Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:41.284082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.01094","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-18T01:22:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EUAFxg9Hcx1jFtG1N/UlbIX6KACtHBaZylYgeYTwK1NAeRw9pTiGlE35vCSvZ8ZEjeAmwvmTNJJpvB4TpiwsBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:20:19.979728Z"},"content_sha256":"e0b204673f5c0de3779509390dc4d6a9b5d261334deeee7561a207ab41873a3a","schema_version":"1.0","event_id":"sha256:e0b204673f5c0de3779509390dc4d6a9b5d261334deeee7561a207ab41873a3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:T24EWS4WR2LYC6PXCHVEEN7K4C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multimodal Task-Driven Dictionary Learning for Image Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Asok Ray, Nasser M. Nasrabadi, Soheil Bahrampour, W. Kenneth Jenkins","submitted_at":"2015-02-04T05:17:50Z","abstract_excerpt":"Dictionary learning algorithms have been successfully used for both reconstructive and discriminative tasks, where an input signal is represented with a sparse linear combination of dictionary atoms. While these methods are mostly developed for single-modality scenarios, recent studies have demonstrated the advantages of feature-level fusion based on the joint sparse representation of the multimodal inputs. In this paper, we propose a multimodal task-driven dictionary learning algorithm under the joint sparsity constraint (prior) to enforce collaborations among multiple homogeneous/heterogeneo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.01094","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-18T01:22:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UIL1sZ5GqVggKlwzl2zyZc4OFFmPjIbH2oxrBKkSa6CwtHQkK97Ainm5rtLe0Y3rq1bsRPqkUXDHeMjTH4zuCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:20:19.980079Z"},"content_sha256":"3d8ce53082fb6fcf7844f438f1bd367073ea6463fcd82f4f1b5b42d19d0a81ea","schema_version":"1.0","event_id":"sha256:3d8ce53082fb6fcf7844f438f1bd367073ea6463fcd82f4f1b5b42d19d0a81ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T24EWS4WR2LYC6PXCHVEEN7K4C/bundle.json","state_url":"https://pith.science/pith/T24EWS4WR2LYC6PXCHVEEN7K4C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T24EWS4WR2LYC6PXCHVEEN7K4C/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-30T18:20:19Z","links":{"resolver":"https://pith.science/pith/T24EWS4WR2LYC6PXCHVEEN7K4C","bundle":"https://pith.science/pith/T24EWS4WR2LYC6PXCHVEEN7K4C/bundle.json","state":"https://pith.science/pith/T24EWS4WR2LYC6PXCHVEEN7K4C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T24EWS4WR2LYC6PXCHVEEN7K4C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:T24EWS4WR2LYC6PXCHVEEN7K4C","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":"c4cf139b85d0aed7a3f5b6bafb1c2cb2fb25f347b0c34a3d8ac788157b810548","cross_cats_sorted":["cs.CV","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-04T05:17:50Z","title_canon_sha256":"bf12f39966650b8ea733637a59cd539d39391d8f85107fb6cff03ab8dc556ef0"},"schema_version":"1.0","source":{"id":"1502.01094","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.01094","created_at":"2026-05-18T01:22:41Z"},{"alias_kind":"arxiv_version","alias_value":"1502.01094v2","created_at":"2026-05-18T01:22:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.01094","created_at":"2026-05-18T01:22:41Z"},{"alias_kind":"pith_short_12","alias_value":"T24EWS4WR2LY","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"T24EWS4WR2LYC6PX","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"T24EWS4W","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:3d8ce53082fb6fcf7844f438f1bd367073ea6463fcd82f4f1b5b42d19d0a81ea","target":"graph","created_at":"2026-05-18T01:22:41Z","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":"Dictionary learning algorithms have been successfully used for both reconstructive and discriminative tasks, where an input signal is represented with a sparse linear combination of dictionary atoms. While these methods are mostly developed for single-modality scenarios, recent studies have demonstrated the advantages of feature-level fusion based on the joint sparse representation of the multimodal inputs. In this paper, we propose a multimodal task-driven dictionary learning algorithm under the joint sparsity constraint (prior) to enforce collaborations among multiple homogeneous/heterogeneo","authors_text":"Asok Ray, Nasser M. Nasrabadi, Soheil Bahrampour, W. Kenneth Jenkins","cross_cats":["cs.CV","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-04T05:17:50Z","title":"Multimodal Task-Driven Dictionary Learning for Image Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.01094","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:e0b204673f5c0de3779509390dc4d6a9b5d261334deeee7561a207ab41873a3a","target":"record","created_at":"2026-05-18T01:22:41Z","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":"c4cf139b85d0aed7a3f5b6bafb1c2cb2fb25f347b0c34a3d8ac788157b810548","cross_cats_sorted":["cs.CV","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-04T05:17:50Z","title_canon_sha256":"bf12f39966650b8ea733637a59cd539d39391d8f85107fb6cff03ab8dc556ef0"},"schema_version":"1.0","source":{"id":"1502.01094","kind":"arxiv","version":2}},"canonical_sha256":"9eb84b4b968e978179f711ea4237eae0933cfd6ed3ea2f5a35dceaf2d57bc70a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9eb84b4b968e978179f711ea4237eae0933cfd6ed3ea2f5a35dceaf2d57bc70a","first_computed_at":"2026-05-18T01:22:41.284082Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:41.284082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h6ShNLHmHiEHMCAcxBu7RUVBVEjujDcR2D3FhdwsQHZO5bH947ijVMGl6+4fkNbBoa/333GFH8hDjBCMXO6NBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:41.284725Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.01094","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0b204673f5c0de3779509390dc4d6a9b5d261334deeee7561a207ab41873a3a","sha256:3d8ce53082fb6fcf7844f438f1bd367073ea6463fcd82f4f1b5b42d19d0a81ea"],"state_sha256":"aef531b19172d7be1e21b892502a338340f0535d3f7c5c6a6ef94addd5f56f47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sQfxHcE3K0PJaIWTMwAjzklRUD8gqM/gu73rDvQwLG3WpwdnIDHvjFjX1uaxFl9kmKA9IP/3FFg5az0jgSX2AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T18:20:19.982157Z","bundle_sha256":"419b1ba525c4dfbd125b5aac00526a7b3afac765e022905b2af08ce1b95bf916"}}