{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7Y6CDHV37PAD4EIHYILIEV7ZCX","short_pith_number":"pith:7Y6CDHV3","canonical_record":{"source":{"id":"1403.6706","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-03-26T15:16:56Z","cross_cats_sorted":["cs.CV","cs.LG","math.OC"],"title_canon_sha256":"a4d1ed287677c14abc5db21d341bad1c3c81089ff726fd9f7f6f4d11cd5542e0","abstract_canon_sha256":"0dc8f46d81365568673bf88964d96c07ea8b3cf5ba185d900e1c5909da224e2f"},"schema_version":"1.0"},"canonical_sha256":"fe3c219ebbfbc03e1107c2168257f915d14b7d8ce042e82d121c65038f68e6f1","source":{"kind":"arxiv","id":"1403.6706","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.6706","created_at":"2026-05-18T02:55:28Z"},{"alias_kind":"arxiv_version","alias_value":"1403.6706v1","created_at":"2026-05-18T02:55:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6706","created_at":"2026-05-18T02:55:28Z"},{"alias_kind":"pith_short_12","alias_value":"7Y6CDHV37PAD","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7Y6CDHV37PAD4EIH","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7Y6CDHV3","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7Y6CDHV37PAD4EIHYILIEV7ZCX","target":"record","payload":{"canonical_record":{"source":{"id":"1403.6706","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-03-26T15:16:56Z","cross_cats_sorted":["cs.CV","cs.LG","math.OC"],"title_canon_sha256":"a4d1ed287677c14abc5db21d341bad1c3c81089ff726fd9f7f6f4d11cd5542e0","abstract_canon_sha256":"0dc8f46d81365568673bf88964d96c07ea8b3cf5ba185d900e1c5909da224e2f"},"schema_version":"1.0"},"canonical_sha256":"fe3c219ebbfbc03e1107c2168257f915d14b7d8ce042e82d121c65038f68e6f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:28.212844Z","signature_b64":"dRfLg+zKS4hLIvmLS78qHIjv05b4CLsJfhqkazxQE4ej+TE2eUp73gJzNlNHiSkkcSJ3DOEsLfmTpmrp+bqqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe3c219ebbfbc03e1107c2168257f915d14b7d8ce042e82d121c65038f68e6f1","last_reissued_at":"2026-05-18T02:55:28.212377Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:28.212377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.6706","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-18T02:55:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HDlCpxj2p/88J1JFwZSOXqzdLRsRHwuphD8XyIZ2nPhGYo7mngDkk2TsAGku+Ced4z7rfyxOQV43bnO8uwmYBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:23:23.236333Z"},"content_sha256":"ae2db48f48dad311611f8dbd30c31c8c621139ff7ca8f3b0f41074a7fa5f476c","schema_version":"1.0","event_id":"sha256:ae2db48f48dad311611f8dbd30c31c8c621139ff7ca8f3b0f41074a7fa5f476c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7Y6CDHV37PAD4EIHYILIEV7ZCX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Beyond L2-Loss Functions for Learning Sparse Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Aleksandr Y. Aravkin, Jayaraman J. Thiagarajan, Karthikeyan Natesan Ramamurthy","submitted_at":"2014-03-26T15:16:56Z","abstract_excerpt":"Incorporating sparsity priors in learning tasks can give rise to simple, and interpretable models for complex high dimensional data. Sparse models have found widespread use in structure discovery, recovering data from corruptions, and a variety of large scale unsupervised and supervised learning problems. Assuming the availability of sufficient data, these methods infer dictionaries for sparse representations by optimizing for high-fidelity reconstruction. In most scenarios, the reconstruction quality is measured using the squared Euclidean distance, and efficient algorithms have been develope"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6706","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-18T02:55:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mY+z6MeDhmozCe7YfWP+kIkjQayTBISctrXrAX42YUGj4D7NDJ3xgaX2qFf+l7cKIZROOA+6yZJW/W4kaZrWDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:23:23.236692Z"},"content_sha256":"5a89fd3448ae5a19d4c24deaa6dde72d3517512a58c1cc841ba7f6f943971d23","schema_version":"1.0","event_id":"sha256:5a89fd3448ae5a19d4c24deaa6dde72d3517512a58c1cc841ba7f6f943971d23"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7Y6CDHV37PAD4EIHYILIEV7ZCX/bundle.json","state_url":"https://pith.science/pith/7Y6CDHV37PAD4EIHYILIEV7ZCX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7Y6CDHV37PAD4EIHYILIEV7ZCX/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-03T08:23:23Z","links":{"resolver":"https://pith.science/pith/7Y6CDHV37PAD4EIHYILIEV7ZCX","bundle":"https://pith.science/pith/7Y6CDHV37PAD4EIHYILIEV7ZCX/bundle.json","state":"https://pith.science/pith/7Y6CDHV37PAD4EIHYILIEV7ZCX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7Y6CDHV37PAD4EIHYILIEV7ZCX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7Y6CDHV37PAD4EIHYILIEV7ZCX","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":"0dc8f46d81365568673bf88964d96c07ea8b3cf5ba185d900e1c5909da224e2f","cross_cats_sorted":["cs.CV","cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-03-26T15:16:56Z","title_canon_sha256":"a4d1ed287677c14abc5db21d341bad1c3c81089ff726fd9f7f6f4d11cd5542e0"},"schema_version":"1.0","source":{"id":"1403.6706","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.6706","created_at":"2026-05-18T02:55:28Z"},{"alias_kind":"arxiv_version","alias_value":"1403.6706v1","created_at":"2026-05-18T02:55:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6706","created_at":"2026-05-18T02:55:28Z"},{"alias_kind":"pith_short_12","alias_value":"7Y6CDHV37PAD","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7Y6CDHV37PAD4EIH","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7Y6CDHV3","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:5a89fd3448ae5a19d4c24deaa6dde72d3517512a58c1cc841ba7f6f943971d23","target":"graph","created_at":"2026-05-18T02:55:28Z","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":"Incorporating sparsity priors in learning tasks can give rise to simple, and interpretable models for complex high dimensional data. Sparse models have found widespread use in structure discovery, recovering data from corruptions, and a variety of large scale unsupervised and supervised learning problems. Assuming the availability of sufficient data, these methods infer dictionaries for sparse representations by optimizing for high-fidelity reconstruction. In most scenarios, the reconstruction quality is measured using the squared Euclidean distance, and efficient algorithms have been develope","authors_text":"Aleksandr Y. Aravkin, Jayaraman J. Thiagarajan, Karthikeyan Natesan Ramamurthy","cross_cats":["cs.CV","cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-03-26T15:16:56Z","title":"Beyond L2-Loss Functions for Learning Sparse Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6706","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:ae2db48f48dad311611f8dbd30c31c8c621139ff7ca8f3b0f41074a7fa5f476c","target":"record","created_at":"2026-05-18T02:55:28Z","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":"0dc8f46d81365568673bf88964d96c07ea8b3cf5ba185d900e1c5909da224e2f","cross_cats_sorted":["cs.CV","cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-03-26T15:16:56Z","title_canon_sha256":"a4d1ed287677c14abc5db21d341bad1c3c81089ff726fd9f7f6f4d11cd5542e0"},"schema_version":"1.0","source":{"id":"1403.6706","kind":"arxiv","version":1}},"canonical_sha256":"fe3c219ebbfbc03e1107c2168257f915d14b7d8ce042e82d121c65038f68e6f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe3c219ebbfbc03e1107c2168257f915d14b7d8ce042e82d121c65038f68e6f1","first_computed_at":"2026-05-18T02:55:28.212377Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:28.212377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dRfLg+zKS4hLIvmLS78qHIjv05b4CLsJfhqkazxQE4ej+TE2eUp73gJzNlNHiSkkcSJ3DOEsLfmTpmrp+bqqAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:28.212844Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.6706","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae2db48f48dad311611f8dbd30c31c8c621139ff7ca8f3b0f41074a7fa5f476c","sha256:5a89fd3448ae5a19d4c24deaa6dde72d3517512a58c1cc841ba7f6f943971d23"],"state_sha256":"2c01bbb855304fb2ee2b31446430df7fadb0fbd486cdd57d97d77563d64e7468"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+d1MtdI0p33UPbj+HWaM8oJEdzaeIR/FVLjfbFSPRtNHAjZbCODKa2VcxS8IuTZ9Kva8Jvz5j3RyCAlObCOgCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T08:23:23.238653Z","bundle_sha256":"784cbc3901ad3afdd4c16566dd9b69741ac96e5fc8a26966847e5e48f4bf0331"}}