{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:35SMIH5WVR3GLVGVAVTOP3PNMM","short_pith_number":"pith:35SMIH5W","canonical_record":{"source":{"id":"2605.22666","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-21T16:08:52Z","cross_cats_sorted":["cs.LG","math.PR"],"title_canon_sha256":"0f552a1c771f36da19a982e2ef980de35cc0eb51974fd8dada05ccbcf2ca436b","abstract_canon_sha256":"7ddf3a87663d617c380777729314ec9f1344c72ef20356dc95c45b619b90fcfd"},"schema_version":"1.0"},"canonical_sha256":"df64c41fb6ac7665d4d50566e7eded6315588e081a1e30aad0de1230b29b1251","source":{"kind":"arxiv","id":"2605.22666","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.22666","created_at":"2026-05-22T02:04:49Z"},{"alias_kind":"arxiv_version","alias_value":"2605.22666v1","created_at":"2026-05-22T02:04:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22666","created_at":"2026-05-22T02:04:49Z"},{"alias_kind":"pith_short_12","alias_value":"35SMIH5WVR3G","created_at":"2026-05-22T02:04:49Z"},{"alias_kind":"pith_short_16","alias_value":"35SMIH5WVR3GLVGV","created_at":"2026-05-22T02:04:49Z"},{"alias_kind":"pith_short_8","alias_value":"35SMIH5W","created_at":"2026-05-22T02:04:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:35SMIH5WVR3GLVGVAVTOP3PNMM","target":"record","payload":{"canonical_record":{"source":{"id":"2605.22666","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-21T16:08:52Z","cross_cats_sorted":["cs.LG","math.PR"],"title_canon_sha256":"0f552a1c771f36da19a982e2ef980de35cc0eb51974fd8dada05ccbcf2ca436b","abstract_canon_sha256":"7ddf3a87663d617c380777729314ec9f1344c72ef20356dc95c45b619b90fcfd"},"schema_version":"1.0"},"canonical_sha256":"df64c41fb6ac7665d4d50566e7eded6315588e081a1e30aad0de1230b29b1251","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T02:04:49.216471Z","signature_b64":"LC/rQOoFrz+mcv3Mq6lncHaBMId2PY9/BK4SkHiVFlvSXNqqIBjAb+s3T9FOJDHmqKCqouPAqHOrh8UWRELIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df64c41fb6ac7665d4d50566e7eded6315588e081a1e30aad0de1230b29b1251","last_reissued_at":"2026-05-22T02:04:49.215376Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T02:04:49.215376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.22666","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-22T02:04:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SWSFLrDPD/t8ZR1MKxW0JpqqE+Kh1Mb3MPZvOZk5HZ7wzGRmy44Wh3xbO7931+0q/DvxzuBYEErcMUjjoeOPAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:50:50.210888Z"},"content_sha256":"e11a5661d8041ee54dd90df2998f4a26519d1f2c701b21c10a5ee695b059f4b6","schema_version":"1.0","event_id":"sha256:e11a5661d8041ee54dd90df2998f4a26519d1f2c701b21c10a5ee695b059f4b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:35SMIH5WVR3GLVGVAVTOP3PNMM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Holographic functions and neural networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.PR"],"primary_cat":"math.CO","authors_text":"Balazs Szegedy","submitted_at":"2026-05-21T16:08:52Z","abstract_excerpt":"A fuzzy Boolean function is a map $f:\\cube^n\\to [0,1]$, where $n\\in\\mathbb N$. We introduce and compare three ways of saying that such a function has bounded complexity. The first is a sampling property: the value $f(x)$ can be recovered, up to small error and with high probability, from the values of a bounded number of randomly chosen coordinates of $x$. We call this the holographic property. The second is a structural property: $f$ is uniformly close to a bounded-degree polynomial in boundedly many bounded linear coordinate forms. The third is computational: $f$ is uniformly close to the ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22666","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.22666/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-05-22T02:04:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qLZuSL+GtjaHw2Q4I3rld5it4xXXTa+694iSUzF5tsll46l1WtIYJaxrbILBJfG/6zkbao/zYflGr4hQiglMBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:50:50.211653Z"},"content_sha256":"46ed9f6a038212828da2e67e22ec0fa9ca34b82aaf990f55c27b037054ed2e6c","schema_version":"1.0","event_id":"sha256:46ed9f6a038212828da2e67e22ec0fa9ca34b82aaf990f55c27b037054ed2e6c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/35SMIH5WVR3GLVGVAVTOP3PNMM/bundle.json","state_url":"https://pith.science/pith/35SMIH5WVR3GLVGVAVTOP3PNMM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/35SMIH5WVR3GLVGVAVTOP3PNMM/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-10T23:50:50Z","links":{"resolver":"https://pith.science/pith/35SMIH5WVR3GLVGVAVTOP3PNMM","bundle":"https://pith.science/pith/35SMIH5WVR3GLVGVAVTOP3PNMM/bundle.json","state":"https://pith.science/pith/35SMIH5WVR3GLVGVAVTOP3PNMM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/35SMIH5WVR3GLVGVAVTOP3PNMM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:35SMIH5WVR3GLVGVAVTOP3PNMM","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":"7ddf3a87663d617c380777729314ec9f1344c72ef20356dc95c45b619b90fcfd","cross_cats_sorted":["cs.LG","math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-21T16:08:52Z","title_canon_sha256":"0f552a1c771f36da19a982e2ef980de35cc0eb51974fd8dada05ccbcf2ca436b"},"schema_version":"1.0","source":{"id":"2605.22666","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.22666","created_at":"2026-05-22T02:04:49Z"},{"alias_kind":"arxiv_version","alias_value":"2605.22666v1","created_at":"2026-05-22T02:04:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22666","created_at":"2026-05-22T02:04:49Z"},{"alias_kind":"pith_short_12","alias_value":"35SMIH5WVR3G","created_at":"2026-05-22T02:04:49Z"},{"alias_kind":"pith_short_16","alias_value":"35SMIH5WVR3GLVGV","created_at":"2026-05-22T02:04:49Z"},{"alias_kind":"pith_short_8","alias_value":"35SMIH5W","created_at":"2026-05-22T02:04:49Z"}],"graph_snapshots":[{"event_id":"sha256:46ed9f6a038212828da2e67e22ec0fa9ca34b82aaf990f55c27b037054ed2e6c","target":"graph","created_at":"2026-05-22T02:04:49Z","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/2605.22666/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A fuzzy Boolean function is a map $f:\\cube^n\\to [0,1]$, where $n\\in\\mathbb N$. We introduce and compare three ways of saying that such a function has bounded complexity. The first is a sampling property: the value $f(x)$ can be recovered, up to small error and with high probability, from the values of a bounded number of randomly chosen coordinates of $x$. We call this the holographic property. The second is a structural property: $f$ is uniformly close to a bounded-degree polynomial in boundedly many bounded linear coordinate forms. The third is computational: $f$ is uniformly close to the ou","authors_text":"Balazs Szegedy","cross_cats":["cs.LG","math.PR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-21T16:08:52Z","title":"Holographic functions and neural networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22666","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:e11a5661d8041ee54dd90df2998f4a26519d1f2c701b21c10a5ee695b059f4b6","target":"record","created_at":"2026-05-22T02:04:49Z","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":"7ddf3a87663d617c380777729314ec9f1344c72ef20356dc95c45b619b90fcfd","cross_cats_sorted":["cs.LG","math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-21T16:08:52Z","title_canon_sha256":"0f552a1c771f36da19a982e2ef980de35cc0eb51974fd8dada05ccbcf2ca436b"},"schema_version":"1.0","source":{"id":"2605.22666","kind":"arxiv","version":1}},"canonical_sha256":"df64c41fb6ac7665d4d50566e7eded6315588e081a1e30aad0de1230b29b1251","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df64c41fb6ac7665d4d50566e7eded6315588e081a1e30aad0de1230b29b1251","first_computed_at":"2026-05-22T02:04:49.215376Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T02:04:49.215376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LC/rQOoFrz+mcv3Mq6lncHaBMId2PY9/BK4SkHiVFlvSXNqqIBjAb+s3T9FOJDHmqKCqouPAqHOrh8UWRELIBw==","signature_status":"signed_v1","signed_at":"2026-05-22T02:04:49.216471Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.22666","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e11a5661d8041ee54dd90df2998f4a26519d1f2c701b21c10a5ee695b059f4b6","sha256:46ed9f6a038212828da2e67e22ec0fa9ca34b82aaf990f55c27b037054ed2e6c"],"state_sha256":"c26e127079c011240ec20ecffd341452dc31ed2e71a3848f8b7dec8ff903a9fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2CAYnFkxw3xByLDNAe+fV6yMULAurSr6btQ7Jv1Wtjbilvng7W+7WJ8bzoYuv58ktYfoZdFcyg2TJDG039yaAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T23:50:50.216416Z","bundle_sha256":"00dea9492a3ed0b5330137bb2dbe750d0dea1b2cf7361bbe42c217e9420e420e"}}