{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SZXTEM4VIUWVQBTT7LFY4RQRPL","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":"134bb6ee22375244ff5c011179820a87cbe0e49439aa0608415d18c96e18b5ab","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-04-22T13:55:01Z","title_canon_sha256":"deb285c1e2158ffa4bac66a8f676b682971b6f9dde02def7c9f3996d69f95abf"},"schema_version":"1.0","source":{"id":"2604.20575","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.20575","created_at":"2026-05-20T01:04:30Z"},{"alias_kind":"arxiv_version","alias_value":"2604.20575v3","created_at":"2026-05-20T01:04:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.20575","created_at":"2026-05-20T01:04:30Z"},{"alias_kind":"pith_short_12","alias_value":"SZXTEM4VIUWV","created_at":"2026-05-20T01:04:30Z"},{"alias_kind":"pith_short_16","alias_value":"SZXTEM4VIUWVQBTT","created_at":"2026-05-20T01:04:30Z"},{"alias_kind":"pith_short_8","alias_value":"SZXTEM4V","created_at":"2026-05-20T01:04:30Z"}],"graph_snapshots":[{"event_id":"sha256:cbd403d01a3adf19a733ee08c1e1d672f4145c24139a935162f3b8294381ab3d","target":"graph","created_at":"2026-05-20T01:04:30Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"every fan-in 2 noncommutative arithmetic circuit computing the palindrome polynomial has size Ω(n^2)"},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Every fan-in 2 noncommutative arithmetic circuit computing the palindrome polynomial has size Ω(n²)."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Every fan-in 2 noncommutative arithmetic circuit for the palindrome polynomial requires size Omega of n squared."}],"snapshot_sha256":"4690fd502ab8bbdf0bd914e6caafead2e3c524b2ba61c8a964a4d127fb2b313b"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.20575/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Pratik Shastri","cross_cats":[],"headline":"Every fan-in 2 noncommutative arithmetic circuit for the palindrome polynomial requires size Omega of n squared.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-04-22T13:55:01Z","title":"A Quadratic Lower Bound for Noncommutative Circuits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.20575","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-09T22:42:13.925226Z","id":"040f0f01-ae9d-424f-a72f-a14a0736f34c","model_set":{"reader":"grok-4.3"},"one_line_summary":"Every fan-in 2 noncommutative arithmetic circuit computing the palindrome polynomial has size Ω(n²).","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Every fan-in 2 noncommutative arithmetic circuit for the palindrome polynomial requires size Omega of n squared.","strongest_claim":"every fan-in 2 noncommutative arithmetic circuit computing the palindrome polynomial has size Ω(n^2)","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."}},"verdict_id":"040f0f01-ae9d-424f-a72f-a14a0736f34c"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:88c2625eccbb4a6dec3ed2776f6109e2e846680294686ca3e954b14dd2c2425a","target":"record","created_at":"2026-05-20T01:04:30Z","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":"134bb6ee22375244ff5c011179820a87cbe0e49439aa0608415d18c96e18b5ab","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-04-22T13:55:01Z","title_canon_sha256":"deb285c1e2158ffa4bac66a8f676b682971b6f9dde02def7c9f3996d69f95abf"},"schema_version":"1.0","source":{"id":"2604.20575","kind":"arxiv","version":3}},"canonical_sha256":"966f323395452d580673facb8e46117ac956794376765c35a9ecb02fc5ab47f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"966f323395452d580673facb8e46117ac956794376765c35a9ecb02fc5ab47f7","first_computed_at":"2026-05-20T01:04:30.543681Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T01:04:30.543681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tqMMCpatcZrLt5HvfnpYO1MflRaaBJQj3BjeOLwdoHfpmMRF3LGI/vCEn6DsJtfzUGhbio9JAkPONxxO3a4OAg==","signature_status":"signed_v1","signed_at":"2026-05-20T01:04:30.544336Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.20575","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88c2625eccbb4a6dec3ed2776f6109e2e846680294686ca3e954b14dd2c2425a","sha256:cbd403d01a3adf19a733ee08c1e1d672f4145c24139a935162f3b8294381ab3d"],"state_sha256":"8b286e51a37e7a8274d5fbda684153583b260353f923f20bb707d8565a71e97c"}