{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OXS2BN5OPF6YA26VW4ZBVDJWZX","short_pith_number":"pith:OXS2BN5O","canonical_record":{"source":{"id":"1810.10702","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-25T03:07:58Z","cross_cats_sorted":["cs.IT","math.IT","math.OC","stat.ML"],"title_canon_sha256":"33816874eace201dcd83d7fbce0871e3e0fe54bdcaa3484e06576580f6a1616d","abstract_canon_sha256":"bfaf479e0c818d6ccbb4cdfbce00a128012fb0326f3e8c9c7aa26543badbbd79"},"schema_version":"1.0"},"canonical_sha256":"75e5a0b7ae797d806bd5b7321a8d36cdc21cc51ddf73f3cb9aa8908530b598b6","source":{"kind":"arxiv","id":"1810.10702","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10702","created_at":"2026-05-17T23:41:53Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10702v2","created_at":"2026-05-17T23:41:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10702","created_at":"2026-05-17T23:41:53Z"},{"alias_kind":"pith_short_12","alias_value":"OXS2BN5OPF6Y","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OXS2BN5OPF6YA26V","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OXS2BN5O","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OXS2BN5OPF6YA26VW4ZBVDJWZX","target":"record","payload":{"canonical_record":{"source":{"id":"1810.10702","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-25T03:07:58Z","cross_cats_sorted":["cs.IT","math.IT","math.OC","stat.ML"],"title_canon_sha256":"33816874eace201dcd83d7fbce0871e3e0fe54bdcaa3484e06576580f6a1616d","abstract_canon_sha256":"bfaf479e0c818d6ccbb4cdfbce00a128012fb0326f3e8c9c7aa26543badbbd79"},"schema_version":"1.0"},"canonical_sha256":"75e5a0b7ae797d806bd5b7321a8d36cdc21cc51ddf73f3cb9aa8908530b598b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:53.803063Z","signature_b64":"d2JStbxJnQ1sVF81PHVs+D6TExujwxvgK4MuSnkroSpVWofJzchpaT0LxiOmrmxfckThTUiIXZaVIWzi1LbZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75e5a0b7ae797d806bd5b7321a8d36cdc21cc51ddf73f3cb9aa8908530b598b6","last_reissued_at":"2026-05-17T23:41:53.802457Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:53.802457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.10702","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-17T23:41:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7DSxUhzgaDElud4KnkcmJ8BMI6uF1N2z0t1r/ncWwpS8jiIkZDX+Os7h5/oIn45yhvAGyaoTFLJENj8zxTlzBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:02:06.874334Z"},"content_sha256":"b59c66c3ae879a703bb2301c093042e3705468de872735268b67aef8cc46b8a0","schema_version":"1.0","event_id":"sha256:b59c66c3ae879a703bb2301c093042e3705468de872735268b67aef8cc46b8a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OXS2BN5OPF6YA26VW4ZBVDJWZX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subgradient Descent Learns Orthogonal Dictionaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ju Sun, Qijia Jiang, Yu Bai","submitted_at":"2018-10-25T03:07:58Z","abstract_excerpt":"This paper concerns dictionary learning, i.e., sparse coding, a fundamental representation learning problem. We show that a subgradient descent algorithm, with random initialization, can provably recover orthogonal dictionaries on a natural nonsmooth, nonconvex $\\ell_1$ minimization formulation of the problem, under mild statistical assumptions on the data. This is in contrast to previous provable methods that require either expensive computation or delicate initialization schemes. Our analysis develops several tools for characterizing landscapes of nonsmooth functions, which might be of indep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10702","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-17T23:41:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dgABHqTnqfG7tI2+8xWImpuNN2FxBN2Cjz5A9UY4ErrdaA+GN05i11gOgiBI/Bd7MLcZVb+SBz+NH22XMm7KDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:02:06.879583Z"},"content_sha256":"36ce2ec508565032ead48f5bed8353330e79bb9416b1613d6b116aa464e7591b","schema_version":"1.0","event_id":"sha256:36ce2ec508565032ead48f5bed8353330e79bb9416b1613d6b116aa464e7591b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OXS2BN5OPF6YA26VW4ZBVDJWZX/bundle.json","state_url":"https://pith.science/pith/OXS2BN5OPF6YA26VW4ZBVDJWZX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OXS2BN5OPF6YA26VW4ZBVDJWZX/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:02:06Z","links":{"resolver":"https://pith.science/pith/OXS2BN5OPF6YA26VW4ZBVDJWZX","bundle":"https://pith.science/pith/OXS2BN5OPF6YA26VW4ZBVDJWZX/bundle.json","state":"https://pith.science/pith/OXS2BN5OPF6YA26VW4ZBVDJWZX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OXS2BN5OPF6YA26VW4ZBVDJWZX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OXS2BN5OPF6YA26VW4ZBVDJWZX","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":"bfaf479e0c818d6ccbb4cdfbce00a128012fb0326f3e8c9c7aa26543badbbd79","cross_cats_sorted":["cs.IT","math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-25T03:07:58Z","title_canon_sha256":"33816874eace201dcd83d7fbce0871e3e0fe54bdcaa3484e06576580f6a1616d"},"schema_version":"1.0","source":{"id":"1810.10702","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10702","created_at":"2026-05-17T23:41:53Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10702v2","created_at":"2026-05-17T23:41:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10702","created_at":"2026-05-17T23:41:53Z"},{"alias_kind":"pith_short_12","alias_value":"OXS2BN5OPF6Y","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OXS2BN5OPF6YA26V","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OXS2BN5O","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:36ce2ec508565032ead48f5bed8353330e79bb9416b1613d6b116aa464e7591b","target":"graph","created_at":"2026-05-17T23:41:53Z","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":"This paper concerns dictionary learning, i.e., sparse coding, a fundamental representation learning problem. We show that a subgradient descent algorithm, with random initialization, can provably recover orthogonal dictionaries on a natural nonsmooth, nonconvex $\\ell_1$ minimization formulation of the problem, under mild statistical assumptions on the data. This is in contrast to previous provable methods that require either expensive computation or delicate initialization schemes. Our analysis develops several tools for characterizing landscapes of nonsmooth functions, which might be of indep","authors_text":"Ju Sun, Qijia Jiang, Yu Bai","cross_cats":["cs.IT","math.IT","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-25T03:07:58Z","title":"Subgradient Descent Learns Orthogonal Dictionaries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10702","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:b59c66c3ae879a703bb2301c093042e3705468de872735268b67aef8cc46b8a0","target":"record","created_at":"2026-05-17T23:41:53Z","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":"bfaf479e0c818d6ccbb4cdfbce00a128012fb0326f3e8c9c7aa26543badbbd79","cross_cats_sorted":["cs.IT","math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-25T03:07:58Z","title_canon_sha256":"33816874eace201dcd83d7fbce0871e3e0fe54bdcaa3484e06576580f6a1616d"},"schema_version":"1.0","source":{"id":"1810.10702","kind":"arxiv","version":2}},"canonical_sha256":"75e5a0b7ae797d806bd5b7321a8d36cdc21cc51ddf73f3cb9aa8908530b598b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75e5a0b7ae797d806bd5b7321a8d36cdc21cc51ddf73f3cb9aa8908530b598b6","first_computed_at":"2026-05-17T23:41:53.802457Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:53.802457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d2JStbxJnQ1sVF81PHVs+D6TExujwxvgK4MuSnkroSpVWofJzchpaT0LxiOmrmxfckThTUiIXZaVIWzi1LbZCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:53.803063Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.10702","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b59c66c3ae879a703bb2301c093042e3705468de872735268b67aef8cc46b8a0","sha256:36ce2ec508565032ead48f5bed8353330e79bb9416b1613d6b116aa464e7591b"],"state_sha256":"2c5523c886a60f3158c0edf593abc7be07cbcd44264eba72d7b8049998a78530"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O57xycK3teeexsp4BrxFBxmBInlagsA4owFCKfdB7UPZR7egkb1IxS0p+hbs0p+l5e72GJlE+tfg4dXHtgKOCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T14:02:06.887160Z","bundle_sha256":"8f023e80baf538155ebbda205bc46a993f51602f924b89fa90d140e014e1f652"}}