{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LRQQQ33VMW354TNDBVHNRPO2JX","short_pith_number":"pith:LRQQQ33V","schema_version":"1.0","canonical_sha256":"5c61086f7565b7de4da30d4ed8bdda4ddfec51a11141fe4b5ce595cb45016470","source":{"kind":"arxiv","id":"1805.11271","version":3},"attestation_state":"computed","paper":{"title":"A Decentralized Optimal Feedback Flow Control Approach for Transport Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Ketan Savla, Saeid Jafari","submitted_at":"2018-05-29T07:03:08Z","abstract_excerpt":"Finite-time optimal feedback control for flow networks under information constraints is studied. By utilizing the framework of multi-parametric linear programming, it is demonstrated that when cost/constraints can be modeled or approximated by piecewise-affine functions, the optimal control has a closed-form state-feedback realization. The optimal feedback control law, however, has a centralized structure and requires instantaneous access to the state of the entire network that may lead to prohibitive communication requirements in large-scale complex networks. We subsequently examine the desig"},"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":"1805.11271","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2018-05-29T07:03:08Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"e819674519b7db0a50f6520c983cb92ad9220120e63fc6ae5730ea06a3bbd2f8","abstract_canon_sha256":"4f86a9ba28df554089ed44e17b4fb942aff56dfa57249cdc31389d0649425df4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T19:11:55.918254Z","signature_b64":"ihooFPdImrk/8Tqv9MD70CtCguP2uHIzt+lL+I46t/oehmce/oGhwwKuQfBfryuXXtp2Yr+j4QrU3HO6ybezCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c61086f7565b7de4da30d4ed8bdda4ddfec51a11141fe4b5ce595cb45016470","last_reissued_at":"2026-06-04T19:11:55.917767Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T19:11:55.917767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Decentralized Optimal Feedback Flow Control Approach for Transport Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Ketan Savla, Saeid Jafari","submitted_at":"2018-05-29T07:03:08Z","abstract_excerpt":"Finite-time optimal feedback control for flow networks under information constraints is studied. By utilizing the framework of multi-parametric linear programming, it is demonstrated that when cost/constraints can be modeled or approximated by piecewise-affine functions, the optimal control has a closed-form state-feedback realization. The optimal feedback control law, however, has a centralized structure and requires instantaneous access to the state of the entire network that may lead to prohibitive communication requirements in large-scale complex networks. We subsequently examine the desig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11271","kind":"arxiv","version":3},"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/1805.11271/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":"1805.11271","created_at":"2026-06-04T19:11:55.917824+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.11271v3","created_at":"2026-06-04T19:11:55.917824+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11271","created_at":"2026-06-04T19:11:55.917824+00:00"},{"alias_kind":"pith_short_12","alias_value":"LRQQQ33VMW35","created_at":"2026-06-04T19:11:55.917824+00:00"},{"alias_kind":"pith_short_16","alias_value":"LRQQQ33VMW354TND","created_at":"2026-06-04T19:11:55.917824+00:00"},{"alias_kind":"pith_short_8","alias_value":"LRQQQ33V","created_at":"2026-06-04T19:11:55.917824+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.11362","citing_title":"Interactive Physics-Inspired Traffic Congestion Management","ref_index":40,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LRQQQ33VMW354TNDBVHNRPO2JX","json":"https://pith.science/pith/LRQQQ33VMW354TNDBVHNRPO2JX.json","graph_json":"https://pith.science/api/pith-number/LRQQQ33VMW354TNDBVHNRPO2JX/graph.json","events_json":"https://pith.science/api/pith-number/LRQQQ33VMW354TNDBVHNRPO2JX/events.json","paper":"https://pith.science/paper/LRQQQ33V"},"agent_actions":{"view_html":"https://pith.science/pith/LRQQQ33VMW354TNDBVHNRPO2JX","download_json":"https://pith.science/pith/LRQQQ33VMW354TNDBVHNRPO2JX.json","view_paper":"https://pith.science/paper/LRQQQ33V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.11271&json=true","fetch_graph":"https://pith.science/api/pith-number/LRQQQ33VMW354TNDBVHNRPO2JX/graph.json","fetch_events":"https://pith.science/api/pith-number/LRQQQ33VMW354TNDBVHNRPO2JX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LRQQQ33VMW354TNDBVHNRPO2JX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LRQQQ33VMW354TNDBVHNRPO2JX/action/storage_attestation","attest_author":"https://pith.science/pith/LRQQQ33VMW354TNDBVHNRPO2JX/action/author_attestation","sign_citation":"https://pith.science/pith/LRQQQ33VMW354TNDBVHNRPO2JX/action/citation_signature","submit_replication":"https://pith.science/pith/LRQQQ33VMW354TNDBVHNRPO2JX/action/replication_record"}},"created_at":"2026-06-04T19:11:55.917824+00:00","updated_at":"2026-06-04T19:11:55.917824+00:00"}