{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:PAMON3KBB6IC6L5IAQPOSZWDJ3","short_pith_number":"pith:PAMON3KB","canonical_record":{"source":{"id":"1011.3728","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-11-16T15:31:25Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"4e39c308693d388eedc61a74be77cb8fe3d1a2ff9fb0d98f3771e55d9f95bc3c","abstract_canon_sha256":"692247cc230579ad11172fd7d1939d5803084533005b3f034f334bc87a3a4f1f"},"schema_version":"1.0"},"canonical_sha256":"7818e6ed410f902f2fa8041ee966c34ef6ac813efc229f14e3e3d43837be9858","source":{"kind":"arxiv","id":"1011.3728","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.3728","created_at":"2026-05-18T04:35:48Z"},{"alias_kind":"arxiv_version","alias_value":"1011.3728v1","created_at":"2026-05-18T04:35:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3728","created_at":"2026-05-18T04:35:48Z"},{"alias_kind":"pith_short_12","alias_value":"PAMON3KBB6IC","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"PAMON3KBB6IC6L5I","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"PAMON3KB","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:PAMON3KBB6IC6L5IAQPOSZWDJ3","target":"record","payload":{"canonical_record":{"source":{"id":"1011.3728","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-11-16T15:31:25Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"4e39c308693d388eedc61a74be77cb8fe3d1a2ff9fb0d98f3771e55d9f95bc3c","abstract_canon_sha256":"692247cc230579ad11172fd7d1939d5803084533005b3f034f334bc87a3a4f1f"},"schema_version":"1.0"},"canonical_sha256":"7818e6ed410f902f2fa8041ee966c34ef6ac813efc229f14e3e3d43837be9858","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:35:48.202899Z","signature_b64":"pgxIYOn+k8wmyL88BhEePHAaDHv1mt7H++Yf8ihynf9Qch806wxyHxHhi2tq3a1TD7s7eT7Fnx5VF7fPCvt0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7818e6ed410f902f2fa8041ee966c34ef6ac813efc229f14e3e3d43837be9858","last_reissued_at":"2026-05-18T04:35:48.202257Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:35:48.202257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.3728","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-18T04:35:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b01gslB5EUyetS/SYhaqY6FzMz9rkhORho2EJK9oHy0iz+PZQx0AdJXnlqobuOk5UWFku6I45QTcuIOZjHojCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:44:22.831603Z"},"content_sha256":"bdbe0ecb3b486d94c4c999b46ed5982fc2bba597d0912ae2045576158566cc20","schema_version":"1.0","event_id":"sha256:bdbe0ecb3b486d94c4c999b46ed5982fc2bba597d0912ae2045576158566cc20"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:PAMON3KBB6IC6L5IAQPOSZWDJ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PADDLE: Proximal Algorithm for Dual Dictionaries LEarning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alessandro Verri, Curzio Basso, Matteo Santoro, Silvia Villa","submitted_at":"2010-11-16T15:31:25Z","abstract_excerpt":"Recently, considerable research efforts have been devoted to the design of methods to learn from data overcomplete dictionaries for sparse coding. However, learned dictionaries require the solution of an optimization problem for coding new data. In order to overcome this drawback, we propose an algorithm aimed at learning both a dictionary and its dual: a linear mapping directly performing the coding. By leveraging on proximal methods, our algorithm jointly minimizes the reconstruction error of the dictionary and the coding error of its dual; the sparsity of the representation is induced by an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3728","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-18T04:35:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J9hib5Wh+JbTWBa44auQdVN/C2ocZWP0cJfAw9+Y186/vee6dL3Q6q2Yn3iNUXLkb7xy3hBBRaWWS7U+6bDfBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:44:22.832265Z"},"content_sha256":"1916930ec3a2475e34f1f1aff286fcfd484a71a42ec3ad9b1fc588da4f2397ef","schema_version":"1.0","event_id":"sha256:1916930ec3a2475e34f1f1aff286fcfd484a71a42ec3ad9b1fc588da4f2397ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PAMON3KBB6IC6L5IAQPOSZWDJ3/bundle.json","state_url":"https://pith.science/pith/PAMON3KBB6IC6L5IAQPOSZWDJ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PAMON3KBB6IC6L5IAQPOSZWDJ3/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-25T13:44:22Z","links":{"resolver":"https://pith.science/pith/PAMON3KBB6IC6L5IAQPOSZWDJ3","bundle":"https://pith.science/pith/PAMON3KBB6IC6L5IAQPOSZWDJ3/bundle.json","state":"https://pith.science/pith/PAMON3KBB6IC6L5IAQPOSZWDJ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PAMON3KBB6IC6L5IAQPOSZWDJ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:PAMON3KBB6IC6L5IAQPOSZWDJ3","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":"692247cc230579ad11172fd7d1939d5803084533005b3f034f334bc87a3a4f1f","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-11-16T15:31:25Z","title_canon_sha256":"4e39c308693d388eedc61a74be77cb8fe3d1a2ff9fb0d98f3771e55d9f95bc3c"},"schema_version":"1.0","source":{"id":"1011.3728","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.3728","created_at":"2026-05-18T04:35:48Z"},{"alias_kind":"arxiv_version","alias_value":"1011.3728v1","created_at":"2026-05-18T04:35:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3728","created_at":"2026-05-18T04:35:48Z"},{"alias_kind":"pith_short_12","alias_value":"PAMON3KBB6IC","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"PAMON3KBB6IC6L5I","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"PAMON3KB","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:1916930ec3a2475e34f1f1aff286fcfd484a71a42ec3ad9b1fc588da4f2397ef","target":"graph","created_at":"2026-05-18T04:35:48Z","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":"Recently, considerable research efforts have been devoted to the design of methods to learn from data overcomplete dictionaries for sparse coding. However, learned dictionaries require the solution of an optimization problem for coding new data. In order to overcome this drawback, we propose an algorithm aimed at learning both a dictionary and its dual: a linear mapping directly performing the coding. By leveraging on proximal methods, our algorithm jointly minimizes the reconstruction error of the dictionary and the coding error of its dual; the sparsity of the representation is induced by an","authors_text":"Alessandro Verri, Curzio Basso, Matteo Santoro, Silvia Villa","cross_cats":["cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-11-16T15:31:25Z","title":"PADDLE: Proximal Algorithm for Dual Dictionaries LEarning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3728","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:bdbe0ecb3b486d94c4c999b46ed5982fc2bba597d0912ae2045576158566cc20","target":"record","created_at":"2026-05-18T04:35:48Z","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":"692247cc230579ad11172fd7d1939d5803084533005b3f034f334bc87a3a4f1f","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-11-16T15:31:25Z","title_canon_sha256":"4e39c308693d388eedc61a74be77cb8fe3d1a2ff9fb0d98f3771e55d9f95bc3c"},"schema_version":"1.0","source":{"id":"1011.3728","kind":"arxiv","version":1}},"canonical_sha256":"7818e6ed410f902f2fa8041ee966c34ef6ac813efc229f14e3e3d43837be9858","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7818e6ed410f902f2fa8041ee966c34ef6ac813efc229f14e3e3d43837be9858","first_computed_at":"2026-05-18T04:35:48.202257Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:35:48.202257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pgxIYOn+k8wmyL88BhEePHAaDHv1mt7H++Yf8ihynf9Qch806wxyHxHhi2tq3a1TD7s7eT7Fnx5VF7fPCvt0BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:35:48.202899Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.3728","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bdbe0ecb3b486d94c4c999b46ed5982fc2bba597d0912ae2045576158566cc20","sha256:1916930ec3a2475e34f1f1aff286fcfd484a71a42ec3ad9b1fc588da4f2397ef"],"state_sha256":"e3c24aea31f5818dd36539a6020dcdef7bac9701c6f2afad1cd28969fc4040f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JUwVGa+Iaes6C6JxLayiNIpwadrhP96tHMBJeGYbtdO1L6fu8fD1HsaPsmTh6fySNmMcHXCTCWUf5iOQkoWNCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T13:44:22.835991Z","bundle_sha256":"14ef4a059e4a8e9134fa077200a3070149378c7e56e20546ad5a1bceecdccec0"}}