{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:NYQVKV5L5XIV6CAMWWWXNQYOYR","short_pith_number":"pith:NYQVKV5L","canonical_record":{"source":{"id":"1210.1121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-03T14:26:59Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"da20dbc9aebce72850f669ed9bee651fc9cf3c59d8764697a577ff708208931e","abstract_canon_sha256":"a6e021e44c65bc94decb6dee71cbf97fc3c26ff4e90f62e887d2fce813b4dcf6"},"schema_version":"1.0"},"canonical_sha256":"6e215557abedd15f080cb5ad76c30ec447d0d436171494215e57fd6c385b1ca1","source":{"kind":"arxiv","id":"1210.1121","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.1121","created_at":"2026-05-18T03:44:05Z"},{"alias_kind":"arxiv_version","alias_value":"1210.1121v1","created_at":"2026-05-18T03:44:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1121","created_at":"2026-05-18T03:44:05Z"},{"alias_kind":"pith_short_12","alias_value":"NYQVKV5L5XIV","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NYQVKV5L5XIV6CAM","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NYQVKV5L","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:NYQVKV5L5XIV6CAMWWWXNQYOYR","target":"record","payload":{"canonical_record":{"source":{"id":"1210.1121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-03T14:26:59Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"da20dbc9aebce72850f669ed9bee651fc9cf3c59d8764697a577ff708208931e","abstract_canon_sha256":"a6e021e44c65bc94decb6dee71cbf97fc3c26ff4e90f62e887d2fce813b4dcf6"},"schema_version":"1.0"},"canonical_sha256":"6e215557abedd15f080cb5ad76c30ec447d0d436171494215e57fd6c385b1ca1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:05.429128Z","signature_b64":"ee+dDQA5sIGzVa6exJAnvac4D49P18Z/RkcwtyZ2ZXUn39tjQb0UxYayiu7kR5HwH3wMUssvogct/mi4ttCcDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e215557abedd15f080cb5ad76c30ec447d0d436171494215e57fd6c385b1ca1","last_reissued_at":"2026-05-18T03:44:05.428435Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:05.428435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.1121","source_version":1,"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-18T03:44:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z7mOmktuaZ+FtHO3m6fOph8eYGKLaLoErmHJNxFeu593ApMiR3LqcyRgUmx77qhNyYIBy9xdY67UJi1hR94xBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:42:50.221914Z"},"content_sha256":"02d1bf11a24133ec081ba138093f43b4cc746a288287e580a3716d6cd665f37c","schema_version":"1.0","event_id":"sha256:02d1bf11a24133ec081ba138093f43b4cc746a288287e580a3716d6cd665f37c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:NYQVKV5L5XIV6CAMWWWXNQYOYR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Smooth Sparse Coding via Marginal Regression for Learning Sparse Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Guy Lebanon, Kai Yu, Krishnakumar Balasubramanian","submitted_at":"2012-10-03T14:26:59Z","abstract_excerpt":"We propose and analyze a novel framework for learning sparse representations, based on two statistical techniques: kernel smoothing and marginal regression. The proposed approach provides a flexible framework for incorporating feature similarity or temporal information present in data sets, via non-parametric kernel smoothing. We provide generalization bounds for dictionary learning using smooth sparse coding and show how the sample complexity depends on the L1 norm of kernel function used. Furthermore, we propose using marginal regression for obtaining sparse codes, which significantly improv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1121","kind":"arxiv","version":1},"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-18T03:44:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dac0xhr7Yvbw9DLVsMtRjZGi/8jqa264F5TTgncTItgTYmVFtCDdevUASl/gL4j9f7hCl6qd9xbcRxZMEcn0CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:42:50.222588Z"},"content_sha256":"9b463eda037fe666a78b49dcd7be45c2ba42d694cb839e5ac6f3f4b0f4bc6772","schema_version":"1.0","event_id":"sha256:9b463eda037fe666a78b49dcd7be45c2ba42d694cb839e5ac6f3f4b0f4bc6772"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NYQVKV5L5XIV6CAMWWWXNQYOYR/bundle.json","state_url":"https://pith.science/pith/NYQVKV5L5XIV6CAMWWWXNQYOYR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NYQVKV5L5XIV6CAMWWWXNQYOYR/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-06-06T20:42:50Z","links":{"resolver":"https://pith.science/pith/NYQVKV5L5XIV6CAMWWWXNQYOYR","bundle":"https://pith.science/pith/NYQVKV5L5XIV6CAMWWWXNQYOYR/bundle.json","state":"https://pith.science/pith/NYQVKV5L5XIV6CAMWWWXNQYOYR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NYQVKV5L5XIV6CAMWWWXNQYOYR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NYQVKV5L5XIV6CAMWWWXNQYOYR","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":"a6e021e44c65bc94decb6dee71cbf97fc3c26ff4e90f62e887d2fce813b4dcf6","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-03T14:26:59Z","title_canon_sha256":"da20dbc9aebce72850f669ed9bee651fc9cf3c59d8764697a577ff708208931e"},"schema_version":"1.0","source":{"id":"1210.1121","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.1121","created_at":"2026-05-18T03:44:05Z"},{"alias_kind":"arxiv_version","alias_value":"1210.1121v1","created_at":"2026-05-18T03:44:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1121","created_at":"2026-05-18T03:44:05Z"},{"alias_kind":"pith_short_12","alias_value":"NYQVKV5L5XIV","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NYQVKV5L5XIV6CAM","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NYQVKV5L","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:9b463eda037fe666a78b49dcd7be45c2ba42d694cb839e5ac6f3f4b0f4bc6772","target":"graph","created_at":"2026-05-18T03:44:05Z","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 propose and analyze a novel framework for learning sparse representations, based on two statistical techniques: kernel smoothing and marginal regression. The proposed approach provides a flexible framework for incorporating feature similarity or temporal information present in data sets, via non-parametric kernel smoothing. We provide generalization bounds for dictionary learning using smooth sparse coding and show how the sample complexity depends on the L1 norm of kernel function used. Furthermore, we propose using marginal regression for obtaining sparse codes, which significantly improv","authors_text":"Guy Lebanon, Kai Yu, Krishnakumar Balasubramanian","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-03T14:26:59Z","title":"Smooth Sparse Coding via Marginal Regression for Learning Sparse Representations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1121","kind":"arxiv","version":1},"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:02d1bf11a24133ec081ba138093f43b4cc746a288287e580a3716d6cd665f37c","target":"record","created_at":"2026-05-18T03:44:05Z","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":"a6e021e44c65bc94decb6dee71cbf97fc3c26ff4e90f62e887d2fce813b4dcf6","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-03T14:26:59Z","title_canon_sha256":"da20dbc9aebce72850f669ed9bee651fc9cf3c59d8764697a577ff708208931e"},"schema_version":"1.0","source":{"id":"1210.1121","kind":"arxiv","version":1}},"canonical_sha256":"6e215557abedd15f080cb5ad76c30ec447d0d436171494215e57fd6c385b1ca1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e215557abedd15f080cb5ad76c30ec447d0d436171494215e57fd6c385b1ca1","first_computed_at":"2026-05-18T03:44:05.428435Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:05.428435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ee+dDQA5sIGzVa6exJAnvac4D49P18Z/RkcwtyZ2ZXUn39tjQb0UxYayiu7kR5HwH3wMUssvogct/mi4ttCcDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:05.429128Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.1121","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02d1bf11a24133ec081ba138093f43b4cc746a288287e580a3716d6cd665f37c","sha256:9b463eda037fe666a78b49dcd7be45c2ba42d694cb839e5ac6f3f4b0f4bc6772"],"state_sha256":"884cc6a6311e4074e9c56eb32bc3b3418c998131b60890b5acf5c35c451c8d23"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0iwSF+fmOv/ISooE5S2qxhnPiROTBQpm8lPWiZM9h3dLzbV/2hRdQGs2qsHFf6BQupOgHa8+5yrwFUIIiabFDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T20:42:50.226933Z","bundle_sha256":"5366b5e34251ccaac09f6de1facc573db9dfdbf4b242392d52b46cbb8eabf86e"}}