{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OMF7J2UPGSEJ55ILW7J4WIESDP","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":"799e675de92ccbc7eb151614ce3ebfd3c7eb8fbdba57cfb2e2646f357cf572fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-24T14:30:29Z","title_canon_sha256":"3c3578a9ba52992e92cfe69e285a07aa1e40a5877fe85bfcabbb2b3f964a1fbb"},"schema_version":"1.0","source":{"id":"1401.6345","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6345","created_at":"2026-05-18T02:31:02Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6345v2","created_at":"2026-05-18T02:31:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6345","created_at":"2026-05-18T02:31:02Z"},{"alias_kind":"pith_short_12","alias_value":"OMF7J2UPGSEJ","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"OMF7J2UPGSEJ55IL","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"OMF7J2UP","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:8a8770c178c242e38a421845d09c2f11124660e306a67b56acb8f0a9a95aeb58","target":"graph","created_at":"2026-05-18T02:31:02Z","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 $G$ be a graph whose edges are coloured with $k$ colours, and $\\mathcal H=(H_1,\\dots , H_k)$ be a $k$-tuple of graphs. A monochromatic $\\mathcal H$-decomposition of $G$ is a partition of the edge set of $G$ such that each part is either a single edge or forms a monochromatic copy of $H_i$ in colour $i$, for some $1\\le i\\le k$. Let $\\phi_{k}(n,\\mathcal H)$ be the smallest number $\\phi$, such that, for every order-$n$ graph and every $k$-edge-colouring, there is a monochromatic $\\mathcal H$-decomposition with at most $\\phi$ elements. Extending the previous results of Liu and Sousa [\"Monochro","authors_text":"Henry Liu, Oleg Pikhurko, Teresa Sousa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-24T14:30:29Z","title":"Monochromatic Clique Decompositions of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6345","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:501fa585926a6e9e7401d977b8745247e936580f330d1c853514b6af82e65d4d","target":"record","created_at":"2026-05-18T02:31:02Z","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":"799e675de92ccbc7eb151614ce3ebfd3c7eb8fbdba57cfb2e2646f357cf572fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-24T14:30:29Z","title_canon_sha256":"3c3578a9ba52992e92cfe69e285a07aa1e40a5877fe85bfcabbb2b3f964a1fbb"},"schema_version":"1.0","source":{"id":"1401.6345","kind":"arxiv","version":2}},"canonical_sha256":"730bf4ea8f34889ef50bb7d3cb20921beb8068cab543e33d2830fc534a1eff4d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"730bf4ea8f34889ef50bb7d3cb20921beb8068cab543e33d2830fc534a1eff4d","first_computed_at":"2026-05-18T02:31:02.352797Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:02.352797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C5aLSo065mdWKfbUJnGblUKGiQ2ycF1m+vurB2+bRsQZNA8seGe3CNma3S/L53z1lHHJAunRiub41aLYZ3GLAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:02.353336Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.6345","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:501fa585926a6e9e7401d977b8745247e936580f330d1c853514b6af82e65d4d","sha256:8a8770c178c242e38a421845d09c2f11124660e306a67b56acb8f0a9a95aeb58"],"state_sha256":"b59484292ef954ea8000e6aaa42b1da55657482eb6da55465da5cdb971fd750d"}