{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4WJJ6ADHYKKUHPHHVN3EQF7NFV","short_pith_number":"pith:4WJJ6ADH","schema_version":"1.0","canonical_sha256":"e5929f0067c29543bce7ab764817ed2d7f0d3574bcb4fd652233d896a296c84c","source":{"kind":"arxiv","id":"1503.03357","version":3},"attestation_state":"computed","paper":{"title":"A note on perfect matchings in uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Treglown, Yi Zhao","submitted_at":"2015-03-11T14:51:59Z","abstract_excerpt":"We determine the \\emph{exact} minimum $\\ell$-degree threshold for perfect matchings in $k$-uniform hypergraphs when the corresponding threshold for perfect fractional matchings is significantly less than $\\frac{1}{2} \\binom{n}{k- \\ell}$. This extends our previous results that determine the minimum $\\ell$-degree thresholds for perfect matchings in $k$-uniform hypergraphs for all $\\ell\\ge k/2$ and provides two new (exact) thresholds: $(k,\\ell)=(5,2)$ and $(7,3)$."},"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":"1503.03357","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-11T14:51:59Z","cross_cats_sorted":[],"title_canon_sha256":"f4ebb3ffe6996db1c32669bfdf43e0b6d9a5f006746bbe3b2e07b4902fe5ed62","abstract_canon_sha256":"55ef436c33dfb4b332e14a12003ce8ff1034f742c14b317fb9930deb7271adcb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:04.169684Z","signature_b64":"fEpBK1er5myQFmMuX4NngCs4mGFm6ayR9l2VvNhN1UC4EFKIgwpFD4o9iID4j9Px4vzvcwIIP8DKNjGpkAyMCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5929f0067c29543bce7ab764817ed2d7f0d3574bcb4fd652233d896a296c84c","last_reissued_at":"2026-05-18T01:23:04.168961Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:04.168961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on perfect matchings in uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Treglown, Yi Zhao","submitted_at":"2015-03-11T14:51:59Z","abstract_excerpt":"We determine the \\emph{exact} minimum $\\ell$-degree threshold for perfect matchings in $k$-uniform hypergraphs when the corresponding threshold for perfect fractional matchings is significantly less than $\\frac{1}{2} \\binom{n}{k- \\ell}$. This extends our previous results that determine the minimum $\\ell$-degree thresholds for perfect matchings in $k$-uniform hypergraphs for all $\\ell\\ge k/2$ and provides two new (exact) thresholds: $(k,\\ell)=(5,2)$ and $(7,3)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03357","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":"1503.03357","created_at":"2026-05-18T01:23:04.169074+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.03357v3","created_at":"2026-05-18T01:23:04.169074+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03357","created_at":"2026-05-18T01:23:04.169074+00:00"},{"alias_kind":"pith_short_12","alias_value":"4WJJ6ADHYKKU","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4WJJ6ADHYKKUHPHH","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4WJJ6ADH","created_at":"2026-05-18T12:29:05.191682+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/4WJJ6ADHYKKUHPHHVN3EQF7NFV","json":"https://pith.science/pith/4WJJ6ADHYKKUHPHHVN3EQF7NFV.json","graph_json":"https://pith.science/api/pith-number/4WJJ6ADHYKKUHPHHVN3EQF7NFV/graph.json","events_json":"https://pith.science/api/pith-number/4WJJ6ADHYKKUHPHHVN3EQF7NFV/events.json","paper":"https://pith.science/paper/4WJJ6ADH"},"agent_actions":{"view_html":"https://pith.science/pith/4WJJ6ADHYKKUHPHHVN3EQF7NFV","download_json":"https://pith.science/pith/4WJJ6ADHYKKUHPHHVN3EQF7NFV.json","view_paper":"https://pith.science/paper/4WJJ6ADH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.03357&json=true","fetch_graph":"https://pith.science/api/pith-number/4WJJ6ADHYKKUHPHHVN3EQF7NFV/graph.json","fetch_events":"https://pith.science/api/pith-number/4WJJ6ADHYKKUHPHHVN3EQF7NFV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4WJJ6ADHYKKUHPHHVN3EQF7NFV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4WJJ6ADHYKKUHPHHVN3EQF7NFV/action/storage_attestation","attest_author":"https://pith.science/pith/4WJJ6ADHYKKUHPHHVN3EQF7NFV/action/author_attestation","sign_citation":"https://pith.science/pith/4WJJ6ADHYKKUHPHHVN3EQF7NFV/action/citation_signature","submit_replication":"https://pith.science/pith/4WJJ6ADHYKKUHPHHVN3EQF7NFV/action/replication_record"}},"created_at":"2026-05-18T01:23:04.169074+00:00","updated_at":"2026-05-18T01:23:04.169074+00:00"}