{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:MLKE3USSNOUJZDRN4UPQE6VL7H","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":"6e91dceeb4be732481c1dd233d1ec8a4ee7ce6a45bd54c206106cbea16ba5af7","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2007-02-26T13:12:07Z","title_canon_sha256":"ec082bec9ffd429fa23c33b28846d0288c1999e1090ca7afa9aee1590ccac212"},"schema_version":"1.0","source":{"id":"math/0702773","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0702773","created_at":"2026-05-18T04:28:20Z"},{"alias_kind":"arxiv_version","alias_value":"math/0702773v1","created_at":"2026-05-18T04:28:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0702773","created_at":"2026-05-18T04:28:20Z"},{"alias_kind":"pith_short_12","alias_value":"MLKE3USSNOUJ","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"MLKE3USSNOUJZDRN","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"MLKE3USS","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:dfed795ff0ef4dec90652288e1d5262b77e1b7c3d0f757410962d94c14402a95","target":"graph","created_at":"2026-05-18T04:28:20Z","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 real polynomial $P(X_1,..., X_n)$ sign represents $f: A^n \\to \\{0,1\\}$ if for every $(a_1, ..., a_n) \\in A^n$, the sign of $P(a_1,...,a_n)$ equals $(-1)^{f(a_1,...,a_n)}$. Such sign representations are well-studied in computer science and have applications to computational complexity and computational learning theory. In this work, we present a systematic study of tradeoffs between degree and sparsity of sign representations through the lens of the parity function. We attempt to prove bounds that hold for any choice of set $A$. We show that sign representing parity over $\\{0,...,m-1\\}^n$ wit","authors_text":"Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton, Saugata Basu","cross_cats":[],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2007-02-26T13:12:07Z","title":"Polynomials that Sign Represent Parity and Descartes' Rule of Signs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0702773","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:93f79a2e821db18c0b3bcd19a140fe345e328d60173bab9bd575d5870007e1db","target":"record","created_at":"2026-05-18T04:28:20Z","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":"6e91dceeb4be732481c1dd233d1ec8a4ee7ce6a45bd54c206106cbea16ba5af7","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2007-02-26T13:12:07Z","title_canon_sha256":"ec082bec9ffd429fa23c33b28846d0288c1999e1090ca7afa9aee1590ccac212"},"schema_version":"1.0","source":{"id":"math/0702773","kind":"arxiv","version":1}},"canonical_sha256":"62d44dd2526ba89c8e2de51f027aabf9eb2c35ffb8045713ff463203fc0a2895","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62d44dd2526ba89c8e2de51f027aabf9eb2c35ffb8045713ff463203fc0a2895","first_computed_at":"2026-05-18T04:28:20.586950Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:28:20.586950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FItNc11nOketbGtm6fbCui+auyKpjcuwoEWg53Cm0ZQJATiZhhOoENkJB2ASRgJlYP1UamU7JHpi6miEIc70Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:28:20.587390Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0702773","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93f79a2e821db18c0b3bcd19a140fe345e328d60173bab9bd575d5870007e1db","sha256:dfed795ff0ef4dec90652288e1d5262b77e1b7c3d0f757410962d94c14402a95"],"state_sha256":"f4d69f33a8ce0dc36eaf06d00855404532151c3ee870801382907ac5bddde0ae"}