{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IKZKGA443W5MJ5BPABKEVWMU3C","short_pith_number":"pith:IKZKGA44","canonical_record":{"source":{"id":"1611.00290","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-01T16:42:06Z","cross_cats_sorted":[],"title_canon_sha256":"69a61f2c17955b092e15e0ae8c41d4cb9449825f6a4674966650f3f82f21ce12","abstract_canon_sha256":"ddc26638f4603feb74b666152fb1996c5a1ecf041a6a391f8fb407532d585e0b"},"schema_version":"1.0"},"canonical_sha256":"42b2a3039cddbac4f42f00544ad994d886542490e14f543b9fe591764fa68b2e","source":{"kind":"arxiv","id":"1611.00290","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00290","created_at":"2026-05-18T00:23:09Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00290v2","created_at":"2026-05-18T00:23:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00290","created_at":"2026-05-18T00:23:09Z"},{"alias_kind":"pith_short_12","alias_value":"IKZKGA443W5M","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IKZKGA443W5MJ5BP","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IKZKGA44","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IKZKGA443W5MJ5BPABKEVWMU3C","target":"record","payload":{"canonical_record":{"source":{"id":"1611.00290","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-01T16:42:06Z","cross_cats_sorted":[],"title_canon_sha256":"69a61f2c17955b092e15e0ae8c41d4cb9449825f6a4674966650f3f82f21ce12","abstract_canon_sha256":"ddc26638f4603feb74b666152fb1996c5a1ecf041a6a391f8fb407532d585e0b"},"schema_version":"1.0"},"canonical_sha256":"42b2a3039cddbac4f42f00544ad994d886542490e14f543b9fe591764fa68b2e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:09.285314Z","signature_b64":"ETDSxNc9NQfhY6DME5yZLJpgU5RfQGj8DXqNMMOzukvcsuXoSEG94UJdPY4butNSSE6YslArH3skqhpFDCocBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42b2a3039cddbac4f42f00544ad994d886542490e14f543b9fe591764fa68b2e","last_reissued_at":"2026-05-18T00:23:09.284648Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:09.284648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.00290","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-18T00:23:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GXOFva4LMx9aykTmcgOuixgBuIFrUlYBMssy0Shw0XQxNx7ddLqYwoRtva7s+doIUmiVGr1M54k1ki9Fe9aQAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:44:47.443252Z"},"content_sha256":"078a83510e1157ef3b9dfa97ec05c7731a1530626dad1648235eefc0328dc4c3","schema_version":"1.0","event_id":"sha256:078a83510e1157ef3b9dfa97ec05c7731a1530626dad1648235eefc0328dc4c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IKZKGA443W5MJ5BPABKEVWMU3C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matchings in $k$-partite $k$-uniform Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chuanyun Zang, Jie Han, Yi Zhao","submitted_at":"2016-11-01T16:42:06Z","abstract_excerpt":"For $k\\ge 3$ and $\\epsilon>0$, let $H$ be a $k$-partite $k$-graph with parts $V_1,\\dots, V_k$ each of size $n$, where $n$ is sufficiently large. Assume that for each $i\\in [k]$, every $(k-1)$-set in $\\prod_{j\\in [k]\\setminus \\{i\\}} V_i$ lies in at least $a_i$ edges, and $a_1\\ge a_2\\ge \\cdots \\ge a_k$. We show that if $a_1, a_2\\ge \\epsilon n$, then $H$ contains a matching of size $\\min\\{n-1, \\sum_{i\\in [k]}a_i\\}$. In particular, $H$ contains a matching of size $n-1$ if each crossing $(k-1)$-set lies in at least $\\lceil n/k \\rceil$ edges, or each crossing $(k-1)$-set lies in at least $\\lfloor n/"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00290","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-18T00:23:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"52wkQHrHy71Aj3FSZ2DpeT8M2YVJwmfe0nr9iRNKxQlmGfrPHilN4DKCisDfoAeEMcicuqeZ51itKF5HaMs6DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:44:47.443871Z"},"content_sha256":"454cf345f3d9348e330e67122ce1d6a0cfd0dc8512f2468c79318d9023f3cdd8","schema_version":"1.0","event_id":"sha256:454cf345f3d9348e330e67122ce1d6a0cfd0dc8512f2468c79318d9023f3cdd8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IKZKGA443W5MJ5BPABKEVWMU3C/bundle.json","state_url":"https://pith.science/pith/IKZKGA443W5MJ5BPABKEVWMU3C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IKZKGA443W5MJ5BPABKEVWMU3C/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-06-05T16:44:47Z","links":{"resolver":"https://pith.science/pith/IKZKGA443W5MJ5BPABKEVWMU3C","bundle":"https://pith.science/pith/IKZKGA443W5MJ5BPABKEVWMU3C/bundle.json","state":"https://pith.science/pith/IKZKGA443W5MJ5BPABKEVWMU3C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IKZKGA443W5MJ5BPABKEVWMU3C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IKZKGA443W5MJ5BPABKEVWMU3C","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":"ddc26638f4603feb74b666152fb1996c5a1ecf041a6a391f8fb407532d585e0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-01T16:42:06Z","title_canon_sha256":"69a61f2c17955b092e15e0ae8c41d4cb9449825f6a4674966650f3f82f21ce12"},"schema_version":"1.0","source":{"id":"1611.00290","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00290","created_at":"2026-05-18T00:23:09Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00290v2","created_at":"2026-05-18T00:23:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00290","created_at":"2026-05-18T00:23:09Z"},{"alias_kind":"pith_short_12","alias_value":"IKZKGA443W5M","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IKZKGA443W5MJ5BP","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IKZKGA44","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:454cf345f3d9348e330e67122ce1d6a0cfd0dc8512f2468c79318d9023f3cdd8","target":"graph","created_at":"2026-05-18T00:23:09Z","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":"For $k\\ge 3$ and $\\epsilon>0$, let $H$ be a $k$-partite $k$-graph with parts $V_1,\\dots, V_k$ each of size $n$, where $n$ is sufficiently large. Assume that for each $i\\in [k]$, every $(k-1)$-set in $\\prod_{j\\in [k]\\setminus \\{i\\}} V_i$ lies in at least $a_i$ edges, and $a_1\\ge a_2\\ge \\cdots \\ge a_k$. We show that if $a_1, a_2\\ge \\epsilon n$, then $H$ contains a matching of size $\\min\\{n-1, \\sum_{i\\in [k]}a_i\\}$. In particular, $H$ contains a matching of size $n-1$ if each crossing $(k-1)$-set lies in at least $\\lceil n/k \\rceil$ edges, or each crossing $(k-1)$-set lies in at least $\\lfloor n/","authors_text":"Chuanyun Zang, Jie Han, Yi Zhao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-01T16:42:06Z","title":"Matchings in $k$-partite $k$-uniform Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00290","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:078a83510e1157ef3b9dfa97ec05c7731a1530626dad1648235eefc0328dc4c3","target":"record","created_at":"2026-05-18T00:23:09Z","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":"ddc26638f4603feb74b666152fb1996c5a1ecf041a6a391f8fb407532d585e0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-01T16:42:06Z","title_canon_sha256":"69a61f2c17955b092e15e0ae8c41d4cb9449825f6a4674966650f3f82f21ce12"},"schema_version":"1.0","source":{"id":"1611.00290","kind":"arxiv","version":2}},"canonical_sha256":"42b2a3039cddbac4f42f00544ad994d886542490e14f543b9fe591764fa68b2e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42b2a3039cddbac4f42f00544ad994d886542490e14f543b9fe591764fa68b2e","first_computed_at":"2026-05-18T00:23:09.284648Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:09.284648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ETDSxNc9NQfhY6DME5yZLJpgU5RfQGj8DXqNMMOzukvcsuXoSEG94UJdPY4butNSSE6YslArH3skqhpFDCocBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:09.285314Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.00290","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:078a83510e1157ef3b9dfa97ec05c7731a1530626dad1648235eefc0328dc4c3","sha256:454cf345f3d9348e330e67122ce1d6a0cfd0dc8512f2468c79318d9023f3cdd8"],"state_sha256":"494a8970959622dd6c2bda55eb69d6e09ae3ed3c783d2bfd28aa2a2a9b4ef49c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ngK/kMCvjkL0XvXlk7kA7KIyrxn1jbFu6MkLlQpPA7GH8CDlUP5PnS+5kGXNYdu7IARyFFIJsYHRs4+xiYDcCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T16:44:47.446276Z","bundle_sha256":"105aad18ea997bcf7ba0e996c6bdcfd10da2c3783cd2d7b1d3b5cb46846a9611"}}