{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:AY4AKTSDLIXYEZBRAPL7QEXDXZ","short_pith_number":"pith:AY4AKTSD","canonical_record":{"source":{"id":"2403.02476","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-03-04T20:40:02Z","cross_cats_sorted":["cs.SY","eess.SY","math.OC"],"title_canon_sha256":"482ef87cd59580f01b6a16b3c915e3eb5b9c1c882cdc066565febc7dd2eaae31","abstract_canon_sha256":"a1d1bb15a3a1eedb224b02689c5e7b61fccb8cdf73996698befefa5c8b3ddf7e"},"schema_version":"1.0"},"canonical_sha256":"0638054e435a2f82643103d7f812e3be7927f2fc803fff97465d73e42ff82be0","source":{"kind":"arxiv","id":"2403.02476","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.02476","created_at":"2026-07-05T08:36:46Z"},{"alias_kind":"arxiv_version","alias_value":"2403.02476v2","created_at":"2026-07-05T08:36:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.02476","created_at":"2026-07-05T08:36:46Z"},{"alias_kind":"pith_short_12","alias_value":"AY4AKTSDLIXY","created_at":"2026-07-05T08:36:46Z"},{"alias_kind":"pith_short_16","alias_value":"AY4AKTSDLIXYEZBR","created_at":"2026-07-05T08:36:46Z"},{"alias_kind":"pith_short_8","alias_value":"AY4AKTSD","created_at":"2026-07-05T08:36:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:AY4AKTSDLIXYEZBRAPL7QEXDXZ","target":"record","payload":{"canonical_record":{"source":{"id":"2403.02476","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-03-04T20:40:02Z","cross_cats_sorted":["cs.SY","eess.SY","math.OC"],"title_canon_sha256":"482ef87cd59580f01b6a16b3c915e3eb5b9c1c882cdc066565febc7dd2eaae31","abstract_canon_sha256":"a1d1bb15a3a1eedb224b02689c5e7b61fccb8cdf73996698befefa5c8b3ddf7e"},"schema_version":"1.0"},"canonical_sha256":"0638054e435a2f82643103d7f812e3be7927f2fc803fff97465d73e42ff82be0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:36:46.280014Z","signature_b64":"fP4UWLdHOLu/z9oI3iuQSqc+vgZ7I5iC4uVQgDSIB2Ls9Os1YaRvh+GEab9/7ZYNIJtorObhGsqJ+OVT6mofCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0638054e435a2f82643103d7f812e3be7927f2fc803fff97465d73e42ff82be0","last_reissued_at":"2026-07-05T08:36:46.279535Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:36:46.279535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.02476","source_version":2,"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-07-05T08:36:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ENbaJppE3VzwTz/MW2scDhg67E/iyFsO87DGAcvghy34QFRfDPAMYmukTRnvQTrNMInPa4qHa36lFuN5ByCdCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T19:55:21.818887Z"},"content_sha256":"846dd3501bde4d5eed43b7f599a8bb31507813bf131d6a00793957c91dbe683a","schema_version":"1.0","event_id":"sha256:846dd3501bde4d5eed43b7f599a8bb31507813bf131d6a00793957c91dbe683a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:AY4AKTSDLIXYEZBRAPL7QEXDXZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Simple Finite-Time Analysis of TD Learning with Linear Function Approximation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY","math.OC"],"primary_cat":"cs.LG","authors_text":"Aritra Mitra","submitted_at":"2024-03-04T20:40:02Z","abstract_excerpt":"We study the finite-time convergence of TD learning with linear function approximation under Markovian sampling. Existing proofs for this setting either assume a projection step in the algorithm to simplify the analysis, or require a fairly intricate argument to ensure stability of the iterates. We ask: \\textit{Is it possible to retain the simplicity of a projection-based analysis without actually performing a projection step in the algorithm?} Our main contribution is to show this is possible via a novel two-step argument. In the first step, we use induction to prove that under a standard cho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.02476","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.02476/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T08:36:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Bjl8J8Uqdbhcd8EeQT9JBpsUVR1ZDjJhKIH2egukZff4QKS3wDlOFGjPDlEOgb77p4r3HIcdhfYZKhrbXq2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T19:55:21.819401Z"},"content_sha256":"b2602bd15a2ec9a9928e68bafe7498426f3ae7895c7d6b4a048b40f4e679f85c","schema_version":"1.0","event_id":"sha256:b2602bd15a2ec9a9928e68bafe7498426f3ae7895c7d6b4a048b40f4e679f85c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AY4AKTSDLIXYEZBRAPL7QEXDXZ/bundle.json","state_url":"https://pith.science/pith/AY4AKTSDLIXYEZBRAPL7QEXDXZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AY4AKTSDLIXYEZBRAPL7QEXDXZ/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-08-04T19:55:21Z","links":{"resolver":"https://pith.science/pith/AY4AKTSDLIXYEZBRAPL7QEXDXZ","bundle":"https://pith.science/pith/AY4AKTSDLIXYEZBRAPL7QEXDXZ/bundle.json","state":"https://pith.science/pith/AY4AKTSDLIXYEZBRAPL7QEXDXZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AY4AKTSDLIXYEZBRAPL7QEXDXZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:AY4AKTSDLIXYEZBRAPL7QEXDXZ","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":"a1d1bb15a3a1eedb224b02689c5e7b61fccb8cdf73996698befefa5c8b3ddf7e","cross_cats_sorted":["cs.SY","eess.SY","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-03-04T20:40:02Z","title_canon_sha256":"482ef87cd59580f01b6a16b3c915e3eb5b9c1c882cdc066565febc7dd2eaae31"},"schema_version":"1.0","source":{"id":"2403.02476","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.02476","created_at":"2026-07-05T08:36:46Z"},{"alias_kind":"arxiv_version","alias_value":"2403.02476v2","created_at":"2026-07-05T08:36:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.02476","created_at":"2026-07-05T08:36:46Z"},{"alias_kind":"pith_short_12","alias_value":"AY4AKTSDLIXY","created_at":"2026-07-05T08:36:46Z"},{"alias_kind":"pith_short_16","alias_value":"AY4AKTSDLIXYEZBR","created_at":"2026-07-05T08:36:46Z"},{"alias_kind":"pith_short_8","alias_value":"AY4AKTSD","created_at":"2026-07-05T08:36:46Z"}],"graph_snapshots":[{"event_id":"sha256:b2602bd15a2ec9a9928e68bafe7498426f3ae7895c7d6b4a048b40f4e679f85c","target":"graph","created_at":"2026-07-05T08:36:46Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2403.02476/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the finite-time convergence of TD learning with linear function approximation under Markovian sampling. Existing proofs for this setting either assume a projection step in the algorithm to simplify the analysis, or require a fairly intricate argument to ensure stability of the iterates. We ask: \\textit{Is it possible to retain the simplicity of a projection-based analysis without actually performing a projection step in the algorithm?} Our main contribution is to show this is possible via a novel two-step argument. In the first step, we use induction to prove that under a standard cho","authors_text":"Aritra Mitra","cross_cats":["cs.SY","eess.SY","math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-03-04T20:40:02Z","title":"A Simple Finite-Time Analysis of TD Learning with Linear Function Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.02476","kind":"arxiv","version":2},"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:846dd3501bde4d5eed43b7f599a8bb31507813bf131d6a00793957c91dbe683a","target":"record","created_at":"2026-07-05T08:36:46Z","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":"a1d1bb15a3a1eedb224b02689c5e7b61fccb8cdf73996698befefa5c8b3ddf7e","cross_cats_sorted":["cs.SY","eess.SY","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-03-04T20:40:02Z","title_canon_sha256":"482ef87cd59580f01b6a16b3c915e3eb5b9c1c882cdc066565febc7dd2eaae31"},"schema_version":"1.0","source":{"id":"2403.02476","kind":"arxiv","version":2}},"canonical_sha256":"0638054e435a2f82643103d7f812e3be7927f2fc803fff97465d73e42ff82be0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0638054e435a2f82643103d7f812e3be7927f2fc803fff97465d73e42ff82be0","first_computed_at":"2026-07-05T08:36:46.279535Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:36:46.279535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fP4UWLdHOLu/z9oI3iuQSqc+vgZ7I5iC4uVQgDSIB2Ls9Os1YaRvh+GEab9/7ZYNIJtorObhGsqJ+OVT6mofCg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:36:46.280014Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.02476","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:846dd3501bde4d5eed43b7f599a8bb31507813bf131d6a00793957c91dbe683a","sha256:b2602bd15a2ec9a9928e68bafe7498426f3ae7895c7d6b4a048b40f4e679f85c"],"state_sha256":"39ddabf5e17318e90c41ef933f0e6dc45a66991abd2add9ea483c92dd539d5be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dvfHQuqRSJX6Tbb+YLa6QK/MfQ07InUtnQr4Cux+/q8GXrBjsCZZSIlxyoUa5vHq4mmmyhqduYNwsBiK/wQ9Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T19:55:21.824456Z","bundle_sha256":"417fa147e7f2dac1aec1b83afce0f3710d24b2b98f2c781221ecc047956921f5"}}