{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VU775KAZRG2S7KSSNPDTW2PBRU","short_pith_number":"pith:VU775KAZ","canonical_record":{"source":{"id":"1902.01765","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-05T16:15:45Z","cross_cats_sorted":[],"title_canon_sha256":"d19ef73f05669f57960d9eec583160e9662a0103587d425daa28b1c44034f13e","abstract_canon_sha256":"a7284cada6e51377446e3d89d3ff34923ee1d18e5a7d2fa9b7703a80f812e853"},"schema_version":"1.0"},"canonical_sha256":"ad3ffea81989b52faa526bc73b69e18d333ba953ad4aeb85d3ecde6faac6fd6b","source":{"kind":"arxiv","id":"1902.01765","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01765","created_at":"2026-05-17T23:54:46Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01765v1","created_at":"2026-05-17T23:54:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01765","created_at":"2026-05-17T23:54:46Z"},{"alias_kind":"pith_short_12","alias_value":"VU775KAZRG2S","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VU775KAZRG2S7KSS","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VU775KAZ","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VU775KAZRG2S7KSSNPDTW2PBRU","target":"record","payload":{"canonical_record":{"source":{"id":"1902.01765","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-05T16:15:45Z","cross_cats_sorted":[],"title_canon_sha256":"d19ef73f05669f57960d9eec583160e9662a0103587d425daa28b1c44034f13e","abstract_canon_sha256":"a7284cada6e51377446e3d89d3ff34923ee1d18e5a7d2fa9b7703a80f812e853"},"schema_version":"1.0"},"canonical_sha256":"ad3ffea81989b52faa526bc73b69e18d333ba953ad4aeb85d3ecde6faac6fd6b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:46.795643Z","signature_b64":"VHur4EKIUKeAyYnQTxkKcqur+XD4OHYLcAf7ANL+hXyVpDXa/8N5h3QlGtxXLX1OsSQEFDqoz+TH7zmIkfRkAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad3ffea81989b52faa526bc73b69e18d333ba953ad4aeb85d3ecde6faac6fd6b","last_reissued_at":"2026-05-17T23:54:46.795052Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:46.795052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.01765","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:54:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"++l/Z7GCNONdIS4cmqzITEh7m4diXY2xVKo8nwYKaGDYtARleGnJaGj5iT0UGsRhCNxolmi0h6O1Bn+AFBdRCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T10:32:19.121304Z"},"content_sha256":"b355eb05b10bdbe729eb31f0c1b9b549ce59c62d0a9e43b3f8a405083462a3ee","schema_version":"1.0","event_id":"sha256:b355eb05b10bdbe729eb31f0c1b9b549ce59c62d0a9e43b3f8a405083462a3ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VU775KAZRG2S7KSSNPDTW2PBRU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Hardest Halfspace","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alexander A. Sherstov","submitted_at":"2019-02-05T16:15:45Z","abstract_excerpt":"We study the approximation of halfspaces $h:\\{0,1\\}^n\\to\\{0,1\\}$ in the infinity norm by polynomials and rational functions of any given degree. Our main result is an explicit construction of the \"hardest\" halfspace, for which we prove polynomial and rational approximation lower bounds that match the trivial upper bounds achievable for all halfspaces. This completes a lengthy line of work started by Myhill and Kautz (1961).\n  As an application, we construct a communication problem that achieves essentially the largest possible separation, of $O(n)$ versus $2^{-\\Omega(n)},$ between the sign-ran"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01765","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:54:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RbcXBtEKxS7o1Ersz2lBOlYdTNJMfLEf0WaFHuAOgyGXhJpZa+rWQotokzyEfhQ65rzarVEix/SqudIIKzdDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T10:32:19.121671Z"},"content_sha256":"4fe23a9647717f2de6379846cbcf6067cb2b3c34421003b3ddcd6c3426f65cb2","schema_version":"1.0","event_id":"sha256:4fe23a9647717f2de6379846cbcf6067cb2b3c34421003b3ddcd6c3426f65cb2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VU775KAZRG2S7KSSNPDTW2PBRU/bundle.json","state_url":"https://pith.science/pith/VU775KAZRG2S7KSSNPDTW2PBRU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VU775KAZRG2S7KSSNPDTW2PBRU/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-07-05T10:32:19Z","links":{"resolver":"https://pith.science/pith/VU775KAZRG2S7KSSNPDTW2PBRU","bundle":"https://pith.science/pith/VU775KAZRG2S7KSSNPDTW2PBRU/bundle.json","state":"https://pith.science/pith/VU775KAZRG2S7KSSNPDTW2PBRU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VU775KAZRG2S7KSSNPDTW2PBRU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VU775KAZRG2S7KSSNPDTW2PBRU","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":"a7284cada6e51377446e3d89d3ff34923ee1d18e5a7d2fa9b7703a80f812e853","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-05T16:15:45Z","title_canon_sha256":"d19ef73f05669f57960d9eec583160e9662a0103587d425daa28b1c44034f13e"},"schema_version":"1.0","source":{"id":"1902.01765","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01765","created_at":"2026-05-17T23:54:46Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01765v1","created_at":"2026-05-17T23:54:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01765","created_at":"2026-05-17T23:54:46Z"},{"alias_kind":"pith_short_12","alias_value":"VU775KAZRG2S","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VU775KAZRG2S7KSS","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VU775KAZ","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:4fe23a9647717f2de6379846cbcf6067cb2b3c34421003b3ddcd6c3426f65cb2","target":"graph","created_at":"2026-05-17T23:54:46Z","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 the approximation of halfspaces $h:\\{0,1\\}^n\\to\\{0,1\\}$ in the infinity norm by polynomials and rational functions of any given degree. Our main result is an explicit construction of the \"hardest\" halfspace, for which we prove polynomial and rational approximation lower bounds that match the trivial upper bounds achievable for all halfspaces. This completes a lengthy line of work started by Myhill and Kautz (1961).\n  As an application, we construct a communication problem that achieves essentially the largest possible separation, of $O(n)$ versus $2^{-\\Omega(n)},$ between the sign-ran","authors_text":"Alexander A. Sherstov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-05T16:15:45Z","title":"The Hardest Halfspace"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01765","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:b355eb05b10bdbe729eb31f0c1b9b549ce59c62d0a9e43b3f8a405083462a3ee","target":"record","created_at":"2026-05-17T23:54:46Z","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":"a7284cada6e51377446e3d89d3ff34923ee1d18e5a7d2fa9b7703a80f812e853","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-05T16:15:45Z","title_canon_sha256":"d19ef73f05669f57960d9eec583160e9662a0103587d425daa28b1c44034f13e"},"schema_version":"1.0","source":{"id":"1902.01765","kind":"arxiv","version":1}},"canonical_sha256":"ad3ffea81989b52faa526bc73b69e18d333ba953ad4aeb85d3ecde6faac6fd6b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad3ffea81989b52faa526bc73b69e18d333ba953ad4aeb85d3ecde6faac6fd6b","first_computed_at":"2026-05-17T23:54:46.795052Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:46.795052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VHur4EKIUKeAyYnQTxkKcqur+XD4OHYLcAf7ANL+hXyVpDXa/8N5h3QlGtxXLX1OsSQEFDqoz+TH7zmIkfRkAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:46.795643Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.01765","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b355eb05b10bdbe729eb31f0c1b9b549ce59c62d0a9e43b3f8a405083462a3ee","sha256:4fe23a9647717f2de6379846cbcf6067cb2b3c34421003b3ddcd6c3426f65cb2"],"state_sha256":"e4da6a2cc8f1d61dc166b8f6aba9700c9c98bad68bc82fcba774cb6e40007776"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RkneTjQ0Xdxp/peFzYC9Op+lssrwD6FRln33phR6RYYSVXjijYhTHeovAGhZCMFZiipzWP96WF4Ih/l5Q5LOAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T10:32:19.124048Z","bundle_sha256":"9f6026122fdcba62705aea10fe191cbb8f00ae7755800639c2c0fe446b91e8f1"}}