{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4AVDCBL3ZKQPCS73IT4W7FMUUX","short_pith_number":"pith:4AVDCBL3","schema_version":"1.0","canonical_sha256":"e02a31057bcaa0f14bfb44f96f9594a5e39993b4d1628ab888368f19480a7ad3","source":{"kind":"arxiv","id":"1402.0884","version":2},"attestation_state":"computed","paper":{"title":"Perfect Packings in Quasirandom Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dhruv Mubayi, John Lenz","submitted_at":"2014-02-04T21:16:48Z","abstract_excerpt":"Let k >= 2 and F be a linear k-uniform hypergraph with v vertices. We prove that if n is sufficiently large and v|n, then every quasirandom k-uniform hypergraph on n vertices with constant edge density and minimum degree $\\Omega(n^{k-1})$ admits a perfect F-packing. The case k = 2 follows immediately from the blowup lemma of Koml\\'os, S\\'ark\\\"ozy, and Szemer\\'edi. We also prove positive results for some nonlinear F but at the same time give counterexamples for rather simple F that are close to being linear. Finally, we address the case when the density tends to zero, and prove (in analogy with"},"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":"1402.0884","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-04T21:16:48Z","cross_cats_sorted":[],"title_canon_sha256":"fe08ee25f097a4132868d2af4aadbacccb121d0142c32ad0f84cc1b5c172ec06","abstract_canon_sha256":"d642273a21befef94f57177956dce5d7b2defdc08e29c2427dacc23ca09421e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:56.253659Z","signature_b64":"bZRHaiEfpxHFCczJR3SdgLSph2vJzfwXwvO0lcApO/FglPM90VZHL3jgNc0m7aYdg3/oQ25gSBE5a3hEHSuZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e02a31057bcaa0f14bfb44f96f9594a5e39993b4d1628ab888368f19480a7ad3","last_reissued_at":"2026-05-18T02:58:56.253003Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:56.253003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfect Packings in Quasirandom Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dhruv Mubayi, John Lenz","submitted_at":"2014-02-04T21:16:48Z","abstract_excerpt":"Let k >= 2 and F be a linear k-uniform hypergraph with v vertices. We prove that if n is sufficiently large and v|n, then every quasirandom k-uniform hypergraph on n vertices with constant edge density and minimum degree $\\Omega(n^{k-1})$ admits a perfect F-packing. The case k = 2 follows immediately from the blowup lemma of Koml\\'os, S\\'ark\\\"ozy, and Szemer\\'edi. We also prove positive results for some nonlinear F but at the same time give counterexamples for rather simple F that are close to being linear. Finally, we address the case when the density tends to zero, and prove (in analogy with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0884","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":"1402.0884","created_at":"2026-05-18T02:58:56.253098+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.0884v2","created_at":"2026-05-18T02:58:56.253098+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0884","created_at":"2026-05-18T02:58:56.253098+00:00"},{"alias_kind":"pith_short_12","alias_value":"4AVDCBL3ZKQP","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4AVDCBL3ZKQPCS73","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4AVDCBL3","created_at":"2026-05-18T12:28:14.216126+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/4AVDCBL3ZKQPCS73IT4W7FMUUX","json":"https://pith.science/pith/4AVDCBL3ZKQPCS73IT4W7FMUUX.json","graph_json":"https://pith.science/api/pith-number/4AVDCBL3ZKQPCS73IT4W7FMUUX/graph.json","events_json":"https://pith.science/api/pith-number/4AVDCBL3ZKQPCS73IT4W7FMUUX/events.json","paper":"https://pith.science/paper/4AVDCBL3"},"agent_actions":{"view_html":"https://pith.science/pith/4AVDCBL3ZKQPCS73IT4W7FMUUX","download_json":"https://pith.science/pith/4AVDCBL3ZKQPCS73IT4W7FMUUX.json","view_paper":"https://pith.science/paper/4AVDCBL3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.0884&json=true","fetch_graph":"https://pith.science/api/pith-number/4AVDCBL3ZKQPCS73IT4W7FMUUX/graph.json","fetch_events":"https://pith.science/api/pith-number/4AVDCBL3ZKQPCS73IT4W7FMUUX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4AVDCBL3ZKQPCS73IT4W7FMUUX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4AVDCBL3ZKQPCS73IT4W7FMUUX/action/storage_attestation","attest_author":"https://pith.science/pith/4AVDCBL3ZKQPCS73IT4W7FMUUX/action/author_attestation","sign_citation":"https://pith.science/pith/4AVDCBL3ZKQPCS73IT4W7FMUUX/action/citation_signature","submit_replication":"https://pith.science/pith/4AVDCBL3ZKQPCS73IT4W7FMUUX/action/replication_record"}},"created_at":"2026-05-18T02:58:56.253098+00:00","updated_at":"2026-05-18T02:58:56.253098+00:00"}