{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FFFGZPPG54JHURDSPYOGCZ5QJ3","short_pith_number":"pith:FFFGZPPG","canonical_record":{"source":{"id":"1708.03991","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-14T02:22:50Z","cross_cats_sorted":[],"title_canon_sha256":"4cb515fcf9f257028ca0a1472782fe39cc4b5d0fdec13deb2e461d7c750f85aa","abstract_canon_sha256":"eb68e49a23c0e149a0aa9a1fde4d1a2b8b22ff6aad4582ee6869f3ed88d6a11e"},"schema_version":"1.0"},"canonical_sha256":"294a6cbde6ef127a44727e1c6167b04edfd49640963f154b5d1d8b61ea00a2dc","source":{"kind":"arxiv","id":"1708.03991","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.03991","created_at":"2026-05-17T23:44:22Z"},{"alias_kind":"arxiv_version","alias_value":"1708.03991v4","created_at":"2026-05-17T23:44:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03991","created_at":"2026-05-17T23:44:22Z"},{"alias_kind":"pith_short_12","alias_value":"FFFGZPPG54JH","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FFFGZPPG54JHURDS","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FFFGZPPG","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FFFGZPPG54JHURDSPYOGCZ5QJ3","target":"record","payload":{"canonical_record":{"source":{"id":"1708.03991","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-14T02:22:50Z","cross_cats_sorted":[],"title_canon_sha256":"4cb515fcf9f257028ca0a1472782fe39cc4b5d0fdec13deb2e461d7c750f85aa","abstract_canon_sha256":"eb68e49a23c0e149a0aa9a1fde4d1a2b8b22ff6aad4582ee6869f3ed88d6a11e"},"schema_version":"1.0"},"canonical_sha256":"294a6cbde6ef127a44727e1c6167b04edfd49640963f154b5d1d8b61ea00a2dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:22.982191Z","signature_b64":"z8cAPirMdtX5wcpXzb1c3mCGiYRWzM1X1kEww2Olk4QmqghF6MTClzoWkQQtqGZaZZUsW7d7DX1tfJGOpoYuDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"294a6cbde6ef127a44727e1c6167b04edfd49640963f154b5d1d8b61ea00a2dc","last_reissued_at":"2026-05-17T23:44:22.981635Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:22.981635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.03991","source_version":4,"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-17T23:44:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jHwwisH+wIBN7ST5ok6tLcQMsmtefp/2lLoHRHB1+F7SjtKSNgd3Q/dQ6GGywI0+eCqYjetRNR/OWx9iPKwuCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T09:53:31.521028Z"},"content_sha256":"486b11ec549b5045eb029f3bd18dd4f49d24b152be79e44d58793054b6936a95","schema_version":"1.0","event_id":"sha256:486b11ec549b5045eb029f3bd18dd4f49d24b152be79e44d58793054b6936a95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FFFGZPPG54JHURDSPYOGCZ5QJ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Convex Information Relaxation for Constrained Decentralized Control Design Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Eilyan Bitar, Weixuan Lin","submitted_at":"2017-08-14T02:22:50Z","abstract_excerpt":"We describe a convex programming approach to the calculation of lower bounds on the minimum cost of constrained decentralized control problems with nonclassical information structures. The class of problems we consider entail the decentralized output feedback control of a linear time-varying system over a finite horizon, subject to polyhedral constraints on the state and input trajectories, and sparsity constraints on the controller's information structure. As the determination of optimal control policies for such systems is known to be computationally intractable in general, considerable effo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03991","kind":"arxiv","version":4},"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-17T23:44:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mdJ91BM8x5pby3iyvOQXL1vbbkORW4ufWyYHzEVHKRiUGVXE20w07mRv97c32dr2wkhMkyKuSB2alN79XzkCDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T09:53:31.521397Z"},"content_sha256":"0d8201fa92a09bc361d774494f93e83920e9ab8715ea4c56d792b75f69da8082","schema_version":"1.0","event_id":"sha256:0d8201fa92a09bc361d774494f93e83920e9ab8715ea4c56d792b75f69da8082"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FFFGZPPG54JHURDSPYOGCZ5QJ3/bundle.json","state_url":"https://pith.science/pith/FFFGZPPG54JHURDSPYOGCZ5QJ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FFFGZPPG54JHURDSPYOGCZ5QJ3/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-06-26T09:53:31Z","links":{"resolver":"https://pith.science/pith/FFFGZPPG54JHURDSPYOGCZ5QJ3","bundle":"https://pith.science/pith/FFFGZPPG54JHURDSPYOGCZ5QJ3/bundle.json","state":"https://pith.science/pith/FFFGZPPG54JHURDSPYOGCZ5QJ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FFFGZPPG54JHURDSPYOGCZ5QJ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FFFGZPPG54JHURDSPYOGCZ5QJ3","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":"eb68e49a23c0e149a0aa9a1fde4d1a2b8b22ff6aad4582ee6869f3ed88d6a11e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-14T02:22:50Z","title_canon_sha256":"4cb515fcf9f257028ca0a1472782fe39cc4b5d0fdec13deb2e461d7c750f85aa"},"schema_version":"1.0","source":{"id":"1708.03991","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.03991","created_at":"2026-05-17T23:44:22Z"},{"alias_kind":"arxiv_version","alias_value":"1708.03991v4","created_at":"2026-05-17T23:44:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03991","created_at":"2026-05-17T23:44:22Z"},{"alias_kind":"pith_short_12","alias_value":"FFFGZPPG54JH","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FFFGZPPG54JHURDS","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FFFGZPPG","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:0d8201fa92a09bc361d774494f93e83920e9ab8715ea4c56d792b75f69da8082","target":"graph","created_at":"2026-05-17T23:44:22Z","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":"We describe a convex programming approach to the calculation of lower bounds on the minimum cost of constrained decentralized control problems with nonclassical information structures. The class of problems we consider entail the decentralized output feedback control of a linear time-varying system over a finite horizon, subject to polyhedral constraints on the state and input trajectories, and sparsity constraints on the controller's information structure. As the determination of optimal control policies for such systems is known to be computationally intractable in general, considerable effo","authors_text":"Eilyan Bitar, Weixuan Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-14T02:22:50Z","title":"A Convex Information Relaxation for Constrained Decentralized Control Design Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03991","kind":"arxiv","version":4},"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:486b11ec549b5045eb029f3bd18dd4f49d24b152be79e44d58793054b6936a95","target":"record","created_at":"2026-05-17T23:44:22Z","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":"eb68e49a23c0e149a0aa9a1fde4d1a2b8b22ff6aad4582ee6869f3ed88d6a11e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-14T02:22:50Z","title_canon_sha256":"4cb515fcf9f257028ca0a1472782fe39cc4b5d0fdec13deb2e461d7c750f85aa"},"schema_version":"1.0","source":{"id":"1708.03991","kind":"arxiv","version":4}},"canonical_sha256":"294a6cbde6ef127a44727e1c6167b04edfd49640963f154b5d1d8b61ea00a2dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"294a6cbde6ef127a44727e1c6167b04edfd49640963f154b5d1d8b61ea00a2dc","first_computed_at":"2026-05-17T23:44:22.981635Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:22.981635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z8cAPirMdtX5wcpXzb1c3mCGiYRWzM1X1kEww2Olk4QmqghF6MTClzoWkQQtqGZaZZUsW7d7DX1tfJGOpoYuDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:22.982191Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.03991","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:486b11ec549b5045eb029f3bd18dd4f49d24b152be79e44d58793054b6936a95","sha256:0d8201fa92a09bc361d774494f93e83920e9ab8715ea4c56d792b75f69da8082"],"state_sha256":"58fee5564a429259807bafc0b1f0fc11059dc945355d08a5b5693f2ba3863b11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FrxeFxrlWQ2mXrMi5I22Vi5yuVwbJR91oQAoS+RiYbitvDQKkcF1/ROn28YvHmbZ3ofVNlF2cX1egpjoW8CdAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T09:53:31.523362Z","bundle_sha256":"f4bd34b17fefd62dce4c340beddc3fbbde37b02bfcdfcf7571290e105b968cad"}}