{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:RZ5PZCITN7HQI75FTIMIMFFEAY","short_pith_number":"pith:RZ5PZCIT","canonical_record":{"source":{"id":"2112.09181","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-12-16T20:10:56Z","cross_cats_sorted":["cs.IT","cs.NA","math.IT","math.NA"],"title_canon_sha256":"c16828f8aaf25f3c5b5879bff64bc7b95e47b1739fb227682afeba2e9246006d","abstract_canon_sha256":"24ae6ca19b4af16656bc56bf0963137da5bce16eef811bc7a250f44ef5831d23"},"schema_version":"1.0"},"canonical_sha256":"8e7afc89136fcf047fa59a188614a406118fa029249c7f2b989c2b21919724fe","source":{"kind":"arxiv","id":"2112.09181","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.09181","created_at":"2026-07-05T05:51:39Z"},{"alias_kind":"arxiv_version","alias_value":"2112.09181v2","created_at":"2026-07-05T05:51:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.09181","created_at":"2026-07-05T05:51:39Z"},{"alias_kind":"pith_short_12","alias_value":"RZ5PZCITN7HQ","created_at":"2026-07-05T05:51:39Z"},{"alias_kind":"pith_short_16","alias_value":"RZ5PZCITN7HQI75F","created_at":"2026-07-05T05:51:39Z"},{"alias_kind":"pith_short_8","alias_value":"RZ5PZCIT","created_at":"2026-07-05T05:51:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:RZ5PZCITN7HQI75FTIMIMFFEAY","target":"record","payload":{"canonical_record":{"source":{"id":"2112.09181","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-12-16T20:10:56Z","cross_cats_sorted":["cs.IT","cs.NA","math.IT","math.NA"],"title_canon_sha256":"c16828f8aaf25f3c5b5879bff64bc7b95e47b1739fb227682afeba2e9246006d","abstract_canon_sha256":"24ae6ca19b4af16656bc56bf0963137da5bce16eef811bc7a250f44ef5831d23"},"schema_version":"1.0"},"canonical_sha256":"8e7afc89136fcf047fa59a188614a406118fa029249c7f2b989c2b21919724fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:51:39.054399Z","signature_b64":"BPrAZBFf14A1EnL4fkQpmOwR9oyKZUVxqVJETjlCa3Ofos6Xp0mc376+Zrx5BWaT2oTFKr/6PdommXVLAyhABQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e7afc89136fcf047fa59a188614a406118fa029249c7f2b989c2b21919724fe","last_reissued_at":"2026-07-05T05:51:39.053885Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:51:39.053885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2112.09181","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-05T05:51:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Uh1mUHjDlPXeeOJ2PEgshA8rT3Qm4BDJ0gKwt8aMsqcAY4XOG4IywtcZXUwxhrGfxRWpKhI0/Uu2LpSfgAHCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T20:04:00.573220Z"},"content_sha256":"8b17975a325c701730b850b82895430e92be3e01a7b85a4e61a745131b456122","schema_version":"1.0","event_id":"sha256:8b17975a325c701730b850b82895430e92be3e01a7b85a4e61a745131b456122"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:RZ5PZCITN7HQI75FTIMIMFFEAY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation of functions with one-bit neural networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","cs.NA","math.IT","math.NA"],"primary_cat":"cs.LG","authors_text":"C. Sinan G\\\"unt\\\"urk, Weilin Li","submitted_at":"2021-12-16T20:10:56Z","abstract_excerpt":"The celebrated universal approximation theorems for neural networks roughly state that any reasonable function can be arbitrarily well-approximated by a network whose parameters are appropriately chosen real numbers. This paper examines the approximation capabilities of one-bit neural networks -- those whose nonzero parameters are $\\pm a$ for some fixed $a\\not=0$. One of our main theorems shows that for any $f\\in C^s([0,1]^d)$ with $\\|f\\|_\\infty<1$ and error $\\varepsilon$, there is a $f_{NN}$ such that $|f(\\boldsymbol{x})-f_{NN}(\\boldsymbol{x})|\\leq \\varepsilon$ for all $\\boldsymbol{x}$ away f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.09181","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/2112.09181/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-05T05:51:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vMwu4NC4ckebk1j6ZXK/deV8JO879MGJ76AADE/Uj/h06dqMb97LlCUZXuyMDJfYmG0M58bx7Co24J9Pu9oXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T20:04:00.573851Z"},"content_sha256":"0a6a5ef5e602f23e97b68a07566155a4023e9c5003f72dd11a5c11e43ccbf13f","schema_version":"1.0","event_id":"sha256:0a6a5ef5e602f23e97b68a07566155a4023e9c5003f72dd11a5c11e43ccbf13f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RZ5PZCITN7HQI75FTIMIMFFEAY/bundle.json","state_url":"https://pith.science/pith/RZ5PZCITN7HQI75FTIMIMFFEAY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RZ5PZCITN7HQI75FTIMIMFFEAY/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-31T20:04:00Z","links":{"resolver":"https://pith.science/pith/RZ5PZCITN7HQI75FTIMIMFFEAY","bundle":"https://pith.science/pith/RZ5PZCITN7HQI75FTIMIMFFEAY/bundle.json","state":"https://pith.science/pith/RZ5PZCITN7HQI75FTIMIMFFEAY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RZ5PZCITN7HQI75FTIMIMFFEAY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:RZ5PZCITN7HQI75FTIMIMFFEAY","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":"24ae6ca19b4af16656bc56bf0963137da5bce16eef811bc7a250f44ef5831d23","cross_cats_sorted":["cs.IT","cs.NA","math.IT","math.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-12-16T20:10:56Z","title_canon_sha256":"c16828f8aaf25f3c5b5879bff64bc7b95e47b1739fb227682afeba2e9246006d"},"schema_version":"1.0","source":{"id":"2112.09181","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.09181","created_at":"2026-07-05T05:51:39Z"},{"alias_kind":"arxiv_version","alias_value":"2112.09181v2","created_at":"2026-07-05T05:51:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.09181","created_at":"2026-07-05T05:51:39Z"},{"alias_kind":"pith_short_12","alias_value":"RZ5PZCITN7HQ","created_at":"2026-07-05T05:51:39Z"},{"alias_kind":"pith_short_16","alias_value":"RZ5PZCITN7HQI75F","created_at":"2026-07-05T05:51:39Z"},{"alias_kind":"pith_short_8","alias_value":"RZ5PZCIT","created_at":"2026-07-05T05:51:39Z"}],"graph_snapshots":[{"event_id":"sha256:0a6a5ef5e602f23e97b68a07566155a4023e9c5003f72dd11a5c11e43ccbf13f","target":"graph","created_at":"2026-07-05T05:51:39Z","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/2112.09181/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The celebrated universal approximation theorems for neural networks roughly state that any reasonable function can be arbitrarily well-approximated by a network whose parameters are appropriately chosen real numbers. This paper examines the approximation capabilities of one-bit neural networks -- those whose nonzero parameters are $\\pm a$ for some fixed $a\\not=0$. One of our main theorems shows that for any $f\\in C^s([0,1]^d)$ with $\\|f\\|_\\infty<1$ and error $\\varepsilon$, there is a $f_{NN}$ such that $|f(\\boldsymbol{x})-f_{NN}(\\boldsymbol{x})|\\leq \\varepsilon$ for all $\\boldsymbol{x}$ away f","authors_text":"C. Sinan G\\\"unt\\\"urk, Weilin Li","cross_cats":["cs.IT","cs.NA","math.IT","math.NA"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-12-16T20:10:56Z","title":"Approximation of functions with one-bit neural networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.09181","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:8b17975a325c701730b850b82895430e92be3e01a7b85a4e61a745131b456122","target":"record","created_at":"2026-07-05T05:51:39Z","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":"24ae6ca19b4af16656bc56bf0963137da5bce16eef811bc7a250f44ef5831d23","cross_cats_sorted":["cs.IT","cs.NA","math.IT","math.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-12-16T20:10:56Z","title_canon_sha256":"c16828f8aaf25f3c5b5879bff64bc7b95e47b1739fb227682afeba2e9246006d"},"schema_version":"1.0","source":{"id":"2112.09181","kind":"arxiv","version":2}},"canonical_sha256":"8e7afc89136fcf047fa59a188614a406118fa029249c7f2b989c2b21919724fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e7afc89136fcf047fa59a188614a406118fa029249c7f2b989c2b21919724fe","first_computed_at":"2026-07-05T05:51:39.053885Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:51:39.053885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BPrAZBFf14A1EnL4fkQpmOwR9oyKZUVxqVJETjlCa3Ofos6Xp0mc376+Zrx5BWaT2oTFKr/6PdommXVLAyhABQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:51:39.054399Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.09181","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b17975a325c701730b850b82895430e92be3e01a7b85a4e61a745131b456122","sha256:0a6a5ef5e602f23e97b68a07566155a4023e9c5003f72dd11a5c11e43ccbf13f"],"state_sha256":"84bd4f68c762bbe52201106eba88fdeda13b066c313602c8c395d9342b1bf223"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JqCHWMgc0HH/N12E5Bh6qKrxp+AChRD775IxlC185eqr/m63vKixQ3JVBOrRddiFfAn7rlluB2aC4DgyzdghCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T20:04:00.580177Z","bundle_sha256":"1d2efc4e9b9218a00ff477b4a669b31253bddbfced66d1c36ee3c3b7ae32d1d4"}}