{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2L65VLF4GY6WT6TSS3NJXOP5IJ","short_pith_number":"pith:2L65VLF4","schema_version":"1.0","canonical_sha256":"d2fddaacbc363d69fa7296da9bb9fd426bdc10e955f0b3ffecb29188b7aaa556","source":{"kind":"arxiv","id":"1802.09121","version":1},"attestation_state":"computed","paper":{"title":"Limits on representing Boolean functions by linear combinations of simple functions: thresholds, ReLUs, and low-degree polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.NE"],"primary_cat":"cs.CC","authors_text":"R. Ryan Williams","submitted_at":"2018-02-26T01:30:21Z","abstract_excerpt":"We consider the problem of representing Boolean functions exactly by \"sparse\" linear combinations (over $\\mathbb{R}$) of functions from some \"simple\" class ${\\cal C}$. In particular, given ${\\cal C}$ we are interested in finding low-complexity functions lacking sparse representations. When ${\\cal C}$ is the set of PARITY functions or the set of conjunctions, this sort of problem has a well-understood answer, the problem becomes interesting when ${\\cal C}$ is \"overcomplete\" and the set of functions is not linearly independent. We focus on the cases where ${\\cal C}$ is the set of linear threshol"},"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":"1802.09121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-02-26T01:30:21Z","cross_cats_sorted":["cs.DM","cs.NE"],"title_canon_sha256":"249b11f556bb1967d27cfe38a039cbb168776a9ee84cddc992a6a28217cf24ef","abstract_canon_sha256":"14b9a877ff9cd159d7770c00be58456470c408365a00b380443d0f54166bdc17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:34.711607Z","signature_b64":"SCUi3Jq3etuY6I/E2kxhV4Ly9eUGLiJbrsHtP97n1Fqqyuxb0dNzHJMyIiLdhScsIxa66kBG2ky+Q93u81LjBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2fddaacbc363d69fa7296da9bb9fd426bdc10e955f0b3ffecb29188b7aaa556","last_reissued_at":"2026-05-18T00:22:34.711052Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:34.711052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Limits on representing Boolean functions by linear combinations of simple functions: thresholds, ReLUs, and low-degree polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.NE"],"primary_cat":"cs.CC","authors_text":"R. Ryan Williams","submitted_at":"2018-02-26T01:30:21Z","abstract_excerpt":"We consider the problem of representing Boolean functions exactly by \"sparse\" linear combinations (over $\\mathbb{R}$) of functions from some \"simple\" class ${\\cal C}$. In particular, given ${\\cal C}$ we are interested in finding low-complexity functions lacking sparse representations. When ${\\cal C}$ is the set of PARITY functions or the set of conjunctions, this sort of problem has a well-understood answer, the problem becomes interesting when ${\\cal C}$ is \"overcomplete\" and the set of functions is not linearly independent. We focus on the cases where ${\\cal C}$ is the set of linear threshol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09121","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":"1802.09121","created_at":"2026-05-18T00:22:34.711132+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.09121v1","created_at":"2026-05-18T00:22:34.711132+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09121","created_at":"2026-05-18T00:22:34.711132+00:00"},{"alias_kind":"pith_short_12","alias_value":"2L65VLF4GY6W","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2L65VLF4GY6WT6TS","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2L65VLF4","created_at":"2026-05-18T12:32:02.567920+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/2L65VLF4GY6WT6TSS3NJXOP5IJ","json":"https://pith.science/pith/2L65VLF4GY6WT6TSS3NJXOP5IJ.json","graph_json":"https://pith.science/api/pith-number/2L65VLF4GY6WT6TSS3NJXOP5IJ/graph.json","events_json":"https://pith.science/api/pith-number/2L65VLF4GY6WT6TSS3NJXOP5IJ/events.json","paper":"https://pith.science/paper/2L65VLF4"},"agent_actions":{"view_html":"https://pith.science/pith/2L65VLF4GY6WT6TSS3NJXOP5IJ","download_json":"https://pith.science/pith/2L65VLF4GY6WT6TSS3NJXOP5IJ.json","view_paper":"https://pith.science/paper/2L65VLF4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.09121&json=true","fetch_graph":"https://pith.science/api/pith-number/2L65VLF4GY6WT6TSS3NJXOP5IJ/graph.json","fetch_events":"https://pith.science/api/pith-number/2L65VLF4GY6WT6TSS3NJXOP5IJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2L65VLF4GY6WT6TSS3NJXOP5IJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2L65VLF4GY6WT6TSS3NJXOP5IJ/action/storage_attestation","attest_author":"https://pith.science/pith/2L65VLF4GY6WT6TSS3NJXOP5IJ/action/author_attestation","sign_citation":"https://pith.science/pith/2L65VLF4GY6WT6TSS3NJXOP5IJ/action/citation_signature","submit_replication":"https://pith.science/pith/2L65VLF4GY6WT6TSS3NJXOP5IJ/action/replication_record"}},"created_at":"2026-05-18T00:22:34.711132+00:00","updated_at":"2026-05-18T00:22:34.711132+00:00"}