{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CI5GXWVJBOEF3I36REZBI4AMD4","short_pith_number":"pith:CI5GXWVJ","schema_version":"1.0","canonical_sha256":"123a6bdaa90b885da37e893214700c1f3ca64a950a4e507aa0c1ce0eca68b1d1","source":{"kind":"arxiv","id":"2607.10236","version":1},"attestation_state":"computed","paper":{"title":"On CC\\textsuperscript{0} Lower Bounds for AND via Torus Polynomials","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jayalal Sarma, Vaibhav Krishan","submitted_at":"2026-07-11T09:50:28Z","abstract_excerpt":"We explore a torus polynomial approximation based approach towards a long-standing question: whether $AND$ can be computed by $CC^0$ circuits - the class of constant-depth polynomial size circuits containing $MOD_m$ gates for some $m$. Bhrushundi et al. (ITCS 2019) introduced torus polynomial approximations as an approach for proving lower bounds against $ACC^0$ - a class containing $CC^0$ with circuits comprising $AND$, $OR$ and $NOT$ gates.\n  We show how lower bounds for torus polynomials approximating $AND$ can be used to make progress on this question. Using lower bounds on the degree of s"},"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":"2607.10236","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-07-11T09:50:28Z","cross_cats_sorted":[],"title_canon_sha256":"1113ff094440b029cbce6f02fd4fd8461001e48a157aadd9f77817a9db8c7652","abstract_canon_sha256":"a2ede48664d371ee6ad6d7d4442d5fba622b78eb422c5315d49e5d57a665dfcc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T01:20:32.083152Z","signature_b64":"BHPHlGDPTFpADfPat4qnqZIMxd4zkwK4w7GeHfgQoJVQVsvbgXfs0nbhhRZUC70KSZDrxXoggTvb9pldbh/xDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"123a6bdaa90b885da37e893214700c1f3ca64a950a4e507aa0c1ce0eca68b1d1","last_reissued_at":"2026-07-14T01:20:32.082248Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T01:20:32.082248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On CC\\textsuperscript{0} Lower Bounds for AND via Torus Polynomials","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jayalal Sarma, Vaibhav Krishan","submitted_at":"2026-07-11T09:50:28Z","abstract_excerpt":"We explore a torus polynomial approximation based approach towards a long-standing question: whether $AND$ can be computed by $CC^0$ circuits - the class of constant-depth polynomial size circuits containing $MOD_m$ gates for some $m$. Bhrushundi et al. (ITCS 2019) introduced torus polynomial approximations as an approach for proving lower bounds against $ACC^0$ - a class containing $CC^0$ with circuits comprising $AND$, $OR$ and $NOT$ gates.\n  We show how lower bounds for torus polynomials approximating $AND$ can be used to make progress on this question. Using lower bounds on the degree of s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.10236","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/2607.10236/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":"2607.10236","created_at":"2026-07-14T01:20:32.082718+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.10236v1","created_at":"2026-07-14T01:20:32.082718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.10236","created_at":"2026-07-14T01:20:32.082718+00:00"},{"alias_kind":"pith_short_12","alias_value":"CI5GXWVJBOEF","created_at":"2026-07-14T01:20:32.082718+00:00"},{"alias_kind":"pith_short_16","alias_value":"CI5GXWVJBOEF3I36","created_at":"2026-07-14T01:20:32.082718+00:00"},{"alias_kind":"pith_short_8","alias_value":"CI5GXWVJ","created_at":"2026-07-14T01:20:32.082718+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/CI5GXWVJBOEF3I36REZBI4AMD4","json":"https://pith.science/pith/CI5GXWVJBOEF3I36REZBI4AMD4.json","graph_json":"https://pith.science/api/pith-number/CI5GXWVJBOEF3I36REZBI4AMD4/graph.json","events_json":"https://pith.science/api/pith-number/CI5GXWVJBOEF3I36REZBI4AMD4/events.json","paper":"https://pith.science/paper/CI5GXWVJ"},"agent_actions":{"view_html":"https://pith.science/pith/CI5GXWVJBOEF3I36REZBI4AMD4","download_json":"https://pith.science/pith/CI5GXWVJBOEF3I36REZBI4AMD4.json","view_paper":"https://pith.science/paper/CI5GXWVJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.10236&json=true","fetch_graph":"https://pith.science/api/pith-number/CI5GXWVJBOEF3I36REZBI4AMD4/graph.json","fetch_events":"https://pith.science/api/pith-number/CI5GXWVJBOEF3I36REZBI4AMD4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CI5GXWVJBOEF3I36REZBI4AMD4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CI5GXWVJBOEF3I36REZBI4AMD4/action/storage_attestation","attest_author":"https://pith.science/pith/CI5GXWVJBOEF3I36REZBI4AMD4/action/author_attestation","sign_citation":"https://pith.science/pith/CI5GXWVJBOEF3I36REZBI4AMD4/action/citation_signature","submit_replication":"https://pith.science/pith/CI5GXWVJBOEF3I36REZBI4AMD4/action/replication_record"}},"created_at":"2026-07-14T01:20:32.082718+00:00","updated_at":"2026-07-14T01:20:32.082718+00:00"}