{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:MLKE3USSNOUJZDRN4UPQE6VL7H","short_pith_number":"pith:MLKE3USS","schema_version":"1.0","canonical_sha256":"62d44dd2526ba89c8e2de51f027aabf9eb2c35ffb8045713ff463203fc0a2895","source":{"kind":"arxiv","id":"math/0702773","version":1},"attestation_state":"computed","paper":{"title":"Polynomials that Sign Represent Parity and Descartes' Rule of Signs","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton, Saugata Basu","submitted_at":"2007-02-26T13:12:07Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"math/0702773","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2007-02-26T13:12:07Z","cross_cats_sorted":[],"title_canon_sha256":"ec082bec9ffd429fa23c33b28846d0288c1999e1090ca7afa9aee1590ccac212","abstract_canon_sha256":"6e91dceeb4be732481c1dd233d1ec8a4ee7ce6a45bd54c206106cbea16ba5af7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:20.587390Z","signature_b64":"FItNc11nOketbGtm6fbCui+auyKpjcuwoEWg53Cm0ZQJATiZhhOoENkJB2ASRgJlYP1UamU7JHpi6miEIc70Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62d44dd2526ba89c8e2de51f027aabf9eb2c35ffb8045713ff463203fc0a2895","last_reissued_at":"2026-05-18T04:28:20.586950Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:20.586950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomials that Sign Represent Parity and Descartes' Rule of Signs","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton, Saugata Basu","submitted_at":"2007-02-26T13:12:07Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0702773","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"math/0702773","created_at":"2026-05-18T04:28:20.587015+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0702773v1","created_at":"2026-05-18T04:28:20.587015+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0702773","created_at":"2026-05-18T04:28:20.587015+00:00"},{"alias_kind":"pith_short_12","alias_value":"MLKE3USSNOUJ","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"MLKE3USSNOUJZDRN","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"MLKE3USS","created_at":"2026-05-18T12:25:55.427421+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MLKE3USSNOUJZDRN4UPQE6VL7H","json":"https://pith.science/pith/MLKE3USSNOUJZDRN4UPQE6VL7H.json","graph_json":"https://pith.science/api/pith-number/MLKE3USSNOUJZDRN4UPQE6VL7H/graph.json","events_json":"https://pith.science/api/pith-number/MLKE3USSNOUJZDRN4UPQE6VL7H/events.json","paper":"https://pith.science/paper/MLKE3USS"},"agent_actions":{"view_html":"https://pith.science/pith/MLKE3USSNOUJZDRN4UPQE6VL7H","download_json":"https://pith.science/pith/MLKE3USSNOUJZDRN4UPQE6VL7H.json","view_paper":"https://pith.science/paper/MLKE3USS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0702773&json=true","fetch_graph":"https://pith.science/api/pith-number/MLKE3USSNOUJZDRN4UPQE6VL7H/graph.json","fetch_events":"https://pith.science/api/pith-number/MLKE3USSNOUJZDRN4UPQE6VL7H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MLKE3USSNOUJZDRN4UPQE6VL7H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MLKE3USSNOUJZDRN4UPQE6VL7H/action/storage_attestation","attest_author":"https://pith.science/pith/MLKE3USSNOUJZDRN4UPQE6VL7H/action/author_attestation","sign_citation":"https://pith.science/pith/MLKE3USSNOUJZDRN4UPQE6VL7H/action/citation_signature","submit_replication":"https://pith.science/pith/MLKE3USSNOUJZDRN4UPQE6VL7H/action/replication_record"}},"created_at":"2026-05-18T04:28:20.587015+00:00","updated_at":"2026-05-18T04:28:20.587015+00:00"}