{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:3VPPOZPV7RLM4YMLPLPDJZRS42","short_pith_number":"pith:3VPPOZPV","schema_version":"1.0","canonical_sha256":"dd5ef765f5fc56ce618b7ade34e632e69262e6a36c5cd1fccf4ce2d559b3c2c2","source":{"kind":"arxiv","id":"0805.2135","version":1},"attestation_state":"computed","paper":{"title":"Communication Lower Bounds Using Dual Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alexander A. Sherstov","submitted_at":"2008-05-14T18:52:06Z","abstract_excerpt":"Representations of Boolean functions by real polynomials play an important role in complexity theory. Typically, one is interested in the least degree of a polynomial p(x_1,...,x_n) that approximates or sign-represents a given Boolean function f(x_1,...,x_n). This article surveys a new and growing body of work in communication complexity that centers around the dual objects, i.e., polynomials that certify the difficulty of approximating or sign-representing a given function. We provide a unified guide to the following results, complete with all the key proofs:\n  (1) Sherstov's Degree/Discrepan"},"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":"0805.2135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2008-05-14T18:52:06Z","cross_cats_sorted":[],"title_canon_sha256":"29f52254b95683f2ac371f7fe69fd51c1d8ba0eb932678393eabdfb606443fbe","abstract_canon_sha256":"4f768403c705595e8ef7ff536a91ac31dedb265ab5f605aabaa435eb7f9ed55c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:11:34.355024Z","signature_b64":"JnP+BkNXhryqgGI3MH9HbOwNPPYki5I5XP+qIgBQV/usqQlxPU83i4rCPKr6OkxWS+OuaC/JU6+l2Nho06KBBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd5ef765f5fc56ce618b7ade34e632e69262e6a36c5cd1fccf4ce2d559b3c2c2","last_reissued_at":"2026-07-04T15:11:34.354579Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:11:34.354579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication Lower Bounds Using Dual Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alexander A. Sherstov","submitted_at":"2008-05-14T18:52:06Z","abstract_excerpt":"Representations of Boolean functions by real polynomials play an important role in complexity theory. Typically, one is interested in the least degree of a polynomial p(x_1,...,x_n) that approximates or sign-represents a given Boolean function f(x_1,...,x_n). This article surveys a new and growing body of work in communication complexity that centers around the dual objects, i.e., polynomials that certify the difficulty of approximating or sign-representing a given function. We provide a unified guide to the following results, complete with all the key proofs:\n  (1) Sherstov's Degree/Discrepan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0805.2135","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0805.2135/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0805.2135","created_at":"2026-07-04T15:11:34.354641+00:00"},{"alias_kind":"arxiv_version","alias_value":"0805.2135v1","created_at":"2026-07-04T15:11:34.354641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0805.2135","created_at":"2026-07-04T15:11:34.354641+00:00"},{"alias_kind":"pith_short_12","alias_value":"3VPPOZPV7RLM","created_at":"2026-07-04T15:11:34.354641+00:00"},{"alias_kind":"pith_short_16","alias_value":"3VPPOZPV7RLM4YML","created_at":"2026-07-04T15:11:34.354641+00:00"},{"alias_kind":"pith_short_8","alias_value":"3VPPOZPV","created_at":"2026-07-04T15:11:34.354641+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/3VPPOZPV7RLM4YMLPLPDJZRS42","json":"https://pith.science/pith/3VPPOZPV7RLM4YMLPLPDJZRS42.json","graph_json":"https://pith.science/api/pith-number/3VPPOZPV7RLM4YMLPLPDJZRS42/graph.json","events_json":"https://pith.science/api/pith-number/3VPPOZPV7RLM4YMLPLPDJZRS42/events.json","paper":"https://pith.science/paper/3VPPOZPV"},"agent_actions":{"view_html":"https://pith.science/pith/3VPPOZPV7RLM4YMLPLPDJZRS42","download_json":"https://pith.science/pith/3VPPOZPV7RLM4YMLPLPDJZRS42.json","view_paper":"https://pith.science/paper/3VPPOZPV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0805.2135&json=true","fetch_graph":"https://pith.science/api/pith-number/3VPPOZPV7RLM4YMLPLPDJZRS42/graph.json","fetch_events":"https://pith.science/api/pith-number/3VPPOZPV7RLM4YMLPLPDJZRS42/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3VPPOZPV7RLM4YMLPLPDJZRS42/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3VPPOZPV7RLM4YMLPLPDJZRS42/action/storage_attestation","attest_author":"https://pith.science/pith/3VPPOZPV7RLM4YMLPLPDJZRS42/action/author_attestation","sign_citation":"https://pith.science/pith/3VPPOZPV7RLM4YMLPLPDJZRS42/action/citation_signature","submit_replication":"https://pith.science/pith/3VPPOZPV7RLM4YMLPLPDJZRS42/action/replication_record"}},"created_at":"2026-07-04T15:11:34.354641+00:00","updated_at":"2026-07-04T15:11:34.354641+00:00"}