{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2YE4XEZNUYJ5X4LTPJNZ5JTFBA","short_pith_number":"pith:2YE4XEZN","canonical_record":{"source":{"id":"1707.08316","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-26T08:23:04Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"921f493b146de4020d9c588a9be83a6f3d92de46ec9819deca537375d4bcb32c","abstract_canon_sha256":"748c3ce7b8c72251ffacaaab7b4746af0657ea7131516cc83a8be6ff93539e44"},"schema_version":"1.0"},"canonical_sha256":"d609cb932da613dbf1737a5b9ea6650803e4ff883e7a9bad9d34f27a7686734c","source":{"kind":"arxiv","id":"1707.08316","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08316","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08316v1","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08316","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"pith_short_12","alias_value":"2YE4XEZNUYJ5","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2YE4XEZNUYJ5X4LT","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2YE4XEZN","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2YE4XEZNUYJ5X4LTPJNZ5JTFBA","target":"record","payload":{"canonical_record":{"source":{"id":"1707.08316","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-26T08:23:04Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"921f493b146de4020d9c588a9be83a6f3d92de46ec9819deca537375d4bcb32c","abstract_canon_sha256":"748c3ce7b8c72251ffacaaab7b4746af0657ea7131516cc83a8be6ff93539e44"},"schema_version":"1.0"},"canonical_sha256":"d609cb932da613dbf1737a5b9ea6650803e4ff883e7a9bad9d34f27a7686734c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:24.627812Z","signature_b64":"LulAi+qRlFul4+/Pnw0UFpc8tMAETkCF0CKqQFHhcG/3LtNNEvHWWUr26+mg6x3lreyXYwU1tXZgr+fOFhDjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d609cb932da613dbf1737a5b9ea6650803e4ff883e7a9bad9d34f27a7686734c","last_reissued_at":"2026-05-18T00:39:24.627327Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:24.627327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.08316","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-18T00:39:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oo2aY6GOI5ZQV6oYU+6nBHUl/AkSNFdvMJmyZS7JgRgiLOZ18FmFGtQ8RjNOPWHmBIjt/5AMJQMJ2/7bYl4CDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:06:51.190915Z"},"content_sha256":"615e8bcb2ab7621af10609481ae9be7f13c5f3e0ec9471bc53a45dfe02201e44","schema_version":"1.0","event_id":"sha256:615e8bcb2ab7621af10609481ae9be7f13c5f3e0ec9471bc53a45dfe02201e44"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2YE4XEZNUYJ5X4LTPJNZ5JTFBA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Sparse Representations in Reinforcement Learning with Sparse Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Lei Le, Martha White, Raksha Kumaraswamy","submitted_at":"2017-07-26T08:23:04Z","abstract_excerpt":"A variety of representation learning approaches have been investigated for reinforcement learning; much less attention, however, has been given to investigating the utility of sparse coding. Outside of reinforcement learning, sparse coding representations have been widely used, with non-convex objectives that result in discriminative representations. In this work, we develop a supervised sparse coding objective for policy evaluation. Despite the non-convexity of this objective, we prove that all local minima are global minima, making the approach amenable to simple optimization strategies. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08316","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-18T00:39:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dAj/EHbLddOfXb4WMqfnIMUdIf/0f6WtyqK3rZQqc6GIKY5ZXyVEBMZMAu8HqTqxvN9P+oBs66bQNINyZVTUBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:06:51.191295Z"},"content_sha256":"2dffa9337f016373444cd7dc3379c40b6198d3920b111283f371f17b1222410a","schema_version":"1.0","event_id":"sha256:2dffa9337f016373444cd7dc3379c40b6198d3920b111283f371f17b1222410a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2YE4XEZNUYJ5X4LTPJNZ5JTFBA/bundle.json","state_url":"https://pith.science/pith/2YE4XEZNUYJ5X4LTPJNZ5JTFBA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2YE4XEZNUYJ5X4LTPJNZ5JTFBA/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-30T18:06:51Z","links":{"resolver":"https://pith.science/pith/2YE4XEZNUYJ5X4LTPJNZ5JTFBA","bundle":"https://pith.science/pith/2YE4XEZNUYJ5X4LTPJNZ5JTFBA/bundle.json","state":"https://pith.science/pith/2YE4XEZNUYJ5X4LTPJNZ5JTFBA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2YE4XEZNUYJ5X4LTPJNZ5JTFBA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2YE4XEZNUYJ5X4LTPJNZ5JTFBA","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":"748c3ce7b8c72251ffacaaab7b4746af0657ea7131516cc83a8be6ff93539e44","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-26T08:23:04Z","title_canon_sha256":"921f493b146de4020d9c588a9be83a6f3d92de46ec9819deca537375d4bcb32c"},"schema_version":"1.0","source":{"id":"1707.08316","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08316","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08316v1","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08316","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"pith_short_12","alias_value":"2YE4XEZNUYJ5","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2YE4XEZNUYJ5X4LT","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2YE4XEZN","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:2dffa9337f016373444cd7dc3379c40b6198d3920b111283f371f17b1222410a","target":"graph","created_at":"2026-05-18T00:39:24Z","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":"A variety of representation learning approaches have been investigated for reinforcement learning; much less attention, however, has been given to investigating the utility of sparse coding. Outside of reinforcement learning, sparse coding representations have been widely used, with non-convex objectives that result in discriminative representations. In this work, we develop a supervised sparse coding objective for policy evaluation. Despite the non-convexity of this objective, we prove that all local minima are global minima, making the approach amenable to simple optimization strategies. We ","authors_text":"Lei Le, Martha White, Raksha Kumaraswamy","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-26T08:23:04Z","title":"Learning Sparse Representations in Reinforcement Learning with Sparse Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08316","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:615e8bcb2ab7621af10609481ae9be7f13c5f3e0ec9471bc53a45dfe02201e44","target":"record","created_at":"2026-05-18T00:39:24Z","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":"748c3ce7b8c72251ffacaaab7b4746af0657ea7131516cc83a8be6ff93539e44","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-26T08:23:04Z","title_canon_sha256":"921f493b146de4020d9c588a9be83a6f3d92de46ec9819deca537375d4bcb32c"},"schema_version":"1.0","source":{"id":"1707.08316","kind":"arxiv","version":1}},"canonical_sha256":"d609cb932da613dbf1737a5b9ea6650803e4ff883e7a9bad9d34f27a7686734c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d609cb932da613dbf1737a5b9ea6650803e4ff883e7a9bad9d34f27a7686734c","first_computed_at":"2026-05-18T00:39:24.627327Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:24.627327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LulAi+qRlFul4+/Pnw0UFpc8tMAETkCF0CKqQFHhcG/3LtNNEvHWWUr26+mg6x3lreyXYwU1tXZgr+fOFhDjDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:24.627812Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.08316","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:615e8bcb2ab7621af10609481ae9be7f13c5f3e0ec9471bc53a45dfe02201e44","sha256:2dffa9337f016373444cd7dc3379c40b6198d3920b111283f371f17b1222410a"],"state_sha256":"e16d3c387a0ec3285cea51d24e65cc05d2ccf8302bfa232d3e6836b0fad1d5aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ApsDjyIX65jUKwo/z9YVcyiUkdjlBuvpVYn5L4bhmI8LwXSvq/GLjk1GrnSOrlTFE87TLBAz1A3Y9oS4CUEAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T18:06:51.194603Z","bundle_sha256":"6cad833680896b73ce016badf7b04c92426c571ba6493d14eedc9e764b141e16"}}