{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ZZ32LU3X7SX3EHTZ2FQTY5LOJ3","short_pith_number":"pith:ZZ32LU3X","canonical_record":{"source":{"id":"1309.6831","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-26T12:39:19Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2c7f4cbd67950cdc9775a294029e7fb384748723a17df4830fe9b033ed06b326","abstract_canon_sha256":"85e35ac46d9f3c3b89c32c83da0cdbf508e60cb01787d412dd089dce65f2ee98"},"schema_version":"1.0"},"canonical_sha256":"ce77a5d377fcafb21e79d1613c756e4ed6d4169eb9a74fc1cf0b8a7a764e9bb4","source":{"kind":"arxiv","id":"1309.6831","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6831","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6831v1","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6831","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"ZZ32LU3X7SX3","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZZ32LU3X7SX3EHTZ","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZZ32LU3X","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ZZ32LU3X7SX3EHTZ2FQTY5LOJ3","target":"record","payload":{"canonical_record":{"source":{"id":"1309.6831","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-26T12:39:19Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2c7f4cbd67950cdc9775a294029e7fb384748723a17df4830fe9b033ed06b326","abstract_canon_sha256":"85e35ac46d9f3c3b89c32c83da0cdbf508e60cb01787d412dd089dce65f2ee98"},"schema_version":"1.0"},"canonical_sha256":"ce77a5d377fcafb21e79d1613c756e4ed6d4169eb9a74fc1cf0b8a7a764e9bb4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:10.246981Z","signature_b64":"HIZLzTUthAv+5RjaGFaGnoKWcB94puPNlXAFtE6NcSre/1Hl+vh4T35LVP3LkRCxfMwqjfUY0ZqMAKcJ9I4GAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce77a5d377fcafb21e79d1613c756e4ed6d4169eb9a74fc1cf0b8a7a764e9bb4","last_reissued_at":"2026-05-18T03:12:10.246326Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:10.246326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.6831","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:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tzjmLcywBBim7j9ZAQOKs7HnbCdnDBKyoRHqKchUMtt7vTkxXvZdwq91UcsszbsRaoLuIuzR1W52yOE7ycHzAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:52:18.991932Z"},"content_sha256":"ef0398d915a2f9892de4fb77270f97c9cae670e26940bd1a6387885e5dd15306","schema_version":"1.0","event_id":"sha256:ef0398d915a2f9892de4fb77270f97c9cae670e26940bd1a6387885e5dd15306"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ZZ32LU3X7SX3EHTZ2FQTY5LOJ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Batch-iFDD for Representation Expansion in Large MDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alborz Geramifard, Jonathan How, Nicholas Roy, Thomas J. Walsh","submitted_at":"2013-09-26T12:39:19Z","abstract_excerpt":"Matching pursuit (MP) methods are a promising class of feature construction algorithms for value function approximation. Yet existing MP methods require creating a pool of potential features, mandating expert knowledge or enumeration of a large feature pool, both of which hinder scalability. This paper introduces batch incremental feature dependency discovery (Batch-iFDD) as an MP method that inherits a provable convergence property. Additionally, Batch-iFDD does not require a large pool of features, leading to lower computational complexity. Empirical policy evaluation results across three do"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6831","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:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QzAb1EdxB7u1osNHQZUjtxwHHcfGlwKAZYzb9/RLrjzD+1icV/qVE3OF/CQ8yw9zjjbrBdcyXQR/Gw0B6y/QCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:52:18.992284Z"},"content_sha256":"0d8ac63957520b13a886eeb47ea066de11a5fcdc917d9e1836dab35bf568535d","schema_version":"1.0","event_id":"sha256:0d8ac63957520b13a886eeb47ea066de11a5fcdc917d9e1836dab35bf568535d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZZ32LU3X7SX3EHTZ2FQTY5LOJ3/bundle.json","state_url":"https://pith.science/pith/ZZ32LU3X7SX3EHTZ2FQTY5LOJ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZZ32LU3X7SX3EHTZ2FQTY5LOJ3/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-30T05:52:18Z","links":{"resolver":"https://pith.science/pith/ZZ32LU3X7SX3EHTZ2FQTY5LOJ3","bundle":"https://pith.science/pith/ZZ32LU3X7SX3EHTZ2FQTY5LOJ3/bundle.json","state":"https://pith.science/pith/ZZ32LU3X7SX3EHTZ2FQTY5LOJ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZZ32LU3X7SX3EHTZ2FQTY5LOJ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZZ32LU3X7SX3EHTZ2FQTY5LOJ3","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":"85e35ac46d9f3c3b89c32c83da0cdbf508e60cb01787d412dd089dce65f2ee98","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-26T12:39:19Z","title_canon_sha256":"2c7f4cbd67950cdc9775a294029e7fb384748723a17df4830fe9b033ed06b326"},"schema_version":"1.0","source":{"id":"1309.6831","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6831","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6831v1","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6831","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"ZZ32LU3X7SX3","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZZ32LU3X7SX3EHTZ","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZZ32LU3X","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:0d8ac63957520b13a886eeb47ea066de11a5fcdc917d9e1836dab35bf568535d","target":"graph","created_at":"2026-05-18T03:12:10Z","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":"Matching pursuit (MP) methods are a promising class of feature construction algorithms for value function approximation. Yet existing MP methods require creating a pool of potential features, mandating expert knowledge or enumeration of a large feature pool, both of which hinder scalability. This paper introduces batch incremental feature dependency discovery (Batch-iFDD) as an MP method that inherits a provable convergence property. Additionally, Batch-iFDD does not require a large pool of features, leading to lower computational complexity. Empirical policy evaluation results across three do","authors_text":"Alborz Geramifard, Jonathan How, Nicholas Roy, Thomas J. Walsh","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-26T12:39:19Z","title":"Batch-iFDD for Representation Expansion in Large MDPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6831","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:ef0398d915a2f9892de4fb77270f97c9cae670e26940bd1a6387885e5dd15306","target":"record","created_at":"2026-05-18T03:12:10Z","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":"85e35ac46d9f3c3b89c32c83da0cdbf508e60cb01787d412dd089dce65f2ee98","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-26T12:39:19Z","title_canon_sha256":"2c7f4cbd67950cdc9775a294029e7fb384748723a17df4830fe9b033ed06b326"},"schema_version":"1.0","source":{"id":"1309.6831","kind":"arxiv","version":1}},"canonical_sha256":"ce77a5d377fcafb21e79d1613c756e4ed6d4169eb9a74fc1cf0b8a7a764e9bb4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce77a5d377fcafb21e79d1613c756e4ed6d4169eb9a74fc1cf0b8a7a764e9bb4","first_computed_at":"2026-05-18T03:12:10.246326Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:10.246326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HIZLzTUthAv+5RjaGFaGnoKWcB94puPNlXAFtE6NcSre/1Hl+vh4T35LVP3LkRCxfMwqjfUY0ZqMAKcJ9I4GAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:10.246981Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.6831","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef0398d915a2f9892de4fb77270f97c9cae670e26940bd1a6387885e5dd15306","sha256:0d8ac63957520b13a886eeb47ea066de11a5fcdc917d9e1836dab35bf568535d"],"state_sha256":"dd2db1a8eb6b25a8f29480273d124673c7743ec6fbf6d72e664d0afbb944674c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QKNUHFw5XrXFY4BvTxbBCxTyM0lml5MiqzNcxFeWpC+w3cOJPtOQ7I6VOuWARPg+p3aN7vNo+Ms7zaGgX991CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:52:18.994600Z","bundle_sha256":"28520e4f4af3bef8ed2ff2604b34a5a58ad4b09fb9ebcae7a04b667630b6978a"}}