{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BFVOFYOWYQNSDWKHCAXGWG5ROZ","short_pith_number":"pith:BFVOFYOW","canonical_record":{"source":{"id":"1803.10868","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-03-28T22:27:41Z","cross_cats_sorted":[],"title_canon_sha256":"e0ec4f025101eccb8585031915a0f28b75a9527d5efc468bdfc155229fda0366","abstract_canon_sha256":"b89ac11bc3a9b62eb0937ea70bffa7d940efaee4636ca47594f45eb5a0abfbc4"},"schema_version":"1.0"},"canonical_sha256":"096ae2e1d6c41b21d947102e6b1bb1764f8546dfcb325cb3f109939bcb1d09aa","source":{"kind":"arxiv","id":"1803.10868","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.10868","created_at":"2026-05-17T23:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"1803.10868v3","created_at":"2026-05-17T23:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10868","created_at":"2026-05-17T23:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"BFVOFYOWYQNS","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BFVOFYOWYQNSDWKH","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BFVOFYOW","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BFVOFYOWYQNSDWKHCAXGWG5ROZ","target":"record","payload":{"canonical_record":{"source":{"id":"1803.10868","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-03-28T22:27:41Z","cross_cats_sorted":[],"title_canon_sha256":"e0ec4f025101eccb8585031915a0f28b75a9527d5efc468bdfc155229fda0366","abstract_canon_sha256":"b89ac11bc3a9b62eb0937ea70bffa7d940efaee4636ca47594f45eb5a0abfbc4"},"schema_version":"1.0"},"canonical_sha256":"096ae2e1d6c41b21d947102e6b1bb1764f8546dfcb325cb3f109939bcb1d09aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:41.887298Z","signature_b64":"L5Z34pXOG10Sj1yFoXqHRSBjINqwKrTDk/A0SZdZgnFdgYVdXk2C46aOXmkTzLwEJOWQruk3NvSYG+cRIIqqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"096ae2e1d6c41b21d947102e6b1bb1764f8546dfcb325cb3f109939bcb1d09aa","last_reissued_at":"2026-05-17T23:39:41.886660Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:41.886660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.10868","source_version":3,"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-17T23:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XdVdtuVcKWih/X6zjClFubEOCUrx3A1Y7hPsMw9AbkcwiljeTlDI3JXUxmzuQg1KgTWfHiLtgvKKrUqAVX2CAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T16:35:39.448777Z"},"content_sha256":"5f71d0070e5b55b07bf3626c252b3f6d2f2e5b20474828a0182daca6369ba1fe","schema_version":"1.0","event_id":"sha256:5f71d0070e5b55b07bf3626c252b3f6d2f2e5b20474828a0182daca6369ba1fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BFVOFYOWYQNSDWKHCAXGWG5ROZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomial threshold functions, hyperplane arrangements, and random tensors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Pierre Baldi, Roman Vershynin","submitted_at":"2018-03-28T22:27:41Z","abstract_excerpt":"A simple way to generate a Boolean function is to take the sign of a real polynomial in $n$ variables. Such Boolean functions are called polynomial threshold functions. How many low-degree polynomial threshold functions are there? The partial case of this problem for degree $d=1$ was solved by Zuev in 1989, who showed that the number $T(n,1)$ of linear threshold functions satisfies $\\log_2 T(n,1) \\approx n^2$, up to smaller order terms. However the number of polynomial threshold functions for any higher degrees, including $d=2$, has remained open. We settle this problem for all fixed degrees $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10868","kind":"arxiv","version":3},"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-17T23:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qvJB8r0t4GtyholRdmMV6+2nx41x0yJL+xze+dWQ08FZXUTMh9riSxLpG3agyO6oNz4wZ0KM3G4YFvEHQq7dAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T16:35:39.449332Z"},"content_sha256":"5b3280e2d22d181b9aa88546e0dc278adf1ec15ab5b9dfe96903228079d8d0b5","schema_version":"1.0","event_id":"sha256:5b3280e2d22d181b9aa88546e0dc278adf1ec15ab5b9dfe96903228079d8d0b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BFVOFYOWYQNSDWKHCAXGWG5ROZ/bundle.json","state_url":"https://pith.science/pith/BFVOFYOWYQNSDWKHCAXGWG5ROZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BFVOFYOWYQNSDWKHCAXGWG5ROZ/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-05-18T16:35:39Z","links":{"resolver":"https://pith.science/pith/BFVOFYOWYQNSDWKHCAXGWG5ROZ","bundle":"https://pith.science/pith/BFVOFYOWYQNSDWKHCAXGWG5ROZ/bundle.json","state":"https://pith.science/pith/BFVOFYOWYQNSDWKHCAXGWG5ROZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BFVOFYOWYQNSDWKHCAXGWG5ROZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BFVOFYOWYQNSDWKHCAXGWG5ROZ","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":"b89ac11bc3a9b62eb0937ea70bffa7d940efaee4636ca47594f45eb5a0abfbc4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-03-28T22:27:41Z","title_canon_sha256":"e0ec4f025101eccb8585031915a0f28b75a9527d5efc468bdfc155229fda0366"},"schema_version":"1.0","source":{"id":"1803.10868","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.10868","created_at":"2026-05-17T23:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"1803.10868v3","created_at":"2026-05-17T23:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10868","created_at":"2026-05-17T23:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"BFVOFYOWYQNS","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BFVOFYOWYQNSDWKH","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BFVOFYOW","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:5b3280e2d22d181b9aa88546e0dc278adf1ec15ab5b9dfe96903228079d8d0b5","target":"graph","created_at":"2026-05-17T23:39:41Z","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":"A simple way to generate a Boolean function is to take the sign of a real polynomial in $n$ variables. Such Boolean functions are called polynomial threshold functions. How many low-degree polynomial threshold functions are there? The partial case of this problem for degree $d=1$ was solved by Zuev in 1989, who showed that the number $T(n,1)$ of linear threshold functions satisfies $\\log_2 T(n,1) \\approx n^2$, up to smaller order terms. However the number of polynomial threshold functions for any higher degrees, including $d=2$, has remained open. We settle this problem for all fixed degrees $","authors_text":"Pierre Baldi, Roman Vershynin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-03-28T22:27:41Z","title":"Polynomial threshold functions, hyperplane arrangements, and random tensors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10868","kind":"arxiv","version":3},"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:5f71d0070e5b55b07bf3626c252b3f6d2f2e5b20474828a0182daca6369ba1fe","target":"record","created_at":"2026-05-17T23:39:41Z","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":"b89ac11bc3a9b62eb0937ea70bffa7d940efaee4636ca47594f45eb5a0abfbc4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-03-28T22:27:41Z","title_canon_sha256":"e0ec4f025101eccb8585031915a0f28b75a9527d5efc468bdfc155229fda0366"},"schema_version":"1.0","source":{"id":"1803.10868","kind":"arxiv","version":3}},"canonical_sha256":"096ae2e1d6c41b21d947102e6b1bb1764f8546dfcb325cb3f109939bcb1d09aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"096ae2e1d6c41b21d947102e6b1bb1764f8546dfcb325cb3f109939bcb1d09aa","first_computed_at":"2026-05-17T23:39:41.886660Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:41.886660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L5Z34pXOG10Sj1yFoXqHRSBjINqwKrTDk/A0SZdZgnFdgYVdXk2C46aOXmkTzLwEJOWQruk3NvSYG+cRIIqqCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:41.887298Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.10868","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f71d0070e5b55b07bf3626c252b3f6d2f2e5b20474828a0182daca6369ba1fe","sha256:5b3280e2d22d181b9aa88546e0dc278adf1ec15ab5b9dfe96903228079d8d0b5"],"state_sha256":"b3da806f62f98d8fbbf5990c6b956d9cd9d5ec8b64d19b61ea1478d5b175da69"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UQQtoT9LDfuSXGhMLs07BruaslU1VyHQsEk17sw3elksVWwadIb1/pDvbX+53P9IiVGKEUEbGS4qZnyOy8BEDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T16:35:39.451074Z","bundle_sha256":"f2755afdae41d67677ca2a7842cb47e27f5640faf1b553dd7b169de8394508ec"}}