{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:JTHH4V6EHCEWHVIUC2ACVOAB2R","short_pith_number":"pith:JTHH4V6E","schema_version":"1.0","canonical_sha256":"4cce7e57c4388963d51416802ab801d4694e965770922ca44237c22aba1a3fbe","source":{"kind":"arxiv","id":"0910.1862","version":1},"attestation_state":"computed","paper":{"title":"The intersection of two halfspaces has high threshold degree","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-12T16:14:48Z","abstract_excerpt":"The threshold degree of a Boolean function f:{0,1}^n->{-1,+1} is the least degree of a real polynomial p such that f(x)=sgn p(x). We construct two halfspaces on {0,1}^n whose intersection has threshold degree Theta(sqrt n), an exponential improvement on previous lower bounds. This solves an open problem due to Klivans (2002) and rules out the use of perceptron-based techniques for PAC learning the intersection of two halfspaces, a central unresolved challenge in computational learning. We also prove that the intersection of two majority functions has threshold degree Omega(log n), which is tig"},"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":"0910.1862","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-10-12T16:14:48Z","cross_cats_sorted":[],"title_canon_sha256":"17032e10bd7cdec50a23458145cfa25a9085f965a662310bc54f0b2200ebb92e","abstract_canon_sha256":"f7dfaa2262fcff658235b1cd7a911e49aba81a395b1cfdf8fd667ab337f423f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:59.695959Z","signature_b64":"FdgC3511/LIw+Futsn7SGk/HpghFGGUpKE1XpWOozheCh1ZRs6MseUfoeS50xcW2Rj7iD0wxKCUy2CQzUiE+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4cce7e57c4388963d51416802ab801d4694e965770922ca44237c22aba1a3fbe","last_reissued_at":"2026-05-18T01:04:59.695456Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:59.695456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The intersection of two halfspaces has high threshold degree","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-12T16:14:48Z","abstract_excerpt":"The threshold degree of a Boolean function f:{0,1}^n->{-1,+1} is the least degree of a real polynomial p such that f(x)=sgn p(x). We construct two halfspaces on {0,1}^n whose intersection has threshold degree Theta(sqrt n), an exponential improvement on previous lower bounds. This solves an open problem due to Klivans (2002) and rules out the use of perceptron-based techniques for PAC learning the intersection of two halfspaces, a central unresolved challenge in computational learning. We also prove that the intersection of two majority functions has threshold degree Omega(log n), which is tig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.1862","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0910.1862","created_at":"2026-05-18T01:04:59.695560+00:00"},{"alias_kind":"arxiv_version","alias_value":"0910.1862v1","created_at":"2026-05-18T01:04:59.695560+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.1862","created_at":"2026-05-18T01:04:59.695560+00:00"},{"alias_kind":"pith_short_12","alias_value":"JTHH4V6EHCEW","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"JTHH4V6EHCEWHVIU","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"JTHH4V6E","created_at":"2026-05-18T12:26:00.592388+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/JTHH4V6EHCEWHVIUC2ACVOAB2R","json":"https://pith.science/pith/JTHH4V6EHCEWHVIUC2ACVOAB2R.json","graph_json":"https://pith.science/api/pith-number/JTHH4V6EHCEWHVIUC2ACVOAB2R/graph.json","events_json":"https://pith.science/api/pith-number/JTHH4V6EHCEWHVIUC2ACVOAB2R/events.json","paper":"https://pith.science/paper/JTHH4V6E"},"agent_actions":{"view_html":"https://pith.science/pith/JTHH4V6EHCEWHVIUC2ACVOAB2R","download_json":"https://pith.science/pith/JTHH4V6EHCEWHVIUC2ACVOAB2R.json","view_paper":"https://pith.science/paper/JTHH4V6E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0910.1862&json=true","fetch_graph":"https://pith.science/api/pith-number/JTHH4V6EHCEWHVIUC2ACVOAB2R/graph.json","fetch_events":"https://pith.science/api/pith-number/JTHH4V6EHCEWHVIUC2ACVOAB2R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JTHH4V6EHCEWHVIUC2ACVOAB2R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JTHH4V6EHCEWHVIUC2ACVOAB2R/action/storage_attestation","attest_author":"https://pith.science/pith/JTHH4V6EHCEWHVIUC2ACVOAB2R/action/author_attestation","sign_citation":"https://pith.science/pith/JTHH4V6EHCEWHVIUC2ACVOAB2R/action/citation_signature","submit_replication":"https://pith.science/pith/JTHH4V6EHCEWHVIUC2ACVOAB2R/action/replication_record"}},"created_at":"2026-05-18T01:04:59.695560+00:00","updated_at":"2026-05-18T01:04:59.695560+00:00"}