{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JCHMXK3CDNFKJ2Y634HK2DNBXH","short_pith_number":"pith:JCHMXK3C","canonical_record":{"source":{"id":"1711.00801","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-02T16:24:44Z","cross_cats_sorted":[],"title_canon_sha256":"3253b568e2f73b7f8430666906fdf24150ca3e3bae08a23c40980f0a4877a966","abstract_canon_sha256":"edb417d88be170df072923a1a887a239dae354948b1ef60a16bb22bce4c1d7fb"},"schema_version":"1.0"},"canonical_sha256":"488ecbab621b4aa4eb1edf0ead0da1b9eaf2bdef795f1746cef50e73fe61174e","source":{"kind":"arxiv","id":"1711.00801","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00801","created_at":"2026-05-18T00:23:13Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00801v2","created_at":"2026-05-18T00:23:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00801","created_at":"2026-05-18T00:23:13Z"},{"alias_kind":"pith_short_12","alias_value":"JCHMXK3CDNFK","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"JCHMXK3CDNFKJ2Y6","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"JCHMXK3C","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JCHMXK3CDNFKJ2Y634HK2DNBXH","target":"record","payload":{"canonical_record":{"source":{"id":"1711.00801","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-02T16:24:44Z","cross_cats_sorted":[],"title_canon_sha256":"3253b568e2f73b7f8430666906fdf24150ca3e3bae08a23c40980f0a4877a966","abstract_canon_sha256":"edb417d88be170df072923a1a887a239dae354948b1ef60a16bb22bce4c1d7fb"},"schema_version":"1.0"},"canonical_sha256":"488ecbab621b4aa4eb1edf0ead0da1b9eaf2bdef795f1746cef50e73fe61174e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:13.802704Z","signature_b64":"TBYMKmr8Uphlo0o1/Vkxu9JXjjomZvlFthcoe5FCkM+ucg7BhoWE6ePglwcDs9ZKCH+wXVK5A72XoyAQbnhHCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"488ecbab621b4aa4eb1edf0ead0da1b9eaf2bdef795f1746cef50e73fe61174e","last_reissued_at":"2026-05-18T00:23:13.802001Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:13.802001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.00801","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-05-18T00:23:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kK6rmdfXeNBSzqQG5BGsiKVJw6FkIYgC1XB08t1DVOhZVvQ0MS7NiooEgz1xdwG7c4VRm39UH/KHqLPcXY2rAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T06:53:47.998245Z"},"content_sha256":"1e5d8d00db152a3203cc66a5e56e1dd5d9856f7c6b7ba9e9f7b942afd79bc9c5","schema_version":"1.0","event_id":"sha256:1e5d8d00db152a3203cc66a5e56e1dd5d9856f7c6b7ba9e9f7b942afd79bc9c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JCHMXK3CDNFKJ2Y634HK2DNBXH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Programming Based Optimality Conditions and Approximate Solution of a Deterministic Infinite Horizon Discounted Optimal Control Problem in Discrete Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alex Parkinson, Ilya Shvartsman, Vladimir Gaitsgory","submitted_at":"2017-11-02T16:24:44Z","abstract_excerpt":"It has been recently established that a deterministic infinite horizon discounted optimal control problem in discrete time is closely related to a certain infinite dimensional linear programming problem and its dual. In the present paper, we use these results to establish necessary and sufficient optimality conditions for this optimal control problem and apply them to construct a near optimal control."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00801","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":""},"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:23:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sn4KlBEF1zNbG1epq5QXNnENuI8oPJg30LnhluFjzcKQjS8KmOvcEVzQ3ubB0T7rvtA54j4LwdT3tmIHsnumDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T06:53:47.998635Z"},"content_sha256":"96fb1231143ff1a02760ee01eba2bbea45eb09c58ec6c7774d8fbd70e602c8bc","schema_version":"1.0","event_id":"sha256:96fb1231143ff1a02760ee01eba2bbea45eb09c58ec6c7774d8fbd70e602c8bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JCHMXK3CDNFKJ2Y634HK2DNBXH/bundle.json","state_url":"https://pith.science/pith/JCHMXK3CDNFKJ2Y634HK2DNBXH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JCHMXK3CDNFKJ2Y634HK2DNBXH/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-07-01T06:53:48Z","links":{"resolver":"https://pith.science/pith/JCHMXK3CDNFKJ2Y634HK2DNBXH","bundle":"https://pith.science/pith/JCHMXK3CDNFKJ2Y634HK2DNBXH/bundle.json","state":"https://pith.science/pith/JCHMXK3CDNFKJ2Y634HK2DNBXH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JCHMXK3CDNFKJ2Y634HK2DNBXH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JCHMXK3CDNFKJ2Y634HK2DNBXH","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":"edb417d88be170df072923a1a887a239dae354948b1ef60a16bb22bce4c1d7fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-02T16:24:44Z","title_canon_sha256":"3253b568e2f73b7f8430666906fdf24150ca3e3bae08a23c40980f0a4877a966"},"schema_version":"1.0","source":{"id":"1711.00801","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00801","created_at":"2026-05-18T00:23:13Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00801v2","created_at":"2026-05-18T00:23:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00801","created_at":"2026-05-18T00:23:13Z"},{"alias_kind":"pith_short_12","alias_value":"JCHMXK3CDNFK","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"JCHMXK3CDNFKJ2Y6","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"JCHMXK3C","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:96fb1231143ff1a02760ee01eba2bbea45eb09c58ec6c7774d8fbd70e602c8bc","target":"graph","created_at":"2026-05-18T00:23:13Z","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":"It has been recently established that a deterministic infinite horizon discounted optimal control problem in discrete time is closely related to a certain infinite dimensional linear programming problem and its dual. In the present paper, we use these results to establish necessary and sufficient optimality conditions for this optimal control problem and apply them to construct a near optimal control.","authors_text":"Alex Parkinson, Ilya Shvartsman, Vladimir Gaitsgory","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-02T16:24:44Z","title":"Linear Programming Based Optimality Conditions and Approximate Solution of a Deterministic Infinite Horizon Discounted Optimal Control Problem in Discrete Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00801","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:1e5d8d00db152a3203cc66a5e56e1dd5d9856f7c6b7ba9e9f7b942afd79bc9c5","target":"record","created_at":"2026-05-18T00:23:13Z","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":"edb417d88be170df072923a1a887a239dae354948b1ef60a16bb22bce4c1d7fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-02T16:24:44Z","title_canon_sha256":"3253b568e2f73b7f8430666906fdf24150ca3e3bae08a23c40980f0a4877a966"},"schema_version":"1.0","source":{"id":"1711.00801","kind":"arxiv","version":2}},"canonical_sha256":"488ecbab621b4aa4eb1edf0ead0da1b9eaf2bdef795f1746cef50e73fe61174e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"488ecbab621b4aa4eb1edf0ead0da1b9eaf2bdef795f1746cef50e73fe61174e","first_computed_at":"2026-05-18T00:23:13.802001Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:13.802001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TBYMKmr8Uphlo0o1/Vkxu9JXjjomZvlFthcoe5FCkM+ucg7BhoWE6ePglwcDs9ZKCH+wXVK5A72XoyAQbnhHCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:13.802704Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.00801","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e5d8d00db152a3203cc66a5e56e1dd5d9856f7c6b7ba9e9f7b942afd79bc9c5","sha256:96fb1231143ff1a02760ee01eba2bbea45eb09c58ec6c7774d8fbd70e602c8bc"],"state_sha256":"9aebcfae4844875faee76c1c36d36ad0d9056f166bb05dfb582b29d884b7fdc8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gVuFP8PKpa+4deNjK0xZGRJvRESCCaSiJFUfEnZKfbefUrg0viM5ffYyc9phAiHzeAZVshKHI2zGEX0uXtGlBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T06:53:48.001344Z","bundle_sha256":"22b4a43a74858be276cbb0d59edb0ce85228011b5633ba3606cd6886a5d06311"}}