{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KBXCUC2UH5HMDLWMVELF4KBPES","short_pith_number":"pith:KBXCUC2U","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"},"canonical_sha256":"506e2a0b543f4ec1aecca9165e282f24b603949c2dff41f342a4309e0ff08496","source":{"kind":"arxiv","id":"1603.03160","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.03160","created_at":"2026-05-17T23:57:16Z"},{"alias_kind":"arxiv_version","alias_value":"1603.03160v2","created_at":"2026-05-17T23:57:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03160","created_at":"2026-05-17T23:57:16Z"},{"alias_kind":"pith_short_12","alias_value":"KBXCUC2UH5HM","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KBXCUC2UH5HMDLWM","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KBXCUC2U","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KBXCUC2UH5HMDLWMVELF4KBPES","target":"record","payload":{"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"},"canonical_sha256":"506e2a0b543f4ec1aecca9165e282f24b603949c2dff41f342a4309e0ff08496","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"},"source_kind":"arxiv","source_id":"1603.03160","source_version":2,"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:57:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1iZMfOXpiI9bTVzdsiktWEiFrsoOZ7dO4KC99XfyrEqVQ+hERk6jHaSIgRRd0yPcmeUfpc/JGBPK705bOnuqCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T17:47:06.908760Z"},"content_sha256":"7eec6ee90f3fd579d8fb02c833280cacb3b9a8fd6b8f75b80edf18a3cb528c22","schema_version":"1.0","event_id":"sha256:7eec6ee90f3fd579d8fb02c833280cacb3b9a8fd6b8f75b80edf18a3cb528c22"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KBXCUC2UH5HMDLWMVELF4KBPES","target":"graph","payload":{"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"},"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:57:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1M1Rh/FjGH4/KhVUXLgBfdJuckWduk1qTIfwmjkUDah1Z2Uy26V0elvScnvV7hBCdhgO8JpUdEjIKuP/FPtyCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T17:47:06.909103Z"},"content_sha256":"819c5051c3e6b3a848d06b1874aef63cfc8319543aa583f07f0221d586c8478a","schema_version":"1.0","event_id":"sha256:819c5051c3e6b3a848d06b1874aef63cfc8319543aa583f07f0221d586c8478a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KBXCUC2UH5HMDLWMVELF4KBPES/bundle.json","state_url":"https://pith.science/pith/KBXCUC2UH5HMDLWMVELF4KBPES/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KBXCUC2UH5HMDLWMVELF4KBPES/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-28T17:47:06Z","links":{"resolver":"https://pith.science/pith/KBXCUC2UH5HMDLWMVELF4KBPES","bundle":"https://pith.science/pith/KBXCUC2UH5HMDLWMVELF4KBPES/bundle.json","state":"https://pith.science/pith/KBXCUC2UH5HMDLWMVELF4KBPES/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KBXCUC2UH5HMDLWMVELF4KBPES/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KBXCUC2UH5HMDLWMVELF4KBPES","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":"f96a2a873b90344b2e42865d9185457ffe78b5f988dc371bc2962da248c65e74","cross_cats_sorted":["cs.GT","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-10T06:51:30Z","title_canon_sha256":"ec66f3ebac565cda5d010dce32527474079586cbf8b39ebfbcdd99e028194bed"},"schema_version":"1.0","source":{"id":"1603.03160","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.03160","created_at":"2026-05-17T23:57:16Z"},{"alias_kind":"arxiv_version","alias_value":"1603.03160v2","created_at":"2026-05-17T23:57:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03160","created_at":"2026-05-17T23:57:16Z"},{"alias_kind":"pith_short_12","alias_value":"KBXCUC2UH5HM","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KBXCUC2UH5HMDLWM","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KBXCUC2U","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:819c5051c3e6b3a848d06b1874aef63cfc8319543aa583f07f0221d586c8478a","target":"graph","created_at":"2026-05-17T23:57:16Z","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 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 ","authors_text":"Ankur A. Kulkarni","cross_cats":["cs.GT","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-10T06:51:30Z","title":"Near-Optimality of Linear Strategies for Static Teams with `Big' Non-Gaussian Noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03160","kind":"arxiv","version":2},"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:7eec6ee90f3fd579d8fb02c833280cacb3b9a8fd6b8f75b80edf18a3cb528c22","target":"record","created_at":"2026-05-17T23:57:16Z","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":"f96a2a873b90344b2e42865d9185457ffe78b5f988dc371bc2962da248c65e74","cross_cats_sorted":["cs.GT","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-10T06:51:30Z","title_canon_sha256":"ec66f3ebac565cda5d010dce32527474079586cbf8b39ebfbcdd99e028194bed"},"schema_version":"1.0","source":{"id":"1603.03160","kind":"arxiv","version":2}},"canonical_sha256":"506e2a0b543f4ec1aecca9165e282f24b603949c2dff41f342a4309e0ff08496","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"506e2a0b543f4ec1aecca9165e282f24b603949c2dff41f342a4309e0ff08496","first_computed_at":"2026-05-17T23:57:16.006463Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:16.006463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r+vtVqutcKvnWvrY0x/wG3JxOkRfCI3u0Bl7kQYhAMBqdZRp+iAsfTLnsHOfTd7XFWEV5MojTwN+EcxyyxpWBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:16.006970Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.03160","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7eec6ee90f3fd579d8fb02c833280cacb3b9a8fd6b8f75b80edf18a3cb528c22","sha256:819c5051c3e6b3a848d06b1874aef63cfc8319543aa583f07f0221d586c8478a"],"state_sha256":"b898a4c2656d08074217efc1a2b56d1aad157d40a7ff7949731cb572f3898260"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2+ocKrJNB2gAL7+ehKXBps03fRpTOl1bar6waLydhmf+Q6s8NmKhICiCoBinzryJK0VPIo7xPrWb8YDUJw0CBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T17:47:06.911000Z","bundle_sha256":"ace6a51544423e42a8a8c6abe6d2f51e0186b5be33401f5d8332673b65232653"}}