{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:GLQP66DKZJFZ4NV3G67VGRLSHH","short_pith_number":"pith:GLQP66DK","schema_version":"1.0","canonical_sha256":"32e0ff786aca4b9e36bb37bf53457239fbb89a320d0bc11351b2fac0b1cd53c6","source":{"kind":"arxiv","id":"2001.02820","version":4},"attestation_state":"computed","paper":{"title":"Improved Bound on Vertex Degree Version of Erd\\H{o}s Matching Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hongliang Lu, Mingyang Guo, Yaolin Jiang","submitted_at":"2020-01-09T03:09:38Z","abstract_excerpt":"For a $k$-uniform hypergraph $H$, let $\\delta_1(H)$ denote the minimum vertex degree of $H$, and $\\nu(H)$ denote the size of the largest matching in $H$. In this paper, we show that for any $k\\geq 3$ and $\\beta>0$, there exists an integer $n_0(\\beta,k)$ such that for positive integers $n\\geq n_0$ and $m\\leq (\\frac{k}{2(k-1)}-\\beta)\\frac{n}{k}$, if $H$ is an $n$-vertex $k$-graph with $\\delta_1(H)>{{n-1}\\choose {k-1}}-{{n-m}\\choose {k-1}},$ then $\\nu(H)\\geq m$. This improves upon earlier results of Bollob\\'{a}s, Daykin and Erd\\H{o}s (1976) for the range $n> 2k^3(m+1)$ and Huang and Zhao (2017) f"},"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":"2001.02820","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-01-09T03:09:38Z","cross_cats_sorted":[],"title_canon_sha256":"3ccea22fc227bdb18ef2b3f938fa5efac081dde7d2c4b47c88f6f1000fc70d43","abstract_canon_sha256":"0c63e97ec524c7ce7657ac7534bc78e471d9d7ef857696274eb894a32da3f171"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:58:51.504139Z","signature_b64":"yJOcJqxlhvcVX/IFvqqB3AtHIAeIPhag/SlUnXeA8NqUl4oRobabqjmDryINIpFbPJ1fZzAMYom7o7Ngxd2pCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32e0ff786aca4b9e36bb37bf53457239fbb89a320d0bc11351b2fac0b1cd53c6","last_reissued_at":"2026-07-05T04:58:51.503699Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:58:51.503699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Bound on Vertex Degree Version of Erd\\H{o}s Matching Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hongliang Lu, Mingyang Guo, Yaolin Jiang","submitted_at":"2020-01-09T03:09:38Z","abstract_excerpt":"For a $k$-uniform hypergraph $H$, let $\\delta_1(H)$ denote the minimum vertex degree of $H$, and $\\nu(H)$ denote the size of the largest matching in $H$. In this paper, we show that for any $k\\geq 3$ and $\\beta>0$, there exists an integer $n_0(\\beta,k)$ such that for positive integers $n\\geq n_0$ and $m\\leq (\\frac{k}{2(k-1)}-\\beta)\\frac{n}{k}$, if $H$ is an $n$-vertex $k$-graph with $\\delta_1(H)>{{n-1}\\choose {k-1}}-{{n-m}\\choose {k-1}},$ then $\\nu(H)\\geq m$. This improves upon earlier results of Bollob\\'{a}s, Daykin and Erd\\H{o}s (1976) for the range $n> 2k^3(m+1)$ and Huang and Zhao (2017) f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.02820","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2001.02820/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2001.02820","created_at":"2026-07-05T04:58:51.503761+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.02820v4","created_at":"2026-07-05T04:58:51.503761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.02820","created_at":"2026-07-05T04:58:51.503761+00:00"},{"alias_kind":"pith_short_12","alias_value":"GLQP66DKZJFZ","created_at":"2026-07-05T04:58:51.503761+00:00"},{"alias_kind":"pith_short_16","alias_value":"GLQP66DKZJFZ4NV3","created_at":"2026-07-05T04:58:51.503761+00:00"},{"alias_kind":"pith_short_8","alias_value":"GLQP66DK","created_at":"2026-07-05T04:58:51.503761+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/GLQP66DKZJFZ4NV3G67VGRLSHH","json":"https://pith.science/pith/GLQP66DKZJFZ4NV3G67VGRLSHH.json","graph_json":"https://pith.science/api/pith-number/GLQP66DKZJFZ4NV3G67VGRLSHH/graph.json","events_json":"https://pith.science/api/pith-number/GLQP66DKZJFZ4NV3G67VGRLSHH/events.json","paper":"https://pith.science/paper/GLQP66DK"},"agent_actions":{"view_html":"https://pith.science/pith/GLQP66DKZJFZ4NV3G67VGRLSHH","download_json":"https://pith.science/pith/GLQP66DKZJFZ4NV3G67VGRLSHH.json","view_paper":"https://pith.science/paper/GLQP66DK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.02820&json=true","fetch_graph":"https://pith.science/api/pith-number/GLQP66DKZJFZ4NV3G67VGRLSHH/graph.json","fetch_events":"https://pith.science/api/pith-number/GLQP66DKZJFZ4NV3G67VGRLSHH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GLQP66DKZJFZ4NV3G67VGRLSHH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GLQP66DKZJFZ4NV3G67VGRLSHH/action/storage_attestation","attest_author":"https://pith.science/pith/GLQP66DKZJFZ4NV3G67VGRLSHH/action/author_attestation","sign_citation":"https://pith.science/pith/GLQP66DKZJFZ4NV3G67VGRLSHH/action/citation_signature","submit_replication":"https://pith.science/pith/GLQP66DKZJFZ4NV3G67VGRLSHH/action/replication_record"}},"created_at":"2026-07-05T04:58:51.503761+00:00","updated_at":"2026-07-05T04:58:51.503761+00:00"}