{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JBCHXUKREYQHPOD3V6BJTPXMOW","short_pith_number":"pith:JBCHXUKR","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"},"canonical_sha256":"48447bd151262077b87baf8299beec758c0eb901658fb99a9458c215435cc1e6","source":{"kind":"arxiv","id":"1507.04985","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04985","created_at":"2026-05-18T00:06:44Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04985v2","created_at":"2026-05-18T00:06:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04985","created_at":"2026-05-18T00:06:44Z"},{"alias_kind":"pith_short_12","alias_value":"JBCHXUKREYQH","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JBCHXUKREYQHPOD3","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JBCHXUKR","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JBCHXUKREYQHPOD3V6BJTPXMOW","target":"record","payload":{"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"},"canonical_sha256":"48447bd151262077b87baf8299beec758c0eb901658fb99a9458c215435cc1e6","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"},"source_kind":"arxiv","source_id":"1507.04985","source_version":2,"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:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T6iZpdtbxPkUFo/Dal08ko3HFyYBzcJw1kLq3rV2XhZn6iPLurInASXAEbfKM9to6D2I/za8VsXzZZnSHWcNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:49:15.130054Z"},"content_sha256":"80f39c85aa3e42a74a6183f5b7475d4b87419386ab7be18260ee522d914233d4","schema_version":"1.0","event_id":"sha256:80f39c85aa3e42a74a6183f5b7475d4b87419386ab7be18260ee522d914233d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JBCHXUKREYQHPOD3V6BJTPXMOW","target":"graph","payload":{"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"},"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:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sNPUqIxCVBkJk3hQQ+XX7F8IwpsDP21+8R46hExtrIIpKd6iX5/MeY7y92EUka8ohHzAkHwSGi7pL23joWDfBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:49:15.130457Z"},"content_sha256":"d9f8b0b39268fb7d3b818c137e1221d0f5d327d71ddeb5461d85ca4a0340e614","schema_version":"1.0","event_id":"sha256:d9f8b0b39268fb7d3b818c137e1221d0f5d327d71ddeb5461d85ca4a0340e614"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JBCHXUKREYQHPOD3V6BJTPXMOW/bundle.json","state_url":"https://pith.science/pith/JBCHXUKREYQHPOD3V6BJTPXMOW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JBCHXUKREYQHPOD3V6BJTPXMOW/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-30T16:49:15Z","links":{"resolver":"https://pith.science/pith/JBCHXUKREYQHPOD3V6BJTPXMOW","bundle":"https://pith.science/pith/JBCHXUKREYQHPOD3V6BJTPXMOW/bundle.json","state":"https://pith.science/pith/JBCHXUKREYQHPOD3V6BJTPXMOW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JBCHXUKREYQHPOD3V6BJTPXMOW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JBCHXUKREYQHPOD3V6BJTPXMOW","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":"f938473e5ad582e1a2d52f8db56c7383d09d2253e71d006cdf0554da74dc57d4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-17T14:29:36Z","title_canon_sha256":"35a7ed7c403881988dd582ca623b0fdc35c5f46ad7e3aabaf4bf61fe24339729"},"schema_version":"1.0","source":{"id":"1507.04985","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04985","created_at":"2026-05-18T00:06:44Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04985v2","created_at":"2026-05-18T00:06:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04985","created_at":"2026-05-18T00:06:44Z"},{"alias_kind":"pith_short_12","alias_value":"JBCHXUKREYQH","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JBCHXUKREYQHPOD3","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JBCHXUKR","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:d9f8b0b39268fb7d3b818c137e1221d0f5d327d71ddeb5461d85ca4a0340e614","target":"graph","created_at":"2026-05-18T00:06:44Z","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":"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","authors_text":"Allan Lo, Ben Barber, Daniela K\\\"uhn, Deryk Osthus, Richard Montgomery","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-17T14:29:36Z","title":"Fractional Clique Decompositions of Dense Graphs and Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04985","kind":"arxiv","version":2},"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:80f39c85aa3e42a74a6183f5b7475d4b87419386ab7be18260ee522d914233d4","target":"record","created_at":"2026-05-18T00:06:44Z","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":"f938473e5ad582e1a2d52f8db56c7383d09d2253e71d006cdf0554da74dc57d4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-17T14:29:36Z","title_canon_sha256":"35a7ed7c403881988dd582ca623b0fdc35c5f46ad7e3aabaf4bf61fe24339729"},"schema_version":"1.0","source":{"id":"1507.04985","kind":"arxiv","version":2}},"canonical_sha256":"48447bd151262077b87baf8299beec758c0eb901658fb99a9458c215435cc1e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48447bd151262077b87baf8299beec758c0eb901658fb99a9458c215435cc1e6","first_computed_at":"2026-05-18T00:06:44.141223Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:44.141223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y5hPT5mQ+jV4omGSXWMdpEG10GyVo1PmwGeIHtok0m4rcyq6xKAwbAqkoINxSUI58ZZewmhWJbYOh5ChxE4zDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:44.141603Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.04985","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80f39c85aa3e42a74a6183f5b7475d4b87419386ab7be18260ee522d914233d4","sha256:d9f8b0b39268fb7d3b818c137e1221d0f5d327d71ddeb5461d85ca4a0340e614"],"state_sha256":"1f863fa43246e2f31e1e5ee6a22572238fb9d99f97aa0ebff25066dcc36ab171"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/J7tOtVygMKpvBXXFX9Pr6fy9RvDi3hanu1bcr5HxlrE2fH9qyPDa5TBr/HLLmT0CGXumwBFTArtoOwftraQCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:49:15.133040Z","bundle_sha256":"bd8c97db0ab1a465d9bd9e0a1a853629ddb8ffdd82a52b98a05f63ecf50af1ef"}}