{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:GLQP66DKZJFZ4NV3G67VGRLSHH","short_pith_number":"pith:GLQP66DK","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"},"canonical_sha256":"32e0ff786aca4b9e36bb37bf53457239fbb89a320d0bc11351b2fac0b1cd53c6","source":{"kind":"arxiv","id":"2001.02820","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.02820","created_at":"2026-07-05T04:58:51Z"},{"alias_kind":"arxiv_version","alias_value":"2001.02820v4","created_at":"2026-07-05T04:58:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.02820","created_at":"2026-07-05T04:58:51Z"},{"alias_kind":"pith_short_12","alias_value":"GLQP66DKZJFZ","created_at":"2026-07-05T04:58:51Z"},{"alias_kind":"pith_short_16","alias_value":"GLQP66DKZJFZ4NV3","created_at":"2026-07-05T04:58:51Z"},{"alias_kind":"pith_short_8","alias_value":"GLQP66DK","created_at":"2026-07-05T04:58:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:GLQP66DKZJFZ4NV3G67VGRLSHH","target":"record","payload":{"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"},"canonical_sha256":"32e0ff786aca4b9e36bb37bf53457239fbb89a320d0bc11351b2fac0b1cd53c6","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"},"source_kind":"arxiv","source_id":"2001.02820","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:58:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ovUN/IiMAoba1JKogF7EaMdYTdVOYL5BE/lB5KI3yc3i+Qd/b/ojb8dvapWcdpU8hWVXkSh17GcQtFlcIpjODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-26T14:13:15.065961Z"},"content_sha256":"53f3056aa65e7eae6da63754e549d2b5a536d03399f8ce4098ee413c550c11ad","schema_version":"1.0","event_id":"sha256:53f3056aa65e7eae6da63754e549d2b5a536d03399f8ce4098ee413c550c11ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:GLQP66DKZJFZ4NV3G67VGRLSHH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:58:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nZIPV4Vs+mKVZhjbzElR1tvIpr9yxr6KBUegZG6o4AKOUG5xySWjb0RC8Thv0SkiZDDG2JW4QZ4/KWUEkCJIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-26T14:13:15.066356Z"},"content_sha256":"11f21920fd7b2fc17438b9db845e7c30050455958a10fb6faf7c09ba1df7c987","schema_version":"1.0","event_id":"sha256:11f21920fd7b2fc17438b9db845e7c30050455958a10fb6faf7c09ba1df7c987"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GLQP66DKZJFZ4NV3G67VGRLSHH/bundle.json","state_url":"https://pith.science/pith/GLQP66DKZJFZ4NV3G67VGRLSHH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GLQP66DKZJFZ4NV3G67VGRLSHH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-26T14:13:15Z","links":{"resolver":"https://pith.science/pith/GLQP66DKZJFZ4NV3G67VGRLSHH","bundle":"https://pith.science/pith/GLQP66DKZJFZ4NV3G67VGRLSHH/bundle.json","state":"https://pith.science/pith/GLQP66DKZJFZ4NV3G67VGRLSHH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GLQP66DKZJFZ4NV3G67VGRLSHH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:GLQP66DKZJFZ4NV3G67VGRLSHH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0c63e97ec524c7ce7657ac7534bc78e471d9d7ef857696274eb894a32da3f171","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-01-09T03:09:38Z","title_canon_sha256":"3ccea22fc227bdb18ef2b3f938fa5efac081dde7d2c4b47c88f6f1000fc70d43"},"schema_version":"1.0","source":{"id":"2001.02820","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.02820","created_at":"2026-07-05T04:58:51Z"},{"alias_kind":"arxiv_version","alias_value":"2001.02820v4","created_at":"2026-07-05T04:58:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.02820","created_at":"2026-07-05T04:58:51Z"},{"alias_kind":"pith_short_12","alias_value":"GLQP66DKZJFZ","created_at":"2026-07-05T04:58:51Z"},{"alias_kind":"pith_short_16","alias_value":"GLQP66DKZJFZ4NV3","created_at":"2026-07-05T04:58:51Z"},{"alias_kind":"pith_short_8","alias_value":"GLQP66DK","created_at":"2026-07-05T04:58:51Z"}],"graph_snapshots":[{"event_id":"sha256:11f21920fd7b2fc17438b9db845e7c30050455958a10fb6faf7c09ba1df7c987","target":"graph","created_at":"2026-07-05T04:58:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2001.02820/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Hongliang Lu, Mingyang Guo, Yaolin Jiang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-01-09T03:09:38Z","title":"Improved Bound on Vertex Degree Version of Erd\\H{o}s Matching Conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.02820","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:53f3056aa65e7eae6da63754e549d2b5a536d03399f8ce4098ee413c550c11ad","target":"record","created_at":"2026-07-05T04:58:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0c63e97ec524c7ce7657ac7534bc78e471d9d7ef857696274eb894a32da3f171","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-01-09T03:09:38Z","title_canon_sha256":"3ccea22fc227bdb18ef2b3f938fa5efac081dde7d2c4b47c88f6f1000fc70d43"},"schema_version":"1.0","source":{"id":"2001.02820","kind":"arxiv","version":4}},"canonical_sha256":"32e0ff786aca4b9e36bb37bf53457239fbb89a320d0bc11351b2fac0b1cd53c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32e0ff786aca4b9e36bb37bf53457239fbb89a320d0bc11351b2fac0b1cd53c6","first_computed_at":"2026-07-05T04:58:51.503699Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:58:51.503699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yJOcJqxlhvcVX/IFvqqB3AtHIAeIPhag/SlUnXeA8NqUl4oRobabqjmDryINIpFbPJ1fZzAMYom7o7Ngxd2pCA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:58:51.504139Z","signed_message":"canonical_sha256_bytes"},"source_id":"2001.02820","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53f3056aa65e7eae6da63754e549d2b5a536d03399f8ce4098ee413c550c11ad","sha256:11f21920fd7b2fc17438b9db845e7c30050455958a10fb6faf7c09ba1df7c987"],"state_sha256":"018820ed75ba56877febaef1468965a81c5ec37ced3108e7f678aa4349cb6924"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UXyvqA74T2NAX/gOGLoeFABLzKrBafXrmXDWCT8YOSeVneoDA9MzAe8kjelgfSA+0YCnLUWGGUiXh0DkPPRXDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-26T14:13:15.069405Z","bundle_sha256":"b095894b4286d5629a3958619823aaa12ce1220c84e000b99a57a002f91cfa0a"}}