{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:F7ANTMJULSVFECFFNLON64DKXS","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":"bfb7835924ef2a0af13cf98762ad1c8b54669858515384d4035dc91b64c34070","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-07T14:08:10Z","title_canon_sha256":"2d0114b2bf8759fbb706f4b59e474ba6a2b0bc01b4587bb68bc8c4092e341fef"},"schema_version":"1.0","source":{"id":"1009.1298","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.1298","created_at":"2026-05-18T03:41:01Z"},{"alias_kind":"arxiv_version","alias_value":"1009.1298v2","created_at":"2026-05-18T03:41:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.1298","created_at":"2026-05-18T03:41:01Z"},{"alias_kind":"pith_short_12","alias_value":"F7ANTMJULSVF","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"F7ANTMJULSVFECFF","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"F7ANTMJU","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:ec48d626374770856322a1ff2885544d4b6ecb6374b389367fed1f42d967cc21","target":"graph","created_at":"2026-05-18T03:41:01Z","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":"We determine the minimum vertex degree that ensures a perfect matching in a 3-uniform hypergraph. More precisely, suppose that H is a sufficiently large 3-uniform hypergraph whose order n is divisible by 3. If the minimum vertex degree of H is greater than \\binom{n-1}{2}-\\binom{2n/3}{2}, then H contains a perfect matching. This bound is tight and answers a question of Han, Person and Schacht. More generally, we show that H contains a matching of size d\\le n/3 if its minimum vertex degree is greater than \\binom{n-1}{2}-\\binom{n-d}{2}, which is also best possible. This extends a result of Bollob","authors_text":"Andrew Treglown, Daniela K\\\"uhn, Deryk Osthus","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-07T14:08:10Z","title":"Matchings in 3-uniform hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.1298","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:854af3ae283248e91efec147cceb8a1d374f07a462d621be1836a76cbccc7f11","target":"record","created_at":"2026-05-18T03:41:01Z","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":"bfb7835924ef2a0af13cf98762ad1c8b54669858515384d4035dc91b64c34070","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-07T14:08:10Z","title_canon_sha256":"2d0114b2bf8759fbb706f4b59e474ba6a2b0bc01b4587bb68bc8c4092e341fef"},"schema_version":"1.0","source":{"id":"1009.1298","kind":"arxiv","version":2}},"canonical_sha256":"2fc0d9b1345caa5208a56adcdf706abc880dbc560b6d666ef75a106588bd8ccc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2fc0d9b1345caa5208a56adcdf706abc880dbc560b6d666ef75a106588bd8ccc","first_computed_at":"2026-05-18T03:41:01.598934Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:01.598934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FNBSrvAhtVCd+hGQQbSuXT/M4TgmPBFQST4hJmyOXJxvgROCopq5YLta35tC69QSfO5lktUpXqrKsGKf9gdhDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:01.599572Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.1298","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:854af3ae283248e91efec147cceb8a1d374f07a462d621be1836a76cbccc7f11","sha256:ec48d626374770856322a1ff2885544d4b6ecb6374b389367fed1f42d967cc21"],"state_sha256":"2d561d1ba42ee8dee5cc4cead018240ea33a61588ab2d03ceb69f5d5460a579c"}