{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:LNHGN7CRKUUNVFF6QQLEQZCCED","short_pith_number":"pith:LNHGN7CR","schema_version":"1.0","canonical_sha256":"5b4e66fc515528da94be841648644220ce9bf03074295c4d2021f983489bc049","source":{"kind":"arxiv","id":"1101.5830","version":3},"attestation_state":"computed","paper":{"title":"Perfect matching in 3-uniform hypergraphs with large vertex degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Imdadullah Khan","submitted_at":"2011-01-30T23:05:17Z","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."},"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":"1101.5830","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-01-30T23:05:17Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8121f227d28f378155985946de6ceb7a9ab0c34ce7feaa9eec96b7e8de615a4d","abstract_canon_sha256":"70e8950af0709756ffdc6da61968a53e18c464670e06fcea7164eb3b3a2f73ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:41.903455Z","signature_b64":"DNgd1S/nwfrvDI7hISGmAq+p8OO7CvP4TD8dw8rcDcFAyZ6Y54UIxbvYXaC1+MTC+KyXygocdU2z6sF2euSSAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b4e66fc515528da94be841648644220ce9bf03074295c4d2021f983489bc049","last_reissued_at":"2026-05-18T02:22:41.902896Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:41.902896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfect matching in 3-uniform hypergraphs with large vertex degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Imdadullah Khan","submitted_at":"2011-01-30T23:05:17Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.5830","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1101.5830","created_at":"2026-05-18T02:22:41.902982+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.5830v3","created_at":"2026-05-18T02:22:41.902982+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.5830","created_at":"2026-05-18T02:22:41.902982+00:00"},{"alias_kind":"pith_short_12","alias_value":"LNHGN7CRKUUN","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"LNHGN7CRKUUNVFF6","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"LNHGN7CR","created_at":"2026-05-18T12:26:34.985390+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/LNHGN7CRKUUNVFF6QQLEQZCCED","json":"https://pith.science/pith/LNHGN7CRKUUNVFF6QQLEQZCCED.json","graph_json":"https://pith.science/api/pith-number/LNHGN7CRKUUNVFF6QQLEQZCCED/graph.json","events_json":"https://pith.science/api/pith-number/LNHGN7CRKUUNVFF6QQLEQZCCED/events.json","paper":"https://pith.science/paper/LNHGN7CR"},"agent_actions":{"view_html":"https://pith.science/pith/LNHGN7CRKUUNVFF6QQLEQZCCED","download_json":"https://pith.science/pith/LNHGN7CRKUUNVFF6QQLEQZCCED.json","view_paper":"https://pith.science/paper/LNHGN7CR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.5830&json=true","fetch_graph":"https://pith.science/api/pith-number/LNHGN7CRKUUNVFF6QQLEQZCCED/graph.json","fetch_events":"https://pith.science/api/pith-number/LNHGN7CRKUUNVFF6QQLEQZCCED/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LNHGN7CRKUUNVFF6QQLEQZCCED/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LNHGN7CRKUUNVFF6QQLEQZCCED/action/storage_attestation","attest_author":"https://pith.science/pith/LNHGN7CRKUUNVFF6QQLEQZCCED/action/author_attestation","sign_citation":"https://pith.science/pith/LNHGN7CRKUUNVFF6QQLEQZCCED/action/citation_signature","submit_replication":"https://pith.science/pith/LNHGN7CRKUUNVFF6QQLEQZCCED/action/replication_record"}},"created_at":"2026-05-18T02:22:41.902982+00:00","updated_at":"2026-05-18T02:22:41.902982+00:00"}