{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:LNHGN7CRKUUNVFF6QQLEQZCCED","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":"70e8950af0709756ffdc6da61968a53e18c464670e06fcea7164eb3b3a2f73ea","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-01-30T23:05:17Z","title_canon_sha256":"8121f227d28f378155985946de6ceb7a9ab0c34ce7feaa9eec96b7e8de615a4d"},"schema_version":"1.0","source":{"id":"1101.5830","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.5830","created_at":"2026-05-18T02:22:41Z"},{"alias_kind":"arxiv_version","alias_value":"1101.5830v3","created_at":"2026-05-18T02:22:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.5830","created_at":"2026-05-18T02:22:41Z"},{"alias_kind":"pith_short_12","alias_value":"LNHGN7CRKUUN","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LNHGN7CRKUUNVFF6","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LNHGN7CR","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:e36e7104c64ed3b7581c266f98e0e7d2975911d755af2a6f730205a66384b26d","target":"graph","created_at":"2026-05-18T02:22: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"},"paper":{"abstract_excerpt":"A perfect matching in a 3-uniform hypergraph on $n=3k$ vertices is a subset of $\\frac{n}{3}$ disjoint edges. We prove that if $H$ is a 3-uniform hypergraph on $n=3k$ vertices such that every vertex belongs to at least ${n-1\\choose 2} - {2n/3\\choose 2}+1$ edges then $H$ contains a perfect matching. We give a construction to show that this result is best possible.","authors_text":"Imdadullah Khan","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-01-30T23:05:17Z","title":"Perfect matching in 3-uniform hypergraphs with large vertex degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.5830","kind":"arxiv","version":3},"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:1477484bc5a12d2cb51b673a05d824b6a1859ba52f895b2d6708f653873ebd54","target":"record","created_at":"2026-05-18T02:22: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":"70e8950af0709756ffdc6da61968a53e18c464670e06fcea7164eb3b3a2f73ea","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-01-30T23:05:17Z","title_canon_sha256":"8121f227d28f378155985946de6ceb7a9ab0c34ce7feaa9eec96b7e8de615a4d"},"schema_version":"1.0","source":{"id":"1101.5830","kind":"arxiv","version":3}},"canonical_sha256":"5b4e66fc515528da94be841648644220ce9bf03074295c4d2021f983489bc049","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b4e66fc515528da94be841648644220ce9bf03074295c4d2021f983489bc049","first_computed_at":"2026-05-18T02:22:41.902896Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:41.902896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DNgd1S/nwfrvDI7hISGmAq+p8OO7CvP4TD8dw8rcDcFAyZ6Y54UIxbvYXaC1+MTC+KyXygocdU2z6sF2euSSAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:41.903455Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.5830","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1477484bc5a12d2cb51b673a05d824b6a1859ba52f895b2d6708f653873ebd54","sha256:e36e7104c64ed3b7581c266f98e0e7d2975911d755af2a6f730205a66384b26d"],"state_sha256":"dc7303bd5c32a7f94d546386b10de93cc30bf7717325ced6db620f22f4d7bef2"}