{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LHG7CAZ7RXC7LQCUTEMTPEXCPB","short_pith_number":"pith:LHG7CAZ7","canonical_record":{"source":{"id":"1303.2987","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-03-12T19:16:19Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"ad6f4da7877bcf72f5a96ee0e4e9d32fe29a5ab629be4079cf1c49060cb3e9e5","abstract_canon_sha256":"59cbdf816bda8df67f58949777ebd4cef307d8d8e56cb8b680b50bd705dff590"},"schema_version":"1.0"},"canonical_sha256":"59cdf1033f8dc5f5c05499193792e27842d0538079be46ff8845f06d7e3d6615","source":{"kind":"arxiv","id":"1303.2987","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.2987","created_at":"2026-05-18T03:31:07Z"},{"alias_kind":"arxiv_version","alias_value":"1303.2987v1","created_at":"2026-05-18T03:31:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2987","created_at":"2026-05-18T03:31:07Z"},{"alias_kind":"pith_short_12","alias_value":"LHG7CAZ7RXC7","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LHG7CAZ7RXC7LQCU","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LHG7CAZ7","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LHG7CAZ7RXC7LQCUTEMTPEXCPB","target":"record","payload":{"canonical_record":{"source":{"id":"1303.2987","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-03-12T19:16:19Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"ad6f4da7877bcf72f5a96ee0e4e9d32fe29a5ab629be4079cf1c49060cb3e9e5","abstract_canon_sha256":"59cbdf816bda8df67f58949777ebd4cef307d8d8e56cb8b680b50bd705dff590"},"schema_version":"1.0"},"canonical_sha256":"59cdf1033f8dc5f5c05499193792e27842d0538079be46ff8845f06d7e3d6615","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:07.419918Z","signature_b64":"r0cJ7UZYDrTpvU+xVZ8scdAcwTXCUFfa6xHqF+kq91MdcCvTYPJrrUAy3rFECdpsRN6EBEtKF6Jpc13ks8ekBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59cdf1033f8dc5f5c05499193792e27842d0538079be46ff8845f06d7e3d6615","last_reissued_at":"2026-05-18T03:31:07.419530Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:07.419530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.2987","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-18T03:31:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/N64YYXae6kIqT/Gyw6GipnBL8ez9pfoe+xOGAQrNbpo+0XoVRIoAAFt10dJxLYvdXSNxVAJvaoE9BfJhZfwAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:31:43.246777Z"},"content_sha256":"39da05d81fefb11bf31cd1f8708b60dc6f80856a90fc7a82ef5ade83bf2c27c2","schema_version":"1.0","event_id":"sha256:39da05d81fefb11bf31cd1f8708b60dc6f80856a90fc7a82ef5ade83bf2c27c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LHG7CAZ7RXC7LQCUTEMTPEXCPB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Periodic Reference Tracking Using Batch-Mode Reinforcement Learning with Application to Gene Regulatory Network Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Aivar Sootla, Damien Ernst, Guy-Bart Stan, Mauricio Barahona, Natalja Strelkowa","submitted_at":"2013-03-12T19:16:19Z","abstract_excerpt":"In this paper, we consider the periodic reference tracking problem in the framework of batch-mode reinforcement learning, which studies methods for solving optimal control problems from the sole knowledge of a set of trajectories. In particular, we extend an existing batch-mode reinforcement learning algorithm, known as Fitted Q Iteration, to the periodic reference tracking problem. The presented periodic reference tracking algorithm explicitly exploits a priori knowledge of the future values of the reference trajectory and its periodicity. We discuss the properties of our approach and illustr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2987","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-18T03:31:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q3er5O06F2gKknA/8V42xePjulObni/urtz1jm9c+8F4k1FF3LOZmLnSuUcuQDFLzcbkm7aEIuZ0IuSvwcI7Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:31:43.247142Z"},"content_sha256":"0c11fcf65511ee9f398502a8c8fe3c64c2ef305733ca24e150eaf8555714ba81","schema_version":"1.0","event_id":"sha256:0c11fcf65511ee9f398502a8c8fe3c64c2ef305733ca24e150eaf8555714ba81"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LHG7CAZ7RXC7LQCUTEMTPEXCPB/bundle.json","state_url":"https://pith.science/pith/LHG7CAZ7RXC7LQCUTEMTPEXCPB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LHG7CAZ7RXC7LQCUTEMTPEXCPB/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-06-12T09:31:43Z","links":{"resolver":"https://pith.science/pith/LHG7CAZ7RXC7LQCUTEMTPEXCPB","bundle":"https://pith.science/pith/LHG7CAZ7RXC7LQCUTEMTPEXCPB/bundle.json","state":"https://pith.science/pith/LHG7CAZ7RXC7LQCUTEMTPEXCPB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LHG7CAZ7RXC7LQCUTEMTPEXCPB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LHG7CAZ7RXC7LQCUTEMTPEXCPB","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":"59cbdf816bda8df67f58949777ebd4cef307d8d8e56cb8b680b50bd705dff590","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-03-12T19:16:19Z","title_canon_sha256":"ad6f4da7877bcf72f5a96ee0e4e9d32fe29a5ab629be4079cf1c49060cb3e9e5"},"schema_version":"1.0","source":{"id":"1303.2987","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.2987","created_at":"2026-05-18T03:31:07Z"},{"alias_kind":"arxiv_version","alias_value":"1303.2987v1","created_at":"2026-05-18T03:31:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2987","created_at":"2026-05-18T03:31:07Z"},{"alias_kind":"pith_short_12","alias_value":"LHG7CAZ7RXC7","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LHG7CAZ7RXC7LQCU","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LHG7CAZ7","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:0c11fcf65511ee9f398502a8c8fe3c64c2ef305733ca24e150eaf8555714ba81","target":"graph","created_at":"2026-05-18T03:31:07Z","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":"In this paper, we consider the periodic reference tracking problem in the framework of batch-mode reinforcement learning, which studies methods for solving optimal control problems from the sole knowledge of a set of trajectories. In particular, we extend an existing batch-mode reinforcement learning algorithm, known as Fitted Q Iteration, to the periodic reference tracking problem. The presented periodic reference tracking algorithm explicitly exploits a priori knowledge of the future values of the reference trajectory and its periodicity. We discuss the properties of our approach and illustr","authors_text":"Aivar Sootla, Damien Ernst, Guy-Bart Stan, Mauricio Barahona, Natalja Strelkowa","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-03-12T19:16:19Z","title":"On Periodic Reference Tracking Using Batch-Mode Reinforcement Learning with Application to Gene Regulatory Network Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2987","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:39da05d81fefb11bf31cd1f8708b60dc6f80856a90fc7a82ef5ade83bf2c27c2","target":"record","created_at":"2026-05-18T03:31:07Z","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":"59cbdf816bda8df67f58949777ebd4cef307d8d8e56cb8b680b50bd705dff590","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-03-12T19:16:19Z","title_canon_sha256":"ad6f4da7877bcf72f5a96ee0e4e9d32fe29a5ab629be4079cf1c49060cb3e9e5"},"schema_version":"1.0","source":{"id":"1303.2987","kind":"arxiv","version":1}},"canonical_sha256":"59cdf1033f8dc5f5c05499193792e27842d0538079be46ff8845f06d7e3d6615","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59cdf1033f8dc5f5c05499193792e27842d0538079be46ff8845f06d7e3d6615","first_computed_at":"2026-05-18T03:31:07.419530Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:07.419530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r0cJ7UZYDrTpvU+xVZ8scdAcwTXCUFfa6xHqF+kq91MdcCvTYPJrrUAy3rFECdpsRN6EBEtKF6Jpc13ks8ekBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:07.419918Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.2987","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39da05d81fefb11bf31cd1f8708b60dc6f80856a90fc7a82ef5ade83bf2c27c2","sha256:0c11fcf65511ee9f398502a8c8fe3c64c2ef305733ca24e150eaf8555714ba81"],"state_sha256":"e3e56d6ed2da8accc9485a48352bd981b1466a43401d9bbf5448d348acada12f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AYxnpxu1L4tn62ekGBUGMSxPF/a+Vpwh8TtvyVnTLAwOeNY/61uaqY+6lXwhu3u2i/UU5qqQdbBOuXb1vdIGDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T09:31:43.249209Z","bundle_sha256":"ecd3bb52a73050787f65e015fd493e997aaf41e64a42763b1dd18dc0065e0b62"}}