{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2L65VLF4GY6WT6TSS3NJXOP5IJ","short_pith_number":"pith:2L65VLF4","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"},"canonical_sha256":"d2fddaacbc363d69fa7296da9bb9fd426bdc10e955f0b3ffecb29188b7aaa556","source":{"kind":"arxiv","id":"1802.09121","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09121","created_at":"2026-05-18T00:22:34Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09121v1","created_at":"2026-05-18T00:22:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09121","created_at":"2026-05-18T00:22:34Z"},{"alias_kind":"pith_short_12","alias_value":"2L65VLF4GY6W","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2L65VLF4GY6WT6TS","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2L65VLF4","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2L65VLF4GY6WT6TSS3NJXOP5IJ","target":"record","payload":{"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"},"canonical_sha256":"d2fddaacbc363d69fa7296da9bb9fd426bdc10e955f0b3ffecb29188b7aaa556","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"},"source_kind":"arxiv","source_id":"1802.09121","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-18T00:22:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t0RXVFH0Qdl+1aFy9PHS56rpz/d8Tz8VwpDBbuie9SoKy/gXgheDtplTpR7mP57epCVCAPhWpsMMOTCN80zyCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T03:14:21.305289Z"},"content_sha256":"dbb6d387c97db0dd5900ffa3256e0ce83b60d976bb13cd71f268da2d0a1a3f7a","schema_version":"1.0","event_id":"sha256:dbb6d387c97db0dd5900ffa3256e0ce83b60d976bb13cd71f268da2d0a1a3f7a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2L65VLF4GY6WT6TSS3NJXOP5IJ","target":"graph","payload":{"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"},"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-18T00:22:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WzT03Kk56epM3y1IAF+fZEhjymcAgFwMKzDSR9Pxcz/faJNqjgjoJtotnLNsPARaB1Zba2QpGgCNngsBHsxnAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T03:14:21.305650Z"},"content_sha256":"45bb3fdc0c45ba6293c20c88885e762e63529c153f467cec5fcd54b97b782ea9","schema_version":"1.0","event_id":"sha256:45bb3fdc0c45ba6293c20c88885e762e63529c153f467cec5fcd54b97b782ea9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2L65VLF4GY6WT6TSS3NJXOP5IJ/bundle.json","state_url":"https://pith.science/pith/2L65VLF4GY6WT6TSS3NJXOP5IJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2L65VLF4GY6WT6TSS3NJXOP5IJ/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-06-29T03:14:21Z","links":{"resolver":"https://pith.science/pith/2L65VLF4GY6WT6TSS3NJXOP5IJ","bundle":"https://pith.science/pith/2L65VLF4GY6WT6TSS3NJXOP5IJ/bundle.json","state":"https://pith.science/pith/2L65VLF4GY6WT6TSS3NJXOP5IJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2L65VLF4GY6WT6TSS3NJXOP5IJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2L65VLF4GY6WT6TSS3NJXOP5IJ","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":"14b9a877ff9cd159d7770c00be58456470c408365a00b380443d0f54166bdc17","cross_cats_sorted":["cs.DM","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-02-26T01:30:21Z","title_canon_sha256":"249b11f556bb1967d27cfe38a039cbb168776a9ee84cddc992a6a28217cf24ef"},"schema_version":"1.0","source":{"id":"1802.09121","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09121","created_at":"2026-05-18T00:22:34Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09121v1","created_at":"2026-05-18T00:22:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09121","created_at":"2026-05-18T00:22:34Z"},{"alias_kind":"pith_short_12","alias_value":"2L65VLF4GY6W","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2L65VLF4GY6WT6TS","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2L65VLF4","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:45bb3fdc0c45ba6293c20c88885e762e63529c153f467cec5fcd54b97b782ea9","target":"graph","created_at":"2026-05-18T00:22:34Z","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 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","authors_text":"R. Ryan Williams","cross_cats":["cs.DM","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-02-26T01:30:21Z","title":"Limits on representing Boolean functions by linear combinations of simple functions: thresholds, ReLUs, and low-degree polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09121","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:dbb6d387c97db0dd5900ffa3256e0ce83b60d976bb13cd71f268da2d0a1a3f7a","target":"record","created_at":"2026-05-18T00:22:34Z","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":"14b9a877ff9cd159d7770c00be58456470c408365a00b380443d0f54166bdc17","cross_cats_sorted":["cs.DM","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-02-26T01:30:21Z","title_canon_sha256":"249b11f556bb1967d27cfe38a039cbb168776a9ee84cddc992a6a28217cf24ef"},"schema_version":"1.0","source":{"id":"1802.09121","kind":"arxiv","version":1}},"canonical_sha256":"d2fddaacbc363d69fa7296da9bb9fd426bdc10e955f0b3ffecb29188b7aaa556","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2fddaacbc363d69fa7296da9bb9fd426bdc10e955f0b3ffecb29188b7aaa556","first_computed_at":"2026-05-18T00:22:34.711052Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:34.711052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SCUi3Jq3etuY6I/E2kxhV4Ly9eUGLiJbrsHtP97n1Fqqyuxb0dNzHJMyIiLdhScsIxa66kBG2ky+Q93u81LjBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:34.711607Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.09121","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dbb6d387c97db0dd5900ffa3256e0ce83b60d976bb13cd71f268da2d0a1a3f7a","sha256:45bb3fdc0c45ba6293c20c88885e762e63529c153f467cec5fcd54b97b782ea9"],"state_sha256":"1a80d4aa1b56c1ad1f5c2268f034b894b5522e779672edd744b224b630267cd3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WkE5j+MSb1FafxkqETA2Uz6SyY6oLn187LIDPoGd4ISnPqhGklxBh5qBpbHBMlDI4j5GJHPobIxlC0c9oMnDCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T03:14:21.307499Z","bundle_sha256":"10f2ed66f4f17dcb7f211bc8a8f534bfd3f37352807b17a14ee36c0ce274bce3"}}