{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:54LDAI6FZJWXJAFBY5ADEYVME6","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":"2b9764f0f03d752938822f0d37ff479efff34b6a533f355bc061bb9b621b935e","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-25T18:23:04Z","title_canon_sha256":"e772c5230878bf98d78cb6051da7a8a58b011526cd4ab3684999b0d27fab3ec5"},"schema_version":"1.0","source":{"id":"2502.18429","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.18429","created_at":"2026-07-05T10:22:58Z"},{"alias_kind":"arxiv_version","alias_value":"2502.18429v2","created_at":"2026-07-05T10:22:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.18429","created_at":"2026-07-05T10:22:58Z"},{"alias_kind":"pith_short_12","alias_value":"54LDAI6FZJWX","created_at":"2026-07-05T10:22:58Z"},{"alias_kind":"pith_short_16","alias_value":"54LDAI6FZJWXJAFB","created_at":"2026-07-05T10:22:58Z"},{"alias_kind":"pith_short_8","alias_value":"54LDAI6F","created_at":"2026-07-05T10:22:58Z"}],"graph_snapshots":[{"event_id":"sha256:cfd520e75e48efb99cd60f4331ec7d9071af3ca013279f28adc39bd27fac5263","target":"graph","created_at":"2026-07-05T10:22:58Z","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/2502.18429/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The $\\gamma_2$-norm of Boolean matrices plays an important role in communication complexity and discrepancy theory. In this paper, we study combinatorial properties of this norm, and provide new applications, involving Zarankiewicz type problems. We show that if $M$ is an $m\\times n$ Boolean matrix such that $\\gamma_2(M)<\\gamma$ and $M$ contains no $t\\times t$ all-ones submatrix, then $M$ contains $O_{\\gamma,t}(m+n)$ one entries. In other words, graphs of bounded $\\gamma_2$-norm are degree bounded. This addresses a conjecture of Hambardzumyan, Hatami, and Hatami for locally sparse matrices. We","authors_text":"Istv\\'an Tomon","cross_cats":["cs.CC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-25T18:23:04Z","title":"Factorization norms and Zarankiewicz problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.18429","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:da94e27963fe84f1724a45f324fd08f66e44735ab6d8a8ae16fa767fa49db0bf","target":"record","created_at":"2026-07-05T10:22:58Z","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":"2b9764f0f03d752938822f0d37ff479efff34b6a533f355bc061bb9b621b935e","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-25T18:23:04Z","title_canon_sha256":"e772c5230878bf98d78cb6051da7a8a58b011526cd4ab3684999b0d27fab3ec5"},"schema_version":"1.0","source":{"id":"2502.18429","kind":"arxiv","version":2}},"canonical_sha256":"ef163023c5ca6d7480a1c7403262ac27a25c744b1a112b89a8f275c81d8d723c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef163023c5ca6d7480a1c7403262ac27a25c744b1a112b89a8f275c81d8d723c","first_computed_at":"2026-07-05T10:22:58.054393Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:22:58.054393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JG3mPJxya8dDapJg7PIQEAjTcCz8iV0FOhpieShYFohEVqarkgyrI5Uq38rWTieTbK1NVyVG5rHo4kp8HgxZCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:22:58.054931Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.18429","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da94e27963fe84f1724a45f324fd08f66e44735ab6d8a8ae16fa767fa49db0bf","sha256:cfd520e75e48efb99cd60f4331ec7d9071af3ca013279f28adc39bd27fac5263"],"state_sha256":"5a0ea7ea26d0fc857f6ad779c7942888d84da07afb14b10cf67850e0f11b82e1"}