{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TQ762R3BCHY6PGGV5O7QOKMICN","short_pith_number":"pith:TQ762R3B","schema_version":"1.0","canonical_sha256":"9c3fed476111f1e798d5ebbf07298813674c6bf15837ff592a71ff48f1a4682f","source":{"kind":"arxiv","id":"1705.00990","version":2},"attestation_state":"computed","paper":{"title":"On Perfect Matchings and tilings in uniform Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Han","submitted_at":"2017-05-02T14:18:23Z","abstract_excerpt":"In this paper we study some variants of Dirac-type problems in hypergraphs. First, we show that for $k\\ge 3$, if $H$ is a $k$-graph on $n\\in k\\mathbb N$ vertices with independence number at most $n/p$ and minimum codegree at least $(1/p+o(1))n$, where $p$ is the smallest prime factor of $k$, then $H$ contains a perfect matching. Second, we show that if $H$ is a $3$-graph on $n\\in 3\\mathbb N$ vertices which does not contain any induced copy of $K_4^-$ (the unique $3$-graph with $4$ vertices and $3$ edges) and has minimum codegree at least $(1/3+o(1)))n$, then $H$ contains a perfect matching. Mo"},"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":"1705.00990","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-02T14:18:23Z","cross_cats_sorted":[],"title_canon_sha256":"f43081d14f6574d704474a776e48dd421c6750b3c7860e29f4f1d506680e5558","abstract_canon_sha256":"7f9fa5d1cd408dc8a3cadce1cfdd355e78cd91043f8d637cd9a0b680268b9a44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:08.972856Z","signature_b64":"rU5jCAMvbOjOs3Mv1yCXFOm3TJgLfYf36TXXbPGpNQO2Yj95w7vJe+FpGIxcXlsS3suySlSimJfnWTel4oSPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c3fed476111f1e798d5ebbf07298813674c6bf15837ff592a71ff48f1a4682f","last_reissued_at":"2026-05-18T00:23:08.972202Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:08.972202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Perfect Matchings and tilings in uniform Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Han","submitted_at":"2017-05-02T14:18:23Z","abstract_excerpt":"In this paper we study some variants of Dirac-type problems in hypergraphs. First, we show that for $k\\ge 3$, if $H$ is a $k$-graph on $n\\in k\\mathbb N$ vertices with independence number at most $n/p$ and minimum codegree at least $(1/p+o(1))n$, where $p$ is the smallest prime factor of $k$, then $H$ contains a perfect matching. Second, we show that if $H$ is a $3$-graph on $n\\in 3\\mathbb N$ vertices which does not contain any induced copy of $K_4^-$ (the unique $3$-graph with $4$ vertices and $3$ edges) and has minimum codegree at least $(1/3+o(1)))n$, then $H$ contains a perfect matching. Mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00990","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.00990","created_at":"2026-05-18T00:23:08.972300+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.00990v2","created_at":"2026-05-18T00:23:08.972300+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00990","created_at":"2026-05-18T00:23:08.972300+00:00"},{"alias_kind":"pith_short_12","alias_value":"TQ762R3BCHY6","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TQ762R3BCHY6PGGV","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TQ762R3B","created_at":"2026-05-18T12:31:46.661854+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/TQ762R3BCHY6PGGV5O7QOKMICN","json":"https://pith.science/pith/TQ762R3BCHY6PGGV5O7QOKMICN.json","graph_json":"https://pith.science/api/pith-number/TQ762R3BCHY6PGGV5O7QOKMICN/graph.json","events_json":"https://pith.science/api/pith-number/TQ762R3BCHY6PGGV5O7QOKMICN/events.json","paper":"https://pith.science/paper/TQ762R3B"},"agent_actions":{"view_html":"https://pith.science/pith/TQ762R3BCHY6PGGV5O7QOKMICN","download_json":"https://pith.science/pith/TQ762R3BCHY6PGGV5O7QOKMICN.json","view_paper":"https://pith.science/paper/TQ762R3B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.00990&json=true","fetch_graph":"https://pith.science/api/pith-number/TQ762R3BCHY6PGGV5O7QOKMICN/graph.json","fetch_events":"https://pith.science/api/pith-number/TQ762R3BCHY6PGGV5O7QOKMICN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TQ762R3BCHY6PGGV5O7QOKMICN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TQ762R3BCHY6PGGV5O7QOKMICN/action/storage_attestation","attest_author":"https://pith.science/pith/TQ762R3BCHY6PGGV5O7QOKMICN/action/author_attestation","sign_citation":"https://pith.science/pith/TQ762R3BCHY6PGGV5O7QOKMICN/action/citation_signature","submit_replication":"https://pith.science/pith/TQ762R3BCHY6PGGV5O7QOKMICN/action/replication_record"}},"created_at":"2026-05-18T00:23:08.972300+00:00","updated_at":"2026-05-18T00:23:08.972300+00:00"}