{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7GQB2WIK5FUEKOVDJX6GHCMPJQ","short_pith_number":"pith:7GQB2WIK","schema_version":"1.0","canonical_sha256":"f9a01d590ae968453aa34dfc63898f4c15b76422345abed6484bf66ccfd7b4f1","source":{"kind":"arxiv","id":"1507.02362","version":2},"attestation_state":"computed","paper":{"title":"Near Perfect Matchings in $k$-uniform Hypergraphs II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Han","submitted_at":"2015-07-09T03:41:18Z","abstract_excerpt":"Suppose $k\\nmid n$ and $H$ is an $n$-vertex $k$-uniform hypergraph. A near perfect matching in $H$ is a matching of size $\\lfloor n/k\\rfloor$. We give a divisibility barrier construction that prevents the existence of near perfect matchings in $H$. This generalizes the divisibility barrier for perfect matchings. We give a conjecture on the minimum $d$-degree threshold forcing a (near) perfect matching in $H$ which generalizes a well-known conjecture on perfect matchings. We also verify our conjecture in various cases. Our proof makes use of the lattice-based absorbing method that the author us"},"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":"1507.02362","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-09T03:41:18Z","cross_cats_sorted":[],"title_canon_sha256":"d761939832e6ce2db8c0e0a07be956c4c53eb26a9b2e40fd0f6cb93febd9110a","abstract_canon_sha256":"a9ae997b9dad4e58d68cfbc5fb25dc8abef1e2f7c8879f2bf379566d7d3f7fe7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:46.247682Z","signature_b64":"PTdiALZ1DRnYMc5nn9NucCMHI1QGAkVUWLgixniACLPgXUn3jOmvODvZuSif+dL3bconvobT1jQsgQm1sRUwCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9a01d590ae968453aa34dfc63898f4c15b76422345abed6484bf66ccfd7b4f1","last_reissued_at":"2026-05-18T01:00:46.247243Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:46.247243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near Perfect Matchings in $k$-uniform Hypergraphs II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Han","submitted_at":"2015-07-09T03:41:18Z","abstract_excerpt":"Suppose $k\\nmid n$ and $H$ is an $n$-vertex $k$-uniform hypergraph. A near perfect matching in $H$ is a matching of size $\\lfloor n/k\\rfloor$. We give a divisibility barrier construction that prevents the existence of near perfect matchings in $H$. This generalizes the divisibility barrier for perfect matchings. We give a conjecture on the minimum $d$-degree threshold forcing a (near) perfect matching in $H$ which generalizes a well-known conjecture on perfect matchings. We also verify our conjecture in various cases. Our proof makes use of the lattice-based absorbing method that the author us"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02362","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":"1507.02362","created_at":"2026-05-18T01:00:46.247325+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.02362v2","created_at":"2026-05-18T01:00:46.247325+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02362","created_at":"2026-05-18T01:00:46.247325+00:00"},{"alias_kind":"pith_short_12","alias_value":"7GQB2WIK5FUE","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7GQB2WIK5FUEKOVD","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7GQB2WIK","created_at":"2026-05-18T12:29:10.953037+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/7GQB2WIK5FUEKOVDJX6GHCMPJQ","json":"https://pith.science/pith/7GQB2WIK5FUEKOVDJX6GHCMPJQ.json","graph_json":"https://pith.science/api/pith-number/7GQB2WIK5FUEKOVDJX6GHCMPJQ/graph.json","events_json":"https://pith.science/api/pith-number/7GQB2WIK5FUEKOVDJX6GHCMPJQ/events.json","paper":"https://pith.science/paper/7GQB2WIK"},"agent_actions":{"view_html":"https://pith.science/pith/7GQB2WIK5FUEKOVDJX6GHCMPJQ","download_json":"https://pith.science/pith/7GQB2WIK5FUEKOVDJX6GHCMPJQ.json","view_paper":"https://pith.science/paper/7GQB2WIK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.02362&json=true","fetch_graph":"https://pith.science/api/pith-number/7GQB2WIK5FUEKOVDJX6GHCMPJQ/graph.json","fetch_events":"https://pith.science/api/pith-number/7GQB2WIK5FUEKOVDJX6GHCMPJQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7GQB2WIK5FUEKOVDJX6GHCMPJQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7GQB2WIK5FUEKOVDJX6GHCMPJQ/action/storage_attestation","attest_author":"https://pith.science/pith/7GQB2WIK5FUEKOVDJX6GHCMPJQ/action/author_attestation","sign_citation":"https://pith.science/pith/7GQB2WIK5FUEKOVDJX6GHCMPJQ/action/citation_signature","submit_replication":"https://pith.science/pith/7GQB2WIK5FUEKOVDJX6GHCMPJQ/action/replication_record"}},"created_at":"2026-05-18T01:00:46.247325+00:00","updated_at":"2026-05-18T01:00:46.247325+00:00"}