{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:IXOQNE32DWZO4DSLA6QID3WPAR","short_pith_number":"pith:IXOQNE32","schema_version":"1.0","canonical_sha256":"45dd06937a1db2ee0e4b07a081eecf0472ebd405679d1605bebeeabfd69c66cb","source":{"kind":"arxiv","id":"2207.00277","version":1},"attestation_state":"computed","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$."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2207.00277","created_at":"2026-07-05T04:36:41.380582+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.00277v1","created_at":"2026-07-05T04:36:41.380582+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.00277","created_at":"2026-07-05T04:36:41.380582+00:00"},{"alias_kind":"pith_short_12","alias_value":"IXOQNE32DWZO","created_at":"2026-07-05T04:36:41.380582+00:00"},{"alias_kind":"pith_short_16","alias_value":"IXOQNE32DWZO4DSL","created_at":"2026-07-05T04:36:41.380582+00:00"},{"alias_kind":"pith_short_8","alias_value":"IXOQNE32","created_at":"2026-07-05T04:36:41.380582+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/IXOQNE32DWZO4DSLA6QID3WPAR","json":"https://pith.science/pith/IXOQNE32DWZO4DSLA6QID3WPAR.json","graph_json":"https://pith.science/api/pith-number/IXOQNE32DWZO4DSLA6QID3WPAR/graph.json","events_json":"https://pith.science/api/pith-number/IXOQNE32DWZO4DSLA6QID3WPAR/events.json","paper":"https://pith.science/paper/IXOQNE32"},"agent_actions":{"view_html":"https://pith.science/pith/IXOQNE32DWZO4DSLA6QID3WPAR","download_json":"https://pith.science/pith/IXOQNE32DWZO4DSLA6QID3WPAR.json","view_paper":"https://pith.science/paper/IXOQNE32","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.00277&json=true","fetch_graph":"https://pith.science/api/pith-number/IXOQNE32DWZO4DSLA6QID3WPAR/graph.json","fetch_events":"https://pith.science/api/pith-number/IXOQNE32DWZO4DSLA6QID3WPAR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IXOQNE32DWZO4DSLA6QID3WPAR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IXOQNE32DWZO4DSLA6QID3WPAR/action/storage_attestation","attest_author":"https://pith.science/pith/IXOQNE32DWZO4DSLA6QID3WPAR/action/author_attestation","sign_citation":"https://pith.science/pith/IXOQNE32DWZO4DSLA6QID3WPAR/action/citation_signature","submit_replication":"https://pith.science/pith/IXOQNE32DWZO4DSLA6QID3WPAR/action/replication_record"}},"created_at":"2026-07-05T04:36:41.380582+00:00","updated_at":"2026-07-05T04:36:41.380582+00:00"}