{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:63O3O4BPZDFJIGYP2LRG56PYMN","short_pith_number":"pith:63O3O4BP","canonical_record":{"source":{"id":"1206.6485","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8371e3451465767108a888f48d0d4e3960b389bcc18bd8de8fa436f1927984ef","abstract_canon_sha256":"c9173fe3df57eaef755f853e2146482144838de8d1ee2d011b5145d69f233e03"},"schema_version":"1.0"},"canonical_sha256":"f6ddb7702fc8ca941b0fd2e26ef9f8634c0bcbded5d577f7458a3ce309dbf00b","source":{"kind":"arxiv","id":"1206.6485","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6485","created_at":"2026-05-18T03:52:13Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6485v1","created_at":"2026-05-18T03:52:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6485","created_at":"2026-05-18T03:52:13Z"},{"alias_kind":"pith_short_12","alias_value":"63O3O4BPZDFJ","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"63O3O4BPZDFJIGYP","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"63O3O4BP","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:63O3O4BPZDFJIGYP2LRG56PYMN","target":"record","payload":{"canonical_record":{"source":{"id":"1206.6485","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8371e3451465767108a888f48d0d4e3960b389bcc18bd8de8fa436f1927984ef","abstract_canon_sha256":"c9173fe3df57eaef755f853e2146482144838de8d1ee2d011b5145d69f233e03"},"schema_version":"1.0"},"canonical_sha256":"f6ddb7702fc8ca941b0fd2e26ef9f8634c0bcbded5d577f7458a3ce309dbf00b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:13.683725Z","signature_b64":"4ExoniyAYvLkm3RW+qRIgwLEyfWn+UxexHnMsHb2t4xiQlEMOaHItlGlkI02z0qZVxW9nY1XU5chOLVUXBBGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6ddb7702fc8ca941b0fd2e26ef9f8634c0bcbded5d577f7458a3ce309dbf00b","last_reissued_at":"2026-05-18T03:52:13.682920Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:13.682920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.6485","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:52:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dBqh679R4b3RCbkMiGc6YlL7wvnxYKk9P9a6FPcJaA09u6YkKtU0qgNEEX30RgCkNjwhifxBTUjNM9NFlac7DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:28:53.023902Z"},"content_sha256":"ef271c78425ff758b9977ea027c3f8f6eded62c268359c0c84fb0eb002683ddd","schema_version":"1.0","event_id":"sha256:ef271c78425ff758b9977ea027c3f8f6eded62c268359c0c84fb0eb002683ddd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:63O3O4BPZDFJIGYP2LRG56PYMN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Greedy Algorithms for Sparse Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Christopher Painter-Wakefield (Duke University), Ronald Parr (Duke University)","submitted_at":"2012-06-27T19:59:59Z","abstract_excerpt":"Feature selection and regularization are becoming increasingly prominent tools in the efforts of the reinforcement learning (RL) community to expand the reach and applicability of RL. One approach to the problem of feature selection is to impose a sparsity-inducing form of regularization on the learning method. Recent work on $L_1$ regularization has adapted techniques from the supervised learning literature for use with RL. Another approach that has received renewed attention in the supervised learning community is that of using a simple algorithm that greedily adds new features. Such algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6485","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:52:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QsFWLLjn4WpfEwOclQfo5tyQAS63oUnDp8Z7ISgCtLFyb4IHo5MCzP2M1/ObG6+O34aR44T9Rm8mIniP48hgDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:28:53.024262Z"},"content_sha256":"ae5dc879819e149079f15f24c1ecee1bd0ce4343644f2ab9e41836e2e43c724c","schema_version":"1.0","event_id":"sha256:ae5dc879819e149079f15f24c1ecee1bd0ce4343644f2ab9e41836e2e43c724c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/63O3O4BPZDFJIGYP2LRG56PYMN/bundle.json","state_url":"https://pith.science/pith/63O3O4BPZDFJIGYP2LRG56PYMN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/63O3O4BPZDFJIGYP2LRG56PYMN/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-05T08:28:53Z","links":{"resolver":"https://pith.science/pith/63O3O4BPZDFJIGYP2LRG56PYMN","bundle":"https://pith.science/pith/63O3O4BPZDFJIGYP2LRG56PYMN/bundle.json","state":"https://pith.science/pith/63O3O4BPZDFJIGYP2LRG56PYMN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/63O3O4BPZDFJIGYP2LRG56PYMN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:63O3O4BPZDFJIGYP2LRG56PYMN","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":"c9173fe3df57eaef755f853e2146482144838de8d1ee2d011b5145d69f233e03","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","title_canon_sha256":"8371e3451465767108a888f48d0d4e3960b389bcc18bd8de8fa436f1927984ef"},"schema_version":"1.0","source":{"id":"1206.6485","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6485","created_at":"2026-05-18T03:52:13Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6485v1","created_at":"2026-05-18T03:52:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6485","created_at":"2026-05-18T03:52:13Z"},{"alias_kind":"pith_short_12","alias_value":"63O3O4BPZDFJ","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"63O3O4BPZDFJIGYP","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"63O3O4BP","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:ae5dc879819e149079f15f24c1ecee1bd0ce4343644f2ab9e41836e2e43c724c","target":"graph","created_at":"2026-05-18T03:52:13Z","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":"Feature selection and regularization are becoming increasingly prominent tools in the efforts of the reinforcement learning (RL) community to expand the reach and applicability of RL. One approach to the problem of feature selection is to impose a sparsity-inducing form of regularization on the learning method. Recent work on $L_1$ regularization has adapted techniques from the supervised learning literature for use with RL. Another approach that has received renewed attention in the supervised learning community is that of using a simple algorithm that greedily adds new features. Such algorit","authors_text":"Christopher Painter-Wakefield (Duke University), Ronald Parr (Duke University)","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","title":"Greedy Algorithms for Sparse Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6485","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:ef271c78425ff758b9977ea027c3f8f6eded62c268359c0c84fb0eb002683ddd","target":"record","created_at":"2026-05-18T03:52:13Z","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":"c9173fe3df57eaef755f853e2146482144838de8d1ee2d011b5145d69f233e03","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","title_canon_sha256":"8371e3451465767108a888f48d0d4e3960b389bcc18bd8de8fa436f1927984ef"},"schema_version":"1.0","source":{"id":"1206.6485","kind":"arxiv","version":1}},"canonical_sha256":"f6ddb7702fc8ca941b0fd2e26ef9f8634c0bcbded5d577f7458a3ce309dbf00b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6ddb7702fc8ca941b0fd2e26ef9f8634c0bcbded5d577f7458a3ce309dbf00b","first_computed_at":"2026-05-18T03:52:13.682920Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:13.682920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4ExoniyAYvLkm3RW+qRIgwLEyfWn+UxexHnMsHb2t4xiQlEMOaHItlGlkI02z0qZVxW9nY1XU5chOLVUXBBGBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:13.683725Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.6485","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef271c78425ff758b9977ea027c3f8f6eded62c268359c0c84fb0eb002683ddd","sha256:ae5dc879819e149079f15f24c1ecee1bd0ce4343644f2ab9e41836e2e43c724c"],"state_sha256":"e338fa45d99fb7a0b06738e2595cdda0f25ec047fc3250b3382c1fb87d630529"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1kzsOwwQ6O6YsGg5C7cMWIp8Mb518JfhYVZpKDKTz4DP9zUpGmWWXS87VjIweFniPNfnKbjxtDmdd4vQzGUMDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T08:28:53.026427Z","bundle_sha256":"81b5e0133c6cfa70900de6e15f93c67c087f08838256b688f85243a463c2882a"}}