{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WTUJYHBU522MJDX765GVZQE47T","short_pith_number":"pith:WTUJYHBU","canonical_record":{"source":{"id":"1605.05074","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-17T09:40:00Z","cross_cats_sorted":[],"title_canon_sha256":"78518252d5b6905453729e196b21fa8a80d8ecd8e1dd62306049f9deabad46d5","abstract_canon_sha256":"f6b4efd358501cb01347091c4aeafff254c7d954497eb5f5933eae903704a217"},"schema_version":"1.0"},"canonical_sha256":"b4e89c1c34eeb4c48efff74d5cc09cfcc5d49d14581255c2136ec1826c5c60ba","source":{"kind":"arxiv","id":"1605.05074","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05074","created_at":"2026-05-18T00:33:23Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05074v2","created_at":"2026-05-18T00:33:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05074","created_at":"2026-05-18T00:33:23Z"},{"alias_kind":"pith_short_12","alias_value":"WTUJYHBU522M","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"WTUJYHBU522MJDX7","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"WTUJYHBU","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WTUJYHBU522MJDX765GVZQE47T","target":"record","payload":{"canonical_record":{"source":{"id":"1605.05074","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-17T09:40:00Z","cross_cats_sorted":[],"title_canon_sha256":"78518252d5b6905453729e196b21fa8a80d8ecd8e1dd62306049f9deabad46d5","abstract_canon_sha256":"f6b4efd358501cb01347091c4aeafff254c7d954497eb5f5933eae903704a217"},"schema_version":"1.0"},"canonical_sha256":"b4e89c1c34eeb4c48efff74d5cc09cfcc5d49d14581255c2136ec1826c5c60ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:23.696071Z","signature_b64":"itgMeujkXhON9NehAJeAjdzwnRdZVLQCwoI8lMkQAmzMNXYXG7vEJnyhWbL8VwGr7IuxxZ+oSXzX/XFxc3W/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4e89c1c34eeb4c48efff74d5cc09cfcc5d49d14581255c2136ec1826c5c60ba","last_reissued_at":"2026-05-18T00:33:23.695447Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:23.695447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.05074","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-18T00:33:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jKDACNWyKeP0O7+EPtJvBlWbsV/FZPTRIPXmb4DDUR3q+OA1t6uOpxlDwYvo2rCiy7WJG1pl1DlfRWrbqpwcBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T19:04:28.805905Z"},"content_sha256":"b5e8e163b9fab17295bd199f1d5c13caa9874bf82cf30fec0c1f253ba67eae6f","schema_version":"1.0","event_id":"sha256:b5e8e163b9fab17295bd199f1d5c13caa9874bf82cf30fec0c1f253ba67eae6f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WTUJYHBU522MJDX765GVZQE47T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Erd\\H{o}s-Rothschild problem on edge-colourings with forbidden monochromatic cliques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Katherine Staden, Oleg Pikhurko, Zelealem B. Yilma","submitted_at":"2016-05-17T09:40:00Z","abstract_excerpt":"Let $\\mathbf{k} := (k_1,\\dots,k_s)$ be a sequence of natural numbers. For a graph $G$, let $F(G;\\mathbf{k})$ denote the number of colourings of the edges of $G$ with colours $1,\\dots,s$ such that, for every $c \\in \\{1,\\dots,s\\}$, the edges of colour $c$ contain no clique of order $k_c$. Write $F(n;\\mathbf{k})$ to denote the maximum of $F(G;\\mathbf{k})$ over all graphs $G$ on $n$ vertices. This problem was first considered by Erd\\H{o}s and Rothschild in 1974, but it has been solved only for a very small number of non-trivial cases.\n  We prove that, for every $\\mathbf{k}$ and $n$, there is a com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05074","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-18T00:33:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oDhyHGocpRMO/rbTSv/hUojkriF/spb5k4o4N8jE7iS0Qydr9HgMW4nVU4/7/4pDZELraeuFE5ouIJO5Vm6jCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T19:04:28.806257Z"},"content_sha256":"c5f604d08f2a5c22146390ee62de0957c3bfb195957c3f50657dbb7f490f293d","schema_version":"1.0","event_id":"sha256:c5f604d08f2a5c22146390ee62de0957c3bfb195957c3f50657dbb7f490f293d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WTUJYHBU522MJDX765GVZQE47T/bundle.json","state_url":"https://pith.science/pith/WTUJYHBU522MJDX765GVZQE47T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WTUJYHBU522MJDX765GVZQE47T/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-05-19T19:04:28Z","links":{"resolver":"https://pith.science/pith/WTUJYHBU522MJDX765GVZQE47T","bundle":"https://pith.science/pith/WTUJYHBU522MJDX765GVZQE47T/bundle.json","state":"https://pith.science/pith/WTUJYHBU522MJDX765GVZQE47T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WTUJYHBU522MJDX765GVZQE47T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WTUJYHBU522MJDX765GVZQE47T","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":"f6b4efd358501cb01347091c4aeafff254c7d954497eb5f5933eae903704a217","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-17T09:40:00Z","title_canon_sha256":"78518252d5b6905453729e196b21fa8a80d8ecd8e1dd62306049f9deabad46d5"},"schema_version":"1.0","source":{"id":"1605.05074","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05074","created_at":"2026-05-18T00:33:23Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05074v2","created_at":"2026-05-18T00:33:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05074","created_at":"2026-05-18T00:33:23Z"},{"alias_kind":"pith_short_12","alias_value":"WTUJYHBU522M","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"WTUJYHBU522MJDX7","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"WTUJYHBU","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:c5f604d08f2a5c22146390ee62de0957c3bfb195957c3f50657dbb7f490f293d","target":"graph","created_at":"2026-05-18T00:33: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":"Let $\\mathbf{k} := (k_1,\\dots,k_s)$ be a sequence of natural numbers. For a graph $G$, let $F(G;\\mathbf{k})$ denote the number of colourings of the edges of $G$ with colours $1,\\dots,s$ such that, for every $c \\in \\{1,\\dots,s\\}$, the edges of colour $c$ contain no clique of order $k_c$. Write $F(n;\\mathbf{k})$ to denote the maximum of $F(G;\\mathbf{k})$ over all graphs $G$ on $n$ vertices. This problem was first considered by Erd\\H{o}s and Rothschild in 1974, but it has been solved only for a very small number of non-trivial cases.\n  We prove that, for every $\\mathbf{k}$ and $n$, there is a com","authors_text":"Katherine Staden, Oleg Pikhurko, Zelealem B. Yilma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-17T09:40:00Z","title":"The Erd\\H{o}s-Rothschild problem on edge-colourings with forbidden monochromatic cliques"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05074","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:b5e8e163b9fab17295bd199f1d5c13caa9874bf82cf30fec0c1f253ba67eae6f","target":"record","created_at":"2026-05-18T00:33: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":"f6b4efd358501cb01347091c4aeafff254c7d954497eb5f5933eae903704a217","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-17T09:40:00Z","title_canon_sha256":"78518252d5b6905453729e196b21fa8a80d8ecd8e1dd62306049f9deabad46d5"},"schema_version":"1.0","source":{"id":"1605.05074","kind":"arxiv","version":2}},"canonical_sha256":"b4e89c1c34eeb4c48efff74d5cc09cfcc5d49d14581255c2136ec1826c5c60ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4e89c1c34eeb4c48efff74d5cc09cfcc5d49d14581255c2136ec1826c5c60ba","first_computed_at":"2026-05-18T00:33:23.695447Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:23.695447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"itgMeujkXhON9NehAJeAjdzwnRdZVLQCwoI8lMkQAmzMNXYXG7vEJnyhWbL8VwGr7IuxxZ+oSXzX/XFxc3W/BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:23.696071Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.05074","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5e8e163b9fab17295bd199f1d5c13caa9874bf82cf30fec0c1f253ba67eae6f","sha256:c5f604d08f2a5c22146390ee62de0957c3bfb195957c3f50657dbb7f490f293d"],"state_sha256":"123c51647b25e2356a31f28ed1df8938967d9372a62aa1492dea34304d39f275"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vfAoW4N3p2MdOoif0OIrq7Tct02j8raUVw8JZyO/sNhs2FXCEVGiExrDmxqAoxCWcDtJluMU6EhrFdj2Jv5HDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T19:04:28.808368Z","bundle_sha256":"2052c2d07f9ce3df6f2035954067c2e10fb312fb1c61e3600b29d94dbd176ef3"}}