{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:BEWB436GFFWX5UEAGCY72VRMUZ","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":"0c200360666e537a17867d44307be1cb948dbcdbb254884b7db72f1813ca344b","cross_cats_sorted":["cs.CC","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-09T16:26:06Z","title_canon_sha256":"3acd601e2e61649801b56278b647fca1ff9f7994edf7d420c736e992a8652c07"},"schema_version":"1.0","source":{"id":"2504.07006","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.07006","created_at":"2026-07-05T11:36:30Z"},{"alias_kind":"arxiv_version","alias_value":"2504.07006v2","created_at":"2026-07-05T11:36:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.07006","created_at":"2026-07-05T11:36:30Z"},{"alias_kind":"pith_short_12","alias_value":"BEWB436GFFWX","created_at":"2026-07-05T11:36:30Z"},{"alias_kind":"pith_short_16","alias_value":"BEWB436GFFWX5UEA","created_at":"2026-07-05T11:36:30Z"},{"alias_kind":"pith_short_8","alias_value":"BEWB436G","created_at":"2026-07-05T11:36:30Z"}],"graph_snapshots":[{"event_id":"sha256:e5deca077720b9c21b2497f8e0282ccab6eb811cbe5e004d9554238470012c7c","target":"graph","created_at":"2026-07-05T11:36: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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2504.07006/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G$ be a finite abelian group and $A$ be a subset of $G \\times G$ which is corner--free, meaning that there are no $x, y \\in G$ and $d \\in G \\setminus \\{0\\}$ such that $(x, y)$, $(x+d, y)$, $(x, y+d) \\in A$. We prove that \\[|A| \\le |G|^2 \\cdot \\exp(-(\\log |G|)^{\\Omega(1)}).\\] As a consequence, we obtain polynomial (in the input length) lower bounds on the nondeterministic communication complexity of Exactly-N in the 3-player Number-on-Forehead model. We also obtain the first \"reasonable'' lower bounds on the coloring version of the $3$-dimensional corners problem, as well as on the nondete","authors_text":"Anthony Ostuni, Mehtaab Sawhney, Michael Jaber, Shachar Lovett, Yang P. Liu","cross_cats":["cs.CC","math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-09T16:26:06Z","title":"Quasipolynomial bounds for the corners theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.07006","kind":"arxiv","version":2},"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:23cc9b74b039b039b9f48b468a904592314f727c6cc0982e4c0fb57d8254d496","target":"record","created_at":"2026-07-05T11:36: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":"0c200360666e537a17867d44307be1cb948dbcdbb254884b7db72f1813ca344b","cross_cats_sorted":["cs.CC","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-09T16:26:06Z","title_canon_sha256":"3acd601e2e61649801b56278b647fca1ff9f7994edf7d420c736e992a8652c07"},"schema_version":"1.0","source":{"id":"2504.07006","kind":"arxiv","version":2}},"canonical_sha256":"092c1e6fc6296d7ed08030b1fd562ca6719fad1ce9f009bd36d9dd32691c0018","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"092c1e6fc6296d7ed08030b1fd562ca6719fad1ce9f009bd36d9dd32691c0018","first_computed_at":"2026-07-05T11:36:30.531648Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:36:30.531648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I64u2SmUxXVxKGN6EdTyDteldOZI7H/6bfiHF5evHIt2Dv3ZyG8I6kUebf5bijt4C5LWZwxW63cuTAC7jhkYDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:36:30.532163Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.07006","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23cc9b74b039b039b9f48b468a904592314f727c6cc0982e4c0fb57d8254d496","sha256:e5deca077720b9c21b2497f8e0282ccab6eb811cbe5e004d9554238470012c7c"],"state_sha256":"5595521295ebbcdc9c4b25e1145dd64b6c8b80bfbea330456be002a3f294b3dd"}