{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WEDBC3TSXNJI7LXGNFZHWNOVXA","short_pith_number":"pith:WEDBC3TS","canonical_record":{"source":{"id":"1408.3907","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-18T06:53:03Z","cross_cats_sorted":[],"title_canon_sha256":"ebc0fa15b5a07a0341ed3782e7c4628a8ef9159df64e31954b5bedce0545069b","abstract_canon_sha256":"736c46b7b0d6ee053fd764222d0b22d0d5040a9064152e66a0915ae96d74e6f0"},"schema_version":"1.0"},"canonical_sha256":"b106116e72bb528faee669727b35d5b83d8dcddf567dad9ac38ddc5952f3ea1f","source":{"kind":"arxiv","id":"1408.3907","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.3907","created_at":"2026-05-18T02:44:56Z"},{"alias_kind":"arxiv_version","alias_value":"1408.3907v2","created_at":"2026-05-18T02:44:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3907","created_at":"2026-05-18T02:44:56Z"},{"alias_kind":"pith_short_12","alias_value":"WEDBC3TSXNJI","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WEDBC3TSXNJI7LXG","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WEDBC3TS","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WEDBC3TSXNJI7LXGNFZHWNOVXA","target":"record","payload":{"canonical_record":{"source":{"id":"1408.3907","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-18T06:53:03Z","cross_cats_sorted":[],"title_canon_sha256":"ebc0fa15b5a07a0341ed3782e7c4628a8ef9159df64e31954b5bedce0545069b","abstract_canon_sha256":"736c46b7b0d6ee053fd764222d0b22d0d5040a9064152e66a0915ae96d74e6f0"},"schema_version":"1.0"},"canonical_sha256":"b106116e72bb528faee669727b35d5b83d8dcddf567dad9ac38ddc5952f3ea1f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:56.024148Z","signature_b64":"FfG8zhvPmJiFeXKGA2jBOyR3vV+/iW5vrMPozWdE4PdwnVyDQkvsVTcrYlp8/Xe9e7fiR/sAUaZJo3bC1QptCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b106116e72bb528faee669727b35d5b83d8dcddf567dad9ac38ddc5952f3ea1f","last_reissued_at":"2026-05-18T02:44:56.023584Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:56.023584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.3907","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-18T02:44:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2XX1mX0V1gBTMDsetPs37EpSdjiW8bmaYiSfGoFC4yjNhDFpQq2LQFER33vkoIE0n1V1kC8Hg5BN+HSc1rd/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T05:28:31.209127Z"},"content_sha256":"f363ce04c9516b371bc1581afbd946aa6fb42b99b48806941438d8bbd007d7ee","schema_version":"1.0","event_id":"sha256:f363ce04c9516b371bc1581afbd946aa6fb42b99b48806941438d8bbd007d7ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WEDBC3TSXNJI7LXGNFZHWNOVXA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On average control generating families for singularly perturbed optimal control problems with long run average optimality criteria","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ludmila Manic, Sergey Rossomakhine, Vladimir Gaitsgory","submitted_at":"2014-08-18T06:53:03Z","abstract_excerpt":"The paper aims at the development of tools for analysis and construction of near optimal solutions of singularly perturbed (SP) optimal controls problems with long run average optimality criteria. The idea that we exploit is to first asymptotically approximate a given problem of optimal control of the SP system by a certain averaged optimal control problem, then reformulate this averaged problem as an infinite-dimensional (ID) linear programming (LP) problem, and then approximate the latter by semi-infinite LP problems. We show that the optimal solution of these semi-infinite LP problems and t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3907","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-18T02:44:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J+lqyj+k69snVYj/B0t2MtJ2yO9OyDWbyJpY0XhNdwG4rpylXufvDDeWXHNbPPjF4TZHH6Cn4bPhwhX+empnDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T05:28:31.209741Z"},"content_sha256":"4a143c372ab1cf885ffc1ce80e2c5db99ec3c521da1aa07f4be1afb2bab1bf81","schema_version":"1.0","event_id":"sha256:4a143c372ab1cf885ffc1ce80e2c5db99ec3c521da1aa07f4be1afb2bab1bf81"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WEDBC3TSXNJI7LXGNFZHWNOVXA/bundle.json","state_url":"https://pith.science/pith/WEDBC3TSXNJI7LXGNFZHWNOVXA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WEDBC3TSXNJI7LXGNFZHWNOVXA/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-01T05:28:31Z","links":{"resolver":"https://pith.science/pith/WEDBC3TSXNJI7LXGNFZHWNOVXA","bundle":"https://pith.science/pith/WEDBC3TSXNJI7LXGNFZHWNOVXA/bundle.json","state":"https://pith.science/pith/WEDBC3TSXNJI7LXGNFZHWNOVXA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WEDBC3TSXNJI7LXGNFZHWNOVXA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WEDBC3TSXNJI7LXGNFZHWNOVXA","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":"736c46b7b0d6ee053fd764222d0b22d0d5040a9064152e66a0915ae96d74e6f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-18T06:53:03Z","title_canon_sha256":"ebc0fa15b5a07a0341ed3782e7c4628a8ef9159df64e31954b5bedce0545069b"},"schema_version":"1.0","source":{"id":"1408.3907","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.3907","created_at":"2026-05-18T02:44:56Z"},{"alias_kind":"arxiv_version","alias_value":"1408.3907v2","created_at":"2026-05-18T02:44:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3907","created_at":"2026-05-18T02:44:56Z"},{"alias_kind":"pith_short_12","alias_value":"WEDBC3TSXNJI","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WEDBC3TSXNJI7LXG","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WEDBC3TS","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:4a143c372ab1cf885ffc1ce80e2c5db99ec3c521da1aa07f4be1afb2bab1bf81","target":"graph","created_at":"2026-05-18T02:44:56Z","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":"The paper aims at the development of tools for analysis and construction of near optimal solutions of singularly perturbed (SP) optimal controls problems with long run average optimality criteria. The idea that we exploit is to first asymptotically approximate a given problem of optimal control of the SP system by a certain averaged optimal control problem, then reformulate this averaged problem as an infinite-dimensional (ID) linear programming (LP) problem, and then approximate the latter by semi-infinite LP problems. We show that the optimal solution of these semi-infinite LP problems and t","authors_text":"Ludmila Manic, Sergey Rossomakhine, Vladimir Gaitsgory","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-18T06:53:03Z","title":"On average control generating families for singularly perturbed optimal control problems with long run average optimality criteria"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3907","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:f363ce04c9516b371bc1581afbd946aa6fb42b99b48806941438d8bbd007d7ee","target":"record","created_at":"2026-05-18T02:44:56Z","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":"736c46b7b0d6ee053fd764222d0b22d0d5040a9064152e66a0915ae96d74e6f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-18T06:53:03Z","title_canon_sha256":"ebc0fa15b5a07a0341ed3782e7c4628a8ef9159df64e31954b5bedce0545069b"},"schema_version":"1.0","source":{"id":"1408.3907","kind":"arxiv","version":2}},"canonical_sha256":"b106116e72bb528faee669727b35d5b83d8dcddf567dad9ac38ddc5952f3ea1f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b106116e72bb528faee669727b35d5b83d8dcddf567dad9ac38ddc5952f3ea1f","first_computed_at":"2026-05-18T02:44:56.023584Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:56.023584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FfG8zhvPmJiFeXKGA2jBOyR3vV+/iW5vrMPozWdE4PdwnVyDQkvsVTcrYlp8/Xe9e7fiR/sAUaZJo3bC1QptCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:56.024148Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.3907","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f363ce04c9516b371bc1581afbd946aa6fb42b99b48806941438d8bbd007d7ee","sha256:4a143c372ab1cf885ffc1ce80e2c5db99ec3c521da1aa07f4be1afb2bab1bf81"],"state_sha256":"fa3ebed420c20382f2a3d2b61cda4a2406637744da8aee91c1da6315315bc4cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JedbZ95Y/US8lAZbZSkDafc9Nw0SpWdbviKltcNT+gOOOjwOQTb8pPViJbrSDQHvS9TO96fJB3WDVbC/b9DVDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T05:28:31.213941Z","bundle_sha256":"0f055c0f0dcbfcfc716d7bfa08fba5347cf6098106cb5bc98f950eb6e19d0f39"}}