{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:PXWFN7CYCGUP56FGYALY5RGPPQ","short_pith_number":"pith:PXWFN7CY","schema_version":"1.0","canonical_sha256":"7dec56fc5811a8fef8a6c0178ec4cf7c15b43ffe4289aae34044acb3047f483a","source":{"kind":"arxiv","id":"2602.19230","version":2},"attestation_state":"computed","paper":{"title":"Towards the Erd\\H{o}s matching conjecture for 4-uniform hypergraphs: stability and applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hongliang Lu, Jie Ma, Peter Frankl, Yuze Wu","submitted_at":"2026-02-22T15:21:47Z","abstract_excerpt":"A famous conjecture of Erd\\H{o}s asserts that for $k\\ge 3$, the maximum number of edges in an $n$-vertex $k$-uniform hypergraph without $s+1$ pairwise disjoint edges is $\\max\\{\\binom{n}{k}-\\binom{n-s}{k},\\binom{sk+k-1}{k}\\}$. This problem has been central in extremal combinatorics, with substantial progress in the literature, including a complete solution for $k=3$ due to the first author. In this paper, we make progress towards the $4$-uniform case, proving the conjecture for $n\\ge 5s$ and sufficiently large $n$, thereby taking a first step analogous to the $3$-uniform case. The main technica"},"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":"2602.19230","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-02-22T15:21:47Z","cross_cats_sorted":[],"title_canon_sha256":"1810b551868ef57d3bdffb2d307f9527fcea3509c776b8bc383dcac03caaa980","abstract_canon_sha256":"133b102225032447887e5b029e92cd50f38e7253cd13ca7eec908479d63f080f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:09:30.987922Z","signature_b64":"TKypXxFtTozscegHGXAwIcJJtfloXB7h+g9L8aU09v9VuX2UhydJ4Ym/vf5TfMG71o9dN9MQmW7iT3v7/fMnCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7dec56fc5811a8fef8a6c0178ec4cf7c15b43ffe4289aae34044acb3047f483a","last_reissued_at":"2026-06-11T01:09:30.986943Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:09:30.986943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards the Erd\\H{o}s matching conjecture for 4-uniform hypergraphs: stability and applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hongliang Lu, Jie Ma, Peter Frankl, Yuze Wu","submitted_at":"2026-02-22T15:21:47Z","abstract_excerpt":"A famous conjecture of Erd\\H{o}s asserts that for $k\\ge 3$, the maximum number of edges in an $n$-vertex $k$-uniform hypergraph without $s+1$ pairwise disjoint edges is $\\max\\{\\binom{n}{k}-\\binom{n-s}{k},\\binom{sk+k-1}{k}\\}$. This problem has been central in extremal combinatorics, with substantial progress in the literature, including a complete solution for $k=3$ due to the first author. In this paper, we make progress towards the $4$-uniform case, proving the conjecture for $n\\ge 5s$ and sufficiently large $n$, thereby taking a first step analogous to the $3$-uniform case. The main technica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.19230","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2602.19230/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":"2602.19230","created_at":"2026-06-11T01:09:30.987063+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.19230v2","created_at":"2026-06-11T01:09:30.987063+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.19230","created_at":"2026-06-11T01:09:30.987063+00:00"},{"alias_kind":"pith_short_12","alias_value":"PXWFN7CYCGUP","created_at":"2026-06-11T01:09:30.987063+00:00"},{"alias_kind":"pith_short_16","alias_value":"PXWFN7CYCGUP56FG","created_at":"2026-06-11T01:09:30.987063+00:00"},{"alias_kind":"pith_short_8","alias_value":"PXWFN7CY","created_at":"2026-06-11T01:09:30.987063+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/PXWFN7CYCGUP56FGYALY5RGPPQ","json":"https://pith.science/pith/PXWFN7CYCGUP56FGYALY5RGPPQ.json","graph_json":"https://pith.science/api/pith-number/PXWFN7CYCGUP56FGYALY5RGPPQ/graph.json","events_json":"https://pith.science/api/pith-number/PXWFN7CYCGUP56FGYALY5RGPPQ/events.json","paper":"https://pith.science/paper/PXWFN7CY"},"agent_actions":{"view_html":"https://pith.science/pith/PXWFN7CYCGUP56FGYALY5RGPPQ","download_json":"https://pith.science/pith/PXWFN7CYCGUP56FGYALY5RGPPQ.json","view_paper":"https://pith.science/paper/PXWFN7CY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.19230&json=true","fetch_graph":"https://pith.science/api/pith-number/PXWFN7CYCGUP56FGYALY5RGPPQ/graph.json","fetch_events":"https://pith.science/api/pith-number/PXWFN7CYCGUP56FGYALY5RGPPQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PXWFN7CYCGUP56FGYALY5RGPPQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PXWFN7CYCGUP56FGYALY5RGPPQ/action/storage_attestation","attest_author":"https://pith.science/pith/PXWFN7CYCGUP56FGYALY5RGPPQ/action/author_attestation","sign_citation":"https://pith.science/pith/PXWFN7CYCGUP56FGYALY5RGPPQ/action/citation_signature","submit_replication":"https://pith.science/pith/PXWFN7CYCGUP56FGYALY5RGPPQ/action/replication_record"}},"created_at":"2026-06-11T01:09:30.987063+00:00","updated_at":"2026-06-11T01:09:30.987063+00:00"}