{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:GMRVUM5GV7CC4FECW2HJG6HMDT","short_pith_number":"pith:GMRVUM5G","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"},"canonical_sha256":"33235a33a6afc42e1482b68e9378ec1cc9f3cb9769b59c330db9d79fb4b78113","source":{"kind":"arxiv","id":"2605.01038","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.01038","created_at":"2026-05-26T02:05:09Z"},{"alias_kind":"arxiv_version","alias_value":"2605.01038v2","created_at":"2026-05-26T02:05:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.01038","created_at":"2026-05-26T02:05:09Z"},{"alias_kind":"pith_short_12","alias_value":"GMRVUM5GV7CC","created_at":"2026-05-26T02:05:09Z"},{"alias_kind":"pith_short_16","alias_value":"GMRVUM5GV7CC4FEC","created_at":"2026-05-26T02:05:09Z"},{"alias_kind":"pith_short_8","alias_value":"GMRVUM5G","created_at":"2026-05-26T02:05:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:GMRVUM5GV7CC4FECW2HJG6HMDT","target":"record","payload":{"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"},"canonical_sha256":"33235a33a6afc42e1482b68e9378ec1cc9f3cb9769b59c330db9d79fb4b78113","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"},"source_kind":"arxiv","source_id":"2605.01038","source_version":2,"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-05-26T02:05:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R0FjVRRljjGbzeuR94WxdNmbf3NWGWiZ34n7Z3VIeawpwmVxh5JmtWqhB+COe5BOOOu1IBJg5GmyStM1Tcr0Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T14:31:39.525111Z"},"content_sha256":"f1ae58503a4f2441062b03a34da238d8b3b0a1df295497f2ac1aa5833e5f74bd","schema_version":"1.0","event_id":"sha256:f1ae58503a4f2441062b03a34da238d8b3b0a1df295497f2ac1aa5833e5f74bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:GMRVUM5GV7CC4FECW2HJG6HMDT","target":"graph","payload":{"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"},"verdict_id":"8185dfa8-4bd4-4d83-8d5e-d1598e114c6e"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-26T02:05:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qMMX0IkLnqfSrJvPVsmXxc0j9PsjRKoSHZkte4Fv8pwbstz6rqeAt45v0Fu7r4wt4iqPTOG2ulEwkGummQEdDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T14:31:39.525675Z"},"content_sha256":"7b6be17bfe38005ce1ea730c0552fb43b591698146714d916054e6a8fb9c851b","schema_version":"1.0","event_id":"sha256:7b6be17bfe38005ce1ea730c0552fb43b591698146714d916054e6a8fb9c851b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GMRVUM5GV7CC4FECW2HJG6HMDT/bundle.json","state_url":"https://pith.science/pith/GMRVUM5GV7CC4FECW2HJG6HMDT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GMRVUM5GV7CC4FECW2HJG6HMDT/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-06-10T14:31:39Z","links":{"resolver":"https://pith.science/pith/GMRVUM5GV7CC4FECW2HJG6HMDT","bundle":"https://pith.science/pith/GMRVUM5GV7CC4FECW2HJG6HMDT/bundle.json","state":"https://pith.science/pith/GMRVUM5GV7CC4FECW2HJG6HMDT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GMRVUM5GV7CC4FECW2HJG6HMDT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GMRVUM5GV7CC4FECW2HJG6HMDT","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":"d2566eede57f94ccc736222758c5095026b92a9ff4d81bc5445bd9799ee80aac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-05-01T19:05:06Z","title_canon_sha256":"c111372a6d7ec734396429587abe81b207fc65b7efb08e2a55a07ab79caa28d3"},"schema_version":"1.0","source":{"id":"2605.01038","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.01038","created_at":"2026-05-26T02:05:09Z"},{"alias_kind":"arxiv_version","alias_value":"2605.01038v2","created_at":"2026-05-26T02:05:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.01038","created_at":"2026-05-26T02:05:09Z"},{"alias_kind":"pith_short_12","alias_value":"GMRVUM5GV7CC","created_at":"2026-05-26T02:05:09Z"},{"alias_kind":"pith_short_16","alias_value":"GMRVUM5GV7CC4FEC","created_at":"2026-05-26T02:05:09Z"},{"alias_kind":"pith_short_8","alias_value":"GMRVUM5G","created_at":"2026-05-26T02:05:09Z"}],"graph_snapshots":[{"event_id":"sha256:7b6be17bfe38005ce1ea730c0552fb43b591698146714d916054e6a8fb9c851b","target":"graph","created_at":"2026-05-26T02:05:09Z","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 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))."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","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)."}],"snapshot_sha256":"fd5fe1fe7b1f1948840354fdf05d45298439277139567d73bfca947f713914bd"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"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"}],"endpoint":"/pith/2605.01038/integrity.json","findings":[],"snapshot_sha256":"e0cc4140ad9d48f91d776a02ce164d9dd41bb2f5719001cad8f193732fc6396c","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Hamed Hatami, Hasti Karimi, Riju Bindua, Robert Robere","cross_cats":[],"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).","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-05-01T19:05:06Z","title":"Lower Bounds for Approximate Sign Rank"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.01038","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-09T14:25:28.476968Z","id":"8185dfa8-4bd4-4d83-8d5e-d1598e114c6e","model_set":{"reader":"grok-4.3"},"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","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).","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)).","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."}},"verdict_id":"8185dfa8-4bd4-4d83-8d5e-d1598e114c6e"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f1ae58503a4f2441062b03a34da238d8b3b0a1df295497f2ac1aa5833e5f74bd","target":"record","created_at":"2026-05-26T02:05:09Z","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":"d2566eede57f94ccc736222758c5095026b92a9ff4d81bc5445bd9799ee80aac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-05-01T19:05:06Z","title_canon_sha256":"c111372a6d7ec734396429587abe81b207fc65b7efb08e2a55a07ab79caa28d3"},"schema_version":"1.0","source":{"id":"2605.01038","kind":"arxiv","version":2}},"canonical_sha256":"33235a33a6afc42e1482b68e9378ec1cc9f3cb9769b59c330db9d79fb4b78113","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33235a33a6afc42e1482b68e9378ec1cc9f3cb9769b59c330db9d79fb4b78113","first_computed_at":"2026-05-26T02:05:09.799066Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T02:05:09.799066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K0xhwCXytj0uET+teNO5LC8WInAY5qqclzutcwfqi2Ln9JpYIdB21wOC1WNhaDF/6jxmiX/gTo8QNP08ly7SDA==","signature_status":"signed_v1","signed_at":"2026-05-26T02:05:09.799991Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.01038","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1ae58503a4f2441062b03a34da238d8b3b0a1df295497f2ac1aa5833e5f74bd","sha256:7b6be17bfe38005ce1ea730c0552fb43b591698146714d916054e6a8fb9c851b"],"state_sha256":"827d144d5d04c8d8726298aeb425fc5be32d0afc42f8c259ed4864572c8db72a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qCWEcqVzq4NpUqgzElEJs3Sb142YPHYExtN+wGbiPFb5wjXhN6ghFM+2sK7gJ2q/Io/o0sXlE4yuILuuKR/2BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T14:31:39.528081Z","bundle_sha256":"54ffa449fc4d40c9b27e2c2abefb0772a6dcc89a891b6fa53a8e0ca1bfb072dd"}}