{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:6YULSUQEYKOOYDWUDM2HPS3CSJ","short_pith_number":"pith:6YULSUQE","canonical_record":{"source":{"id":"0910.4224","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-10-22T04:05:31Z","cross_cats_sorted":[],"title_canon_sha256":"4e7d9939144f403110272d189998835e034a858ec4c502d63bf558b9add3d7da","abstract_canon_sha256":"e8f7cb0ee11c2b2b4f5ba6ebebbe3ddef1d1faae75dbea1b0c34c2295751ddd3"},"schema_version":"1.0"},"canonical_sha256":"f628b95204c29cec0ed41b3477cb629257bfa24b4eb7633197773bfcb45bcfe5","source":{"kind":"arxiv","id":"0910.4224","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.4224","created_at":"2026-07-04T17:22:18Z"},{"alias_kind":"arxiv_version","alias_value":"0910.4224v2","created_at":"2026-07-04T17:22:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.4224","created_at":"2026-07-04T17:22:18Z"},{"alias_kind":"pith_short_12","alias_value":"6YULSUQEYKOO","created_at":"2026-07-04T17:22:18Z"},{"alias_kind":"pith_short_16","alias_value":"6YULSUQEYKOOYDWU","created_at":"2026-07-04T17:22:18Z"},{"alias_kind":"pith_short_8","alias_value":"6YULSUQE","created_at":"2026-07-04T17:22:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:6YULSUQEYKOOYDWUDM2HPS3CSJ","target":"record","payload":{"canonical_record":{"source":{"id":"0910.4224","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-10-22T04:05:31Z","cross_cats_sorted":[],"title_canon_sha256":"4e7d9939144f403110272d189998835e034a858ec4c502d63bf558b9add3d7da","abstract_canon_sha256":"e8f7cb0ee11c2b2b4f5ba6ebebbe3ddef1d1faae75dbea1b0c34c2295751ddd3"},"schema_version":"1.0"},"canonical_sha256":"f628b95204c29cec0ed41b3477cb629257bfa24b4eb7633197773bfcb45bcfe5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:22:18.685836Z","signature_b64":"HZvrMTUgDD4bVVwn6qvYwNxUFrkiUXQOTVoZA/NvrUJnnyY9LqiHXWoxZR3dlPk4L+XrlzLT26jAsXMLL9/kAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f628b95204c29cec0ed41b3477cb629257bfa24b4eb7633197773bfcb45bcfe5","last_reissued_at":"2026-07-04T17:22:18.685397Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:22:18.685397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0910.4224","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-07-04T17:22:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aOxyrsd8qTdCynwCrN+kQ+HYq/tIpYzVykmQfoXze7g2kyIVeI/VfK5Kw0Z9RKGVJ7i+E6XvXuON4ty2uRp+CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T12:14:37.121495Z"},"content_sha256":"587d2097c26a07fa22d0c558fbe6d3b7c99c94b1845b4364b808e5090019765c","schema_version":"1.0","event_id":"sha256:587d2097c26a07fa22d0c558fbe6d3b7c99c94b1845b4364b808e5090019765c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:6YULSUQEYKOOYDWUDM2HPS3CSJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal bounds for sign-representing the intersection of two halfspaces by polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alexander A. Sherstov","submitted_at":"2009-10-22T04:05:31Z","abstract_excerpt":"The threshold degree of a function f:{0,1}^n->{-1,+1} is the least degree of a real polynomial p with f(x)=sgn p(x). We prove that the intersection of two halfspaces on {0,1}^n has threshold degree Omega(n), which matches the trivial upper bound and completely answers a question due to Klivans (2002). The best previous lower bound was Omega(sqrt n). Our result shows that the intersection of two halfspaces on {0,1}^n only admits a trivial 2^{Theta(n)}-time learning algorithm based on sign-representation by polynomials, unlike the advances achieved in PAC learning DNF formulas and read-once Bool"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.4224","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0910.4224/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T17:22:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U/71fsiKFNiSsZLB6nHkZ6G+4KjeL76oMiK77k+rkObnU8l4nA7lobPBFkMvQ5WtqLo9UVwO6VqvnARn/LmRAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T12:14:37.122073Z"},"content_sha256":"9e1f1e36181de1f2c5004638d2ca2733904cd36f576c0e37dd91efb7a58d148f","schema_version":"1.0","event_id":"sha256:9e1f1e36181de1f2c5004638d2ca2733904cd36f576c0e37dd91efb7a58d148f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6YULSUQEYKOOYDWUDM2HPS3CSJ/bundle.json","state_url":"https://pith.science/pith/6YULSUQEYKOOYDWUDM2HPS3CSJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6YULSUQEYKOOYDWUDM2HPS3CSJ/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-05T12:14:37Z","links":{"resolver":"https://pith.science/pith/6YULSUQEYKOOYDWUDM2HPS3CSJ","bundle":"https://pith.science/pith/6YULSUQEYKOOYDWUDM2HPS3CSJ/bundle.json","state":"https://pith.science/pith/6YULSUQEYKOOYDWUDM2HPS3CSJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6YULSUQEYKOOYDWUDM2HPS3CSJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:6YULSUQEYKOOYDWUDM2HPS3CSJ","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":"e8f7cb0ee11c2b2b4f5ba6ebebbe3ddef1d1faae75dbea1b0c34c2295751ddd3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-10-22T04:05:31Z","title_canon_sha256":"4e7d9939144f403110272d189998835e034a858ec4c502d63bf558b9add3d7da"},"schema_version":"1.0","source":{"id":"0910.4224","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.4224","created_at":"2026-07-04T17:22:18Z"},{"alias_kind":"arxiv_version","alias_value":"0910.4224v2","created_at":"2026-07-04T17:22:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.4224","created_at":"2026-07-04T17:22:18Z"},{"alias_kind":"pith_short_12","alias_value":"6YULSUQEYKOO","created_at":"2026-07-04T17:22:18Z"},{"alias_kind":"pith_short_16","alias_value":"6YULSUQEYKOOYDWU","created_at":"2026-07-04T17:22:18Z"},{"alias_kind":"pith_short_8","alias_value":"6YULSUQE","created_at":"2026-07-04T17:22:18Z"}],"graph_snapshots":[{"event_id":"sha256:9e1f1e36181de1f2c5004638d2ca2733904cd36f576c0e37dd91efb7a58d148f","target":"graph","created_at":"2026-07-04T17:22:18Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0910.4224/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The threshold degree of a function f:{0,1}^n->{-1,+1} is the least degree of a real polynomial p with f(x)=sgn p(x). We prove that the intersection of two halfspaces on {0,1}^n has threshold degree Omega(n), which matches the trivial upper bound and completely answers a question due to Klivans (2002). The best previous lower bound was Omega(sqrt n). Our result shows that the intersection of two halfspaces on {0,1}^n only admits a trivial 2^{Theta(n)}-time learning algorithm based on sign-representation by polynomials, unlike the advances achieved in PAC learning DNF formulas and read-once Bool","authors_text":"Alexander A. Sherstov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-10-22T04:05:31Z","title":"Optimal bounds for sign-representing the intersection of two halfspaces by polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.4224","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:587d2097c26a07fa22d0c558fbe6d3b7c99c94b1845b4364b808e5090019765c","target":"record","created_at":"2026-07-04T17:22:18Z","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":"e8f7cb0ee11c2b2b4f5ba6ebebbe3ddef1d1faae75dbea1b0c34c2295751ddd3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-10-22T04:05:31Z","title_canon_sha256":"4e7d9939144f403110272d189998835e034a858ec4c502d63bf558b9add3d7da"},"schema_version":"1.0","source":{"id":"0910.4224","kind":"arxiv","version":2}},"canonical_sha256":"f628b95204c29cec0ed41b3477cb629257bfa24b4eb7633197773bfcb45bcfe5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f628b95204c29cec0ed41b3477cb629257bfa24b4eb7633197773bfcb45bcfe5","first_computed_at":"2026-07-04T17:22:18.685397Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T17:22:18.685397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HZvrMTUgDD4bVVwn6qvYwNxUFrkiUXQOTVoZA/NvrUJnnyY9LqiHXWoxZR3dlPk4L+XrlzLT26jAsXMLL9/kAA==","signature_status":"signed_v1","signed_at":"2026-07-04T17:22:18.685836Z","signed_message":"canonical_sha256_bytes"},"source_id":"0910.4224","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:587d2097c26a07fa22d0c558fbe6d3b7c99c94b1845b4364b808e5090019765c","sha256:9e1f1e36181de1f2c5004638d2ca2733904cd36f576c0e37dd91efb7a58d148f"],"state_sha256":"d8cfda5782798b7f50836a86d4010d051674687e6cfa407b612d24f0982d6b01"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s7KiNdYAuvRLbFGQDsqYvjW7LnczAb/Vfj4ALWZ87acjQb1k4eg9+KJUr2NzARvrNbrNtsge6C6zKe9dK6q9CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T12:14:37.125137Z","bundle_sha256":"b0f5a3c315e069418fd703774f5318c22599bd537d4a5a388063fd95b8959461"}}