{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:CI5GXWVJBOEF3I36REZBI4AMD4","short_pith_number":"pith:CI5GXWVJ","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"},"canonical_sha256":"123a6bdaa90b885da37e893214700c1f3ca64a950a4e507aa0c1ce0eca68b1d1","source":{"kind":"arxiv","id":"2607.10236","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.10236","created_at":"2026-07-14T01:20:32Z"},{"alias_kind":"arxiv_version","alias_value":"2607.10236v1","created_at":"2026-07-14T01:20:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.10236","created_at":"2026-07-14T01:20:32Z"},{"alias_kind":"pith_short_12","alias_value":"CI5GXWVJBOEF","created_at":"2026-07-14T01:20:32Z"},{"alias_kind":"pith_short_16","alias_value":"CI5GXWVJBOEF3I36","created_at":"2026-07-14T01:20:32Z"},{"alias_kind":"pith_short_8","alias_value":"CI5GXWVJ","created_at":"2026-07-14T01:20:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:CI5GXWVJBOEF3I36REZBI4AMD4","target":"record","payload":{"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"},"canonical_sha256":"123a6bdaa90b885da37e893214700c1f3ca64a950a4e507aa0c1ce0eca68b1d1","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"},"source_kind":"arxiv","source_id":"2607.10236","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-14T01:20:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zx3XAPxs9x3fwB0qq4ip28aXqKlg2FFLv152xVM+VpT5Zuen6y5ubL31xJCieb10S2lKkQqzgA5VO73l2SmdAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T22:58:06.570927Z"},"content_sha256":"1ad6b936deb51910c60a4408c1463e0c591e0ce8dd6b0cedfc26a0e74fce896e","schema_version":"1.0","event_id":"sha256:1ad6b936deb51910c60a4408c1463e0c591e0ce8dd6b0cedfc26a0e74fce896e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:CI5GXWVJBOEF3I36REZBI4AMD4","target":"graph","payload":{"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"},"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-14T01:20:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sApUhkFzPb/fZoLEdiKTn8lGhpfXmyC8V/FqNFHztgZofS6wNk4HvJqWg1iTTuW6AOkmGEzAj+I18LNiScX8AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T22:58:06.571424Z"},"content_sha256":"333c07fd572e97790770512704c79b90be758c62a38517657dc94ceb76f0db97","schema_version":"1.0","event_id":"sha256:333c07fd572e97790770512704c79b90be758c62a38517657dc94ceb76f0db97"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CI5GXWVJBOEF3I36REZBI4AMD4/bundle.json","state_url":"https://pith.science/pith/CI5GXWVJBOEF3I36REZBI4AMD4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CI5GXWVJBOEF3I36REZBI4AMD4/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-08-03T22:58:06Z","links":{"resolver":"https://pith.science/pith/CI5GXWVJBOEF3I36REZBI4AMD4","bundle":"https://pith.science/pith/CI5GXWVJBOEF3I36REZBI4AMD4/bundle.json","state":"https://pith.science/pith/CI5GXWVJBOEF3I36REZBI4AMD4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CI5GXWVJBOEF3I36REZBI4AMD4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CI5GXWVJBOEF3I36REZBI4AMD4","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":"a2ede48664d371ee6ad6d7d4442d5fba622b78eb422c5315d49e5d57a665dfcc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-07-11T09:50:28Z","title_canon_sha256":"1113ff094440b029cbce6f02fd4fd8461001e48a157aadd9f77817a9db8c7652"},"schema_version":"1.0","source":{"id":"2607.10236","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.10236","created_at":"2026-07-14T01:20:32Z"},{"alias_kind":"arxiv_version","alias_value":"2607.10236v1","created_at":"2026-07-14T01:20:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.10236","created_at":"2026-07-14T01:20:32Z"},{"alias_kind":"pith_short_12","alias_value":"CI5GXWVJBOEF","created_at":"2026-07-14T01:20:32Z"},{"alias_kind":"pith_short_16","alias_value":"CI5GXWVJBOEF3I36","created_at":"2026-07-14T01:20:32Z"},{"alias_kind":"pith_short_8","alias_value":"CI5GXWVJ","created_at":"2026-07-14T01:20:32Z"}],"graph_snapshots":[{"event_id":"sha256:333c07fd572e97790770512704c79b90be758c62a38517657dc94ceb76f0db97","target":"graph","created_at":"2026-07-14T01:20:32Z","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/2607.10236/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jayalal Sarma, Vaibhav Krishan","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-07-11T09:50:28Z","title":"On CC\\textsuperscript{0} Lower Bounds for AND via Torus Polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.10236","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:1ad6b936deb51910c60a4408c1463e0c591e0ce8dd6b0cedfc26a0e74fce896e","target":"record","created_at":"2026-07-14T01:20:32Z","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":"a2ede48664d371ee6ad6d7d4442d5fba622b78eb422c5315d49e5d57a665dfcc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-07-11T09:50:28Z","title_canon_sha256":"1113ff094440b029cbce6f02fd4fd8461001e48a157aadd9f77817a9db8c7652"},"schema_version":"1.0","source":{"id":"2607.10236","kind":"arxiv","version":1}},"canonical_sha256":"123a6bdaa90b885da37e893214700c1f3ca64a950a4e507aa0c1ce0eca68b1d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"123a6bdaa90b885da37e893214700c1f3ca64a950a4e507aa0c1ce0eca68b1d1","first_computed_at":"2026-07-14T01:20:32.082248Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-14T01:20:32.082248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BHPHlGDPTFpADfPat4qnqZIMxd4zkwK4w7GeHfgQoJVQVsvbgXfs0nbhhRZUC70KSZDrxXoggTvb9pldbh/xDg==","signature_status":"signed_v1","signed_at":"2026-07-14T01:20:32.083152Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.10236","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ad6b936deb51910c60a4408c1463e0c591e0ce8dd6b0cedfc26a0e74fce896e","sha256:333c07fd572e97790770512704c79b90be758c62a38517657dc94ceb76f0db97"],"state_sha256":"9e816575d9ec6ea92106986a198dc7c0caeccb420b038e45917acfa59785f0a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"49j4bzk6s1o6PTyNRg4Q8vhsuRIBBJXmwHc/ELVsmvlxJbSw6L1xllNLdXqb4vOsx6BgBPyis1VnnWGONu1WDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T22:58:06.576076Z","bundle_sha256":"2a86ebae5c9895247874676d084f4b7296e040d216297887cdd856867592fa53"}}