{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JBCHXUKREYQHPOD3V6BJTPXMOW","short_pith_number":"pith:JBCHXUKR","schema_version":"1.0","canonical_sha256":"48447bd151262077b87baf8299beec758c0eb901658fb99a9458c215435cc1e6","source":{"kind":"arxiv","id":"1507.04985","version":2},"attestation_state":"computed","paper":{"title":"Fractional Clique Decompositions of Dense Graphs and Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Allan Lo, Ben Barber, Daniela K\\\"uhn, Deryk Osthus, Richard Montgomery","submitted_at":"2015-07-17T14:29:36Z","abstract_excerpt":"Our main result is that every graph $G$ on $n\\ge 10^4r^3$ vertices with minimum degree $\\delta(G) \\ge (1 - 1 / 10^4 r^{3/2} ) n$ has a fractional $K_r$-decomposition. Combining this result with recent work of Barber, K\\\"uhn, Lo and Osthus leads to the best known minimum degree thresholds for exact (non-fractional) $F$-decompositions for a wide class of graphs~$F$ (including large cliques). For general $k$-uniform hypergraphs, we give a short argument which shows that there exists a constant $c_k>0$ such that every $k$-uniform hypergraph $G$ on $n$ vertices with minimum codegree at least $(1- c"},"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":"1507.04985","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-17T14:29:36Z","cross_cats_sorted":[],"title_canon_sha256":"35a7ed7c403881988dd582ca623b0fdc35c5f46ad7e3aabaf4bf61fe24339729","abstract_canon_sha256":"f938473e5ad582e1a2d52f8db56c7383d09d2253e71d006cdf0554da74dc57d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:44.141603Z","signature_b64":"Y5hPT5mQ+jV4omGSXWMdpEG10GyVo1PmwGeIHtok0m4rcyq6xKAwbAqkoINxSUI58ZZewmhWJbYOh5ChxE4zDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48447bd151262077b87baf8299beec758c0eb901658fb99a9458c215435cc1e6","last_reissued_at":"2026-05-18T00:06:44.141223Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:44.141223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fractional Clique Decompositions of Dense Graphs and Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Allan Lo, Ben Barber, Daniela K\\\"uhn, Deryk Osthus, Richard Montgomery","submitted_at":"2015-07-17T14:29:36Z","abstract_excerpt":"Our main result is that every graph $G$ on $n\\ge 10^4r^3$ vertices with minimum degree $\\delta(G) \\ge (1 - 1 / 10^4 r^{3/2} ) n$ has a fractional $K_r$-decomposition. Combining this result with recent work of Barber, K\\\"uhn, Lo and Osthus leads to the best known minimum degree thresholds for exact (non-fractional) $F$-decompositions for a wide class of graphs~$F$ (including large cliques). For general $k$-uniform hypergraphs, we give a short argument which shows that there exists a constant $c_k>0$ such that every $k$-uniform hypergraph $G$ on $n$ vertices with minimum codegree at least $(1- c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04985","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":"1507.04985","created_at":"2026-05-18T00:06:44.141288+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.04985v2","created_at":"2026-05-18T00:06:44.141288+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04985","created_at":"2026-05-18T00:06:44.141288+00:00"},{"alias_kind":"pith_short_12","alias_value":"JBCHXUKREYQH","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JBCHXUKREYQHPOD3","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JBCHXUKR","created_at":"2026-05-18T12:29:27.538025+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/JBCHXUKREYQHPOD3V6BJTPXMOW","json":"https://pith.science/pith/JBCHXUKREYQHPOD3V6BJTPXMOW.json","graph_json":"https://pith.science/api/pith-number/JBCHXUKREYQHPOD3V6BJTPXMOW/graph.json","events_json":"https://pith.science/api/pith-number/JBCHXUKREYQHPOD3V6BJTPXMOW/events.json","paper":"https://pith.science/paper/JBCHXUKR"},"agent_actions":{"view_html":"https://pith.science/pith/JBCHXUKREYQHPOD3V6BJTPXMOW","download_json":"https://pith.science/pith/JBCHXUKREYQHPOD3V6BJTPXMOW.json","view_paper":"https://pith.science/paper/JBCHXUKR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.04985&json=true","fetch_graph":"https://pith.science/api/pith-number/JBCHXUKREYQHPOD3V6BJTPXMOW/graph.json","fetch_events":"https://pith.science/api/pith-number/JBCHXUKREYQHPOD3V6BJTPXMOW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JBCHXUKREYQHPOD3V6BJTPXMOW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JBCHXUKREYQHPOD3V6BJTPXMOW/action/storage_attestation","attest_author":"https://pith.science/pith/JBCHXUKREYQHPOD3V6BJTPXMOW/action/author_attestation","sign_citation":"https://pith.science/pith/JBCHXUKREYQHPOD3V6BJTPXMOW/action/citation_signature","submit_replication":"https://pith.science/pith/JBCHXUKREYQHPOD3V6BJTPXMOW/action/replication_record"}},"created_at":"2026-05-18T00:06:44.141288+00:00","updated_at":"2026-05-18T00:06:44.141288+00:00"}