{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4AVDCBL3ZKQPCS73IT4W7FMUUX","short_pith_number":"pith:4AVDCBL3","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"},"canonical_sha256":"e02a31057bcaa0f14bfb44f96f9594a5e39993b4d1628ab888368f19480a7ad3","source":{"kind":"arxiv","id":"1402.0884","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0884","created_at":"2026-05-18T02:58:56Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0884v2","created_at":"2026-05-18T02:58:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0884","created_at":"2026-05-18T02:58:56Z"},{"alias_kind":"pith_short_12","alias_value":"4AVDCBL3ZKQP","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4AVDCBL3ZKQPCS73","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4AVDCBL3","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4AVDCBL3ZKQPCS73IT4W7FMUUX","target":"record","payload":{"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"},"canonical_sha256":"e02a31057bcaa0f14bfb44f96f9594a5e39993b4d1628ab888368f19480a7ad3","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"},"source_kind":"arxiv","source_id":"1402.0884","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-18T02:58:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qe1FcsLZ4n21CHBcFqzfjiVvd3fo7v+S5qshPXpQ2tZrOyiXTzqrwvAGwnFE7Z4Zz0edrz4YdJZmv4DSnYaVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:30:01.390606Z"},"content_sha256":"9030f9781c82f9af146c374c4dbba5a7377ec53b1a6ec618b271407dba1eea2b","schema_version":"1.0","event_id":"sha256:9030f9781c82f9af146c374c4dbba5a7377ec53b1a6ec618b271407dba1eea2b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4AVDCBL3ZKQPCS73IT4W7FMUUX","target":"graph","payload":{"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"},"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-18T02:58:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oqfpdQndjA2lmziLAFJTcpOKS/iBtMxqMTypDb34FsGi6DrBaF7GyBSI1NrZIrtmW3o8Y7zeMgjBHMWxV4DRBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:30:01.391278Z"},"content_sha256":"2b7380b5903486ea624e306b54eff95756b171407c4c424116fb13e4d420157a","schema_version":"1.0","event_id":"sha256:2b7380b5903486ea624e306b54eff95756b171407c4c424116fb13e4d420157a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4AVDCBL3ZKQPCS73IT4W7FMUUX/bundle.json","state_url":"https://pith.science/pith/4AVDCBL3ZKQPCS73IT4W7FMUUX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4AVDCBL3ZKQPCS73IT4W7FMUUX/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-31T23:30:01Z","links":{"resolver":"https://pith.science/pith/4AVDCBL3ZKQPCS73IT4W7FMUUX","bundle":"https://pith.science/pith/4AVDCBL3ZKQPCS73IT4W7FMUUX/bundle.json","state":"https://pith.science/pith/4AVDCBL3ZKQPCS73IT4W7FMUUX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4AVDCBL3ZKQPCS73IT4W7FMUUX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4AVDCBL3ZKQPCS73IT4W7FMUUX","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":"d642273a21befef94f57177956dce5d7b2defdc08e29c2427dacc23ca09421e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-04T21:16:48Z","title_canon_sha256":"fe08ee25f097a4132868d2af4aadbacccb121d0142c32ad0f84cc1b5c172ec06"},"schema_version":"1.0","source":{"id":"1402.0884","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0884","created_at":"2026-05-18T02:58:56Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0884v2","created_at":"2026-05-18T02:58:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0884","created_at":"2026-05-18T02:58:56Z"},{"alias_kind":"pith_short_12","alias_value":"4AVDCBL3ZKQP","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4AVDCBL3ZKQPCS73","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4AVDCBL3","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:2b7380b5903486ea624e306b54eff95756b171407c4c424116fb13e4d420157a","target":"graph","created_at":"2026-05-18T02:58:56Z","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":"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","authors_text":"Dhruv Mubayi, John Lenz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-04T21:16:48Z","title":"Perfect Packings in Quasirandom Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0884","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:9030f9781c82f9af146c374c4dbba5a7377ec53b1a6ec618b271407dba1eea2b","target":"record","created_at":"2026-05-18T02:58:56Z","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":"d642273a21befef94f57177956dce5d7b2defdc08e29c2427dacc23ca09421e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-04T21:16:48Z","title_canon_sha256":"fe08ee25f097a4132868d2af4aadbacccb121d0142c32ad0f84cc1b5c172ec06"},"schema_version":"1.0","source":{"id":"1402.0884","kind":"arxiv","version":2}},"canonical_sha256":"e02a31057bcaa0f14bfb44f96f9594a5e39993b4d1628ab888368f19480a7ad3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e02a31057bcaa0f14bfb44f96f9594a5e39993b4d1628ab888368f19480a7ad3","first_computed_at":"2026-05-18T02:58:56.253003Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:56.253003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bZRHaiEfpxHFCczJR3SdgLSph2vJzfwXwvO0lcApO/FglPM90VZHL3jgNc0m7aYdg3/oQ25gSBE5a3hEHSuZDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:56.253659Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.0884","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9030f9781c82f9af146c374c4dbba5a7377ec53b1a6ec618b271407dba1eea2b","sha256:2b7380b5903486ea624e306b54eff95756b171407c4c424116fb13e4d420157a"],"state_sha256":"76363ef330b130475c1de5dac592ff5ea285fdb90a840357bf86056909c5c08f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R4zZfRzNCCsdQtGoUt1uB6efrsSjg2cAS3ZLqZynmd56/mA+DNoiDmxs5fgGm8Dr/gNfYj61Y1yAFftEdWLqAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:30:01.394900Z","bundle_sha256":"aeb0742c2e97ea5526f419315c06c14def983904622d4470ac8b952a7f2bc52a"}}