{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KBXCUC2UH5HMDLWMVELF4KBPES","short_pith_number":"pith:KBXCUC2U","schema_version":"1.0","canonical_sha256":"506e2a0b543f4ec1aecca9165e282f24b603949c2dff41f342a4309e0ff08496","source":{"kind":"arxiv","id":"1603.03160","version":2},"attestation_state":"computed","paper":{"title":"Near-Optimality of Linear Strategies for Static Teams with `Big' Non-Gaussian Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Ankur A. Kulkarni","submitted_at":"2016-03-10T06:51:30Z","abstract_excerpt":"We study stochastic team problems with static information structure where we assume controllers have linear information and quadratic cost but allow the noise to be from a non-Gaussian class. When the noise is Gaussian, it is well known that these problems admit linear optimal controllers. We show that for such linear-quadratic static teams with any log-concave noise, if the length of the noise or data vector becomes large compared to the size of the team and their observations, then linear strategies approach optimality for `most' problems. The quality of the approximation improves as length "},"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":"1603.03160","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-10T06:51:30Z","cross_cats_sorted":["cs.GT","cs.IT","math.IT"],"title_canon_sha256":"ec66f3ebac565cda5d010dce32527474079586cbf8b39ebfbcdd99e028194bed","abstract_canon_sha256":"f96a2a873b90344b2e42865d9185457ffe78b5f988dc371bc2962da248c65e74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:16.006970Z","signature_b64":"r+vtVqutcKvnWvrY0x/wG3JxOkRfCI3u0Bl7kQYhAMBqdZRp+iAsfTLnsHOfTd7XFWEV5MojTwN+EcxyyxpWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"506e2a0b543f4ec1aecca9165e282f24b603949c2dff41f342a4309e0ff08496","last_reissued_at":"2026-05-17T23:57:16.006463Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:16.006463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimality of Linear Strategies for Static Teams with `Big' Non-Gaussian Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Ankur A. Kulkarni","submitted_at":"2016-03-10T06:51:30Z","abstract_excerpt":"We study stochastic team problems with static information structure where we assume controllers have linear information and quadratic cost but allow the noise to be from a non-Gaussian class. When the noise is Gaussian, it is well known that these problems admit linear optimal controllers. We show that for such linear-quadratic static teams with any log-concave noise, if the length of the noise or data vector becomes large compared to the size of the team and their observations, then linear strategies approach optimality for `most' problems. The quality of the approximation improves as length "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03160","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":""},"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":"1603.03160","created_at":"2026-05-17T23:57:16.006540+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.03160v2","created_at":"2026-05-17T23:57:16.006540+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03160","created_at":"2026-05-17T23:57:16.006540+00:00"},{"alias_kind":"pith_short_12","alias_value":"KBXCUC2UH5HM","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"KBXCUC2UH5HMDLWM","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"KBXCUC2U","created_at":"2026-05-18T12:30:25.849896+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/KBXCUC2UH5HMDLWMVELF4KBPES","json":"https://pith.science/pith/KBXCUC2UH5HMDLWMVELF4KBPES.json","graph_json":"https://pith.science/api/pith-number/KBXCUC2UH5HMDLWMVELF4KBPES/graph.json","events_json":"https://pith.science/api/pith-number/KBXCUC2UH5HMDLWMVELF4KBPES/events.json","paper":"https://pith.science/paper/KBXCUC2U"},"agent_actions":{"view_html":"https://pith.science/pith/KBXCUC2UH5HMDLWMVELF4KBPES","download_json":"https://pith.science/pith/KBXCUC2UH5HMDLWMVELF4KBPES.json","view_paper":"https://pith.science/paper/KBXCUC2U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.03160&json=true","fetch_graph":"https://pith.science/api/pith-number/KBXCUC2UH5HMDLWMVELF4KBPES/graph.json","fetch_events":"https://pith.science/api/pith-number/KBXCUC2UH5HMDLWMVELF4KBPES/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KBXCUC2UH5HMDLWMVELF4KBPES/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KBXCUC2UH5HMDLWMVELF4KBPES/action/storage_attestation","attest_author":"https://pith.science/pith/KBXCUC2UH5HMDLWMVELF4KBPES/action/author_attestation","sign_citation":"https://pith.science/pith/KBXCUC2UH5HMDLWMVELF4KBPES/action/citation_signature","submit_replication":"https://pith.science/pith/KBXCUC2UH5HMDLWMVELF4KBPES/action/replication_record"}},"created_at":"2026-05-17T23:57:16.006540+00:00","updated_at":"2026-05-17T23:57:16.006540+00:00"}