{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:E5SA6B4O5E4VO7DHD3WR3AEKND","short_pith_number":"pith:E5SA6B4O","canonical_record":{"source":{"id":"1702.06227","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-21T01:02:32Z","cross_cats_sorted":[],"title_canon_sha256":"3846a4e5e68a70888482aefa3fda2ec754deb5ee2aca86ad6e6d742567508936","abstract_canon_sha256":"da72dc566490f894d436736b3518dfeec33e1be4b7b683c05c07e9d1840a46fd"},"schema_version":"1.0"},"canonical_sha256":"27640f078ee939577c671eed1d808a68cbd78ba53d4209e1a6df0754bcc62245","source":{"kind":"arxiv","id":"1702.06227","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06227","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06227v1","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06227","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"pith_short_12","alias_value":"E5SA6B4O5E4V","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"E5SA6B4O5E4VO7DH","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"E5SA6B4O","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:E5SA6B4O5E4VO7DHD3WR3AEKND","target":"record","payload":{"canonical_record":{"source":{"id":"1702.06227","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-21T01:02:32Z","cross_cats_sorted":[],"title_canon_sha256":"3846a4e5e68a70888482aefa3fda2ec754deb5ee2aca86ad6e6d742567508936","abstract_canon_sha256":"da72dc566490f894d436736b3518dfeec33e1be4b7b683c05c07e9d1840a46fd"},"schema_version":"1.0"},"canonical_sha256":"27640f078ee939577c671eed1d808a68cbd78ba53d4209e1a6df0754bcc62245","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:14.679507Z","signature_b64":"db+n2qTgTzLy4PqetRsYD/c+0PvQXhKnHFCX1cPcNtkeBR44tCpsfy6Dh1jsTW2Ta//Q+0UF54qfZX8seuxyAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27640f078ee939577c671eed1d808a68cbd78ba53d4209e1a6df0754bcc62245","last_reissued_at":"2026-05-18T00:50:14.678937Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:14.678937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.06227","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-05-18T00:50:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rZRHdrs0CdB9541vMBbpzP1RLQLMmk5fR6wMeZwNBnB1oL2DpreuvGfZ9gwBVPe129KPMZaqqqIbwRxQwL6QDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T14:51:03.963177Z"},"content_sha256":"c53cfaed6bd91f3be4e8c6551ef7951dcf6c63ae3f7b8e793f9b61491d4ce5e7","schema_version":"1.0","event_id":"sha256:c53cfaed6bd91f3be4e8c6551ef7951dcf6c63ae3f7b8e793f9b61491d4ce5e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:E5SA6B4O5E4VO7DHD3WR3AEKND","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A $(5,5)$-coloring of $K_n$ with few colors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Cameron, Emily Heath","submitted_at":"2017-02-21T01:02:32Z","abstract_excerpt":"For fixed integers $p$ and $q$, let $f(n,p,q)$ denote the minimum number of colors needed to color all of the edges of the complete graph $K_n$ such that no clique of $p$ vertices spans fewer than $q$ distinct colors. Any edge-coloring with this property is known as a $(p,q)$-coloring. We construct an explicit $(5,5)$-coloring that shows that $f(n,5,5) \\leq n^{1/3 + o(1)}$ as $n \\rightarrow \\infty$. This improves upon the best known probabilistic upper bound of $O\\left(n^{1/2}\\right)$ given by Erd\\H{o}s and Gy\\'{a}rf\\'{a}s, and comes close to matching the best known lower bound $\\Omega\\left(n^"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06227","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":""},"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:50:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gn0KReXVKdyJSED15N/8nnEXl4c8riaemmKe2oDCiD5rvAIKZk7CLVnOdm7vAIDy2qm3AWZLhUZBJV3ircPBCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T14:51:03.963546Z"},"content_sha256":"a1f3f2dcf1f21c8726705d8c2daf0ed171d77d4c4c52352db0ef1f7e04ff8a1a","schema_version":"1.0","event_id":"sha256:a1f3f2dcf1f21c8726705d8c2daf0ed171d77d4c4c52352db0ef1f7e04ff8a1a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E5SA6B4O5E4VO7DHD3WR3AEKND/bundle.json","state_url":"https://pith.science/pith/E5SA6B4O5E4VO7DHD3WR3AEKND/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E5SA6B4O5E4VO7DHD3WR3AEKND/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-21T14:51:03Z","links":{"resolver":"https://pith.science/pith/E5SA6B4O5E4VO7DHD3WR3AEKND","bundle":"https://pith.science/pith/E5SA6B4O5E4VO7DHD3WR3AEKND/bundle.json","state":"https://pith.science/pith/E5SA6B4O5E4VO7DHD3WR3AEKND/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E5SA6B4O5E4VO7DHD3WR3AEKND/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:E5SA6B4O5E4VO7DHD3WR3AEKND","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":"da72dc566490f894d436736b3518dfeec33e1be4b7b683c05c07e9d1840a46fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-21T01:02:32Z","title_canon_sha256":"3846a4e5e68a70888482aefa3fda2ec754deb5ee2aca86ad6e6d742567508936"},"schema_version":"1.0","source":{"id":"1702.06227","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06227","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06227v1","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06227","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"pith_short_12","alias_value":"E5SA6B4O5E4V","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"E5SA6B4O5E4VO7DH","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"E5SA6B4O","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:a1f3f2dcf1f21c8726705d8c2daf0ed171d77d4c4c52352db0ef1f7e04ff8a1a","target":"graph","created_at":"2026-05-18T00:50:14Z","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":"For fixed integers $p$ and $q$, let $f(n,p,q)$ denote the minimum number of colors needed to color all of the edges of the complete graph $K_n$ such that no clique of $p$ vertices spans fewer than $q$ distinct colors. Any edge-coloring with this property is known as a $(p,q)$-coloring. We construct an explicit $(5,5)$-coloring that shows that $f(n,5,5) \\leq n^{1/3 + o(1)}$ as $n \\rightarrow \\infty$. This improves upon the best known probabilistic upper bound of $O\\left(n^{1/2}\\right)$ given by Erd\\H{o}s and Gy\\'{a}rf\\'{a}s, and comes close to matching the best known lower bound $\\Omega\\left(n^","authors_text":"Alex Cameron, Emily Heath","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-21T01:02:32Z","title":"A $(5,5)$-coloring of $K_n$ with few colors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06227","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:c53cfaed6bd91f3be4e8c6551ef7951dcf6c63ae3f7b8e793f9b61491d4ce5e7","target":"record","created_at":"2026-05-18T00:50:14Z","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":"da72dc566490f894d436736b3518dfeec33e1be4b7b683c05c07e9d1840a46fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-21T01:02:32Z","title_canon_sha256":"3846a4e5e68a70888482aefa3fda2ec754deb5ee2aca86ad6e6d742567508936"},"schema_version":"1.0","source":{"id":"1702.06227","kind":"arxiv","version":1}},"canonical_sha256":"27640f078ee939577c671eed1d808a68cbd78ba53d4209e1a6df0754bcc62245","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27640f078ee939577c671eed1d808a68cbd78ba53d4209e1a6df0754bcc62245","first_computed_at":"2026-05-18T00:50:14.678937Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:14.678937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"db+n2qTgTzLy4PqetRsYD/c+0PvQXhKnHFCX1cPcNtkeBR44tCpsfy6Dh1jsTW2Ta//Q+0UF54qfZX8seuxyAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:14.679507Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.06227","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c53cfaed6bd91f3be4e8c6551ef7951dcf6c63ae3f7b8e793f9b61491d4ce5e7","sha256:a1f3f2dcf1f21c8726705d8c2daf0ed171d77d4c4c52352db0ef1f7e04ff8a1a"],"state_sha256":"57793e73ee9f19b94bcdf76694d79646cc565f462336bb046c099f43d53308ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sfdDr778MezwF7SDYZG9j2obqF2ctpHhPgr198+U42vYaV9kuGVGOkqI40FKWgvmsHW8XcWisXrGrK1zAOc7Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T14:51:03.965486Z","bundle_sha256":"5e5b4dc6bde8e2df80f2b06f7e3940680a11d1ce88a2835fc9969f7142993230"}}