{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:7NZQRWAXBDRURQBDUH5FAHHF63","short_pith_number":"pith:7NZQRWAX","schema_version":"1.0","canonical_sha256":"fb7308d81708e348c023a1fa501ce5f6eda0b1c0c3ffd32fbe1fea0422d7b3e2","source":{"kind":"arxiv","id":"2506.23989","version":1},"attestation_state":"computed","paper":{"title":"Factorization norms and an inverse theorem for MaxCut","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"math.CO","authors_text":"Igor Balla, Istv\\'an Tomon, Lianna Hambardzumyan","submitted_at":"2025-06-30T15:54:45Z","abstract_excerpt":"We prove that Boolean matrices with bounded $\\gamma_2$-norm or bounded normalized trace norm must contain a linear-sized all-ones or all-zeros submatrix, verifying a conjecture of Hambardzumyan, Hatami, and Hatami. We also present further structural results about Boolean matrices of bounded $\\gamma_2$-norm and discuss applications in communication complexity, operator theory, spectral graph theory, and extremal combinatorics.\n  As a key application, we establish an inverse theorem for MaxCut. A celebrated result of Edwards states that every graph $G$ with $m$ edges has a cut of size at least $"},"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":"2506.23989","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-30T15:54:45Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"2373d93ab9810fa56acce8cf46af79f89fd1318a239c9525f90e19e4b14a4d45","abstract_canon_sha256":"76beb05a9b6daafdfcf45fa627029282b5f8e7d3d311281f7429cc6b6c02abc0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:29:31.218933Z","signature_b64":"ieooS+/o1v4PIphRxRp5LQHsKEyZC+fhfrHMSDWLruhO2NaO0HJeK5DzjsaFI8V2DQ4iGGMC4FtIjjjY6ULNDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb7308d81708e348c023a1fa501ce5f6eda0b1c0c3ffd32fbe1fea0422d7b3e2","last_reissued_at":"2026-07-05T11:29:31.218533Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:29:31.218533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Factorization norms and an inverse theorem for MaxCut","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"math.CO","authors_text":"Igor Balla, Istv\\'an Tomon, Lianna Hambardzumyan","submitted_at":"2025-06-30T15:54:45Z","abstract_excerpt":"We prove that Boolean matrices with bounded $\\gamma_2$-norm or bounded normalized trace norm must contain a linear-sized all-ones or all-zeros submatrix, verifying a conjecture of Hambardzumyan, Hatami, and Hatami. We also present further structural results about Boolean matrices of bounded $\\gamma_2$-norm and discuss applications in communication complexity, operator theory, spectral graph theory, and extremal combinatorics.\n  As a key application, we establish an inverse theorem for MaxCut. A celebrated result of Edwards states that every graph $G$ with $m$ edges has a cut of size at least $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.23989","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.23989/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":"2506.23989","created_at":"2026-07-05T11:29:31.218586+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.23989v1","created_at":"2026-07-05T11:29:31.218586+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.23989","created_at":"2026-07-05T11:29:31.218586+00:00"},{"alias_kind":"pith_short_12","alias_value":"7NZQRWAXBDRU","created_at":"2026-07-05T11:29:31.218586+00:00"},{"alias_kind":"pith_short_16","alias_value":"7NZQRWAXBDRURQBD","created_at":"2026-07-05T11:29:31.218586+00:00"},{"alias_kind":"pith_short_8","alias_value":"7NZQRWAX","created_at":"2026-07-05T11:29:31.218586+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25192","citing_title":"Communication complexity of point-line incidences over the reals","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7NZQRWAXBDRURQBDUH5FAHHF63","json":"https://pith.science/pith/7NZQRWAXBDRURQBDUH5FAHHF63.json","graph_json":"https://pith.science/api/pith-number/7NZQRWAXBDRURQBDUH5FAHHF63/graph.json","events_json":"https://pith.science/api/pith-number/7NZQRWAXBDRURQBDUH5FAHHF63/events.json","paper":"https://pith.science/paper/7NZQRWAX"},"agent_actions":{"view_html":"https://pith.science/pith/7NZQRWAXBDRURQBDUH5FAHHF63","download_json":"https://pith.science/pith/7NZQRWAXBDRURQBDUH5FAHHF63.json","view_paper":"https://pith.science/paper/7NZQRWAX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.23989&json=true","fetch_graph":"https://pith.science/api/pith-number/7NZQRWAXBDRURQBDUH5FAHHF63/graph.json","fetch_events":"https://pith.science/api/pith-number/7NZQRWAXBDRURQBDUH5FAHHF63/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7NZQRWAXBDRURQBDUH5FAHHF63/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7NZQRWAXBDRURQBDUH5FAHHF63/action/storage_attestation","attest_author":"https://pith.science/pith/7NZQRWAXBDRURQBDUH5FAHHF63/action/author_attestation","sign_citation":"https://pith.science/pith/7NZQRWAXBDRURQBDUH5FAHHF63/action/citation_signature","submit_replication":"https://pith.science/pith/7NZQRWAXBDRURQBDUH5FAHHF63/action/replication_record"}},"created_at":"2026-07-05T11:29:31.218586+00:00","updated_at":"2026-07-05T11:29:31.218586+00:00"}