{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MGBUIWXWBX6CYAJ6SHYKNCZ6C3","short_pith_number":"pith:MGBUIWXW","canonical_record":{"source":{"id":"1511.04777","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-15T23:00:29Z","cross_cats_sorted":["cs.CV","math.IT","math.OC","stat.ML"],"title_canon_sha256":"fe009e946bf88c34f06545d3ca3a989781c6b70557a24b56f78837cf1f89dc24","abstract_canon_sha256":"99e67a60313f01b11117cdd33cfa630eaefc1407db08237ca0d2c5509bf53b82"},"schema_version":"1.0"},"canonical_sha256":"6183445af60dfc2c013e91f0a68b3e16cff0900ff9e621517da63bccb066aa22","source":{"kind":"arxiv","id":"1511.04777","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.04777","created_at":"2026-05-18T00:52:32Z"},{"alias_kind":"arxiv_version","alias_value":"1511.04777v3","created_at":"2026-05-18T00:52:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04777","created_at":"2026-05-18T00:52:32Z"},{"alias_kind":"pith_short_12","alias_value":"MGBUIWXWBX6C","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MGBUIWXWBX6CYAJ6","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MGBUIWXW","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MGBUIWXWBX6CYAJ6SHYKNCZ6C3","target":"record","payload":{"canonical_record":{"source":{"id":"1511.04777","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-15T23:00:29Z","cross_cats_sorted":["cs.CV","math.IT","math.OC","stat.ML"],"title_canon_sha256":"fe009e946bf88c34f06545d3ca3a989781c6b70557a24b56f78837cf1f89dc24","abstract_canon_sha256":"99e67a60313f01b11117cdd33cfa630eaefc1407db08237ca0d2c5509bf53b82"},"schema_version":"1.0"},"canonical_sha256":"6183445af60dfc2c013e91f0a68b3e16cff0900ff9e621517da63bccb066aa22","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:32.777412Z","signature_b64":"XULRny3YeJCWeVvgw2JbrjbFxnhiMeCkJMrJenNPkr38gorypTAHHsy7x2zWgx09vlCjKsR354F9CFiCL01mBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6183445af60dfc2c013e91f0a68b3e16cff0900ff9e621517da63bccb066aa22","last_reissued_at":"2026-05-18T00:52:32.776853Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:32.776853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.04777","source_version":3,"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:52:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"urnK+1w0Ox5eE7poSHIvexlV1Mm5mygBXydOo+1rh0m1FiVhQ6H1hIVVa61x+qiiZIyQPhIzhybXlTcW9VJ8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:46:53.553659Z"},"content_sha256":"ad26623104d4b756da43aaef63c2843cc2f3f2bdbcf6e5df7cbc04aee02985ea","schema_version":"1.0","event_id":"sha256:ad26623104d4b756da43aaef63c2843cc2f3f2bdbcf6e5df7cbc04aee02985ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MGBUIWXWBX6CYAJ6SHYKNCZ6C3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complete Dictionary Recovery over the Sphere II: Recovery by Riemannian Trust-region Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","math.IT","math.OC","stat.ML"],"primary_cat":"cs.IT","authors_text":"John Wright, Ju Sun, Qing Qu","submitted_at":"2015-11-15T23:00:29Z","abstract_excerpt":"We consider the problem of recovering a complete (i.e., square and invertible) matrix $\\mathbf A_0$, from $\\mathbf Y \\in \\mathbb{R}^{n \\times p}$ with $\\mathbf Y = \\mathbf A_0 \\mathbf X_0$, provided $\\mathbf X_0$ is sufficiently sparse. This recovery problem is central to theoretical understanding of dictionary learning, which seeks a sparse representation for a collection of input signals and finds numerous applications in modern signal processing and machine learning. We give the first efficient algorithm that provably recovers $\\mathbf A_0$ when $\\mathbf X_0$ has $O(n)$ nonzeros per column,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04777","kind":"arxiv","version":3},"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:52:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DdDw9JMrNCPjS/y86s5uOYiYf+AoTdR/ekLMMKeUNkvSqXY5TvhXpX4s2PuDZWYUG5JIbvIYKTNwSQfV02vHBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:46:53.554367Z"},"content_sha256":"7d4eea6ee312e7971ed1bf8c0e9fc9419ed4f4413daccc4cdb05ade3903b8406","schema_version":"1.0","event_id":"sha256:7d4eea6ee312e7971ed1bf8c0e9fc9419ed4f4413daccc4cdb05ade3903b8406"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MGBUIWXWBX6CYAJ6SHYKNCZ6C3/bundle.json","state_url":"https://pith.science/pith/MGBUIWXWBX6CYAJ6SHYKNCZ6C3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MGBUIWXWBX6CYAJ6SHYKNCZ6C3/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-28T20:46:53Z","links":{"resolver":"https://pith.science/pith/MGBUIWXWBX6CYAJ6SHYKNCZ6C3","bundle":"https://pith.science/pith/MGBUIWXWBX6CYAJ6SHYKNCZ6C3/bundle.json","state":"https://pith.science/pith/MGBUIWXWBX6CYAJ6SHYKNCZ6C3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MGBUIWXWBX6CYAJ6SHYKNCZ6C3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MGBUIWXWBX6CYAJ6SHYKNCZ6C3","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":"99e67a60313f01b11117cdd33cfa630eaefc1407db08237ca0d2c5509bf53b82","cross_cats_sorted":["cs.CV","math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-15T23:00:29Z","title_canon_sha256":"fe009e946bf88c34f06545d3ca3a989781c6b70557a24b56f78837cf1f89dc24"},"schema_version":"1.0","source":{"id":"1511.04777","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.04777","created_at":"2026-05-18T00:52:32Z"},{"alias_kind":"arxiv_version","alias_value":"1511.04777v3","created_at":"2026-05-18T00:52:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04777","created_at":"2026-05-18T00:52:32Z"},{"alias_kind":"pith_short_12","alias_value":"MGBUIWXWBX6C","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MGBUIWXWBX6CYAJ6","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MGBUIWXW","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:7d4eea6ee312e7971ed1bf8c0e9fc9419ed4f4413daccc4cdb05ade3903b8406","target":"graph","created_at":"2026-05-18T00:52: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 consider the problem of recovering a complete (i.e., square and invertible) matrix $\\mathbf A_0$, from $\\mathbf Y \\in \\mathbb{R}^{n \\times p}$ with $\\mathbf Y = \\mathbf A_0 \\mathbf X_0$, provided $\\mathbf X_0$ is sufficiently sparse. This recovery problem is central to theoretical understanding of dictionary learning, which seeks a sparse representation for a collection of input signals and finds numerous applications in modern signal processing and machine learning. We give the first efficient algorithm that provably recovers $\\mathbf A_0$ when $\\mathbf X_0$ has $O(n)$ nonzeros per column,","authors_text":"John Wright, Ju Sun, Qing Qu","cross_cats":["cs.CV","math.IT","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-15T23:00:29Z","title":"Complete Dictionary Recovery over the Sphere II: Recovery by Riemannian Trust-region Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04777","kind":"arxiv","version":3},"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:ad26623104d4b756da43aaef63c2843cc2f3f2bdbcf6e5df7cbc04aee02985ea","target":"record","created_at":"2026-05-18T00:52: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":"99e67a60313f01b11117cdd33cfa630eaefc1407db08237ca0d2c5509bf53b82","cross_cats_sorted":["cs.CV","math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-15T23:00:29Z","title_canon_sha256":"fe009e946bf88c34f06545d3ca3a989781c6b70557a24b56f78837cf1f89dc24"},"schema_version":"1.0","source":{"id":"1511.04777","kind":"arxiv","version":3}},"canonical_sha256":"6183445af60dfc2c013e91f0a68b3e16cff0900ff9e621517da63bccb066aa22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6183445af60dfc2c013e91f0a68b3e16cff0900ff9e621517da63bccb066aa22","first_computed_at":"2026-05-18T00:52:32.776853Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:32.776853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XULRny3YeJCWeVvgw2JbrjbFxnhiMeCkJMrJenNPkr38gorypTAHHsy7x2zWgx09vlCjKsR354F9CFiCL01mBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:32.777412Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.04777","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad26623104d4b756da43aaef63c2843cc2f3f2bdbcf6e5df7cbc04aee02985ea","sha256:7d4eea6ee312e7971ed1bf8c0e9fc9419ed4f4413daccc4cdb05ade3903b8406"],"state_sha256":"07e015a0888c113cf1a3273fbe33366f4c95fc71b798fdd48c3605b7a8906db0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p3/z0klV9KheCdqwQ+WFvWqyctBeuVPZ+8Zu+UbCpxRmxKC/c+F/dFMLWGw2o9yQWkjKJu3fN4ou5w9CO+RLAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:46:53.559514Z","bundle_sha256":"f4ce88a6db273a7ba09648d6eb47bae24406c19f16f2b9efa7d62816c9eb14bd"}}