{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:EE6FT336DFRNW4MKQ7IMN4GYXY","short_pith_number":"pith:EE6FT336","canonical_record":{"source":{"id":"2310.14550","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-23T04:07:26Z","cross_cats_sorted":[],"title_canon_sha256":"fb53a0c3de21dab911f8d9250717209a8890aae334bf8bcd0d094c67af95a965","abstract_canon_sha256":"4fb7e1081295f80b285251ad83ff290418933b30fc0d14b7ef68f04fb4079add"},"schema_version":"1.0"},"canonical_sha256":"213c59ef7e1962db718a87d0c6f0d8be27bd9019da418d8d3be5ddf3d3608dfd","source":{"kind":"arxiv","id":"2310.14550","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.14550","created_at":"2026-07-05T07:46:25Z"},{"alias_kind":"arxiv_version","alias_value":"2310.14550v3","created_at":"2026-07-05T07:46:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.14550","created_at":"2026-07-05T07:46:25Z"},{"alias_kind":"pith_short_12","alias_value":"EE6FT336DFRN","created_at":"2026-07-05T07:46:25Z"},{"alias_kind":"pith_short_16","alias_value":"EE6FT336DFRNW4MK","created_at":"2026-07-05T07:46:25Z"},{"alias_kind":"pith_short_8","alias_value":"EE6FT336","created_at":"2026-07-05T07:46:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:EE6FT336DFRNW4MKQ7IMN4GYXY","target":"record","payload":{"canonical_record":{"source":{"id":"2310.14550","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-23T04:07:26Z","cross_cats_sorted":[],"title_canon_sha256":"fb53a0c3de21dab911f8d9250717209a8890aae334bf8bcd0d094c67af95a965","abstract_canon_sha256":"4fb7e1081295f80b285251ad83ff290418933b30fc0d14b7ef68f04fb4079add"},"schema_version":"1.0"},"canonical_sha256":"213c59ef7e1962db718a87d0c6f0d8be27bd9019da418d8d3be5ddf3d3608dfd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:46:25.208060Z","signature_b64":"osFQGJ5voIez9rAEcoUTGZYZF2iMcwyxTv7arBQFQgaeRNxdbgtU5qVypLNznGL4DwsP/4HIkDcQ0Qme4SX9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"213c59ef7e1962db718a87d0c6f0d8be27bd9019da418d8d3be5ddf3d3608dfd","last_reissued_at":"2026-07-05T07:46:25.207633Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:46:25.207633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2310.14550","source_version":3,"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-05T07:46:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"79DEx1fjWhSmKLKus9amXjQi03x24pD/rGj5RLAB6kgn/qVHXAgEhAsYkwKvXANbdu8V5JVmxuaP+Z0Nox0eBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T21:36:01.912403Z"},"content_sha256":"feec1970b3073684bf0f1902f209de857408c7ecb03b29524a3f351effbcfa3b","schema_version":"1.0","event_id":"sha256:feec1970b3073684bf0f1902f209de857408c7ecb03b29524a3f351effbcfa3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:EE6FT336DFRNW4MKQ7IMN4GYXY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Corruption-Robust Offline Reinforcement Learning with General Function Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chenlu Ye, Quanquan Gu, Rui Yang, Tong Zhang","submitted_at":"2023-10-23T04:07:26Z","abstract_excerpt":"We investigate the problem of corruption robustness in offline reinforcement learning (RL) with general function approximation, where an adversary can corrupt each sample in the offline dataset, and the corruption level $\\zeta\\geq0$ quantifies the cumulative corruption amount over $n$ episodes and $H$ steps. Our goal is to find a policy that is robust to such corruption and minimizes the suboptimality gap with respect to the optimal policy for the uncorrupted Markov decision processes (MDPs). Drawing inspiration from the uncertainty-weighting technique from the robust online RL setting \\citep{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.14550","kind":"arxiv","version":3},"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/2310.14550/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-05T07:46:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tSX/UNJQ9mQXUscAE6gbH+xFa3EC+LRZUj+1//yUA8dsZ62mu6vgjZoOgERL02Z/IuAy4V2+ID6aqr6lVnjYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T21:36:01.912960Z"},"content_sha256":"54b71a2f4cd85c45cd85a1ea7be1415db19704e4ca38539ce9fa377ab0503898","schema_version":"1.0","event_id":"sha256:54b71a2f4cd85c45cd85a1ea7be1415db19704e4ca38539ce9fa377ab0503898"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EE6FT336DFRNW4MKQ7IMN4GYXY/bundle.json","state_url":"https://pith.science/pith/EE6FT336DFRNW4MKQ7IMN4GYXY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EE6FT336DFRNW4MKQ7IMN4GYXY/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-12T21:36:01Z","links":{"resolver":"https://pith.science/pith/EE6FT336DFRNW4MKQ7IMN4GYXY","bundle":"https://pith.science/pith/EE6FT336DFRNW4MKQ7IMN4GYXY/bundle.json","state":"https://pith.science/pith/EE6FT336DFRNW4MKQ7IMN4GYXY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EE6FT336DFRNW4MKQ7IMN4GYXY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:EE6FT336DFRNW4MKQ7IMN4GYXY","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":"4fb7e1081295f80b285251ad83ff290418933b30fc0d14b7ef68f04fb4079add","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-23T04:07:26Z","title_canon_sha256":"fb53a0c3de21dab911f8d9250717209a8890aae334bf8bcd0d094c67af95a965"},"schema_version":"1.0","source":{"id":"2310.14550","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.14550","created_at":"2026-07-05T07:46:25Z"},{"alias_kind":"arxiv_version","alias_value":"2310.14550v3","created_at":"2026-07-05T07:46:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.14550","created_at":"2026-07-05T07:46:25Z"},{"alias_kind":"pith_short_12","alias_value":"EE6FT336DFRN","created_at":"2026-07-05T07:46:25Z"},{"alias_kind":"pith_short_16","alias_value":"EE6FT336DFRNW4MK","created_at":"2026-07-05T07:46:25Z"},{"alias_kind":"pith_short_8","alias_value":"EE6FT336","created_at":"2026-07-05T07:46:25Z"}],"graph_snapshots":[{"event_id":"sha256:54b71a2f4cd85c45cd85a1ea7be1415db19704e4ca38539ce9fa377ab0503898","target":"graph","created_at":"2026-07-05T07:46:25Z","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/2310.14550/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We investigate the problem of corruption robustness in offline reinforcement learning (RL) with general function approximation, where an adversary can corrupt each sample in the offline dataset, and the corruption level $\\zeta\\geq0$ quantifies the cumulative corruption amount over $n$ episodes and $H$ steps. Our goal is to find a policy that is robust to such corruption and minimizes the suboptimality gap with respect to the optimal policy for the uncorrupted Markov decision processes (MDPs). Drawing inspiration from the uncertainty-weighting technique from the robust online RL setting \\citep{","authors_text":"Chenlu Ye, Quanquan Gu, Rui Yang, Tong Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-23T04:07:26Z","title":"Corruption-Robust Offline Reinforcement Learning with General Function Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.14550","kind":"arxiv","version":3},"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:feec1970b3073684bf0f1902f209de857408c7ecb03b29524a3f351effbcfa3b","target":"record","created_at":"2026-07-05T07:46:25Z","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":"4fb7e1081295f80b285251ad83ff290418933b30fc0d14b7ef68f04fb4079add","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-23T04:07:26Z","title_canon_sha256":"fb53a0c3de21dab911f8d9250717209a8890aae334bf8bcd0d094c67af95a965"},"schema_version":"1.0","source":{"id":"2310.14550","kind":"arxiv","version":3}},"canonical_sha256":"213c59ef7e1962db718a87d0c6f0d8be27bd9019da418d8d3be5ddf3d3608dfd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"213c59ef7e1962db718a87d0c6f0d8be27bd9019da418d8d3be5ddf3d3608dfd","first_computed_at":"2026-07-05T07:46:25.207633Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:46:25.207633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"osFQGJ5voIez9rAEcoUTGZYZF2iMcwyxTv7arBQFQgaeRNxdbgtU5qVypLNznGL4DwsP/4HIkDcQ0Qme4SX9Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:46:25.208060Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.14550","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:feec1970b3073684bf0f1902f209de857408c7ecb03b29524a3f351effbcfa3b","sha256:54b71a2f4cd85c45cd85a1ea7be1415db19704e4ca38539ce9fa377ab0503898"],"state_sha256":"57e4ecca990b214b504697467001ca4d01dd36bf569934169648d2c9f41311c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E4/ADe17SRs/DM9WVs93xDV2NjF4ffRhQHT+6gheWq04GXqux+KD3Epv2QxD9dzBb3ZKn/Dgaot7wG5ZxuaWBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T21:36:01.919251Z","bundle_sha256":"d5f78da89c20a87f08d1f9f478cbd79509627446b6b6e21910737a72aa95cd56"}}