{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:AE7O6TN6VJG43B7W3KXERCYYNK","short_pith_number":"pith:AE7O6TN6","canonical_record":{"source":{"id":"1212.3631","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-14T22:50:44Z","cross_cats_sorted":[],"title_canon_sha256":"536ea5979d192cf152c407c94b7db2c6f24f0997931caad86243a5aa06aa5106","abstract_canon_sha256":"59b831f8dfc9f4d95b18364f56a0c578fb049ce61108fb490c8eb7cdeec17c34"},"schema_version":"1.0"},"canonical_sha256":"013eef4dbeaa4dcd87f6daae488b186aa1a5d4e8a2e83be9ea6a39171357f447","source":{"kind":"arxiv","id":"1212.3631","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.3631","created_at":"2026-05-18T03:38:22Z"},{"alias_kind":"arxiv_version","alias_value":"1212.3631v1","created_at":"2026-05-18T03:38:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3631","created_at":"2026-05-18T03:38:22Z"},{"alias_kind":"pith_short_12","alias_value":"AE7O6TN6VJG4","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AE7O6TN6VJG43B7W","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AE7O6TN6","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:AE7O6TN6VJG43B7W3KXERCYYNK","target":"record","payload":{"canonical_record":{"source":{"id":"1212.3631","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-14T22:50:44Z","cross_cats_sorted":[],"title_canon_sha256":"536ea5979d192cf152c407c94b7db2c6f24f0997931caad86243a5aa06aa5106","abstract_canon_sha256":"59b831f8dfc9f4d95b18364f56a0c578fb049ce61108fb490c8eb7cdeec17c34"},"schema_version":"1.0"},"canonical_sha256":"013eef4dbeaa4dcd87f6daae488b186aa1a5d4e8a2e83be9ea6a39171357f447","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:22.790518Z","signature_b64":"NvLbiLgFQfJPNYzc2L4I6NiPru3AybkMrYkiRHDvFkdn6GB1C9Zcy851hOcTyhYM2Dm3YqCftFgnahqDWdXDAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"013eef4dbeaa4dcd87f6daae488b186aa1a5d4e8a2e83be9ea6a39171357f447","last_reissued_at":"2026-05-18T03:38:22.790113Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:22.790113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.3631","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:38:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9wz6dtfeN2moBa3I3exkyHbBA+mxWpbht3rJ92HTBclE+Y3hJ7fi74pO8D2fTeaZjGMZs51yD7smi+YO4MxpCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:01:12.052053Z"},"content_sha256":"497a63b8ecacb7cd50d3684be3f466bdb811b4c3431ddd90f12d651b17bd2080","schema_version":"1.0","event_id":"sha256:497a63b8ecacb7cd50d3684be3f466bdb811b4c3431ddd90f12d651b17bd2080"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:AE7O6TN6VJG43B7W3KXERCYYNK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning efficient sparse and low rank models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alex M. Bronstein, Guillermo Sapiro, Pablo Sprechmann","submitted_at":"2012-12-14T22:50:44Z","abstract_excerpt":"Parsimony, including sparsity and low rank, has been shown to successfully model data in numerous machine learning and signal processing tasks. Traditionally, such modeling approaches rely on an iterative algorithm that minimizes an objective function with parsimony-promoting terms. The inherently sequential structure and data-dependent complexity and latency of iterative optimization constitute a major limitation in many applications requiring real-time performance or involving large-scale data. Another limitation encountered by these modeling techniques is the difficulty of their inclusion i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3631","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:38:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tQAS6rz2lt134ppcms2JM3RV3KiFSFRCaXIQ1uXz07V5N2Cd/+0UHu5rucnHWXLU9ZQ+Cdz4ciJPUIP+iJaKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:01:12.052552Z"},"content_sha256":"43b309e91c990c27578996c34a54cdebcb8a798d4cefaf2d8a32fa71c4059d76","schema_version":"1.0","event_id":"sha256:43b309e91c990c27578996c34a54cdebcb8a798d4cefaf2d8a32fa71c4059d76"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AE7O6TN6VJG43B7W3KXERCYYNK/bundle.json","state_url":"https://pith.science/pith/AE7O6TN6VJG43B7W3KXERCYYNK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AE7O6TN6VJG43B7W3KXERCYYNK/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-29T15:01:12Z","links":{"resolver":"https://pith.science/pith/AE7O6TN6VJG43B7W3KXERCYYNK","bundle":"https://pith.science/pith/AE7O6TN6VJG43B7W3KXERCYYNK/bundle.json","state":"https://pith.science/pith/AE7O6TN6VJG43B7W3KXERCYYNK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AE7O6TN6VJG43B7W3KXERCYYNK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:AE7O6TN6VJG43B7W3KXERCYYNK","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":"59b831f8dfc9f4d95b18364f56a0c578fb049ce61108fb490c8eb7cdeec17c34","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-14T22:50:44Z","title_canon_sha256":"536ea5979d192cf152c407c94b7db2c6f24f0997931caad86243a5aa06aa5106"},"schema_version":"1.0","source":{"id":"1212.3631","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.3631","created_at":"2026-05-18T03:38:22Z"},{"alias_kind":"arxiv_version","alias_value":"1212.3631v1","created_at":"2026-05-18T03:38:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3631","created_at":"2026-05-18T03:38:22Z"},{"alias_kind":"pith_short_12","alias_value":"AE7O6TN6VJG4","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AE7O6TN6VJG43B7W","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AE7O6TN6","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:43b309e91c990c27578996c34a54cdebcb8a798d4cefaf2d8a32fa71c4059d76","target":"graph","created_at":"2026-05-18T03:38:22Z","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":"Parsimony, including sparsity and low rank, has been shown to successfully model data in numerous machine learning and signal processing tasks. Traditionally, such modeling approaches rely on an iterative algorithm that minimizes an objective function with parsimony-promoting terms. The inherently sequential structure and data-dependent complexity and latency of iterative optimization constitute a major limitation in many applications requiring real-time performance or involving large-scale data. Another limitation encountered by these modeling techniques is the difficulty of their inclusion i","authors_text":"Alex M. Bronstein, Guillermo Sapiro, Pablo Sprechmann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-14T22:50:44Z","title":"Learning efficient sparse and low rank models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3631","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:497a63b8ecacb7cd50d3684be3f466bdb811b4c3431ddd90f12d651b17bd2080","target":"record","created_at":"2026-05-18T03:38:22Z","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":"59b831f8dfc9f4d95b18364f56a0c578fb049ce61108fb490c8eb7cdeec17c34","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-14T22:50:44Z","title_canon_sha256":"536ea5979d192cf152c407c94b7db2c6f24f0997931caad86243a5aa06aa5106"},"schema_version":"1.0","source":{"id":"1212.3631","kind":"arxiv","version":1}},"canonical_sha256":"013eef4dbeaa4dcd87f6daae488b186aa1a5d4e8a2e83be9ea6a39171357f447","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"013eef4dbeaa4dcd87f6daae488b186aa1a5d4e8a2e83be9ea6a39171357f447","first_computed_at":"2026-05-18T03:38:22.790113Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:38:22.790113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NvLbiLgFQfJPNYzc2L4I6NiPru3AybkMrYkiRHDvFkdn6GB1C9Zcy851hOcTyhYM2Dm3YqCftFgnahqDWdXDAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:38:22.790518Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.3631","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:497a63b8ecacb7cd50d3684be3f466bdb811b4c3431ddd90f12d651b17bd2080","sha256:43b309e91c990c27578996c34a54cdebcb8a798d4cefaf2d8a32fa71c4059d76"],"state_sha256":"65d1d2a5e26cc27896254630d77d01bd15922a7b963951658d52385ed909c925"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NNo9Im16PJTS+KQvQfsAx10fuV7aK8Tn4YAS3THUq3jBRkYlRi7bMqf0/bP/FT/D+x+XGS6gSOHpbZqdV4TFBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:01:12.056127Z","bundle_sha256":"190fb239a9ce897c70a324738d0871b044ce7b59cbbd65a7be823891246f74b4"}}