{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:GL5HN2U7JRXP4WAQYEMRF6CHHA","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":"9bc0b74e8950be239ea215a9591cdaef5d431672b40dc1f1e52450a460ee42fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-21T17:33:27Z","title_canon_sha256":"8c62554a9d4e00c58e3975c3151373ebac8c6f1629272218a6a88dee01062951"},"schema_version":"1.0","source":{"id":"2503.17334","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.17334","created_at":"2026-07-05T10:38:24Z"},{"alias_kind":"arxiv_version","alias_value":"2503.17334v2","created_at":"2026-07-05T10:38:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.17334","created_at":"2026-07-05T10:38:24Z"},{"alias_kind":"pith_short_12","alias_value":"GL5HN2U7JRXP","created_at":"2026-07-05T10:38:24Z"},{"alias_kind":"pith_short_16","alias_value":"GL5HN2U7JRXP4WAQ","created_at":"2026-07-05T10:38:24Z"},{"alias_kind":"pith_short_8","alias_value":"GL5HN2U7","created_at":"2026-07-05T10:38:24Z"}],"graph_snapshots":[{"event_id":"sha256:6e40dc468cc4b33cc3a28b889a93afe5ced6d8a898ab32a420f76e159f1f3fe8","target":"graph","created_at":"2026-07-05T10:38:24Z","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/2503.17334/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For $t \\in \\mathbb{N}$, we say that a colouring of $E(K_n)$ is $\\textit{almost}$ $t$-$\\textit{Gallai}$ if no two rainbow $t$-cliques share an edge. Motivated by a lemma of Berkowitz on bounding the modulus of the characteristic function of clique counts in random graphs, we study the maximum number $\\tau_t(n)$ of rainbow $t$-cliques in an almost $t$-Gallai colouring of $E(K_n)$. For every $t \\ge 4$, we show that $n^{2-o(1)} \\leq \\tau_t(n) = o(n^2)$. For $t=3$, surprisingly, the behaviour is substantially different. Our main result establishes that $$\\left ( \\frac{1}{2}-o(1) \\right ) n\\log n \\l","authors_text":"Alexandr Grebennikov, Let\\'icia Mattos, Tibor Szab\\'o","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-21T17:33:27Z","title":"On almost Gallai colourings in complete graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.17334","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:5581b7c479298fc3df7662234cb0db771f50feb4e574cda65ca9e0e77f2a8d90","target":"record","created_at":"2026-07-05T10:38:24Z","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":"9bc0b74e8950be239ea215a9591cdaef5d431672b40dc1f1e52450a460ee42fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-21T17:33:27Z","title_canon_sha256":"8c62554a9d4e00c58e3975c3151373ebac8c6f1629272218a6a88dee01062951"},"schema_version":"1.0","source":{"id":"2503.17334","kind":"arxiv","version":2}},"canonical_sha256":"32fa76ea9f4c6efe5810c11912f847381dcea4e74a0660275fa8cf5b194755cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32fa76ea9f4c6efe5810c11912f847381dcea4e74a0660275fa8cf5b194755cb","first_computed_at":"2026-07-05T10:38:24.102217Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:38:24.102217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zpZ7M49CrPlO/+3UtP6100zdcGYKDJ1/G5gVU3IdB0uQxjdTGBJ0hq5UwmN5GmqnD5mW548Y4Ye8+9qf3vmkCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:38:24.102653Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.17334","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5581b7c479298fc3df7662234cb0db771f50feb4e574cda65ca9e0e77f2a8d90","sha256:6e40dc468cc4b33cc3a28b889a93afe5ced6d8a898ab32a420f76e159f1f3fe8"],"state_sha256":"1dbd7f57025af26ca36b46f165db8bbab8a024d84f64d267c851f39c6f18008e"}