{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OBVZ54I2TQL67H2336SMUJVP6K","short_pith_number":"pith:OBVZ54I2","schema_version":"1.0","canonical_sha256":"706b9ef11a9c17ef9f5bdfa4ca26aff288051cb87226095b246e80436340da8e","source":{"kind":"arxiv","id":"1711.03382","version":3},"attestation_state":"computed","paper":{"title":"Fractional clique decompositions of dense graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Richard Montgomery","submitted_at":"2017-11-09T14:11:41Z","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)"},"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":"1711.03382","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-09T14:11:41Z","cross_cats_sorted":[],"title_canon_sha256":"2a2919f2745375507ec22d86e16a819d4fc937be328b00c5b07515cc69f759b7","abstract_canon_sha256":"e3f44dd76dbf7b94f1c3847a20d1f3fbb3b6edd152581956f97fe75c080f66d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:39.859661Z","signature_b64":"ArJDc+5St9u2rfzanULXQXARtP9pHIPBRg+o2CSitp0P9AHpzmLfObaLAir43kmvXgldSIPyT9GcUT0MpwdvCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"706b9ef11a9c17ef9f5bdfa4ca26aff288051cb87226095b246e80436340da8e","last_reissued_at":"2026-05-18T00:04:39.859182Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:39.859182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fractional clique decompositions of dense graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Richard Montgomery","submitted_at":"2017-11-09T14:11:41Z","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)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03382","kind":"arxiv","version":3},"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":"1711.03382","created_at":"2026-05-18T00:04:39.859259+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.03382v3","created_at":"2026-05-18T00:04:39.859259+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03382","created_at":"2026-05-18T00:04:39.859259+00:00"},{"alias_kind":"pith_short_12","alias_value":"OBVZ54I2TQL6","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OBVZ54I2TQL67H23","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OBVZ54I2","created_at":"2026-05-18T12:31:34.259226+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/OBVZ54I2TQL67H2336SMUJVP6K","json":"https://pith.science/pith/OBVZ54I2TQL67H2336SMUJVP6K.json","graph_json":"https://pith.science/api/pith-number/OBVZ54I2TQL67H2336SMUJVP6K/graph.json","events_json":"https://pith.science/api/pith-number/OBVZ54I2TQL67H2336SMUJVP6K/events.json","paper":"https://pith.science/paper/OBVZ54I2"},"agent_actions":{"view_html":"https://pith.science/pith/OBVZ54I2TQL67H2336SMUJVP6K","download_json":"https://pith.science/pith/OBVZ54I2TQL67H2336SMUJVP6K.json","view_paper":"https://pith.science/paper/OBVZ54I2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.03382&json=true","fetch_graph":"https://pith.science/api/pith-number/OBVZ54I2TQL67H2336SMUJVP6K/graph.json","fetch_events":"https://pith.science/api/pith-number/OBVZ54I2TQL67H2336SMUJVP6K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OBVZ54I2TQL67H2336SMUJVP6K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OBVZ54I2TQL67H2336SMUJVP6K/action/storage_attestation","attest_author":"https://pith.science/pith/OBVZ54I2TQL67H2336SMUJVP6K/action/author_attestation","sign_citation":"https://pith.science/pith/OBVZ54I2TQL67H2336SMUJVP6K/action/citation_signature","submit_replication":"https://pith.science/pith/OBVZ54I2TQL67H2336SMUJVP6K/action/replication_record"}},"created_at":"2026-05-18T00:04:39.859259+00:00","updated_at":"2026-05-18T00:04:39.859259+00:00"}