{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RAQXMTFSZ2UC4UYH7FKKCWAWCT","short_pith_number":"pith:RAQXMTFS","canonical_record":{"source":{"id":"1904.05701","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-04-11T14:02:15Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"703e4b20f885fa9e17c0f1e9ee22180fb72c0b3fc5606b2aebd24b3e1ccaded0","abstract_canon_sha256":"2415eb582c7568b035834c7b2fd619bcfad462c1b80420c37adcb101fde3c71e"},"schema_version":"1.0"},"canonical_sha256":"8821764cb2cea82e5307f954a1581614fb0993b77b5e4f10cee20ef0b0fc0f5f","source":{"kind":"arxiv","id":"1904.05701","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.05701","created_at":"2026-05-17T23:48:48Z"},{"alias_kind":"arxiv_version","alias_value":"1904.05701v1","created_at":"2026-05-17T23:48:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05701","created_at":"2026-05-17T23:48:48Z"},{"alias_kind":"pith_short_12","alias_value":"RAQXMTFSZ2UC","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RAQXMTFSZ2UC4UYH","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RAQXMTFS","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RAQXMTFSZ2UC4UYH7FKKCWAWCT","target":"record","payload":{"canonical_record":{"source":{"id":"1904.05701","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-04-11T14:02:15Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"703e4b20f885fa9e17c0f1e9ee22180fb72c0b3fc5606b2aebd24b3e1ccaded0","abstract_canon_sha256":"2415eb582c7568b035834c7b2fd619bcfad462c1b80420c37adcb101fde3c71e"},"schema_version":"1.0"},"canonical_sha256":"8821764cb2cea82e5307f954a1581614fb0993b77b5e4f10cee20ef0b0fc0f5f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:48.725819Z","signature_b64":"H+X8OyAApAc+vD7EE/YiLwEJ/BcQy+bP3GkUA8HW3T/dUkwimOZtaxmds/ExuVwE7RVs1vFFZEuLM/+oOsifDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8821764cb2cea82e5307f954a1581614fb0993b77b5e4f10cee20ef0b0fc0f5f","last_reissued_at":"2026-05-17T23:48:48.725208Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:48.725208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.05701","source_version":1,"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:48:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"52AMhWP/ZXORPwWrn5IF9k7FpFHFXP1zuSaL9nfQA3izAUCr1TgG+JyKoUI7cuIfNZRkbVscETdp73zAlTSSBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T21:30:05.317572Z"},"content_sha256":"ad69528b2c248c9b2c8041d067b782052ec28fd61adda922a92b8f5a5d3b12c6","schema_version":"1.0","event_id":"sha256:ad69528b2c248c9b2c8041d067b782052ec28fd61adda922a92b8f5a5d3b12c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RAQXMTFSZ2UC4UYH7FKKCWAWCT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Inapproximability of the Discrete Witsenhausen Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Alex Olshevsky","submitted_at":"2019-04-11T14:02:15Z","abstract_excerpt":"We consider a discrete version of the Witsenhausen problem where all random variables are bounded and take on integer values. Our main goal is to understand the complexity of computing good strategies given the distributions for the initial state and second-stage noise as inputs to the problem. Following Papadimitriou and Tsitsiklis [1], who showed that computing the optimal solution is NP-complete, we construct a sequence of problem instances with the initial state uniform over a set of size $n$ and the noise uniform over a set of size at most $n^2$, such that finding a strategy whose cost is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05701","kind":"arxiv","version":1},"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:48:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kge48kUeAUDBO09RGRnGdgh5SIoK06hRhI7IXsI+/YTpkvARpkAa9B06AoFosPEfoewwz6+tXMsSLLDvXtt5Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T21:30:05.318040Z"},"content_sha256":"406337f24a9e35e978da7637218f395a9fe84ffc475839df983a64f690ce399c","schema_version":"1.0","event_id":"sha256:406337f24a9e35e978da7637218f395a9fe84ffc475839df983a64f690ce399c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RAQXMTFSZ2UC4UYH7FKKCWAWCT/bundle.json","state_url":"https://pith.science/pith/RAQXMTFSZ2UC4UYH7FKKCWAWCT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RAQXMTFSZ2UC4UYH7FKKCWAWCT/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-08-04T21:30:05Z","links":{"resolver":"https://pith.science/pith/RAQXMTFSZ2UC4UYH7FKKCWAWCT","bundle":"https://pith.science/pith/RAQXMTFSZ2UC4UYH7FKKCWAWCT/bundle.json","state":"https://pith.science/pith/RAQXMTFSZ2UC4UYH7FKKCWAWCT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RAQXMTFSZ2UC4UYH7FKKCWAWCT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RAQXMTFSZ2UC4UYH7FKKCWAWCT","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":"2415eb582c7568b035834c7b2fd619bcfad462c1b80420c37adcb101fde3c71e","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-04-11T14:02:15Z","title_canon_sha256":"703e4b20f885fa9e17c0f1e9ee22180fb72c0b3fc5606b2aebd24b3e1ccaded0"},"schema_version":"1.0","source":{"id":"1904.05701","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.05701","created_at":"2026-05-17T23:48:48Z"},{"alias_kind":"arxiv_version","alias_value":"1904.05701v1","created_at":"2026-05-17T23:48:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05701","created_at":"2026-05-17T23:48:48Z"},{"alias_kind":"pith_short_12","alias_value":"RAQXMTFSZ2UC","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RAQXMTFSZ2UC4UYH","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RAQXMTFS","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:406337f24a9e35e978da7637218f395a9fe84ffc475839df983a64f690ce399c","target":"graph","created_at":"2026-05-17T23:48:48Z","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 consider a discrete version of the Witsenhausen problem where all random variables are bounded and take on integer values. Our main goal is to understand the complexity of computing good strategies given the distributions for the initial state and second-stage noise as inputs to the problem. Following Papadimitriou and Tsitsiklis [1], who showed that computing the optimal solution is NP-complete, we construct a sequence of problem instances with the initial state uniform over a set of size $n$ and the noise uniform over a set of size at most $n^2$, such that finding a strategy whose cost is","authors_text":"Alex Olshevsky","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-04-11T14:02:15Z","title":"On the Inapproximability of the Discrete Witsenhausen Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05701","kind":"arxiv","version":1},"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:ad69528b2c248c9b2c8041d067b782052ec28fd61adda922a92b8f5a5d3b12c6","target":"record","created_at":"2026-05-17T23:48:48Z","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":"2415eb582c7568b035834c7b2fd619bcfad462c1b80420c37adcb101fde3c71e","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-04-11T14:02:15Z","title_canon_sha256":"703e4b20f885fa9e17c0f1e9ee22180fb72c0b3fc5606b2aebd24b3e1ccaded0"},"schema_version":"1.0","source":{"id":"1904.05701","kind":"arxiv","version":1}},"canonical_sha256":"8821764cb2cea82e5307f954a1581614fb0993b77b5e4f10cee20ef0b0fc0f5f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8821764cb2cea82e5307f954a1581614fb0993b77b5e4f10cee20ef0b0fc0f5f","first_computed_at":"2026-05-17T23:48:48.725208Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:48.725208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H+X8OyAApAc+vD7EE/YiLwEJ/BcQy+bP3GkUA8HW3T/dUkwimOZtaxmds/ExuVwE7RVs1vFFZEuLM/+oOsifDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:48.725819Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.05701","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad69528b2c248c9b2c8041d067b782052ec28fd61adda922a92b8f5a5d3b12c6","sha256:406337f24a9e35e978da7637218f395a9fe84ffc475839df983a64f690ce399c"],"state_sha256":"4d888082f7e75658cb7bde09c7e2217b149ab91af5a98577245e5a4e70ab0632"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lXhKwCxFIEV1FriebWqbz9y64rE0wzpV7bsoNrLJi6OAwfsjUaueoFGltidbbgyrrknWYW6VLAfdAd/sAFE7DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T21:30:05.322830Z","bundle_sha256":"f9c11db7ae0f9d062795958f50d7d119a99f7625503b6fab4f91b5f973a6cd87"}}