{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ZCU4A756IZYMXHLHAVHYM74XFO","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":"e3082d5f571b2c8e3ed8e07214ac4f7d111859a3bb95e46c89e1917ca4d86e41","cross_cats_sorted":["cs.DM","math.NT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-30T18:57:48Z","title_canon_sha256":"c1ed1770c47e60b7c61305becb8745ad592abb1bce3c694ed80aa714a29661c3"},"schema_version":"1.0","source":{"id":"2412.21194","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.21194","created_at":"2026-07-05T09:55:28Z"},{"alias_kind":"arxiv_version","alias_value":"2412.21194v1","created_at":"2026-07-05T09:55:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.21194","created_at":"2026-07-05T09:55:28Z"},{"alias_kind":"pith_short_12","alias_value":"ZCU4A756IZYM","created_at":"2026-07-05T09:55:28Z"},{"alias_kind":"pith_short_16","alias_value":"ZCU4A756IZYMXHLH","created_at":"2026-07-05T09:55:28Z"},{"alias_kind":"pith_short_8","alias_value":"ZCU4A756","created_at":"2026-07-05T09:55:28Z"}],"graph_snapshots":[{"event_id":"sha256:49cb30fa58cb7c43d542d8dc2acf9509c3830c27f6e9d7941b45d5e8b2895fef","target":"graph","created_at":"2026-07-05T09:55:28Z","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/2412.21194/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that a random Cayley graph on a group of order $N$ has clique number $O(\\log N \\log \\log N)$ with high probability. This bound is best possible up to the constant factor for certain groups, including~$\\mathbb{F}_2^n$, and improves the longstanding upper bound of $O(\\log^2 N)$ due to Alon. Our proof does not make use of the underlying group structure and is purely combinatorial, with the key result being an essentially best possible upper bound for the number of subsets of given order that contain at most a given number of colors in a properly edge-colored complete graph. As a further ","authors_text":"David Conlon, Huy Tuan Pham, Jacob Fox, Liana Yepremyan","cross_cats":["cs.DM","math.NT","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-30T18:57:48Z","title":"On the clique number of random Cayley graphs and related topics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.21194","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:36ce14029439ab69242fdc36dbc7161ea44c0cc2ab9864c84f61c4a6ae571307","target":"record","created_at":"2026-07-05T09:55:28Z","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":"e3082d5f571b2c8e3ed8e07214ac4f7d111859a3bb95e46c89e1917ca4d86e41","cross_cats_sorted":["cs.DM","math.NT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-30T18:57:48Z","title_canon_sha256":"c1ed1770c47e60b7c61305becb8745ad592abb1bce3c694ed80aa714a29661c3"},"schema_version":"1.0","source":{"id":"2412.21194","kind":"arxiv","version":1}},"canonical_sha256":"c8a9c07fbe4670cb9d67054f867f972bb2e7c10dfe717acf3084c9426a3cd556","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8a9c07fbe4670cb9d67054f867f972bb2e7c10dfe717acf3084c9426a3cd556","first_computed_at":"2026-07-05T09:55:28.675892Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:55:28.675892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t/Jqgocx0Nc4VbpqDc0LQ5uiQ5IfAbu11ASoBwznYmKgVUB6k1tMlHnMsqd0UFzyLw1b/Hx9HpQLJwHIn/lcDA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:55:28.676397Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.21194","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36ce14029439ab69242fdc36dbc7161ea44c0cc2ab9864c84f61c4a6ae571307","sha256:49cb30fa58cb7c43d542d8dc2acf9509c3830c27f6e9d7941b45d5e8b2895fef"],"state_sha256":"5bd15b6953ffdf9e690d1d1882eac8689b6278fa7290b9a41632346f955f05f9"}