{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OBVZ54I2TQL67H2336SMUJVP6K","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":"e3f44dd76dbf7b94f1c3847a20d1f3fbb3b6edd152581956f97fe75c080f66d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-09T14:11:41Z","title_canon_sha256":"2a2919f2745375507ec22d86e16a819d4fc937be328b00c5b07515cc69f759b7"},"schema_version":"1.0","source":{"id":"1711.03382","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03382","created_at":"2026-05-18T00:04:39Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03382v3","created_at":"2026-05-18T00:04:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03382","created_at":"2026-05-18T00:04:39Z"},{"alias_kind":"pith_short_12","alias_value":"OBVZ54I2TQL6","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OBVZ54I2TQL67H23","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OBVZ54I2","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:a9e6ca82680c4eb5b9915ab62c9e97fdf9480ce118bd2ea95f357836575bb948","target":"graph","created_at":"2026-05-18T00:04:39Z","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 each $r\\ge 4$, we show that any graph $G$ with minimum degree at least $(1-1/100r)|G|$ has a fractional $K_r$-decomposition. This improves the best previous bounds on the minimum degree required to guarantee a fractional $K_r$-decomposition given by Dukes (for small $r$) and Barber, K\\\"uhn, Lo, Montgomery and Osthus (for large $r$), giving the first bound that is tight up to the constant multiple of $r$ (seen, for example, by considering Tur\\'an graphs).\n  In combination with work by Glock, K\\\"uhn, Lo, Montgomery and Osthus, this shows that, for any graph $F$ with chromatic number $\\chi(F)","authors_text":"Richard Montgomery","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-09T14:11:41Z","title":"Fractional clique decompositions of dense graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03382","kind":"arxiv","version":3},"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:81857cf3e921541c96360921cd717273b95cf2f5e3cc5f30a5517cd9faf2624e","target":"record","created_at":"2026-05-18T00:04:39Z","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":"e3f44dd76dbf7b94f1c3847a20d1f3fbb3b6edd152581956f97fe75c080f66d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-09T14:11:41Z","title_canon_sha256":"2a2919f2745375507ec22d86e16a819d4fc937be328b00c5b07515cc69f759b7"},"schema_version":"1.0","source":{"id":"1711.03382","kind":"arxiv","version":3}},"canonical_sha256":"706b9ef11a9c17ef9f5bdfa4ca26aff288051cb87226095b246e80436340da8e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"706b9ef11a9c17ef9f5bdfa4ca26aff288051cb87226095b246e80436340da8e","first_computed_at":"2026-05-18T00:04:39.859182Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:39.859182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ArJDc+5St9u2rfzanULXQXARtP9pHIPBRg+o2CSitp0P9AHpzmLfObaLAir43kmvXgldSIPyT9GcUT0MpwdvCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:39.859661Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.03382","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81857cf3e921541c96360921cd717273b95cf2f5e3cc5f30a5517cd9faf2624e","sha256:a9e6ca82680c4eb5b9915ab62c9e97fdf9480ce118bd2ea95f357836575bb948"],"state_sha256":"615c8e49035a9d0ca8cbc04762b7d79c8b5788384c5093624b3a222dd4809ffd"}