{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MTSJHNUV2U6YTW5KL72Y7FB6N3","short_pith_number":"pith:MTSJHNUV","schema_version":"1.0","canonical_sha256":"64e493b695d53d89dbaa5ff58f943e6ee2f0d5f7363259ca1cbfb33f3758d275","source":{"kind":"arxiv","id":"1804.08176","version":3},"attestation_state":"computed","paper":{"title":"Torus polynomials: an algebraic approach to ACC lower bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Abhishek Bhrushundi, Kaave Hosseini, Sankeerth Rao, Shachar Lovett","submitted_at":"2018-04-22T21:21:51Z","abstract_excerpt":"We propose an algebraic approach to proving circuit lower bounds for ACC0 by defining and studying the notion of torus polynomials. We show how currently known polynomial-based approximation results for AC0 and ACC0 can be reformulated in this framework, implying that ACC0 can be approximated by low-degree torus polynomials. Furthermore, as a step towards proving ACC0 lower bounds for the majority function via our approach, we show that MAJORITY cannot be approximated by low-degree symmetric torus polynomials. We also pose several open problems related to our framework."},"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":"1804.08176","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-04-22T21:21:51Z","cross_cats_sorted":[],"title_canon_sha256":"675b6805a8e855a83257d87759595d2c42f69ce38a3aadbd50428e2e78bd797d","abstract_canon_sha256":"f206055b2fd3d2d1ced84468038a7c39d92371bddfe583c9b7cca8c093e21133"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:24.453686Z","signature_b64":"fdbRqDIgTrhgizg7y9Lb2o8Gj1vZMjnwfhjNZhHfNXkwmuy7YXt6THVD6X2HbO/WOSDQsZ3pJ/1p4SyE6o9tDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64e493b695d53d89dbaa5ff58f943e6ee2f0d5f7363259ca1cbfb33f3758d275","last_reissued_at":"2026-05-17T23:52:24.453173Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:24.453173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Torus polynomials: an algebraic approach to ACC lower bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Abhishek Bhrushundi, Kaave Hosseini, Sankeerth Rao, Shachar Lovett","submitted_at":"2018-04-22T21:21:51Z","abstract_excerpt":"We propose an algebraic approach to proving circuit lower bounds for ACC0 by defining and studying the notion of torus polynomials. We show how currently known polynomial-based approximation results for AC0 and ACC0 can be reformulated in this framework, implying that ACC0 can be approximated by low-degree torus polynomials. Furthermore, as a step towards proving ACC0 lower bounds for the majority function via our approach, we show that MAJORITY cannot be approximated by low-degree symmetric torus polynomials. We also pose several open problems related to our framework."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08176","kind":"arxiv","version":3},"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":"1804.08176","created_at":"2026-05-17T23:52:24.453261+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.08176v3","created_at":"2026-05-17T23:52:24.453261+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08176","created_at":"2026-05-17T23:52:24.453261+00:00"},{"alias_kind":"pith_short_12","alias_value":"MTSJHNUV2U6Y","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"MTSJHNUV2U6YTW5K","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"MTSJHNUV","created_at":"2026-05-18T12:32:40.477152+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/MTSJHNUV2U6YTW5KL72Y7FB6N3","json":"https://pith.science/pith/MTSJHNUV2U6YTW5KL72Y7FB6N3.json","graph_json":"https://pith.science/api/pith-number/MTSJHNUV2U6YTW5KL72Y7FB6N3/graph.json","events_json":"https://pith.science/api/pith-number/MTSJHNUV2U6YTW5KL72Y7FB6N3/events.json","paper":"https://pith.science/paper/MTSJHNUV"},"agent_actions":{"view_html":"https://pith.science/pith/MTSJHNUV2U6YTW5KL72Y7FB6N3","download_json":"https://pith.science/pith/MTSJHNUV2U6YTW5KL72Y7FB6N3.json","view_paper":"https://pith.science/paper/MTSJHNUV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.08176&json=true","fetch_graph":"https://pith.science/api/pith-number/MTSJHNUV2U6YTW5KL72Y7FB6N3/graph.json","fetch_events":"https://pith.science/api/pith-number/MTSJHNUV2U6YTW5KL72Y7FB6N3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MTSJHNUV2U6YTW5KL72Y7FB6N3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MTSJHNUV2U6YTW5KL72Y7FB6N3/action/storage_attestation","attest_author":"https://pith.science/pith/MTSJHNUV2U6YTW5KL72Y7FB6N3/action/author_attestation","sign_citation":"https://pith.science/pith/MTSJHNUV2U6YTW5KL72Y7FB6N3/action/citation_signature","submit_replication":"https://pith.science/pith/MTSJHNUV2U6YTW5KL72Y7FB6N3/action/replication_record"}},"created_at":"2026-05-17T23:52:24.453261+00:00","updated_at":"2026-05-17T23:52:24.453261+00:00"}