{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:T2HZKPJZHAUJESYRGC63TOUATT","short_pith_number":"pith:T2HZKPJZ","canonical_record":{"source":{"id":"2110.12786","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2021-10-25T10:29:52Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"37fc7a824d4072d00359cb160f538af233f3b076c21286a17affb67b66ea21d9","abstract_canon_sha256":"4299361b3b0044e8231dad9470b86a0ef452b452fc7140d0f46eebb47100c7db"},"schema_version":"1.0"},"canonical_sha256":"9e8f953d393828924b1130bdb9ba809cf9355726bcf8fb78cbc2204822a95d88","source":{"kind":"arxiv","id":"2110.12786","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.12786","created_at":"2026-07-05T03:25:35Z"},{"alias_kind":"arxiv_version","alias_value":"2110.12786v2","created_at":"2026-07-05T03:25:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.12786","created_at":"2026-07-05T03:25:35Z"},{"alias_kind":"pith_short_12","alias_value":"T2HZKPJZHAUJ","created_at":"2026-07-05T03:25:35Z"},{"alias_kind":"pith_short_16","alias_value":"T2HZKPJZHAUJESYR","created_at":"2026-07-05T03:25:35Z"},{"alias_kind":"pith_short_8","alias_value":"T2HZKPJZ","created_at":"2026-07-05T03:25:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:T2HZKPJZHAUJESYRGC63TOUATT","target":"record","payload":{"canonical_record":{"source":{"id":"2110.12786","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2021-10-25T10:29:52Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"37fc7a824d4072d00359cb160f538af233f3b076c21286a17affb67b66ea21d9","abstract_canon_sha256":"4299361b3b0044e8231dad9470b86a0ef452b452fc7140d0f46eebb47100c7db"},"schema_version":"1.0"},"canonical_sha256":"9e8f953d393828924b1130bdb9ba809cf9355726bcf8fb78cbc2204822a95d88","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:25:35.562406Z","signature_b64":"zRQPMM5sZWkbmmMyR1H7oVwmuDsCY55dP5dVtzHKxcDKARnVePMmR3itSOdoEtRUx9lR0/aMwwaRUkxrCWrFDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e8f953d393828924b1130bdb9ba809cf9355726bcf8fb78cbc2204822a95d88","last_reissued_at":"2026-07-05T03:25:35.562019Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:25:35.562019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2110.12786","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-07-05T03:25:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qUMfoKJ8e4zPcHM6TRFSapvOg6As/qjypdOFGfs6W0lNpQESXZKDSW+vAEfQLQLrxCUrh0AKCg8XEzwnZTSOBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T13:45:38.597693Z"},"content_sha256":"95d91648715f5d38bbcae410cb4e4fe38ba980535eb0f171883beb7209f21bfe","schema_version":"1.0","event_id":"sha256:95d91648715f5d38bbcae410cb4e4fe38ba980535eb0f171883beb7209f21bfe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:T2HZKPJZHAUJESYRGC63TOUATT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dictionary Learning Using Rank-One Atomic Decomposition (ROAD)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"eess.SP","authors_text":"Cheng cheng, Wei Dai","submitted_at":"2021-10-25T10:29:52Z","abstract_excerpt":"Dictionary learning aims at seeking a dictionary under which the training data can be sparsely represented. Methods in the literature typically formulate the dictionary learning problem as an optimization w.r.t. two variables, i.e., dictionary and sparse coefficients, and solve it by alternating between two stages: sparse coding and dictionary update. The key contribution of this work is a Rank-One Atomic Decomposition (ROAD) formulation where dictionary learning is cast as an optimization w.r.t. a single variable which is a set of rank one matrices. The resulting algorithm is hence single-sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.12786","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2110.12786/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:25:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4z2HOI5uReSGFLV8OJhWFgAg8PdyPTg6ep48lQTlt5R4OvJJdTWUbPIcwdlhQBADSHtdLPrjEUdq5N90vGuEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T13:45:38.598056Z"},"content_sha256":"4eaddb14ca21af8e164098c68d630d0f02b269d004e653b74b097901a4205ed5","schema_version":"1.0","event_id":"sha256:4eaddb14ca21af8e164098c68d630d0f02b269d004e653b74b097901a4205ed5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T2HZKPJZHAUJESYRGC63TOUATT/bundle.json","state_url":"https://pith.science/pith/T2HZKPJZHAUJESYRGC63TOUATT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T2HZKPJZHAUJESYRGC63TOUATT/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-06T13:45:38Z","links":{"resolver":"https://pith.science/pith/T2HZKPJZHAUJESYRGC63TOUATT","bundle":"https://pith.science/pith/T2HZKPJZHAUJESYRGC63TOUATT/bundle.json","state":"https://pith.science/pith/T2HZKPJZHAUJESYRGC63TOUATT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T2HZKPJZHAUJESYRGC63TOUATT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:T2HZKPJZHAUJESYRGC63TOUATT","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":"4299361b3b0044e8231dad9470b86a0ef452b452fc7140d0f46eebb47100c7db","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2021-10-25T10:29:52Z","title_canon_sha256":"37fc7a824d4072d00359cb160f538af233f3b076c21286a17affb67b66ea21d9"},"schema_version":"1.0","source":{"id":"2110.12786","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.12786","created_at":"2026-07-05T03:25:35Z"},{"alias_kind":"arxiv_version","alias_value":"2110.12786v2","created_at":"2026-07-05T03:25:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.12786","created_at":"2026-07-05T03:25:35Z"},{"alias_kind":"pith_short_12","alias_value":"T2HZKPJZHAUJ","created_at":"2026-07-05T03:25:35Z"},{"alias_kind":"pith_short_16","alias_value":"T2HZKPJZHAUJESYR","created_at":"2026-07-05T03:25:35Z"},{"alias_kind":"pith_short_8","alias_value":"T2HZKPJZ","created_at":"2026-07-05T03:25:35Z"}],"graph_snapshots":[{"event_id":"sha256:4eaddb14ca21af8e164098c68d630d0f02b269d004e653b74b097901a4205ed5","target":"graph","created_at":"2026-07-05T03:25:35Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2110.12786/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Dictionary learning aims at seeking a dictionary under which the training data can be sparsely represented. Methods in the literature typically formulate the dictionary learning problem as an optimization w.r.t. two variables, i.e., dictionary and sparse coefficients, and solve it by alternating between two stages: sparse coding and dictionary update. The key contribution of this work is a Rank-One Atomic Decomposition (ROAD) formulation where dictionary learning is cast as an optimization w.r.t. a single variable which is a set of rank one matrices. The resulting algorithm is hence single-sta","authors_text":"Cheng cheng, Wei Dai","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2021-10-25T10:29:52Z","title":"Dictionary Learning Using Rank-One Atomic Decomposition (ROAD)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.12786","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:95d91648715f5d38bbcae410cb4e4fe38ba980535eb0f171883beb7209f21bfe","target":"record","created_at":"2026-07-05T03:25:35Z","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":"4299361b3b0044e8231dad9470b86a0ef452b452fc7140d0f46eebb47100c7db","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2021-10-25T10:29:52Z","title_canon_sha256":"37fc7a824d4072d00359cb160f538af233f3b076c21286a17affb67b66ea21d9"},"schema_version":"1.0","source":{"id":"2110.12786","kind":"arxiv","version":2}},"canonical_sha256":"9e8f953d393828924b1130bdb9ba809cf9355726bcf8fb78cbc2204822a95d88","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e8f953d393828924b1130bdb9ba809cf9355726bcf8fb78cbc2204822a95d88","first_computed_at":"2026-07-05T03:25:35.562019Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:25:35.562019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zRQPMM5sZWkbmmMyR1H7oVwmuDsCY55dP5dVtzHKxcDKARnVePMmR3itSOdoEtRUx9lR0/aMwwaRUkxrCWrFDw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:25:35.562406Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.12786","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95d91648715f5d38bbcae410cb4e4fe38ba980535eb0f171883beb7209f21bfe","sha256:4eaddb14ca21af8e164098c68d630d0f02b269d004e653b74b097901a4205ed5"],"state_sha256":"0728bec8ab0efea034175cf5dd53cacc134c3029b024470e300880d49bba6e34"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6HD1i1fhsxIx2Y1JumDotZOebx5EUMZbjOPIKsLubhYebcVmYjp6uH9vDe/CpoIdOK5v78Cgr0YPhIDHn9XgCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T13:45:38.599909Z","bundle_sha256":"eda695118ff10be6dcb22e667cceafb179b94848e065bf17c858520da637b9f7"}}