{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TAAJFDHB3W5TWMMXBWHHJOZBWW","short_pith_number":"pith:TAAJFDHB","canonical_record":{"source":{"id":"1809.01443","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-05T11:37:49Z","cross_cats_sorted":[],"title_canon_sha256":"02fb2d3d55c147b3755360e9b4cd6261c4d7811a0171ad74155f34329c09391e","abstract_canon_sha256":"6df5baab4260f9bd9e9ae14b0975f34867871f781a7c3914e939632eaa1f974b"},"schema_version":"1.0"},"canonical_sha256":"9800928ce1ddbb3b31970d8e74bb21b58a0b7cff80817fe818216f07e9f0fb52","source":{"kind":"arxiv","id":"1809.01443","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.01443","created_at":"2026-05-18T00:06:27Z"},{"alias_kind":"arxiv_version","alias_value":"1809.01443v1","created_at":"2026-05-18T00:06:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01443","created_at":"2026-05-18T00:06:27Z"},{"alias_kind":"pith_short_12","alias_value":"TAAJFDHB3W5T","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TAAJFDHB3W5TWMMX","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TAAJFDHB","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TAAJFDHB3W5TWMMXBWHHJOZBWW","target":"record","payload":{"canonical_record":{"source":{"id":"1809.01443","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-05T11:37:49Z","cross_cats_sorted":[],"title_canon_sha256":"02fb2d3d55c147b3755360e9b4cd6261c4d7811a0171ad74155f34329c09391e","abstract_canon_sha256":"6df5baab4260f9bd9e9ae14b0975f34867871f781a7c3914e939632eaa1f974b"},"schema_version":"1.0"},"canonical_sha256":"9800928ce1ddbb3b31970d8e74bb21b58a0b7cff80817fe818216f07e9f0fb52","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:27.650866Z","signature_b64":"XkRaEx7S+LA6PmRf+OOhbhyAGLHmaqEEN0CmdICi7QzF9yCUknNk+OX494Dw88XrCrCswIQpMVwmJNLnm3UoCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9800928ce1ddbb3b31970d8e74bb21b58a0b7cff80817fe818216f07e9f0fb52","last_reissued_at":"2026-05-18T00:06:27.650179Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:27.650179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.01443","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:06:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"34i/uE8SFUfxItJvnqAgXYUrbrXLbDwL/uNzOoJdL4sZmoa/b3tRuj1WNcI7sx+vp3/xdKRts//2gjGKhvolCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:20:53.570795Z"},"content_sha256":"68e3d835ccf3b3a6af30dfb300cded81294d6731c3db9056182901465037b09e","schema_version":"1.0","event_id":"sha256:68e3d835ccf3b3a6af30dfb300cded81294d6731c3db9056182901465037b09e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TAAJFDHB3W5TWMMXBWHHJOZBWW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Clique Coverings of Complete Multipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Akbar Davoodi, D\\'aniel Gerbner, M\\'at\\'e Vizer","submitted_at":"2018-09-05T11:37:49Z","abstract_excerpt":"A clique covering of a graph $G$ is a set of cliques of $G$ such that any edge of $G$ is contained in one of these cliques, and the weight of a clique covering is the sum of the sizes of the cliques in it. The sigma clique cover number $scc(G)$ of a graph $G$, is defined as the smallest possible weight of a clique covering of $G$. Let $ K_t(d) $ denote the complete $ t $-partite graph with each part of size $d$. We prove that for any fixed $d \\ge 2$, we have $$\\lim_{t \\rightarrow \\infty} scc(K_t(d))= \\frac{d}{2} t\\log t.$$ This disproves a conjecture of Davoodi, Javadi and Omoomi."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01443","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:06:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TwWZCj4YrMFskKfV7AVTBfzikEmfMaPgBCVAoAb28LfK3132llCKtSFy+UkhgyBk1AtKVywrh1Z+2/FWTrdxBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:20:53.571441Z"},"content_sha256":"5744c0ab161417b070415f80e9a94ef8e7caaffba87a42b38958d9b76b4c766a","schema_version":"1.0","event_id":"sha256:5744c0ab161417b070415f80e9a94ef8e7caaffba87a42b38958d9b76b4c766a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TAAJFDHB3W5TWMMXBWHHJOZBWW/bundle.json","state_url":"https://pith.science/pith/TAAJFDHB3W5TWMMXBWHHJOZBWW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TAAJFDHB3W5TWMMXBWHHJOZBWW/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-30T05:20:53Z","links":{"resolver":"https://pith.science/pith/TAAJFDHB3W5TWMMXBWHHJOZBWW","bundle":"https://pith.science/pith/TAAJFDHB3W5TWMMXBWHHJOZBWW/bundle.json","state":"https://pith.science/pith/TAAJFDHB3W5TWMMXBWHHJOZBWW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TAAJFDHB3W5TWMMXBWHHJOZBWW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TAAJFDHB3W5TWMMXBWHHJOZBWW","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":"6df5baab4260f9bd9e9ae14b0975f34867871f781a7c3914e939632eaa1f974b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-05T11:37:49Z","title_canon_sha256":"02fb2d3d55c147b3755360e9b4cd6261c4d7811a0171ad74155f34329c09391e"},"schema_version":"1.0","source":{"id":"1809.01443","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.01443","created_at":"2026-05-18T00:06:27Z"},{"alias_kind":"arxiv_version","alias_value":"1809.01443v1","created_at":"2026-05-18T00:06:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01443","created_at":"2026-05-18T00:06:27Z"},{"alias_kind":"pith_short_12","alias_value":"TAAJFDHB3W5T","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TAAJFDHB3W5TWMMX","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TAAJFDHB","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:5744c0ab161417b070415f80e9a94ef8e7caaffba87a42b38958d9b76b4c766a","target":"graph","created_at":"2026-05-18T00:06:27Z","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":"A clique covering of a graph $G$ is a set of cliques of $G$ such that any edge of $G$ is contained in one of these cliques, and the weight of a clique covering is the sum of the sizes of the cliques in it. The sigma clique cover number $scc(G)$ of a graph $G$, is defined as the smallest possible weight of a clique covering of $G$. Let $ K_t(d) $ denote the complete $ t $-partite graph with each part of size $d$. We prove that for any fixed $d \\ge 2$, we have $$\\lim_{t \\rightarrow \\infty} scc(K_t(d))= \\frac{d}{2} t\\log t.$$ This disproves a conjecture of Davoodi, Javadi and Omoomi.","authors_text":"Abhishek Methuku, Akbar Davoodi, D\\'aniel Gerbner, M\\'at\\'e Vizer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-05T11:37:49Z","title":"On Clique Coverings of Complete Multipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01443","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:68e3d835ccf3b3a6af30dfb300cded81294d6731c3db9056182901465037b09e","target":"record","created_at":"2026-05-18T00:06:27Z","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":"6df5baab4260f9bd9e9ae14b0975f34867871f781a7c3914e939632eaa1f974b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-05T11:37:49Z","title_canon_sha256":"02fb2d3d55c147b3755360e9b4cd6261c4d7811a0171ad74155f34329c09391e"},"schema_version":"1.0","source":{"id":"1809.01443","kind":"arxiv","version":1}},"canonical_sha256":"9800928ce1ddbb3b31970d8e74bb21b58a0b7cff80817fe818216f07e9f0fb52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9800928ce1ddbb3b31970d8e74bb21b58a0b7cff80817fe818216f07e9f0fb52","first_computed_at":"2026-05-18T00:06:27.650179Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:27.650179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XkRaEx7S+LA6PmRf+OOhbhyAGLHmaqEEN0CmdICi7QzF9yCUknNk+OX494Dw88XrCrCswIQpMVwmJNLnm3UoCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:27.650866Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.01443","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68e3d835ccf3b3a6af30dfb300cded81294d6731c3db9056182901465037b09e","sha256:5744c0ab161417b070415f80e9a94ef8e7caaffba87a42b38958d9b76b4c766a"],"state_sha256":"848b5ec936c25d6cbdbe9b1d209b904fb9f2ba14acb2297cbac6d3e8554874af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JvWLKaGcAbagY/zKemNiE4J9Dw8SZ7/RLHIe1Hdx4khadyKwmbqaW8QHZRVMq+Q/N7pu++dJAGfsk8dtlFzzCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:20:53.574603Z","bundle_sha256":"7b8d80fd57b59425b79e834fe3fc8d52786dcc04ed96703143f5a3d78f2fe2fa"}}