{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MTSJHNUV2U6YTW5KL72Y7FB6N3","short_pith_number":"pith:MTSJHNUV","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"},"canonical_sha256":"64e493b695d53d89dbaa5ff58f943e6ee2f0d5f7363259ca1cbfb33f3758d275","source":{"kind":"arxiv","id":"1804.08176","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08176","created_at":"2026-05-17T23:52:24Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08176v3","created_at":"2026-05-17T23:52:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08176","created_at":"2026-05-17T23:52:24Z"},{"alias_kind":"pith_short_12","alias_value":"MTSJHNUV2U6Y","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MTSJHNUV2U6YTW5K","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MTSJHNUV","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MTSJHNUV2U6YTW5KL72Y7FB6N3","target":"record","payload":{"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"},"canonical_sha256":"64e493b695d53d89dbaa5ff58f943e6ee2f0d5f7363259ca1cbfb33f3758d275","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"},"source_kind":"arxiv","source_id":"1804.08176","source_version":3,"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-05-17T23:52:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ObZTuR32PK68BXRTkPU/SGWhv8yAHWW0ArSGmaOFvYMithJgRcVFgRszrEPd5k9FE5UwUXQyNob+Vxz/BnviDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:16:24.478421Z"},"content_sha256":"954b3712a3b4831ce981e4bbc4f05380cf453e171892787729230bed58883f77","schema_version":"1.0","event_id":"sha256:954b3712a3b4831ce981e4bbc4f05380cf453e171892787729230bed58883f77"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MTSJHNUV2U6YTW5KL72Y7FB6N3","target":"graph","payload":{"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"},"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-05-17T23:52:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Phe7KhfJ2vulpMR4WjNeQUuc5GXe59pOF0Z6i9pu8GJCkuLhwLV6uom/77DFSevwO9mjQO8Q7Tov4XTrrlyACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:16:24.478767Z"},"content_sha256":"a4c75f52c1af2eacbc7c6e709504880c26a989f68b5a34b8b51fa27a02deb407","schema_version":"1.0","event_id":"sha256:a4c75f52c1af2eacbc7c6e709504880c26a989f68b5a34b8b51fa27a02deb407"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MTSJHNUV2U6YTW5KL72Y7FB6N3/bundle.json","state_url":"https://pith.science/pith/MTSJHNUV2U6YTW5KL72Y7FB6N3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MTSJHNUV2U6YTW5KL72Y7FB6N3/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-06-02T13:16:24Z","links":{"resolver":"https://pith.science/pith/MTSJHNUV2U6YTW5KL72Y7FB6N3","bundle":"https://pith.science/pith/MTSJHNUV2U6YTW5KL72Y7FB6N3/bundle.json","state":"https://pith.science/pith/MTSJHNUV2U6YTW5KL72Y7FB6N3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MTSJHNUV2U6YTW5KL72Y7FB6N3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MTSJHNUV2U6YTW5KL72Y7FB6N3","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":"f206055b2fd3d2d1ced84468038a7c39d92371bddfe583c9b7cca8c093e21133","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-04-22T21:21:51Z","title_canon_sha256":"675b6805a8e855a83257d87759595d2c42f69ce38a3aadbd50428e2e78bd797d"},"schema_version":"1.0","source":{"id":"1804.08176","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08176","created_at":"2026-05-17T23:52:24Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08176v3","created_at":"2026-05-17T23:52:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08176","created_at":"2026-05-17T23:52:24Z"},{"alias_kind":"pith_short_12","alias_value":"MTSJHNUV2U6Y","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MTSJHNUV2U6YTW5K","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MTSJHNUV","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:a4c75f52c1af2eacbc7c6e709504880c26a989f68b5a34b8b51fa27a02deb407","target":"graph","created_at":"2026-05-17T23:52:24Z","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":"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.","authors_text":"Abhishek Bhrushundi, Kaave Hosseini, Sankeerth Rao, Shachar Lovett","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-04-22T21:21:51Z","title":"Torus polynomials: an algebraic approach to ACC lower bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08176","kind":"arxiv","version":3},"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:954b3712a3b4831ce981e4bbc4f05380cf453e171892787729230bed58883f77","target":"record","created_at":"2026-05-17T23:52:24Z","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":"f206055b2fd3d2d1ced84468038a7c39d92371bddfe583c9b7cca8c093e21133","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-04-22T21:21:51Z","title_canon_sha256":"675b6805a8e855a83257d87759595d2c42f69ce38a3aadbd50428e2e78bd797d"},"schema_version":"1.0","source":{"id":"1804.08176","kind":"arxiv","version":3}},"canonical_sha256":"64e493b695d53d89dbaa5ff58f943e6ee2f0d5f7363259ca1cbfb33f3758d275","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64e493b695d53d89dbaa5ff58f943e6ee2f0d5f7363259ca1cbfb33f3758d275","first_computed_at":"2026-05-17T23:52:24.453173Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:24.453173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fdbRqDIgTrhgizg7y9Lb2o8Gj1vZMjnwfhjNZhHfNXkwmuy7YXt6THVD6X2HbO/WOSDQsZ3pJ/1p4SyE6o9tDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:24.453686Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.08176","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:954b3712a3b4831ce981e4bbc4f05380cf453e171892787729230bed58883f77","sha256:a4c75f52c1af2eacbc7c6e709504880c26a989f68b5a34b8b51fa27a02deb407"],"state_sha256":"60e521473351f3cbef3b7cfcdca37fe9bdaf074dae3a9ae00687f189f07affb1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UaT4BxqakecYybHz1a0p6rc25XDweUg2N2684bPMSljf08gT6zCCIRKBo3SdcU3dygMx5MwQrN0SPd0RB2aQAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T13:16:24.480636Z","bundle_sha256":"6cfdbc99f51970762e429686cf4213f6e28c3d8848a3a25e1ba2a232de466a23"}}