{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:GMRVUM5GV7CC4FECW2HJG6HMDT","short_pith_number":"pith:GMRVUM5G","schema_version":"1.0","canonical_sha256":"33235a33a6afc42e1482b68e9378ec1cc9f3cb9769b59c330db9d79fb4b78113","source":{"kind":"arxiv","id":"2605.01038","version":2},"attestation_state":"computed","paper":{"title":"Lower Bounds for Approximate Sign Rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Every sign matrix of approximate sign-rank d contains a monochromatic rectangle of size d to the minus O(d) by d to the minus O(d squared).","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Hamed Hatami, Hasti Karimi, Riju Bindua, Robert Robere","submitted_at":"2026-05-01T19:05:06Z","abstract_excerpt":"We prove new upper and lower bounds on $\\epsilon$-approximate sign-rank, a relaxation of sign-rank introduced by Chornomaz, Moran, and Waknine (STOC 2025). We show that every $m \\times n$ sign matrix with approximate sign-rank $d$ contains a monochromatic rectangle of size $d^{-O(d)}m \\times d^{-O(d^2)}n$, paralleling classical results for exact sign-rank. As an application, we establish a lower bound of $\\Omega(\\sqrt{d/\\log d})$ on the $\\epsilon$-approximate sign-rank of large-margin $d$-dimensional half-spaces. Prior to our work, the only general lower bound technique known for approximate 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":"2605.01038","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-05-01T19:05:06Z","cross_cats_sorted":[],"title_canon_sha256":"c111372a6d7ec734396429587abe81b207fc65b7efb08e2a55a07ab79caa28d3","abstract_canon_sha256":"d2566eede57f94ccc736222758c5095026b92a9ff4d81bc5445bd9799ee80aac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:05:09.799991Z","signature_b64":"K0xhwCXytj0uET+teNO5LC8WInAY5qqclzutcwfqi2Ln9JpYIdB21wOC1WNhaDF/6jxmiX/gTo8QNP08ly7SDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33235a33a6afc42e1482b68e9378ec1cc9f3cb9769b59c330db9d79fb4b78113","last_reissued_at":"2026-05-26T02:05:09.799066Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:05:09.799066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds for Approximate Sign Rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Every sign matrix of approximate sign-rank d contains a monochromatic rectangle of size d to the minus O(d) by d to the minus O(d squared).","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Hamed Hatami, Hasti Karimi, Riju Bindua, Robert Robere","submitted_at":"2026-05-01T19:05:06Z","abstract_excerpt":"We prove new upper and lower bounds on $\\epsilon$-approximate sign-rank, a relaxation of sign-rank introduced by Chornomaz, Moran, and Waknine (STOC 2025). We show that every $m \\times n$ sign matrix with approximate sign-rank $d$ contains a monochromatic rectangle of size $d^{-O(d)}m \\times d^{-O(d^2)}n$, paralleling classical results for exact sign-rank. As an application, we establish a lower bound of $\\Omega(\\sqrt{d/\\log d})$ on the $\\epsilon$-approximate sign-rank of large-margin $d$-dimensional half-spaces. Prior to our work, the only general lower bound technique known for approximate s"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Every m × n sign matrix with ε-approximate sign-rank d contains a monochromatic rectangle of size d^{-O(d)} m × d^{-O(d²)} n, and as a consequence the ε-approximate sign-rank of large-margin d-dimensional half-spaces is Ω(√(d / log d)).","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The points are in general position in R^d, and the Forster-Barthe isotropic position theorem together with the Bourgain-Tzafriri restricted invertibility principle can be applied without additional loss factors that would collapse the d^{-O(d)} subset sizes.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"New lower bounds of Ω(√(d/log d)) for ε-approximate sign-rank of large-margin d-dimensional half-spaces, supported by a geometric theorem guaranteeing large subsets with no common splitting hyperplane.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Every sign matrix of approximate sign-rank d contains a monochromatic rectangle of size d to the minus O(d) by d to the minus O(d squared).","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"fd5fe1fe7b1f1948840354fdf05d45298439277139567d73bfca947f713914bd"},"source":{"id":"2605.01038","kind":"arxiv","version":2},"verdict":{"id":"8185dfa8-4bd4-4d83-8d5e-d1598e114c6e","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-09T14:25:28.476968Z","strongest_claim":"Every m × n sign matrix with ε-approximate sign-rank d contains a monochromatic rectangle of size d^{-O(d)} m × d^{-O(d²)} n, and as a consequence the ε-approximate sign-rank of large-margin d-dimensional half-spaces is Ω(√(d / log d)).","one_line_summary":"New lower bounds of Ω(√(d/log d)) for ε-approximate sign-rank of large-margin d-dimensional half-spaces, supported by a geometric theorem guaranteeing large subsets with no common splitting hyperplane.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The points are in general position in R^d, and the Forster-Barthe isotropic position theorem together with the Bourgain-Tzafriri restricted invertibility principle can be applied without additional loss factors that would collapse the d^{-O(d)} subset sizes.","pith_extraction_headline":"Every sign matrix of approximate sign-rank d contains a monochromatic rectangle of size d to the minus O(d) by d to the minus O(d squared)."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.01038/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T18:39:30.294171Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T17:41:00.971639Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"e0cc4140ad9d48f91d776a02ce164d9dd41bb2f5719001cad8f193732fc6396c"},"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":"2605.01038","created_at":"2026-05-26T02:05:09.799186+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.01038v2","created_at":"2026-05-26T02:05:09.799186+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.01038","created_at":"2026-05-26T02:05:09.799186+00:00"},{"alias_kind":"pith_short_12","alias_value":"GMRVUM5GV7CC","created_at":"2026-05-26T02:05:09.799186+00:00"},{"alias_kind":"pith_short_16","alias_value":"GMRVUM5GV7CC4FEC","created_at":"2026-05-26T02:05:09.799186+00:00"},{"alias_kind":"pith_short_8","alias_value":"GMRVUM5G","created_at":"2026-05-26T02:05:09.799186+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/GMRVUM5GV7CC4FECW2HJG6HMDT","json":"https://pith.science/pith/GMRVUM5GV7CC4FECW2HJG6HMDT.json","graph_json":"https://pith.science/api/pith-number/GMRVUM5GV7CC4FECW2HJG6HMDT/graph.json","events_json":"https://pith.science/api/pith-number/GMRVUM5GV7CC4FECW2HJG6HMDT/events.json","paper":"https://pith.science/paper/GMRVUM5G"},"agent_actions":{"view_html":"https://pith.science/pith/GMRVUM5GV7CC4FECW2HJG6HMDT","download_json":"https://pith.science/pith/GMRVUM5GV7CC4FECW2HJG6HMDT.json","view_paper":"https://pith.science/paper/GMRVUM5G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.01038&json=true","fetch_graph":"https://pith.science/api/pith-number/GMRVUM5GV7CC4FECW2HJG6HMDT/graph.json","fetch_events":"https://pith.science/api/pith-number/GMRVUM5GV7CC4FECW2HJG6HMDT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GMRVUM5GV7CC4FECW2HJG6HMDT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GMRVUM5GV7CC4FECW2HJG6HMDT/action/storage_attestation","attest_author":"https://pith.science/pith/GMRVUM5GV7CC4FECW2HJG6HMDT/action/author_attestation","sign_citation":"https://pith.science/pith/GMRVUM5GV7CC4FECW2HJG6HMDT/action/citation_signature","submit_replication":"https://pith.science/pith/GMRVUM5GV7CC4FECW2HJG6HMDT/action/replication_record"}},"created_at":"2026-05-26T02:05:09.799186+00:00","updated_at":"2026-05-26T02:05:09.799186+00:00"}