{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:L6YF5QKHPQJQP2BLRHZ4NOGSNW","short_pith_number":"pith:L6YF5QKH","canonical_record":{"source":{"id":"1208.3687","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-08-17T20:38:56Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"be2f5a3fa1bce4ee80a6df0a00d507a8a887752a896564fda7ac3321dcdd2766","abstract_canon_sha256":"f6f34dd11edc5b37d35b4fe0355d8149436f0fe6c21ecfb84b958c9335056fbd"},"schema_version":"1.0"},"canonical_sha256":"5fb05ec1477c1307e82b89f3c6b8d26d8670df0d6a43399fbe29d64c5de16806","source":{"kind":"arxiv","id":"1208.3687","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.3687","created_at":"2026-05-18T02:21:01Z"},{"alias_kind":"arxiv_version","alias_value":"1208.3687v1","created_at":"2026-05-18T02:21:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3687","created_at":"2026-05-18T02:21:01Z"},{"alias_kind":"pith_short_12","alias_value":"L6YF5QKHPQJQ","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"L6YF5QKHPQJQP2BL","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"L6YF5QKH","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:L6YF5QKHPQJQP2BLRHZ4NOGSNW","target":"record","payload":{"canonical_record":{"source":{"id":"1208.3687","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-08-17T20:38:56Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"be2f5a3fa1bce4ee80a6df0a00d507a8a887752a896564fda7ac3321dcdd2766","abstract_canon_sha256":"f6f34dd11edc5b37d35b4fe0355d8149436f0fe6c21ecfb84b958c9335056fbd"},"schema_version":"1.0"},"canonical_sha256":"5fb05ec1477c1307e82b89f3c6b8d26d8670df0d6a43399fbe29d64c5de16806","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:01.015580Z","signature_b64":"jCXtMLVcCf5B0tloPwVOrveVqauRYv6hr5bfvr4a2ccNxsF3Zy2wdMAIBlX0kSmGETJsQHnVx0o12Bk22k50DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fb05ec1477c1307e82b89f3c6b8d26d8670df0d6a43399fbe29d64c5de16806","last_reissued_at":"2026-05-18T02:21:01.014953Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:01.014953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.3687","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:21:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eVzlSgfoUDLGU20Rmzd9Cv9GDwHqCosanlX2xKWY3prbzAOHmqxwfXjdySXcJGLOjQwU0dADKyJVxA8g7qzkBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:06:07.730793Z"},"content_sha256":"878fe7b130d4c81895cc00166e6dd3b7177c7d13b964f008d0de03e29a6ed167","schema_version":"1.0","event_id":"sha256:878fe7b130d4c81895cc00166e6dd3b7177c7d13b964f008d0de03e29a6ed167"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:L6YF5QKHPQJQP2BLRHZ4NOGSNW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information-theoretic Dictionary Learning for Image Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.CV","authors_text":"Qiang Qiu, Rama Chellappa, Vishal M. Patel","submitted_at":"2012-08-17T20:38:56Z","abstract_excerpt":"We present a two-stage approach for learning dictionaries for object classification tasks based on the principle of information maximization. The proposed method seeks a dictionary that is compact, discriminative, and generative. In the first stage, dictionary atoms are selected from an initial dictionary by maximizing the mutual information measure on dictionary compactness, discrimination and reconstruction. In the second stage, the selected dictionary atoms are updated for improved reconstructive and discriminative power using a simple gradient ascent algorithm on mutual information. Experi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3687","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:21:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QHqQRv2eWJb7BmNjKF6HMwlSaKUXtv7ZNryD47JcNel0OBhsldvs1DfptzQInQ1TeL/nQ+gL5OWD44+J8M5VAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:06:07.731142Z"},"content_sha256":"01af1ad1173132a9ed6e7aed6777e64da8fd0f574f3143909628f53a4df2e736","schema_version":"1.0","event_id":"sha256:01af1ad1173132a9ed6e7aed6777e64da8fd0f574f3143909628f53a4df2e736"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L6YF5QKHPQJQP2BLRHZ4NOGSNW/bundle.json","state_url":"https://pith.science/pith/L6YF5QKHPQJQP2BLRHZ4NOGSNW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L6YF5QKHPQJQP2BLRHZ4NOGSNW/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-03T00:06:07Z","links":{"resolver":"https://pith.science/pith/L6YF5QKHPQJQP2BLRHZ4NOGSNW","bundle":"https://pith.science/pith/L6YF5QKHPQJQP2BLRHZ4NOGSNW/bundle.json","state":"https://pith.science/pith/L6YF5QKHPQJQP2BLRHZ4NOGSNW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L6YF5QKHPQJQP2BLRHZ4NOGSNW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:L6YF5QKHPQJQP2BLRHZ4NOGSNW","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":"f6f34dd11edc5b37d35b4fe0355d8149436f0fe6c21ecfb84b958c9335056fbd","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-08-17T20:38:56Z","title_canon_sha256":"be2f5a3fa1bce4ee80a6df0a00d507a8a887752a896564fda7ac3321dcdd2766"},"schema_version":"1.0","source":{"id":"1208.3687","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.3687","created_at":"2026-05-18T02:21:01Z"},{"alias_kind":"arxiv_version","alias_value":"1208.3687v1","created_at":"2026-05-18T02:21:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3687","created_at":"2026-05-18T02:21:01Z"},{"alias_kind":"pith_short_12","alias_value":"L6YF5QKHPQJQ","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"L6YF5QKHPQJQP2BL","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"L6YF5QKH","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:01af1ad1173132a9ed6e7aed6777e64da8fd0f574f3143909628f53a4df2e736","target":"graph","created_at":"2026-05-18T02:21:01Z","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 present a two-stage approach for learning dictionaries for object classification tasks based on the principle of information maximization. The proposed method seeks a dictionary that is compact, discriminative, and generative. In the first stage, dictionary atoms are selected from an initial dictionary by maximizing the mutual information measure on dictionary compactness, discrimination and reconstruction. In the second stage, the selected dictionary atoms are updated for improved reconstructive and discriminative power using a simple gradient ascent algorithm on mutual information. Experi","authors_text":"Qiang Qiu, Rama Chellappa, Vishal M. Patel","cross_cats":["cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-08-17T20:38:56Z","title":"Information-theoretic Dictionary Learning for Image Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3687","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:878fe7b130d4c81895cc00166e6dd3b7177c7d13b964f008d0de03e29a6ed167","target":"record","created_at":"2026-05-18T02:21:01Z","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":"f6f34dd11edc5b37d35b4fe0355d8149436f0fe6c21ecfb84b958c9335056fbd","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-08-17T20:38:56Z","title_canon_sha256":"be2f5a3fa1bce4ee80a6df0a00d507a8a887752a896564fda7ac3321dcdd2766"},"schema_version":"1.0","source":{"id":"1208.3687","kind":"arxiv","version":1}},"canonical_sha256":"5fb05ec1477c1307e82b89f3c6b8d26d8670df0d6a43399fbe29d64c5de16806","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fb05ec1477c1307e82b89f3c6b8d26d8670df0d6a43399fbe29d64c5de16806","first_computed_at":"2026-05-18T02:21:01.014953Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:01.014953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jCXtMLVcCf5B0tloPwVOrveVqauRYv6hr5bfvr4a2ccNxsF3Zy2wdMAIBlX0kSmGETJsQHnVx0o12Bk22k50DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:01.015580Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.3687","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:878fe7b130d4c81895cc00166e6dd3b7177c7d13b964f008d0de03e29a6ed167","sha256:01af1ad1173132a9ed6e7aed6777e64da8fd0f574f3143909628f53a4df2e736"],"state_sha256":"f6b0ad133177437a268ef322e5641d1d49d794e7f8e950624027eaa2840db737"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c4OJAx55+Xnmnu8L5LmuK5s2Q6eDcpmHZtPVTJLp3tldiZvRAR3GQVZDD478c7mb8Uyb9MkRKhdNIiALJU6PAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T00:06:07.733072Z","bundle_sha256":"f5e0df1140f00865363fb270489398d92a3295b847ab4f088173d0b4d04ff05c"}}