{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KOMOFQA6VL2PKSOF2JV6M5E4JO","short_pith_number":"pith:KOMOFQA6","schema_version":"1.0","canonical_sha256":"5398e2c01eaaf4f549c5d26be6749c4b825b4cf6a461e0b440987d7568b6db87","source":{"kind":"arxiv","id":"1407.0449","version":1},"attestation_state":"computed","paper":{"title":"Classification-based Approximate Policy Iteration: Experiments and Extended Discussions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Amir-massoud Farahmand, Andr\\'e M.S. Barreto, Doina Precup, Mohammad Ghavamzadeh","submitted_at":"2014-07-02T03:19:43Z","abstract_excerpt":"Tackling large approximate dynamic programming or reinforcement learning problems requires methods that can exploit regularities, or intrinsic structure, of the problem in hand. Most current methods are geared towards exploiting the regularities of either the value function or the policy. We introduce a general classification-based approximate policy iteration (CAPI) framework, which encompasses a large class of algorithms that can exploit regularities of both the value function and the policy space, depending on what is advantageous. This framework has two main components: a generic value fun"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1407.0449","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-07-02T03:19:43Z","cross_cats_sorted":["cs.SY","math.OC","stat.ML"],"title_canon_sha256":"e135126c2be09723f98ad354d780e380f80f4047cbe9b871fd22aca34ad66433","abstract_canon_sha256":"956869701f86fbade2adec9a7b0c2e9c236040f647bf2c59a7865f1d3df38b09"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:33.755590Z","signature_b64":"RwT9gqIu6CMxxSsAAoSAY0DROy7FP86GhAuJ2VxGSg2MVsV8INNiT90cSqeVsCti8lB89Q4bkfXc4ZxhWZo7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5398e2c01eaaf4f549c5d26be6749c4b825b4cf6a461e0b440987d7568b6db87","last_reissued_at":"2026-05-18T02:48:33.754946Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:33.754946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classification-based Approximate Policy Iteration: Experiments and Extended Discussions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Amir-massoud Farahmand, Andr\\'e M.S. Barreto, Doina Precup, Mohammad Ghavamzadeh","submitted_at":"2014-07-02T03:19:43Z","abstract_excerpt":"Tackling large approximate dynamic programming or reinforcement learning problems requires methods that can exploit regularities, or intrinsic structure, of the problem in hand. Most current methods are geared towards exploiting the regularities of either the value function or the policy. We introduce a general classification-based approximate policy iteration (CAPI) framework, which encompasses a large class of algorithms that can exploit regularities of both the value function and the policy space, depending on what is advantageous. This framework has two main components: a generic value fun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0449","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.0449","created_at":"2026-05-18T02:48:33.755045+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.0449v1","created_at":"2026-05-18T02:48:33.755045+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0449","created_at":"2026-05-18T02:48:33.755045+00:00"},{"alias_kind":"pith_short_12","alias_value":"KOMOFQA6VL2P","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KOMOFQA6VL2PKSOF","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KOMOFQA6","created_at":"2026-05-18T12:28:35.611951+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KOMOFQA6VL2PKSOF2JV6M5E4JO","json":"https://pith.science/pith/KOMOFQA6VL2PKSOF2JV6M5E4JO.json","graph_json":"https://pith.science/api/pith-number/KOMOFQA6VL2PKSOF2JV6M5E4JO/graph.json","events_json":"https://pith.science/api/pith-number/KOMOFQA6VL2PKSOF2JV6M5E4JO/events.json","paper":"https://pith.science/paper/KOMOFQA6"},"agent_actions":{"view_html":"https://pith.science/pith/KOMOFQA6VL2PKSOF2JV6M5E4JO","download_json":"https://pith.science/pith/KOMOFQA6VL2PKSOF2JV6M5E4JO.json","view_paper":"https://pith.science/paper/KOMOFQA6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.0449&json=true","fetch_graph":"https://pith.science/api/pith-number/KOMOFQA6VL2PKSOF2JV6M5E4JO/graph.json","fetch_events":"https://pith.science/api/pith-number/KOMOFQA6VL2PKSOF2JV6M5E4JO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KOMOFQA6VL2PKSOF2JV6M5E4JO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KOMOFQA6VL2PKSOF2JV6M5E4JO/action/storage_attestation","attest_author":"https://pith.science/pith/KOMOFQA6VL2PKSOF2JV6M5E4JO/action/author_attestation","sign_citation":"https://pith.science/pith/KOMOFQA6VL2PKSOF2JV6M5E4JO/action/citation_signature","submit_replication":"https://pith.science/pith/KOMOFQA6VL2PKSOF2JV6M5E4JO/action/replication_record"}},"created_at":"2026-05-18T02:48:33.755045+00:00","updated_at":"2026-05-18T02:48:33.755045+00:00"}