{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YFRHUR4Q74DQTFNXUIUQIKKPXC","short_pith_number":"pith:YFRHUR4Q","schema_version":"1.0","canonical_sha256":"c1627a4790ff070995b7a22904294fb88389d049b5709d5a842c4e61130b9edc","source":{"kind":"arxiv","id":"2605.26060","version":1},"attestation_state":"computed","paper":{"title":"A finite-board reduction for the Erd\\H{o}s Matching Conjecture and the 4-uniform case via exact certificates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Caiyun Hu, Jianfeng Hou, Xizhi Liu","submitted_at":"2026-05-25T17:19:09Z","abstract_excerpt":"We prove the 4-uniform Erd\\H{o}s Matching Conjecture for every matching number $s\\ge 6961$. The proof has two parts. First, building on ideas from Frankl--R\\\"odl--Ruci\\'nski, we formulate a general finite-board criterion for the $r$-uniform conjecture. The criterion has two assumptions: the $(r-1)$-uniform cover-side bound for links with matching number at most $t$ holds at every $m\\ge n_r(t)$, and a finite optimization problem for mixed-size trace configurations on an $(r^2+r-1)$-vertex board. Together with the corresponding lower-uniformity input, this finite-board optimization implies the E"},"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":"2605.26060","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-25T17:19:09Z","cross_cats_sorted":[],"title_canon_sha256":"db0ceea3a7755ca630ea6b6fc95350efd0e04da7cc7a4dbe883d5f51174268f8","abstract_canon_sha256":"127253c0c5363a5f90a977b9918dfba7c79780f2c8ccb9604d18d4d7e19cc069"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:05:25.293563Z","signature_b64":"RiaEDkGFklm0iwx1V+QO9X1nbRdmP+VzEKa3T68hhp5AUgB3FCcQpnJW23/TUyElirDwLnfU9+pBA9nm8HL4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1627a4790ff070995b7a22904294fb88389d049b5709d5a842c4e61130b9edc","last_reissued_at":"2026-05-26T02:05:25.292908Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:05:25.292908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A finite-board reduction for the Erd\\H{o}s Matching Conjecture and the 4-uniform case via exact certificates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Caiyun Hu, Jianfeng Hou, Xizhi Liu","submitted_at":"2026-05-25T17:19:09Z","abstract_excerpt":"We prove the 4-uniform Erd\\H{o}s Matching Conjecture for every matching number $s\\ge 6961$. The proof has two parts. First, building on ideas from Frankl--R\\\"odl--Ruci\\'nski, we formulate a general finite-board criterion for the $r$-uniform conjecture. The criterion has two assumptions: the $(r-1)$-uniform cover-side bound for links with matching number at most $t$ holds at every $m\\ge n_r(t)$, and a finite optimization problem for mixed-size trace configurations on an $(r^2+r-1)$-vertex board. Together with the corresponding lower-uniformity input, this finite-board optimization implies the E"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.26060","kind":"arxiv","version":1},"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/2605.26060/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":"2605.26060","created_at":"2026-05-26T02:05:25.293009+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.26060v1","created_at":"2026-05-26T02:05:25.293009+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.26060","created_at":"2026-05-26T02:05:25.293009+00:00"},{"alias_kind":"pith_short_12","alias_value":"YFRHUR4Q74DQ","created_at":"2026-05-26T02:05:25.293009+00:00"},{"alias_kind":"pith_short_16","alias_value":"YFRHUR4Q74DQTFNX","created_at":"2026-05-26T02:05:25.293009+00:00"},{"alias_kind":"pith_short_8","alias_value":"YFRHUR4Q","created_at":"2026-05-26T02:05:25.293009+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/YFRHUR4Q74DQTFNXUIUQIKKPXC","json":"https://pith.science/pith/YFRHUR4Q74DQTFNXUIUQIKKPXC.json","graph_json":"https://pith.science/api/pith-number/YFRHUR4Q74DQTFNXUIUQIKKPXC/graph.json","events_json":"https://pith.science/api/pith-number/YFRHUR4Q74DQTFNXUIUQIKKPXC/events.json","paper":"https://pith.science/paper/YFRHUR4Q"},"agent_actions":{"view_html":"https://pith.science/pith/YFRHUR4Q74DQTFNXUIUQIKKPXC","download_json":"https://pith.science/pith/YFRHUR4Q74DQTFNXUIUQIKKPXC.json","view_paper":"https://pith.science/paper/YFRHUR4Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.26060&json=true","fetch_graph":"https://pith.science/api/pith-number/YFRHUR4Q74DQTFNXUIUQIKKPXC/graph.json","fetch_events":"https://pith.science/api/pith-number/YFRHUR4Q74DQTFNXUIUQIKKPXC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YFRHUR4Q74DQTFNXUIUQIKKPXC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YFRHUR4Q74DQTFNXUIUQIKKPXC/action/storage_attestation","attest_author":"https://pith.science/pith/YFRHUR4Q74DQTFNXUIUQIKKPXC/action/author_attestation","sign_citation":"https://pith.science/pith/YFRHUR4Q74DQTFNXUIUQIKKPXC/action/citation_signature","submit_replication":"https://pith.science/pith/YFRHUR4Q74DQTFNXUIUQIKKPXC/action/replication_record"}},"created_at":"2026-05-26T02:05:25.293009+00:00","updated_at":"2026-05-26T02:05:25.293009+00:00"}