{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:LW6CT36VWW2IWNOPJBWIICMD3I","short_pith_number":"pith:LW6CT36V","canonical_record":{"source":{"id":"2303.14281","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2023-03-24T21:39:06Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e5dc8514cb065d683c9db80c52ac25e885fdbfc8a2db914e840f78f1fc3aba39","abstract_canon_sha256":"57ae9a15b94389d66fafb67f4c18867957bce941e03f89d0b31dd34bbed92664"},"schema_version":"1.0"},"canonical_sha256":"5dbc29efd5b5b48b35cf486c840983da04ed1346876cb29fa9fc0540b19c810e","source":{"kind":"arxiv","id":"2303.14281","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.14281","created_at":"2026-07-05T08:50:06Z"},{"alias_kind":"arxiv_version","alias_value":"2303.14281v2","created_at":"2026-07-05T08:50:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.14281","created_at":"2026-07-05T08:50:06Z"},{"alias_kind":"pith_short_12","alias_value":"LW6CT36VWW2I","created_at":"2026-07-05T08:50:06Z"},{"alias_kind":"pith_short_16","alias_value":"LW6CT36VWW2IWNOP","created_at":"2026-07-05T08:50:06Z"},{"alias_kind":"pith_short_8","alias_value":"LW6CT36V","created_at":"2026-07-05T08:50:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:LW6CT36VWW2IWNOPJBWIICMD3I","target":"record","payload":{"canonical_record":{"source":{"id":"2303.14281","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2023-03-24T21:39:06Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e5dc8514cb065d683c9db80c52ac25e885fdbfc8a2db914e840f78f1fc3aba39","abstract_canon_sha256":"57ae9a15b94389d66fafb67f4c18867957bce941e03f89d0b31dd34bbed92664"},"schema_version":"1.0"},"canonical_sha256":"5dbc29efd5b5b48b35cf486c840983da04ed1346876cb29fa9fc0540b19c810e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:50:06.538391Z","signature_b64":"B5Sy2jAWAxXoODKlww+F8UJWMmFTDfNyev6/y4uBTdVz+Xa2y+3YbTsYo/6zxn5DiXsP9mxNKsb7WM824/alBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5dbc29efd5b5b48b35cf486c840983da04ed1346876cb29fa9fc0540b19c810e","last_reissued_at":"2026-07-05T08:50:06.537941Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:50:06.537941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2303.14281","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:50:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QOsrclLata3MAffl+4kOwntqwnMib1cCYx5fGN6waz0+tK4Dpi9GDVpIzCYethWT0vEWZJMygCo8MWiK3dETAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T19:33:36.344747Z"},"content_sha256":"b1fd18089b2745cfd922543c09893dd0df5343048ae89e693d1d2687395bc1ee","schema_version":"1.0","event_id":"sha256:b1fd18089b2745cfd922543c09893dd0df5343048ae89e693d1d2687395bc1ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:LW6CT36VWW2IWNOPJBWIICMD3I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sequential Knockoffs for Variable Selection in Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Chengchun Shi, Eric B. Laber, Hengrui Cai, Jin Zhu, Tao Ma, Yunxiao Chen, Zhengling Qi","submitted_at":"2023-03-24T21:39:06Z","abstract_excerpt":"In real-world applications of reinforcement learning, it is often challenging to obtain a state representation that is parsimonious and satisfies the Markov property without prior knowledge. Consequently, it is common practice to construct a state larger than necessary, e.g., by concatenating measurements over contiguous time points. However, needlessly increasing the dimension of the state may slow learning and obfuscate the learned policy. We introduce the notion of a minimal sufficient state in a Markov decision process (MDP) as the subvector of the original state under which the process re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.14281","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/2303.14281/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:50:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zJMy729bL/F0L92VfaloTUc+BCFru5yzqxArCtxdPqFBwLglBdZh0QMTiGTAl6wYCUcAwkgJC9jm46Z2jzuqBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T19:33:36.345272Z"},"content_sha256":"077e71187ef533a7e032e1a0394749fe137157bb98c36e2d2f52a93c14cb4ea4","schema_version":"1.0","event_id":"sha256:077e71187ef533a7e032e1a0394749fe137157bb98c36e2d2f52a93c14cb4ea4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LW6CT36VWW2IWNOPJBWIICMD3I/bundle.json","state_url":"https://pith.science/pith/LW6CT36VWW2IWNOPJBWIICMD3I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LW6CT36VWW2IWNOPJBWIICMD3I/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-08T19:33:36Z","links":{"resolver":"https://pith.science/pith/LW6CT36VWW2IWNOPJBWIICMD3I","bundle":"https://pith.science/pith/LW6CT36VWW2IWNOPJBWIICMD3I/bundle.json","state":"https://pith.science/pith/LW6CT36VWW2IWNOPJBWIICMD3I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LW6CT36VWW2IWNOPJBWIICMD3I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:LW6CT36VWW2IWNOPJBWIICMD3I","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":"57ae9a15b94389d66fafb67f4c18867957bce941e03f89d0b31dd34bbed92664","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2023-03-24T21:39:06Z","title_canon_sha256":"e5dc8514cb065d683c9db80c52ac25e885fdbfc8a2db914e840f78f1fc3aba39"},"schema_version":"1.0","source":{"id":"2303.14281","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.14281","created_at":"2026-07-05T08:50:06Z"},{"alias_kind":"arxiv_version","alias_value":"2303.14281v2","created_at":"2026-07-05T08:50:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.14281","created_at":"2026-07-05T08:50:06Z"},{"alias_kind":"pith_short_12","alias_value":"LW6CT36VWW2I","created_at":"2026-07-05T08:50:06Z"},{"alias_kind":"pith_short_16","alias_value":"LW6CT36VWW2IWNOP","created_at":"2026-07-05T08:50:06Z"},{"alias_kind":"pith_short_8","alias_value":"LW6CT36V","created_at":"2026-07-05T08:50:06Z"}],"graph_snapshots":[{"event_id":"sha256:077e71187ef533a7e032e1a0394749fe137157bb98c36e2d2f52a93c14cb4ea4","target":"graph","created_at":"2026-07-05T08:50:06Z","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/2303.14281/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In real-world applications of reinforcement learning, it is often challenging to obtain a state representation that is parsimonious and satisfies the Markov property without prior knowledge. Consequently, it is common practice to construct a state larger than necessary, e.g., by concatenating measurements over contiguous time points. However, needlessly increasing the dimension of the state may slow learning and obfuscate the learned policy. We introduce the notion of a minimal sufficient state in a Markov decision process (MDP) as the subvector of the original state under which the process re","authors_text":"Chengchun Shi, Eric B. Laber, Hengrui Cai, Jin Zhu, Tao Ma, Yunxiao Chen, Zhengling Qi","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2023-03-24T21:39:06Z","title":"Sequential Knockoffs for Variable Selection in Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.14281","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:b1fd18089b2745cfd922543c09893dd0df5343048ae89e693d1d2687395bc1ee","target":"record","created_at":"2026-07-05T08:50:06Z","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":"57ae9a15b94389d66fafb67f4c18867957bce941e03f89d0b31dd34bbed92664","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2023-03-24T21:39:06Z","title_canon_sha256":"e5dc8514cb065d683c9db80c52ac25e885fdbfc8a2db914e840f78f1fc3aba39"},"schema_version":"1.0","source":{"id":"2303.14281","kind":"arxiv","version":2}},"canonical_sha256":"5dbc29efd5b5b48b35cf486c840983da04ed1346876cb29fa9fc0540b19c810e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5dbc29efd5b5b48b35cf486c840983da04ed1346876cb29fa9fc0540b19c810e","first_computed_at":"2026-07-05T08:50:06.537941Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:50:06.537941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B5Sy2jAWAxXoODKlww+F8UJWMmFTDfNyev6/y4uBTdVz+Xa2y+3YbTsYo/6zxn5DiXsP9mxNKsb7WM824/alBg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:50:06.538391Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.14281","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b1fd18089b2745cfd922543c09893dd0df5343048ae89e693d1d2687395bc1ee","sha256:077e71187ef533a7e032e1a0394749fe137157bb98c36e2d2f52a93c14cb4ea4"],"state_sha256":"78fb4aa7f4eb064d5b74afdfc33df1e705cc7f926a5a84784d2b48b1fe698cc9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ajNCN624mPjkLRmNzJafo/P/1H7X0tz0wPwCDmkKM0BM31s3J3Zbf54t4nP6ylhxdjpCrkwOwRdxlOxdtFRQBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T19:33:36.350367Z","bundle_sha256":"4eb560bc22be507e285efc1f2dc230b6a44708fd0e302650341f11d7fb0e60d5"}}