{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6YYEUPTTUO6WVDZGN4IARIG3XE","short_pith_number":"pith:6YYEUPTT","canonical_record":{"source":{"id":"1402.2087","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-10T10:22:15Z","cross_cats_sorted":[],"title_canon_sha256":"62128c8a8f2dfe2549a186e8f37ea49a9af30dd84d222187fee67907f2548098","abstract_canon_sha256":"6024fb8ad221ee841d9a8e42edec565350b16839da84b4e0718e6f8a9584fa53"},"schema_version":"1.0"},"canonical_sha256":"f6304a3e73a3bd6a8f266f1008a0dbb917432699b8fed29c8a835f6189c4ce92","source":{"kind":"arxiv","id":"1402.2087","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2087","created_at":"2026-05-18T02:58:23Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2087v2","created_at":"2026-05-18T02:58:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2087","created_at":"2026-05-18T02:58:23Z"},{"alias_kind":"pith_short_12","alias_value":"6YYEUPTTUO6W","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6YYEUPTTUO6WVDZG","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6YYEUPTT","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6YYEUPTTUO6WVDZGN4IARIG3XE","target":"record","payload":{"canonical_record":{"source":{"id":"1402.2087","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-10T10:22:15Z","cross_cats_sorted":[],"title_canon_sha256":"62128c8a8f2dfe2549a186e8f37ea49a9af30dd84d222187fee67907f2548098","abstract_canon_sha256":"6024fb8ad221ee841d9a8e42edec565350b16839da84b4e0718e6f8a9584fa53"},"schema_version":"1.0"},"canonical_sha256":"f6304a3e73a3bd6a8f266f1008a0dbb917432699b8fed29c8a835f6189c4ce92","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:23.069335Z","signature_b64":"8zd8KYrE86tv7EeZiR4DcoNvcswVgkBEKdLMeqxuZGQx1WNa866tUMZYTZ4unx0RKCRrmy53UpvnEAcKbyujDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6304a3e73a3bd6a8f266f1008a0dbb917432699b8fed29c8a835f6189c4ce92","last_reissued_at":"2026-05-18T02:58:23.068915Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:23.068915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.2087","source_version":2,"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-05-18T02:58:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xo3I25OfugL1p5NdMGjtsiKXwIAkzw11p3luatngDC/RxkNcrgKdZN6eHEYiYDdKfTasEEo2PsqSUWUn4yLvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:49:30.107042Z"},"content_sha256":"2d9bb8a8b2c38dd870f85f698b6f996ef276c2422f95469b7205ba51ef735e0d","schema_version":"1.0","event_id":"sha256:2d9bb8a8b2c38dd870f85f698b6f996ef276c2422f95469b7205ba51ef735e0d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6YYEUPTTUO6WVDZGN4IARIG3XE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Connected Colourings of Complete Graphs and Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Imre Leader, Ta Sheng Tan","submitted_at":"2014-02-10T10:22:15Z","abstract_excerpt":"Gallai's colouring theorem states that if the edges of a complete graph are 3-coloured, with each colour class forming a connected (spanning) subgraph, then there is a triangle that has all 3 colours. What happens for more colours: if we $k$-colour the edges of the complete graph, with each colour class connected, how many of the $\\binom{k}{3}$ triples of colours must appear as triangles?\n  In this note we show that the `obvious' conjecture, namely that there are always at least $\\binom{k-1}{2}$ triples, is not correct. We determine the minimum asymptotically. This answers a question of Johnso"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2087","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":""},"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-05-18T02:58:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C58v3z1k374+xauWUkVfKv5W29fEAF61HyzDxeDZ54pU99sKyM6To/LzyGff5I7XhsbGoZ2R+kkTimpn6U8vBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:49:30.107395Z"},"content_sha256":"3765420f4bf0e20838b6673a75a4709e44243d7b02096adef983f373ae430238","schema_version":"1.0","event_id":"sha256:3765420f4bf0e20838b6673a75a4709e44243d7b02096adef983f373ae430238"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6YYEUPTTUO6WVDZGN4IARIG3XE/bundle.json","state_url":"https://pith.science/pith/6YYEUPTTUO6WVDZGN4IARIG3XE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6YYEUPTTUO6WVDZGN4IARIG3XE/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-06-02T15:49:30Z","links":{"resolver":"https://pith.science/pith/6YYEUPTTUO6WVDZGN4IARIG3XE","bundle":"https://pith.science/pith/6YYEUPTTUO6WVDZGN4IARIG3XE/bundle.json","state":"https://pith.science/pith/6YYEUPTTUO6WVDZGN4IARIG3XE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6YYEUPTTUO6WVDZGN4IARIG3XE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6YYEUPTTUO6WVDZGN4IARIG3XE","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":"6024fb8ad221ee841d9a8e42edec565350b16839da84b4e0718e6f8a9584fa53","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-10T10:22:15Z","title_canon_sha256":"62128c8a8f2dfe2549a186e8f37ea49a9af30dd84d222187fee67907f2548098"},"schema_version":"1.0","source":{"id":"1402.2087","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2087","created_at":"2026-05-18T02:58:23Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2087v2","created_at":"2026-05-18T02:58:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2087","created_at":"2026-05-18T02:58:23Z"},{"alias_kind":"pith_short_12","alias_value":"6YYEUPTTUO6W","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6YYEUPTTUO6WVDZG","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6YYEUPTT","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:3765420f4bf0e20838b6673a75a4709e44243d7b02096adef983f373ae430238","target":"graph","created_at":"2026-05-18T02:58:23Z","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"},"paper":{"abstract_excerpt":"Gallai's colouring theorem states that if the edges of a complete graph are 3-coloured, with each colour class forming a connected (spanning) subgraph, then there is a triangle that has all 3 colours. What happens for more colours: if we $k$-colour the edges of the complete graph, with each colour class connected, how many of the $\\binom{k}{3}$ triples of colours must appear as triangles?\n  In this note we show that the `obvious' conjecture, namely that there are always at least $\\binom{k-1}{2}$ triples, is not correct. We determine the minimum asymptotically. This answers a question of Johnso","authors_text":"Imre Leader, Ta Sheng Tan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-10T10:22:15Z","title":"Connected Colourings of Complete Graphs and Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2087","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:2d9bb8a8b2c38dd870f85f698b6f996ef276c2422f95469b7205ba51ef735e0d","target":"record","created_at":"2026-05-18T02:58:23Z","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":"6024fb8ad221ee841d9a8e42edec565350b16839da84b4e0718e6f8a9584fa53","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-10T10:22:15Z","title_canon_sha256":"62128c8a8f2dfe2549a186e8f37ea49a9af30dd84d222187fee67907f2548098"},"schema_version":"1.0","source":{"id":"1402.2087","kind":"arxiv","version":2}},"canonical_sha256":"f6304a3e73a3bd6a8f266f1008a0dbb917432699b8fed29c8a835f6189c4ce92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6304a3e73a3bd6a8f266f1008a0dbb917432699b8fed29c8a835f6189c4ce92","first_computed_at":"2026-05-18T02:58:23.068915Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:23.068915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8zd8KYrE86tv7EeZiR4DcoNvcswVgkBEKdLMeqxuZGQx1WNa866tUMZYTZ4unx0RKCRrmy53UpvnEAcKbyujDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:23.069335Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.2087","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d9bb8a8b2c38dd870f85f698b6f996ef276c2422f95469b7205ba51ef735e0d","sha256:3765420f4bf0e20838b6673a75a4709e44243d7b02096adef983f373ae430238"],"state_sha256":"3b663a8ac5725b426f992336929c28f73fe54a76c507603cfcffcdc23810c33b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"54hALUP/3OxUajOew2aKCADFnZUdibN2es1V4KMyKrbsPHw33h53mSjF0yd07o3FqXWfcPr9sX1JsxqqsIIiCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T15:49:30.109203Z","bundle_sha256":"663b4b7877e90949480586e5e95cde54e10a24fc884ffa2487ef7d2cc5b4cb04"}}