{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:3VPPOZPV7RLM4YMLPLPDJZRS42","short_pith_number":"pith:3VPPOZPV","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"},"canonical_sha256":"dd5ef765f5fc56ce618b7ade34e632e69262e6a36c5cd1fccf4ce2d559b3c2c2","source":{"kind":"arxiv","id":"0805.2135","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0805.2135","created_at":"2026-07-04T15:11:34Z"},{"alias_kind":"arxiv_version","alias_value":"0805.2135v1","created_at":"2026-07-04T15:11:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0805.2135","created_at":"2026-07-04T15:11:34Z"},{"alias_kind":"pith_short_12","alias_value":"3VPPOZPV7RLM","created_at":"2026-07-04T15:11:34Z"},{"alias_kind":"pith_short_16","alias_value":"3VPPOZPV7RLM4YML","created_at":"2026-07-04T15:11:34Z"},{"alias_kind":"pith_short_8","alias_value":"3VPPOZPV","created_at":"2026-07-04T15:11:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:3VPPOZPV7RLM4YMLPLPDJZRS42","target":"record","payload":{"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"},"canonical_sha256":"dd5ef765f5fc56ce618b7ade34e632e69262e6a36c5cd1fccf4ce2d559b3c2c2","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"},"source_kind":"arxiv","source_id":"0805.2135","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-07-04T15:11:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I0V82++YyuMUL7NFHFCjG3T1Fa3ibKHiPbS4HlGBF5fDKnsa75x2utoEV1dHymyjsMOFG3Wn57MMxWyA0CnHBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T06:58:35.975261Z"},"content_sha256":"a011c91decf084f4bb3dcf73bfb434879dd055576ab3d6c70e356b615ce7655d","schema_version":"1.0","event_id":"sha256:a011c91decf084f4bb3dcf73bfb434879dd055576ab3d6c70e356b615ce7655d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:3VPPOZPV7RLM4YMLPLPDJZRS42","target":"graph","payload":{"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"},"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-07-04T15:11:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MC2q1trIvau/HfGHLUjnxd+kgYkyzoXTv7zAdEYHwo5RHhVuw73s3iUE+fuuEelU9IGKJQMlDUmB3u54B1BqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T06:58:35.975665Z"},"content_sha256":"2b80aa1467b7a0514efc9c87a93841e643c28160d361352f4db647c3b323cbe2","schema_version":"1.0","event_id":"sha256:2b80aa1467b7a0514efc9c87a93841e643c28160d361352f4db647c3b323cbe2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3VPPOZPV7RLM4YMLPLPDJZRS42/bundle.json","state_url":"https://pith.science/pith/3VPPOZPV7RLM4YMLPLPDJZRS42/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3VPPOZPV7RLM4YMLPLPDJZRS42/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-07-05T06:58:35Z","links":{"resolver":"https://pith.science/pith/3VPPOZPV7RLM4YMLPLPDJZRS42","bundle":"https://pith.science/pith/3VPPOZPV7RLM4YMLPLPDJZRS42/bundle.json","state":"https://pith.science/pith/3VPPOZPV7RLM4YMLPLPDJZRS42/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3VPPOZPV7RLM4YMLPLPDJZRS42/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:3VPPOZPV7RLM4YMLPLPDJZRS42","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":"4f768403c705595e8ef7ff536a91ac31dedb265ab5f605aabaa435eb7f9ed55c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2008-05-14T18:52:06Z","title_canon_sha256":"29f52254b95683f2ac371f7fe69fd51c1d8ba0eb932678393eabdfb606443fbe"},"schema_version":"1.0","source":{"id":"0805.2135","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0805.2135","created_at":"2026-07-04T15:11:34Z"},{"alias_kind":"arxiv_version","alias_value":"0805.2135v1","created_at":"2026-07-04T15:11:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0805.2135","created_at":"2026-07-04T15:11:34Z"},{"alias_kind":"pith_short_12","alias_value":"3VPPOZPV7RLM","created_at":"2026-07-04T15:11:34Z"},{"alias_kind":"pith_short_16","alias_value":"3VPPOZPV7RLM4YML","created_at":"2026-07-04T15:11:34Z"},{"alias_kind":"pith_short_8","alias_value":"3VPPOZPV","created_at":"2026-07-04T15:11:34Z"}],"graph_snapshots":[{"event_id":"sha256:2b80aa1467b7a0514efc9c87a93841e643c28160d361352f4db647c3b323cbe2","target":"graph","created_at":"2026-07-04T15:11:34Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0805.2135/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alexander A. Sherstov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2008-05-14T18:52:06Z","title":"Communication Lower Bounds Using Dual Polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0805.2135","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:a011c91decf084f4bb3dcf73bfb434879dd055576ab3d6c70e356b615ce7655d","target":"record","created_at":"2026-07-04T15:11:34Z","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":"4f768403c705595e8ef7ff536a91ac31dedb265ab5f605aabaa435eb7f9ed55c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2008-05-14T18:52:06Z","title_canon_sha256":"29f52254b95683f2ac371f7fe69fd51c1d8ba0eb932678393eabdfb606443fbe"},"schema_version":"1.0","source":{"id":"0805.2135","kind":"arxiv","version":1}},"canonical_sha256":"dd5ef765f5fc56ce618b7ade34e632e69262e6a36c5cd1fccf4ce2d559b3c2c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd5ef765f5fc56ce618b7ade34e632e69262e6a36c5cd1fccf4ce2d559b3c2c2","first_computed_at":"2026-07-04T15:11:34.354579Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:11:34.354579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JnP+BkNXhryqgGI3MH9HbOwNPPYki5I5XP+qIgBQV/usqQlxPU83i4rCPKr6OkxWS+OuaC/JU6+l2Nho06KBBg==","signature_status":"signed_v1","signed_at":"2026-07-04T15:11:34.355024Z","signed_message":"canonical_sha256_bytes"},"source_id":"0805.2135","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a011c91decf084f4bb3dcf73bfb434879dd055576ab3d6c70e356b615ce7655d","sha256:2b80aa1467b7a0514efc9c87a93841e643c28160d361352f4db647c3b323cbe2"],"state_sha256":"36be31f1c22fc219070e3b5faf7d1a5cdbf1a40a881660fa7d422bdc0dce50d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7JAVS5ErV/qLjVy7i3uFtBF6nX9Kw9Zhona8W+Rl8Z5T4W+ZEsUeinrYu6eRHEIl5du3Ufe83wTRk/0SfvvQCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T06:58:35.977628Z","bundle_sha256":"949bf1300aa26f701aca8e40e60de011dd83131336ab6f0e760fd5cf45bdcb52"}}