{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FAD2J6I33SNXGFNTOHUPSZA4SA","short_pith_number":"pith:FAD2J6I3","canonical_record":{"source":{"id":"1805.10005","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-25T07:04:42Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"ab05e927863f2638bda8968909107c3581484fdf8f9e9527ef39c732e7d35843","abstract_canon_sha256":"5de477a7d1df2afa97f1c0248ac2f43dbfde2342ceaffff5fe09007e8a7caebb"},"schema_version":"1.0"},"canonical_sha256":"2807a4f91bdc9b7315b371e8f9641c9037390b753697f3f0ff36c9c1986e42a0","source":{"kind":"arxiv","id":"1805.10005","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10005","created_at":"2026-05-18T00:14:58Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10005v1","created_at":"2026-05-18T00:14:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10005","created_at":"2026-05-18T00:14:58Z"},{"alias_kind":"pith_short_12","alias_value":"FAD2J6I33SNX","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FAD2J6I33SNXGFNT","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FAD2J6I3","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FAD2J6I33SNXGFNTOHUPSZA4SA","target":"record","payload":{"canonical_record":{"source":{"id":"1805.10005","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-25T07:04:42Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"ab05e927863f2638bda8968909107c3581484fdf8f9e9527ef39c732e7d35843","abstract_canon_sha256":"5de477a7d1df2afa97f1c0248ac2f43dbfde2342ceaffff5fe09007e8a7caebb"},"schema_version":"1.0"},"canonical_sha256":"2807a4f91bdc9b7315b371e8f9641c9037390b753697f3f0ff36c9c1986e42a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:58.517945Z","signature_b64":"TgRrsPnLTX9tV0v5KwuFXEoDp908VLbqURkH4KdV20Fs2FKn6CSAo5menAAcvUN2EUcfLgxZthAXKUCwVQH+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2807a4f91bdc9b7315b371e8f9641c9037390b753697f3f0ff36c9c1986e42a0","last_reissued_at":"2026-05-18T00:14:58.517327Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:58.517327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.10005","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:14:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CqhjChvz11smtqpziin3hA3dTjhSZ9xnlQWUsuIlINLkH3lZkUio/dre3KMZiHeu+4hxhzZwSiS7iAwAN7s8CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:11:36.832610Z"},"content_sha256":"5c9bb4a710e8feefa063ad4ce86fe512d972dad15d77ad04cc2570d7761c17c7","schema_version":"1.0","event_id":"sha256:5c9bb4a710e8feefa063ad4ce86fe512d972dad15d77ad04cc2570d7761c17c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FAD2J6I33SNXGFNTOHUPSZA4SA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finite Sample Analysis of LSTD with Random Projections and Eligibility Traces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Haifang Li, Wensheng Zhang, Yingce Xia","submitted_at":"2018-05-25T07:04:42Z","abstract_excerpt":"Policy evaluation with linear function approximation is an important problem in reinforcement learning. When facing high-dimensional feature spaces, such a problem becomes extremely hard considering the computation efficiency and quality of approximations. We propose a new algorithm, LSTD($\\lambda$)-RP, which leverages random projection techniques and takes eligibility traces into consideration to tackle the above two challenges. We carry out theoretical analysis of LSTD($\\lambda$)-RP, and provide meaningful upper bounds of the estimation error, approximation error and total generalization err"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10005","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:14:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2eC3ev4Y9RKdh+r5JmPv1GwtYH8On2ZZ9Z3KaQlR++KiJvleHd1wG2ULN5XuOelBOYKrQbrpZQ/+DFPY4ZViAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:11:36.833256Z"},"content_sha256":"5c1139a22de3ec29cb8ea8f2c7cb7415bf02e097210c1f97dba120aa700147ab","schema_version":"1.0","event_id":"sha256:5c1139a22de3ec29cb8ea8f2c7cb7415bf02e097210c1f97dba120aa700147ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FAD2J6I33SNXGFNTOHUPSZA4SA/bundle.json","state_url":"https://pith.science/pith/FAD2J6I33SNXGFNTOHUPSZA4SA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FAD2J6I33SNXGFNTOHUPSZA4SA/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-28T14:11:36Z","links":{"resolver":"https://pith.science/pith/FAD2J6I33SNXGFNTOHUPSZA4SA","bundle":"https://pith.science/pith/FAD2J6I33SNXGFNTOHUPSZA4SA/bundle.json","state":"https://pith.science/pith/FAD2J6I33SNXGFNTOHUPSZA4SA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FAD2J6I33SNXGFNTOHUPSZA4SA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FAD2J6I33SNXGFNTOHUPSZA4SA","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":"5de477a7d1df2afa97f1c0248ac2f43dbfde2342ceaffff5fe09007e8a7caebb","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-25T07:04:42Z","title_canon_sha256":"ab05e927863f2638bda8968909107c3581484fdf8f9e9527ef39c732e7d35843"},"schema_version":"1.0","source":{"id":"1805.10005","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10005","created_at":"2026-05-18T00:14:58Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10005v1","created_at":"2026-05-18T00:14:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10005","created_at":"2026-05-18T00:14:58Z"},{"alias_kind":"pith_short_12","alias_value":"FAD2J6I33SNX","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FAD2J6I33SNXGFNT","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FAD2J6I3","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:5c1139a22de3ec29cb8ea8f2c7cb7415bf02e097210c1f97dba120aa700147ab","target":"graph","created_at":"2026-05-18T00:14:58Z","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":"Policy evaluation with linear function approximation is an important problem in reinforcement learning. When facing high-dimensional feature spaces, such a problem becomes extremely hard considering the computation efficiency and quality of approximations. We propose a new algorithm, LSTD($\\lambda$)-RP, which leverages random projection techniques and takes eligibility traces into consideration to tackle the above two challenges. We carry out theoretical analysis of LSTD($\\lambda$)-RP, and provide meaningful upper bounds of the estimation error, approximation error and total generalization err","authors_text":"Haifang Li, Wensheng Zhang, Yingce Xia","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-25T07:04:42Z","title":"Finite Sample Analysis of LSTD with Random Projections and Eligibility Traces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10005","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:5c9bb4a710e8feefa063ad4ce86fe512d972dad15d77ad04cc2570d7761c17c7","target":"record","created_at":"2026-05-18T00:14:58Z","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":"5de477a7d1df2afa97f1c0248ac2f43dbfde2342ceaffff5fe09007e8a7caebb","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-25T07:04:42Z","title_canon_sha256":"ab05e927863f2638bda8968909107c3581484fdf8f9e9527ef39c732e7d35843"},"schema_version":"1.0","source":{"id":"1805.10005","kind":"arxiv","version":1}},"canonical_sha256":"2807a4f91bdc9b7315b371e8f9641c9037390b753697f3f0ff36c9c1986e42a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2807a4f91bdc9b7315b371e8f9641c9037390b753697f3f0ff36c9c1986e42a0","first_computed_at":"2026-05-18T00:14:58.517327Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:58.517327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TgRrsPnLTX9tV0v5KwuFXEoDp908VLbqURkH4KdV20Fs2FKn6CSAo5menAAcvUN2EUcfLgxZthAXKUCwVQH+CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:58.517945Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.10005","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c9bb4a710e8feefa063ad4ce86fe512d972dad15d77ad04cc2570d7761c17c7","sha256:5c1139a22de3ec29cb8ea8f2c7cb7415bf02e097210c1f97dba120aa700147ab"],"state_sha256":"fea52d132d61a16147282fa7a373c6e4c32c192d27e0deafcdd8c85b8c5dea03"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RU20lp3iSk2s56h2g1SMzC2wpsZsKCJvpB8J7lweG8Q3D03TvochvAgJMzO0xxFTfx61yfa4hoj31e7Qbx/JDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T14:11:36.836503Z","bundle_sha256":"9937fe0045a2062d94d6bdad96a83dfd6f033ed8d1b2b9dee081338c284b6c84"}}