{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OMF7J2UPGSEJ55ILW7J4WIESDP","short_pith_number":"pith:OMF7J2UP","schema_version":"1.0","canonical_sha256":"730bf4ea8f34889ef50bb7d3cb20921beb8068cab543e33d2830fc534a1eff4d","source":{"kind":"arxiv","id":"1401.6345","version":2},"attestation_state":"computed","paper":{"title":"Monochromatic Clique Decompositions of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Henry Liu, Oleg Pikhurko, Teresa Sousa","submitted_at":"2014-01-24T14:30:29Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1401.6345","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-24T14:30:29Z","cross_cats_sorted":[],"title_canon_sha256":"3c3578a9ba52992e92cfe69e285a07aa1e40a5877fe85bfcabbb2b3f964a1fbb","abstract_canon_sha256":"799e675de92ccbc7eb151614ce3ebfd3c7eb8fbdba57cfb2e2646f357cf572fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:02.353336Z","signature_b64":"C5aLSo065mdWKfbUJnGblUKGiQ2ycF1m+vurB2+bRsQZNA8seGe3CNma3S/L53z1lHHJAunRiub41aLYZ3GLAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"730bf4ea8f34889ef50bb7d3cb20921beb8068cab543e33d2830fc534a1eff4d","last_reissued_at":"2026-05-18T02:31:02.352797Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:02.352797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Monochromatic Clique Decompositions of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Henry Liu, Oleg Pikhurko, Teresa Sousa","submitted_at":"2014-01-24T14:30:29Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6345","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.6345","created_at":"2026-05-18T02:31:02.352878+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.6345v2","created_at":"2026-05-18T02:31:02.352878+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6345","created_at":"2026-05-18T02:31:02.352878+00:00"},{"alias_kind":"pith_short_12","alias_value":"OMF7J2UPGSEJ","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"OMF7J2UPGSEJ55IL","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"OMF7J2UP","created_at":"2026-05-18T12:28:41.024544+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OMF7J2UPGSEJ55ILW7J4WIESDP","json":"https://pith.science/pith/OMF7J2UPGSEJ55ILW7J4WIESDP.json","graph_json":"https://pith.science/api/pith-number/OMF7J2UPGSEJ55ILW7J4WIESDP/graph.json","events_json":"https://pith.science/api/pith-number/OMF7J2UPGSEJ55ILW7J4WIESDP/events.json","paper":"https://pith.science/paper/OMF7J2UP"},"agent_actions":{"view_html":"https://pith.science/pith/OMF7J2UPGSEJ55ILW7J4WIESDP","download_json":"https://pith.science/pith/OMF7J2UPGSEJ55ILW7J4WIESDP.json","view_paper":"https://pith.science/paper/OMF7J2UP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.6345&json=true","fetch_graph":"https://pith.science/api/pith-number/OMF7J2UPGSEJ55ILW7J4WIESDP/graph.json","fetch_events":"https://pith.science/api/pith-number/OMF7J2UPGSEJ55ILW7J4WIESDP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OMF7J2UPGSEJ55ILW7J4WIESDP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OMF7J2UPGSEJ55ILW7J4WIESDP/action/storage_attestation","attest_author":"https://pith.science/pith/OMF7J2UPGSEJ55ILW7J4WIESDP/action/author_attestation","sign_citation":"https://pith.science/pith/OMF7J2UPGSEJ55ILW7J4WIESDP/action/citation_signature","submit_replication":"https://pith.science/pith/OMF7J2UPGSEJ55ILW7J4WIESDP/action/replication_record"}},"created_at":"2026-05-18T02:31:02.352878+00:00","updated_at":"2026-05-18T02:31:02.352878+00:00"}