{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UM3HXLQJM4THV4BAM5EBGERICQ","short_pith_number":"pith:UM3HXLQJ","schema_version":"1.0","canonical_sha256":"a3367bae0967267af0206748131228142c8f475e0cf35b26a590279d065d6455","source":{"kind":"arxiv","id":"1712.04677","version":1},"attestation_state":"computed","paper":{"title":"Convex programming in optimal control and information theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Tobias Sutter","submitted_at":"2017-12-13T09:53:39Z","abstract_excerpt":"The main theme of this thesis is the development of computational methods for classes of infinite-dimensional optimization problems arising in optimal control and information theory. The first part of the thesis is concerned with the optimal control of discrete-time continuous space Markov decision processes (MDP). The second part is centred around two fundamental problems in information theory that can be expressed as optimization problems: the channel capacity problem as well as the entropy maximization subject to moment constraints."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1712.04677","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-13T09:53:39Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"8251530c6b9250548db9ff8e0e2749d78756620932a0d4c85d7986030a45419a","abstract_canon_sha256":"413f00924d85e3f5e4502212677fdd8fec614cc5c9309a2528236907fb1bf806"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:03.782175Z","signature_b64":"3DboV4umenYDrDuGKSGPvZMEEFxM+g76og3UTuKy5FN9DRCVtHZQ6kH7agIiu8Lhg8GXREPrn6GQN/GxEMVODQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3367bae0967267af0206748131228142c8f475e0cf35b26a590279d065d6455","last_reissued_at":"2026-05-18T00:28:03.781669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:03.781669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convex programming in optimal control and information theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Tobias Sutter","submitted_at":"2017-12-13T09:53:39Z","abstract_excerpt":"The main theme of this thesis is the development of computational methods for classes of infinite-dimensional optimization problems arising in optimal control and information theory. The first part of the thesis is concerned with the optimal control of discrete-time continuous space Markov decision processes (MDP). The second part is centred around two fundamental problems in information theory that can be expressed as optimization problems: the channel capacity problem as well as the entropy maximization subject to moment constraints."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04677","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.04677","created_at":"2026-05-18T00:28:03.781755+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.04677v1","created_at":"2026-05-18T00:28:03.781755+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04677","created_at":"2026-05-18T00:28:03.781755+00:00"},{"alias_kind":"pith_short_12","alias_value":"UM3HXLQJM4TH","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"UM3HXLQJM4THV4BA","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"UM3HXLQJ","created_at":"2026-05-18T12:31:46.661854+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UM3HXLQJM4THV4BAM5EBGERICQ","json":"https://pith.science/pith/UM3HXLQJM4THV4BAM5EBGERICQ.json","graph_json":"https://pith.science/api/pith-number/UM3HXLQJM4THV4BAM5EBGERICQ/graph.json","events_json":"https://pith.science/api/pith-number/UM3HXLQJM4THV4BAM5EBGERICQ/events.json","paper":"https://pith.science/paper/UM3HXLQJ"},"agent_actions":{"view_html":"https://pith.science/pith/UM3HXLQJM4THV4BAM5EBGERICQ","download_json":"https://pith.science/pith/UM3HXLQJM4THV4BAM5EBGERICQ.json","view_paper":"https://pith.science/paper/UM3HXLQJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.04677&json=true","fetch_graph":"https://pith.science/api/pith-number/UM3HXLQJM4THV4BAM5EBGERICQ/graph.json","fetch_events":"https://pith.science/api/pith-number/UM3HXLQJM4THV4BAM5EBGERICQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UM3HXLQJM4THV4BAM5EBGERICQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UM3HXLQJM4THV4BAM5EBGERICQ/action/storage_attestation","attest_author":"https://pith.science/pith/UM3HXLQJM4THV4BAM5EBGERICQ/action/author_attestation","sign_citation":"https://pith.science/pith/UM3HXLQJM4THV4BAM5EBGERICQ/action/citation_signature","submit_replication":"https://pith.science/pith/UM3HXLQJM4THV4BAM5EBGERICQ/action/replication_record"}},"created_at":"2026-05-18T00:28:03.781755+00:00","updated_at":"2026-05-18T00:28:03.781755+00:00"}