{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:Z5HA535QPVTEL4FSN33SXPFJCM","short_pith_number":"pith:Z5HA535Q","schema_version":"1.0","canonical_sha256":"cf4e0eefb07d6645f0b26ef72bbca9132d43767ff0fc7aedf870fcc97c8b34db","source":{"kind":"arxiv","id":"1611.06827","version":3},"attestation_state":"computed","paper":{"title":"The existence of designs via iterative absorption: hypergraph $F$-designs for arbitrary $F$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Allan Lo, Daniela K\\\"uhn, Deryk Osthus, Stefan Glock","submitted_at":"2016-11-21T15:12:33Z","abstract_excerpt":"We solve the existence problem for $F$-designs for arbitrary $r$-uniform hypergraphs~$F$. This implies that given any $r$-uniform hypergraph~$F$, the trivially necessary divisibility conditions are sufficient to guarantee a decomposition of any sufficiently large complete $r$-uniform hypergraph into edge-disjoint copies of~$F$, which answers a question asked e.g.~by Keevash. The graph case $r=2$ was proved by Wilson in 1975 and forms one of the cornerstones of design theory. The case when~$F$ is complete corresponds to the existence of block designs, a problem going back to the 19th century, w"},"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":"1611.06827","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-21T15:12:33Z","cross_cats_sorted":[],"title_canon_sha256":"4f23c7cb3783d95ca6139d6935c2008489b6a70fb9098b929eb595805e912aac","abstract_canon_sha256":"44f94732362c0b64f457101f7e3f5ce9458da5d5316afafd351e35859c3bc09d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:44:23.508760Z","signature_b64":"y6aGa4eDfW1Bm5K29u30LetKsCl7QFnDAC8VA5TLhF2D8+zXPXVhjDgWf/hlhjSPww4AmYtezO+o7M/XdO8UDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf4e0eefb07d6645f0b26ef72bbca9132d43767ff0fc7aedf870fcc97c8b34db","last_reissued_at":"2026-07-05T00:44:23.508234Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:44:23.508234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The existence of designs via iterative absorption: hypergraph $F$-designs for arbitrary $F$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Allan Lo, Daniela K\\\"uhn, Deryk Osthus, Stefan Glock","submitted_at":"2016-11-21T15:12:33Z","abstract_excerpt":"We solve the existence problem for $F$-designs for arbitrary $r$-uniform hypergraphs~$F$. This implies that given any $r$-uniform hypergraph~$F$, the trivially necessary divisibility conditions are sufficient to guarantee a decomposition of any sufficiently large complete $r$-uniform hypergraph into edge-disjoint copies of~$F$, which answers a question asked e.g.~by Keevash. The graph case $r=2$ was proved by Wilson in 1975 and forms one of the cornerstones of design theory. The case when~$F$ is complete corresponds to the existence of block designs, a problem going back to the 19th century, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06827","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1611.06827/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1611.06827","created_at":"2026-07-05T00:44:23.508292+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.06827v3","created_at":"2026-07-05T00:44:23.508292+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06827","created_at":"2026-07-05T00:44:23.508292+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z5HA535QPVTE","created_at":"2026-07-05T00:44:23.508292+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z5HA535QPVTEL4FS","created_at":"2026-07-05T00:44:23.508292+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z5HA535Q","created_at":"2026-07-05T00:44:23.508292+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1906.11558","citing_title":"Perfectly packing graphs with bounded degeneracy and many leaves","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"1907.09950","citing_title":"A rainbow blow-up lemma for almost optimally bounded edge-colourings","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z5HA535QPVTEL4FSN33SXPFJCM","json":"https://pith.science/pith/Z5HA535QPVTEL4FSN33SXPFJCM.json","graph_json":"https://pith.science/api/pith-number/Z5HA535QPVTEL4FSN33SXPFJCM/graph.json","events_json":"https://pith.science/api/pith-number/Z5HA535QPVTEL4FSN33SXPFJCM/events.json","paper":"https://pith.science/paper/Z5HA535Q"},"agent_actions":{"view_html":"https://pith.science/pith/Z5HA535QPVTEL4FSN33SXPFJCM","download_json":"https://pith.science/pith/Z5HA535QPVTEL4FSN33SXPFJCM.json","view_paper":"https://pith.science/paper/Z5HA535Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.06827&json=true","fetch_graph":"https://pith.science/api/pith-number/Z5HA535QPVTEL4FSN33SXPFJCM/graph.json","fetch_events":"https://pith.science/api/pith-number/Z5HA535QPVTEL4FSN33SXPFJCM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z5HA535QPVTEL4FSN33SXPFJCM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z5HA535QPVTEL4FSN33SXPFJCM/action/storage_attestation","attest_author":"https://pith.science/pith/Z5HA535QPVTEL4FSN33SXPFJCM/action/author_attestation","sign_citation":"https://pith.science/pith/Z5HA535QPVTEL4FSN33SXPFJCM/action/citation_signature","submit_replication":"https://pith.science/pith/Z5HA535QPVTEL4FSN33SXPFJCM/action/replication_record"}},"created_at":"2026-07-05T00:44:23.508292+00:00","updated_at":"2026-07-05T00:44:23.508292+00:00"}