{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IKW5T7K4U2FAMECALUS4TSMBUV","short_pith_number":"pith:IKW5T7K4","canonical_record":{"source":{"id":"1402.7344","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-28T18:54:07Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8ee0ad9931b505805b253dbfb67990e7b7b196de6a6b8ea33ea5cc39b95d3926","abstract_canon_sha256":"444c10aa53602e2309a084ad09d9c209054fa64c40577e8e54a5b5ff918f7045"},"schema_version":"1.0"},"canonical_sha256":"42add9fd5ca68a0610405d25c9c981a56cb248fe0d76253eef9cc6f298d73224","source":{"kind":"arxiv","id":"1402.7344","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.7344","created_at":"2026-05-18T02:25:32Z"},{"alias_kind":"arxiv_version","alias_value":"1402.7344v2","created_at":"2026-05-18T02:25:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.7344","created_at":"2026-05-18T02:25:32Z"},{"alias_kind":"pith_short_12","alias_value":"IKW5T7K4U2FA","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IKW5T7K4U2FAMECA","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IKW5T7K4","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IKW5T7K4U2FAMECALUS4TSMBUV","target":"record","payload":{"canonical_record":{"source":{"id":"1402.7344","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-28T18:54:07Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8ee0ad9931b505805b253dbfb67990e7b7b196de6a6b8ea33ea5cc39b95d3926","abstract_canon_sha256":"444c10aa53602e2309a084ad09d9c209054fa64c40577e8e54a5b5ff918f7045"},"schema_version":"1.0"},"canonical_sha256":"42add9fd5ca68a0610405d25c9c981a56cb248fe0d76253eef9cc6f298d73224","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:32.724920Z","signature_b64":"SjTDfpTtTK3Wu/qbyNyMdVA/VvwrmwqoFzDBRJl1k+80XgMi/Q3/DwAarM7uQJcEVcS6t3Po45QW3kyLbXHFCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42add9fd5ca68a0610405d25c9c981a56cb248fe0d76253eef9cc6f298d73224","last_reissued_at":"2026-05-18T02:25:32.724482Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:32.724482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.7344","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-18T02:25:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lzZThzS/gaVyaYJ6XDV4/E8kBD5Z0CPz/ee1FBzsPyaLtRAamsaQZ8/DLMyxlRnSlfPuebazRoeFL3Edndd3BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:01:11.141201Z"},"content_sha256":"85690431ba1ce82e77c4aff671ee07eb2e8bbfaf8a7ee0cc30d9c9bbbe978787","schema_version":"1.0","event_id":"sha256:85690431ba1ce82e77c4aff671ee07eb2e8bbfaf8a7ee0cc30d9c9bbbe978787"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IKW5T7K4U2FAMECALUS4TSMBUV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Incidence Geometry approach to Dictionary Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Meera Sitharam, Menghan Wang, Mohamad Tarifi","submitted_at":"2014-02-28T18:54:07Z","abstract_excerpt":"We study the Dictionary Learning (aka Sparse Coding) problem of obtaining a sparse representation of data points, by learning \\emph{dictionary vectors} upon which the data points can be written as sparse linear combinations. We view this problem from a geometry perspective as the spanning set of a subspace arrangement, and focus on understanding the case when the underlying hypergraph of the subspace arrangement is specified. For this Fitted Dictionary Learning problem, we completely characterize the combinatorics of the associated subspace arrangements (i.e.\\ their underlying hypergraphs). Sp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.7344","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-18T02:25:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y3XAACp3NDS99bYlET19p3ot/ZtqlIwhvXQLtyiQRTgX8GUm9zLc3NU8P+pST2dMNw/vD+LZk1kgVo0p0nB4Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:01:11.141707Z"},"content_sha256":"9534047c04a54d6c5f09e4e20ab7b29c9fa3d112ed97fa5e7a0faaa4e9b55f92","schema_version":"1.0","event_id":"sha256:9534047c04a54d6c5f09e4e20ab7b29c9fa3d112ed97fa5e7a0faaa4e9b55f92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IKW5T7K4U2FAMECALUS4TSMBUV/bundle.json","state_url":"https://pith.science/pith/IKW5T7K4U2FAMECALUS4TSMBUV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IKW5T7K4U2FAMECALUS4TSMBUV/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-25T14:01:11Z","links":{"resolver":"https://pith.science/pith/IKW5T7K4U2FAMECALUS4TSMBUV","bundle":"https://pith.science/pith/IKW5T7K4U2FAMECALUS4TSMBUV/bundle.json","state":"https://pith.science/pith/IKW5T7K4U2FAMECALUS4TSMBUV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IKW5T7K4U2FAMECALUS4TSMBUV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IKW5T7K4U2FAMECALUS4TSMBUV","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":"444c10aa53602e2309a084ad09d9c209054fa64c40577e8e54a5b5ff918f7045","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-28T18:54:07Z","title_canon_sha256":"8ee0ad9931b505805b253dbfb67990e7b7b196de6a6b8ea33ea5cc39b95d3926"},"schema_version":"1.0","source":{"id":"1402.7344","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.7344","created_at":"2026-05-18T02:25:32Z"},{"alias_kind":"arxiv_version","alias_value":"1402.7344v2","created_at":"2026-05-18T02:25:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.7344","created_at":"2026-05-18T02:25:32Z"},{"alias_kind":"pith_short_12","alias_value":"IKW5T7K4U2FA","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IKW5T7K4U2FAMECA","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IKW5T7K4","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:9534047c04a54d6c5f09e4e20ab7b29c9fa3d112ed97fa5e7a0faaa4e9b55f92","target":"graph","created_at":"2026-05-18T02:25:32Z","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 study the Dictionary Learning (aka Sparse Coding) problem of obtaining a sparse representation of data points, by learning \\emph{dictionary vectors} upon which the data points can be written as sparse linear combinations. We view this problem from a geometry perspective as the spanning set of a subspace arrangement, and focus on understanding the case when the underlying hypergraph of the subspace arrangement is specified. For this Fitted Dictionary Learning problem, we completely characterize the combinatorics of the associated subspace arrangements (i.e.\\ their underlying hypergraphs). Sp","authors_text":"Meera Sitharam, Menghan Wang, Mohamad Tarifi","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-28T18:54:07Z","title":"An Incidence Geometry approach to Dictionary Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.7344","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:85690431ba1ce82e77c4aff671ee07eb2e8bbfaf8a7ee0cc30d9c9bbbe978787","target":"record","created_at":"2026-05-18T02:25:32Z","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":"444c10aa53602e2309a084ad09d9c209054fa64c40577e8e54a5b5ff918f7045","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-28T18:54:07Z","title_canon_sha256":"8ee0ad9931b505805b253dbfb67990e7b7b196de6a6b8ea33ea5cc39b95d3926"},"schema_version":"1.0","source":{"id":"1402.7344","kind":"arxiv","version":2}},"canonical_sha256":"42add9fd5ca68a0610405d25c9c981a56cb248fe0d76253eef9cc6f298d73224","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42add9fd5ca68a0610405d25c9c981a56cb248fe0d76253eef9cc6f298d73224","first_computed_at":"2026-05-18T02:25:32.724482Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:32.724482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SjTDfpTtTK3Wu/qbyNyMdVA/VvwrmwqoFzDBRJl1k+80XgMi/Q3/DwAarM7uQJcEVcS6t3Po45QW3kyLbXHFCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:32.724920Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.7344","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85690431ba1ce82e77c4aff671ee07eb2e8bbfaf8a7ee0cc30d9c9bbbe978787","sha256:9534047c04a54d6c5f09e4e20ab7b29c9fa3d112ed97fa5e7a0faaa4e9b55f92"],"state_sha256":"96826367325aab73482525c5880987c682890b22b4d13e14c8f3ab47b370df02"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1LT4MNbGZqEQR2N4SClLLW3+OyX6xKu42earr+rU23baw0kuD55pR6eSvUSkeFIUMPezP8h+Do8n2KC0QwZjBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T14:01:11.144640Z","bundle_sha256":"c8d3b99244d8e690aa4596e191b2e204d5a431353416613b47f96f8b71069896"}}