{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:GQLLNXFCRK7SMLBLLFB2XULUAQ","short_pith_number":"pith:GQLLNXFC","schema_version":"1.0","canonical_sha256":"3416b6dca28abf262c2b5943abd174043b1dd0cfb5d895df020b8ee3823c8256","source":{"kind":"arxiv","id":"2106.04282","version":2},"attestation_state":"computed","paper":{"title":"A Structured Optimal Controller with Feed-Forward for Transportation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anders Rantzer, Martin Heyden, Richard Pates","submitted_at":"2021-06-08T12:21:34Z","abstract_excerpt":"We study an optimal control problem for a simple transportation model on a path graph. We give a closed form solution for the optimal controller, which can also account for planned disturbances using feed-forward. The optimal controller is highly structured, which allows the controller to be implemented using only local communication, conducted through two sweeps through the graph."},"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":"2106.04282","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-06-08T12:21:34Z","cross_cats_sorted":[],"title_canon_sha256":"6f4d0277fb5192633b0b8c6ab421a71a782c5f6b63715b3a3a82853d0a00790b","abstract_canon_sha256":"7cda9b07c057a4fca794a11210fdb02dc7e8784784e7c94dce71ebbe0edf7dba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:52:13.244199Z","signature_b64":"EgcXlYAEWc/SUs/HRfz8570L3H0/uW7rm9+/EdXChx415m0gncFwlNqwK9gXnbhm2Gk77PrgO34lDQ2szNg6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3416b6dca28abf262c2b5943abd174043b1dd0cfb5d895df020b8ee3823c8256","last_reissued_at":"2026-07-05T03:52:13.243796Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:52:13.243796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Structured Optimal Controller with Feed-Forward for Transportation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anders Rantzer, Martin Heyden, Richard Pates","submitted_at":"2021-06-08T12:21:34Z","abstract_excerpt":"We study an optimal control problem for a simple transportation model on a path graph. We give a closed form solution for the optimal controller, which can also account for planned disturbances using feed-forward. The optimal controller is highly structured, which allows the controller to be implemented using only local communication, conducted through two sweeps through the graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.04282","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.04282/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2106.04282","created_at":"2026-07-05T03:52:13.243849+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.04282v2","created_at":"2026-07-05T03:52:13.243849+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.04282","created_at":"2026-07-05T03:52:13.243849+00:00"},{"alias_kind":"pith_short_12","alias_value":"GQLLNXFCRK7S","created_at":"2026-07-05T03:52:13.243849+00:00"},{"alias_kind":"pith_short_16","alias_value":"GQLLNXFCRK7SMLBL","created_at":"2026-07-05T03:52:13.243849+00:00"},{"alias_kind":"pith_short_8","alias_value":"GQLLNXFC","created_at":"2026-07-05T03:52:13.243849+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/GQLLNXFCRK7SMLBLLFB2XULUAQ","json":"https://pith.science/pith/GQLLNXFCRK7SMLBLLFB2XULUAQ.json","graph_json":"https://pith.science/api/pith-number/GQLLNXFCRK7SMLBLLFB2XULUAQ/graph.json","events_json":"https://pith.science/api/pith-number/GQLLNXFCRK7SMLBLLFB2XULUAQ/events.json","paper":"https://pith.science/paper/GQLLNXFC"},"agent_actions":{"view_html":"https://pith.science/pith/GQLLNXFCRK7SMLBLLFB2XULUAQ","download_json":"https://pith.science/pith/GQLLNXFCRK7SMLBLLFB2XULUAQ.json","view_paper":"https://pith.science/paper/GQLLNXFC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.04282&json=true","fetch_graph":"https://pith.science/api/pith-number/GQLLNXFCRK7SMLBLLFB2XULUAQ/graph.json","fetch_events":"https://pith.science/api/pith-number/GQLLNXFCRK7SMLBLLFB2XULUAQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GQLLNXFCRK7SMLBLLFB2XULUAQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GQLLNXFCRK7SMLBLLFB2XULUAQ/action/storage_attestation","attest_author":"https://pith.science/pith/GQLLNXFCRK7SMLBLLFB2XULUAQ/action/author_attestation","sign_citation":"https://pith.science/pith/GQLLNXFCRK7SMLBLLFB2XULUAQ/action/citation_signature","submit_replication":"https://pith.science/pith/GQLLNXFCRK7SMLBLLFB2XULUAQ/action/replication_record"}},"created_at":"2026-07-05T03:52:13.243849+00:00","updated_at":"2026-07-05T03:52:13.243849+00:00"}