{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GL5HN2U7JRXP4WAQYEMRF6CHHA","short_pith_number":"pith:GL5HN2U7","schema_version":"1.0","canonical_sha256":"32fa76ea9f4c6efe5810c11912f847381dcea4e74a0660275fa8cf5b194755cb","source":{"kind":"arxiv","id":"2503.17334","version":2},"attestation_state":"computed","paper":{"title":"On almost Gallai colourings in complete graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Grebennikov, Let\\'icia Mattos, Tibor Szab\\'o","submitted_at":"2025-03-21T17:33:27Z","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"},"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":"2503.17334","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-21T17:33:27Z","cross_cats_sorted":[],"title_canon_sha256":"8c62554a9d4e00c58e3975c3151373ebac8c6f1629272218a6a88dee01062951","abstract_canon_sha256":"9bc0b74e8950be239ea215a9591cdaef5d431672b40dc1f1e52450a460ee42fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:38:24.102653Z","signature_b64":"zpZ7M49CrPlO/+3UtP6100zdcGYKDJ1/G5gVU3IdB0uQxjdTGBJ0hq5UwmN5GmqnD5mW548Y4Ye8+9qf3vmkCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32fa76ea9f4c6efe5810c11912f847381dcea4e74a0660275fa8cf5b194755cb","last_reissued_at":"2026-07-05T10:38:24.102217Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:38:24.102217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On almost Gallai colourings in complete graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Grebennikov, Let\\'icia Mattos, Tibor Szab\\'o","submitted_at":"2025-03-21T17:33:27Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.17334","kind":"arxiv","version":2},"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/2503.17334/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":"2503.17334","created_at":"2026-07-05T10:38:24.102276+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.17334v2","created_at":"2026-07-05T10:38:24.102276+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.17334","created_at":"2026-07-05T10:38:24.102276+00:00"},{"alias_kind":"pith_short_12","alias_value":"GL5HN2U7JRXP","created_at":"2026-07-05T10:38:24.102276+00:00"},{"alias_kind":"pith_short_16","alias_value":"GL5HN2U7JRXP4WAQ","created_at":"2026-07-05T10:38:24.102276+00:00"},{"alias_kind":"pith_short_8","alias_value":"GL5HN2U7","created_at":"2026-07-05T10:38:24.102276+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GL5HN2U7JRXP4WAQYEMRF6CHHA","json":"https://pith.science/pith/GL5HN2U7JRXP4WAQYEMRF6CHHA.json","graph_json":"https://pith.science/api/pith-number/GL5HN2U7JRXP4WAQYEMRF6CHHA/graph.json","events_json":"https://pith.science/api/pith-number/GL5HN2U7JRXP4WAQYEMRF6CHHA/events.json","paper":"https://pith.science/paper/GL5HN2U7"},"agent_actions":{"view_html":"https://pith.science/pith/GL5HN2U7JRXP4WAQYEMRF6CHHA","download_json":"https://pith.science/pith/GL5HN2U7JRXP4WAQYEMRF6CHHA.json","view_paper":"https://pith.science/paper/GL5HN2U7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.17334&json=true","fetch_graph":"https://pith.science/api/pith-number/GL5HN2U7JRXP4WAQYEMRF6CHHA/graph.json","fetch_events":"https://pith.science/api/pith-number/GL5HN2U7JRXP4WAQYEMRF6CHHA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GL5HN2U7JRXP4WAQYEMRF6CHHA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GL5HN2U7JRXP4WAQYEMRF6CHHA/action/storage_attestation","attest_author":"https://pith.science/pith/GL5HN2U7JRXP4WAQYEMRF6CHHA/action/author_attestation","sign_citation":"https://pith.science/pith/GL5HN2U7JRXP4WAQYEMRF6CHHA/action/citation_signature","submit_replication":"https://pith.science/pith/GL5HN2U7JRXP4WAQYEMRF6CHHA/action/replication_record"}},"created_at":"2026-07-05T10:38:24.102276+00:00","updated_at":"2026-07-05T10:38:24.102276+00:00"}