{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:L4A32NTKV5AAPCIM6UK6LTD5HY","short_pith_number":"pith:L4A32NTK","schema_version":"1.0","canonical_sha256":"5f01bd366aaf4007890cf515e5cc7d3e1cbbf5be3bc1e3f1d862e641ea3f1f8b","source":{"kind":"arxiv","id":"1703.06485","version":1},"attestation_state":"computed","paper":{"title":"Near Optimal Hamiltonian-Control and Learning via Chattering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Peeyush Kumar, Wolf Kohn, Zelda B. Zabinsky","submitted_at":"2017-03-19T18:25:52Z","abstract_excerpt":"Many applications require solving non-linear control problems that are classically not well behaved. This paper develops a simple and efficient chattering algorithm that learns near optimal decision policies through an open-loop feedback strategy. The optimal control problem reduces to a series of linear optimization programs that can be easily solved to recover a relaxed optimal trajectory. This algorithm is implemented on a real-time enterprise scheduling and control process."},"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":"1703.06485","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-19T18:25:52Z","cross_cats_sorted":[],"title_canon_sha256":"86615d378e01d227cce90f7f55a9195d68048f4cd6d1d011ea6ec4127ed6e5a2","abstract_canon_sha256":"d487cb6be8c26285824581bd7a20abffc8f847b27d1ea33f8061d038a2070727"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:22.720408Z","signature_b64":"lyb24RmbkX/Y5p9R+k3xTeetGE5VDQ+DGpNQi9A/75a6Uo6HhGarWAAvlbEzXB+Wn8bf1SOQiMhIRCadYQ1zAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f01bd366aaf4007890cf515e5cc7d3e1cbbf5be3bc1e3f1d862e641ea3f1f8b","last_reissued_at":"2026-05-18T00:48:22.719901Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:22.719901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near Optimal Hamiltonian-Control and Learning via Chattering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Peeyush Kumar, Wolf Kohn, Zelda B. Zabinsky","submitted_at":"2017-03-19T18:25:52Z","abstract_excerpt":"Many applications require solving non-linear control problems that are classically not well behaved. This paper develops a simple and efficient chattering algorithm that learns near optimal decision policies through an open-loop feedback strategy. The optimal control problem reduces to a series of linear optimization programs that can be easily solved to recover a relaxed optimal trajectory. This algorithm is implemented on a real-time enterprise scheduling and control process."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06485","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":"1703.06485","created_at":"2026-05-18T00:48:22.719984+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.06485v1","created_at":"2026-05-18T00:48:22.719984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06485","created_at":"2026-05-18T00:48:22.719984+00:00"},{"alias_kind":"pith_short_12","alias_value":"L4A32NTKV5AA","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"L4A32NTKV5AAPCIM","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"L4A32NTK","created_at":"2026-05-18T12:31:28.150371+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/L4A32NTKV5AAPCIM6UK6LTD5HY","json":"https://pith.science/pith/L4A32NTKV5AAPCIM6UK6LTD5HY.json","graph_json":"https://pith.science/api/pith-number/L4A32NTKV5AAPCIM6UK6LTD5HY/graph.json","events_json":"https://pith.science/api/pith-number/L4A32NTKV5AAPCIM6UK6LTD5HY/events.json","paper":"https://pith.science/paper/L4A32NTK"},"agent_actions":{"view_html":"https://pith.science/pith/L4A32NTKV5AAPCIM6UK6LTD5HY","download_json":"https://pith.science/pith/L4A32NTKV5AAPCIM6UK6LTD5HY.json","view_paper":"https://pith.science/paper/L4A32NTK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.06485&json=true","fetch_graph":"https://pith.science/api/pith-number/L4A32NTKV5AAPCIM6UK6LTD5HY/graph.json","fetch_events":"https://pith.science/api/pith-number/L4A32NTKV5AAPCIM6UK6LTD5HY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L4A32NTKV5AAPCIM6UK6LTD5HY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L4A32NTKV5AAPCIM6UK6LTD5HY/action/storage_attestation","attest_author":"https://pith.science/pith/L4A32NTKV5AAPCIM6UK6LTD5HY/action/author_attestation","sign_citation":"https://pith.science/pith/L4A32NTKV5AAPCIM6UK6LTD5HY/action/citation_signature","submit_replication":"https://pith.science/pith/L4A32NTKV5AAPCIM6UK6LTD5HY/action/replication_record"}},"created_at":"2026-05-18T00:48:22.719984+00:00","updated_at":"2026-05-18T00:48:22.719984+00:00"}