{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GUQSUXVDNVN7GSGNWA66TALDI5","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":"85d33a75c881b4d64a551536afd8df71d1e69af61d8b682da259532c27c8db3c","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-27T17:50:03Z","title_canon_sha256":"92dad904e5eb92a72cb9d719738189551e10e6421077e75cf32ceec46a75b396"},"schema_version":"1.0","source":{"id":"2605.28915","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.28915","created_at":"2026-05-29T00:04:16Z"},{"alias_kind":"arxiv_version","alias_value":"2605.28915v1","created_at":"2026-05-29T00:04:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.28915","created_at":"2026-05-29T00:04:16Z"},{"alias_kind":"pith_short_12","alias_value":"GUQSUXVDNVN7","created_at":"2026-05-29T00:04:16Z"},{"alias_kind":"pith_short_16","alias_value":"GUQSUXVDNVN7GSGN","created_at":"2026-05-29T00:04:16Z"},{"alias_kind":"pith_short_8","alias_value":"GUQSUXVD","created_at":"2026-05-29T00:04:16Z"}],"graph_snapshots":[{"event_id":"sha256:2f094e1a128b050c6b22caee275e1573e1cae768dcfcc40c513de9a562673509","target":"graph","created_at":"2026-05-29T00:04:16Z","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/2605.28915/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $f(k)$ be the maximum possible chromatic number of a graph whose edge set can be partitioned into at most $k$ complete bipartite graphs. Alon, Saks, and Seymour conjectured that $f(k)=k+1$ for all $k$. While the conjecture was verified for $k \\leq 9$ by Gao et al., it was disproved by Huang and Sudakov, and further Balodis et al. proved that $f(k) \\geq 2^{\\widetilde{\\Omega}((\\log k)^2)}$.\n  In this note, we give a simple proof of the recursive upper bound $f(k+1) \\leq f(k)+f(\\lfloor k/4 \\rfloor)$. Consequently, $f(k) \\leq 2^{(\\log_2 (4k))^2/4}$ for $k \\geq 1$. This improves the previous be","authors_text":"Jacob Fox","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-27T17:50:03Z","title":"A note on the Alon-Saks-Seymour problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.28915","kind":"arxiv","version":1},"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:e5d9ae5af05c231e7f658671fb0188ec3902a0671c12e5256f041d58a4624b8f","target":"record","created_at":"2026-05-29T00:04:16Z","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":"85d33a75c881b4d64a551536afd8df71d1e69af61d8b682da259532c27c8db3c","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-27T17:50:03Z","title_canon_sha256":"92dad904e5eb92a72cb9d719738189551e10e6421077e75cf32ceec46a75b396"},"schema_version":"1.0","source":{"id":"2605.28915","kind":"arxiv","version":1}},"canonical_sha256":"35212a5ea36d5bf348cdb03de981634753aeb46f159a11ddbd9ff6b0237a6961","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35212a5ea36d5bf348cdb03de981634753aeb46f159a11ddbd9ff6b0237a6961","first_computed_at":"2026-05-29T00:04:16.435081Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-29T00:04:16.435081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+eojH/t9T6Sx03IizC0fbbeb/P55apC4BaBOSV0PCvCM0IFxd/5hh0mji4fn5dJPSTOY0wIT5AV4XPozyCWSBg==","signature_status":"signed_v1","signed_at":"2026-05-29T00:04:16.435633Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.28915","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5d9ae5af05c231e7f658671fb0188ec3902a0671c12e5256f041d58a4624b8f","sha256:2f094e1a128b050c6b22caee275e1573e1cae768dcfcc40c513de9a562673509"],"state_sha256":"c1c1db1676a7e03be1e94a17e619d40334b7c1a2e196b14df53199925afc6e8d"}