{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:XJWHDDF737XZSRW4VCINDQXKTM","short_pith_number":"pith:XJWHDDF7","canonical_record":{"source":{"id":"2111.14140","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-11-28T13:38:12Z","cross_cats_sorted":[],"title_canon_sha256":"bf0d0db4134500f5e1678cb529cadd05b7067be2be9f46572155be7cb9d96c87","abstract_canon_sha256":"7d9bdf0b9e3f3bff57feef651f8209f4de85b351f371162f099d0c8c6629b7ac"},"schema_version":"1.0"},"canonical_sha256":"ba6c718cbfdfef9946dca890d1c2ea9b1e5fce9b280ed91918ac51a6d5f487f6","source":{"kind":"arxiv","id":"2111.14140","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.14140","created_at":"2026-07-05T05:25:47Z"},{"alias_kind":"arxiv_version","alias_value":"2111.14140v2","created_at":"2026-07-05T05:25:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.14140","created_at":"2026-07-05T05:25:47Z"},{"alias_kind":"pith_short_12","alias_value":"XJWHDDF737XZ","created_at":"2026-07-05T05:25:47Z"},{"alias_kind":"pith_short_16","alias_value":"XJWHDDF737XZSRW4","created_at":"2026-07-05T05:25:47Z"},{"alias_kind":"pith_short_8","alias_value":"XJWHDDF7","created_at":"2026-07-05T05:25:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:XJWHDDF737XZSRW4VCINDQXKTM","target":"record","payload":{"canonical_record":{"source":{"id":"2111.14140","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-11-28T13:38:12Z","cross_cats_sorted":[],"title_canon_sha256":"bf0d0db4134500f5e1678cb529cadd05b7067be2be9f46572155be7cb9d96c87","abstract_canon_sha256":"7d9bdf0b9e3f3bff57feef651f8209f4de85b351f371162f099d0c8c6629b7ac"},"schema_version":"1.0"},"canonical_sha256":"ba6c718cbfdfef9946dca890d1c2ea9b1e5fce9b280ed91918ac51a6d5f487f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:25:47.500378Z","signature_b64":"8J9HjeYMqWOWK+flOBBFTI5j+aVT1yRxB5z8O6pHnLJb4tzmir2Tb+MnG4jAfew1U7eWc72+V05q8wv4wbfsBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba6c718cbfdfef9946dca890d1c2ea9b1e5fce9b280ed91918ac51a6d5f487f6","last_reissued_at":"2026-07-05T05:25:47.499819Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:25:47.499819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2111.14140","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-07-05T05:25:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rccpYtcr2ETUOTsPw5RnKnsq35r8z3MoMsoVWdGwm1HQ8xTZyBEscdZBcXTC/DLIGhaedoQtbs5vCdLo+VH8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:07:48.238201Z"},"content_sha256":"c89ed6b54ad75c46537e77d75dea871f5e8a6dd9f71f7ca2809059e2cdd6f5ca","schema_version":"1.0","event_id":"sha256:c89ed6b54ad75c46537e77d75dea871f5e8a6dd9f71f7ca2809059e2cdd6f5ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:XJWHDDF737XZSRW4VCINDQXKTM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tiling multipartite hypergraphs in Quasi-random Hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guanghui Wang, Jie Han, Laihao Ding, Shumin Sun, Wenling Zhou","submitted_at":"2021-11-28T13:38:12Z","abstract_excerpt":"Given $k\\ge 2$ and two $k$-graphs ($k$-uniform hypergraphs) $F$ and $H$, an \\emph{$F$-factor} in $H$ is a set of vertex disjoint copies of $F$ that together covers the vertex set of $H$. Lenz and Mubayi studied the $F$-factor problems in quasi-random $k$-graphs with minimum degree $\\Omega(n^{k-1})$. In particular, they constructed a sequence of $1/8$-dense quasi-random $3$-graphs $H(n)$ with minimum degree $\\Omega(n^2)$ and minimum codegree $\\Omega(n)$ but with no $K_{2,2,2}$-factor. We prove that if $p>1/8$ and $F$ is a $3$-partite $3$-graph with $f$ vertices, then for sufficiently large $n$,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.14140","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.14140/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"},"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-07-05T05:25:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oxNOXgthEnkfqtaBwz+zbLQQxObKiW5LYAOWhoZHvB2djobRuUPMPBuhcsgyCfo+DnAo0VALol2JIJA1bz6PBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:07:48.238614Z"},"content_sha256":"dfaa825f77d23a7414fc4253bc0817144b136c41b0b5691f96b90d47a2756d6b","schema_version":"1.0","event_id":"sha256:dfaa825f77d23a7414fc4253bc0817144b136c41b0b5691f96b90d47a2756d6b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XJWHDDF737XZSRW4VCINDQXKTM/bundle.json","state_url":"https://pith.science/pith/XJWHDDF737XZSRW4VCINDQXKTM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XJWHDDF737XZSRW4VCINDQXKTM/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-07-06T18:07:48Z","links":{"resolver":"https://pith.science/pith/XJWHDDF737XZSRW4VCINDQXKTM","bundle":"https://pith.science/pith/XJWHDDF737XZSRW4VCINDQXKTM/bundle.json","state":"https://pith.science/pith/XJWHDDF737XZSRW4VCINDQXKTM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XJWHDDF737XZSRW4VCINDQXKTM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:XJWHDDF737XZSRW4VCINDQXKTM","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":"7d9bdf0b9e3f3bff57feef651f8209f4de85b351f371162f099d0c8c6629b7ac","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-11-28T13:38:12Z","title_canon_sha256":"bf0d0db4134500f5e1678cb529cadd05b7067be2be9f46572155be7cb9d96c87"},"schema_version":"1.0","source":{"id":"2111.14140","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.14140","created_at":"2026-07-05T05:25:47Z"},{"alias_kind":"arxiv_version","alias_value":"2111.14140v2","created_at":"2026-07-05T05:25:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.14140","created_at":"2026-07-05T05:25:47Z"},{"alias_kind":"pith_short_12","alias_value":"XJWHDDF737XZ","created_at":"2026-07-05T05:25:47Z"},{"alias_kind":"pith_short_16","alias_value":"XJWHDDF737XZSRW4","created_at":"2026-07-05T05:25:47Z"},{"alias_kind":"pith_short_8","alias_value":"XJWHDDF7","created_at":"2026-07-05T05:25:47Z"}],"graph_snapshots":[{"event_id":"sha256:dfaa825f77d23a7414fc4253bc0817144b136c41b0b5691f96b90d47a2756d6b","target":"graph","created_at":"2026-07-05T05:25:47Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2111.14140/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given $k\\ge 2$ and two $k$-graphs ($k$-uniform hypergraphs) $F$ and $H$, an \\emph{$F$-factor} in $H$ is a set of vertex disjoint copies of $F$ that together covers the vertex set of $H$. Lenz and Mubayi studied the $F$-factor problems in quasi-random $k$-graphs with minimum degree $\\Omega(n^{k-1})$. In particular, they constructed a sequence of $1/8$-dense quasi-random $3$-graphs $H(n)$ with minimum degree $\\Omega(n^2)$ and minimum codegree $\\Omega(n)$ but with no $K_{2,2,2}$-factor. We prove that if $p>1/8$ and $F$ is a $3$-partite $3$-graph with $f$ vertices, then for sufficiently large $n$,","authors_text":"Guanghui Wang, Jie Han, Laihao Ding, Shumin Sun, Wenling Zhou","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-11-28T13:38:12Z","title":"Tiling multipartite hypergraphs in Quasi-random Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.14140","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:c89ed6b54ad75c46537e77d75dea871f5e8a6dd9f71f7ca2809059e2cdd6f5ca","target":"record","created_at":"2026-07-05T05:25:47Z","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":"7d9bdf0b9e3f3bff57feef651f8209f4de85b351f371162f099d0c8c6629b7ac","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-11-28T13:38:12Z","title_canon_sha256":"bf0d0db4134500f5e1678cb529cadd05b7067be2be9f46572155be7cb9d96c87"},"schema_version":"1.0","source":{"id":"2111.14140","kind":"arxiv","version":2}},"canonical_sha256":"ba6c718cbfdfef9946dca890d1c2ea9b1e5fce9b280ed91918ac51a6d5f487f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba6c718cbfdfef9946dca890d1c2ea9b1e5fce9b280ed91918ac51a6d5f487f6","first_computed_at":"2026-07-05T05:25:47.499819Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:25:47.499819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8J9HjeYMqWOWK+flOBBFTI5j+aVT1yRxB5z8O6pHnLJb4tzmir2Tb+MnG4jAfew1U7eWc72+V05q8wv4wbfsBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:25:47.500378Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.14140","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c89ed6b54ad75c46537e77d75dea871f5e8a6dd9f71f7ca2809059e2cdd6f5ca","sha256:dfaa825f77d23a7414fc4253bc0817144b136c41b0b5691f96b90d47a2756d6b"],"state_sha256":"5b1b306d51e48520014b0d319836c44dacb6a119720c66a77759bcb30194c194"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dMHA9pKbrPeG9ykTKehK8O3p1KiBvIrrHjOBUgpk9KRUTatcbE0fVZXbSEd1NniIkh0fJPidfQOgzoyWHPUHDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T18:07:48.240870Z","bundle_sha256":"f884b78a15151fae60d3cadcfa5727a77fd6413bc810ddef25bbaa49b8b1d06b"}}