{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ZCU4A756IZYMXHLHAVHYM74XFO","short_pith_number":"pith:ZCU4A756","canonical_record":{"source":{"id":"2412.21194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-30T18:57:48Z","cross_cats_sorted":["cs.DM","math.NT","math.PR"],"title_canon_sha256":"c1ed1770c47e60b7c61305becb8745ad592abb1bce3c694ed80aa714a29661c3","abstract_canon_sha256":"e3082d5f571b2c8e3ed8e07214ac4f7d111859a3bb95e46c89e1917ca4d86e41"},"schema_version":"1.0"},"canonical_sha256":"c8a9c07fbe4670cb9d67054f867f972bb2e7c10dfe717acf3084c9426a3cd556","source":{"kind":"arxiv","id":"2412.21194","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ZCU4A756IZYMXHLHAVHYM74XFO","target":"record","payload":{"canonical_record":{"source":{"id":"2412.21194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-30T18:57:48Z","cross_cats_sorted":["cs.DM","math.NT","math.PR"],"title_canon_sha256":"c1ed1770c47e60b7c61305becb8745ad592abb1bce3c694ed80aa714a29661c3","abstract_canon_sha256":"e3082d5f571b2c8e3ed8e07214ac4f7d111859a3bb95e46c89e1917ca4d86e41"},"schema_version":"1.0"},"canonical_sha256":"c8a9c07fbe4670cb9d67054f867f972bb2e7c10dfe717acf3084c9426a3cd556","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:55:28.676397Z","signature_b64":"t/Jqgocx0Nc4VbpqDc0LQ5uiQ5IfAbu11ASoBwznYmKgVUB6k1tMlHnMsqd0UFzyLw1b/Hx9HpQLJwHIn/lcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8a9c07fbe4670cb9d67054f867f972bb2e7c10dfe717acf3084c9426a3cd556","last_reissued_at":"2026-07-05T09:55:28.675892Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:55:28.675892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.21194","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:55:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jBi4w/1T7YaUHaYWi7C7oIVh5LP9XMJduHrEucoI2laloTKsymHprgPmt/M2410exligyIkgytd6YULyskB+CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T11:34:53.745415Z"},"content_sha256":"36ce14029439ab69242fdc36dbc7161ea44c0cc2ab9864c84f61c4a6ae571307","schema_version":"1.0","event_id":"sha256:36ce14029439ab69242fdc36dbc7161ea44c0cc2ab9864c84f61c4a6ae571307"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ZCU4A756IZYMXHLHAVHYM74XFO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the clique number of random Cayley graphs and related topics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.NT","math.PR"],"primary_cat":"math.CO","authors_text":"David Conlon, Huy Tuan Pham, Jacob Fox, Liana Yepremyan","submitted_at":"2024-12-30T18:57:48Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.21194","kind":"arxiv","version":1},"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/2412.21194/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:55:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yIkHGPmGixc9w16FnyFOdTE2qkZ739+2t2AH2H+KQUaQTuG8UM8NfBytO/3V9IBfVvVwFrZHb06+G8VLYn66Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T11:34:53.745909Z"},"content_sha256":"49cb30fa58cb7c43d542d8dc2acf9509c3830c27f6e9d7941b45d5e8b2895fef","schema_version":"1.0","event_id":"sha256:49cb30fa58cb7c43d542d8dc2acf9509c3830c27f6e9d7941b45d5e8b2895fef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZCU4A756IZYMXHLHAVHYM74XFO/bundle.json","state_url":"https://pith.science/pith/ZCU4A756IZYMXHLHAVHYM74XFO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZCU4A756IZYMXHLHAVHYM74XFO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-12T11:34:53Z","links":{"resolver":"https://pith.science/pith/ZCU4A756IZYMXHLHAVHYM74XFO","bundle":"https://pith.science/pith/ZCU4A756IZYMXHLHAVHYM74XFO/bundle.json","state":"https://pith.science/pith/ZCU4A756IZYMXHLHAVHYM74XFO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZCU4A756IZYMXHLHAVHYM74XFO/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tr4PlZpEbbuzYKaz/o/cbukzkQ2D60AjoUM6ZGByWCv22cM8ghF0Hm2yehTaQJvpwf05zj3n7GdHAcY+hQMdCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T11:34:53.749775Z","bundle_sha256":"ca5fcc5107d54e5cdcb9f3abbfa978d634567bdbf3525799a718c13ec8b3c0ad"}}