{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:52Y2OBRO4DTXMSI2J426CI2TUL","short_pith_number":"pith:52Y2OBRO","canonical_record":{"source":{"id":"1804.08603","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-23T17:57:33Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"74c8975cbb6f271aadbf0d3b62b66e979c4fc53996f5541b78f2b738bd3626e6","abstract_canon_sha256":"bac3c1b4b37152342e91e9bfd803f89b4e06bfc112ffbb79938fce796564f5b2"},"schema_version":"1.0"},"canonical_sha256":"eeb1a7062ee0e776491a4f35e12353a2ca7eb8a0284165f147ac9853f1d7bf28","source":{"kind":"arxiv","id":"1804.08603","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08603","created_at":"2026-05-18T00:16:36Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08603v2","created_at":"2026-05-18T00:16:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08603","created_at":"2026-05-18T00:16:36Z"},{"alias_kind":"pith_short_12","alias_value":"52Y2OBRO4DTX","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"52Y2OBRO4DTXMSI2","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"52Y2OBRO","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:52Y2OBRO4DTXMSI2J426CI2TUL","target":"record","payload":{"canonical_record":{"source":{"id":"1804.08603","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-23T17:57:33Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"74c8975cbb6f271aadbf0d3b62b66e979c4fc53996f5541b78f2b738bd3626e6","abstract_canon_sha256":"bac3c1b4b37152342e91e9bfd803f89b4e06bfc112ffbb79938fce796564f5b2"},"schema_version":"1.0"},"canonical_sha256":"eeb1a7062ee0e776491a4f35e12353a2ca7eb8a0284165f147ac9853f1d7bf28","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:36.211237Z","signature_b64":"BQrA7VntJV0cGjHdSs25wqpQbuwI3BBLg8W3RdfNoS3Z+86mJ5+DHdEtEmJFl9/FseOLPKBYtwc88nlwxuEDCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eeb1a7062ee0e776491a4f35e12353a2ca7eb8a0284165f147ac9853f1d7bf28","last_reissued_at":"2026-05-18T00:16:36.210804Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:36.210804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.08603","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-18T00:16:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KZRPCGV7xax45chYby0p1indT7fMw/O2PiaQAtJ2k7vOzSJbZcWM4D2DtvPpxJ3bFwEjsu5wFC4igeMXx54jBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T01:59:35.719865Z"},"content_sha256":"e1f9f007d59d3a04413b1f7fa242ac29743617caacabdcbe7313483f307126fe","schema_version":"1.0","event_id":"sha256:e1f9f007d59d3a04413b1f7fa242ac29743617caacabdcbe7313483f307126fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:52Y2OBRO4DTXMSI2J426CI2TUL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Learning Sparsely Used Dictionaries with Arbitrary Supports","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aravindan Vijayaraghavan, Pranjal Awasthi","submitted_at":"2018-04-23T17:57:33Z","abstract_excerpt":"Dictionary learning is a popular approach for inferring a hidden basis or dictionary in which data has a sparse representation. Data generated from the dictionary A (an n by m matrix, with m > n in the over-complete setting) is given by Y = AX where X is a matrix whose columns have supports chosen from a distribution over k-sparse vectors, and the non-zero values chosen from a symmetric distribution. Given Y, the goal is to recover A and X in polynomial time. Existing algorithms give polytime guarantees for recovering incoherent dictionaries, under strong distributional assumptions both on the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08603","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-18T00:16:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W/R2IpWdgqBCOB8GLtGlxTexuHst5nxXKLFTjV5SFBpuBIdJX2lLXXH8/1YxoiY9Gegrq9pagitdEvGnxyYYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T01:59:35.720207Z"},"content_sha256":"157e3f928cfcc2ac70976b840c9aedeef4459e8641f14d91c20fc0c59f544325","schema_version":"1.0","event_id":"sha256:157e3f928cfcc2ac70976b840c9aedeef4459e8641f14d91c20fc0c59f544325"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/52Y2OBRO4DTXMSI2J426CI2TUL/bundle.json","state_url":"https://pith.science/pith/52Y2OBRO4DTXMSI2J426CI2TUL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/52Y2OBRO4DTXMSI2J426CI2TUL/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-07-05T01:59:35Z","links":{"resolver":"https://pith.science/pith/52Y2OBRO4DTXMSI2J426CI2TUL","bundle":"https://pith.science/pith/52Y2OBRO4DTXMSI2J426CI2TUL/bundle.json","state":"https://pith.science/pith/52Y2OBRO4DTXMSI2J426CI2TUL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/52Y2OBRO4DTXMSI2J426CI2TUL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:52Y2OBRO4DTXMSI2J426CI2TUL","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":"bac3c1b4b37152342e91e9bfd803f89b4e06bfc112ffbb79938fce796564f5b2","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-23T17:57:33Z","title_canon_sha256":"74c8975cbb6f271aadbf0d3b62b66e979c4fc53996f5541b78f2b738bd3626e6"},"schema_version":"1.0","source":{"id":"1804.08603","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08603","created_at":"2026-05-18T00:16:36Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08603v2","created_at":"2026-05-18T00:16:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08603","created_at":"2026-05-18T00:16:36Z"},{"alias_kind":"pith_short_12","alias_value":"52Y2OBRO4DTX","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"52Y2OBRO4DTXMSI2","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"52Y2OBRO","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:157e3f928cfcc2ac70976b840c9aedeef4459e8641f14d91c20fc0c59f544325","target":"graph","created_at":"2026-05-18T00:16:36Z","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 is a popular approach for inferring a hidden basis or dictionary in which data has a sparse representation. Data generated from the dictionary A (an n by m matrix, with m > n in the over-complete setting) is given by Y = AX where X is a matrix whose columns have supports chosen from a distribution over k-sparse vectors, and the non-zero values chosen from a symmetric distribution. Given Y, the goal is to recover A and X in polynomial time. Existing algorithms give polytime guarantees for recovering incoherent dictionaries, under strong distributional assumptions both on the","authors_text":"Aravindan Vijayaraghavan, Pranjal Awasthi","cross_cats":["cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-23T17:57:33Z","title":"Towards Learning Sparsely Used Dictionaries with Arbitrary Supports"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08603","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:e1f9f007d59d3a04413b1f7fa242ac29743617caacabdcbe7313483f307126fe","target":"record","created_at":"2026-05-18T00:16:36Z","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":"bac3c1b4b37152342e91e9bfd803f89b4e06bfc112ffbb79938fce796564f5b2","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-23T17:57:33Z","title_canon_sha256":"74c8975cbb6f271aadbf0d3b62b66e979c4fc53996f5541b78f2b738bd3626e6"},"schema_version":"1.0","source":{"id":"1804.08603","kind":"arxiv","version":2}},"canonical_sha256":"eeb1a7062ee0e776491a4f35e12353a2ca7eb8a0284165f147ac9853f1d7bf28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eeb1a7062ee0e776491a4f35e12353a2ca7eb8a0284165f147ac9853f1d7bf28","first_computed_at":"2026-05-18T00:16:36.210804Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:36.210804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BQrA7VntJV0cGjHdSs25wqpQbuwI3BBLg8W3RdfNoS3Z+86mJ5+DHdEtEmJFl9/FseOLPKBYtwc88nlwxuEDCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:36.211237Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.08603","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1f9f007d59d3a04413b1f7fa242ac29743617caacabdcbe7313483f307126fe","sha256:157e3f928cfcc2ac70976b840c9aedeef4459e8641f14d91c20fc0c59f544325"],"state_sha256":"6c89409be747795abc4eb03325159323f55daa46195467d85967c2b73af3d0ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kd/Unt3D26x9gZGwYQ00TdBICXYtWDWAePDG3ct567ZZ7NvHGN0XoOQwpkjgJnH/ttA6PkGXkz6NiFLfORBcCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T01:59:35.722118Z","bundle_sha256":"da1296fcbf11adc45172604f4d7eeaac14a9411062238be37e07126991e07109"}}