{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:IXOQNE32DWZO4DSLA6QID3WPAR","short_pith_number":"pith:IXOQNE32","canonical_record":{"source":{"id":"2207.00277","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-07-01T09:08:40Z","cross_cats_sorted":[],"title_canon_sha256":"e2b5f52975106e2d3db6ef0c55a6fcde08044d582968a14e7c9ead6d7a3c4ea1","abstract_canon_sha256":"109953f46bcd827116180bf9e03736662c486af4a0d579dbfcecd9cdb3cbef0b"},"schema_version":"1.0"},"canonical_sha256":"45dd06937a1db2ee0e4b07a081eecf0472ebd405679d1605bebeeabfd69c66cb","source":{"kind":"arxiv","id":"2207.00277","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.00277","created_at":"2026-07-05T04:36:41Z"},{"alias_kind":"arxiv_version","alias_value":"2207.00277v1","created_at":"2026-07-05T04:36:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.00277","created_at":"2026-07-05T04:36:41Z"},{"alias_kind":"pith_short_12","alias_value":"IXOQNE32DWZO","created_at":"2026-07-05T04:36:41Z"},{"alias_kind":"pith_short_16","alias_value":"IXOQNE32DWZO4DSL","created_at":"2026-07-05T04:36:41Z"},{"alias_kind":"pith_short_8","alias_value":"IXOQNE32","created_at":"2026-07-05T04:36:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:IXOQNE32DWZO4DSLA6QID3WPAR","target":"record","payload":{"canonical_record":{"source":{"id":"2207.00277","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-07-01T09:08:40Z","cross_cats_sorted":[],"title_canon_sha256":"e2b5f52975106e2d3db6ef0c55a6fcde08044d582968a14e7c9ead6d7a3c4ea1","abstract_canon_sha256":"109953f46bcd827116180bf9e03736662c486af4a0d579dbfcecd9cdb3cbef0b"},"schema_version":"1.0"},"canonical_sha256":"45dd06937a1db2ee0e4b07a081eecf0472ebd405679d1605bebeeabfd69c66cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:36:41.380986Z","signature_b64":"xhBxiiB0Mvnx7dFqVoTAvhsS8Ho6hXGaBZKKGtKEI3eolYJllY3MKNFGo4Z2dayycix/pKcdg5nSRsy7JWIqDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45dd06937a1db2ee0e4b07a081eecf0472ebd405679d1605bebeeabfd69c66cb","last_reissued_at":"2026-07-05T04:36:41.380517Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:36:41.380517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2207.00277","source_version":1,"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-05T04:36:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bc8rQhKlByT7627DrrbcbBwyjXcwImfU8kbDR0k3HDhNoLxf3OpobJovWjUytb12iKTXBFpEH5g47/Q4xpEvCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T14:38:07.851977Z"},"content_sha256":"fa47300c080a805ba9f555e12388ea00e33c0600dee25f21a3ff7cd599467869","schema_version":"1.0","event_id":"sha256:fa47300c080a805ba9f555e12388ea00e33c0600dee25f21a3ff7cd599467869"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:IXOQNE32DWZO4DSLA6QID3WPAR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A non-uniform extension of Baranyai's Theorem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hao Huang, Jie Ma, Jinye He","submitted_at":"2022-07-01T09:08:40Z","abstract_excerpt":"A celebrated theorem of Baranyai states that when $k$ divides $n$, the family $K_n^k$ of all $k$-subsets of an $n$-element set can be partitioned into perfect matchings. In other words, $K_n^k$ is $1$-factorable. In this paper, we determine all $n, k$, such that the family $K_n^{\\le k}$ consisting of subsets of $[n]$ of size up to $k$ is $1$-factorable, and thus extend Baranyai's Theorem to the non-uniform setting. In particular, our result implies that for fixed $k$ and sufficiently large $n$, $K_n^{\\le k}$ is $1$-factorable if and only if $n \\equiv 0$ or $-1 \\pmod k$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.00277","kind":"arxiv","version":1},"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/2207.00277/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-05T04:36:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wl9h/6smxrbB7zklP+yV+Vpp+k1a9LwHkYeE8KD3fL0mLsfpAmg8bJlBBtTaDh43cQTHIiyrsJFLGAVh9dpWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T14:38:07.852310Z"},"content_sha256":"90e3fde5e61a6e266a4e780aad0707e6f8c3d9f81069165d7d5cd50e36878183","schema_version":"1.0","event_id":"sha256:90e3fde5e61a6e266a4e780aad0707e6f8c3d9f81069165d7d5cd50e36878183"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IXOQNE32DWZO4DSLA6QID3WPAR/bundle.json","state_url":"https://pith.science/pith/IXOQNE32DWZO4DSLA6QID3WPAR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IXOQNE32DWZO4DSLA6QID3WPAR/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-31T14:38:07Z","links":{"resolver":"https://pith.science/pith/IXOQNE32DWZO4DSLA6QID3WPAR","bundle":"https://pith.science/pith/IXOQNE32DWZO4DSLA6QID3WPAR/bundle.json","state":"https://pith.science/pith/IXOQNE32DWZO4DSLA6QID3WPAR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IXOQNE32DWZO4DSLA6QID3WPAR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:IXOQNE32DWZO4DSLA6QID3WPAR","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":"109953f46bcd827116180bf9e03736662c486af4a0d579dbfcecd9cdb3cbef0b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-07-01T09:08:40Z","title_canon_sha256":"e2b5f52975106e2d3db6ef0c55a6fcde08044d582968a14e7c9ead6d7a3c4ea1"},"schema_version":"1.0","source":{"id":"2207.00277","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.00277","created_at":"2026-07-05T04:36:41Z"},{"alias_kind":"arxiv_version","alias_value":"2207.00277v1","created_at":"2026-07-05T04:36:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.00277","created_at":"2026-07-05T04:36:41Z"},{"alias_kind":"pith_short_12","alias_value":"IXOQNE32DWZO","created_at":"2026-07-05T04:36:41Z"},{"alias_kind":"pith_short_16","alias_value":"IXOQNE32DWZO4DSL","created_at":"2026-07-05T04:36:41Z"},{"alias_kind":"pith_short_8","alias_value":"IXOQNE32","created_at":"2026-07-05T04:36:41Z"}],"graph_snapshots":[{"event_id":"sha256:90e3fde5e61a6e266a4e780aad0707e6f8c3d9f81069165d7d5cd50e36878183","target":"graph","created_at":"2026-07-05T04:36:41Z","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/2207.00277/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A celebrated theorem of Baranyai states that when $k$ divides $n$, the family $K_n^k$ of all $k$-subsets of an $n$-element set can be partitioned into perfect matchings. In other words, $K_n^k$ is $1$-factorable. In this paper, we determine all $n, k$, such that the family $K_n^{\\le k}$ consisting of subsets of $[n]$ of size up to $k$ is $1$-factorable, and thus extend Baranyai's Theorem to the non-uniform setting. In particular, our result implies that for fixed $k$ and sufficiently large $n$, $K_n^{\\le k}$ is $1$-factorable if and only if $n \\equiv 0$ or $-1 \\pmod k$.","authors_text":"Hao Huang, Jie Ma, Jinye He","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-07-01T09:08:40Z","title":"A non-uniform extension of Baranyai's Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.00277","kind":"arxiv","version":1},"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:fa47300c080a805ba9f555e12388ea00e33c0600dee25f21a3ff7cd599467869","target":"record","created_at":"2026-07-05T04:36:41Z","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":"109953f46bcd827116180bf9e03736662c486af4a0d579dbfcecd9cdb3cbef0b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-07-01T09:08:40Z","title_canon_sha256":"e2b5f52975106e2d3db6ef0c55a6fcde08044d582968a14e7c9ead6d7a3c4ea1"},"schema_version":"1.0","source":{"id":"2207.00277","kind":"arxiv","version":1}},"canonical_sha256":"45dd06937a1db2ee0e4b07a081eecf0472ebd405679d1605bebeeabfd69c66cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45dd06937a1db2ee0e4b07a081eecf0472ebd405679d1605bebeeabfd69c66cb","first_computed_at":"2026-07-05T04:36:41.380517Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:36:41.380517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xhBxiiB0Mvnx7dFqVoTAvhsS8Ho6hXGaBZKKGtKEI3eolYJllY3MKNFGo4Z2dayycix/pKcdg5nSRsy7JWIqDw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:36:41.380986Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.00277","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa47300c080a805ba9f555e12388ea00e33c0600dee25f21a3ff7cd599467869","sha256:90e3fde5e61a6e266a4e780aad0707e6f8c3d9f81069165d7d5cd50e36878183"],"state_sha256":"1269a668aeb8ec0dae09f5a2f474b570d7f3c2ba2bfe34091970c6ab7d8764b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bXloxG7q8+9XPl+iyOu5CF4N4tX3vmzvhLgjbuP1Jzuzzp5Oqcpn/G+Pkfg2r1P3/mYJ7+5R2epDDOjoippkBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T14:38:07.854667Z","bundle_sha256":"a515445759b4be3351c2b015a38266239813008da895c639ffa1ec5eca9ca99b"}}