{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:TWPQIL2ALMKT7XK6TKPHV6EZP6","short_pith_number":"pith:TWPQIL2A","canonical_record":{"source":{"id":"1307.1157","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-07-02T19:05:51Z","cross_cats_sorted":["math.CO","math.NT"],"title_canon_sha256":"4a8419503ed86cbc497ac358cfc610ba7664d4be132dbd4d7becad81301a78f3","abstract_canon_sha256":"f52d55415054b62cecf24a01e7cbfd1d33022e6c2dbfe8f0fd5e9bd4832cbe56"},"schema_version":"1.0"},"canonical_sha256":"9d9f042f405b153fdd5e9a9e7af8997f9010e2def8f5475b3a649d1dc1405826","source":{"kind":"arxiv","id":"1307.1157","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.1157","created_at":"2026-05-18T03:19:14Z"},{"alias_kind":"arxiv_version","alias_value":"1307.1157v1","created_at":"2026-05-18T03:19:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1157","created_at":"2026-05-18T03:19:14Z"},{"alias_kind":"pith_short_12","alias_value":"TWPQIL2ALMKT","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TWPQIL2ALMKT7XK6","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TWPQIL2A","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:TWPQIL2ALMKT7XK6TKPHV6EZP6","target":"record","payload":{"canonical_record":{"source":{"id":"1307.1157","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-07-02T19:05:51Z","cross_cats_sorted":["math.CO","math.NT"],"title_canon_sha256":"4a8419503ed86cbc497ac358cfc610ba7664d4be132dbd4d7becad81301a78f3","abstract_canon_sha256":"f52d55415054b62cecf24a01e7cbfd1d33022e6c2dbfe8f0fd5e9bd4832cbe56"},"schema_version":"1.0"},"canonical_sha256":"9d9f042f405b153fdd5e9a9e7af8997f9010e2def8f5475b3a649d1dc1405826","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:14.557145Z","signature_b64":"RB5DMRQYtJa9BnAbBfmn6B5PzkIq5nHGJRCpUeP+Sb8gZHdeH06N24HkKI3hHFY7mP6BUxYOiBMXw1bkNku6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d9f042f405b153fdd5e9a9e7af8997f9010e2def8f5475b3a649d1dc1405826","last_reissued_at":"2026-05-18T03:19:14.556688Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:14.556688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.1157","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-18T03:19:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LQGGvcELuMHi/+WQM2uyU8nKlVpnZ+sbZlXNGi27pcbd0xVxC+c7s4I6eLkOQcTjREnjHa06hJrNKKO5glXKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T19:04:05.043334Z"},"content_sha256":"7aec07100271827f8438e23bd773ca42c76c16746619e0cbbac047d0ddb3c864","schema_version":"1.0","event_id":"sha256:7aec07100271827f8438e23bd773ca42c76c16746619e0cbbac047d0ddb3c864"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:TWPQIL2ALMKT7XK6TKPHV6EZP6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Representing Boolean Functions Using Polynomials: More Can Offer Less","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.NT"],"primary_cat":"cs.CC","authors_text":"Yi Ming Zou","submitted_at":"2013-07-02T19:05:51Z","abstract_excerpt":"Polynomial threshold gates are basic processing units of an artificial neural network. When the input vectors are binary vectors, these gates correspond to Boolean functions and can be analyzed via their polynomial representations. In practical applications, it is desirable to find a polynomial representation with the smallest number of terms possible, in order to use the least possible number of input lines to the unit under consideration. For this purpose, instead of an exact polynomial representation, usually the sign representation of a Boolean function is considered. The non-uniqueness of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1157","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-18T03:19:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JfhLch4R40zlnpn6CU69GXIkwClX+uHpGfuYUlxcRBRbXLYGAGwN/GCZ8wHS9/ddiKrsonm79OuJjjQ9sf39Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T19:04:05.043938Z"},"content_sha256":"1563bcdad69f36480e8444c4c5a59df4822bbfa3a455218fe15c8fa756c7fbef","schema_version":"1.0","event_id":"sha256:1563bcdad69f36480e8444c4c5a59df4822bbfa3a455218fe15c8fa756c7fbef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TWPQIL2ALMKT7XK6TKPHV6EZP6/bundle.json","state_url":"https://pith.science/pith/TWPQIL2ALMKT7XK6TKPHV6EZP6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TWPQIL2ALMKT7XK6TKPHV6EZP6/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-24T19:04:05Z","links":{"resolver":"https://pith.science/pith/TWPQIL2ALMKT7XK6TKPHV6EZP6","bundle":"https://pith.science/pith/TWPQIL2ALMKT7XK6TKPHV6EZP6/bundle.json","state":"https://pith.science/pith/TWPQIL2ALMKT7XK6TKPHV6EZP6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TWPQIL2ALMKT7XK6TKPHV6EZP6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TWPQIL2ALMKT7XK6TKPHV6EZP6","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":"f52d55415054b62cecf24a01e7cbfd1d33022e6c2dbfe8f0fd5e9bd4832cbe56","cross_cats_sorted":["math.CO","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-07-02T19:05:51Z","title_canon_sha256":"4a8419503ed86cbc497ac358cfc610ba7664d4be132dbd4d7becad81301a78f3"},"schema_version":"1.0","source":{"id":"1307.1157","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.1157","created_at":"2026-05-18T03:19:14Z"},{"alias_kind":"arxiv_version","alias_value":"1307.1157v1","created_at":"2026-05-18T03:19:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1157","created_at":"2026-05-18T03:19:14Z"},{"alias_kind":"pith_short_12","alias_value":"TWPQIL2ALMKT","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TWPQIL2ALMKT7XK6","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TWPQIL2A","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:1563bcdad69f36480e8444c4c5a59df4822bbfa3a455218fe15c8fa756c7fbef","target":"graph","created_at":"2026-05-18T03:19:14Z","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":"Polynomial threshold gates are basic processing units of an artificial neural network. When the input vectors are binary vectors, these gates correspond to Boolean functions and can be analyzed via their polynomial representations. In practical applications, it is desirable to find a polynomial representation with the smallest number of terms possible, in order to use the least possible number of input lines to the unit under consideration. For this purpose, instead of an exact polynomial representation, usually the sign representation of a Boolean function is considered. The non-uniqueness of","authors_text":"Yi Ming Zou","cross_cats":["math.CO","math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-07-02T19:05:51Z","title":"Representing Boolean Functions Using Polynomials: More Can Offer Less"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1157","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:7aec07100271827f8438e23bd773ca42c76c16746619e0cbbac047d0ddb3c864","target":"record","created_at":"2026-05-18T03:19:14Z","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":"f52d55415054b62cecf24a01e7cbfd1d33022e6c2dbfe8f0fd5e9bd4832cbe56","cross_cats_sorted":["math.CO","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-07-02T19:05:51Z","title_canon_sha256":"4a8419503ed86cbc497ac358cfc610ba7664d4be132dbd4d7becad81301a78f3"},"schema_version":"1.0","source":{"id":"1307.1157","kind":"arxiv","version":1}},"canonical_sha256":"9d9f042f405b153fdd5e9a9e7af8997f9010e2def8f5475b3a649d1dc1405826","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d9f042f405b153fdd5e9a9e7af8997f9010e2def8f5475b3a649d1dc1405826","first_computed_at":"2026-05-18T03:19:14.556688Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:19:14.556688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RB5DMRQYtJa9BnAbBfmn6B5PzkIq5nHGJRCpUeP+Sb8gZHdeH06N24HkKI3hHFY7mP6BUxYOiBMXw1bkNku6CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:19:14.557145Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.1157","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7aec07100271827f8438e23bd773ca42c76c16746619e0cbbac047d0ddb3c864","sha256:1563bcdad69f36480e8444c4c5a59df4822bbfa3a455218fe15c8fa756c7fbef"],"state_sha256":"eb73df2c4d965bb3cd864c44b1b50d3c6a5dcc0c0b5ba4643fb12b4ae158b761"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FUPYUBZloESO3d8vNzlLx04DMSGf8kyQR0y+qY3J0Aix3ouNig+7BtWVkOxffoojNY+zKEdXoOI4zVRkEafbBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T19:04:05.047253Z","bundle_sha256":"f3812d34fb09f4ec22167ea5521eaa69049bd75e227c3fef4728d015384524f8"}}