{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SZXTEM4VIUWVQBTT7LFY4RQRPL","short_pith_number":"pith:SZXTEM4V","schema_version":"1.0","canonical_sha256":"966f323395452d580673facb8e46117ac956794376765c35a9ecb02fc5ab47f7","source":{"kind":"arxiv","id":"2604.20575","version":3},"attestation_state":"computed","paper":{"title":"A Quadratic Lower Bound for Noncommutative Circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Every fan-in 2 noncommutative arithmetic circuit for the palindrome polynomial requires size Omega of n squared.","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Pratik Shastri","submitted_at":"2026-04-22T13:55:01Z","abstract_excerpt":"We prove that every fan-in $2$ noncommutative arithmetic circuit computing the palindrome polynomial has size $\\Omega(nd)$. In particular, when $d=n$ we obtain an $\\Omega(n^2)$ lower bound. The proof builds on and refines a previous work of the author. Key ideas in the proof were generated by Gemini 3.1 Pro."},"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":"2604.20575","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-04-22T13:55:01Z","cross_cats_sorted":[],"title_canon_sha256":"deb285c1e2158ffa4bac66a8f676b682971b6f9dde02def7c9f3996d69f95abf","abstract_canon_sha256":"134bb6ee22375244ff5c011179820a87cbe0e49439aa0608415d18c96e18b5ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:04:30.544336Z","signature_b64":"tqMMCpatcZrLt5HvfnpYO1MflRaaBJQj3BjeOLwdoHfpmMRF3LGI/vCEn6DsJtfzUGhbio9JAkPONxxO3a4OAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"966f323395452d580673facb8e46117ac956794376765c35a9ecb02fc5ab47f7","last_reissued_at":"2026-05-20T01:04:30.543681Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:04:30.543681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Quadratic Lower Bound for Noncommutative Circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Every fan-in 2 noncommutative arithmetic circuit for the palindrome polynomial requires size Omega of n squared.","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Pratik Shastri","submitted_at":"2026-04-22T13:55:01Z","abstract_excerpt":"We prove that every fan-in $2$ noncommutative arithmetic circuit computing the palindrome polynomial has size $\\Omega(nd)$. In particular, when $d=n$ we obtain an $\\Omega(n^2)$ lower bound. The proof builds on and refines a previous work of the author. Key ideas in the proof were generated by Gemini 3.1 Pro."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"every fan-in 2 noncommutative arithmetic circuit computing the palindrome polynomial has size Ω(n^2)","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The proof relies on refining techniques from the author's prior work; without the full text the precise load-bearing assumptions in the refinement step cannot be identified.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Every fan-in 2 noncommutative arithmetic circuit computing the palindrome polynomial has size Ω(n²).","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Every fan-in 2 noncommutative arithmetic circuit for the palindrome polynomial requires size Omega of n squared.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"4690fd502ab8bbdf0bd914e6caafead2e3c524b2ba61c8a964a4d127fb2b313b"},"source":{"id":"2604.20575","kind":"arxiv","version":3},"verdict":{"id":"040f0f01-ae9d-424f-a72f-a14a0736f34c","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-09T22:42:13.925226Z","strongest_claim":"every fan-in 2 noncommutative arithmetic circuit computing the palindrome polynomial has size Ω(n^2)","one_line_summary":"Every fan-in 2 noncommutative arithmetic circuit computing the palindrome polynomial has size Ω(n²).","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The proof relies on refining techniques from the author's prior work; without the full text the precise load-bearing assumptions in the refinement step cannot be identified.","pith_extraction_headline":"Every fan-in 2 noncommutative arithmetic circuit for the palindrome polynomial requires size Omega of n squared."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.20575/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":"2604.20575","created_at":"2026-05-20T01:04:30.543762+00:00"},{"alias_kind":"arxiv_version","alias_value":"2604.20575v3","created_at":"2026-05-20T01:04:30.543762+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.20575","created_at":"2026-05-20T01:04:30.543762+00:00"},{"alias_kind":"pith_short_12","alias_value":"SZXTEM4VIUWV","created_at":"2026-05-20T01:04:30.543762+00:00"},{"alias_kind":"pith_short_16","alias_value":"SZXTEM4VIUWVQBTT","created_at":"2026-05-20T01:04:30.543762+00:00"},{"alias_kind":"pith_short_8","alias_value":"SZXTEM4V","created_at":"2026-05-20T01:04:30.543762+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/SZXTEM4VIUWVQBTT7LFY4RQRPL","json":"https://pith.science/pith/SZXTEM4VIUWVQBTT7LFY4RQRPL.json","graph_json":"https://pith.science/api/pith-number/SZXTEM4VIUWVQBTT7LFY4RQRPL/graph.json","events_json":"https://pith.science/api/pith-number/SZXTEM4VIUWVQBTT7LFY4RQRPL/events.json","paper":"https://pith.science/paper/SZXTEM4V"},"agent_actions":{"view_html":"https://pith.science/pith/SZXTEM4VIUWVQBTT7LFY4RQRPL","download_json":"https://pith.science/pith/SZXTEM4VIUWVQBTT7LFY4RQRPL.json","view_paper":"https://pith.science/paper/SZXTEM4V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2604.20575&json=true","fetch_graph":"https://pith.science/api/pith-number/SZXTEM4VIUWVQBTT7LFY4RQRPL/graph.json","fetch_events":"https://pith.science/api/pith-number/SZXTEM4VIUWVQBTT7LFY4RQRPL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SZXTEM4VIUWVQBTT7LFY4RQRPL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SZXTEM4VIUWVQBTT7LFY4RQRPL/action/storage_attestation","attest_author":"https://pith.science/pith/SZXTEM4VIUWVQBTT7LFY4RQRPL/action/author_attestation","sign_citation":"https://pith.science/pith/SZXTEM4VIUWVQBTT7LFY4RQRPL/action/citation_signature","submit_replication":"https://pith.science/pith/SZXTEM4VIUWVQBTT7LFY4RQRPL/action/replication_record"}},"created_at":"2026-05-20T01:04:30.543762+00:00","updated_at":"2026-05-20T01:04:30.543762+00:00"}